Number the source vertices and the sink , and write for the arrows. The only basis paths are . Using standard matrix units, define
The relations , orthogonality of the vertex idempotents, and agree exactly with multiplication of these matrix units. The map is therefore an algebra homomorphism, and its images form a basis of the algebra
This is an explicit isomorphism of the path algebra of the subspace quiver with a -dimensional triangular matrix algebra.
There is one constant path and loop generators; every other path is a word in those loops. Distinct words are distinct basis paths, so there are no relations among the generators. Therefore
the free associative algebra on generators, with each loop sent to its corresponding generator. For this is ; for it is noncommutative. The quiver with one loop is the case of the quiver with r loops.
Fix and a name such that forces a two-coloring of . For each ground-model finite set , record its full forcing decision pattern
There are at most such patterns, since is a strong limit cardinal and . For finite the number of patterns is finite, also below . Encode the patterns by an ordinal and apply the assumed finite-subset partition property to obtain of size such that is constant on for every .
For each , choose one . Conditions below deciding are dense. Whenever one such condition decides the value, equality of patterns means it forces that same value at every . A generic filter containing meets this dense set for each , so is constant on each in the extension. The constants may differ with , exactly as required.
The forcing has size below the regular , hence satisfies the -chain condition for forcing and preserves its cardinality. The ground-model set consequently still has size . Since the argument works for every name and condition,
This is small forcing preservation of finite-subset partition properties; no closure assumption on the forcing is required.
For each , choose a maximal antichain in a forcing order below deciding a witness in . Write the decided values as , one for each condition in that antichain. The -chain condition for forcing gives fewer than possible values. Since is regular in , choose
The possible-values lemma for chain-condition forcing ensures
In take the club set of limit closure points
It is unbounded by repeatedly closing any starting ordinal under for countably many steps, and closed by taking increasing limits. For , the forced displayed property gives points of arbitrarily high below . Its forced closedness yields . Therefore
This proves the ground-model club containment lemma. The name on the right is , as printed in the PDF.
In the generic extension from the preceding construction, a surjection from onto all reals gives . Cantor theorem gives the reverse inequality, so the Continuum hypothesis holds.
For the exact consistency-strength statement, existence of a countable transitive model is stronger than bare consistency of ZFC. One can formalize the forcing proof syntactically, or use the constructible universe theorem: ZFC proves that its constructible universe satisfies ZFC and the Generalized continuum hypothesis. If there is any model of ZFC, its internal constructible universe is therefore a model of ZFC with CH. By the Godel completeness theorem,
This deduction does not silently replace consistency by existence of a transitive model.
The PDF's middle equality is , concerning ordinal exponentiation. The TeX incorrectly turns the exponent into a subscript; preserving would be incompatible with forcing CH over many ground models.
Let and use the countable-condition collapse of onto :
ordered by extension. Countable unions give lower bounds, so closed forcing adds no short ordinal sequences; in particular it adds no reals and preserves . Dense requirements ensure that the union of the generic filter is a total surjection . Thus
Finally forcing preserves ordinals, and the recursion defining ordinal multiplication and exponentiation is absolute. Both models compute as the same order type of successive copies of . This proves the printed middle equality too. Higher cardinals may collapse, which is allowed by the actual PDF.
This is the Rasiowa–Sikorski lemma. Put and recursively choose
using density. Set
It contains , is upward closed toward weaker conditions, and is directed: if and , then is a common stronger condition in . It meets each through . Thus is the required generic filter for the prescribed countable family of dense sets. For a countable transitive model, externally enumerate its dense sets to obtain a generic filter over the model by this same argument.
The forcing is -closed in when every descending sequence of conditions of length less than , belonging to , has a lower bound in :
We use the convention that means that is stronger. In particular, -closed forcing is countably closed. Internal quantification over the sequences is essential when is externally countable.
The forcing definability lemma states that for each formula there is a first-order formula , depending on but not on the chosen names, such that for and forcing names ,
The order relation of is included in its set code. Thus each instance of the forcing relation is definable inside the ground model, allowing the uses of ground-model axiom schema of separation and replacement in the forcing arguments.
The forcing is cardinal-preserving over when every ground-model cardinal remains a cardinal in every generic extension:
Forcing preserves ordinals, and an ordinal that was not a cardinal already has a ground-model bijection with a smaller ordinal, which persists. Thus this definition gives equality of the cardinal ordinals in the two models.
The finite binary-function Cohen forcing is countable in . It preserves , and the countable levels, height, and normal extensions of the ground-model tree remain unchanged.
If the extension contained an uncountable tree antichain, apply the ground-model uncountable subset lemma for countable forcing to obtain an uncountable contained in it. Incomparability in the fixed ground-model tree is absolute, so already regards as an uncountable tree antichain, contradicting that is Suslin in . Similarly, a new cofinal branch has an uncountable ground-model subset. Comparability is absolute, so this would be an uncountable chain in the ground-model tree, again impossible.
Therefore countable forcing preserves Suslin trees, and in particular
Countability of the forcing and uncountability of are understood internally in and , respectively. This matters because the model itself is externally countable. Choose a name and a ground-model set containing every ground-model element that can occur in . Such an exists: the rank of bounds the ranks of its values, so a sufficiently high contains .
For , ground-model axiom schema of separation and the forcing definability lemma give
By the forcing truth lemma,
If every for were countable in , it would remain countable in , where is countable. Then would be countable, contrary to the hypothesis. Thus some has uncountable in ; otherwise its ground-model enumeration would still enumerate it in the extension. Let . Every one of its members is forced by into , so
The countable chain condition for forcing also preserves its uncountability. Separativity is not needed for this particular argument. This is the ground-model uncountable subset lemma for countable forcing.
Use diamond-sequence forcing. A condition is a sequence
ordered by end extension. Its countable descending chains have lower bounds: take their union and, if their lengths approach a new limit, add an arbitrary subset at that last index. Hence it is countably closed and preserves . The union of the generic filter supplies .
To prove the diamond principle, let a condition force that and that is a club set. Below any such condition build and strictly increasing countable ordinals so that , forces , decides , and has length past . Unboundedness supplies ; countable closure allows deciding all the bits below it. The construction can be carried out in .
Let . The union of the conditions has entries exactly below and decides a ground-model set . Extend that union by setting . This condition forces by closure, and . The conditions giving a correct guess inside any named club set are therefore dense. Thus
No ground-model Continuum hypothesis is needed; this forcing is allowed to collapse higher cardinals.
For an arbitrary ground model, this alternative needs an additional arithmetic hypothesis. The requested countable-cover property already prevents any collapse of an infinite ground-model cardinal. If a cardinal were collapsed, there would be a surjection with . The asserted ground-model would cover by the union of countable sets, a ground-model set of size at most , a contradiction. Thus all infinite cardinals are preserved.
Put , which must then remain . If the extension has continuum , it has
The ground-model functions from into remain present and their cardinality cannot be collapsed. Necessarily
For example, a ground model with continuum larger than cannot satisfy the printed request. This is a genuine missing hypothesis, rather than a forcing construction that works for every .
Under the necessary hypothesis, use Cohen forcing to add reals:
The delta-system lemma shows that it has the countable chain condition for forcing: an uncountable family of finite conditions has an uncountable subfamily whose domains form a delta-system and whose values agree on its root, so any two of that subfamily are compatible. It therefore preserves cardinals. Its coordinate reals are pairwise distinct by dense disagreement requirements. Conversely each nice forcing name for a real uses countably many countable antichains in a forcing order, so the number of such names is at most . Hence
For any ordinal-valued function name, choose for each a maximal antichain in a forcing order deciding its value. The countable chain condition for forcing makes the set of possible ordinal values countable in . Pad it with if needed to make it countably infinite. The possible-values lemma for chain-condition forcing gives the stronger pointwise covering statement
which implies the requested range inclusion. When a condition only forces that the name is such a function, make these choices below that condition; it belongs to the generic filter witnessing the actual function.
Use the countable-condition collapse
ordered by reverse inclusion: an extension of a function is a stronger condition. All sizes and conditions here are computed in the ground model .
This forcing is countably closed: the union of a descending countable sequence is a countable partial function. Thus it adds no countable ordinal sequences and preserves . For each , the conditions whose domains contain are dense; for each , those whose ranges contain are dense. The union of the generic filter is therefore a surjection from onto , and .
Inaccessibility gives : every countable sequence is bounded below the regular , and the strong limit cardinal property bounds the number of sequences at each bound below . Hence . The forcing satisfies the -chain condition for forcing, so it preserves every cardinal above . This gives precisely the requested collapse and preservation. The assertion that is collapsed to concerns its new cardinality; the ordinal itself does not change.
First express inaccessibility by universally excluding witnesses to its failure. Besides being an ordinal greater than , require that for every there is no function from cofinal in , and no injection from into . The first condition gives regular cardinalhood; the second says that is a strong limit cardinal. Under the axiom of choice these are exactly the conditions for a strongly inaccessible cardinal.
These are Pi-one formulas modulo ZF: the only unbounded quantifiers universally range over possible functions. Being a function of the specified domain, having bounded or cofinal range in , and being an injection whose values are subsets of can all be written with bounded formulas in set theory, without using a power-set object as an unbounded existential witness. Consequently inaccessibility is downward absolute to a transitive inner model of ZFC.
Now suppose is Mahlo in . It is inaccessible in the constructible universe , and every -inaccessible ordinal below it is also inaccessible in . Let be any set that regards as a club set in . Closure and unboundedness are absolute properties of this fixed set of ordinals, so is also a club set in . By Mahloness in , it contains an ordinal that is inaccessible in , hence in . Every -club therefore meets the -inaccessible ordinals below . Thus Mahloness is downward absolute to the constructible universe:
If is a Mahlo cardinal, its inaccessible ordinals form a stationary set. For any , intersect that set with the club set of elementary levels from club reflection below an inaccessible cardinal. This supplies an inaccessible with the required elementary substructure.
Conversely, take an arbitrary club set and use it as the predicate . In , the sentence asserting that predicate-marked ordinals occur above every ordinal is true. Any inaccessible elementary level therefore satisfies that is unbounded in its ordinals, which are precisely the ordinals below . Since is closed and is a limit ordinal, . The assumed reflection property consequently gives an inaccessible ordinal in every club set. Hence the inaccessible ordinals are stationary and
Put . Because is inaccessible, for every , and is regular. Choose one witness in for every existential formula of this expanded language and every finite parameter tuple for which a witness exists. These are Skolem functions; they can be chosen in the ambient universe even when is not definable inside .
For each , the ranks of all chosen witnesses with parameters from have supremum below : there are fewer than such parameters and only countably many formulas. Choose strictly above those ranks. The limit closure points
form a club set. At , every existential assertion in with parameters in has a witness in . The Tarski-Vaught test yields
Thus the set of all such elementary levels is unbounded. It is also closed: the union at a limit of increasing elementary levels is an elementary substructure by the elementary chain theorem, and the union of their ranks is with predicate . Therefore
This is club reflection below an inaccessible cardinal.
Let be transitive models of ZFC containing the set relation and its underlying set . If judges well founded, it has an ordinal rank function for a relation by the preceding rank characterization. Being a function to ordinals and satisfying
is absolute: the values are actual ordinals and the checks use only bounded formulas in set theory. The same rank function exists in , so judges well founded.
Conversely, if judged it not well founded, it would contain a nonempty set with no -minimal element. The property of this particular is bounded and remains true in , contradicting well-foundedness there. Thus
This is absoluteness of well-foundedness. The hypotheses that both models are transitive and satisfy ZFC matter; a small transitive set without sufficient recursion axioms need not contain the required rank witness.
The rank characterization holds for a set relation, or a set-like class relation. For such a well-founded relation, use well-founded recursion to define
The predecessor set is a set, so the supremum is an ordinal. For a set-like class relation, the closure of the predecessors of any one point under finitely many predecessor steps is a set; perform the ordinary set recursion there. Uniqueness makes these local definitions agree, producing a class rank function. The formula immediately gives .
Conversely, suppose such an ordinal-valued function exists. For any nonempty subset, or nonempty subclass in the class formulation, take an element whose rank is least among the ranks occurring. It has no predecessor in that subset or subclass, because a predecessor would have smaller rank. This proves well-foundedness.
There is a qualification in the printed class formulation. If well-founded class relations are defined to include set-likeness, it is already implicit and the assertion is correct. Under the minimal-element definition alone, it must be supplied. Without set-likeness, let , where is not an ordinal, and put every ordinal below , with the usual ordinal order below it. Every nonempty subclass has a minimal element, so the relation is well founded. But transfinite induction forces for all ordinals, whereas would have to exceed every . No such ordinal exists. Thus the unrestricted class assertion is false; set-likeness is necessary for this standard rank proof.

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