Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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.

Equivalence of the Cauchy and Dedekind constructions of R

Statement

The Cauchy-sequence reals RC and the Dedekind-cut reals RD are isomorphic as ordered fields via a unique isomorphism φ:RC→RD that preserves all arithmetic (+, ⋅, 0, 1, inverses) and the order (<, hence ≤, ∣⋅∣, and suprema), and restricts to the identity on the common rationals Q. This is the precise sense in which the two constructions build the same R.

Facts & Assumptions

Given: The Cauchy-sequence reals RC and the Dedekind-cut reals RD.

[L1]

RC is a totally ordered field (The reals form a totally ordered field).

[L3]

RD is a totally ordered field (The Dedekind reals form a totally ordered field).

[L4]
[L5]

Any two complete ordered fields are isomorphic via a unique ordered-field isomorphism, which fixes Q (Uniqueness of the complete ordered field: R up to a unique isomorphism).

Proof

technique · direct
1.1

RC is a complete ordered field: a totally ordered field ([L1]) with the least-upper-bound property ([L2]).

L1L2
1.2

RD is a complete ordered field: a totally ordered field ([L3]) with the least-upper-bound property ([L4]).

L3L4
2.1

By [L5] applied to F=RC and G=RD there is a unique ordered-field isomorphism φ:RC→RD, and it fixes the common rationals Q.

step 1.1step 1.2L5
3.1

As a field isomorphism φ preserves +, ⋅, 0, 1 and inverses; as an ordered-field isomorphism it satisfies x<y  ⟺  φx<φy, hence preserves ≤ and ∣⋅∣; and it preserves suprema, in the sense that for any nonempty S⊆RC bounded above with s=sup⁡S, its image φ[S]={φ(t):t∈S} has φ(s)=sup⁡φ[S], since φ(s) is an upper bound of φ[S] and, φ−1 being order-preserving, every upper bound of φ[S] is ≥φ(s).

step 2.1L5
4.1

Therefore RC and RD are the same complete ordered field presented two ways, joined by the unique isomorphism φ that restricts to the identity on Q and preserves all arithmetic and order: the Cauchy and Dedekind constructions give the same R.

step 2.1step 3.1L5∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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