Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 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 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>0∗ (strictly positive),

A⋅B:={ q∈Q:q≤0 }  ∪  { ab:a∈A, b∈B, a>0, b>0 }.

Absolute value. ∣A∣:=A if A≥0∗, and ∣A∣:=−A otherwise (Addition, negation, and subtraction of Dedekind cuts for −A); thus ∣A∣≥0∗ always, and ∣0∗∣=0∗.

Sign extension. For arbitrary cuts A,B,

  • A⋅B:=0∗ if A=0∗ or B=0∗;
  • A⋅B:=∣A∣⋅∣B∣ if A,B are both >0∗ or both <0∗;
  • A⋅B:=−(∣A∣⋅∣B∣) if A,B have opposite signs.

Identity. The multiplicative identity is 1∗={ r∈Q:r<1 }.

Reciprocal. For A>0∗,

A−1:={ p∈Q:p≤0 }  ∪  { p>0:∃ s∈Q, s>0, s∉A, p<1/s }.

Equivalently, a positive rational p lies in A−1 iff 1/p is an upper rational bound of A that is not the least one (Rudin's construction). For A<0∗, set A−1:=−((−A)−1). Division is A/B:=A⋅B−1 for B≠0∗.

Remarks

  • The product formula is stated only for strictly positive cuts A,B>0∗: then there exist positive a∈A, b∈B, so the positive products ab are nonempty and, because A,B have no greatest element (axiom (C3)), A⋅B has none either; together with downward closure this makes A⋅B a genuine cut, the clause {q≤0} being absorbed below those positive products. The formula is deliberately not applied at the boundary A=0∗ or B=0∗, where {q≤0} would leave 0 as a greatest element and so fail to be a cut; products with a zero factor are supplied instead by the first sign rule, A⋅B=0∗, so the operation is well posed on all cuts.
  • On the rational embedding q↦q∗ the operation agrees with Q: (pq)∗=p∗⋅q∗ (The rational cuts embed densely in R, preserving sums, products, 0, 1 and the order); with q∗⋅(1/q)∗=1∗ that gives (q∗)−1=(1/q)∗ for q>0, the reciprocal being the one supplied by For a positive cut A, the reciprocal A−1 satisfies A⋅A−1=1∗.
  • That these operations send cuts to cuts and satisfy the field axioms ( commutativity, associativity, distributivity over addition, identity 1∗, and A⋅A−1=1∗ for every A≠0∗) is The Dedekind reals form a field.

Depends on

Used by

Dependency tree · two levels

6 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