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.

Bolzano-Weierstrass alone forces the Archimedean property, so it needs no separate Archimedean hypothesis

Statement

Let FF be an ordered field with the Bolzano-Weierstrass property (BW) 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).

Consequently (BW) needs no Archimedean hypothesis attached to it, in contrast with the nested interval property and with Cauchy completeness, which do (FALSE: the nested interval property alone implies the least-upper-bound property, FALSE: an ordered field in which every Cauchy sequence converges has the least-upper-bound property).

Facts & Assumptions

Given: An ordered field FF with (BW).

[L2]

Sequences in an ordered field: a sequence is a function NF\mathbb{N} \to F; it is bounded when xkM|x_k| \le M for every kk and some MFM \in F; a subsequence is taken along a strictly increasing n:NNn : \mathbb{N} \to \mathbb{N}; 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 number 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, the map nn1Fn \mapsto n \cdot 1_F is strictly increasing on {1,2,3,}\{1,2,3,\dots\}, and (m+n)1F=m1F+n1F(m+n)\cdot 1_F = m \cdot 1_F + n \cdot 1_F (Canonical naturals are positive and strictly increasing).

[L5]

Absolute value: u=u|u| = u whenever u0u \ge 0 (Basic properties of the absolute value).

[L7]

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). 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).

[L8]

Discreteness of N\mathbb{N}: m<pm < p if and only if m+1pm + 1 \le p (Discreteness: σ(n)\sigma(n) is the immediate successor).

Proof

technique · contradiction
1.1

Suppose FF has (BW) and is not Archimedean; then there is xFx \in F such that x<n1Fx < n \cdot 1_F fails for every natural nn, that is, n1Fxn \cdot 1_F \le x for every nNn \in \mathbb{N}.

L3L7assume-contra
1.2

Let (yk)(y_k) be the sequence in FF given by yk:=k1Fy_k := k \cdot 1_F, so that y0=0y_0 = 0, yk+1=yk+1Fy_{k+1} = y_k + 1_F, and yk0y_k \ge 0 for every kk.

L2L3L4
2.1

(yk)(y_k) is bounded: yk=ykx|y_k| = y_k \le x for every kk.

step 1.1step 1.2L2L5
3.1

By (BW) there is a strictly increasing n:NNn : \mathbb{N} \to \mathbb{N} and an LFL \in F with ynjLy_{n_j} \to L in FF.

step 2.1L1L2
4.1

The subsequence (ynj)(y_{n_j}) is therefore Cauchy in FF, so, 1F1_F being positive, there is JNJ \in \mathbb{N} with ynjyni<1F|y_{n_j} - y_{n_i}| < 1_F for all i,jJi, j \ge J.

step 3.1L2L6L7
5.1

But nJ<nJ+1n_J < n_{J+1} gives nJ+1nJ+1n_J + 1 \le n_{J+1} and hence ynJ+1ynJ+1=ynJ+1Fy_{n_{J+1}} \ge y_{n_J + 1} = y_{n_J} + 1_F, so ynJ+1ynJ1F>0y_{n_{J+1}} - y_{n_J} \ge 1_F > 0 and ynJ+1ynJ1F|y_{n_{J+1}} - y_{n_J}| \ge 1_F, contradicting step 4.1.

step 1.2step 4.1L4L5L7L8
6.1

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

step 5.1discharge-contradiction

Remarks

  • The witness sequence is the obstruction itself. In a non-Archimedean field the canonical naturals are bounded, so they form a bounded sequence; and no subsequence of them can converge, because consecutive terms of any subsequence stay at distance at least 1F1_F. That is the whole argument, and it shows that (BW) fails in every non-Archimedean ordered field, for instance in R(t)\mathbb{R}(t) (Not every ordered field is Archimedean) and in R((t1))\mathbb{R}((t^{-1})) (R((t1))\mathbb{R}((t^{-1})) is non-Archimedean, and the monomials tkt^{-k} are cofinal below its positive elements).

  • Note which direction is being used: the sequence is bounded and has no convergent subsequence, so (BW) is contradicted. Nothing here says that (yk)(y_k) fails to be Cauchy for some other reason; it is Cauchy along no subsequence at all.

Depends on

Used by

Dependency tree · next 3 levels

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