Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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\mathbb{R}, preserving sums, products, 00, 11 and the order

Statement

The rational embedding qqq \mapsto q^{*}, where q={rQ:r<q}q^{*} = \{\, r \in \mathbb{Q} : r < q \,\} (The real numbers R\mathbb{R} as Dedekind cuts), is injective and order-preserving-and-reflecting, p<q    pqp < q \iff p^{*} \subsetneq q^{*}, and a ring embedding: (p+q)=p+q(p+q)^{*} = p^{*} + q^{*}, (pq)=pq(pq)^{*} = p^{*} \cdot q^{*}, 000 \mapsto 0^{*}, 111 \mapsto 1^{*}. Moreover its image is dense: for cuts A<BA < B there is a rational qq with A<q<BA < q^{*} < B.

Facts & Assumptions

Given: Rationals p,qp, q, the embedding qq={rQ:r<q}q \mapsto q^{*} = \{\, r \in \mathbb{Q} : r < q \,\}, and cuts A,BA, B (The real numbers R\mathbb{R} as Dedekind cuts).

[L1]

Cut structure: downward closure (pAp \in A, q<pqAq < p \Rightarrow q \in A), the separation property (aAa \in A, bAa<bb \notin A \Rightarrow a < b), and the absence of a greatest element (Dedekind cut), holding of every element of R\mathbb{R} (The real numbers R\mathbb{R} as Dedekind cuts).

[L2]

Order is inclusion: A<BA < B means ABA \subsetneq 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:aA, bB}A + B = \{\, a + b : a \in A,\ b \in B \,\}, the additive inverse is A={pQ:r>0, prA}-A = \{\, p \in \mathbb{Q} : \exists\, r > 0,\ -p - r \notin A \,\}, and 0={qQ:q<0}0^{*} = \{\, q \in \mathbb{Q} : q < 0 \,\} is the additive identity of the embedding (Addition, negation, and subtraction of Dedekind cuts).

[L5]

Cut multiplication: for A,B>0A, B > 0^{*}, AB={q0}{ab:aA, bB, a>0, b>0}A \cdot B = \{\, q \le 0 \,\} \cup \{\, ab : a \in A,\ b \in B,\ a > 0,\ b > 0 \,\}; the sign rules AB=0A \cdot B = 0^{*} when AA or BB is 00^{*}, AB=ABA \cdot B = |A|\,|B| for equal signs and AB=(AB)A \cdot B = -(|A|\,|B|) for opposite signs; and A=A|A| = A for A0A \ge 0^{*} else A=A|A| = -A, with 1={r<1}1^{*} = \{\, r < 1 \,\} the multiplicative identity (Multiplication and reciprocals of Dedekind cuts).

[L6]

Q\mathbb{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, xyx \le y implies x+zy+zx + z \le y + z, and 0<x0 < x, 0<y0 < y imply 0<xy0 < xy (The rationals form a totally ordered field). Consequently multiplying a<ba < b by a positive preserves the order, and every pair r<sr < s has the strict midpoint r<(r+s)/2<sr < (r+s)/2 < s, since 2=1+1>02 = 1 + 1 > 0 is invertible and 2r<r+s<2s2r < r + s < 2s.

Proof

technique · direct
1.1

Order preservation: if p<qp < q then pqp^{*} \subsetneq q^{*}. For rpr \in p^{*} we have r<p<qr < p < q, so rqr \in q^{*}, giving pqp^{*} \subseteq q^{*}; and pqp \in q^{*} while ppp \notin p^{*}, so the inclusion is proper.

L3
1.2

Order reflection: if pqp^{*} \subsetneq q^{*} then p<qp < q. Pick rqpr \in q^{*} \setminus p^{*}; then r<qr < q and ¬(r<p)\neg(r < p), so pr<qp \le r < q, whence p<qp < q.

L3
1.3

Unit identities: 000 \mapsto 0^{*} and 111 \mapsto 1^{*} hold because 0={r<0}0^{*} = \{\, r < 0 \,\} and 1={r<1}1^{*} = \{\, r < 1 \,\} are exactly the cuts named by the embedding at 00 and 11 and fixed as the additive and multiplicative identities.

L4L5
1.4

Additive identity, inclusion p+q(p+q)p^{*} + q^{*} \subseteq (p+q)^{*}: a typical element is a+ba + b with a<pa < p and b<qb < q, and order compatibility of rational addition gives a+b<p+qa + b < p + q, so a+b(p+q)a + b \in (p+q)^{*}.

L4L6
1.5

Additive identity, inclusion (p+q)p+q(p+q)^{*} \subseteq p^{*} + q^{*}: given r<p+qr < p + q set d=(p+qr)/2>0d = (p + q - r)/2 > 0, a=pda = p - d, b=qdb = q - d; then a<pa < p, b<qb < q, and a+b=(p+q)2d=ra + b = (p + q) - 2d = r, so r=a+bp+qr = a + b \in p^{*} + q^{*}.

L4L6
1.6

Nonnegative product, inclusion pq(pq)p^{*} \cdot q^{*} \subseteq (pq)^{*} for p,q>0p, q > 0: an element is either 0\le 0, hence in (pq)(pq)^{*} since pq>0pq > 0, or abab with 0<a<p0 < a < p and 0<b<q0 < b < q, and then ab<pb<pqab < pb < pq, so ab(pq)ab \in (pq)^{*}.

L5L6
1.7

Nonnegative product, inclusion (pq)pq(pq)^{*} \subseteq p^{*} \cdot q^{*} for p,q>0p, q > 0: take r<pqr < pq; if r0r \le 0 it lies in the {q0}\{\, q \le 0 \,\} clause, and if r>0r > 0 then r/q<pr/q < p, so the strict midpoint a=(r/q+p)/2a = (r/q + p)/2 satisfies r/q<a<pr/q < a < p, and b=r/ab = r/a gives 0<a<p0 < a < p and 0<b<q0 < b < q (as a>r/q>0a > r/q > 0 yields b=r/a<qb = r/a < q), with ab=rpqab = r \in p^{*} \cdot q^{*}.

L5L6choose
1.8

Density setup: let A<BA < B, i.e. ABA \subsetneq B; choose xBAx \in B \setminus A, and since BB has no greatest element choose yBy \in B with y>xy > x.

L1L2choose
1.9

Negation identity (p)=(p)-(p^{*}) = (-p)^{*}: by the negation definition (p)={r:t>0, rtp}={r:t>0, rtp}={r:t>0, rpt}={r:r<p}=(p)-(p^{*}) = \{\, r : \exists\, t > 0,\ -r - t \notin p^{*} \,\} = \{\, r : \exists\, t > 0,\ -r - t \ge p \,\} = \{\, r : \exists\, t > 0,\ r \le -p - t \,\} = \{\, r : r < -p \,\} = (-p)^{*}, where rtp-r - t \notin p^{*} gives rtp-r - t \ge p by trichotomy and t=pr>0t = -p - r > 0 witnesses the last equality.

L4L3L6
2.1

Additive identity: combining the two inclusions, (p+q)=p+q(p+q)^{*} = p^{*} + q^{*}.

step 1.4step 1.5
2.2

Nonnegative multiplicative identity: for p,q>0p, q > 0 the two inclusions give (pq)=pq(pq)^{*} = p^{*} \cdot q^{*}, while if p=0p = 0 or q=0q = 0 then pq=0pq = 0 and the sign rule 0B=00^{*} \cdot B = 0^{*} gives (pq)=0=pq(pq)^{*} = 0^{*} = p^{*} \cdot q^{*}; hence (pq)=pq(pq)^{*} = p^{*} \cdot q^{*} for all p,q0p, q \ge 0.

step 1.6step 1.7L5
2.3

Injectivity: if p=qp^{*} = q^{*} then neither pqp^{*} \subsetneq q^{*} nor qpq^{*} \subsetneq p^{*}, so by reflection ¬(p<q)\neg(p < q) and ¬(q<p)\neg(q < p); trichotomy forces p=qp = q.

step 1.2L3
2.4

Combining preservation and reflection, p<q    pqp < q \iff p^{*} \subsetneq q^{*}, that is p<q    p<qp < q \iff p^{*} < q^{*}: the embedding preserves and reflects order.

step 1.1step 1.2L2
2.5

A<yA < y^{*}: for aAa \in A, separation gives a<xa < x (as xAx \notin A) and x<yx < y, so a<ya < y and aya \in y^{*}, whence AyA \subseteq y^{*}; and xyx \in y^{*} (since x<yx < y) while xAx \notin A, so the inclusion is proper, AyA \subsetneq y^{*}.

step 1.8L1L2L3
2.6

y<By^{*} < B: for ryr \in y^{*}, r<yr < y and yBy \in B, so downward closure gives rBr \in B, whence yBy^{*} \subseteq B; and yBy \in B while yyy \notin y^{*}, so yBy^{*} \subsetneq B.

step 1.8L1L2
2.7

Absolute value identity p=p|p^{*}| = |p|^{*}: since 0p    0^{*} \subseteq p^{*} \iff every r<0r < 0 satisfies r<p    p0r < p \iff p \ge 0, we have p0    p0p \ge 0 \iff p^{*} \ge 0^{*}; if p0p \ge 0 then p=p=p|p^{*}| = p^{*} = |p|^{*}, while if p<0p < 0 then p<0p^{*} < 0^{*}, so p=(p)=(p)=p|p^{*}| = -(p^{*}) = (-p)^{*} = |p|^{*} using (p)=(p)-(p^{*}) = (-p)^{*} and p=p|p| = -p.

step 1.9L2L3L5
3.1

Multiplicative identity for all signs: the sign rules give pq=±(pq)p^{*} \cdot q^{*} = \pm(|p^{*}| \cdot |q^{*}|), and pq=pq=(pq)|p^{*}| \cdot |q^{*}| = |p|^{*} \cdot |q|^{*} = (|p|\,|q|)^{*} by the absolute-value identity and the nonnegative case; when p,qp, q share a sign pq0pq \ge 0 and pq=pq|p|\,|q| = pq, so pq=(pq)p^{*} \cdot q^{*} = (pq)^{*}, and when they have opposite signs pq<0pq < 0, pq=pq|p|\,|q| = -pq, and ((pq))=(pq)-\bigl((-pq)^{*}\bigr) = (pq)^{*} by the negation identity, so again pq=(pq)p^{*} \cdot q^{*} = (pq)^{*} (the p=0p = 0 or q=0q = 0 case being step 2.2); hence (pq)=pq(pq)^{*} = p^{*} \cdot q^{*} for all p,qp, q.

step 2.2step 2.7step 1.9L5
4.1

Taking q=yq = y yields A<q<BA < q^{*} < B, so the image is dense; with injectivity, order preservation/reflection, and the ring identities (p+q)=p+q(p+q)^{*} = p^{*} + q^{*}, (pq)=pq(pq)^{*} = p^{*} \cdot q^{*}, 000 \mapsto 0^{*}, 111 \mapsto 1^{*}, the map qqq \mapsto q^{*} is a dense, order-preserving ring embedding of Q\mathbb{Q} into R\mathbb{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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 30 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources