Let be the fixed ground ordinal. We prove that remains stationary in this ordinal. The chain condition for forcing ensures that remains regular: possible values of each coordinate of an ordinal-valued name form a ground set of size less than , by a maximal deciding forcing antichain. A hypothetical cofinal map with domain below would have its range covered by fewer than such small sets, hence bounded by regularity in .
Let name a club set in , and take forcing this. For each , choose in a maximal forcing antichain above deciding the least point of strictly above . Its set of possible values has size less than , so choose a ground bound larger than all of them. The ground set
is a club set by the usual countable closure iteration and regularity. For every , forces unbounded in , and closedness forces . Hence . In , choose ; that same ordinal belongs to in the extension. Stationarity at the fixed ground is preserved.
There is an important qualification to the printed notation. If it is recomputed internally as , the assertion is false without preservation of smaller cardinals. Finite partial maps from to form a forcing of size , hence have the -chain condition, but collapse to countable. Then , while is larger. The old is bounded in this new , so cannot be stationary there. The proved statement uses the fixed ground ordinal, or alternatively requires the lower-cardinal preservation needed to retain its aleph index.
For a maximal forcing antichain , the set is dense. Maximality ensures each condition is compatible with some , and a common strengthening lies in . A generic filter meets and hence, by closure toward weaker conditions, meets . Directedness makes any two of its conditions compatible, so it contains at most one member of an forcing antichain. Thus .
Conversely, suppose this equality holds for every ground-model maximal forcing antichain. For any dense , use Choice in to select an forcing antichain maximal among forcing antichains contained in . It is maximal in as well: a condition incompatible with every member of would have an extension in still incompatible with every member, enlarging . The hypothesis gives a member of . Thus meets every ground dense set and is generic.
This proves the maximal-antichain criterion for genericity in both directions.
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 .
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 sequence
Suppose no candidate sequence witnesses . For each choose and a club set such that for every . Code all the counterexamples into
The countable-family hypothesis guesses on a stationary set. Choose a guessing in the club set , and choose with . For every , closure under gives
Thus , contradicting . At least one candidate is a diamond sequence, proving
This is the countable-family diamond equivalence, for every regular uncountable and stationary .

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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