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 2013 iii Paper 74 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
In a small regular category , the regular coverage has one-arrow covers: each regular epimorphism is a covering family by itself. Identity maps, composites and pullbacks of such arrows are again covers, so this is a basis for a Grothendieck topology. A presheaf is a sheaf precisely when every compatible section over a covering arrow descends uniquely along that arrow.
It is subcanonical. A section of the representable presheaf over is a map . Its matching condition is on the kernel pair . Since a regular epimorphism is the coequalizer of its kernel pair, there is a unique with . This is exactly the sheaf condition for .
For a subfunctor of a regular-coverage sheaf, define local membership byThis is a subfunctor. If and witnesses membership, pull back along ; the resulting cover of witnesses membership of , because is stable under restriction.
It is a sheaf as well. Let cover and let satisfy the kernel-pair matching condition. The sheaf gives a unique with . Choose a cover with . The composite is a cover of and witnesses . Uniqueness comes from . Thus the inclusion is a mono between sheaves and is closed for the associated local operator.
Moreover, any closed subobject containing is itself a sheaf. If , its restriction along a witnessing cover lies in , and the sheaf condition for descends it to a section in . Its image in is by uniqueness. Hence is the least closed subobject containing , andThis proves the local membership closure for the regular coverage, with a single regular epimorphism as witness.
Suppose is the union, in the sheaf topos, of a family of subsheaves . The union in presheaves is the pointwise union ; its closure is the union in sheaves. Thus . A witnessing cover belongs to for one index . The two restrictions of to its kernel pair agree. Since is a subsheaf, this matching section descends in to . Every map is the restriction of along , so . Therefore every representable sheaf is irreducible, even with respect to arbitrary unions. There are no empty covering families in this coverage, and also shows that the representable cannot be initial.
Finally, in the regular syntactic category of a regular theory, the context formula defines an object . Each formula defines a mono , and the associated representable subsheaf is its interpretation inside in the generic model. A derivation of the coherent disjunction says that these finitely many subsheaves have union . Irreducibility gives for some . The Yoneda embedding is full and faithful, since the coverage is subcanonical, and therefore reflects this isomorphism. Hence is invertible in the syntactic category: entails . ThusThe disjunction is an outer coherent conclusion; the theory and all constituent formulas are regular. This disjunction property of regular theories follows from single-arrow descent, rather than from ordinary first-order compactness.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For each object , characteristic maps identify with . These subobject posets carry a natural Heyting algebra structure. Truth and falsity classify and the empty subobject. Intersections define , unions define , and implication is characterized byThese operations commute with pullback, giving arrows on and the internal Heyting algebra of truth values. Concretely, the order relation on is the subobject where ; its characteristic map is implication. Negation is .
If has truth value , its quasi-closed local operator isThis is double negation relative to the bottom value . In the Heyting algebra interval , relative implication is inherited and relative negation is . Also . Therefore the displayed map is the composite of adjoining and relative double negation. It is inflationary, idempotent, fixes truth and preserves binary meets, so it is a Lawvere-Tierney topology. Its value at bottom is .
The truth values of its sheaf topos are the fixed elements . They have bottom , inherited meet and join . Their relative negation is , which is again fixed because . The relative double-negation law holds on every fixed element, andThus every subobject in the sheaf topos has a complement: every quasi-closed subtopos is Boolean. This identifies its internal logic, not merely the global truth-value lattice.
Now work in . The arrow is a subterminal object there; internally it supplies a freely varying generic truth value . Let be sheafification for a local operator for its quasi-closed topology, and let be the slice geometric morphism. The composite has inverse image .
To prove surjectivity, take any mono in , classified by . Its pullback along has predicate , independent of the generic . If sends the mono to an isomorphism, it is -dense in the slice, sofor all . Pull back this identity along the graph . Substituting gives , and therefore . Thus the original mono was already invertible.
For parallel arrows , equality of their inverse images makes the inverse image of their equalizer invertible. The preceding mono argument makes the equalizer invertible and hence . Therefore is faithful, and the composite is a surjective geometric morphism. A fixed double-negation subtopos can erase information; allowing the generic relative bottom is what detects every original predicate.
For the completeness consequence, let be coherent and use its classifying topos with the generic model. Its conservative syntactic interpretation makes an underivable coherent sequent fail as a subobject inclusion. Pulling this model into the Boolean cover constructed above preserves coherent formulas and still refutes that inclusion, because the inverse image is faithful and reflects containment. In the Boolean topos, the difference between antecedent and consequent is a nonzero complemented subobject. Slicing over that difference gives a nondegenerate Boolean topos with a global tuple satisfying the antecedent and the negation of the consequent.
Classical first-order deduction is sound in a Boolean topos. Hence together with constants for that tuple, the antecedent and the negated consequent is classically consistent: a proof of contradiction would hold in the nondegenerate sliced model. The ordinary Henkin construction supplies a set model of this consistent theory. Briefly, extend it by witness constants, complete it to a maximal consistent theory, form the term structure modulo provable equality, and prove the truth lemma by induction on formulas. For possibly empty sorts use the standard encoding by sort predicates and functional graph relations, without asserting sort inhabitance; the constants for the chosen tuple assert only the needed witnesses. The resulting set model is a countermodel to the original sequent.
Consequently a coherent sequent valid in every set-valued model of a coherent theory is derivable in coherent logic. The Boolean cover supplies the crucial passage from the generic intuitionistic countermodel to consistency with classical negation; the final set-model step uses ordinary first-order completeness via its Henkin proof, rather than an assumption that every Boolean topos has points.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 4 a by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A Cartesian theory has a many-sorted first-order signature, with finite arities, and axioms expressed as sequents between Cartesian formulas. Those formulas use atomic relations and equality, truth and finite logical conjunctions. They also admit existential quantification when the quantified witness is provably unique: to form , require relative to the theory. One can quantify a finite tuple in the same way. Arbitrary existential quantifiers, disjunction, negation and universal quantifiers are not formula constructors in this fragment. In particular falsity is not included as an additional finite-limit constructor. The universal force of a sequent comes from its free-variable context. This is the fragment whose categorical semantics requires exactly finite limits.
The Cartesian syntactic category has objects , identifying harmless renamings and provably equivalent formulas-in-context. An arrow from to is represented by a provably functional Cartesian relation : it entails , is total on , and has a unique output tuple. Provable equivalence identifies arrows. Equality supplies identity arrows; composition quantifies the uniquely determined intermediate tuple in a conjunction. Totality and uniqueness prove that the composite is again functional.
The empty truth context is terminal. Products concatenate disjoint contexts and conjoin their formulas. A pullback of two functional relations adds the condition that their outputs agree; the common output is unique, so the existential quantification used to express it is Cartesian. This gives all finite limits and makes the usual equality diagrams into equalizers.
An internal model in a finite-limit category interprets each sort by an object, functions by arrows and relations by subobjects. Equality is a diagonal and conjunction is a pullback intersection. A uniquely witnessed relation projects monomorphically onto the context, so its existential interpretation needs no general image operation: it is that mono. Evaluating formulas and functional relations yields a finite-limit-preserving functor .
Conversely, the canonical syntactic model uses the single-sort truth contexts, term graphs and atomic subobjects. Its interpretation of a formula is the formula-in-context object itself. Applying any finite-limit-preserving functor supplies a model and preserves its axioms. These constructions are inverse up to the natural interpretation isomorphisms; model homomorphisms correspond to natural transformations. Therefore
For completeness, let a sequent in context be represented by subobjects and for its antecedent and consequent. Derivability is exactly the existence of a factorization in the syntactic category. Consider the covariant representable functor , which preserves all existing limits, and hence corresponds to a set-valued model. In that model the element belongs to the antecedent, because it is the image of . If the sequent holds, it also belongs to the consequent, so for some . That is precisely a derivation of the sequent. Thus validity in all set-valued models implies Cartesian derivability. More concretely, every underivable sequent is refuted by this representable model. No assumption that every sort is inhabited is needed: some hom-sets may be empty.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write the Cartesian comonad as , with preserving finite limits. A coalgebra for a comonad is with , and . Its forgetful functor is faithful, creates finite limits, and has the cofree coalgebra right adjoint . We construct the two remaining topos structures explicitly.
For exponential objects, take coalgebras and start with . Put , with structure , and letTranspose the following two maps into maps :using . The cofree adjunction transposes once more into coalgebra morphisms . Let be their equalizer. A coalgebra map corresponds to an arbitrary ambient map . It factors through precisely whenwhich is exactly the condition that be a coalgebra morphism. Therefore represents and is the required exponential in a coalgebra topos.
For the subobject classifier, let classify the mono . In the cofree coalgebra , formBoth arrows are coalgebra morphisms. The cofree transpose of factors through this equalizer and gives its true arrow. To verify classification, let have ambient characteristic map . It supports a subcoalgebra of exactly when it is invariant under , equivalentlyThe counit proves the reverse containment in the first equation; the forward containment supplies the restricted structure map, whose coalgebra laws follow through the mono. Under the cofree adjunction, the second equation says exactly that factors through . Pulling back its true arrow recovers , since . This proves the universal property of the subobject classifier of a coalgebra topos. Hence is a topos.
Now let be a geometric morphism, with . The comonad is Cartesian: preserves finite limits and the right adjoint preserves limits. Put , already a topos. The forgetful adjunction defines with , so is faithful.
The comparison functorpreserves finite limits. It has a right adjoint , given on a coalgebra byIndeed, the transposed arrow corresponds to a coalgebra map exactly when it equalizes these two maps. Applying the finite-limit-preserving shows that is the equalizer ofThat equalizer is . If equalizes the pair, then , proving the claimed universal property. Consequently the counit is invertible. The fully faithful adjoint criterion makes full and faithful.
Thus defines a geometric embedding , and identifies the composite with . The requested factorization iswhere is a surjective geometric morphism and is full and faithful.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Take the definition of an elementary topos as a category with finite limits, exponential objects and a subobject classifier . Its power object is , and is precomposition with . Transposing a predicate on in either variable givesThus is left adjoint to the contravariant power-object functor .
Here are the remaining hypotheses for the crude monadicity theorem, obtained from those topos axioms. The unit of this adjunction is , internally . It is monic: if two such evaluations agree, evaluate on the singleton predicate classified by the diagonal to obtain . If is invertible, naturality therefore makes monic. The characteristic map of this mono, regarded as a global element of , pulls back along to the everywhere-true predicate on . Since is monic, that characteristic map was already everywhere true on . The classifier pullback then says that is invertible. Hence is a conservative functor.
It remains to check preservation of reflexive coequalizers in the opposite category. Equivalently, let be a coreflexive pair, with satisfying , and let be their equalizer. Both and are monic. For any mono , there is a direct-image map between power objects: a subobject is sent to its composite with . This uses only classification of monos, not the prior existence of general images or colimits. We have .
For a predicate , consider its direct image along . Its pullbacks along the two sections areTo verify the second equality, with implies after applying , and therefore ; conversely supplies that witness. This argument works for parameterized subobjects as well, so it is an equality of arrows between power objects.
Now if satisfies , then . Hence is its unique factorization through , uniqueness following from the section . Thereforeis a coequalizer. Finite limits supply every required coreflexive equalizer. The right adjoint reflects isomorphisms and preserves the corresponding reflexive coequalizers, so is monadic. In particular is equivalent to the Eilenberg-Moore category of the double-power-object monad on .
Let be a logical functor, and suppose . Preservation of exponentials and the classifier gives , compatibly with the units, counits and resulting monads. Thus is the algebra functor lifting the base functor through the two monadic power-object functors. The adjoint lifting theorem for monad algebra functors applies to the base adjunction : its required coequalizers exist in , because has finite equalizers. It supplies a left adjoint . Taking opposites gives , the required right adjoint to .
Preserving either of the two logical structures by itself is insufficient. For the exponential example take constant at . The constant-empty functor is its left adjoint, since both relevant hom-sets are singletons. Its canonical exponential comparison is , so it preserves exponentials. It has no right adjoint: a functor with a right adjoint would preserve the initial object, whereas .
For the classifier example take to be fixed points. The trivial-action functor is left adjoint to . In a group-action topos the classifier is the trivial-action two-element set, since invariant subsets have ordinary equivariant characteristic maps. Therefore preserves the classifier, its true arrow and the terminal object. But does not preserve the coequalizer of the identity and the nontrivial translation on the regular two-element group set: that coequalizer is , while the fixed-point sets of the domain and codomain of the parallel pair are empty. Their set-theoretic coequalizer is empty, not . Thus has no right adjoint.
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





