Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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,≤) be a chain-complete poset, f:P→P progressive, and let M be the smallest f-admissible subset of P (A smallest admissible set exists).

An element x∈M is extremal if for every y∈M with y<x,f(y)≤x.

For x∈M, the cut at x is the subset Mx:={ y∈M : y≤x  or  f(x)≤y }⊆M.

Remarks

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

Depends on

Used by

Dependency tree · two levels

3 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