Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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)(n_j) is strictly increasing with n0=0n_0 = 0 and the series of blocks jBj\sum_j B_j, Bj=k=njnj+11akB_j = \sum_{k=n_j}^{n_{j+1}-1} a_k, converges (Series, partial sums, convergence and the sum, divergence, and the tail series), then ak\sum a_k converges.

What is true is the opposite direction, Grouping: if ak\sum a_k converges and (nj)(n_j) is strictly increasing with n0=0n_0 = 0, the series of blocks k=njnj+11ak\sum_{k=n_j}^{n_{j+1}-1} a_k converges to the same sum: convergence of ak\sum a_k 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)(\varepsilon_k) be the alternating sequence (The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1), with even and odd index maps ee and oo satisfying oj=ej+1o_j = e_j + 1 and ej+1=oj+1e_{j+1} = o_j + 1, and group in pairs, nj:=ejn_j := e_j. Every block is εej+εoj=1+(1)=0\varepsilon_{e_j} + \varepsilon_{o_j} = 1 + (-1) = 0, so the grouped series is 0+0+0 + 0 + \dots and converges to 00; but εk\sum \varepsilon_k diverges, its terms having absolute value 11 and so not tending to 00 (If a series converges then its terms tend to 00).

Facts & Assumptions

Given: The alternating sequence (εk)(\varepsilon_k) with index maps ee and oo, and the grouping nj:=ejn_j := e_j.

[A1]

The refuted claim: if some grouping of ak\sum a_k converges then ak\sum a_k converges.

[L1]

The alternating sequence: ε0=1\varepsilon_0 = 1, εk+1=εk\varepsilon_{k+1} = -\varepsilon_k, εk=1|\varepsilon_k| = 1, εej=1\varepsilon_{e_j} = 1, εoj=1\varepsilon_{o_j} = -1; e0=0e_0 = 0, ej+1=ej+2e_{j+1} = e_j + 2, oj=ej+1o_j = e_j + 1; ee is strictly increasing (The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1, Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L2]

Finite sums: the empty sum is 00, k<m+1xk=k<mxk+xm\sum_{k<m+1}x_k = \sum_{k<m}x_k + x_m, and a sum over the range {nj,,nj+11}\{n_j, \dots, n_{j+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\sum x_k converges then xk0x_k \to 0 (If a series converges then its terms tend to 00).

Refutation

technique · direct
1.1

The map jnj=ejj \mapsto n_j = e_j is strictly increasing with n0=e0=0n_0 = e_0 = 0, and nj+1=ej+2=nj+2n_{j+1} = e_j + 2 = n_j + 2, so each block runs over the two indices eje_j and oj=ej+1o_j = e_j + 1.

L1
1.2

The series kεk\sum_k \varepsilon_k diverges: εk=1|\varepsilon_k| = 1 for every kk, so the tolerance ε=1\varepsilon = 1 admits no index KK with εk0<1|\varepsilon_k - 0| < 1 for all kKk \ge K, and (εk)(\varepsilon_k) does not converge to 00.

L1L4
2.1

Each block is Bj=εej+εoj=1+(1)=0B_j = \varepsilon_{e_j} + \varepsilon_{o_j} = 1 + (-1) = 0.

step 1.1L1L2
3.1

The grouped series jBj\sum_j B_j has all terms 00, so all its partial sums are 00 and it converges, with sum 00.

step 2.1L2L3
4.1

A grouping of εk\sum \varepsilon_k therefore converges while εk\sum \varepsilon_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 · next 3 levels

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