Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge 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.

Cut addition: A+BA+B is a cut, commutative and associative, with identity 00^{*}

Statement

For Dedekind cuts A,BA, B, the sumset A+B={a+b:aA, bB}A + B = \{\, a + b : a \in A,\ b \in B \,\} (Addition, negation, and subtraction of Dedekind cuts) is again a Dedekind cut. Addition of cuts is commutative and associative, and 0={qQ:q<0}0^{*} = \{\, q \in \mathbb{Q} : q < 0 \,\} is a two-sided identity: A+0=AA + 0^{*} = A for every cut AA.

Facts & Assumptions

Given: Dedekind cuts A,B,CA, B, C; A+B:={a+b:aA, bB}A + B := \{\, a + b : a \in A,\ b \in B \,\} and 0:={qQ:q<0}0^{*} := \{\, q \in \mathbb{Q} : q < 0 \,\} (Addition, negation, and subtraction of Dedekind cuts).

[A1]

Cut axioms (C1)–(C3), and the restatement that for aAa \in A and bAb \notin A one has a<ba < b; the contrapositive of (C2): if xAx \notin A and y>xy > x then yAy \notin A (Dedekind cut).

[L1]

Q\mathbb{Q} is a commutative, associative, totally ordered field; in particular addition is commutative and associative and the order is translation-invariant (The rationals form a totally ordered field).

Proof

technique · direct
1.1

(C1) A+BA + B is proper and nonempty: choosing aAa \in A, bBb \in B gives a+bA+Ba + b \in A + B, so A+BA + B \neq \varnothing; choosing aAa' \notin A, bBb' \notin B, every aAa \in A, bBb \in B satisfies a<aa < a' and b<bb < b', hence a+b<a+ba + b < a' + b', so a+bA+Ba' + b' \notin A + B and A+BQA + B \neq \mathbb{Q}.

A1L1
1.2

(C2) A+BA + B is downward closed: if s=a+bA+Bs = a + b \in A + B with aAa \in A, bBb \in B, and q<sq < s, then qa<bq - a < b, so qaBq - a \in B by (C2) for BB; hence q=a+(qa)A+Bq = a + (q - a) \in A + B.

A1L1
1.3

(C3) A+BA + B has no greatest element: given s=a+bA+Bs = a + b \in A + B, (C3) for AA yields aAa' \in A with a>aa' > a, whence a+bA+Ba' + b \in A + B and a+b>a+b=sa' + b > a + b = s.

A1L1
1.4

Commutativity and associativity descend from Q\mathbb{Q}: A+B={a+b}={b+a}=B+AA + B = \{a + b\} = \{b + a\} = B + A, and (A+B)+C={(a+b)+c}={a+(b+c)}=A+(B+C)(A + B) + C = \{(a + b) + c\} = \{a + (b + c)\} = A + (B + C).

L1
1.5

A+0AA + 0^{*} \subseteq A: for aAa \in A and q0q \in 0^{*} (so q<0q < 0), a+q<aa + q < a, hence a+qAa + q \in A by (C2).

A1L1
1.6

AA+0A \subseteq A + 0^{*}: given aAa \in A, (C3) supplies rAr \in A with r>ar > a; then ar<0a - r < 0, so ar0a - r \in 0^{*}, and a=r+(ar)A+0a = r + (a - r) \in A + 0^{*}.

A1L1
2.1

A+BA + B satisfies (C1)–(C3), so it is a Dedekind cut.

step 1.1step 1.2step 1.3A1
2.2

The two inclusions give the identity law A+0=AA + 0^{*} = A.

step 1.5step 1.6
3.1

Hence A+BA + B is a cut, and cut addition is commutative and associative with two-sided identity 00^{*}.

step 2.1step 1.4step 2.2

Depends on

Used by

Dependency tree · next 3 levels

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