Options II, Honour School of Mathematics; Friday 25 June 2004, 2.30pm–5.30pm. The complete thirteen-page source was supplied in the disclosed past-papers archive, member “FOI-20210708-1 - Data/4304 (9).pdf”, through the original request. A full editable source transcription is held privately. No exact worked-answer advertisement was found in the bounded availability check.
The permutation inverse is : applying the two maps successively sends to . With the paper's right-action convention, permutation products also act on the right, andThus . If function composition is written on the left instead, the same right action is represented by ; keeping these conventions consistent avoids an artificial reversal. The kernel consists precisely of elements fixing every point, so
The rotational tetrahedral group acts transitively on its four vertices. A rotation fixing a vertex must preserve its opposite face and rotate its three vertices cyclically; its stabilizer has order three. The orbit-stabilizer theorem gives . The rotations are the identity, two nontrivial rotations about each of the four vertex-to-opposite-face axes, and a half-turn about each of the three opposite-edge-midpoint axes. Therefore the counts by element order areA rotation fixing all vertices fixes three linearly independent vertex vectors and is the identity. The vertex permutation action is therefore faithful. The listed rotations induce the identity, 3-cycles and double transpositions, all even permutations. Its injective image has order 12, the full order of . Hence .
Take and let be the residue class of . Division with remainder represents every class by a polynomial of degree less than , so every element is a polynomial in and . A nonzero class represented by has because is irreducible. Bézout's identity gives , making the class of its inverse. Thus is a field, containing through its constant classes.
A splitting field of a nonconstant polynomial is an extension in which it factors into linear factors and which is generated over the original field by its roots. To construct one, choose an irreducible factor and use the preceding quotient construction to adjoin a root. Divide off a linear factor in that extension and repeat on the remaining polynomial. Each stage lowers the remaining degree, so finitely many stages suffice. The field generated by all roots in the resulting field is the required splitting field. This induction works with repeated roots and does not assume separability. The two roman clauses in the source specify properties of this one construction; they are not separate questions.
The roots are , so one root already supplies both. The polynomial has no rational root and is irreducible of degree two. Thus its splitting field is , with .
Put and . The three roots are , so the splitting field is . Eisenstein's criterion at two gives . This intermediate field is real, while is not real, and satisfies . Its degree over the intermediate field is therefore exactly two. By the tower law, .
Over ,The quadratic discriminant is , while the squares modulo five are . Thus that factor is irreducible. Adjoining either quadratic root creates a degree-two extension and supplies the other root by the sum-of-roots relation. Consequently the splitting field is and .
The Legendre symbol isThe distinction between the zero class and a nonzero quadratic residue is essential.
Euler's criterion statesFor the right side is or . The displayed congruence also holds for , since is odd and the exponent is positive.
For distinct odd primes,Equivalently the two Legendre symbols agree unless both primes are three modulo four, in which case their signs are opposite. Neither symbol is zero here.
Quadratic reciprocity with the prime three givesThe latter symbol is when and when . A prime greater than three occupies one of the classes modulo twelve. Combining its residues modulo three and four gives signs respectively. Hence
For , the exponent is positive and even. Since for every , it follows thatHere the natural-number indexing must start at one. If zero is included in that convention, is an exception to the printed assertion and must be excluded.
Let be prime with . The preceding parts give , so Euler's criterion implies . The multiplicative order of three divides . Every proper divisor of this power of two divides . If were proper, that half-power would be one, a contradiction. Thereforewhich means precisely that three is a primitive root modulo .
The monotone convergence theorem says that if almost everywhere on a measure space, then , allowing infinity. The dominated convergence theorem says that if almost everywhere and for an integrable , then is integrable and .
For , the truncated functions increase to . Each has the elementary integral . Thus monotone convergence givesFor fixed , eventually and , so . Inside the support the supplied inequality yields . Outside the support . Consequently the global bound isand this majorant is integrable by the already proved formula with . Dominated convergence now gives . The majorant is independent of , including on the moving support.
Lebesgue measurability of means that is a Lebesgue measurable subset of for every open subset . Equivalently one can check all sets with real .
There are two conventions for a step function on the whole real line. Under the bounded-support integration convention it is a finite linear combination of indicators of bounded intervals; under the unrestricted piecewise-constant convention nonzero constant tails are allowed. The conclusions below state both conventions explicitly, since only the first assertion depends on this choice.
Under the bounded-support convention, false in general, true if . For the first claim, take and : the composition is one on all of , and cannot have bounded support. For the second, refine the finitely many defining intervals into disjoint intervals on which is constant. The composition is constant on each of them and vanishes outside their bounded union because . Hence it is another step function.
Under the unrestricted piecewise-constant convention, true in both cases: composition with any function preserves constancy on the same partition, including its unbounded cells. This also applies to the broader measurable-partition convention. Continuity of is not needed for this particular assertion.
False in both cases. Without the zero-at-zero condition, and already give an integrable input and a non-integrable composition on .
Even imposing does not control how fast approaches zero. Take and the continuous function . The input has integral , buthas a divergent integral, because its tails are comparable to . Thus continuity at zero is weaker than the linear growth estimate that would preserve integrability.
True in both cases. For every open , continuity of makes open. Thenis Lebesgue measurable by measurability of . The value has no bearing on this preimage argument.
A space is Hausdorff if distinct points have disjoint open neighbourhoods. In symbols, for there are open and with .
A space is compact if every open cover has a finite subcover. The finite-intersection formulation says that every family of closed sets with the finite intersection property has nonempty total intersection.
The nested closed sets have the finite intersection property: the intersection of finitely many is the one with the largest index and is nonempty. Compactness gives .
For an open neighbourhood of the intersection, suppose no were contained in . Then would be nested, nonempty and closed. The same argument gives a point in all , contradicting . Hence
For connectedness, suppose were a separation into two nonempty relatively closed sets. Since is compact, are disjoint compact subsets of . The supplied separation fact gives disjoint open neighbourhoods . Their union contains , so some lies in that union. But meets both neighbourhoods, since it contains and . Its intersections with the two neighbourhoods are then a separation, contradicting its connectedness. Thus the nested intersection is connected.
For the quotient map , a subset of the quotient is open exactly when is open in . This definition immediately makes continuous. If is continuous then is continuous. Conversely, continuity of the composition gives, for every open , that is open. By the defining criterion is open, so is continuous.
A map constant on each equivalence class defines a unique map . It is well-defined by the assumed class constancy, and its composition with is . The preceding criterion proves that is continuous.
For the integer lattice quotient, defineThis continuous map is onto the product of the two unit circles, and its fibres are exactly the lattice equivalence classes. It therefore induces a continuous bijection . Every class has a representative in , so the quotient is the continuous image of that compact square and is compact. The target is Hausdorff as a subspace of . A continuous bijection from a compact space to a Hausdorff space is a homeomorphism, provingFinally, if is open, then is open, being a union of translates. The quotient criterion makes open. Thus the quotient map is an open map.
Write the variables as , with . The hypothesis makes invertible. The implicit function theorem supplies neighbourhoods of and a unique smooth map such thatIts derivative is . Thus the derivative of this parametrization has image exactly .
Since has a constrained maximum at , differentiating gives zero in every direction. Therefore vanishes on . In finite-dimensional linear algebra, is the row space of . ConsequentlyThe full-rank hypothesis is what permits this Lagrange multiplier conclusion; it is not a consequence of constrained maximality alone at a singular constraint.
Positive definiteness gives a positive smallest eigenvalue with . Hence the set is compact, and attains a maximum there. Its two constraint gradients are and ; they are linearly independent because are nonzero and is invertible.
Put . At any constrained extremum the multiplier equations areMultiplication by and gives . If the objective is zero. Otherwise , so and normalization gives . Thus every maximum is at most one, and the value one is attained at . This proves on the normalized constraints.
For nonzero arbitrary vectors apply that result to and . If either vector is zero the conclusion is immediate. ThereforeEquality for nonzero vectors holds precisely when they are linearly dependent. This is the Cauchy-Schwarz inequality for the inner product induced by .
For a variation with , stationarity givesThe boundary term vanishes. The fundamental lemma of the calculus of variations therefore gives the Euler-Lagrange equation .
Differentiating the proposed first integral givesThus it is constant along an extremal when , proving the Beltrami identity.
For the positive branch relevant to the endpoint data, . The identity becomesThe Euler-Lagrange equation itself gives , so . Integrating, or solving the first integral, yields a circle . The equal endpoint values force and . Hence the unique positive smooth extremal isIt stays positive on the entire interval and satisfies the second-order equation, including its turning point. Merely differentiating the first integral after dividing by would need extra care there. Geometrically this is an arc of a hyperbolic geodesic in the upper half-plane model.
At fractional position along a straight rigid rod, the velocity is . Uniform mass per unit length givesThe string constraints are and . Their first-order terms give . Their second-order terms then giveThe rod constraint is . Its first-order part is , hence to first order.
The centre of mass rises by . Substituting the quadratic string expansions and the linear relation between the horizontal displacements givesVertical velocities contribute only at fourth order to the energy. Substituting and into the rod energy givesThe decoupled equation is . For the other two coordinates put ; their equations areA normal-mode ansatz gives , whose roots are . The corresponding displacement ratios are . Therefore the three periods are
Set and let have the opposite derivative sign. On the bound-state domain, and . Thus every energy eigenvalue has .
The lowering operator maps an eigenstate of of eigenvalue to one of eigenvalue , with squared norm multiplied by . Repeated lowering cannot pass below zero, so it must terminate at zero. Hence is a nonnegative integer. The equation gives a Gaussian ground state, and repeated raising gives a nonzero square-integrable state for every integer . ThereforeThese are also the Gaussian-times-Hermite-polynomial solutions obtained by the suggested series method.
Put . Normalization gives , soThe expectation of itself is zero by parity; that cancellation does not apply to its absolute value.
Orient the body boundary counterclockwise. Its outward normal vector satisfies , so the pressure force on the body has complex componentFor steady incompressible flow and irrotational flow, Bernoulli's principle gives . The constant-pressure integral vanishes. Write . The impermeability condition makes velocity tangent to , implying . Thus along the boundary, andThis proves the Blasius force theorem, with force measured per unit length perpendicular to the flow plane.
For a circle of radius , Milne-Thomson's circle theorem replaces an incident analytic potential by , making the stream function constant on the circle. Its reflected singularities must lie inside the circle; here the physical source lies outside. With and , this yields, up to additive constants,The interior image source and sink have equal and opposite strengths, so there is no extra net source inside the body. No independent vortex term is added. The potential may have logarithmic branches, but the velocity and pressure are single-valued.
Only and lie inside . The residues of areTheir sum is . The residue theorem and the preceding force formula therefore giveThe force points towards the external source. Reflection symmetry across the horizontal axis independently checks the vanishing vertical component.
The velocity is because the flow is irrotational. Incompressible flow requires , hence the velocity potential satisfies Laplace's equation:The exact kinematic boundary condition at the free surface is . With constant atmospheric pressure, the dynamic condition from Bernoulli's principle is , after choosing the time-dependent potential gauge. For small amplitudes, the products of perturbations are second order. Evaluating the remaining first-order terms at the undisturbed level givesSubstitution of into Laplace's equation gives . For , decay as selects . The two boundary conditions for yieldFor a nonzero wave amplitude these are compatible precisely whenWith the conventional and positive frequency, the dispersion relation is . The exponential decay is the infinite-depth boundary condition; retaining a growing exponential would violate it.
The moment-generating function of a random variable is wherever this expectation is finite. Existence on an open interval containing zero is the condition needed for the usual uniqueness and convergence theorems. For the exponential distribution with rate ,For the integral diverges. Differentiating at zero gives mean and variance .
The independent identically distributed central limit theorem states that for variables of common finite mean and finite positive variance ,For the exponential distribution, and . Thus the event in question is exactlyThe limiting normal distribution has a continuous distribution function at every real , so convergence in distribution givesHere , including the strict-inequality convention because the limiting distribution is continuous.
For sufficiently large , lies in . The waiting time has the geometric distribution on , so summing its geometric series giveswhenever . Fix . The expansions show that the numerator is and the denominator is . ThereforeThe convergence theorem for moment-generating functions says that pointwise convergence of finite moment-generating functions on a fixed open interval about zero to the moment-generating function of a probability distribution implies convergence in distribution to that distribution. For example take ; all large satisfy the convergence condition throughout that interval. The limit is the moment-generating function from part (a), proving
Reading positive entries as directed edges, the communicating class decomposition isFor the first class, paths establish mutual reachability, and every transition from one of these states stays in this set. States 2 and 3 communicate, but state 2 can enter the first class and never return. States 4,6,7 communicate through , but state 6 can enter state 2 with no route back. These paths also exclude any larger communicating class. In a finite Markov chain, the closed class is recurrent and the two open classes are transient.
Assume is an integer, , and put . There is a discrepancy between the printed state definition and the formula requested later. We first follow the stated cumulative count, which retains previous good items when a defective item appears during phase A. The transition probabilities arewith all others zero. The balance equations imply for and . ThusFor comparison, if clearance requires consecutive good items, each defect in phase A resets the state to zero. Replace its transitions by , , combining contributions if destinations coincide. Phase B retains its two transitions. For this consecutive-clearance inspection model, balance yields and . With , normalization givesThis second model is the one giving the printed formula in part (iii). It is a different transition rule, rather than an algebraic simplification of the cumulative model.
For an irreducible positive recurrent Markov chain, the Markov chain ergodic theorem gives a unique stationary distribution , with almost-sure long-run occupation fraction in state . More generally, time averages of an integrable state reward converge to its stationary mean. If the chain is also aperiodic, then for every initial state ; the aperiodicity assumption is needed for this last distributional conclusion.
For either transition rule in part (i), permits progression through the phase-A states and a return from phase B to zero. Both chains are finite and irreducible, hence positive recurrent. State has a positive self-loop, so both are aperiodic. Thereforeusing respectively the cumulative or consecutive stationary distribution given in part (i), for every starting distribution.
The excluded endpoint cases are simple: at , phase B is eventually reached and then absorbing, so the limiting law is the point mass at . At , the cumulative rule traps the chain at its current phase-A count (or eventually at zero if started in phase B), so the limit can depend on the initial count; under the consecutive rule zero is eventually absorbing. Irreducibility and the preceding stationary formulas must not be asserted unchanged at these endpoints.
During phase A every item is inspected, while during phase B inspection has probability , independently of item quality. The long-run inspected fraction is therefore the stationary rewardThis can be justified by the Markov chain ergodic theorem for state occupation and the strong law for the independent inspection coins (or the corresponding bounded martingale differences).
For the printed cumulative count this givesIt does not equal the claimed expression in general. For instance , , gives , whereas the printed expression gives .
For the consecutive-clearance rule, substituting instead givesThus the claimed formula is valid for consecutive clearance, and false for the literal cumulative count. For the limiting inspected fraction is in either model; for it is 1 because phase A never clears.
An item escapes detection only in phase B, when it is defective and its inspection coin says no. Since the current item's quality and inspection choice are independent of the phase determined by previous items, the long-run fraction of all production that is defective and undetected isConsequently the two interpretations giveIf the denominator population is defective items alone, divide by their long-run fraction : the corresponding missed fractions are and . Stating the denominator matters; the phrase “proportion of defective items” can mean either this conditional fraction or the unconditional production fraction. At no defective item exists, so the unconditional fraction is zero and the conditional fraction is undefined; at eventual full inspection gives zero misses.
Let be densities or probability mass functions relative to a common measure, describing two simple hypotheses. A randomized hypothesis test is a measurable function , whose value is the conditional rejection probability. Fix . The Neyman-Pearson lemma states that a test with is most powerful among tests with size at most if it rejects where , accepts where , and randomizes as necessary on equality, for a threshold . Sets where are included in rejection. A likelihood-ratio quantile and boundary randomization supply such a test.
To prove optimality, let be any competitor with . Pointwise, the threshold rule makesIntegrating and rearranging givesThus no competitor of the permitted size has larger statistical power, proving the lemma. Randomization permits exact size when discrete observations cannot supply it with a deterministic rejection region.
The likelihood ratio for the two binomial probabilities isstrictly increasing in . By the Neyman-Pearson lemma, reject in the highest upper tail. Under the null,Hence reject exactly when , with no randomization required. Its statistical power at the stated alternative is
For any fixed below 1, the ratio to the null isIt increases with . Its ordering is therefore the same for every such alternative, while the size is determined only by the null. The very same rule, reject when , is most powerful against each alternative and hence is a uniformly most powerful test. At its power is 1, also optimal.
More generally, for , the binomial likelihood ratio against any increases with . Choose an integer cutoff so thatand reject for , randomize with probabilitywhen , and accept below. This gives exact size and is a uniformly most powerful test for every positive integer . Exact prescribed size may require this boundary randomization; a deterministic cutoff alone need not attain it. For , reject all and reject at with probability , which is likewise optimal. At the stated one-sided alternative is empty. The cutoff generally depends on ; there is no claim that one fixed cutoff serves every null parameter.
An estimator of a parameter or estimand is an unbiased estimator if its expectation exists andUnbiasedness concerns the sampling mean of the estimator over repetitions, rather than equality to the target for any particular observed sample.
Articles were limited to the first 100 out of 111 total.
Articles by others on the same topic
There are currently no matching articles.