Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 12 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use normalized Fourier analysis on a finite abelian group, identifying with its indicator function on the cyclic group . The conventions areThe last operation is normalized convolution on a finite group. With these conventions the Fourier coefficients on a finite abelian group use a normalized average, while sums over frequencies use counting measure.
Expanding the normalized convolution on a finite group and putting givesFor the translation of a function , putting yieldsThe two transforms are thereforeThe negative sign in the translation factor follows from the negative sign in our Fourier coefficient on a finite abelian group convention.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 12 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write and let be the triangle count in a binomial random graph. For every three-element set of vertices, let be the indicator random variable that its three edges are present. ThenFor two distinct triples , their indicator random variables are independent random variables unless they share an edge. Sharing just one vertex still leaves the sets of relevant edges disjoint. If they share an edge, their union has five edges, and thereforeThere are unordered pairs of distinct triangles in a graph sharing an edge: choose that edge, and then choose their two additional vertices. The variance of a sum consequently gives the exact formulaFor sufficiently large , the hypothesis ensures , so . Dropping negative terms and simplifying the binomial coefficients,Here as well. The event implies . Applying the Chebyshev inequality from part (i) gives the requested conclusion:Thus the triangle count is concentrated around its expectation throughout this range of the binomial random graph.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 12 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be a real random variable with finite expectation and finite variance . The Chebyshev inequality isThe proof is the pointwise comparisonTaking expectations and using the definition of variance givesDivision by the positive number proves the Chebyshev inequality, including the case . Equivalently, this is the Markov inequality applied to the nonnegative random variable .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 11 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Distinct traces give the bound. If the common-set alternative fails, the preceding argument shows that the traces are all distinct. They form a set family on the -element ground set with constant pairwise intersection . The constant-intersection family bound therefore gives . Since ,Here , because any two of the remaining traces intersect in elements, so applying the bound to is legitimate.
The bound is sharp even when the common-set alternative fails. For any , take ground set and for . Every -fold intersection has size , but the intersection of all members is empty. Every -fold intersection has size . Thusand there is no common subset of size . These complement-of-singleton extremizers show that the bound cannot be reduced in general.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 11 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A repeated trace produces the common set. If for two distinct remaining indices, their common value has size . For any other remaining index , the identity forces . The inclusion also holds for themselves. Since , it lies in every indexed by as well. ConsequentlyThis proves the common-set alternative of the constant t-wise intersection dichotomy. The conclusion only requires a common subset of size ; for , the full common intersection in fact also has size , because it is contained in a -fold intersection of that size.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 4 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The wave map scaling symmetry is . Its conserved wave map energy isThus energy is subcritical for , critical for , and supercritical for . The scaling-critical homogeneous Sobolev spaces for perturbations of a constant map are . These relations constitute wave map energy and criticality.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 4 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Harmonic maps give nonconstant stationary wave maps. For , inverse stereographic projection givesIt satisfies and , so is a smooth global wave map. Its wave map energy is , since . Translations and rescalings give further examples; these harmonic maps approach a constant at infinity.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 4 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Smooth compatible wave map Cauchy data give a unique local smooth wave map. Relative to a constant map, Sobolev spaces with provide a classical local theory. Iteration for the semilinear wave equation, Sobolev algebra and energy estimates give existence, uniqueness and continuous dependence. The smooth continuation criterion for semilinear wave equations extends the solution while these norms stay bounded. The sphere constraint and tangency constraint remain satisfied.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 4 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Compatible Cauchy data for a wave map are and : thus and . Smooth localized wave map Cauchy data equal a constant with zero velocity outside a compact set. It is , rather than the sphere-valued map itself, that has compact support. The geometric constraints propagate under the wave map equation.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 3 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The opposite sign is the focusing semilinear wave equation . Begin with a spatially constant solution, reducing the partial differential equation to the ordinary differential equation . Substitution of givesFor a nonzero profile, equality of powers and coefficients gives and . ChooseTo obtain compact support, take a smooth cutoff function equal to one on and zero outside , and prescribeThese are smooth, compactly supported Cauchy data. By finite propagation speed, the local solution agrees with throughout for , where is its maximal forward smooth existence time.
For completeness, the semilinear domain of dependence assertion follows by comparing two solutions: their difference obeys , with . On any compact time interval before on which the solutions are smooth, is bounded in the backward light cone. Add to the shrinking-ball wave energy; its derivative is bounded above by times that energy, with the same nonpositive boundary flux. Zero initial difference and the Gronwall inequality give there.
If , the identity at the origin would imply as , contradicting smoothness at . ThusIf the solution loses regularity earlier, that is already finite-time blowup. The usual smooth continuation criterion for semilinear wave equations precludes a finite maximal time with all continuation norms bounded. This localized ordinary differential equation blowup for a wave equation therefore supplies the required compactly supported examples.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 3 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
We use the homogeneous version of the Sobolev embedding theorem in three dimensions:Here homogeneous Sobolev space is the completion of compactly supported smooth functions in the L2 norm of the gradient, identified with its representative. Apply this Sobolev inequality both to and to its spatial derivatives.
LetThe Plancherel theorem identifies the L2 norm of the Hessian matrix with , because . In particular,Differentiating the defocusing semilinear wave equation gives . By the Holder inequality with exponents and , the preceding Sobolev inequality, and conservation of the positive wave energy,Use the inhomogeneous wave energy estimate simultaneously for the three spatial derivatives. It givesThe Gronwall inequality therefore yields . We may take the continuous, locally bounded functionThe constant is universal; the dependence on the initial data is only through and . The H2 bound for the defocusing cubic wave equation holds on every existing smooth interval, without assuming the global conclusion. If or , the zero solution satisfies the same estimate.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 3 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The sign convention makes this a defocusing semilinear wave equation:Its wave energy includes a nonnegative potential term:For a smooth function solution, finite propagation speed preserves compact support on finite time intervals. Differentiate under the integral and use integration by parts:Equivalently the local conservation law has density and flux . All three terms are nonnegative, and forces both Cauchy data to vanish. Hence this is a positive conserved energy, rather than the indefinite energy associated with the opposite sign.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 2 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
We establish a quantitative almost global existence for wave equations estimate. Take , fix an integer , and use the commutation vector fields for the wave equation from the preceding part. Put and define the commuted wave energyAll these L2 norms are finite on any smooth existence interval by finite propagation speed. At , the polynomial coefficients of the vector fields are bounded on the fixed compact support of the Cauchy data. Whenever a higher time derivative occurs, use and its differentiated versions to express it in terms of initial spatial derivatives. Every term contains at least one factor of ; consequentlyfor a constant depending only on finitely many derivatives and the support radius of .
The commutators are constant linear combinations of translations. Together with and the Leibniz rule, this shows that each commuted source is a finite linear combination of productsThis statement includes the extra copies of the original source produced by the scaling vector field. In each product put the factor with fewer commutations in the Lp norm and the other in the L2 norm. The lower order is at most . Applying the Klainerman-Sobolev inequality to costs at most two additional commutations; commuting those past introduces only lower-order translations. Since ,The inhomogeneous wave energy estimate now givesLet . Use a bootstrap argument with up to the smaller of and the maximal existence time. The energy estimate improves this toFor each fixed ,Choose so that for every . Then , a strict improvement. A continuity argument closes the bootstrap argument.
Finally, the translation terms in control ordinary spatial Sobolev norms of . The missing L2 norm of satisfiesThus the full local-existence Sobolev norms remain bounded on this finite interval. The smooth continuation criterion for semilinear wave equations extends the solution past any finite endpoint before . To see smooth persistence explicitly, the tame Sobolev product estimate gives . Ordinary differentiated wave energy estimates therefore bound each higher derivative energy by its initial value times . This is finite on the interval already controlled by the base commuted wave energy; no separate is needed for each derivative order. ThereforeFor the zero solution is global. The same energy estimate in fact permits an exponential lower bound for the lifespan, which is stronger than any fixed inverse power.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 2 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
One version of the Klainerman-Sobolev inequality, for a sufficiently decaying smooth function on , isHere denotes a word of length in the following eleven commutation vector fields for the wave equation:The first four are spacetime translation vector fields; the next three are spatial rotation vector fields; the next three are Lorentz boost vector fields; and is the scaling vector field. The vector field method for wave equations uses these vector fields because their commutators with the d'Alembert operator obeyIn particular the Klainerman-Sobolev inequality impliesThe displayed L2 norms are spatial norms at fixed time; the spacetime vector fields can contain time derivatives. No wave equation assumption is needed for the Klainerman-Sobolev inequality itself.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 10 1 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For the wave equation with d'Alembert operator , the wave speed is one. The domain of dependence of is the initial ball . More precisely, two solutions whose Cauchy data agree on a neighbourhood of that ball have the same value at . Thus, if both Cauchy data have support in , finite propagation speed givesThe Strong Huygens principle is sharper in three spatial dimensions: only the initial data on the sphere contribute, including the first spatial derivatives of the initial displacement there. The Kirchhoff formula makes this precise:In particular, if the Cauchy data have compact support in , thenFor , the solution therefore vanishes behind the inward edge as well as outside . The absence of an interior tail is the additional content of the Strong Huygens principle.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 1 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The key is a Laurent normalization by a monomial change of variables. We prove the slightly stronger assertion that every nonzero quotient of a Laurent polynomial ring in variables is finite as a module over an embedded Laurent polynomial ring in some number of variables.
Induct on . If the defining ideal is zero, the ring itself works. Otherwise choose a nonzero Laurent polynomialin that ideal, with nonzero coefficients. For a sufficiently large positive integer , the weightsare distinct for all . Indeed, each difference gives a nonzero polynomial in , which has only finitely many integer roots. Make the invertible monomial substitutionIts inverse is , so it is an automorphism of the Laurent polynomial ring. When there is no substitution and distinct exponents already give distinct weights.
As a Laurent polynomial in , the transformed relation has unique lowest and highest exponents. Their coefficients are nonzero scalar multiples of monomials in , hence units inMultiplying by a power of and the inverse leading coefficient givesHere : a single-term Laurent polynomial would be a unit and the quotient would be zero. Reversing the equation and dividing by gives a monic equation for . Thus both and are integral over the image of in . In fact being a unit also expresses as a polynomial in , so is generated as a -module by .
The ring is itself a nonzero quotient of an -variable Laurent polynomial ring. By induction, it is finite over an embedded Laurent polynomial ring in variables. Finiteness of modules is transitive, so the same is true of ; a finite ring extension is an integral extension, by the determinant trick applied to multiplication by an element.
Applying this to yields an embedded subringThe base case means the subring ; finiteness over it would make a finite-dimensional vector space. The hypothesis excludes this, so , as required. No infinitude assumption on is used.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 1 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
An integral extension means every satisfies a monic polynomialTo prove the Lying-over theorem, localize at . The injection remains injective, and is integral over : a monic relation for divided by suitable powers of gives one for . This is a nonzero ring, so choose a maximal ideal of it.
The contraction of to is maximal. To see this directly, a field integral over a subring forces that subring to be a field. For nonzero in the subring, is integral; multiply its monic equation of degree by to express as a polynomial in with coefficients in the subring. Apply this to the integral extensionSince is a local ring with unique maximal ideal , we obtain .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 1 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Suppose is a saturated multiplicative subset, and take . The principal ideal is disjoint from : otherwise would force . The prime ideal avoiding a multiplicative subset argument from Question 1 extends to a prime ideal disjoint from . Thus every point of the complement belongs to such a prime ideal, andIf , this is the empty union.
Conversely suppose is a union of prime ideals. If and , some prime ideal in that union contains , and hence , a contradiction. The same holds for . Thus The saturated complement as a union of prime ideals characterization holds.
For units with no finite prime-union complement, takeProducts of units are units, and a product is a unit only if both factors are units, so is a saturated multiplicative subset. Every nonunit integer lies in some with a positive prime, giving . If finitely many prime ideals sufficed, discard any and write the others as . A prime outside this finite list belongs to none of them but is a nonunit, a contradiction. There is always such an : a prime divisor of is outside the list.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 1 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the convention that a multiplicative subset contains and is closed under multiplication. Usually is excluded; allowing it gives the harmless zero-ring localization. A prime ideal disjoint from is mapped toin the localization of a ring. This ideal is proper, andis an integral domain, since the denominators are nonzero in the integral domain . Thus is a prime ideal.
Conversely, for a prime ideal in , its contractionis a prime ideal disjoint from : each is a unit and cannot belong to a proper ideal. Membership in is equivalent to numerator membership in , since . Hence .
To check the other composite, implies for some , by the equality criterion for fractions in a localization of a ring. Since , primality gives . Therefore extension and contraction are mutually inverse:If , both sets are empty. This is the prime ideal correspondence for localization.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 1 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For each , and each , choose , using incomparability. PutThen belongs to the other two prime ideals and does not belong to , by primality. In particular each lies in the union. But for every : modulo , the sum equals . The union is not closed under addition and is not an ideal. This is a concrete instance of prime avoidance.
The union of three incomparable nonprime ideals example can retain pairwise incomparability. In the ringtakeThese distinct two-element ideals are pairwise incomparable, yetwhich is an ideal. None is prime: its quotient ring still contains a nonzero element of square zero. The three one-dimensional vector subspaces cover the two-dimensional vector space over .
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





