Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge 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.

The image of an extremal element is extremal

Statement

Let (P,)(P, \le) be a chain-complete poset, f:PPf : P \to P progressive, MM the smallest admissible set, and xMx \in M extremal (Extremal element and its cut (Bourbaki–Witt)). Then f(x)f(x) is extremal.

Facts & Assumptions

Given: A chain-complete poset (P,)(P, \le), a progressive f:PPf : P \to P, the smallest admissible set MM, an extremal xMx \in M, and an element yMy \in M with y<f(x)y < f(x).

[A1]

xx is extremal: for every zMz \in M with z<xz < x, f(z)xf(z) \le x (Extremal element and its cut (Bourbaki–Witt)).

[L1]

For every zMz \in M, either zxz \le x or f(x)zf(x) \le z (Everything in MM is comparable to an extremal element).

[L2]

MM is closed under ff (A smallest admissible set exists).

[L3]

ff is progressive: zf(z)z \le f(z) for every zPz \in P (Chain-complete poset).

[L4]

\le is a partial order: it is reflexive (uuu \le u), transitive (uvu \le v and vwv \le w imply uwu \le w) and antisymmetric (uvu \le v and vuv \le u imply u=vu = v), and its strict form u<vu < v means uvu \le v together with uvu \ne v (Partial order and partially ordered set).

Proof

technique · cases
1.1

f(x)Mf(x) \in M because MM is closed under ff, so it makes sense to ask whether f(x)f(x) is extremal.

L2
1.2

It suffices to show f(y)f(x)f(y) \le f(x) for the given yMy \in M with y<f(x)y < f(x), since that is exactly the defining condition.

suffices: f(y) le f(x)
1.3

Comparability at the extremal xx gives yxy \le x or f(x)yf(x) \le y.

L1
1.4

Suppose y<xy < x.

assume-case strict
1.5

Suppose y=xy = x.

assume-case equal
2.1

The alternative f(x)yf(x) \le y is impossible: y<f(x)y < f(x) gives yf(x)y \le f(x) with yf(x)y \ne f(x), so f(x)yf(x) \le y together with yf(x)y \le f(x) would force f(x)=yf(x) = y by antisymmetry, contradicting yf(x)y \ne f(x). (Transitivity alone would only give f(x)f(x)f(x) \le f(x), which is no contradiction; antisymmetry is what is doing the work.) Hence yxy \le x.

step 1.3step 1.2L4
2.2

In the case y<xy < x, extremality of xx gives f(y)xf(y) \le x, and progressivity gives xf(x)x \le f(x), so f(y)f(x)f(y) \le f(x) by transitivity.

step 1.4A1L3L4
2.3

In the case y=xy = x, we get f(y)=f(x)f(y) = f(x), hence f(y)f(x)f(y) \le f(x) by reflexivity.

step 1.5L4
3.1

The relation yxy \le x holds exactly when y<xy < x or y=xy = x, by the definition of the strict order, so the two cases are exhaustive and f(y)f(x)f(y) \le f(x) in both; therefore f(x)f(x) is extremal.

step 2.1step 2.2step 2.3L4cases-exhaustive

Remarks

  • Step 2.1 is where the comparability lemma earns its place. Without it there would be no way to rule out an element of MM sitting strictly between xx and f(x)f(x), and such an element would break extremality of f(x)f(x) immediately.
  • Extremality is not a monotonicity condition in disguise. Nothing here assumes ff preserves order, and the proof never compares ff of two different elements except through xx itself.

Depends on

Used by

Dependency tree · next 3 levels

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