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 2019 iii Paper 123 2 ii Solution by
Codex 0 2026-10-03
For the coefficient , the p-adic absolute value gives . By Legendre formula,where is the sum of the base- digits of . Thus . The Cauchy-Hadamard theorem now yieldsand therefore the radius of convergence of the p-adic exponential is
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 123 2 i Solution by
Codex 0 2026-10-03
Krasner's lemma states that if is complete, is separable over , and an algebraic element satisfiesfor every other -conjugate of , then .
Let be nonconstant and let be a root in an algebraic closure of . Because the characteristic is zero, replace by the separable minimal polynomial of . Approximate its coefficients arbitrarily closely by elements of . By continuity of roots over a non-Archimedean field, the approximating polynomial has a root arbitrarily close to . Since is algebraically closed, .
Choose the approximation so that is closer to than every other -conjugate of . Krasner's lemma givesso . Hence completion of an algebraic closure of a p-adic field is algebraically closed proves that is algebraically closed.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 123 1 iv Solution by
Codex 0 2026-10-03
LetOver , the Newton polygon has three length-one segments of slopes . The resulting roots can also be obtained directly from Hensel lemma. There is one unit root because is even and is odd. For the two remaining roots, putwhose parenthesized polynomial has a simple root , andwhose parenthesized polynomial has a simple root . Thus splits completely over , with roots of valuations . There are three primes above , and for each one
Over , is an Eisenstein polynomial. Hence there is one prime above , and if is the chosen root thenwith and .
The polynomial is irreducible over by the Eisenstein criterion at . Its polynomial discriminant iswhich is not a square number, so the Galois group of an irreducible cubic isAt , all three roots already lie in , so the local splitting field is trivial andAt , the cubic is totally and tamely ramified. The square class of its discriminant is represented by , a nonsquare unit, so the quadratic resolvent field of a cubic is the unramified quadratic extension of . The local splitting field therefore has degree six, withThese calculations are summarized by local factorization of X3 plus 25X2 minus 50X plus 40.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 123 1 iii Solution by
Codex 0 2026-10-03
Write . The decomposition group and inertia group at areThe transitivity of the Galois action on primes gives as the set of primes above . Completion induces the canonical isomorphismand reduction gives the exact sequenceConsequently , and, if is the number of primes above ,
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 123 1 ii Solution by
Codex 0 2026-10-03
The completion of a number field at a prime ideal does not change either invariant. More precisely, is the valuation ring of , its maximal ideal is , andThus the completed extension has the same ramification index and the same residue-field extension, hence the same residue-field degree . This is completion preserves ramification and residue data.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 123 1 i Solution by
Codex 0 2026-10-03
The prime ideal factorization of iswhich defines the ramification index of a prime ideal . The residue-field degree isLocalizing at makes a free -module of rank , so has dimension over the residue field . The Chinese remainder theorem and the filtration by powers of each decompose this vector space into successive quotients isomorphic to , each of dimension . Therefore the fundamental identity for prime decomposition gives
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 3 iv Solution by
Codex 0 2026-10-03
Fix names and a first-order formula . Using the syntactic forcing relation, form in the nameThis is a set by the axiom schema of separation in . If and , then the forcing theorem gives both and . Conversely, if satisfies , choose with and . The truth direction of the forcing theorem supplies forcing ; directedness of gives below both and , so .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 3 iii Solution by
Codex 0 2026-10-03
Suppose first that . If is any generic filter over containing , the forcing theorem gives . Hence in the semantic forcing relation.
Conversely, suppose . By the stated density equivalence for the syntactic forcing relation, some satisfies . The Rasiowa–Sikorski lemma supplies a generic filter over the countable model containing , and upward closure then gives . The forcing theorem yields , so semantically. Therefore
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 3 ii Solution by
Codex 0 2026-10-03
Let be a cardinal number of . If forcing collapsed , some condition would force a surjective function for an ordinal . Replacing by its ground-model cardinality lets us assume that is a cardinal.
For each , choose in a maximal antichain in a forcing order deciding . The chain condition for forcing makes its size less than , so the set of possible values of has size below . This is the possible-values lemma for chain-condition forcing. Every interpreted range is contained in . If , the fact that is a regular cardinal gives ; if , infinite cardinal arithmetic gives . Either way cannot contain the range of a surjection onto , a contradiction. By cardinal preservation by chain-condition forcing, preserves every cardinal at least .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 2 iv Solution by
Codex 0 2026-10-03
Take a transitive model . In , choose a bijection and encode its graph by a set , using a fixed bijection between and . The relative constructible universe can decode , and therefore contains every real number of ; being an inner model of , it has no additional reals.
Models with the same reals have the same first uncountable ordinal, because their reals code exactly the same countable well-orders. If satisfied the Continuum hypothesis, its bijection between and the reals would also belong to , contradicting . This is the construction in relative constructible universe can violate the continuum hypothesis, and it gives
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 2 iii Solution by
Codex 0 2026-10-03
The definable power set performs one definability step over the single structure , whereas the constructible power set contains subsets of created at arbitrarily late stages of the constructible hierarchy.
For the concrete case , there are only countably many first-order formulas and finite tuples of natural-number parameters, so is a countable set. In contrast, the constructible universe satisfies ZFC, and Cantor theorem makes its full power set uncountable inside . Consequentlyso the two notions do not agree in general.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 2 ii Solution by
Codex 0 2026-10-03
Fix . Inside the ambient transitive model , the Axiom of power set makes the collection of constructible subsets of a set. For each such subset , choose the least stage of the constructible hierarchy at which appears. The Axiom schema of replacement and the supremum of a set of ordinals give an ordinal bounding all these stages; enlarge so that .
Nowis definable over with parameter . It therefore belongs to the definable power set . This set contains exactly the subsets of that belong to the constructible universe, so it witnesses the Axiom of power set in . Therefore Power Set.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 121 2 i Solution by
Codex 0 2026-10-03
The definable power set isThus it contains exactly the subsets of definable over the structure using finitely many parameters from .
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





