Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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,B∈R be Dedekind cuts of Q (Dedekind cut, The real numbers R as Dedekind cuts).

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

Additive identity. 0∗:={ q∈Q:q<0 }, the cut of the rational 0 under the embedding q↦q∗={ r∈Q:r<q } (The real numbers R as Dedekind cuts).

Additive inverse. For a cut A, −A:={ p∈Q:∃ r∈Q, r>0, with −p−r∉A }. Equivalently, p∈−A iff there is a rational s∉A with s<−p (set s=−p−r; conversely r=−p−s>0). Intuitively −p is bounded away from A from below: some rational strictly beneath −p already fails to lie in A.

Subtraction. A−B:=A+(−B).

Remarks

The sum A+B is again a cut, and (R,+) is an abelian group with identity 0∗: closure, commutativity, associativity, and the identity law are Cut addition: A+B is a cut, commutative and associative, with identity 0∗, and existence of inverses is For a cut A, −A is a cut and A+(−A)=0∗.

The r>0 slack in the definition of −A is essential and is not cosmetic. Neither {−a:a∈A} nor {−a:a∉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 "−p−r with r>0" clause) makes −A a genuine cut with no greatest element and forces the exact identity A+(−A)=0∗, not merely A+(−A)⊊0∗ (For a cut A, −A is a cut and A+(−A)=0∗).

Depends on

Used by

Dependency tree · two levels

4 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