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 rationals embed densely in the reals

Statement

The map q↦q^ (The real numbers) is an embedding of ordered fields. Every real is approximated by rationals: for x∈R and rational ε>0 there is q∈Q with ∣x−q^∣<ε^. Consequently, strictly between any two reals lies a rational.

Facts & Assumptions

Given: A real x=[(an)] and a rational ε>0.

[L1]

The orders of Q and R; ordered-field arithmetic (The rationals form a totally ordered field, The reals form a totally ordered field).

[L2]

Field arithmetic in Q: ε/2,δ/4 are positive rationals, and every nonzero rational q has a reciprocal 1/q with q⋅(1/q)=1 (The rationals form a field).

[L3]

Cauchy definition (Cauchy sequence of rationals).

[L4]

Real positivity via eventual rational lower bounds (Order on the reals).

[L5]

R=C/N is a field (The reals form a field), and 0R=0^, 1R=1^ are the classes of the constant sequences (The real numbers). A multiplicative inverse there is unique: if ab=1R=ac then b=b(ac)=(ba)c=c.

Proof

technique · direct
1.1

Embedding: constant sequences are Cauchy; q^=r^ iff the constant q−r is null iff q=r; operations match termwise; and q<r gives the constant lower bound r−q>0, so q^<r^ and order is preserved and reflected.

L1L4
1.2

Fix N with ∣am−an∣<ε/2 for all m,n≥N, and set q=aN.

L3L2
2.1

The difference q^−x has representative (aN−an) with ∣aN−an∣<ε/2 for n≥N; hence both ε^−(x−q^) and ε^−(q^−x) have representatives eventually >ε/2, so both are positive: ∣x−q^∣<ε^.

step 1.2L4L1
2.2

Inverses: let q be a nonzero rational. Then q^≠0^=0R by the injectivity of step 1.1, and 1/q exists in Q by [L2]; since the operations match termwise (step 1.1), q^⋅1/q^=q⋅(1/q)^=1^=1R. Inverses in R are unique by [L5], so (q^)−1=1/q^: the embedding preserves reciprocals.

step 1.1L2L5
3.1

Density: let x<y; pick δ>0 rational and N with the representative of y−x eventually >δ; set ε=δ/4 and pick q with ∣x−q^∣<ε^; then q′=q+2ε satisfies q^′−x≥−ε^+2ε^=ε^>0 and y−q^′≥δ^−ε^−2ε^=δ^/4>0, so x<q^′<y.

step 2.1L4L1L2
4.1

The rationals embed as an ordered subfield — injectively, preserving the order in both directions, the ring operations, and reciprocals — and they approximate every real arbitrarily well and separate any two reals.

step 1.1step 2.2step 3.1∎

Depends on

Used by

…and 133 more results.

Dependency tree · two levels

20 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