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 2014 iii Paper 19 6 i c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The Delta-system lemma states that every uncountable family of finite sets contains an uncountable subfamily and a fixed finite root such thatAt a regular uncountable cardinal , a family of finite sets has a Delta-system subfamily of size . The root may be empty. Neither version asserts that all sets in the original family have the same intersection.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 6 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A set is a generic filter over if it is nonempty, is closed towards weaker conditions, is directed towards stronger common extensions, and meets every dense subset belonging to . Density means that every condition has a stronger extension in . Genericity is relative to , not to every dense subset of a forcing order in the ambient universe. Under the printed weaker-first convention in Question 5, closure is towards smaller conditions and directedness is towards larger ones; in the standard stronger-first notation these inequalities reverse.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 6 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A forcing collapses a cardinal over if it forces that the ground ordinal is no longer a cardinal: in the extension there is a bijection from some smaller ordinal onto . Equivalently there is a surjection onto from an ordinal whose ground cardinality is smaller. Forcing preserves the ordinal itself; collapse changes cardinality, not the identity of the ordinal. If the assertion is about one particular generic extension, the witnessing collapse is interpreted there; a forcing-wide assertion means it is forced by the weakest condition.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 iv c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
In , take ordered by extension. Strong inaccessibility gives . In , each of these ground levels is therefore countable, while the height is . Thus the unchanged ground set-theoretic tree is an -tree in the extension.
Every ground binary function of length still yields a distinct cofinal branch through this set-theoretic tree. There are such branches. The -chain condition preserves cardinals at and above , so . The ground branch family still has at least that cardinality. ConsequentlyThis Kurepa tree from an inaccessible binary tree uses ground-model levels and branches; it does not claim the full binary set-theoretic tree newly computed in the extension has countable levels.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 iv b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For every infinite , the generic union at coordinate gives a function . The requirement to assign is dense for each , and the requirement to use any specified value is dense by assigning it at a fresh natural-number position. Therefore is a surjection, and every ordinal below becomes countable.
The -chain condition preserves the regularity of . For a direct verification, a forcing name for a function from some into has fewer than possible values at each coordinate, using a maximal deciding forcing antichain. The union of these possible-value sets has size less than by regularity and is bounded in . No such function can be cofinal. In particular remains uncountable, while every smaller ordinal is countable. HenceThis is the finite Lévy collapse to omega-one.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 iv a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
All cardinalities in this part are first computed in . The forcing has size . A family of finite domains has a -sized Delta-system, since is regular. There are fewer than possible value assignments on its finite root: each coordinate allows fewer than values. Regularity lets us thin to two conditions, indeed many, with identical root assignments. Their union is a condition, proving the -chain condition.
Consequently every maximal forcing antichain has cardinality less than , but there is no one compulsory cardinality. For any nonzero cardinal , the single-coordinate conditions assigning the values at form an forcing antichain of size . It is maximal: a condition already assigning that coordinate is compatible with its matching value, and a condition not assigning it is compatible with every allowed value. Thus every such size occurs, including singleton maximal forcing antichains. These are the maximal-antichain sizes in the finite Lévy collapse.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 i c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A forcing preserves cofinalities over if every generic extension hasThe two values are compared as ordinals, using preservation of ordinals by forcing. Equivalently the forcing asserts that no ground ordinal acquires a smaller cofinality. The assertion concerns all ordinal cofinalities, not just that one specified cardinal remains uncountable.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The forcing truth lemma says that for a formula and ground-model forcing names ,The forcing relation is the ground-model relation furnished by the forcing theorem. The witnessing condition must belong to the particular generic filter, not merely to the forcing order.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A forcing name is built by well-founded recursion: every member of a -name is a pair with and itself a -name of lower forcing name rank. In the ground model all such forcing names form the recursively defined class . Its evaluation by a generic filter isThe recursion is on forcing name rank, not on the forcing order. Forcing names need not have a unique evaluation across different generics, and many different forcing names may have the same evaluation.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 i c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A tree with unique limits has no distinct nodes at a limit level with the same history. Precisely, for a limit ordinal and ,Here denotes the unique predecessor of of height . This is uniqueness of a limit node when it exists, not a requirement that every cofinal chain in a partial order below a limit level acquire a limit node.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The stationary-indexed club principle asserts a sequence with each cofinal of order type , such that for every uncountable some satisfies . It predicts a cofinal ladder contained in the target, rather than predicting the entire initial segment of the target as diamond does. For a stationary with successor members, only its stationary limit-ordinal part is relevant; countable limit ordinals have cofinality . This is the restricted version of the club principle.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The partition relation means that for every coloring , there is with such that is constant on . Here denotes the subsets of of cardinality , and the subscript is the number of colors. The domain consists of subsets of size , not ordered tuples, and the definition also makes sense for infinite arity.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 iv b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Prune an -Suslin tree as in part (a), then use its nodes as forcing conditions, with extensions stronger. Two conditions are compatible exactly when comparable, so the absence of uncountable tree antichains is the forcing countable chain condition for forcing. For each , the set of nodes of height at least is dense, by well-pruned set-theoretic tree.
If , full Martin's axiom includes . It would provide a filter in an ordered set meeting all these dense subsets of a forcing order. Directedness makes that filter in an ordered set a chain in a partial order, and meeting every makes its heights unbounded, producing an uncountable branch. This contradicts the Suslin-tree property. A Suslin set-theoretic tree together with failure of Continuum hypothesis therefore implies failure of Martin's axiom. This is the Suslin-tree obstruction to Martin's axiom.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 iv a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a regular uncountable kappa-tree, keep exactly the nodes whose extensions have unbounded heights:This set is predecessor-closed. At any level , if no node survived, the extension heights above each of its fewer than nodes would be bounded. Regularity would give a single bound for their union, contradicting the height of the original set-theoretic tree. Thus every level of is nonempty and still has size less than .
If and , consider its extensions at level . If none survived, fewer than bounded extension sets would again bound every extension of , a contradiction. Therefore a surviving level- extension exists. HenceThis unbounded-extension kernel of a regular tree uses regularity essentially. If one permits singular-height set-theoretic trees in the term “-tree”, the unrestricted assertion is false: take fewer than disjoint branches with lengths cofinal in a singular . The levels are small and the height is , but no node has unbounded extensions. A common root can be added without creating a well-pruned subtree. The usual regular-height convention is therefore the one used here.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 i c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A well-pruned set-theoretic tree of height has the property that every node extends to every higher level below : if , there is of height with . Equivalently, the heights of extensions of every node are unbounded in , since taking predecessors then gives an extension at any prescribed intermediate level. This is stronger than merely having no terminal nodes. For a kappa-tree we use the usual regular uncountable height cardinal and levels of size less than that cardinal.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Martin's axiom at , denoted , says that whenever a forcing order satisfies the countable chain condition for forcing and is a family of dense subsets, there is a filter in an ordered set meeting every . Equivalently, allow any family of at most dense subsets. The filter in an ordered set is directed towards stronger common extensions and closed towards weaker conditions. Full Martin's axiom requires for every . The bound below the continuum is part of the usual full axiom, explaining its role in part (iv)(b).
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For an infinite cardinal, the Gimel function is . The Gimel hypothesis asserts, for every singular cardinal ,These are the unavoidable lower bounds supplied by monotonicity of exponentiation and König theorem for cardinal numbers. The hypothesis imposes the least allowed value at singular cardinals; it does not constrain the continuum function on regular cardinals to their successors. Thus it is weaker than Generalized continuum hypothesis. In the case , it says , the usual singular cardinals hypothesis case.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 2 iii c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be any transitive class model of ZF containing every ordinal. By part (b), all its internally computed constructible levels are the actual levels, and each belongs to, and is contained in, . Their union therefore gives . Using the permitted fact that , and that itself contains every ordinal, we concludeThe word class matters: a set cannot contain every ordinal. Set-sized standard models instead contain their own truncated constructible universe as described in part (b).
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 2 iii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the transitive-model convention for “standard” in this assertion: the domain is a transitive set and membership is actual membership. A standard membership model of set theory without transitivity is a weaker notion and would not justify the asserted absoluteness. Ordinalhood is bounded-formula absolute, so the internal ordinals are precisely . Satisfaction for a set structure is absolute between transitive ZF models containing that structure: the domain, finite parameter tuples, formula codes and the recursive truth clauses are the same. Equivalently one may use the absoluteness of the predicate defining .
Transfinite induction now gives for each ordinal . At successors both computations use the same definable subsets of the same set structure; at limits they take the same union over all smaller ordinals, which belong to by transitivity. ThusFor a set-sized model of ordinal height , this is . The restriction to actual ordinals makes the printed union precise. Mere well-foundedness of a nontransitive membership substructure would not justify these absoluteness steps; transitivity is the intended standard-model convention.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 2 iii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Fix and a formula . The reflection theorem for definable hierarchies supplies a stage containing these parameters at which the finitely many subformulas of have the same truth values as in , for arguments in .
This reflection can be proved in the ambient ZF without presupposing Axiom schema of separation in : starting at a stage containing the parameters, collect for each relevant existential subformula and every tuple in the current stage the least constructible stage in which a witness occurs, whenever a witness exists in . Ambient Axiom schema of replacement bounds these ordinals. Iterate these witness-stage bounds for steps and take their supremum. Induction on subformulas gives the required finite reflection at the resulting union stage. Only the least stage is chosen, so no ambient axiom of choice is needed.
Since is transitive and contains , the desired separated subset isIt is definable over with parameters there, so . Reflection gives . Hence ZF proves every Axiom schema of separation instance relativized to . This is a direct Separation proof in the constructible universe, not an appeal to the assertion being proved.
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





