Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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.

Every complete ordered field is Archimedean

Statement

Every complete ordered field F (Complete ordered field (least-upper-bound property)) is Archimedean: for every x∈F there is a natural number n≥1 with x<n⋅1F, where n⋅1F is the canonical natural of the ordered field F (Ordered field). Equivalently, the canonical naturals are cofinal in F.

Facts & Assumptions

Given: A complete ordered field F; write A={ n⋅1F:n≥1 } for the set of its canonical naturals.

[L1]

Least-upper-bound property: every nonempty S⊆F that is bounded above has a least upper bound sup⁡S∈F (Complete ordered field (least-upper-bound property)).

[L2]

Each canonical natural satisfies n⋅1F>0, one has (n+1)⋅1F=n⋅1F+1F, and (n+1)⋅1F>n⋅1F (Canonical naturals are positive and strictly increasing).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that F is not Archimedean: there is some x∈F with n⋅1F≤x for all n≥1, that is, x is an upper bound of A.

assume-contra
2.1

The set A is nonempty, since 1⋅1F=1F∈A, and it is bounded above by x.

step 1.1L2
3.1

By the least-upper-bound property, A has a least upper bound s=sup⁡A∈F.

step 2.1L1
4.1

Since 1F>0, we have s−1F<s; as s is the least upper bound, s−1F is not an upper bound of A.

step 3.1L3
5.1

Hence there is some m≥1 with m⋅1F>s−1F.

step 4.1
6.1

Adding 1F to both sides, (m+1)⋅1F=m⋅1F+1F>s.

step 5.1L2
7.1

But (m+1)⋅1F∈A, so (m+1)⋅1F≤s because s is an upper bound of A, contradicting 6.1.

step 6.1step 3.1L2
8.1

The assumption is therefore untenable, so F is Archimedean.

step 7.1discharge-contradiction∎

Depends on

Used by

…and 152 more results.

Dependency tree · two levels

11 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