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 2003 iii Paper 23 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix a prime of over , and a prime of over . Let be its restriction to . Inside the completed compositum, putThe assumption means is an unramified extension. Its residue degree is some ; the completed extension is the corresponding compositum . It suffices to prove that this is unramified, regardless of the ramification of .
Here is a proof of unramified extensions remain unramified under base change using the classification already established. Choose an integral generator of whose monic minimal polynomial has irreducible separable reduction of degree . Write and . Let be the degree- unramified extension. Its residue field contains , so has a simple root there. Hensel lemma lifts this root to a root of in . This gives an -embedding .
An unramified extension of a local field is Galois, so all -embeddings of into a fixed algebraic closure have the same image. The original therefore lies in , and is an intermediate field of the unramified extension . Its ramification index is one. Since and were arbitrary,This proof also explains why no linear-disjointness assumption on and , and no assumption that is unramified, is needed.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 23 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a local field containing the Nth roots of unity, fix the Local Artin map with arithmetic Frobenius convention. The Hilbert norm residue symbol can be defined byIt is independent of the chosen root, continuous and bimultiplicative, factors through in each variable, and gives a nondegenerate pairing on that finite group. It satisfies and for . Its norm interpretation isFor the quadratic Hilbert symbol is symmetric and sign-valued. It is also characterized by the existence of a nonzero solution of . Moreover , and therefore . We now compute both the square-class groups and the pairing explicitly.
For odd , write with . An element is a square exactly when is even and the residue of is a square in . Necessity follows by reduction; sufficiency follows from the simple-root form of Hensel lemma applied to , since is then a unit. If is any unit with nonsquare residue, this givesThe nonsquare unit defines an unramified quadratic extension. Its field norms include every unit and have even valuation, as follows from the local norm calculation below. Thus for every unit, but . Finally , by symmetry and the preceding unit calculation. Bimultiplicativity now proves explicit quadratic Hilbert symbols over the p-adic numbers:Here the factors are Legendre symbols of the nonzero residues. The formula works for arbitrary integer valuations , since only their parity matters.
At , the square of every odd integer is one modulo eight. Conversely, for an odd , apply the strong form of Hensel lemma to at : the error has valuation at least three, while the derivative has valuation one. Thus the unit square classes of the p-adic integers are precisely their four residues modulo eight. Combining this with parity of the valuation givesFor an odd unit putInspection of the residues gives . It remains to compute six basis pairings. Explicit field norms giveindeed , , , and .
In contrast . To justify the obstruction even for rational 2-adic coordinates, write , with integral and at least one odd. Then is zero if exactly one is odd, and one if both are odd. A sum of squares equal to the unit consequently forces and exactly one coordinate odd. Its residue modulo four would then be one, whereas is three.
Similarly . If is a unit, the valuations of the two terms have opposite parity, so cannot cancel. It follows that is an odd integral element and is integral. Modulo eight its norm is then or , never . These signs, symmetry, and bimultiplicativity giveThe two boxed formulas determine the quadratic Hilbert symbol on all nonzero elements, including every rational prime .
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 23 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write for the valuation ring of , for a uniformizer, , and for the residue field. A useful strong form of Hensel lemma is the following: if and satisfythen there is a root with , unique among roots in that ball. If , its distance satisfies .
Here is a proof by successive correction. Put , , andStop if a root has already been reached. Otherwise the correction has valuation . Integral Taylor expansions show that andThus grows at least geometrically, the corrections tend to zero, and completeness gives a limit with . The first correction has strictly smaller valuation than every later nonzero correction, proving the asserted distance. If are in the ball , thenThe second factor cannot vanish. Two roots in the ball must therefore coincide. This proves Hensel lemma; in particular a simple root modulo has a unique lift with that residue.
We use this to establish existence and uniqueness of unramified local extensions. For each integer , choose a monic irreducible polynomial of degree and lift it to a monic . Reduction and Gauss lemma show that remains irreducible over . LetThe ring is finite free and complete over , and . An element outside is invertible: lift an inverse from the residue field and invert the remaining by a convergent geometric series. Every nonzero element of is times such a unit, since in a finite free module. Thus is a discrete valuation ring, its fraction field is , andThis constructs an unramified extension of each degree.
Conversely, let be an unramified extension of degree . Its residue field is the unique degree- finite field extension . Choose a residue root of in it. The root is simple, so Hensel lemma lifts it to a root of in . This embeds into , and equality of degrees makes it an isomorphism. All residue conjugates lift in itself; hence is Galois, and reduction identifies its Galois group with the cyclic Galois group of the residue field extension. Its distinguished Frobenius automorphism reduces to .
There is exactly one unramified extension of each degree inside a fixed algebraic closure, andFor the middle equality, every nonzero element of lifts uniquely to a st root of unity, because that exponent is prime to . A primitive such residue generates the finite field extension, so its lift generates . Taking the union gives the maximal unramified extension, with Galois group .
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 23 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Kronecker–Weber theorem says that every finite abelian extension of is contained in a cyclotomic field. We prove its quadratic case by identifying the ramification that a quadratic number field must have.
For an odd prime , the cyclic Galois group of has exactly one subgroup of index two. Its fixed field is quadratic and is unramified at every finite prime other than . For a squarefree integer , the discriminant of is if , and otherwise. A nontrivial quadratic discriminant supported on the odd prime must therefore beIndeed cannot give a nontrivial extension unramified at two, whereas exactly one of is congruent to one modulo four. ThusThis identifies the quadratic subfield of a prime cyclotomic field using ramification, without a Gaussian-sum computation.
Now let with squarefree. Multiply by . Every odd prime then occurs with even exponent, so its square class is represented by one of . Thus adjoining the square roots of the removes all possible odd-prime ramification; the remaining quadratic factor is contained inThe original is a rational multiple of a product of these square roots. It belongs to the compositum of and the prime cyclotomic fields just used. This compositum is itself contained in a cyclotomic field, proving the theorem for .
The sharper conductor statement follows from the same ramification calculation. For the fundamental discriminant of , putThe possibilities for follow immediately from the quadratic discriminant formula. The corresponding fields are trivial, , and , lying in the cyclotomic fields of conductors . Their conductors are coprime to the odd primes in the product. Hence quadratic Kronecker–Weber theorem by ramification gives the explicit conclusion
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 23 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be a primitive nth root of unity. The cyclotomic polynomial isInduction on shows that is monic with integer coefficients. Here is the essential irreducibility of cyclotomic polynomials argument. Let be the minimal polynomial of and let be a prime. If had a different monic irreducible polynomial , then . Reducing modulo gives , so and have a common factor. As , this would give a repeated factor of modulo , impossible because its derivative is . Thus is conjugate to . Every positive integer prime to is a product of such primes, so all primitive nth roots of unity are conjugate. ConsequentlyIn particular the cyclotomic field is an abelian extension. Complex conjugation corresponds to ; for its fixed field is , the maximal real subfield, of degree .
The ring of integers is . One way to see that there is no missing index is to work at each prime . Write with . The prime-to- roots of unity have separable reduction; their local factors generate unramified extensions with full integer rings. Over each such factor, adjoining is generated by the Eisenstein polynomial , with uniformizer , and hence gives the full integer ring of that totally ramified factor. The coprimality of and means that generates both sets of roots of unity. Thus is maximal at every , proving the integral assertion.
The same local description computes ramification and splitting. For , the ramification index is one, the residue degree is the multiplicative order of modulo , and there are primes above . If , put ; thenwhere . Indeed, the prime-to- part is unramified, and the -power part is totally ramified by the preceding Eisenstein polynomial. Notice the exception : its ramification index is one, consistently with for odd . Thus finite ramification occurs only at the indicated conductor primes, with that exception.
We now prove cyclotomic Artin reciprocity over the rational numbers, using arithmetic Frobenius automorphisms. If and lies over , then Frobenius sends the reduction of to its th power. Distinct nth roots of unity remain distinct modulo , since has separable reduction. Hence the Artin symbol is exactlyExtend multiplicatively to the group of rational fractional ideals prime to . Such an ideal has a unique positive rational generator whose numerator and denominator are prime to . The formula isEvery unit residue modulo has a positive integer representative prime to , so this Artin map is surjective. Its kernel is precisely the subgroup generated by positive . ThereforeThis proves the Artin reciprocity law for this extension, including its principal-ray kernel. The infinite component of the modulus records positivity and therefore the possible action of complex conjugation.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose an integral Weierstrass equation of an elliptic curve with unit elliptic-curve discriminant. For , choose homogeneous coordinates in with at least one unit by multiplying all three coordinates by a common power of . DefineTwo primitive integral representatives differ by a unit, so this is well-defined. Every point of the reduced cubic is a nonsingular point of an algebraic curve, and the identity reduces to . This definition includes points whose affine coordinates are nonintegral.
To prove the good-reduction map respects elliptic addition, use the smooth proper integral model. The elliptic curve group law is a morphism on this model, constructed by addition of degree-zero divisor classes; it is defined even where an affine chord formula has a vanishing denominator. Passing to the residue field commutes with this morphism. Henceso reduction is a homomorphism of abelian groups.
For surjectivity, the simple-root Hensel lemma says that if , and , then there is a unique with and . The point at infinity lifts to . At an affine point of the reduced equation , being a nonsingular point of an algebraic curve means at least one partial derivative is nonzero. If , fix any integral lift of and apply the Hensel lemma to to lift . If , fix and lift instead. This proves the surjectivity of good reduction over a local field and gives
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The supplied integral equation has elliptic-curve discriminant . It therefore has good reduction at every . At eleven its discriminant has valuation one. Under a change of Weierstrass equation of an elliptic curve, discriminant valuations differ by a multiple of twelve. A good integral model would have valuation zero, which is impossible. This is the discriminant valuation obstruction to good reduction; it also shows the displayed model is minimal at eleven. Hence
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An elliptic curve over has good reduction at if it admits an integral Weierstrass equation of an elliptic curve over whose reduced projective cubic is a smooth algebraic curve over . Equivalently, its Minimal Weierstrass equation has a unit elliptic-curve discriminant, or its smooth proper model is an elliptic curve over the valuation ring. The existence of an appropriate integral model matters: a nonminimal equation can have discriminant divisible by even when the curve has good reduction. Equivalently,
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Only the prime two can ramify. More precisely, every field is unramified at every odd prime; actual ramification at two depends on and the chosen division point. Use , as printed in the original PDF.
Fix an odd prime and put . The elliptic-curve discriminant gives good reduction at , and is a unit in . The unramified division torsors at good primes imply that all division points of an elliptic curve above are defined over finite unramified extensions of . Here is a direct lifting proof, which does not require to have integral affine coordinates.
Properness gives a reduction . Choose a point with over the algebraic closure of the residue field, and a finite residue extension containing it. Pass to the corresponding finite unramified extension . The surjectivity of good reduction over a local field lifts to . Its error lies in the kernel of reduction of an elliptic curve. The prime-to-residue-characteristic multiplication on a formal group makes bijective on that kernel. Choose the unique kernel point with ; then satisfies and has reduction .
Every algebraic division point has some such reduction and is the unique lift in its division fibre: the difference of two lifts lies in the reduction kernel, which has no -torsion. Thus every chosen lies in an unramified local extension. For every prime of its possibly non-Galois coordinate field above , the ramification index is one. Globally,One cannot universally assert that two actually ramifies: and give the field . It can ramify. For example, a half of isThe elliptic curve group law verifies this by doubling. Its coordinate field contains , which has ramification in the quadratic extension generated by the square root of two, so the only possible bad prime does occur for this choice.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The rational point lies on and is neither the identity nor . By solution these are all the rational torsion points of an elliptic curve. Hence has infinite order and is infinite: its multiples are distinct. No assertion about its being a generator or about the exact rank of an elliptic curve is needed here.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the two-prime bound on rational elliptic torsion with the counts six at three and eight at five from solution. For a prime , the -primary torsion subgroup injects into both reduced groups by reduction of torsion points on an elliptic curve. Its order therefore divides the corresponding primary part of . The three-primary subgroup injects into the group of order eight at five and is trivial; the five-primary subgroup injects into the group of order six at three and is trivial. Hence the entire rational torsion subgroup has order at most two.
The factorization supplies , a nonidentity point of order two under the elliptic curve group law. ThereforeThe primary-component argument avoids assuming injectivity on residue-characteristic torsion.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For each , count the roots of , and add the identity at infinity. A nonzero quadratic residue gives two roots, zero gives one, and a nonsquare gives none. Equivalently, with the Legendre symbol extended by ,The numbers of affine values, in increasing order starting at zero, areso the answer isAll four reductions are smooth algebraic curves: the original PDF gives the elliptic-curve discriminant , so these odd primes are primes of good reduction.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , the two-isogeny formula gives . By the prime-support bound in two-isogeny descent, the image of the two-torsion square-class homomorphism on lies in . The identity gives , gives , and gives , since . The image is a subgroup of the square-class group, so their product occurs as well; explicitly . HenceOn , a nonzero affine point has , because . The only candidate square classes are therefore . The identity gives , gives , and gives , since . Their product occurs; adding gives . ThusBoth images have order four. The two-isogeny rank formula provesThis is the rank-two elliptic curve with cubic x cubed minus seventeen x; all candidate classes are represented, so no unresolved local-to-global gap in isogeny descent remains in this computation.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The obstruction is the local-to-global gap in isogeny descent. A two-isogeny descent quartic can have points over and every p-adic field without a rational point. Local tests compute an isogeny Selmer group, which can strictly contain the rational-point quotient. For an isogeny of elliptic curves , the comparison isThe last group is the kernel of , so it records elements of the Tate–Shafarevich group invisible to all local tests. Searching a locally soluble covering which has no rational points never succeeds. Thus a Selmer group of an elliptic curve gives an upper bound and found independent points give a lower bound, and these need not coincide. Higher descent can improve the bounds, but this particular procedure has no unconditional guarantee of closing every gap.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 21 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Mordell-Weil theorem gives . Move the rational point of order two to and clear denominators to obtain an integral Weierstrass equation of an elliptic curveThe two-isogeny formula gives and dual isogenies , with . Compute the torsion subgroup using reduction of torsion points on an elliptic curve at several good primes, followed by division polynomials of an elliptic curve to identify the possible points.
For the free part, use two-isogeny descent. The two-torsion square-class homomorphism isin , with kernel ; define on similarly. The prime-support bound in two-isogeny descent restricts the first image to signed square-free divisors of and the second to those of . For each candidate , solve its two-isogeny descent quarticTest local solubility at the real place and the relevant p-adic fields, discard impossible classes, and search the surviving coverings for rational points. A point with gives , . Include the identity and rational 2-torsion cases separately. Once both rational images are determined, the two-isogeny rank formula givesThe point searches give explicit candidates for a basis. Their canonical height pairing can certify independence; Mordell-Weil saturation and effective height bounds then certify that they generate the full free part. Rank alone does not certify generators of the whole Mordell-Weil group. If the rational images are not fully determined, the procedure instead supplies lower and upper bounds on the rank of an elliptic curve.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 20 4 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Booleanization of a locale is the sublocale with double-negation nucleus. A flat sublocale has a nucleus preserving finite joins, equivalently its fixed-element set is closed under ambient finite joins. For completeness, if a nucleus preserves finite joins then its fixed points are closed under them. Conversely, if fixed points are closed under joins, is fixed and bounds , giving ; monotonicity gives equality, and preservation of is precisely . Since , condition (iv) is exactly (iii). Together the preceding implications prove all four characterizations of an extremally disconnected locale.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 20 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Conversely assume binary-join preservation by double negation. Since , applying the assumption givesAlso . Thus is complemented, and every regular open element is clopen. This proves (iii) implies (ii). Double negation already preserves and all finite meets, so binary-join preservation here is equivalent to preservation of all finite joins.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 20 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose every regular open element is complemented. In a Heyting algebra, a complemented element is regular: if and , then and . Finite joins of complemented elements are complemented. Hence is regular, and it is the least regular upper bound of . ThereforeThis proves (ii) implies (iii). The identification of the regular open elements with interiors of closures was established in the preceding part.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 20 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and . The closure of the open is the closed sublocale with closed nucleus ; its interior is the open . The closed sublocale complementary to is also open precisely when is complemented, in which case its open representative is . Thus the closure is clopen precisely when the regular open element is complemented. Every regular open element has this form, so (i) and (ii) are equivalent.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 19 7 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In the game , where , the players alternately choose natural numbers and produce a sequence . Player I wins exactly when . A strategy in an infinite game assigns a move to every finite position where its player is to move; it is winning if every play following it is won by that player. A game is determined if one player has a winning strategy. Both cannot have winning strategies, since their joint play would have to be won by both. The axiom of determinacy asserts
Without assuming AD, one can prove determinacy for finite games by backward induction, and for games with open or closed payoffs by the following argument. Give its product topology of discrete move coordinates. If is open, let be the finite positions whose entire cylinder of extensions lies in . Form a winning-position attractor in an infinite game by transfinite recursion: add an I-position if some child has already been added, and add an II-position if all its children have already been added. Take unions at limits. The process stabilizes because there are only set-many positions and each genuine successor change adds a new one.
An added nonterminal position receives its least entry ordinal. At an I-position in the stable attractor, choose a child of smaller rank; at an II-position every child has smaller rank. Thus every play following I's rank-decreasing strategy must reach : an infinite strictly descending sequence of ordinals cannot exist. The resulting play is in , so I wins from any position in the attractor.
Outside the attractor, every child of an I-position remains outside, and an II-position has some child outside. Otherwise the ranks of all its children would have a set-sized supremum and the parent would have been added at a later stage. II chooses such a child and keeps the play outside forever. If its outcome were in the open set , some finite prefix would have its entire cylinder in , contrary to this avoidance. Therefore II wins from outside. With natural-number moves the least suitable child may be chosen at each position, so no choice axiom is needed for these strategies. This proves open determinacy. For a closed payoff, apply the same argument to its open complement with the players' winning roles interchanged. Clopen payoffs are included in both results.
Now assume AC and construct an undetermined game. The set of strategies for either player has cardinality , since a strategy is a function on a countably infinite set of positions. Each fixed strategy is compatible with plays: the other player's sequence of freely chosen moves determines distinct full plays. Use choice to enumerate I's strategies as and II's as , and well-order the space of plays.
Recursively choose following and following , with all selected plays distinct. At stage fewer than plays have been used, while each compatible-play set has size , so fresh choices exist; take the least ones in the fixed well-order. This does not require regularity of , since for every below its initial ordinal.
Put . Every I-strategy has the losing compatible play , and every II-strategy has the losing compatible play . Therefore neither player has a winning strategy. This choice diagonalization of an undetermined game provesThe elementary determinacy proofs above concern specified definable payoff classes; the diagonal construction explains why extending them to every arbitrary subset of the play space is incompatible with choice.
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





