Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

FALSE: if some grouping of a series converges then the series itself converges

Statement

False claim: if (nj) is strictly increasing with n0=0 and the series of blocks ∑jBj, Bj=∑k=njnj+1−1ak, converges (Series, partial sums, convergence and the sum, divergence, and the tail series), then ∑ak converges.

What is true is the opposite direction, Grouping: if ∑ak converges and (nj) is strictly increasing with n0=0, the series of blocks ∑k=njnj+1−1ak converges to the same sum: convergence of ∑ak implies convergence of every grouping, to the same sum. Brackets may be inserted into a convergent series; they may not be removed.

The witness is the alternating sequence itself. Let (εk) be the alternating sequence (The even and odd index maps and the alternating sequence: strictly increasing e,o with N their disjoint union, and the unique (sk) with s0=1, sσ(k)=−sk, which satisfies ∣sk∣=1, s∘e≡1 and s∘o≡−1), with even and odd index maps e and o satisfying oj=ej+1 and ej+1=oj+1, and group in pairs, nj:=ej. Every block is εej+εoj=1+(−1)=0, so the grouped series is 0+0+… and converges to 0; but ∑εk diverges, its terms having absolute value 1 and so not tending to 0 (If a series converges then its terms tend to 0).

Facts & Assumptions

Given: The alternating sequence (εk) with index maps e and o, and the grouping nj:=ej.

[A1]

The refuted claim: if some grouping of ∑ak converges then ∑ak converges.

[L2]

Finite sums: the empty sum is 0, ∑k<m+1xk=∑k<mxk+xm, and a sum over the range {nj,…,nj+1−1} of two indices is the sum of the two terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L4]

If ∑xk converges then xk→0 (If a series converges then its terms tend to 0).

Refutation

technique · direct
1.1

The map j↦nj=ej is strictly increasing with n0=e0=0, and nj+1=ej+2=nj+2, so each block runs over the two indices ej and oj=ej+1.

L1
1.2

The series ∑kεk diverges: ∣εk∣=1 for every k, so the tolerance ε=1 admits no index K with ∣εk−0∣<1 for all k≥K, and (εk) does not converge to 0.

L1L4
2.1

Each block is Bj=εej+εoj=1+(−1)=0.

step 1.1L1L2
3.1

The grouped series ∑jBj has all terms 0, so all its partial sums are 0 and it converges, with sum 0.

step 2.1L2L3
4.1

A grouping of ∑εk therefore converges while ∑εk does not, so the claim [A1] is false.

step 3.1step 1.2A1
5.1

What survives is [L5]: convergence of the series implies convergence of every grouping, and the implication cannot be reversed.

step 4.1A1L5∎

Remarks

Depends on

Used by

Dependency tree · two levels

36 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