Cardinals
DefinitionCardinal#
Cardinal.{u} is the type of cardinal numbers in Type u,
defined as the quotient of Type u by existence of an equivalence
(a bijection with explicit inverse).
Cardinal.{u} : Type (u + 1)
Sources
Used by 39
DefinitionAleph numbers#
The aleph function gives the infinite cardinals listed by their ordinal index. aleph 0 = ℵ₀,
aleph 1 = succ ℵ₀ is the first uncountable cardinal, and so on.
For a version including finite cardinals, see Cardinal.preAleph.
Conventions for notations in identifiers:
- The recommended spelling of
ℵ_in identifiers isaleph.
Cardinal.aleph.{u_1} : Ordinal.{u_1} ↪o Cardinal.{u_1}
Sources
Uses 3
DefinitionBeth numbers#
The Beth function is defined so that beth 0 = ℵ₀, beth (succ o) = 2 ^ beth o, and that for a
limit ordinal o, beth o is the supremum of beth a for a < o.
Assuming the generalized continuum hypothesis, which is undecidable in ZFC, we have ℶ_ o = ℵ_ o
for all ordinals.
For a version which starts at zero, see Cardinal.preBeth.
Cardinal.beth.{u} (o : Ordinal.{u}) : Cardinal.{u}
Sources
Uses 3
DefinitionCofinality#
The cofinality of a preorder is the smallest cardinality of a cofinal subset.
Order.cof.{u} (α : Type u) [Preorder α] : Cardinal.{u}
Sources
Uses 2 · Used by 2
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.