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 rational cuts embed densely in R, preserving sums, products, 0, 1 and the order

Statement

The rational embedding q↦q∗, where q∗={ r∈Q:r<q } (The real numbers R as Dedekind cuts), is injective and order-preserving-and-reflecting, p<q  ⟺  p∗⊊q∗, and a ring embedding: (p+q)∗=p∗+q∗, (pq)∗=p∗⋅q∗, 0↦0∗, 1↦1∗. Moreover its image is dense: for cuts A<B there is a rational q with A<q∗<B.

Facts & Assumptions

Given: Rationals p,q, the embedding q↦q∗={ r∈Q:r<q }, and cuts A,B (The real numbers R as Dedekind cuts).

[L1]

Cut structure: downward closure (p∈A, q<p⇒q∈A), the separation property (a∈A, b∉A⇒a<b), and the absence of a greatest element (Dedekind cut), holding of every element of R (The real numbers R as Dedekind cuts).

[L2]

Order is inclusion: A<B means A⊊B (Order on the Dedekind reals).

[L3]

Trichotomy, transitivity, and irreflexivity of the rational order (The rationals form a totally ordered field).

[L4]

Cut addition is the rational sumset A+B={ a+b:a∈A, b∈B }, the additive inverse is −A={ p∈Q:∃ r>0, −p−r∉A }, and 0∗={ q∈Q:q<0 } is the additive identity of the embedding (Addition, negation, and subtraction of Dedekind cuts).

[L5]

Cut multiplication: for A,B>0∗, A⋅B={ q≤0 }∪{ ab:a∈A, b∈B, a>0, b>0 }; the sign rules A⋅B=0∗ when A or B is 0∗, A⋅B=∣A∣ ∣B∣ for equal signs and A⋅B=−(∣A∣ ∣B∣) for opposite signs; and ∣A∣=A for A≥0∗ else ∣A∣=−A, with 1∗={ r<1 } the multiplicative identity (Multiplication and reciprocals of Dedekind cuts).

[L6]

Q is a field: rational addition and multiplication are commutative and associative, multiplication distributes over addition, and every nonzero rational is invertible (The rationals form a field); its order is total, x≤y implies x+z≤y+z, and 0<x, 0<y imply 0<xy (The rationals form a totally ordered field). Consequently multiplying a<b by a positive preserves the order, and every pair r<s has the strict midpoint r<(r+s)/2<s, since 2=1+1>0 is invertible and 2r<r+s<2s.

Proof

technique · direct
1.1

Order preservation: if p<q then p∗⊊q∗. For r∈p∗ we have r<p<q, so r∈q∗, giving p∗⊆q∗; and p∈q∗ while p∉p∗, so the inclusion is proper.

L3
1.2

Order reflection: if p∗⊊q∗ then p<q. Pick r∈q∗∖p∗; then r<q and ¬(r<p), so p≤r<q, whence p<q.

L3
1.3

Unit identities: 0↦0∗ and 1↦1∗ hold because 0∗={ r<0 } and 1∗={ r<1 } are exactly the cuts named by the embedding at 0 and 1 and fixed as the additive and multiplicative identities.

L4L5
1.4

Additive identity, inclusion p∗+q∗⊆(p+q)∗: a typical element is a+b with a<p and b<q, and order compatibility of rational addition gives a+b<p+q, so a+b∈(p+q)∗.

L4L6
1.5

Additive identity, inclusion (p+q)∗⊆p∗+q∗: given r<p+q set d=(p+q−r)/2>0, a=p−d, b=q−d; then a<p, b<q, and a+b=(p+q)−2d=r, so r=a+b∈p∗+q∗.

L4L6
1.6

Nonnegative product, inclusion p∗⋅q∗⊆(pq)∗ for p,q>0: an element is either ≤0, hence in (pq)∗ since pq>0, or ab with 0<a<p and 0<b<q, and then ab<pb<pq, so ab∈(pq)∗.

L5L6
1.7

Nonnegative product, inclusion (pq)∗⊆p∗⋅q∗ for p,q>0: take r<pq; if r≤0 it lies in the { q≤0 } clause, and if r>0 then r/q<p, so the strict midpoint a=(r/q+p)/2 satisfies r/q<a<p, and b=r/a gives 0<a<p and 0<b<q (as a>r/q>0 yields b=r/a<q), with ab=r∈p∗⋅q∗.

L5L6choose
1.8

Density setup: let A<B, i.e. A⊊B; choose x∈B∖A, and since B has no greatest element choose y∈B with y>x.

L1L2choose
1.9

Negation identity −(p∗)=(−p)∗: by the negation definition −(p∗)={ r:∃ t>0, −r−t∉p∗ }={ r:∃ t>0, −r−t≥p }={ r:∃ t>0, r≤−p−t }={ r:r<−p }=(−p)∗, where −r−t∉p∗ gives −r−t≥p by trichotomy and t=−p−r>0 witnesses the last equality.

L4L3L6
2.1

Additive identity: combining the two inclusions, (p+q)∗=p∗+q∗.

step 1.4step 1.5
2.2

Nonnegative multiplicative identity: for p,q>0 the two inclusions give (pq)∗=p∗⋅q∗, while if p=0 or q=0 then pq=0 and the sign rule 0∗⋅B=0∗ gives (pq)∗=0∗=p∗⋅q∗; hence (pq)∗=p∗⋅q∗ for all p,q≥0.

step 1.6step 1.7L5
2.3

Injectivity: if p∗=q∗ then neither p∗⊊q∗ nor q∗⊊p∗, so by reflection ¬(p<q) and ¬(q<p); trichotomy forces p=q.

step 1.2L3
2.4

Combining preservation and reflection, p<q  ⟺  p∗⊊q∗, that is p<q  ⟺  p∗<q∗: the embedding preserves and reflects order.

step 1.1step 1.2L2
2.5

A<y∗: for a∈A, separation gives a<x (as x∉A) and x<y, so a<y and a∈y∗, whence A⊆y∗; and x∈y∗ (since x<y) while x∉A, so the inclusion is proper, A⊊y∗.

step 1.8L1L2L3
2.6

y∗<B: for r∈y∗, r<y and y∈B, so downward closure gives r∈B, whence y∗⊆B; and y∈B while y∉y∗, so y∗⊊B.

step 1.8L1L2
2.7

Absolute value identity ∣p∗∣=∣p∣∗: since 0∗⊆p∗  ⟺   every r<0 satisfies r<p  ⟺  p≥0, we have p≥0  ⟺  p∗≥0∗; if p≥0 then ∣p∗∣=p∗=∣p∣∗, while if p<0 then p∗<0∗, so ∣p∗∣=−(p∗)=(−p)∗=∣p∣∗ using −(p∗)=(−p)∗ and ∣p∣=−p.

step 1.9L2L3L5
3.1

Multiplicative identity for all signs: the sign rules give p∗⋅q∗=±(∣p∗∣⋅∣q∗∣), and ∣p∗∣⋅∣q∗∣=∣p∣∗⋅∣q∣∗=(∣p∣ ∣q∣)∗ by the absolute-value identity and the nonnegative case; when p,q share a sign pq≥0 and ∣p∣ ∣q∣=pq, so p∗⋅q∗=(pq)∗, and when they have opposite signs pq<0, ∣p∣ ∣q∣=−pq, and −((−pq)∗)=(pq)∗ by the negation identity, so again p∗⋅q∗=(pq)∗ (the p=0 or q=0 case being step 2.2); hence (pq)∗=p∗⋅q∗ for all p,q.

step 2.2step 2.7step 1.9L5
4.1

Taking q=y yields A<q∗<B, so the image is dense; with injectivity, order preservation/reflection, and the ring identities (p+q)∗=p∗+q∗, (pq)∗=p∗⋅q∗, 0↦0∗, 1↦1∗, the map q↦q∗ is a dense, order-preserving ring embedding of Q into R. Closure of the image under reciprocals, which a subfield would also require, is not established here.

step 2.1step 3.1step 1.3step 2.3step 2.4step 2.5step 2.6∎

Depends on

Used by

Dependency tree · two levels

14 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