Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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,<)(W, <) be a well-order (Well-order and well-ordered set).

A subset IWI \subseteq W is an initial segment of WW when it is downward closed: if xIx \in I and y<xy < x then yIy \in I. It is a proper initial segment when IWI \ne W.

For aWa \in W write

W<a:={xW:x<a},Wa:={xW:xa}=W<a{a},W_{<a} := \{x \in W : x < a\}, \qquad W_{\le a} := \{x \in W : x \le a\} = W_{<a} \cup \{a\},

and call W<aW_{<a} the initial segment determined by aa.

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

Remarks

  • \emptyset and WW are initial segments of WW; each W<aW_{<a} is a proper initial segment, since aW<aa \notin W_{<a} by irreflexivity; and each WaW_{\le a} is an initial segment.
  • Every proper initial segment is W<aW_{<a} for exactly one aa. Let IWI \subsetneq W be an initial segment and put a=min(WI)a = \min(W \setminus I), which exists because WIW \setminus I is a nonempty subset of the well-order WW (Well-order and well-ordered set). If x<ax < a then xWIx \notin W \setminus I by minimality of aa, so xIx \in I; hence W<aIW_{<a} \subseteq I. Conversely let xIx \in I. Then xax \ne a, because aIa \notin I, and a<xa < x is impossible, because downward closure would then put aIa \in I; so x<ax < a by trichotomy, and IW<aI \subseteq W_{<a}. Therefore I=W<aI = W_{<a}. For uniqueness, suppose W<a=W<bW_{<a} = W_{<b} with aba \ne b, say a<ba < b; then aW<b=W<aa \in W_{<b} = W_{<a}, that is a<aa < a, which is impossible.
  • Nesting. If b<ab < a then (W<a)<b=W<b(W_{<a})_{<b} = W_{<b}, so an initial segment of an initial segment of WW is an initial segment of WW. This is used whenever two well-orders are compared.
  • The initial segments of WW are therefore exactly the sets W<aW_{<a} for aWa \in W, together with WW itself, and inclusion orders them in the same shape as WW 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 · 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