Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-07-26 (claude-opus-5)
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 (W,<) be a well-order (Well-order and well-ordered set).

A subset I⊆W is an initial segment of W when it is downward closed: if x∈I and y<x then y∈I. It is a proper initial segment when I≠W.

For a∈W write

W<a:={x∈W:x<a},W≤a:={x∈W:x≤a}=W<a∪{a},

and call W<a the initial segment determined by a.

Every initial segment I, carrying the order inherited from W, is itself a well-order: the inherited order is total, and a nonempty subset of I is a nonempty subset of W, so it has a least element, which lies in I.

Remarks

  • ∅ and W are initial segments of W; each W<a is a proper initial segment, since a∉W<a by irreflexivity; and each W≤a is an initial segment.
  • Every proper initial segment is W<a for exactly one a. Let I⊊W be an initial segment and put a=min⁡(W∖I), which exists because W∖I is a nonempty subset of the well-order W (Well-order and well-ordered set). If x<a then x∉W∖I by minimality of a, so x∈I; hence W<a⊆I. Conversely let x∈I. Then x≠a, because a∉I, and a<x is impossible, because downward closure would then put a∈I; so x<a by trichotomy, and I⊆W<a. Therefore I=W<a. For uniqueness, suppose W<a=W<b with a≠b, say a<b; then a∈W<b=W<a, that is a<a, which is impossible.
  • Nesting. If b<a then (W<a)<b=W<b, so an initial segment of an initial segment of W is an initial segment of W. This is used whenever two well-orders are compared.
  • The initial segments of W are therefore exactly the sets W<a for a∈W, together with W itself, and inclusion orders them in the same shape as W 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

Dependency tree · two levels

5 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