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 2015 iii Paper 24 1 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a Sierpiński decomposition of the plane, partition , and one has countable vertical sections while the other has countable horizontal sections. With the orientation fixed as follows,for every real . Interchanging the coordinate directions and the names gives the equivalent convention. Here “countable” includes finite sets.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 24 1 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A strict partial order is a well-founded relation when every nonempty subset has a minimal member:In ZFC this is equivalent to the absence of an infinite descending sequence . A descending sequence violates the minimal-member property; conversely, repeatedly choosing a predecessor from a subset with no minimal member constructs such a sequence using the axiom of choice.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 23 5 e ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A counterexample can even use a nonalgebraic isolated type. Let , , , and . The quantifier elimination for dense linear orders without endpoints shows that all elements have the same complete type over the empty set: a one-variable quantifier-free formula has no order information except and .
Thus isolates . Every is a dense linear order without endpoints, and every element of realizes . Such a model cannot omit it. Even a type with infinitely many realizations need not be omittable; isolation is the relevant obstruction.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 23 5 e i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the first-order language with one constant , take with equality only, and let . SetThis complete type contains and is isolated by that formula. In any first-order structure, at most one element can satisfy . In every , its interpretation of realizes , by elementary equivalence. Hence no elementarily equivalent model has infinitely many realizations of . An algebraic type can have a fixed finite number of realizations in every model.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 6 c iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
If is fully faithful, the criterion proved for a right adjoint says that the adjunction counit of is a natural isomorphism. Its component at is precisely the algebra action . In particular, its component at the free algebra for a monad has underlying morphism . Thus every is an isomorphism, and the natural transformation is invertible. This closes the cycle and proves all four conditions equivalent:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 6 c iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Suppose every algebra action is an isomorphism. Its inverse is , by the unit law for a monad algebra. For any underlying morphism between two algebras for a monad, naturality of givesTherefore every underlying morphism is automatically a monad algebra morphism. The forgetful functor is always faithful, because a monad algebra morphism has no data beyond its underlying morphism, and it is now full as well. Hence invertible algebra actions imply
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 6 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Assume , and let be an algebra for a monad. Its unit identity gives . Naturality of at , followed by the assumed equality, givesThus every algebra action is invertible, with its inverse prescribed by the unit:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 6 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
If the multiplication in the unit and multiplication of a monad is invertible, the two unit identities of the monadmake both and its inverse. Hence idempotence implies equality of the two unit insertions:This is the first implication in the characterization of an idempotent monad.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 5 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
If is an isomorphism, then is isomorphic in to an object of . Since is a replete subcategory, it contains . Thus invertibility of the unit implies membership, completing the cycle of implications:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 5 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Assume the hom-set condition. Its surjectivity at gives with . We show that this splitting is two-sided.
Because is fully faithful, is invertible. Both triangle identities for an adjunction give, after suppressing ,Applying to yields . Naturality of the adjunction unit at gives , hence . Consequently the hom-set condition forces the unit to be invertible:Only surjectivity at was needed for this direction; the given family of bijections certainly supplies it.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 5 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
If belongs to the full subcategory , the adjunction and fullness of its inclusion give, for every ,Therefore membership implies the hom-set condition. In addition, is fully faithful, so the adjunction counit is invertible by the preceding criterion. The triangular equation then shows that is an isomorphism. As in the printed inclusion notation, is suppressed when writing as an object of .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be a colimit cocone for . Here the preservation hypothesis must include the categorical limit of in ; this indexing category can be large. For a morphism of the category of elements, the defining equation says that the family of distinguished elements is compatible. Preservation gives a unique withIn particular each is now a morphism in the category of elements. Naturality of the colimit cocone givesThe universal property of the colimit forces , since it and agree after every cocone leg. If also satisfies , it is a morphism , and cocone compatibility now yields . Thus is a universal element. By the preceding representability criterion, the presheaf is represented by the colimit object:The size qualification matters. If preservation means only small categorical limits, the implication as printed is false for general locally small categories. For an explicit counterexample, let be the ordered category of all ordinals with an extra greatest object . Put for every ordinal and , with the forced restriction maps. Every small colimit in is the supremum of its object values: it is an ordinal unless the diagram contains . Applying therefore gives the appropriate small categorical limit of singletons, or the empty set when a value is empty; an empty diagram gives . Hence preserves all small categorical limits.
Its category of elements consists of all ordinals, whose projection has the large colimit in . Nevertheless, no ordinal represents , because its representable vanishes on larger ordinals; does not represent it either, since is nonempty while is empty. The valid proof consequently uses preservation of the displayed possibly large limit, or a smallness hypothesis making that diagram small.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 3 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Suppose . As a functor on the opposite category, a representable presheaf preserves every existing categorical limit: a colimit in is defined by the bijection between morphisms from its vertex into and compatible families of morphisms from its diagram objects into . This remains valid for a possibly large diagram in a category whenever that colimit exists and the compatible-family collection is the corresponding set.
The category of elements has a terminal object , where is the image of under the representation. For each let be its unique morphism to . These form a cocone for the forgetful functor . Any competing cocone satisfiesThe component at uniquely determines the mediating morphism. Thus the representing object is the colimit of the elements projection:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Conversely, assume that every hom-set functor preserves existing categorical limits. For a categorical limit cone in , a categorical cone determines an element of . The assumed bijectiongives one and only one such for every and every categorical cone. That is the universal property of the image cone itself. Therefore the hom-set tests detect limit preservation:This proof works for all diagram sizes for which the relevant categorical limits and compatible-family sets are under consideration.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Assume preserves existing categorical limits. For a diagram in a category with categorical limit cone , its image is a categorical limit cone of . For any , a morphism is therefore uniquely equivalent to a compatible family of morphisms . In the Category of sets, compatible families are exactly the categorical limit of the resulting hom-sets. ThusThe maps are induced by , so preserves the given limit. Applying this to every existing categorical limit proves the implication, with no completeness hypothesis on .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 74 2 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For velocity-only forcing in averaged oscillator equations, , the oscillation phase average vanishes: is a periodic total derivative, using an antiderivative of . Hence to first order, although the amplitude may change.
In the cubic case, , soWith , integration givesFor positive this is cubic velocity anti-damping, not damping: the exact energy derivative is . The slow solution grows and formally diverges at . The weakly nonlinear approximation loses validity before its amplitude becomes so large that is not small; its divergence is not a controlled prediction of the exact late-time solution. If , the exact zero solution should be used separately.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 74 2 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For conservative forcing in averaged oscillator equations, , the average determining vanishes. If , thenwhose period average is zero. Thus to this order, while a position-dependent force generally shifts the oscillation phase and frequency. The exact equation also conserves the energy , consistent with the absence of amplitude drift for bounded orbits.
For the cubic position force, . ThereforeThe leading oscillation is . For positive it is a softening cubic oscillator, obtained by weakly perturbing a harmonic oscillator. The weak-force condition is ; the constant is the leading harmonic amplitude, not a claim that the exact waveform remains sinusoidal.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 74 1 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The Bessel turning-point asymptotic comes from a cubic stationary endpoint, not an ordinary quadratic stationary point. Near ,Thus the contributing width is . On writing , the leading integral isThe oscillatory integral is understood with a vanishing damping factor. Substitution and the Gamma function Fourier integral giveThereforeThe equality uses the Gamma reflection formula. Contributions away from the degenerate endpoint are smaller. The scale explains why the preceding formula cannot be extended directly to zero angle.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 74 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Initially suppose , the usual oscillatory range. The oscillatory phase is with . Its stationary point is , since . At that pointThe stationary phase method therefore gives the Debye Bessel asymptoticThe error is additive for fixed positive bounded away from ; this formula is not uniform as , when the stationary point joins the endpoint and its curvature vanishes.
The printed condition alone includes other trigonometric branches. All defined fixed real cases can be covered as follows. If , put . Use the displayed formula with instead of , and multiply it by if , or by if . This follows from the integer-order parity , which is also obtained from the defining integral by . If , the argument is and the turning-point answer below applies, with the same parity factor. If , the stated argument is undefined.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 74 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Apply the stationary phase method to the real part of the exponential integral for the Bessel function of the first kind. With fixed, use oscillatory phase and oscillatory integral amplitude . The unique stationary point is , with second derivative . Its contribution isThe leading endpoint terms of the exponential integral are imaginary and do not contribute to its real part. Hence the large-argument asymptotic expansion of the Bessel function of the first kind isThis is an additive asymptotic formula: a relative ratio is inappropriate at zeros of the leading cosine. The envelope decreases like while the oscillation frequency approaches one.
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





