Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

For an ordered field the five completeness properties are equivalent, provided the Archimedean property is assumed alongside nested intervals and Cauchy completeness

Statement

Let FF be an ordered field, with the five properties (LUB), (MCT), (NIP), (BW), (CC) and the Archimedean property (ARCH) as 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. The following five statements about FF are equivalent:

  1. (LUB);
  2. (ARCH) and (NIP);
  3. (BW);
  4. (ARCH) and (CC);
  5. (MCT).

Moreover each of (LUB), (BW) and (MCT) implies (ARCH) on its own, so in statements 1, 3 and 5 the Archimedean property is a consequence rather than a hypothesis.

The Archimedean hypothesis in statements 2 and 4 may not be dropped. It is not an artefact of the proof: the nested interval property without it does not imply (LUB) (FALSE: the nested interval property alone implies the least-upper-bound property), and neither does Cauchy completeness without it (FALSE: an ordered field in which every Cauchy sequence converges has the least-upper-bound property). Both are refuted by the same witness, the formal Laurent series field R((t1))\mathbb{R}((t^{-1})).

The equivalence is proved as a single cycle 1234511 \Rightarrow 2 \Rightarrow 3 \Rightarrow 4 \Rightarrow 5 \Rightarrow 1, each arrow being one lemma of this page.

Facts & Assumptions

Proof

technique · direct
1.1

Statement 1 implies statement 2: (LUB) gives both (ARCH) and (NIP).

L1
1.2

Statement 2 implies statement 3: (ARCH) with (NIP) gives (BW).

L2
1.3

Statement 3 implies statement 4: (BW) gives (ARCH), and (BW) gives (CC), so it gives their conjunction.

L3L4
1.4

Statement 4 implies statement 5: (ARCH) with (CC) gives (MCT).

L5
1.5

Statement 5 implies statement 1: (MCT) gives (ARCH) by [L6], and (ARCH) with (MCT) gives (LUB) by [L7].

L6L7
2.1

Steps 1.1 to 1.5 form a cycle passing through all five statements, so for any two of them there is a chain of implications from the first to the second; the five are therefore equivalent.

step 1.1step 1.2step 1.3step 1.4step 1.5
2.2

Each of (LUB), (BW) and (MCT) implies (ARCH): the first by [L1], the second by [L3], the third by [L6].

step 1.1step 1.3step 1.5L1L3L6
3.1

Both assertions of the statement are established, by steps 2.1 and 2.2.

step 2.1step 2.2

Remarks

  • What the cycle costs. Seven lemmas suffice for the whole equivalence, because a single cycle through all five statements yields every implication between them, and the arrangement is chosen so that no lemma has to carry an Archimedean hypothesis it cannot discharge. Statement 3 is deliberately the hinge: (BW) is the one property that both implies (ARCH) and is implied by a nested interval argument, so the cycle can enter and leave it without an extra hypothesis.

  • Read as a statement about R\mathbb{R}, the theorem says that the five familiar theorems of a first analysis course are not five theorems but one, and that the least-upper-bound axiom could have been replaced by any of the other four (with (ARCH) alongside, where required). This library takes (LUB) as the axiom (Complete ordered field (least-upper-bound property)) and proves the others from it on earlier pages; nothing here re-proves them for R\mathbb{R}, and nothing here may be cited as a proof about R\mathbb{R} that is not already there.

  • The two failures are genuinely different from the three successes. (NIP) and (CC) are both statements about sequences whose data are already close together, and neither of them ever produces a new element far away; that is why an infinitesimal layer can be added to a field without disturbing them, and why the naturals can stay bounded. (LUB), (BW) and (MCT) each quantify over an object that is only assumed bounded, so each of them can be tested against the canonical naturals themselves, and each fails at once when those are bounded. Which of the five completeness properties carry the Archimedean property on their own, and which must be handed it develops this.

Depends on

Used by

Dependency tree · next 3 levels

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