Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-02 (claude-opus-5)
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 Dedekind reals are Archimedean

Statement

R (Dedekind cuts) is Archimedean: for every cut A there is a natural number n with A<n∗. Equivalently, the rational cuts (n∗)n∈N are cofinal in R: no single cut is an upper bound for all of them.

Facts & Assumptions

Given: A cut A.

[L1]

A cut is a proper subset of Q (A≠Q), and a∈A, b∉A⇒a<b (Dedekind cut); the elements of R are exactly these cuts (The real numbers R as Dedekind cuts).

[L2]

Rational Archimedean property: for every q∈Q there is a natural number n with n>q (The rationals are Archimedean).

[L3]

The embedding preserves order: p<q⇒p∗⊊q∗, i.e. p∗<q∗ (The rational cuts embed densely in R, preserving sums, products, 0, 1 and the order).

[L4]

Inclusion order, and transitivity of < in the totally ordered field (Order on the Dedekind reals, The Dedekind reals form a totally ordered field).

Proof

technique · direct
1.1

Since A≠Q, choose a rational q∉A.

L1choose
1.2

By the rational Archimedean property, choose a natural number n with n>q.

L2choose
2.1

A⊆q∗: for a∈A, the separation property gives a<q (as q∉A), so a∈q∗.

step 1.1L1
2.2

q∗<n∗: from q<n and order preservation, q∗⊊n∗.

step 1.2L3
3.1

Hence A⊆q∗⊊n∗, so A<n∗: the rational cuts are cofinal and R is Archimedean.

step 2.1step 2.2L4∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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