Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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,≤) be a chain-complete poset, f:P→P progressive, M the smallest admissible set, and x∈M extremal (Extremal element and its cut (Bourbaki–Witt)). Then f(x) is extremal.

Facts & Assumptions

Given: A chain-complete poset (P,≤), a progressive f:P→P, the smallest admissible set M, an extremal x∈M, and an element y∈M with y<f(x).

[A1]

x is extremal: for every z∈M with z<x, f(z)≤x (Extremal element and its cut (Bourbaki–Witt)).

[L1]

For every z∈M, either z≤x or f(x)≤z (Everything in M is comparable to an extremal element).

[L2]

M is closed under f (A smallest admissible set exists).

[L3]

f is progressive: z≤f(z) for every z∈P (Chain-complete poset).

[L4]

≤ is a partial order: it is reflexive (u≤u), transitive (u≤v and v≤w imply u≤w) and antisymmetric (u≤v and v≤u imply u=v), and its strict form u<v means u≤v together with u≠v (Partial order and partially ordered set).

Proof

technique · cases
1.1

f(x)∈M because M is closed under f, so it makes sense to ask whether f(x) is extremal.

L2
1.2

It suffices to show f(y)≤f(x) for the given y∈M with y<f(x), since that is exactly the defining condition.

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

Comparability at the extremal x gives y≤x or f(x)≤y.

L1
1.4

Suppose y<x.

assume-case strict
1.5

Suppose y=x.

assume-case equal
2.1

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

step 1.3step 1.2L4
2.2

In the case y<x, extremality of x gives f(y)≤x, and progressivity gives x≤f(x), so f(y)≤f(x) by transitivity.

step 1.4A1L3L4
2.3

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

step 1.5L4
3.1

The relation y≤x holds exactly when y<x or y=x, by the definition of the strict order, so the two cases are exhaustive and f(y)≤f(x) in both; therefore 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 M sitting strictly between x and f(x), and such an element would break extremality of f(x) immediately.
  • Extremality is not a monotonicity condition in disguise. Nothing here assumes f preserves order, and the proof never compares f of two different elements except through x itself.

Depends on

Used by

Dependency tree · two levels

10 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