Topics (265k) Articles (272k) Users (362) Discussions (237) Comments (383) Files (4k) New article
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 3 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
There is a cofinal branch. We give a proof that does not require distinct limit-level nodes to have different predecessor chains.
The set is stationary. Indeed a strictly increasing continuous -sequence in any club set has supremum in that club set, below , of cofinality . At each , there are fewer than pairs of nodes on . For every pair whose predecessor chains below differ, choose a height where they differ. Since , all these heights are bounded by some . Consequently nodes in having the same predecessor at have identical predecessor chains below .
The Fodor lemma states that a regressive function on a stationary subset of a regular uncountable cardinal is constant on a stationary subset. Applying it here, has a constant value on a stationary subset . Choose for each . The level has fewer than nodes. Partitioning according to the predecessor of at height , one fiber is stationary, since the union of fewer than nonstationary sets is nonstationary. Let its common predecessor be .
For in , the predecessor of at level and have the same predecessor at level . Their chains below therefore agree. For each , choose above and let be the predecessor of at level . The preceding comparison makes independent of that choice. The nodes form a chain through every level:This proves the uniformly narrow regular-height tree branch theorem. The uniform bound below the smaller regular is stronger than merely bounding each level below .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write for the countable-family assertion in the PDF; its prime is not a superscript . A single stationary diamond at a regular cardinal sequence gives such families by taking singletons, so .
Conversely enumerate each countable family as , , padding finite families and allowing the empty set as a default. Fix a bijection . The previous part applied to gives a club set on which . Define, for each , a single candidate sequenceSuppose no candidate sequence witnesses . For each choose and a club set such that for every . Code all the counterexamples intoThe countable-family hypothesis guesses on a stationary set. Choose a guessing in the club set , and choose with . For every , closure under givesThus , contradicting . At least one candidate is a diamond sequence, provingThis is the countable-family diamond equivalence, for every regular uncountable and stationary .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
First the increasing sequence is cofinal in . Write . Strict increase gives when the sequence is infinite, so its cardinal sum is . The given sum therefore implies and .
For any function , choose an index with for every . There are at most such indices, so they are bounded below . Enlarging the bound if needed gives an index with . ThusConversely each summand is at most , and because . Infinite cardinal multiplication consequently givesCombining the inequalities proves .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . There is a strictly increasing cofinal map . If , choose a cofinal map . Then is cofinal in , contradicting the definition of as its least cofinal order type. Since always , we obtainFor a nonzero limit ordinal this is an infinite regular cardinal. If the convention includes zero among limit ordinals, its cofinality is zero and the identity is immediate there.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The structure of hereditarily small sets is transitive. If , all its sets are hereditarily finite, so it cannot satisfy Infinity. Therefore the assumed model has .
Let be a cardinal. The ordinal belongs to , and every actual subset of also belongs to : its transitive closure has size at most . The Power set axiom inside therefore produces the actual , since all subsets relevant to the internal definition are present. This power set itself belongs to , soThus is a strong limit. Its regularity was assumed, and we have proved uncountability. Hence is strongly inaccessible.
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





