An absolute formula has the same truth value in the structures under comparison for parameters common to them. For transitive models and , the requirement is
One specifies the relevant class of models, for example transitive models of ZFC. A formula is upward absolute when the forward implication holds and downward absolute when the reverse implication holds. Bounded formulas in set theory are absolute between transitive membership structures: all their quantifiers range over the same elements of their parameter sets.
The Mostowski collapse theorem states that if is a well-founded extensional relation on a set , then there is a unique transitive set and a unique bijection such that
Extensionality means that distinct elements of have distinct predecessor sets. The collapse is characterized by the recursion
Well-founded recursion defines it, extensionality makes it injective, and its range is transitive. Uniqueness follows by well-founded induction. For a class version, the relation must also be set-like; its predecessor sets must be sets.
A standard membership model of set theory has the actual membership relation:
When “standard model” is used with the transitive-model convention, one also requires to be transitive: implies . Under a convention where standard means only actual membership, this extra requirement defines a transitive model. The set-theoretic absoluteness arguments below use transitive models of ZFC, so that bounded quantification and ordinals have their intended meaning.
Start with the set-theoretic tree of initial characteristic functions
ordered by extension. The Kurepa-family hypothesis makes each level countable, because its members are in one-to-one correspondence with the distinct traces . Every node extends to every higher level using an that witnesses it. Nodes at limit levels are uniquely determined by their predecessors, and the distinct give distinct cofinal branches.
We can also ensure the splitting requirement in the definition of a normal set-theoretic tree. Keep only nodes through which of these branches pass. There are nodes in total. For a discarded node, at most of the selected branches pass through it, so at most branches meet any discarded node. Remove those branches; branches remain, and each retained node still has remaining branches through it. It therefore has two different retained extensions at some later level, and has a retained extension at every higher level.
Choose increasing countable levels , starting at , continuously at limits, so that all nodes at level split before level . This is possible because each selected level is countable. Restrict to these levels and relabel them by . The retained tree now has one root, extensions at every higher level, at least two immediate successors, and unique limits of predecessor chains. Distinct remaining branches stay distinct on this unbounded set of levels. Hence the resulting normal set-theoretic tree is a Kurepa tree, with
Choose distinct cofinal branches of the Kurepa tree and regard them as subsets of its underlying set . Let be this family. Fix an ordinal . The countably many node codes below have heights bounded by some . A cofinal branch meets level , and its node there determines all its predecessors, hence all its nodes with codes below . Since level is countable,
This is the Kurepa-family hypothesis. The given compatibility between the ordinal codes and the tree order ensures in particular that the branches are consistently viewed as subsets of ; boundedness of the heights of the countably many codes is what the argument uses.
The diamond theorem in the constructible universe gives , and satisfies ZFC. Apply the preceding construction inside with . It produces a normal splitting Suslin tree.
For completeness, such a tree yields a Suslin line. Order its nodes lexicographically using the two successors at every split, treating a node itself as a position between its two successor subtrees. Each node is thus a cut point between a left and a right subtree. This gives a dense linear order without endpoints. Every nonempty interval contains a whole cone above some node: for comparable endpoints use the successor cone of the descendant endpoint directed toward the other endpoint; for incomparable endpoints use the right-successor cone of the lower endpoint. Disjoint intervals therefore supply pairwise incomparable cone roots, so the order has the countable chain condition for a linear order. A countable collection of nodes has bounded heights; a cone based above that bound contains none of them, so it is not an order-dense subset. Passing to the Dedekind completion using proper cuts, so that no endpoints are added, preserves density, the countable chain condition for a linear order, and nonseparability. For nonseparability, a countable dense set in the completion would give a countable dense set of original nodes by choosing one original node between each distinct pair of its points. This contradicts the preceding height-bound argument. The result is a Suslin line.
Thus the Suslin hypothesis fails in . The constructible universe theorem is a theorem of ZFC, so this is a relative-consistency argument, without an additional assumption that a transitive model exists:
Let witness the stationary diamond principle: for every , the set of with is stationary. We construct a normal splitting Suslin tree; this will be a nonspecial Aronszajn tree.
Construct its levels by recursion. Start with one root, and give every node two immediate successors. At a countable limit , the constructed portion is countable. Through each of its nodes choose a cofinal branch of that portion, and put one new node above each chosen branch at level . This keeps the level countable and gives every earlier node an extension. Branches are identified by their predecessor chains, so nodes at a limit level are uniquely determined by their predecessors.
At a limit , decode as a candidate tree antichain of . If it is maximal, choose the branches just described to meet . This is possible: for any node, maximality supplies a comparable member of , and normality of the already constructed portion extends the larger of those two nodes to a cofinal branch up to . Then every node at level , and every later node, lies above a member of . This is antichain sealing by diamond.
Here is a precise way to handle the coding. Give the countable level node codes in . There is a club set of countable limit with , and on this club the nodes below have exactly the relevant codes below . Empty unused codes are ignored. Thus any subset of the entire tree has an ordinal code set to which the stationary diamond principle applies.
Let now be any maximal tree antichain of the completed tree. There is a club set of such that is maximal in . Indeed, choose a comparable member of for each node; closure under the heights of these witnesses gives that club. Intersect it with the coding club. Stationary correct guessing supplies an on this intersection at which is sealed. A member of at or above level would extend a member of below , contradicting the tree antichain property. So is contained in the countable portion below . Every tree antichain extends to a maximal one, hence every tree antichain is countable.
There is no cofinal branch of length . Otherwise, choosing at each successor level the other successor of its branch node would give an uncountable tree antichain. Thus the resulting tree is a Suslin tree. A special Aronszajn tree is a union of countably many tree antichains; here those would all be countable and could not cover the nodes. Therefore
The club principle asserts that there is a sequence such that has order type , is cofinal in , and
It guesses a cofinal countable subset of an uncountable set, with inclusion as the guessing requirement.
Fodor lemma says that if is a regular uncountable cardinal, is stationary, and is regressive, then
Here a regressive function satisfies at every nonzero ; removing has no effect on stationarity. Both regularity and stationarity are part of the hypotheses.
The diagonal intersection of the family is
Membership at only tests the sets indexed below , rather than every set of the family. At a regular uncountable , a diagonal intersection of club sets is again a club set.
There is a useful explicit reconstruction of a shorter trace from a longer one. Suppose
and fix . Let be the first index with , if it exists. Before that index, the walk to follows the walk to . At index it moves to . Thus
When , the appended trace is empty. If no such exists, the walk first reaches and then continues toward , giving
Both formulas depend only on the displayed sequence, , and the fixed club sequence. Equal traces consequently reconstruct the same trace at every . This proves the trace coherence lemma for minimal walks:
Let be the common-prefix index from the first-divergence lemma for minimal walks. If , the walk to has followed the entire walk to and must make at least one further step, contradicting the assumed equality of lengths. Hence .
The current nodes agree, so put . Then is an initial segment of . It is proper because . Therefore
In particular, each function is injective: equality of two trace sequences would give equal lengths and then contradict this proper-initial-segment conclusion.
For clarity, each is an ordered finite sequence. Its minimal walk along a club sequence is finite because its nodes strictly decrease until reaching , and an infinite strictly decreasing sequence of ordinals cannot exist. At a step from , unboundedness of supplies in .
Compare the two minimal walks along a club sequence to and to . As long as their current node is the same , their next nodes agree exactly when has no point in . At the first such point, the walk to moves to
whereas the walk to stays at or above . If this does not occur before the second walk terminates, the first walk reaches with it and then makes its next step below .
Thus there is an index , possibly the terminal index of the walk to , with
It is unique: after this step the first walk stays below , so it can never again coincide with a node of the walk to . This is the first-divergence lemma for minimal walks.
A cofinal map has a range cofinal in :
For a limit , this is equivalent to . For a successor , its largest element must occur in the range. Monotonicity is an additional property and is not part of this definition. The cofinality of is the least ordinal that admits such a cofinal map into .
A Kurepa tree is a set-theoretic tree of height , with every level countable, possessing at least distinct cofinal branches. The predecessors of each node are well ordered; their order type is the node's height. A cofinal branch is a maximal chain with nodes at unbounded heights below , equivalently one node at every level after taking its predecessor closure.
A Suslin line is a dense linear order without endpoints that is order-complete, has the countable chain condition for a linear order, and is not separable in its order topology. Thus every disjoint family of nonempty open intervals is countable, but there is no countable order-dense subset. The completeness condition says that every nonempty bounded-above subset has a supremum. These requirements distinguish a Suslin line from the real line, which has the countable order-dense subset .
Write and enumerate all nonidentity order automorphisms of the real line as . We construct sets of points to include and exclude, starting with and .
At stage , each of has cardinality less than . Since is a nonidentity increasing bijection, its moved points contain a nonempty open interval. Indeed if , points between and are moved; the other direction is similar. There are therefore moved points. Choose one, , outside
Then put into and into . They are different, and the included and excluded sets remain disjoint. Take unions at limit stages. This recursion works even when is singular: before stage , only countably many initial points and at most chosen pairs have been used.
Let . It is an order-dense subset of cardinality . Any nonidentity order automorphism of extends uniquely to some of , but its value at is the excluded point , a contradiction. Thus the resulting rigid dense subset of the real line satisfies
If two order automorphisms agree on , their values at any real are the same supremum of the common values at rational points below . This is the uniqueness argument for extension of an order automorphism from a dense subset; it does not require either automorphism to carry onto itself.
Their restrictions belong to , whose cardinality is
This gives the upper bound. The translations , one for each real , are distinct order automorphisms, giving the lower bound. Consequently
Use the order completeness of to define
The set in this supremum is nonempty and bounded above: choose with , using that is an order-dense subset. For , all its displayed values lie below . If , choose with ; then . Thus the supremum equals .
The extension is strictly increasing. If , choose with ; then
Apply the same construction to , obtaining . For , choose with ; this gives . For , a point of between and similarly gives . Hence
Taking inverse images and a supremum shows . The symmetric argument gives , so the extension is an order automorphism.
For uniqueness, any increasing extension has the same strict lower cut in at its value . Two distinct real numbers have different cuts in an order-dense subset, so . The extension exists and is unique.
The relation of eventual domination is
A dominating family satisfies
It must dominate every function, and the exceptional finite initial interval may depend on both functions.

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