For uncountable regular , let . Since is a club set in , , so .
If , its cofinality ensures : ordinals strictly between and are successors, and has cofinality . In the continuous increasing enumeration of , take . It is a limit point of and has cofinality . Coherence gives , with order type and size . This contradicts the size clause for ordinals of cofinality below . Thus
The printed hypotheses need this qualification. At , choose for every nonzero countable limit ordinal. These club sets are coherent, and the small-cofinality clause is vacuous. But at their order type is , not . The standard square principle includes an order-type bound , which also repairs this countable case.
Use the equivalent tree formulation of the Suslin hypothesis: there is no normal, well-pruned Suslin tree of height , with countable levels and no uncountable chains or antichains. This is equivalent to the linear-order formulation that every complete dense order without endpoints satisfying the countable chain condition for a linear order is separable.
If such a tree existed, use its nodes as forcing conditions, with a higher extension stronger. It is CCC because its antichains are countable. For every , the set is dense because the tree is well-pruned. The assertion is precisely that a CCC forcing and a family of at most dense sets admit a filter meeting all of them.
Apply it to these dense sets. A directed filter in a tree is a chain: two compatible nodes are comparable, since both lie among the well-ordered predecessors of a common extension. Meeting every makes this chain cofinal, contrary to the defining absence of uncountable chains in a Suslin tree. Consequently
Under the ordinary height-and-width definition of an -tree, the printed claim is false. The chain has one node at each level, every antichain has size at most one, and it is itself an uncountable chain.
Here is the intended argument under the additional splitting convention. Any uncountable chain in a tree with countable levels is unbounded in height, because a bounded set of levels below has only countably many nodes. Its predecessor closure therefore gives a cofinal branch . At each node on , splitting supplies an extension off , incompatible with a later node on . Recursively for , choose such an off-branch node , then move sufficiently far along that all subsequent choices are above a branch node incompatible with . At a limit stage the previous countably many heights are bounded below , so the recursion continues. The are pairwise incompatible, an uncountable antichain.
Thus a splitting -tree with only countable antichains has no uncountable chains. A splitting convention must be stated; the raw tree hypothesis alone does not suffice.
For a countable transitive ground model, the semantic forcing relation is
The forcing theorem identifies this with the recursively defined relation inside and makes it definable there. In particular, if is stronger, then implies . The names are interpreted in each relevant generic filter, not replaced by their value in one fixed extension in the definition.
A nice forcing name for a subset of a ground-model set , often an ordinal, has the form
where each is an antichain in and the entire construction belongs to . Its value consists of the for which meets . The antichains need not be maximal. Under the countable chain condition they are countable in , which makes nice forcing names useful for counting possible subsets in extensions.
The valuation of a forcing name is defined recursively by
The recursion is on forcing name rank. Only pairs with an active condition in contribute elements, and their first coordinates are evaluated in the same filter. Thus a name is a ground-model set, while its value is a set in the generic extension.
We use only the definability and truth clauses of the forcing theorem. For every formula, its forcing relation on names is definable inside ; forcing is preserved by strengthening; and exactly when some condition in forces . These clauses do not presuppose the Separation axiom we are proving.
Let and let be the parameters in the desired instance. In , form the name
This is a set in by its Separation axiom and forcing definability, using the subnames of and as a set-sized bound.
If , some activates and activates . Thus , and the forcing theorem gives . Conversely, if satisfies that formula, choose an active pair with and a condition forcing the formula. Directedness gives stronger than both and . Monotonicity puts , so .
Therefore
Every requested instance of separation in a generic extension follows.
The generic extension is . It is transitive: if , an active pair in supplies a subname with . Ground sets belong to it by their canonical names. Without assuming a weakest condition, use ; nonemptiness of gives .
Induction on forcing name rank gives . The right side is an ordinal of . If is an ordinal, its rank equals , so it is at most a ground-model ordinal. Transitivity of then implies . Conversely every ground ordinal remains the same ordinal in the transitive extension, since membership is unchanged. Hence
This proves forcing preserves ordinals directly from ranks, without assuming cardinal preservation.
A subset is dense above a forcing condition if
All displayed strengthenings use the PDF convention. This only requires density in the cone of extensions of ; it need not be dense throughout , nor downward or upward closed.
With this paper's order convention, larger conditions are stronger. A generic filter over is nonempty, closed toward weaker conditions, and directed toward stronger conditions: if , some satisfies . It also meets every which regards as dense in .
For a countable transitive , such a filter containing any prescribed condition can be built by enumerating its dense sets and successively choosing stronger conditions in them. The definition does not require : for an atomic forcing a generic filter may already belong to .
A forcing name for is a set of ordered pairs where and is itself a forcing name. This recursive definition is made well-founded by assigning the forcing name rank . Names over the ground model are those names belonging to ; conditions remain ground-model objects. A name describes which recursively interpreted elements are activated by the generic filter.
To prove unboundedness, begin above any prescribed ordinal with and choose a strictly increasing sequence so that
This upper bound is below : there are fewer than countable sets in the union, and is regular and uncountable. Put . For any , choose with ; then . Thus .
For closedness, suppose is a limit point of . Given , choose with . Then . Therefore as well. Hence is a club set in . This is the club of closure points for countable set-valued functions.
For every , choose an injection . Define the Ulam matrix on omega-one by
For a fixed , every belongs to exactly one of these sets, so their union is the entire tail . Its complement is the countable ordinal . For distinct and fixed , membership in both sets would give for some above both, contradicting injectivity. This verifies both requested properties.
The club principle predicts a cofinal countable ladder contained in every uncountable subset of . More precisely, asserts that there is a sequence such that each is cofinal in with order type , and every uncountable contains at least one entire . It predicts a countable ladder contained in , rather than predicting exactly. The latter is the stronger kind of guessing in the diamond principle.
A set-theoretic tree is a partial order for which the strict predecessors of every node are well-ordered by the tree order. The height of a node is that predecessor order type, and is the set of nodes of height . Under the ordinary height-and-width definition, a kappa-tree satisfies
For an arbitrary cardinal in this definition one must distinguish it from additional conventions such as being well-pruned, normal or splitting. Splitting means that every node has two incompatible extensions; it is not implied by the height-and-width clauses. This distinction is material in Question 5(ii)(a).
For a nonzero limit ordinal , a subset is a club set if it is unbounded in and contains every one of its limit points below . A subset is stationary if
This defines stationarity in a limit ordinal. The regular uncountable case is the usual stationary set setting; results such as Fodor lemma require that additional hypothesis, rather than an arbitrary limit ordinal.
Take the graphs . Each has size , and any two meet in fewer than points, because their functions are eventually strictly ordered. Fix a bijection and let .
Given , enumerate it as and trim the sets in this order:
The deleted part is a union of fewer than pairwise intersections, each of size less than . Regularity ensures its size is less than . If , then is disjoint even from the full earlier , hence from its trimmed version. Thus all the retained sets are pairwise disjoint and each lost fewer than elements. This proves
The argument is the essential disjointness of small subfamilies of a regular-cardinal almost disjoint family.
For the intended infinite regular cardinal , set . Suppose and the functions for its predecessors have been constructed. Since , choose a surjection and define
The supremum is below : it uses fewer than ordinals below , and is regular. This defines a function at each stage of the recursion.
For any , choose with . Whenever , the displayed supremum includes , so . Therefore the recursion yields a long chain under eventual domination of length .
The singular cardinals hypothesis is the assertion that for every infinite singular cardinal ,
In particular, for a singular strong-limit cardinal it gives . This is a restriction on singular-cardinal exponentiation; it does not assert the full Generalized continuum hypothesis at all cardinals.
The Bukovský-Hechler theorem states: if is singular and there are a cardinal and a cardinal such that for every cardinal with , then
Thus an eventual plateau of the power-set function below a singular cardinal continues at that cardinal. One can see the mechanism by decomposing into bounded pieces: . On the plateau choose , so .

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