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 be a well-order (Well-order and well-ordered set) and let ; put and define if and only if and , or and . Then:
(i) is a well-order, (Initial segment of a well-order), and the identity is an order isomorphism of onto the proper initial segment (Order embedding and order isomorphism), so in Comparability of well-orders applied to and it is alternative (ii) that holds, with the unique witness , and is not order isomorphic to ;
(ii) for the extension is equinumerous with (Equinumerous sets, and ) but is not order isomorphic to : the extension has a greatest element and does not;
(iii) for 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 , a point , the set with the relation defined in the Example, and in parts (ii) and (iii), where with and .
A well-order on a set is a total order in which every nonempty 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).
For a well-order and in it, the initial segment is (Initial segment of a well-order).
An order isomorphism between posets is a surjective order embedding, equivalently a bijection with (Order embedding and order isomorphism).
For well-orders and exactly one of the following holds: ; for a unique ; or for a unique (Comparability of well-orders).
Every well-order is order isomorphic to exactly one ordinal ; the isomorphism is the collapsing map , it is unique, and its image is (Every well-order has a unique order type).
Sets and are equinumerous when there is a bijection ; a function is injective when implies , surjective when every element of the codomain is a value, and bijective when both (Equinumerous sets, and , Injection, surjection, bijection).
with , , and is the set of its predecessors; is an inductive set contained in every inductive set (The natural numbers (von Neumann)).
In : for every , and is injective (The von Neumann naturals form a Peano system).
Every natural number other than is for some natural (Every nonzero natural number is a successor).
For naturals: for every , and (On the order is membership: ).
For every ordinal the successor is (Ordinal (von Neumann)).
Verification
The relation is irreflexive: if with then , impossible in the total order ; if then the definition would need , which is excluded.
Trichotomy: for distinct either both lie in , and totality of decides between and , or one of them is , and then when while when .
Transitivity: if and , then either , in which case and by the second clause, or ; in the second case and the first clause gives , so and .
, and the identity map is an order isomorphism of onto : a member of satisfies exactly when , by the second clause of the definition; and for one has if and only if , so the identity is a bijection onto preserving and reflecting the order.
Every nonempty has a -least element: if meets , then is a nonempty subset of the well-order with least element , and is -least in , since a member of is either itself or lies strictly above in , hence in , while satisfies ; if meets in nothing, then and is least.
For the extension is equinumerous with : the map with and for is a bijection . It is injective, since is injective and for every , so the values are nonzero and distinct and differ from ; and it is surjective, since while every in equals for some by [F9].
When : is a greatest element of , because for every ; and has no greatest element, because for every .
For and the predecessors of in are exactly the naturals below : a member of satisfies if and only if and , because satisfies neither disjunct of the definition and a natural satisfies the first exactly when ; hence .
The collapse computes the finite levels: for one has for every , where is the collapsing map of [F5]. Otherwise the set of with is nonempty and has a least element ; then for every , and by step 1.8 and [F5] we get by [F10], a contradiction.
Claim (i), the comparability consequence: step 1.4 exhibits an order isomorphism , which is alternative (ii) of [F4] for the pair of well-orders and with witness ; by the mutual exclusivity in [F4] the alternative fails, and the witness is unique.
Claim (ii), the non-isomorphism: is not order isomorphic to . If were an order isomorphism, then every is for some , and every satisfies or because is greatest by step 1.7, so ; thus would be a greatest element of , contradicting step 1.7 since in .
Claim (iii): for the predecessors of are exactly the members of by step 1.4, so by step 2.1, the last equality because and have the same members; and the image of is by [F5], so by [F11]: the collapse is an order isomorphism of onto the ordinal .
Parts (i) to (iii) are established: is irreflexive, trichotomous and transitive by steps 1.1 to 1.3 and every nonempty subset of has a least element by step 1.5, so is a well-order with by step 1.4; the comparability classification and its unique witness are step 2.2. For 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 , 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
- Well-order and well-ordered set
- Initial segment of a well-order
- Order embedding and order isomorphism
- Comparability of well-orders
- Every well-order has a unique order type
- Basic closure properties of ordinals
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- The natural numbers $\mathbb{N}$ (von Neumann)
- The von Neumann naturals form a Peano system
- Every nonzero natural number is a successor
- Injection, surjection, bijection
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Ordinal (von Neumann)
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
- A. Marks, Set Theory (Berkeley lecture notes, 2026) (standard reference, not scraped)
- J. T. Moore, MATH 6870: Set Theory (Cornell lecture notes) (standard reference, not scraped)