Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-24
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.

Cauchy sequences form a commutative ring

Statement

The set C\mathcal{C} of Cauchy sequences of rationals, with termwise addition and multiplication and the constant sequences 00 and 11, is a commutative ring with identity.

Facts & Assumptions

Given: Cauchy sequences (an),(bn)(a_n), (b_n) and a rational ε>0\varepsilon > 0.

[A1]

Cauchy: for every rational δ>0\delta > 0 there is an index beyond which any two terms differ by less than δ\delta.

[L1]

Q\mathbb{Q} is a field; ring axioms hold termwise (The rationals form a field).

[L2]

Triangle inequality and uv=uv|uv| = |u||v| (Absolute value and the triangle inequality).

[L3]

Cauchy sequences are bounded (Every Cauchy sequence of rationals is bounded).

[L4]

Ordered-field arithmetic: ε/2\varepsilon/2, ε/(A+B)\varepsilon/(A+B) are positive rationals for A,B1A, B \ge 1 (The rationals form a totally ordered field).

Proof

technique · direct
1.1

Termwise, all ring axioms (associativity, commutativity, identities, inverses for ++, distributivity) hold in C\mathcal{C} because they hold in Q\mathbb{Q} at every index; the constant sequences 0,10, 1 are Cauchy. What needs proof is closure of C\mathcal{C} under ++, negation, and \cdot.

L1
1.2

Fix NaN_a with aman<ε/2|a_m - a_n| < \varepsilon/2 for m,nNam,n \ge N_a and NbN_b likewise for (bn)(b_n).

A1L4
1.3

Fix rational bounds A,B1A, B \ge 1 with anA|a_n| \le A and bnB|b_n| \le B for all nn.

L3
2.1

Sum: for m,nmax(Na,Nb)m,n \ge \max(N_a, N_b), (am+bm)(an+bn)aman+bmbn<ε|(a_m + b_m) - (a_n + b_n)| \le |a_m - a_n| + |b_m - b_n| < \varepsilon; so (an+bn)(a_n + b_n) is Cauchy. Negation likewise: (am)(an)=aman|(-a_m) - (-a_n)| = |a_m - a_n|.

step 1.2L2
2.2

Set δ=ε/(A+B)>0\delta = \varepsilon/(A+B) > 0 and fix Ma,MbM_a, M_b with aman<δ|a_m - a_n| < \delta for m,nMam,n \ge M_a and bmbn<δ|b_m - b_n| < \delta for m,nMbm,n \ge M_b.

step 1.3A1L4
3.1

Product: for m,nmax(Ma,Mb)m,n \ge \max(M_a, M_b), ambmanbn=am(bmbn)+bn(aman)Abmbn+Baman<(A+B)δ=ε|a_m b_m - a_n b_n| = |a_m(b_m - b_n) + b_n(a_m - a_n)| \le A|b_m - b_n| + B|a_m - a_n| < (A+B)\delta = \varepsilon; so (anbn)(a_n b_n) is Cauchy.

step 1.3step 2.2L2
4.1

C\mathcal{C} is closed under addition, negation, and multiplication, contains 00 and 11, and satisfies the ring axioms termwise: a commutative ring with identity.

step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · next 3 levels

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