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 20 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A decidable object in a topos has a decomposition , with representing inequality. In the internal logic of a topos, equality on is decidable. These categorical complements behave well under pullback.
For a subobject , pull back the displayed decomposition along . The diagonal pulls back to , while pulls back to its complement. Hence every subobject of a decidable object is decidable; the subobject itself need not be complemented in .
For two decidable objects, the diagonals of and give four disjoint summands of , according as each coordinate pair is equal or unequal. The both-equal summand is , and the other three give its complement. The terminal object is decidable, so induction gives closure under finite products, including the empty product.
For a family of decidable objects with an existing coproduct , products distribute over this coproduct, givingThe coproduct injections in a topos are disjoint. The diagonal consists of in each summand, and has complementConsequently every existing coproduct of decidable objects is decidable, including the initial object. In a Grothendieck topos all small coproducts exist. No assertion that arbitrary products preserve decidability is used.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 20 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write the comonad as and its category of coalgebras for a comonad as . A coalgebra for a comonad is a map with and . A morphism satisfies . Let be the forgetful functor and let be the cofree coalgebra. The adjunction has the explicit correspondenceWe construct the three pieces of the elementary topos structure.
Because preserves finite limits, each underlying finite limiting cone has a unique coalgebra structure induced by the structures on its vertices. The counit and coassociativity equations can be checked after its jointly monic projections. Thus creates finite limits and reflects isomorphisms. A morphism of coalgebras is monic exactly when its underlying morphism is monic, by the diagonal criterion using the created pullback.
For exponentials in a coalgebra topos, fix coalgebras and and put in . On the cofree coalgebra there is an underlying evaluationThe two mapsuse in the second expression. Transpose them in to maps , and then transpose across to coalgebra morphisms . Take their equalizer in .
An underlying map corresponds to a coalgebra map . The equation saying that the original map is a coalgebra morphism is precisely , since for the structure . By the cofree adjunction, this is equivalent to , hence to unique factorization through . Thereforenaturally in . This constructs the required exponential object.
For the subobject classifier of a coalgebra topos, let be the underlying subobject classifier, and let classify the mono . Its cofree transpose is the coalgebra endomorphismDefine as the equalizer of and . The transpose of factors through this equalizer and gives .
Indeed, for a subobject classified by , the pullback has characteristic map . It is always contained in , by naturality of the counit. Equality holds exactly when restricts to a coalgebra structure on ; its axioms then follow by composing with the monomorphisms and . Under , the classifying map becomes . The equality of subobjects is . Transposing this equality gives , so exactly the coalgebra subobjects correspond to maps . Their pullback of is the desired subcoalgebra, and uniqueness follows from uniqueness of .
Thus we have finite limits, exponentials and a subobject classifier:The construction does not assume that preserves the underlying exponentials or underlying subobject classifier.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 6 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Start with a model of ZFC+, which also satisfies Generalized continuum hypothesis, and add one Cohen real by the countable forcing of finite binary sequences. Its countable chain condition for forcing preserves cardinals. For every infinite ground cardinal , a nice forcing name for a subset of is specified by countable forcing antichains of a countable forcing. The number of such forcing names is at mostin the ground model. The ground subsets already supply the preserved lower bound . Thus the extension still satisfies for every infinite cardinal, namely Generalized continuum hypothesis.
The Cohen real is not in the ground model: for each ground real it is dense to disagree at a new coordinate. Forcing leaves the ordinals unchanged, and constructible levels are absolute, so the extension has the same constructible universe as the ground model. The new real is therefore not constructible. We obtainThe forcing theorem makes this a relative-consistency construction. Thus, if ZFC is consistent, ZFC+Generalized continuum hypothesis does not prove . This is the one-Cohen-real preservation of GCH argument, not a claim that every arbitrary GCH-preserving forcing leaves unchanged.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use -completeness in its usual forcing sense: every decreasing chain in a partial order of stronger conditions of length less than has a common stronger bound. Let and choose forcing that it functions the ground ordinal into the ground set . Below any stronger condition , recursively decide each value of in order. At a successor step the deciding conditions are dense, and at a limit stage use -completeness. After all steps take another common bound. The recursion and its choices can be performed in , using ground choice and closure, and it records a function in .
Thus below every stronger than there is a condition forcing for some ground . The set of such whole-function deciding conditions belongs to and is dense below . Genericity with makes meet : adjoin the conditions incompatible with to obtain a globally dense subset of a forcing order, and use directedness to rule out the incompatible alternative. A condition in then gives .
The reverse inclusion follows because ground functions remain functions with the same domain and values. ThereforeThis closed forcing adds no short ground-valued sequences argument needs density of complete decisions. A single arbitrarily constructed lower bound need not belong to , and would not by itself prove the claim.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Work over a ground model of ZFC+Generalized continuum hypothesis and let . Force with finite binary partial functions on , with extensions stronger. The Delta-system lemma thins any uncountable family of finite domains to an uncountable family with one common root. Only finitely many binary assignments on that root occur, so two conditions agree there and their union is a common extension. Hence the forcing has the countable chain condition for forcing and preserves cardinals and cofinalities.
The generic union yields distinct reals. Totality at each coordinate is dense, and for two different coordinates it is dense to assign different values at some unused natural-number position. Thus the extension satisfies .
A nice forcing name for a subset of uses one countable forcing antichain at each ordinal below . Since the forcing has size , there are at most such forcing names. Ground Generalized continuum hypothesis gives ; for instance apply the Hausdorff formula at and the Generalized continuum hypothesis arithmetic below it. Therefore in the extension. Combining the bounds givesThe ordinal and cardinal is the same in both models by the chain in a partial order condition. The forcing theorem formalizes this construction as the requested relative-consistency implication. A countable transitive ground model is a convenient presentation, not an additional consequence silently derived from mere consistency. This is the Cohen forcing two-level continuum plateau.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be any set in the extension. The set belongs to . Ground-model choice well-orders it, so fix an enumeration by an ordinal in . In , takeEvaluation gives a surjection from onto . This is a set function by the ZF part of the forcing theorem; no extension choice is needed. For each , take its least preimage ordinal. Distinct have distinct least preimages, which well-order by their inherited ordinal order. Since every extension set has a forcing name, every set in is well-orderable. ThereforeThis choice preservation by well-ordered names tolerates repeated evaluations, because the least-index step removes them canonically.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A kappa-filtration is an increasing continuous sequence with union and at every stage. Intersect with the club set of nonzero limit ordinals. For each remaining , continuity gives , so choose with . This is a regressive function. Fodor lemma gives a stationary subset and a fixed such that all these values lie in .
Since , partition into fewer than fibers of . If every fiber were nonstationary, choose a club set avoiding each one. Their intersection is club set by regularity, contradicting stationarity of . Thus one fiber is stationary, andThis proves the filtration form of Fodor lemma; continuity at limit stages, the small size of each stage, and regularity of are all used.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Fix a diamond principle sequence . Construct a normal splitting set-theoretic tree of height with countable levels. At successors give every node two successors. At a countable limit stage , the set-theoretic tree below is countable. Choose countably many cofinal branches through it covering all its nodes, and put one node at level above each distinct chosen branch. This preserves extension to all higher levels and tree with unique limits.
Arrange a coding of each level into the ordinal block . On the club set of limit fixed points of , the nodes coded below are exactly the nodes of height below . At a limit stage, if codes a maximal tree antichain of the current set-theoretic tree below , require every chosen branch to meet it. This is possible: for any starting node , maximality provides a comparable tree antichain member; if above , first extend to it, and if below , it has already been met. Then extend along a sequence of heights cofinal in . If the prediction is not a maximal tree antichain, use the ordinary covering branches. Thus every level is countable and the construction remains normal.
Here is the full chain-condition verification. Let be a maximal tree antichain in the final set-theoretic tree. For every node , choose a witness comparable with . There is a club set of countable limit stages closed under these witness choices: starting from any bound, repeatedly bound the heights of witnesses for all the countably many nodes below the current stage, and take the supremum after countably many steps. At such an , is already maximal in .
View as a subset of through the coding. Diamond gives stationarily many stages with . Choose one also in the witness-closure club set and the coding club set. The construction at that stage seals this very tree antichain: every node of level extends one of its members below , and so does every node at a later level. No such node can itself belong to , since it is comparable with an earlier member of . HenceEvery tree antichain extends to a maximal one, so the set-theoretic tree has no uncountable tree antichain. Its normal splitting also excludes uncountable branches by part (ii). It is therefore a Suslin tree. By the standard Suslin-tree characterization of Suslin hypothesis, diamond implies failure of Suslin hypothesis. The decisive step is antichain sealing by diamond, with maximality below a correctly guessed club set stage verified explicitly.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the standard normal set-theoretic tree convention: a unique root, extensions at every higher level, splitting into at least two successors, and tree with unique limits. The small-level and height assumptions already give an -tree, while the given tree antichain condition gives the countable chain condition for forcing. We only need to exclude an uncountable branch.
If such a branch existed, its heights would be unbounded, since each initial segment contains only countably many nodes. Fill in predecessors to obtain its node at every level. At each successor step choose a successor of different from . For , the node extends the branch successor , and so is incompatible with . Thus is an uncountable tree antichain, a contradiction.
Therefore the set-theoretic tree is -Suslin. The splitting part of normality matters: a single chain in a partial order of height would satisfy the tree antichain condition but not the conclusion if one used a weakened definition of normality allowing no splitting.
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





