Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Hartogs number of ω is a limit ordinal above ω

Example

Let H=ℵ(ω) be the least ordinal that admits no injection into ω (Hartogs: an ordinal that does not inject into a given set). Then H is a limit ordinal (Successor and limit ordinals) with ω∈H, so ω<H, and H is uncountable (Finite, countably infinite, countable, uncountable); explicitly H={α:α is an ordinal and is at most countable} is the set of countable ordinals, and H is not the successor of any ordinal. No choice principle is used.

Facts & Assumptions

Given: The von Neumann naturals N=ω, the Hartogs number H=ℵ(ω), namely the least ordinal that admits no injection into ω, and {ot(S,R):S⊆ω, R well-orders S} for it (Hartogs: an ordinal that does not inject into a given set).

[F1]

ℵ(A) is the least ordinal that does not inject into A, and it equals the set of order types of well-orders of subsets of A; no choice is used (Hartogs: an ordinal that does not inject into a given set).

[F2]

A set is finite when it is equinumerous with some natural number, countably infinite when equinumerous with N=ω, at most countable when finite or countably infinite, and uncountable when not at most countable; ≈ is equinumerosity and ⪯ domination by an injection (Finite, countably infinite, countable, uncountable, Equinumerous sets, A≈B and A⪯B).

[F3]

Subsets of at most countable sets are at most countable (Every subset of an at most countable set is at most countable).

[F4]

Every ordinal is exactly one of 0, a successor ordinal β+=β∪{β}, or a limit ordinal, meaning a nonzero ordinal that is not a successor (Successor and limit ordinals, Ordinal (von Neumann)).

[F5]

Every element of an ordinal is an ordinal, α∉α, and α⊆β if and only if α∈β or α=β, for ordinals (Basic closure properties of ordinals).

[F7]

ω=N is an ordinal, every element of ω is a natural number, and every natural number is an ordinal (ω is the least limit ordinal, The natural numbers N (von Neumann)).

[F8]

In (N,0,σ): σ(n)≠0 for every n, and σ is injective (The von Neumann naturals form a Peano system).

[F9]

A function is injective when it never takes equal values at distinct arguments, and bijective when it is injective and onto; an injection is a bijection onto its image (Injection, surjection, bijection).

[F10]

Every well-order is order isomorphic to exactly one ordinal, its order type (Every well-order has a unique order type); an order isomorphism is a bijection preserving and reflecting the order (Order embedding and order isomorphism), and a well-order is a total order in which every nonempty subset has a least element (Well-order and well-ordered set).

Verification

technique · direct
1.1F5F9F10

Transport of well-orders along an injection: if α is an ordinal and j:α→ω is injective, then S=j[α]⊆ω and R={(j(ξ),j(η)):ξ,η∈α, ξ∈η} well-order S, the map j is an order isomorphism of (α,∈) onto (S,R), and ot(S,R)=α. Indeed j is a bijection onto S; R is irreflexive since ξ∉ξ; R is transitive and trichotomous because membership on the ordinal α is; and a nonempty T⊆S has j−1[T] nonempty with an ∈-least element ξ, whose image j(ξ) is R-least in T. Since j(ξ)Rj(η) holds exactly when ξ∈η by injectivity, j preserves and reflects the order and [F10] identifies ot(S,R) with α.

1.2F2F3F7F9

For every ordinal α: α⪯ω if and only if α is at most countable. If j:α→ω is injective, then j is a bijection of α onto the subset j[α]⊆ω, which is at most countable by [F3], so α is at most countable because the three size classes of [F2] are defined by equinumerosity; conversely, if α is finite then α≈m for some natural number m, and m⊆ω gives an injection α→ω by composition, while if α is countably infinite then α≈N=ω gives one directly.

2.1step 1.1F1F9F10

H={α:α is an ordinal and α⪯ω}: if α=ot(S,R) for a subset S⊆ω well ordered by R, the order isomorphism α→S is injective into ω; conversely an injection j:α→ω produces S=j[α] and R with ot(S,R)=α by step 1.1, so α is one of the order types displayed in [F1].

3.1step 2.1step 1.2F1

H is the set of at most countable ordinals and admits no injection into ω: by step 2.1 and step 1.2 an ordinal α lies in H exactly when it is at most countable, and by [F1] the ordinal H itself does not inject into ω.

3.2step 2.1F4

ω∈H and H≠0: the identity is an injection ω→ω, so ω⪯ω and hence ω∈H by step 2.1; therefore H has a member and is not the ordinal 0, which has none.

4.1step 3.1F4F5F7F8F9

H is not a successor ordinal: suppose H=α+=α∪{α} for an ordinal α. Then α∈H, so α⪯ω by step 2.1, say through an injection j:α→ω. Define g on the domain α+ by g(β)=σ(j(β)) for β∈α and g(α)=0; this is well defined because α∉α, its values lie in ω because ω is inductive, and it is injective: the value 0 is taken only at α since σ(n)≠0 for every n, and on α the map is σ composed with the injective j, hence injective. So H=α+ would inject into ω, contradicting that H admits no injection into ω by step 3.1.

5.1step 1.2step 3.1step 3.2step 4.1F1F2F4F5

H is a limit ordinal with ω∈H, and it is the set of countable ordinals: H is an ordinal by [F1], it is nonzero by step 3.2 and not a successor by step 4.1, so it is a limit ordinal by [F4]; ω∈H by step 3.2, so ω<H in the ordinal order of [F5]; the identification H={α:α is an ordinal and is at most countable} is step 3.1, and H itself is uncountable because it is the least ordinal that does not inject into ω and an at most countable ordinal would inject into ω by step 1.2.

6.1step 2.1step 3.1step 3.2step 4.1step 5.1F1∎

Everything claimed is established: H=ℵ(ω) is a limit ordinal with ω∈H, explicitly the set of at most countable ordinals, hence uncountable and not a successor; the argument used only the transport of well-orders along injections, Schröder-free counting, and the Peano properties of σ, all choice free, so no choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources