LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 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.

Rigidity of well-orders

Statement

Let $(W, <)$ be a well-order (Well-order and well-ordered set) and let $f : W \to W$ be strictly increasing, that is $x < y \Rightarrow f (x) < f (y)$ . Then:

(a) $a \leq f (a)$ for every $a \in W$ ;

(b) $W$ is not order isomorphic (Order embedding and order isomorphism) to any proper initial segment $W_{< a}$ of itself (Initial segment of a well-order);

(c) the identity is the only order isomorphism $W \to W$ ;

(d) for any two well-orders $V$ and $W$ there is at most one order isomorphism $V \to W$ .

This is a theorem of ZF; no choice principle is used.

Facts & Assumptions

Given: A well-order $(W, <)$ and a strictly increasing function $f : W \to W$ . The well-order $(W, <)$ and the map $f$ are arbitrary, so once claim (a) is proved it may be applied to any well-order and any strictly increasing self-map of it.

[A1]

$x < y$ implies $f (x) < f (y)$ , for all $x, y \in W$ .

[L1]

Every nonempty subset of $W$ has a least element, and the order is total, so failure of $f (a) < a$ is exactly $a \leq f (a)$ (Well-order and well-ordered set).

[L2]

$W_{< a} = {x \in W : x < a}$ is a proper initial segment of $W$ and is itself a well-order (Initial segment of a well-order).

[L3]

An order isomorphism between total orders is a strictly increasing bijection, its inverse is one, composites of order isomorphisms are order isomorphisms, and an order isomorphism carries the initial segment below $x$ onto the initial segment below its image (Order embedding and order isomorphism).

Proof

technique · contradiction

1.1

Let $A = {a \in W : f (a) < a}$ and suppose, for contradiction, that $A \neq \emptyset$ .

constructassume-contra

2.1

Being a nonempty subset of $W$ , the set $A$ has a least element $m$ , and $f (m) < m$ by the definition of $A$ .

step 1.1L1choose

3.1

Applying [A1] to $f (m) < m$ gives $f (f (m)) < f (m)$ , so $f (m)$ itself lies in $A$ .

step 2.1A1

4.1

Thus $f (m) \in A$ and $f (m) < m$ , contradicting the minimality of $m$ in $A$ ; so $A = \emptyset$ , and by totality $a \leq f (a)$ for every $a \in W$ , which is claim (a).

step 3.1step 2.1L1

5.1

Claim (b) follows: if $g : W \to W_{< a}$ were an order isomorphism for some $a \in W$ , then $g$ followed by the inclusion of $W_{< a}$ into $W$ would be a strictly increasing map $W \to W$ , so claim (a) would give $a \leq g (a)$ , while $g (a) \in W_{< a}$ says $g (a) < a$ , and trichotomy forbids both.

step 4.1L2L3

5.2

Claim (c) follows: an order isomorphism $f : W \to W$ is strictly increasing and so is its inverse, so claim (a) gives $a \leq f (a)$ and $a \leq f^{- 1} (a)$ for every $a$ ; applying $f$ to the second inequality gives $f (a) \leq a$ , and antisymmetry yields $f (a) = a$ .

step 4.1L3L1

6.1

Claim (d) follows: if $g, h : V \to W$ are order isomorphisms then $h^{- 1} \circ g$ is an order isomorphism of the well-order $V$ onto itself, hence the identity by claim (c), so $g = h$ .

step 5.2L3

7.1

The supposition of step 1.1 is therefore refuted, claim (a) holds, and claims (b), (c) and (d) were derived from it in steps 5.1, 5.2 and 6.1; the lemma holds in full.

step 4.1step 5.1step 5.2step 6.1discharge-contradiction∎

Remarks

Transfinite induction in disguise. Steps 1.1 to 4.1 are exactly the proof of Transfinite induction specialised to the set $S = {a \in W : a \leq f (a)}$ : if $x \leq f (x)$ for all $x < a$ then $a \leq f (a)$ , because $f (a) < a$ would put $f (a)$ below $a$ with $f (f (a)) < f (a)$ . The argument can therefore be run by citing that theorem instead of taking a least element by hand, and nothing changes.

Rigidity is what makes order types well defined. Claim (d) says a well-order has no room for a nontrivial symmetry, so "the" isomorphism between two isomorphic well-orders is unique and can be spoken of without choosing anything. That is precisely why no choice principle appears anywhere in the comparison of well-orders (Comparability of well-orders) or in the assignment of order types (Every well-order has a unique order type).

Totality is essential. For a general poset every claim here fails. On the poset ${a, b}$ with $a$ and $b$ incomparable, the swap $a \mapsto b$ , $b \mapsto a$ is a nonidentity order automorphism, and the strictly increasing condition is vacuous. It is the least element property, used once in step 2.1, that removes this freedom.

Only one direction is available. Claim (a) says $f$ never moves a point strictly down, and no bound in the other direction holds: on $(N, \leq)$ the map $n \mapsto 2 n$ is strictly increasing and moves every nonzero point strictly up, as far up as one likes.

Depends on

Used by

Comparability of well-orders Lemma
Every well-order has a unique order type Theorem

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

Well-order (Wikipedia) (standard reference, not scraped)
Order isomorphism (Wikipedia) (standard reference, not scraped)
A. Marks, Set Theory (standard reference, not scraped)