Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

The Cauchy product of ∑k≥0(−1)k/k+1 with itself has ∣cn∣≥1 for every n, so it diverges

Statement refuted

Refuted claim: the Cauchy product of two convergent series of reals converges (The Cauchy product of two series: cn=∑k=0nakbn−k, Series, partial sums, convergence and the sum, divergence, and the tail series).

The witness is a single conditionally convergent series multiplied by 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) and

ak  =  bk  :=  εkι(k+1),

so that ∑ak converges by the alternating series test. Then, as FALSE: the Cauchy product of two convergent series converges establishes,

∣cn∣  =  ∑k=0n1ι(k+1) ι(n−k+1)  ≥  2 ι(n+1)ι(n+2)  ≥  1(n∈N),

so (cn) does not converge to 0 and ∑cn diverges (If a series converges then its terms tend to 0).

What this counterexample adds to the false statement is the sharp form of the bound: the lower bound 2ι(n+1)/ι(n+2)=2−2/ι(n+2) increases to 2, so ∣cn∣ eventually exceeds every real below 2. The terms of the product series therefore do not merely fail to tend to 0; they stay bounded away from it by an amount approaching 2. Nothing here determines the asymptotic size of ∣cn∣ itself, only this lower bound for it; the divergence is as far from marginal as the bound makes it.

Facts & Assumptions

Given: The alternating sequence (εk), the sequence βk:=1/ι(k+1), the series ∑ak with ak=bk=εkβk, and its Cauchy product (cn).

[L3]

The canonical naturals are positive for n≥1 and strictly increasing, with ι(m+n)=ι(m)+ι(n); reciprocation reverses the order on the positives (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L4]

Finite sums are monotone in their terms, and the sum of n+1 copies of a constant λ is ι(n+1)λ (Laws of finite sums and finite products).

[L7]

Convergence to 0 of a sequence (Limits and Cauchy sequences of reals).

Counterexample

technique · direct
1.1givenL1

The series ∑kak converges, and its Cauchy product with itself satisfies ∣cn∣=∑k=0nβkβn−k≥2ι(n+1)/ι(n+2)≥1 for every n.

2.1step 1.1L1L7

Hence (cn) does not converge to 0: the tolerance 1 admits no index K with ∣cn−0∣<1 for all n≥K. So ∑cn diverges, and two convergent series can have a divergent Cauchy product.

2.2step 1.1L3L4

The lower bound is itself informative: 2ι(n+1)/ι(n+2)=2−2/ι(n+2), a quantity strictly increasing in n that exceeds every real below 2 from some index on. So ∣cn∣≥2−2/ι(n+2) for every n, and the terms of the product series stay bounded away from 0 by an amount approaching 2; nothing here claims a value for ∣cn∣ itself, only this bound for it.

3.1step 2.1L6

Neither factor converges absolutely, and that is exactly what the hypothesis of Mertens' theorem asks for: were ∑∣ak∣ convergent, [L6] would make ∑cn convergent, contradicting step 2.1.

4.1step 2.1step 2.2step 3.1L6∎

So the refuted claim fails for this pair, and the hypothesis that repairs it is absolute convergence of one factor.

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 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