Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (openai/gpt-5.4)audited 2026-07-25
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.

Addition, negation, and subtraction of Dedekind cuts

Definition

Let A,BRA, B \in \mathbb{R} be Dedekind cuts of Q\mathbb{Q} (Dedekind cut, The real numbers R\mathbb{R} as Dedekind cuts).

Sum. The sum is the Minkowski sumset in Q\mathbb{Q}: A+B:={a+b:aA, bB}.A + B := \{\, a + b : a \in A,\ b \in B \,\}.

Additive identity. 0:={qQ:q<0}0^{*} := \{\, q \in \mathbb{Q} : q < 0 \,\}, the cut of the rational 00 under the embedding qq={rQ:r<q}q \mapsto q^{*} = \{\, r \in \mathbb{Q} : r < q \,\} (The real numbers R\mathbb{R} as Dedekind cuts).

Additive inverse. For a cut AA, A:={pQ:rQ, r>0, with prA}.-A := \{\, p \in \mathbb{Q} : \exists\, r \in \mathbb{Q},\ r > 0,\ \text{with } -p - r \notin A \,\}. Equivalently, pAp \in -A iff there is a rational sAs \notin A with s<ps < -p (set s=prs = -p - r; conversely r=ps>0r = -p - s > 0). Intuitively p-p is bounded away from AA from below: some rational strictly beneath p-p already fails to lie in AA.

Subtraction. AB:=A+(B)A - B := A + (-B).

Remarks

The sum A+BA + B is again a cut, and (R,+)(\mathbb{R}, +) is an abelian group with identity 00^{*}: closure, commutativity, associativity, and the identity law are Cut addition: A+BA+B is a cut, commutative and associative, with identity 00^{*}, and existence of inverses is For a cut AA, A-A is a cut and A+(A)=0A + (-A) = 0^{*}.

The r>0r > 0 slack in the definition of A-A is essential and is not cosmetic. Neither {a:aA}\{-a : a \in A\} nor {a:aA}\{-a : a \notin A\} is a cut in general: the first need not be downward closed, and the second can acquire a greatest element. Excising the boundary rational (the "pr-p - r with r>0r > 0" clause) makes A-A a genuine cut with no greatest element and forces the exact identity A+(A)=0A + (-A) = 0^{*}, not merely A+(A)0A + (-A) \subsetneq 0^{*} (For a cut AA, A-A is a cut and A+(A)=0A + (-A) = 0^{*}).

Depends on

Used by

Dependency tree · next 3 levels

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