<!-- Generated from https://www.teclamairme.com/#group-T27 by readviews.py; never edited by hand. -->

# Glossary cards — Chapter ᚚ(P): The possible journeys

*Teclam Áirme, the Mathematical Compendium — a copy for AI readers of https://www.teclamairme.com/#group-T27, as of 2026-09-30. Links are relative to https://www.teclamairme.com/fortheaireaders/.*

[Guide for AI readers](index.md) · [The chapter](ch27.md)

*Cardinals, ordinals, the power set, and categories: Cantor’s sizes of infinity, von Neumann’s zero, the one subset of nothing, and the one arrow out of it. Each card: its symbol, type, one-line headline, the longer note, the reference entries it cites and the cards it links to.*

### the letter Peith — `ᚚ` {#g-og-peith}

*Ogham letter*

A late addition: beithe bog, ‘soft beithe’, invented in the manuscripts to carry p once more.

Peith is not one of the five forfeda but a later addition, and it is a letter of the manuscripts only. When the later oghamists insisted on treating all five supplementary letters as vowels, the alphabet was left with no sign for [p] for the second time, so [p] had to be written again as a modified [b]: peithe, after beithe, also called beithe bog, ‘soft beithe’, or tautologically peithbog. Being an invention of the scribes rather than a name of anything, the kenning and tree-gloss lists give it no word-ogham and no medieval plant; the dwarf elder of the letters table is a dictionary sense of the word, not a medieval gloss.

Cites: [2.15](ch02-refs.md#r-2.15), [2.17](ch02-refs.md#r-2.17), [2.18](ch02-refs.md#r-2.18), [2.19](ch02-refs.md#r-2.19)

### cardinality of the empty set — `|∅|` {#g-empty}

*Integer or rational*

0: the empty set has no members, so there is nothing to count.

The empty set has cardinality 0. Cantor gave his theory of cardinal numbers its systematic presentation and introduced aleph notation in 1895; André Weil later recalled choosing ∅ for Bourbaki after the Norwegian letter Ø. In von Neumann’s 1923 construction it is also the ordinal 0. The integer 0, tinted as one.

Cites: [27.1](ch27-refs.md#r-27.1), [27.11](ch27-refs.md#r-27.11), [27.20](ch27-refs.md#r-27.20), [27.9](ch27-refs.md#r-27.9)

See also: [von Neumann’s zero](ch27-cards.md#g-vnzero)

### cardinality of the natural numbers — `ℵ_{0}` {#g-aleph0}

*Non-real object*

The smallest infinite size: the size of the counting numbers.

Aleph-null is the cardinality of the natural numbers and the smallest infinite cardinal. Cantor introduced aleph notation in 1895. A non-real object: a cardinal number, not a point on the real line.

Cites: [27.2](ch27-refs.md#r-27.2), [27.20](ch27-refs.md#r-27.20)

See also: [the natural numbers](ch01-cards.md#g-nats), [the real numbers](ch01-cards.md#g-reals)

### the first uncountable cardinal — `ℵ_{1}` {#g-aleph1}

*Non-real object*

The next size after ℵ₀.

Aleph-one is the first uncountable cardinal, the next size after ℵ₀. It is the size of Cantor’s second number class, the countably infinite ordinals; whether it is the size of the real line is the continuum hypothesis. A non-real object.

Cites: [27.2](ch27-refs.md#r-27.2), [27.20](ch27-refs.md#r-27.20), [27.4](ch27-refs.md#r-27.4)

See also: [cardinality of the natural numbers](ch27-cards.md#g-aleph0), [the continuum hypothesis](ch27-cards.md#g-ch), [the real numbers](ch01-cards.md#g-reals)

### cardinality of the continuum — `𝔠` {#g-cont}

*Non-real object*

2^ℵ₀, the size of the real line; if the usual axioms are consistent they neither prove nor refute 𝔠 = ℵ₁ (Gödel 1938, in full 1940; Cohen 1963).

The continuum has cardinality 𝔠 = 2^ℵ₀ and is the size of the real line and of the power set of the natural numbers. Cantor proved that it exceeds ℵ₀ and conjectured in 1878 that it equals ℵ₁. Gödel announced the relative consistency of that conjecture in the Proceedings of the National Academy of Sciences in 1938. He presented the proof in full in a Princeton monograph in 1940. Cohen established the relative consistency of its negation in 1963, making the continuum hypothesis independent of ZFC. A non-real object.

Cites: [27.20](ch27-refs.md#r-27.20), [27.22](ch27-refs.md#r-27.22), [27.3](ch27-refs.md#r-27.3), [27.4](ch27-refs.md#r-27.4), [8.11](ch08-refs.md#r-8.11)

See also: [cardinality of the natural numbers](ch27-cards.md#g-aleph0), [the first uncountable cardinal](ch27-cards.md#g-aleph1), [the axioms](ch08-cards.md#g-axioms), [the continuum hypothesis](ch27-cards.md#g-ch), [the continuum hypothesis, undecided](ch08-cards.md#g-chindep), [the power set](ch27-cards.md#g-powerset), [the real numbers](ch01-cards.md#g-reals)

### the ω-th beth number — `ℶ_{ω}` {#g-bethomega}

*Non-real object*

The limit of ℶ₀, ℶ₁, ℶ₂, …, each the size of the power set of the one before.

The ω-th beth number is the limit of ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀, ℶ₂ = 2^ℶ₁, …, each the size of the power set of the one before. Charles Sanders Peirce proposed the beth notation in a December 1900 letter to Cantor. The cardinal ℶ_{ω} is the smallest strong-limit cardinal above ℵ₀. A non-real object.

Cites: [27.19](ch27-refs.md#r-27.19), [27.5](ch27-refs.md#r-27.5)

See also: [cardinality of the natural numbers](ch27-cards.md#g-aleph0), [cardinality of the continuum](ch27-cards.md#g-cont), [the first infinite ordinal](ch27-cards.md#g-ordomega), [the power set](ch27-cards.md#g-powerset)

### the first singular cardinal — `ℵ_{ω}` {#g-alephomega}

*Non-real object*

In ZFC, the limit of ℵ₀, ℵ₁, ℵ₂, … and the smallest infinity that is the union of countably many smaller infinities.

Aleph-omega is the limit of the finite-indexed alephs and the first singular cardinal, because it is the union of countably many smaller cardinals. ZFC proves that ℵ_{ω} exists; assuming ZFC is consistent, it cannot prove that an inaccessible cardinal exists. König’s theorem implies 2^ℵ₀ ≠ ℵ_{ω}. A non-real object.

Cites: [27.17](ch27-refs.md#r-27.17), [27.23](ch27-refs.md#r-27.23), [27.6](ch27-refs.md#r-27.6)

See also: [cardinality of the natural numbers](ch27-cards.md#g-aleph0), [the first uncountable cardinal](ch27-cards.md#g-aleph1), [cardinality of the continuum](ch27-cards.md#g-cont), [large cardinals](ch27-cards.md#g-inaccessible), [the standard axioms of set theory](ch27-cards.md#g-zfc)

### a one-to-one correspondence — `A ≈ B` {#g-bijection}

*Function or operator*

Cantor’s test for same size: pair the two sets off with nothing left over on either side.

Two sets have the same cardinality exactly when a bijection pairs their members off with nothing left over on either side. On infinite sets the test behaves strangely: the square numbers are a proper part of the whole numbers and can still be paired with them one for one, which is Galileo’s paradox, and Dedekind made that property the definition of an infinite set; the even numbers pair off the same way, by doubling. It is the rule the whole chapter rests on. Type: a tool of the framework.

Cites: [27.1](ch27-refs.md#r-27.1), [27.26](ch27-refs.md#r-27.26)

### ordinal arithmetic’s zero — `ω·0` {#g-ordzero}

*Integer or rational*

Ordinal multiplication by 0 gives 0 even for ω; this ω is the ordinal, not the surreal.

Ordinal multiplication gives ω·0 = 0: the right factor counts zero copies of ω. Cantor introduced the transfinite ordinals in 1883 and presented their arithmetic systematically in 1895–1897. Ordinal arithmetic is not commutative: 2·ω = ω but ω·2 = ω + ω. This ω is the ordinal used in this chapter. The value is the integer 0.

Cites: [27.20](ch27-refs.md#r-27.20), [27.8](ch27-refs.md#r-27.8)

See also: [the first infinite ordinal](ch27-cards.md#g-ordomega)

### von Neumann’s zero — `0 = ∅` {#g-vnzero}

*Integer or rational*

The ordinal 0 is the empty set itself, 1 is {∅}, 2 is {∅, {∅}}: every ordinal is the set of the ordinals before it.

In von Neumann’s 1923 definition, each ordinal is the set of all smaller ordinals, so 0 = ∅, 1 = {0}, 2 = {0, 1}, and ω = {0, 1, 2, …}. Zero is therefore not just of size zero but literally the empty set. It rides beside ω·0 as the brace’s other route to zero, and its value is the integer 0.

Cites: [27.9](ch27-refs.md#r-27.9)

See also: [the first infinite ordinal](ch27-cards.md#g-ordomega), [ordinal arithmetic’s zero](ch27-cards.md#g-ordzero)

### a well-order and its order type — `min T exists` {#g-wellorder}

*Function or operator*

An order in which every non-empty part has a first member. Two such orders have the same order type when they can be matched up in order—and an ordinal is that order type.

A well-order is a total order in which every non-empty subset has a least element. That single condition is what licenses induction and recursion past the finite: there is always a first counterexample to argue about. Every element except possibly a greatest one has an immediate successor, but an element other than the first may have no predecessor at all — ω is the standard case, and that is what makes it a limit. Two ordered sets have the same order type when they can be matched one for one in a way that preserves the order, and an ordinal simply is the order type of a well-ordered set. This is why ω + 1 and 1 + ω differ: adding a point at the end gives an order with a last element, adding one at the front does not change the shape at all. A property of orders, uncolored.

Cites: [27.27](ch27-refs.md#r-27.27)

See also: [the ordinals after omega](ch27-cards.md#g-ordarith), [the first infinite ordinal](ch27-cards.md#g-ordomega)

### the power set of nothing — `|𝒫(∅)| − 1` {#g-pset0}

*Integer or rational*

0: the empty set has exactly one subset, itself, so its power set has one member (2⁰ = 1), and 1 − 1 = 0.

The power set 𝒫(X) is the set of all subsets of X; for the empty set it has the single member ∅, so |𝒫(∅)| = 2⁰ = 1. Cantor’s theorem says that every power set is strictly larger than its base set, and in von Neumann’s construction 𝒫(∅) = {∅} is the ordinal 1. Subtracting 1 gives the integer 0.

Cites: [27.12](ch27-refs.md#r-27.12), [27.3](ch27-refs.md#r-27.3), [27.9](ch27-refs.md#r-27.9)

See also: [Cantor’s theorem](ch27-cards.md#g-cantorthm), [the power set](ch27-cards.md#g-powerset)

### the power set — `𝒫(X)` {#g-powerset}

*Function or operator*

The set of all subsets of X; Cantor’s theorem says it is strictly bigger than X, whatever X is.

The power set 𝒫(X) is the set of all subsets of X, and for the empty set it has the single member ∅. Cantor’s theorem says 𝒫(X) cannot be put in bijection with X, so it is strictly larger for every X, which is what makes the beth ladder climb without end. Taking it of nothing gives a set with one member; subtracting 1 gives the chapter’s third zero. Type: a tool of the framework.

Cites: [27.12](ch27-refs.md#r-27.12), [27.3](ch27-refs.md#r-27.3)

See also: [a one-to-one correspondence](ch27-cards.md#g-bijection), [Cantor’s theorem](ch27-cards.md#g-cantorthm)

### the unique map from the empty set — `|Hom_{Set}(∅, X)|−1` {#g-initialhom}

*Integer or rational*

Exactly 0: for every set X there is one and only one function from ∅ to X, so the count is 1 and 1 − 1 = 0.

In the category Set, the empty set is initial: for every set X there is exactly one morphism ∅ → X, the empty function. Therefore |Hom_{Set}(∅, X)| − 1 = 0. Eilenberg and Mac Lane introduced categories, functors, and natural transformations in their 1945 paper. An integer identity carrying a framework.

Cites: [27.13](ch27-refs.md#r-27.13), [27.14](ch27-refs.md#r-27.14)

See also: [a category](ch27-cards.md#g-category), [the empty function](ch27-cards.md#g-emptyfn)

### the first infinite ordinal — `ω` {#g-ordomega}

*Non-real object*

The order type of the natural numbers; it has no ordinal predecessor, while Chapter ᚙ(X)’s surreal ω − 1 is not an ordinal.

The first transfinite ordinal ω is the order type of 0, 1, 2, … and has no immediate predecessor. Ordinal addition gives 1 + ω = ω but ω + 1 > ω. Chapter ᚙ(X) instead uses surreal arithmetic, in which ω − 1 exists but is not an ordinal. A non-real object.

Cites: [27.10](ch27-refs.md#r-27.10), [27.20](ch27-refs.md#r-27.20), [27.8](ch27-refs.md#r-27.8)

See also: [the natural numbers](ch01-cards.md#g-nats), [one less than infinity](ch26-cards.md#g-omm1), [the ordinals after omega](ch27-cards.md#g-ordarith)

### the ordinals after omega — `ω + 1, ω·2, ω^{2}, ω^{ω}` {#g-ordarith}

*Non-real object*

Counting past infinity: after all the naturals come ω, ω + 1, …, then ω·2, then ω², ω^ω and beyond, each a different well-ordering.

Ordinal arithmetic gives ω + 1 as ω followed by one more element, ω·2 as two copies of ω, ω² as ω copies of ω, and ω^ω as the limit of ω, ω², ω³, …. Cantor developed these order types from 1883 through his 1895–1897 papers. Addition and multiplication are not commutative because they describe orderings rather than sizes; all of these examples are countable. A collection of non-real objects.

Cites: [27.20](ch27-refs.md#r-27.20), [27.8](ch27-refs.md#r-27.8)

See also: [the first infinite ordinal](ch27-cards.md#g-ordomega)

### epsilon nought — `ε_{0}` {#g-epsilon0ord}

*Non-real object*

The first ordinal α with ω^α = α, the limit of ω, ω^ω, ω^(ω^ω), …; Gentzen used induction up to it in his consistency proof for arithmetic.

The ordinal ε₀ is the least α > 0 satisfying ω^α = α, equivalently the limit of the tower ω, ω^ω, ω^(ω^ω), …; it is countable. Gentzen used transfinite induction up to ε₀ in his 1936 consistency proof for Peano arithmetic. This ε is unrelated to Chapter ᚙ(X)’s infinitesimal. A non-real object.

Cites: [27.18](ch27-refs.md#r-27.18)

See also: [an infinitesimal](ch26-cards.md#g-infinitesimal), [the ordinals after omega](ch27-cards.md#g-ordarith), [the first infinite ordinal](ch27-cards.md#g-ordomega)

### the first uncountable ordinal — `ω_{1}` {#g-omega1}

*Non-real object*

The set of all countable ordinals, which is itself uncountable; its cardinality is ℵ₁.

The first uncountable ordinal ω₁ is the set of all countable ordinals; its infinite members form Cantor’s second number class. Every ordinal below it is countable, no countable sequence of smaller ordinals reaches it, and its cardinality is ℵ₁. A non-real object.

Cites: [27.2](ch27-refs.md#r-27.2), [27.20](ch27-refs.md#r-27.20), [27.34](ch27-refs.md#r-27.34)

See also: [the first uncountable cardinal](ch27-cards.md#g-aleph1), [the ordinals after omega](ch27-cards.md#g-ordarith)

### Cantor’s theorem — `2^{κ} > κ` {#g-cantorthm}

*Function or operator*

The power set of any set is strictly bigger than the set, so there is no largest infinity.

Cantor’s theorem says that every set X has fewer members than its power set: 2^|X| > |X|. Cantor proved it with the diagonal method in an 1891/92 paper. It creates the endless beth ladder and rules out a largest cardinal. A theorem of the framework.

Cites: [27.20](ch27-refs.md#r-27.20), [27.3](ch27-refs.md#r-27.3)

See also: [the diagonal argument](ch27-cards.md#g-diagonal), [the power set](ch27-cards.md#g-powerset)

### the diagonal argument — `Cantor’s diagonal argument` {#g-diagonal}

*Function or operator*

List the reals however you like; change the n-th digit of the n-th number and you have built a real not on the list.

Cantor’s diagonal argument, published at the start of the 1890s, builds from any list of infinite binary sequences a sequence that differs from its n-th entry in the n-th place. The new sequence is absent from the list, so the binary sequences—and hence the reals—are uncountable. A method of the framework.

Cites: [27.20](ch27-refs.md#r-27.20), [27.3](ch27-refs.md#r-27.3)

See also: [the real numbers](ch01-cards.md#g-reals)

### cardinal arithmetic — `κ + λ = κ·λ = max(κ, λ)` {#g-cardarith}

*Function or operator*

For infinite cardinals in ZFC, addition and multiplication return the larger size; among the basic operations, only exponentiation can make a larger one.

In ZFC, if κ and λ are infinite cardinals, then κ + λ = κ·λ = max(κ, λ). Among addition, multiplication, and exponentiation, only exponentiation can produce a larger infinite cardinal; also 0·κ = 0. Cardinal multiplication has no general inverse, which is why this chapter’s formula adds its braces instead of dividing them. A rule of the framework.

Cites: [27.7](ch27-refs.md#r-27.7)

See also: [the standard axioms of set theory](ch27-cards.md#g-zfc)

### the continuum hypothesis — `𝔠 = ℵ_{1}` {#g-ch}

*Function or operator*

Is the size of the real line the very next infinity after the naturals? If the usual axioms are consistent, they neither prove it nor refute it.

The continuum hypothesis is Cantor’s conjecture of 1878, in modern notation 2^ℵ₀ = ℵ₁, and became Hilbert’s first problem in 1900. Gödel’s 1940 monograph showed that it cannot be refuted from ZFC if ZFC is consistent, and Cohen showed in 1963 that it cannot be proved if ZFC is consistent. A statement of the framework, independent of ZFC.

Cites: [27.20](ch27-refs.md#r-27.20), [27.22](ch27-refs.md#r-27.22), [27.28](ch27-refs.md#r-27.28), [27.4](ch27-refs.md#r-27.4), [8.13](ch08-refs.md#r-8.13)

See also: [the first uncountable cardinal](ch27-cards.md#g-aleph1), [the axioms](ch08-cards.md#g-axioms), [the continuum hypothesis, undecided](ch08-cards.md#g-chindep), [cardinality of the continuum](ch27-cards.md#g-cont), [the real numbers](ch01-cards.md#g-reals), [the standard axioms of set theory](ch27-cards.md#g-zfc)

### the standard axioms of set theory — `ZFC` {#g-zfc}

*Function or operator*

The standard first-order set theory: the Zermelo–Fraenkel axioms plus Choice.

Zermelo–Fraenkel set theory with Choice, ZFC, grew from Zermelo’s 1908 axiomatization through work by Fraenkel, Skolem, and von Neumann. It is the standard first-order framework relative to which the continuum hypothesis is, if ZFC is consistent, independent. A framework, not a value.

Cites: [27.15](ch27-refs.md#r-27.15), [27.28](ch27-refs.md#r-27.28), [27.4](ch27-refs.md#r-27.4)

See also: [the axioms](ch08-cards.md#g-axioms), [the continuum hypothesis](ch27-cards.md#g-ch)

### the axiom of choice — `AC` {#g-ac}

*Function or operator*

Given any collection of nonempty sets, you may pick one element from each; harmless for finitely many, powerful and strange for infinitely many.

The axiom of choice says that a choice function exists for every collection of nonempty sets. Zermelo isolated it in his 1904 proof that every set can be well ordered; Gödel and Cohen later showed that it is independent of ZF, assuming ZF is consistent. A statement of the framework.

Cites: [27.15](ch27-refs.md#r-27.15)

### Russell’s paradox — `{x | x ∉ x}` {#g-russell}

*Function or operator*

The set of all sets that are not members of themselves: it is a member of itself exactly when it is not, so no such set exists.

Russell’s paradox asks for the collection R of all sets not members of themselves; then R ∈ R exactly when R ∉ R. The contradiction helped force set theory into an axiomatic form and shows why some collections are proper classes rather than sets. A contradiction of the naive framework.

Cites: [27.16](ch27-refs.md#r-27.16)

### large cardinals — `κ inaccessible` {#g-inaccessible}

*Non-real object*

Assuming ZFC is consistent, it cannot prove that these cardinals exist; a strongly inaccessible cardinal is uncountable, regular, and a strong limit.

A cardinal κ is strongly inaccessible when it is uncountable, regular (not the union of fewer than κ smaller cardinals), and a strong limit: 2^λ < κ for every λ < κ. Assuming ZFC is consistent, Gödel’s second incompleteness theorem prevents ZFC from proving that such a cardinal exists. That is why none stands in the product. A non-real object, if it exists at all.

Cites: [27.17](ch27-refs.md#r-27.17)

See also: [Gödel’s incompleteness theorems](ch08-cards.md#g-godel), [the standard axioms of set theory](ch27-cards.md#g-zfc)

### a category — `ob(C), hom(C)` {#g-category}

*Function or operator*

Objects and the arrows between them, with a composition rule and an identity arrow on every object.

A category is a class of objects, a class of morphisms or arrows between them, an associative composition ∘: hom(b, c) × hom(a, b) → hom(a, c), and an identity arrow on every object. The objects are atomic in the definition—nothing is assumed about what is inside them—so they can only be characterized by their relations to other objects, which is exactly what the arrows record. Eilenberg and Mac Lane introduced categories, functors, and natural transformations in their 1945 paper. Type: a tool of the framework.

Cites: [27.13](ch27-refs.md#r-27.13), [27.24](ch27-refs.md#r-27.24)

### an initial object — `I → X` {#g-initialobj}

*Function or operator*

An object with exactly one arrow to every object of its category.

An initial object of a category C is an object I such that for every object X of C there is precisely one morphism I → X; a terminal object has exactly one morphism the other way. Two initial objects of the same category are related by a unique isomorphism. In Set the empty set is the unique initial object, and its single arrow to each X is the empty function, which is where this chapter’s fourth zero comes from. Type: a tool of the framework.

Cites: [27.14](ch27-refs.md#r-27.14), [27.25](ch27-refs.md#r-27.25)

See also: [a category](ch27-cards.md#g-category), [the empty function](ch27-cards.md#g-emptyfn)

### the empty function — `∅ → X` {#g-emptyfn}

*Non-real object*

The empty function is the unique function whose domain is the empty set, one for every possible codomain X, since there are no elements to assign anywhere and so nothing that could go wrong.

For any set X there is exactly one function ∅ → X, vacuously satisfying the definition of a function because it has no inputs to map incorrectly; this is why the empty set is the initial object of the category Set, with the empty function as its single outgoing arrow to every object. It is a genuine function even though its graph is the empty set. In the other direction there is usually no function at all: a function X → ∅ exists only when X is itself empty. The count |Hom(∅, X)| = 1 for every X is what makes the empty set initial; the terminal objects of Set, with exactly one arrow in from every set, are the one-element sets, so no object of Set is both initial and terminal.

Cites: [27.35](ch27-refs.md#r-27.35)

See also: [a category](ch27-cards.md#g-category), [an initial object](ch27-cards.md#g-initialobj)