Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 monotone convergence property alone forces the Archimedean property, so it carries no separate Archimedean hypothesis

Statement

Let FF be an ordered field with the monotone convergence property (MCT) of The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness. Then FF is Archimedean (Archimedean ordered field).

So (MCT), like (BW) and like (LUB), carries the Archimedean property on its own, and the hypothesis attached to (CC) in Cauchy completeness plus the Archimedean property imply the monotone convergence property need not be attached here. This is what lets Which of the five completeness properties carry the Archimedean property on their own, and which must be handed it sort the five properties into those that do and those that do not.

Facts & Assumptions

Given: An ordered field FF with (MCT).

[L2]

Sequences in an ordered field: a sequence is a function NF\mathbb{N} \to F; it is nondecreasing when xjxkx_j \le x_k for all jkj \le k; convergence and Cauchyness in FF are as fixed there (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field).

[L3]

Archimedean property: FF is Archimedean when for every xFx \in F there is a natural nn with x<n1Fx < n \cdot 1_F, where 01F=00 \cdot 1_F = 0 and (n+1)1F=n1F+1F(n+1)\cdot 1_F = n \cdot 1_F + 1_F (Archimedean ordered field).

[L4]

Canonical naturals: n1F>0n \cdot 1_F > 0 for n1n \ge 1 and nn1Fn \mapsto n \cdot 1_F is strictly increasing on {1,2,3,}\{1,2,3,\dots\} (Canonical naturals are positive and strictly increasing).

[L6]

Order arithmetic: 0<1F0 < 1_F (The multiplicative identity is positive); the order is total, so the failure of x<yx < y is yxy \le x; adding a constant preserves the order (Order is preserved by adding a constant and by adding inequalities, Ordered field); and u=u|u| = u whenever u0u \ge 0 (Basic properties of the absolute value). Here Order is preserved by adding a constant and by adding inequalities states the STRICT forms and only those; the nonstrict forms used below are those together with the equality cases, which trichotomy settles, the order being total (Ordered field).

Proof

technique · contradiction
1.1

Suppose FF has (MCT) and is not Archimedean; then there is xFx \in F with n1Fxn \cdot 1_F \le x for every nNn \in \mathbb{N}.

L3L6assume-contra
1.2

Let (yk)(y_k) be the sequence yk:=k1Fy_k := k \cdot 1_F in FF, so y0=0y_0 = 0 and yk+1=yk+1Fy_{k+1} = y_k + 1_F; it is nondecreasing, since 0=y0<yn0 = y_0 < y_n for n1n \ge 1 and jj1Fj \mapsto j \cdot 1_F is strictly increasing on the positive naturals.

L2L3L4
2.1

(yk)(y_k) is bounded above by xx, so (MCT) makes it converge in FF to some LL.

step 1.1step 1.2L1L2
3.1

Being convergent, (yk)(y_k) is Cauchy in FF, so, 1F1_F being positive, there is NNN \in \mathbb{N} with ykyl<1F|y_k - y_l| < 1_F for all k,lNk, l \ge N.

step 2.1L2L5L6
4.1

But yN+1yN=1F>0y_{N+1} - y_N = 1_F > 0, so yN+1yN=1F|y_{N+1} - y_N| = 1_F, which is not <1F< 1_F; this contradicts step 3.1.

step 1.2step 3.1L6
5.1

The assumption of step 1.1 is therefore untenable, and an ordered field with (MCT) is Archimedean.

step 4.1discharge-contradiction

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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