Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Null sequences form an ideal

Statement

The set N of null sequences is an ideal of the ring C of Cauchy sequences (Cauchy sequences form a commutative ring): it is a subgroup under addition, and c⋅z∈N whenever c∈C and z∈N.

Facts & Assumptions

Given: Null sequences (zn),(wn), a Cauchy sequence (cn), and a rational ε>0.

[A1]

Null: beyond some index, ∣zn∣ is smaller than any prescribed positive rational.

[L1]

Ordered-field arithmetic in Q (The rationals form a totally ordered field).

[L2]

Triangle inequality and multiplicativity of ∣⋅∣ (Absolute value and the triangle inequality).

[L3]

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

[L4]

Null sequences are Cauchy, so N⊆C (Null sequences are Cauchy).

Proof

technique · direct
1.1

Fix Nz,Nw with ∣zn∣<ε/2 for n≥Nz and ∣wn∣<ε/2 for n≥Nw.

A1L1
1.2

Fix M≥0 with ∣cn∣≤M ([L3]) and set B=max⁡(M,1)≥1, so ∣cn∣≤B for all n.

L3
2.1

Sum: for n≥max⁡(Nz,Nw), ∣zn+wn∣≤∣zn∣+∣wn∣<ε; negation: ∣−zn∣=∣zn∣. So N is a subgroup under addition.

step 1.1L2
2.2

Fix N with ∣zn∣<ε/B for n≥N.

step 1.2A1L1
3.1

Product: for n≥N, ∣cnzn∣=∣cn∣ ∣zn∣≤B ∣zn∣<ε; so (cnzn) is null.

step 1.2step 2.2L2
4.1

N is a nonempty additive subgroup of C absorbing multiplication by C: an ideal.

step 2.1step 3.1L4∎

Depends on

Used by

Dependency tree · two levels

12 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