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 27 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let . Regroup the finite divisor sum using the least common multiple:This is nonnegative. If has no prime factor in , only can contribute to the inner sum, so it equals . This proves the required pointwise upper-bound sieve inequality. Whenever a term defining is nonzero, and their prime factors lie in . Hence , and every prime factor of lies in . Thus these are upper-bound sieve weights of level , as described by the Selberg least-common-multiple weights.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Logarithms on sufficiently deep units. Suppose , let be the residue characteristic, and put . For every integer the p-adic logarithm and p-adic exponential function, evaluated in , converge on the required domains:The bounds and show that, for , every term beyond the linear one has valuation strictly greater than or . The series therefore converge and preserve these lattices; in particular . Their formal composition and addition identities are valid by convergence, giving inverse continuous group homomorphismsThus the logarithm isomorphism on deep principal units isThe right-hand group is torsion-free.
Roots of unity in . For odd , take . The principal unit group is torsion-free by the logarithm isomorphism on deep principal units. The Teichmuller representative splitting leaves precisely the roots in .
For , take . Each odd unit is uniquely with , since its residue modulo four is either one or minus one. This latter group is torsion-free. ConsequentlyThis computes the roots of unity in the p-adic numbers.
The units of . Set . Its polynomial is Eisenstein, soThe Eisenstein polynomial facts justifying this are stated in the next solution. Write . Reduction gives , and the successive quotients of principal-unit groupshave order two for . Hence . The four roots in have distinct images modulo , sinceThey exhaust the quotient and intersect trivially. Since , the logarithm isomorphism on deep principal units gives . Therefore the unit decomposition of the 2-adic Gaussian field isIn particular these four elements are all its roots of unity.
Quadratic extensions. A nonzero element of is uniquely a power of times a unit, so . Squaring on the decomposition above acts as squaring on and multiplication by two on the additive ring . Thus the square-class group of the 2-adic Gaussian field isBy quadratic extensions from square classes, in characteristic different from two the nontrivial square classes classify quadratic extensions : two such extensions are -isomorphic exactly when is a square. There are therefore quadratic extensions up to -isomorphism.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The valuation ring and local compactness. The opening, unlettered requests useThe ultrametric inequality makes a valuation ring; its elements outside are exactly the units, so is its unique maximal ideal, and is the residue field.
Here the customary nontrivial-valuation hypothesis for a local field is necessary. With the trivial absolute value, any infinite field is discrete and locally compact, but its residue field is infinite and there is no nonzero uniformizer. We use the nontrivial valuation in the conclusions below.
Local compactness first gives a compact neighborhood of zero. Choose a sufficiently small nonzero so that the closed set is contained in that compact neighborhood. Then , and hence , is compact. Since is open, its cosets give a discrete compact quotient , which must be finite. Write . The subgroup now has finite index and is closed in , hence compact. The continuous function attains on a maximum with . Choose with . Every has , soSuccessive division by shows that every nonzero element of is a unit times a power of : division must terminate because . Thus the value group is discrete. A Cauchy sequence eventually lies in a translate of the compact ring , has a convergent subsequence, and consequently converges itself. These arguments prove the discrete valuation from nontrivial local compactness and the completeness of locally compact nontrivially valued fields.
The iterated-power limit. Normalize the discrete valuation by , and write , where is the residue characteristic. For with , the binomial theorem givesThe linear term gains a factor (or is zero in positive characteristic), while all terms of degree at least two have valuation at least .
For , reduction gives , because has order . Iterating the inequality yieldsThe sequence is Cauchy and converges to a unit . Since the reduction of is always , its limit has the same residue. Taking limits after shifting the sequence gives , whenceThis is the Teichmuller representative. The Hensel lemma applied to , whose derivative is a unit at every nonzero residue, shows uniqueness for each residue. Consequently the prime-to- roots give a canonical splitting
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A number-field completion is finite. Let be the given number field and its completion. Normalize its absolute value on a field so that the restriction to is : if , use . Changing the original absolute value by this positive power does not change its completion. The closure of in is an isometric copy of .
Take a -basis of and let be its -span in . Choose a maximal linearly independent subset of that finite spanning set. The compact-sphere proof of finite-dimensional non-Archimedean norm equivalence applies to this basis too, so is complete and therefore closed in . Since is dense in , it follows that . Hence
Every finite extension is obtained this way. Let be finite. Use its extending Non-Archimedean absolute value, whose completeness and uniqueness were proved above. In characteristic zero the primitive element theorem gives ; scaling by a power of , we may arrange that it is integral. Its monic minimal polynomial belongs to . If the degree is one, is already the completion of .
Otherwise choosewhere runs over the conjugates in an algebraic closure. Approximate the coefficients of by integers, obtaining a monic of the same degree. Since , sufficiently accurate approximation gives and makes . The strong form of Hensel lemma in produces a root of with .
For completeness, the required Krasner's lemma follows from the unique extension of an absolute value to a finite extension. In a finite Galois extension containing , every automorphism fixing is an isometry, andIf , this contradicts the choice of . Thus every automorphism fixing fixes , and Galois correspondence gives . Since , equality follows. In particular is irreducible over , and therefore over .
Put . It is a number field, and the closure of in contains , so is dense. LetEvery element of the ring of integers of a number field has absolute value at most one: otherwise its highest-degree term would strictly dominate all other terms of a monic integer equation. Thus reduction into the residue field of makes a prime ideal, and . The restriction of the valuation to is the valuation of this prime, up to normalization. Indeed, the localized discrete valuation ring maps into , its units have absolute value one, and its uniformizer has absolute value less than one. Density and completeness giveThis proves the local realization as a completion of a number field.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be a -basis of , and define the coordinate normFirst an extending absolute value on a field is automatically non-Archimedean. Its values on integers are at most one, and the binomial theorem givesTaking th roots and letting proves the ultrametric inequality.
ConsequentlyThis bound makes continuous for the coordinate topology. The coordinate sphere is a closed subset of , hence compact. It contains no zero, so the continuous positive function attains a positive minimum there. Scaling any nonzero vector by a power of to put it in provesThis is the compact-sphere proof of finite-dimensional non-Archimedean norm equivalence.
A Cauchy sequence for is therefore Cauchy in each coordinate. The completeness of gives a coordinate limit, and the upper bound gives convergence to it for . Thus every extending absolute value makes complete.
For uniqueness, if and are two extensions, their respective bounds give constants withApply this to and use multiplicativity:Letting proves for every . This proves the unique extension of an absolute value to a finite extension without assuming that an arbitrary coordinate norm is multiplicative.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The Hasse-Minkowski theorem says that a nondegenerate quadratic form over a number field has a nonzero isotropic vector over that field if and only if it has one over every completion. In particular, over one tests and every . For the present integral form, a rational isotropic vector can be multiplied by a common denominator to give an integer one. This is the Hasse-Minkowski principle.
Write , and . All three primes are odd and exceed three: or would make composite. The second supplementary law for quadratic reciprocity gives
Necessity at . Scale any nonzero vector over so that its coordinates lie in and at least one is a unit. Reduction of its equation modulo gives , since twelve is invertible modulo . If the Legendre symbol is , this forces . The original equation then forces , because its other two terms are divisible by . This contradicts the normalization. Thus
Sufficiency at the coefficient primes. Suppose . A nonzero solution modulo is . Its -derivative is nonzero modulo , so fixing the other two coordinates and applying the Hensel lemma lifts it to .
Since , the same Legendre symbol criterion gives . Modulo , the equation reduces to , and the vector is a simple zero in the coordinate. It lifts to . Modulo , the coefficients of and are respectively and , so is a zero with nonzero -derivative. It lifts to .
The remaining odd primes. If is odd and divides none of , the reduced ternary quadratic form is nondegenerate. An elementary finite-field argument finds a zero with : if its coefficients are , the setsboth have elements, so intersect. The resulting vector has nonzero -derivative , and the Hensel lemma lifts it. This isotropy of nondegenerate ternary quadratic forms over finite fields verifies every remaining odd completion without an extra congruence condition.
The dyadic and real places. Setting reduces the dyadic problem toThe right side is a 2-adic unit congruent to modulo eight. The unit square classes of the p-adic integers computed above show that it is a square in . This also explains the printed hint: its integer can be taken as . Over , the positive and negative coefficients make the form indefinite; for instance gives a nonzero zero.
All completions now have a nonzero isotropic vector. The Hasse-Minkowski theorem, followed by clearing denominators, proves
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 26 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A strong lifting lemma. Let be a complete discrete valuation ring, with fraction field and normalized discrete valuation . A useful strong form of Hensel lemma says that for and satisfyingthere is a root withIf , take . Otherwise the hypothesis ensures that . The root is unique among satisfying . In particular, a simple root of the reduction of lifts uniquely with its specified residue.
Here is a proof by Newton iteration over a valued field. Put andWrite and . Taylor expansion over shows, inductively, that the increment has valuation , that , and thatIndeed, the constant and linear terms of cancel, leaving terms of valuation at least twice that of the increment. The change in has valuation greater than , so its valuation stays . Thus all iterates lie in and form a Cauchy sequence. Completeness and continuity give a root . The later increments have strictly larger valuations than the first, proving the displayed distance formula. For uniqueness, if are in the stated ball, Taylor expansion factorsThe second factor is nonzero, so two roots must coincide. This proves Hensel's lemma in the form needed here.
Odd residue characteristic. For odd , a p-adic unit is a square exactly when its reduction is a square in . Necessity follows by reduction. For sufficiency, a nonzero residue root of has derivative invertible modulo , so the Hensel lemma lifts it. The multiplicative group of a finite field is cyclic, and its subgroup of squares has index two. ThereforeRepresentatives are and any unit whose reduction is a quadratic nonresidue.
Residue characteristic two. An odd integer has square congruent to one modulo eight, so a square 2-adic unit must lie in . Conversely, if , take and . Then , and the strong form of Hensel lemma produces a square root. HenceThe four unit square classes of the p-adic integers have representatives .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 25 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For finite rooted trees write when there is an injective function of vertices preserving greatest common ancestors, equivalently an infimum-preserving rooted-tree homeomorphic embedding. No linear ordering of siblings is imposed. Kruskal's tree theorem says that every infinite sequence has an earlier tree embedding into a later tree: this embedding relation is a well-quasi-ordering.
The finite form uses a parameter to restrict the growth of the trees. It asserts the existence of a length for whichHere is the number of vertices. The parameter is universally quantified; changing the starting index just shifts the parameter. This is Friedman's finite form of Kruskal's theorem.
Fix and suppose there were arbitrarily long sequences violating the conclusion. Form a tree whose nodes are their finite prefixes, including the empty prefix. Choose one representative of each finite rooted-tree isomorphism type. At position there are only finitely many choices, since the tree has at most vertices. Hence this finite bad-sequence tree is finitely branching. It has nodes at arbitrarily large heights by the supposed failure of the finite form. König infinity lemma supplies an infinite branch. The branch is an infinite sequence satisfying the size bounds and with no pair having , contradicting Kruskal's tree theorem. Therefore the finite length exists for every .
The significance is that this is a true statement about finite objects and natural numbers which is not provable in Peano arithmetic; in fact it is not provable in the stronger arithmetical transfinite recursion theory in second-order arithmetic, . It is a natural combinatorial instance of incompleteness. For fixed , the condition can be checked by finite search over trees and injective vertex maps, so its uniform arithmetic form is with a computable, indeed primitive recursive, predicate . Thus its least sufficient length is a total computable function, but its totality cannot be proved in those theories. Each fixed numerical instance can nevertheless be proved in Peano arithmetic by verifying some particular finite witness. The obstruction concerns the uniform statement for all parameters, rather than the decidability of any one finite search.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 25 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
An immune set is an infinite set containing no infinite computably enumerable subset. For binary strings, use an effective bijection with natural numbers when discussing enumeration. Fix an optimal description machine and define the plain Kolmogorov complexityAn incompressible string has no description shorter than itself, that is, . The choice of machine is fixed throughout the proof.
Let be the set of incompressible strings. There are strings of length , but only programs of length less than . Each halting program describes at most one string, so at least one string of each length belongs to . Consequently is infinite.
Suppose an infinite computably enumerable set were contained in . Define a total computable function by running an enumeration of until a string of length at least appears, and outputting the first such string. This search always terminates because there are only finitely many binary strings of bounded length. A fixed program can reconstruct from a self-delimiting binary code of . For example, if the binary expansion of has length , encode it using copies of one, a zero separator, and its binary digits. This givesfor a constant depending on the enumeration algorithm and the optimal description machine, not on . For sufficiently large this is less than , contradicting . Thus the set of incompressible strings is an immune set. This proves immunity of incompressible strings. The argument uses the ability to describe a selected long string by the short threshold specifying how it was selected.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 24 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Fix forcing names for the set and the parameters. Define a nameOnly appearing in and are needed, so this is a subset of a ground-model set. The forcing definability lemma makes its defining predicate a formula of . Ground-model axiom schema of separation therefore gives .
Conversely, if satisfies this formula, choose with and . The forcing truth lemma supplies forcing the formula for these names. Directedness gives with . Then , and . ThusThis proves the instance of the axiom schema of separation in the generic extension, without assuming that instance there in order to construct the name.
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





