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 one-point extension of a well-order, and ω with a new top element

Example

Let (V,<) be a well-order (Well-order and well-ordered set) and let ∞∉V; put W=V∪{∞} and define x≺y if and only if x,y∈V and x<y, or x∈V and y=∞. Then:

(i) W is a well-order, W<∞=V (Initial segment of a well-order), and the identity is an order isomorphism of (V,<) onto the proper initial segment W<∞ (Order embedding and order isomorphism), so in Comparability of well-orders applied to (V,<) and (W,≺) it is alternative (ii) that holds, with the unique witness b=∞, and V is not order isomorphic to W;

(ii) for V=N=ω the extension is equinumerous with ω (Equinumerous sets, A≈B and A⪯B) but is not order isomorphic to (ω,<): the extension has a greatest element and ω does not;

(iii) for V=ω the collapsing map of Every well-order has a unique order type carries this extension of ω to an order isomorphism onto the ordinal ω+=ω∪{ω} (Ordinal (von Neumann)), so its order type is ω+.

No choice principle is used.

Facts & Assumptions

Given: A well-order (V,<), a point ∞∉V, the set W=V∪{∞} with the relation ≺ defined in the Example, and V=ω in parts (ii) and (iii), where ω=N with 0=∅ and σ(n)=n∪{n}.

[F1]

A well-order on a set X is a total order in which every nonempty S⊆X has a least element; in the strict presentation it is irreflexive, transitive, trichotomous, and every nonempty subset has an element with nothing strictly below it in the subset (Well-order and well-ordered set).

[F2]

For a well-order and a in it, the initial segment is X<a={x∈X:x<a} (Initial segment of a well-order).

[F3]

An order isomorphism between posets is a surjective order embedding, equivalently a bijection f with x≤y  ⟺  f(x)≤f(y) (Order embedding and order isomorphism).

[F4]

For well-orders V and W exactly one of the following holds: V≅W; V≅W<b for a unique b∈W; or V<a≅W for a unique a∈V (Comparability of well-orders).

[F5]

Every well-order (X,<) is order isomorphic to exactly one ordinal ot(X); the isomorphism is the collapsing map F(a)={F(b):b<a}, it is unique, and its image is ot(X) (Every well-order has a unique order type).

[F6]

Sets A and B are equinumerous when there is a bijection A→B; a function is injective when f(x)=f(y) implies x=y, surjective when every element of the codomain is a value, and bijective when both (Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection).

[F7]

ω=N with 0=∅, σ(n)=n∪{n}, and n={m∈N:m<n} is the set of its predecessors; N is an inductive set contained in every inductive set (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]

Every natural number other than 0 is σ(m) for some natural m (Every nonzero natural number is a successor).

[F10]

For naturals: n<σ(n) for every n, and n={m∈N:m<n} (On N the order is membership: m<n  ⟺  m∈n).

[F11]

For every ordinal α the successor is α+=α∪{α} (Ordinal (von Neumann)).

Verification

technique · direct
1.1F1

The relation ≺ is irreflexive: if x≺x with x∈V then x<x, impossible in the total order V; if x=∞ then the definition would need ∞∈V, which is excluded.

1.2F1

Trichotomy: for distinct x,y∈W either both lie in V, and totality of < decides between x<y and y<x, or one of them is ∞, and then x≺∞ when x∈V while y≺∞ when y∈V.

1.3F1

Transitivity: if x≺y and y≺z, then either z=∞, in which case x∈V and x≺z by the second clause, or z∈V; in the second case y∈V and the first clause gives x<y<z, so x<z and x≺z.

1.4F2F3

W<∞=V, and the identity map is an order isomorphism of (V,<) onto (W<∞,≺): a member x of W satisfies x≺∞ exactly when x∈V, by the second clause of the definition; and for x,y∈V one has x<y if and only if x≺y, so the identity is a bijection onto W<∞ preserving and reflecting the order.

1.5F1

Every nonempty S⊆W has a ≺-least element: if S meets V, then S∩V is a nonempty subset of the well-order V with least element ℓ, and ℓ is ≺-least in S, since a member of S∩V is either ℓ itself or lies strictly above ℓ in V, hence in ≺, while ∞ satisfies ℓ≺∞; if S meets V in nothing, then S={∞} and ∞ is least.

1.6F6F7F8F9

For V=ω the extension is equinumerous with ω: the map g with g(∞)=0 and g(n)=σ(n) for n∈ω is a bijection W→ω. It is injective, since σ is injective and σ(n)≠0 for every n, so the values σ(n) are nonzero and distinct and differ from 0=g(∞); and it is surjective, since 0=g(∞) while every m≠0 in ω equals σ(m′)=g(m′) for some m′ by [F9].

1.7F7F10

When V=ω: ∞ is a greatest element of W, because x≺∞ for every x∈V; and ω has no greatest element, because n<σ(n)∈ω for every n∈ω.

1.8F2F7F10

For V=ω and n∈ω the predecessors of n in W are exactly the naturals below n: a member y of W satisfies y≺n if and only if y∈ω and y<n, because y=∞ satisfies neither disjunct of the definition and a natural y satisfies the first exactly when y<n; hence W<n={m∈ω:m<n}=n.

2.1step 1.8F5F10

The collapse computes the finite levels: for V=ω one has F(n)=n for every n∈ω, where F(y)={F(z):z≺y} is the collapsing map of [F5]. Otherwise the set of n with F(n)≠n is nonempty and has a least element n0; then F(m)=m for every m<n0, and by step 1.8 and [F5] we get F(n0)={F(z):z≺n0}={F(m):m<n0}={m:m<n0}=n0 by [F10], a contradiction.

2.2step 1.4F4

Claim (i), the comparability consequence: step 1.4 exhibits an order isomorphism V≅W<∞, which is alternative (ii) of [F4] for the pair of well-orders (V,<) and (W,≺) with witness ∞; by the mutual exclusivity in [F4] the alternative V≅W fails, and the witness is unique.

2.3step 1.7F3F10

Claim (ii), the non-isomorphism: W is not order isomorphic to (ω,<). If f:W→ω were an order isomorphism, then every m∈ω is f(x) for some x∈W, and every x∈W satisfies x=∞ or x≺∞ because ∞ is greatest by step 1.7, so m=f(x)≤f(∞); thus f(∞) would be a greatest element of ω, contradicting step 1.7 since f(∞)<σ(f(∞)) in ω.

3.1step 1.4step 2.1F5F7F11

Claim (iii): for V=ω the predecessors of ∞ are exactly the members of ω by step 1.4, so F(∞)={F(z):z≺∞}={F(n):n∈ω}={n:n∈ω}=ω by step 2.1, the last equality because {n:n∈ω} and ω have the same members; and the image of F is ot(W) by [F5], so ot(W)={F(y):y∈W}={n:n∈ω}∪{ω}=ω∪{ω}=ω+ by [F11]: the collapse is an order isomorphism of W onto the ordinal ω+.

4.1step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6step 2.1step 2.2step 2.3step 3.1F5∎

Parts (i) to (iii) are established: ≺ is irreflexive, trichotomous and transitive by steps 1.1 to 1.3 and every nonempty subset of W has a least element by step 1.5, so W is a well-order with W<∞=V by step 1.4; the comparability classification and its unique witness are step 2.2. For V=ω the extension is equinumerous with ω by step 1.6 and not order isomorphic to it by step 2.3, and the collapse has image ω+ by steps 2.1 and 3.1, so the order type of the extension is ω+. Nothing is ever selected: the least elements come from the given well-order of V, the bijection in step 1.6 is one explicit formula, and the collapse is unique by [F5], so no choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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