Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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.

Multiplication and reciprocals of Dedekind cuts

Definition

Multiplication of Dedekind cuts (Dedekind cut, The real numbers R\mathbb{R} as Dedekind cuts) is defined first for nonnegative cuts, then extended to all cuts by their signs (Order on the Dedekind reals) via the absolute value.

Positive case. For cuts A,B>0A, B > 0^{*} (strictly positive),

AB:={qQ:q0}    {ab:aA, bB, a>0, b>0}.A \cdot B := \{\, q \in \mathbb{Q} : q \le 0 \,\} \;\cup\; \{\, a b : a \in A,\ b \in B,\ a > 0,\ b > 0 \,\}.

Absolute value. A:=A|A| := A if A0A \ge 0^{*}, and A:=A|A| := -A otherwise (Addition, negation, and subtraction of Dedekind cuts for A-A); thus A0|A| \ge 0^{*} always, and 0=0|0^{*}| = 0^{*}.

Sign extension. For arbitrary cuts A,BA, B,

  • AB:=0A \cdot B := 0^{*} if A=0A = 0^{*} or B=0B = 0^{*};
  • AB:=ABA \cdot B := |A| \cdot |B| if A,BA, B are both >0> 0^{*} or both <0< 0^{*};
  • AB:=(AB)A \cdot B := -\bigl(|A| \cdot |B|\bigr) if A,BA, B have opposite signs.

Identity. The multiplicative identity is 1={rQ:r<1}1^{*} = \{\, r \in \mathbb{Q} : r < 1 \,\}.

Reciprocal. For A>0A > 0^{*},

A1:={pQ:p0}    {p>0:sQ, s>0, sA, p<1/s}.A^{-1} := \{\, p \in \mathbb{Q} : p \le 0 \,\} \;\cup\; \{\, p > 0 : \exists\, s \in \mathbb{Q},\ s > 0,\ s \notin A,\ p < 1/s \,\}.

Equivalently, a positive rational pp lies in A1A^{-1} iff 1/p1/p is an upper rational bound of AA that is not the least one (Rudin's construction). For A<0A < 0^{*}, set A1:=((A)1)A^{-1} := -\bigl((-A)^{-1}\bigr). Division is A/B:=AB1A / B := A \cdot B^{-1} for B0B \ne 0^{*}.

Remarks

  • The product formula is stated only for strictly positive cuts A,B>0A, B > 0^{*}: then there exist positive aAa \in A, bBb \in B, so the positive products abab are nonempty and, because A,BA, B have no greatest element (axiom (C3)), ABA \cdot B has none either; together with downward closure this makes ABA \cdot B a genuine cut, the clause {q0}\{q \le 0\} being absorbed below those positive products. The formula is deliberately not applied at the boundary A=0A = 0^{*} or B=0B = 0^{*}, where {q0}\{q \le 0\} would leave 00 as a greatest element and so fail to be a cut; products with a zero factor are supplied instead by the first sign rule, AB=0A \cdot B = 0^{*}, so the operation is well posed on all cuts.
  • On the rational embedding qqq \mapsto q^{*} the operation agrees with Q\mathbb{Q}: (pq)=pq(pq)^{*} = p^{*} \cdot q^{*} (The rational cuts embed densely in R\mathbb{R}, preserving sums, products, 00, 11 and the order); with q(1/q)=1q^{*} \cdot (1/q)^{*} = 1^{*} that gives (q)1=(1/q)(q^{*})^{-1} = (1/q)^{*} for q>0q > 0, the reciprocal being the one supplied by For a positive cut AA, the reciprocal A1A^{-1} satisfies AA1=1A \cdot A^{-1} = 1^{*}.
  • That these operations send cuts to cuts and satisfy the field axioms ( commutativity, associativity, distributivity over addition, identity 11^{*}, and AA1=1A \cdot A^{-1} = 1^{*} for every A0A \ne 0^{*}) is The Dedekind reals form a field.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 12 results over 9 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