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.
Initial segment of a well-order
Definition
Let be a well-order (Well-order and well-ordered set).
A subset is an initial segment of when it is downward closed: if and then . It is a proper initial segment when .
For write
and call the initial segment determined by .
Every initial segment , carrying the order inherited from , is itself a well-order: the inherited order is total, and a nonempty subset of is a nonempty subset of , so it has a least element, which lies in .
Remarks
- and are initial segments of ; each is a proper initial segment, since by irreflexivity; and each is an initial segment.
- Every proper initial segment is for exactly one . Let be an initial segment and put , which exists because is a nonempty subset of the well-order (Well-order and well-ordered set). If then by minimality of , so ; hence . Conversely let . Then , because , and is impossible, because downward closure would then put ; so by trichotomy, and . Therefore . For uniqueness, suppose with , say ; then , that is , which is impossible.
- Nesting. If then , so an initial segment of an initial segment of is an initial segment of . This is used whenever two well-orders are compared.
- The initial segments of are therefore exactly the sets for , together with itself, and inclusion orders them in the same shape as with one extra element added on top.
- The corresponding notion for a general poset would be a downward closed set, or "lower set". Nothing on this page needs it outside the well-ordered case, so the definition is stated only there, where the second clause above makes the family of initial segments completely explicit.
Depends on
Used by
- Comparability of well-orders Lemma
- Rigidity of well-orders Lemma
- Transfinite recursion along the ordinals: a class rule determines exactly one operation defined at every ordinal Lemma
- α · β is the order type of α × β ordered by last differences, that is β copies of α Lemma
- α + β is the order type of α followed by β Lemma
- Every well-order has a unique order type Theorem
- For α ≤ β there is exactly one ordinal γ with α + γ = β Theorem
- Hartogs: an ordinal that does not inject into a given set Theorem
- Hessenberg: κ ⊗ κ = κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ × κ Theorem
- The well-ordering theorem Theorem
- Transfinite induction Theorem
- Transfinite recursion Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 18 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Initial segment (Wikipedia) (standard reference, not scraped)
- Well-order (Wikipedia) (standard reference, not scraped)
- A. Marks, Set Theory (standard reference, not scraped)
- Formalization of the Axiom of Choice and its Equivalent Theorems (standard reference, not scraped)