Source: Oxford mathematics examination release, private bundle Part A 2007 11-1.pdf, pages 45–59. The printed cover is for mathematics and statistics. The complete statements and editable transcription are retained in the private examination archive.
Any nonzero vector in extends to a basis. Sending one such basis to another gives an element of the general linear group, so its group action on the seven nonzero vectors is a transitive group action. Counting successive independent columns gives
By the orbit-stabilizer theorem, the stabilizer of a chosen nonzero vector has order .
There are three two-dimensional linear subspaces containing , corresponding to the three one-dimensional linear subspaces of . The stabilizer acts transitively on them: extend a basis of either plane beginning with to a basis of the whole vector space. Thus the stabilizer of a flag has order .
If has order eight, each orbit of a group action of on the seven nonzero vectors has size a power of two. Since seven is odd, at least one orbit of a group action has size one. Thus fixes a nonzero vector . Its group action on the three planes containing likewise has a fixed plane . Therefore is contained in, and by order equals, the stabilizer of that flag. The group action of is transitive on these flags, so all such subgroups are conjugate subgroups.
Distinct flags give distinct stabilizers. In a basis adapted to a flag, its order-eight stabilizer consists of
Its only common fixed nonzero vector is . Its only invariant plane is : an invariant plane is the kernel of a linear map of a nonzero linear functional, and over that linear functional must be fixed; the displayed matrices have only the fixed nonzero linear functional . Hence each subgroup specifies its flag uniquely. There are seven choices of and three choices of , giving
An element is an algebraic element over if some nonzero polynomial in vanishes at . A field extension is an algebraic extension if each of its elements is an algebraic element over . If , the vectors are linearly dependent, producing such a polynomial. Thus every finite field extension is an algebraic extension.
The converse fails for the field of algebraic numbers . It is an algebraic extension of by definition, but it contains primitive th roots of unity of degree for arbitrarily large primes , by the permitted irreducibility of the cyclotomic polynomial. The tower law would make every such degree at most if the latter were finite, a contradiction.
The sixth roots of unity all belong to , where . Its minimal polynomial of an algebraic element is , which has no rational root. Thus the splitting field is and
A primitive seventh root of unity generates all roots. Its minimal polynomial of an algebraic element is the permitted irreducible cyclotomic polynomial . Hence the splitting field has
A primitive eighth root of unity is , and . Indeed and , while the displayed expression gives the reverse containment. Since , adjoining has degree two; adjoining to also has degree two. By the tower law,
The polynomial has no root in , so it is an irreducible polynomial. The quotient ring of by the ideal it generates is therefore a field with eight elements. The seven nonzero elements form a group of order seven, so each satisfies by Lagrange's theorem. Thus this field splits . A root different from one has order seven; it cannot lie in and generates this degree-three field extension, since three is prime and the tower law applies. Therefore
In characteristic two, the binomial theorem gives . The only root is already in , so the splitting field is the original field, despite the repeated root:
Wilson's theorem states that an integer is prime if and only if . For a prime , every nonzero residue has a multiplicative inverse. Pair each residue with its inverse; the only self-inverse ones satisfy in and hence are (the same residue when ). The resulting product is . Conversely, if , no divisor of can satisfy : it would divide both and , so could not divide . Hence is prime.
For a composite which is not the square of a prime, choose a proper factorization with if possible. Both factors occur in , proving divisibility by . If the initially chosen factors coincide but their common value is composite, choose a different proper divisor to obtain unequal factors; equivalently, the only composite integer all of whose proper nontrivial divisors coincide is a prime square. For , the distinct factors and lie below and their product is divisible by . Thus for every composite .
For a prime , write . Then , so the summand is one. For a composite it is zero. The only remaining composite index is four, whose summand equals . Therefore the sum is the prime-counting function plus two whenever ; subtraction of two gives the claimed exact formula.
A coordinate transformation is a continuously differentiable bijection from the open set onto an open subset , with continuously differentiable inverse. Equivalently, it is a diffeomorphism; its Jacobian determinant never vanishes. The inverse function theorem supplies the local inverse, while global injectivity is an additional requirement.
The change of variables formula for a Lebesgue integrable function is
The absolute Jacobian determinant accounts for area regardless of orientation. The formula also holds for nonnegative measurable functions with possibly infinite integral.
Put and . The square becomes , with , and absolute Jacobian determinant . On its support the denominator exceeds one and , so the nonnegative integrand is bounded by one on a set of finite area; it is therefore Lebesgue integrable. The change of variables formula and Fubini's theorem give
The dominated convergence theorem states: if measurable converge almost everywhere to and almost everywhere for an integrable , then is integrable and . In fact .
To derive it from the monotone convergence theorem, first prove Fatou's lemma. For nonnegative measurable , the functions increase to and satisfy . Monotone convergence yields .
Now almost everywhere, so is integrable. Apply Fatou's lemma to the nonnegative functions , which converge almost everywhere to :
Hence , and proves the assertion. Common exceptional null sets may be removed at the beginning since the sequence is countable.
For fixed , ; for , the limit is zero. On , the supplied inequality gives , so
This is the given integrable dominating function. By the dominated convergence theorem,
A topological space is compact if every open cover has a finite subcover. It is connected if it cannot be written as the union of two disjoint nonempty open subsets. It is Hausdorff if every two distinct points have disjoint open neighborhoods. These definitions apply to the space itself and, with the subspace topology, to its subsets.
True. If open sets cover , their inverse images under the continuous surjection cover . Compactness of gives a finite subcover; surjectivity then makes the corresponding finite family cover . This proves the compactness of a continuous image of a compact space.
True. A separation of into two disjoint nonempty open subsets would pull back under the continuous surjection to a separation of . The inverse images are nonempty by surjectivity, contradicting connectedness of . Thus a continuous image of a connected space is connected.
True. The Hausdorff assumption makes closed in . Its inverse image under the continuous map is closed in the compact space , and a closed subset of a compact space is compact. This is the compactness of the fiber with its subspace topology.
False. Take , and the surjection . The interval is compact and connected, and the circle is Hausdorff. But is a disconnected two-point subspace. Thus a continuous surjection need not have connected fibers.
False. Let be a two-point set with the indiscrete topology, let be a one-point space, and let be the unique map. The space is finite and hence compact; its only nonempty open subset is all of , so it is connected. It is not Hausdorff, whereas is Hausdorff and is a continuous surjection.
For the canonical surjection , define a subset of to be open exactly when is open in . This is the quotient topology. The empty set and the whole quotient have open inverse images. Moreover inverse images commute with arbitrary unions and finite intersections, so the corresponding axioms of a topology follow directly from those on .
The map need not be an open map. For example, on identify every point of to one point and leave all other classes singletons. The set is open, but
is not open. The definition of the quotient topology therefore shows that is not open. The obstruction is that saturating an open set by equivalence classes need not preserve openness.
Treat the two squares as a single edge-pairing construction, including the identifications between different squares. Number the corners of the left square counterclockwise from its lower left corner by , and similarly use on the right. The single arrows identify with and with . The double arrows identify with and with . The triple arrows identify with and with . The quadruple arrows identify with and with .
Thus there are precisely two vertex classes, and . There are four edge classes and two two-dimensional cells, so the resulting closed connected surface has Euler characteristic
It is a nonorientable surface: on the left square the quadruple-arrow sides have the same orientation relative to a traversal of its boundary, giving a twisted band after gluing. Equivalently, no choice of orientations for the two faces makes the induced directions opposite on every paired edge. The vertex links are circles, so these edge identifications produce a closed surface, rather than a singular cell space. The classification of compact surfaces now gives
A torus also has Euler characteristic zero, but is excluded by the failed orientation test.
Differentiability at means that there is a linear map with
This map is the total derivative . In the Frobenius norm, , by the Cauchy-Schwarz inequality applied to matrix entries. Expanding with the order of all factors preserved gives
The remainder after the terms linear in has norm at most . Hence
For , the Neumann series converges absolutely in the finite-dimensional space of matrices. Multiplying its partial sums by and passing to the limit shows that it is . Its remainder after has norm at most , proving the required expansion.
If is an invertible matrix and , then is an invertible matrix. Thus the general linear group is an open subset of the matrix space. The preceding expansion also gives
Apply the chain rule to , using the cubic total derivative at and this total derivative of inversion:
The three terms generally cannot be combined by commuting and .
Parametrize the surface of revolution by
The magnitude of the cross product is . Integrating the surface area element over gives
Positivity of removes an otherwise necessary absolute value in the area element.
For , the Euler-Lagrange equation is
Since has no explicit dependence, the Beltrami identity gives
Solving this first integral, or substituting into the second-order equation, yields
The constants satisfy and . There need not be a solution for arbitrary endpoint data, and when there is one these equations can have more than one pair of constants. These are the possible stationary catenoids, so the axisymmetric second variation of a catenoid still matters when deciding whether they minimize surface area.
The functional is unbounded above. Let be the positive affine interpolant of the endpoint values and choose a nonnegative, nonzero, continuously differentiable vanishing at both endpoints. The admissible functions satisfy
This excludes a global maximum, but does not prove that a stationary curve is a minimum. The concluding assertion is false without additional conditions.
An explicit counterexample uses , , and the stationary function . Its second variation, for a perturbation vanishing at the endpoints, is
Choose . Since , the positive contribution is at most . On , , so the magnitude of the negative contribution is at least . Thus . Small perturbations in this direction preserve positivity and the endpoint data while decreasing surface area. Consequently this catenoid is not a local minimum. The valid conclusion from part (ii) is a necessary stationary form; minimization requires a separate stability and existence analysis.
Write , and . The Euler-Lagrange equations give . A normal mode is a motion with fixed nonzero vector ; its normal frequency is . Substitution gives . Thus the squared normal frequencies are the assumed positive distinct roots of
For either root, solve the associated two linear equations for the mode ratio.
For the rods, the small angles are and . The first rod has kinetic energy . The second rod's center has horizontal velocity and its angular velocity is . Its center-of-mass moment of inertia is , giving
Adding these kinetic energies gives . The first center rises by , and the second by . Multiplying by the respective masses and gives
Therefore the stated Lagrangian is .
Set . The mode equation is
Hence
The mode ratio is , so the ratio of the rods' angles is . It is positive for and negative for . Thus the lower-frequency normal mode has the rods in phase, and the higher-frequency normal mode has them out of phase.
In vacuum, the source-free Maxwell equations are
Put and denote the constant electric amplitude by . A corresponding traveling-wave magnetic field is
Both divergences vanish because both the electric field and the magnetic field depend only on and have zero component. Direct differentiation gives and . A time-independent background magnetic field satisfying the homogeneous equations could be added; the formula is the wave component.
Introduce the magnetic vector potential and electric potential by and . These identities automatically give the divergence equation for and Faraday's law. For this wave choose and ; the derivatives just calculated verify both potential equations.
The electromagnetic force is the Lorentz force, . On the smooth constraint plane , the constraint force is normal to the plane. Both and are tangential, so is normal and is balanced by that constraint force; it does not affect the tangential motion. Thus
A particular motion is , a circle of radius
The general planar motion also includes a constant drift velocity; the particle moves on a circle when that drift is zero. The constraint force can do no work because it is perpendicular to the velocity.
Orient counterclockwise around the solid body and let point from the solid into the fluid. The pressure force is . Since ,
For steady irrotational flow, Bernoulli's equation gives . The constant term integrates to zero. The boundary is a streamline, so is real there, giving . Therefore
which is Blasius force theorem with the specified orientation.
The prescribed stream function is the imaginary part of . The zero-circulation solution from the Milne-Thomson circle theorem is
On the two terms are conjugates, so the boundary stream function is constant. The added term has no singularities in the exterior and does not change the prescribed growing far-field part. Additive constants are immaterial.
Differentiating gives
The coefficient of in is . The residue theorem and Blasius force theorem give
The zero-circulation convention is relevant: if an independently imposed circulation is allowed, adding changes to . Thus the claimed zero transverse force belongs to the standard circle-theorem construction, or to a single-valued exterior complex potential of a two-dimensional potential flow, which excludes that extra circulation.
For potential flow, each velocity potential satisfies Laplace's equation in its fluid. The exact kinematic boundary condition on is . Keeping only first-order terms gives
The linearized Bernoulli equation is at the interface, so pressure continuity gives
For a decaying disturbance away from the interface, put and take
They satisfy Laplace's equation and the kinematic boundary conditions for . Substituting in the dynamic condition gives the dispersion relation
If the heavier fluid is on top, . Instead of oscillation, a Fourier disturbance has an exponentially growing component with growth rate . This is the Rayleigh-Taylor instability in the absence of surface tension.
The independent identically distributed central limit theorem states that for independent identically distributed random variables with finite mean and positive finite variance ,
For , continuity, strict monotonicity and the endpoint limits of the cumulative distribution function give a unique . Then . Thus has the uniform distribution on , by the probability integral transform.
For , when , and it is zero otherwise. Therefore its probability density function is : the exponential distribution of rate one. By integration by parts, and , so .
The variables are independent because they are separate measurable functions of independent random variables. The probability integral transform makes all of them identically distributed as , even though the need not be identically distributed. The displayed is exactly . The central limit theorem therefore gives
A Poisson process of rate is a counting process starting at zero, with independent stationary increments, such that an increment over an interval of length has the Poisson distribution of parameter . It has right-continuous paths with unit jumps almost surely.
Independence of the two processes makes increments of independent on disjoint intervals. The sum of independent Poisson random variables with parameters and is Poisson with parameter , as follows by convolution:
Thus is a Poisson process of rate . Its first red and green waiting times are independent exponential random variables of rates , so
The state-zero stationary distribution equation is , so . The state-one equation is , giving . More generally, the stationary probability flow across the cut is balanced, so . This also follows inductively from .
Hence . Since , the geometric series is summable, and normalization gives
These probabilities satisfy detailed balance and therefore all the stationarity equations. The Markov chain is an irreducible Markov chain, so this normalized stationary distribution is unique.
Up to a parameter-independent multinomial factor, the likelihood function is . A Lagrange multiplier for gives , whence and
Since all counts are positive, the log-likelihood function is strictly concave on the positive simplex and tends to minus infinity at its boundary, proving this is the unique maximum.
Under independence of random variables, , so the log-likelihood function separates as . Applying the same constrained maximization twice gives , , and
Twice the difference between the unrestricted and null maximized log-likelihood functions is
the required likelihood-ratio test statistic. Under the null hypothesis, its asymptotic chi-squared distribution has statistical degrees of freedom, the parameter-count difference . Here that is four. Since , reject independence at the 0.1 percent significance level. For four statistical degrees of freedom, the asymptotic upper-tail probability is . This establishes an association in these data; it is not a causal conclusion.
Write for individual survival probability. Conditional on a clump of size , its death probability is . Averaging with the geometric distribution gives
Thus
Here and ; different clumps and experimental repetitions are understood independent for the sampling model.
The live-clump counts have independent binomial distributions, all with the same . Up to a constant, their combined likelihood function is , maximized at when . Solving for gives . Therefore
Monotonicity of in makes this the maximum-likelihood estimator. At the sampling boundaries, gives , while gives only a supremum as , with no finite maximizer. These are the limiting interpretations of the formula.
The printed product omits the node : its lower index must be zero for the stated formula to hold. For example, with , nodes , and data , the printed gives , which fails the first value condition. Use the corrected Lagrange basis polynomials
They satisfy . Define and . At a node with , the double zero of gives . At , direct differentiation gives
Both polynomials have degree at most . Consequently has the specified values and derivatives, and is the required Hermite interpolating polynomial. The source product is retained literally in the private transcription; this solution identifies its necessary correction.
For , all and vanish. Between each consecutive pair of nodes, Rolle's theorem gives one additional zero of . Along with the nodal zeros, this supplies distinct zeros on the closed interval. Since is a polynomial of degree at most , it must be the zero polynomial. Thus is constant, and makes it zero. Hence the interpolating polynomial is unique.
The direct zero count includes the two endpoints; its guaranteed interior count before the degree argument is . After is proved, vanishes at every point of the open interval, so the stronger interior-zero assertion in the source follows as well. Another immediate uniqueness proof is that has a double zero at every node, so is divisible by of degree , although its own degree is at most .
Use the corrected Hermite interpolating polynomial from part (a). The auxiliary function vanishes at all nodes and at the additional point . Its derivative vanishes at all nodes, because both and the derivative of vanish there. Rolle's theorem between the ordered zeros of gives further, distinct zeros of . Thus has distinct zeros on the closed interval. The printed phrase that these include is not generally true; the extra zeros lie in intervals between zeros of , and need not vanish.
Repeated application of Rolle's theorem gives for some interior . Since has degree at most and is monic of degree ,
Rearranging gives
At an interpolation node, both sides are zero, so the error formula extends to the whole closed interval. The false location claim about one zero is unnecessary for this result.
For nodes and , the cubic Hermite interpolating polynomial is
Indeed its values at zero and one are , and its derivatives there are also . The Hermite interpolation error formula gives
since and on .
The Gershgorin circle theorem states that every complex eigenvalue of a square matrix lies in at least one closed disc . To prove it, take a nonzero eigenvector for and choose with maximal. The th row of gives
Division by proves the claim. The proof applies to real and complex matrices alike.
The second part of the Gershgorin circle theorem states that if a union of of the discs is disjoint from every remaining disc, that union contains exactly eigenvalues, counted with algebraic multiplicity. In particular, a single isolated disc contains precisely one eigenvalue. Connected components of the full union therefore carry the corresponding disc counts.
Articles were limited to the first 100 out of 159 total.

Articles by others on the same topic (0)

There are currently no matching articles.