Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)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.

Extremal element and its cut (Bourbaki–Witt)

Definition

Let (P,)(P, \le) be a chain-complete poset, f:PPf : P \to P progressive, and let MM be the smallest ff-admissible subset of PP (A smallest admissible set exists).

An element xMx \in M is extremal if for every yM with y<x,f(y)x.\text{for every } y \in M \text{ with } y < x, \quad f(y) \le x.

For xMx \in M, the cut at xx is the subset Mx:={yM : yx  or  f(x)y}M.M_x := \{\, y \in M \ : \ y \le x \ \text{ or } \ f(x) \le y \,\} \subseteq M.

Remarks

  • Read extremality as: xx cannot be jumped over from below. If yy sits strictly below xx inside MM, then applying ff to yy does not carry it past xx. Nothing in the definition says such yy exist; \bot is extremal vacuously.
  • The cut MxM_x is the set of elements of MM that are comparable to xx in the strong sense of lying at or below xx, or at or above f(x)f(x). It deliberately omits anything strictly between xx and f(x)f(x). The whole Bourbaki–Witt argument consists of showing that for extremal xx the cut is everything (Everything in MM is comparable to an extremal element) and that every element is extremal (Every element of MM is extremal), and those two facts together say precisely that MM is totally ordered (The smallest admissible set is a chain).
  • Both notions are relative to MM and to ff, not to PP. They are scaffolding for one proof and are not used after Bourbaki–Witt fixed point theorem.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 5 results over 4 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