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.

An ordered field with the least-upper-bound property has the nested interval property and is Archimedean

Statement

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

  1. FF is Archimedean (Archimedean ordered field);
  2. FF has the nested interval property (NIP).

The intersection point produced in claim 2 is the supremum of the left endpoints, and the proof does not use the hypothesis that the lengths tend to 00: an ordered field with (LUB) satisfies the unrestricted nested interval property, of which (NIP) as defined is a special case.

Facts & Assumptions

Given: An ordered field FF with the least-upper-bound property, and a nested sequence (Ik)kN(I_k)_{k \in \mathbb{N}} of closed intervals Ik=[ak,bk]FI_k = [a_k, b_k]_F of FF, so that akbka_k \le b_k for every kk and Ik+1IkI_{k+1} \subseteq I_k for every kk.

[L1]

Least upper bounds: every nonempty SFS \subseteq F bounded above has a least upper bound supSF\sup S \in F; a least upper bound is an upper bound and is \le every upper bound (Complete ordered field (least-upper-bound property), Upper bound, least upper bound, and strict upper bound).

[L2]

Every complete ordered field is Archimedean (Every complete ordered field is Archimedean).

[L3]

The properties (LUB), (NIP) and the Archimedean property, as fixed in The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness and Archimedean ordered field; (LUB) for FF is by definition the statement that FF is a complete ordered field (Complete ordered field (least-upper-bound property)).

[L4]

Closed intervals and nesting in FF: [a,b]F={xF:axb}[a,b]_F = \{x \in F : a \le x \le b\} for aba \le b, and (Ik)(I_k) is nested when Ik+1IkI_{k+1} \subseteq I_k for every kk (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field).

[L5]

The order of FF is total and transitive (Ordered field).

[L6]

Induction principle on N\mathbb{N} (The principle of mathematical induction), and the order on N\mathbb{N} is total, so of any two indices one is the larger (\le is a linear order on N\mathbb{N}).

Proof

technique · direct
1.1

Having (LUB) is by definition being a complete ordered field, so FF is a complete ordered field.

L1L3
1.2

For every kk: ak+1a_{k+1} and bk+1b_{k+1} lie in Ik+1I_{k+1}, hence in IkI_k, so akak+1bk+1bka_k \le a_{k+1} \le b_{k+1} \le b_k.

L4L5
2.1

FF is Archimedean, which is claim 1.

step 1.1L2
2.2

By induction on the difference of the indices, ajama_j \le a_m and bmbjb_m \le b_j whenever jmj \le m.

step 1.2L5L6
3.1

For all j,lNj, l \in \mathbb{N} one has ajbla_j \le b_l: letting mm be the larger of jj and ll, ajambmbla_j \le a_m \le b_m \le b_l.

step 1.2step 2.2L5L6
4.1

The set A:={ak:kN}A := \{\, a_k : k \in \mathbb{N} \,\} is nonempty and is bounded above by b0b_0, so c:=supAc := \sup A exists in FF.

step 3.1L1
5.1

For every kk: akca_k \le c because cc is an upper bound of AA; and cbkc \le b_k because bkb_k is an upper bound of AA by step 3.1 while cc is the least such.

step 3.1step 4.1L1
6.1

So c[ak,bk]Fc \in [a_k, b_k]_F for every kk, the intersection of the IkI_k is nonempty, and FF has (NIP), which with step 2.1 gives both claims.

step 2.1step 5.1L3L4

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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