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 the Cesaro means of a sequence converge then the sequence converges

Statement

False claim: if the Cesaro means $(σ_{n})$ of a sequence $(x_{k})$ of reals converge (The Cesaro means $σ_{n} = (x_{0} + \dots + x_{n}) / (n + 1)$ and $(C, 1)$ -summability), then $(x_{k})$ converges.

The implication in the opposite direction is true and is If $x_{k} \to L$ then $σ_{n} \to L$ : convergence implies $(C, 1)$ -summability to the same value. The claim above asserts its converse, and it is refuted below by the alternating sequence $s_{k} = (- 1)^{k}$ , whose Cesaro means converge to $0$ while the sequence itself does not converge at all.

That is the whole reason Cesaro summability is worth defining: it is a strictly larger notion than convergence, consistent with it where both apply.

Facts & Assumptions

Given: The alternating sequence $(s_{k})$ of The even and odd index maps and the alternating sequence: strictly increasing $e, o$ with $N$ their disjoint union, and the unique $(s_{k})$ with $s_{0} = 1$ , $s_{σ (k)} = - s_{k}$ , which satisfies $∣ s_{k} ∣ = 1$ , $s \circ e \equiv 1$ and $s \circ o \equiv - 1$ , the unique sequence of reals with $s_{0} = 1$ and $s_{σ (k)} = - s_{k}$ , together with the index maps $e$ and $o$ of that lemma; and its partial sums $S_{n} : = \sum_{k < n} s_{k}$ (Finite sums and finite products, by recursion), and its Cesaro means $σ_{n} = (n + 1)^{- 1} S_{n + 1}$ (The Cesaro means $σ_{n} = (x_{0} + \dots + x_{n}) / (n + 1)$ and $(C, 1)$ -summability).

[L1]

The alternating sequence: $e$ and $o$ are the unique maps with $e_{0} = 0$ , $e_{σ (j)} = σ (σ (e_{j}))$ , $o_{0} = σ (0)$ , $o_{σ (j)} = σ (σ (o_{j}))$ ; both are strictly increasing; $N$ is the disjoint union of their ranges; $(s_{k})$ is the unique sequence with $s_{0} = 1$ and $s_{σ (k)} = - s_{k}$ ; $∣ s_{k} ∣ = 1$ , $s_{e_{j}} = 1$ and $s_{o_{j}} = - 1$ (The even and odd index maps and the alternating sequence: strictly increasing $e, o$ with $N$ their disjoint union, and the unique $(s_{k})$ with $s_{0} = 1$ , $s_{σ (k)} = - s_{k}$ , which satisfies $∣ s_{k} ∣ = 1$ , $s \circ e \equiv 1$ and $s \circ o \equiv - 1$ ).

[L2]

Finite sums: $\sum_{k < 0} s_{k} = 0$ and $\sum_{k < n + 1} s_{k} = \sum_{k < n} s_{k} + s_{n}$ (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L3]

Induction principle (The principle of mathematical induction).

[L4]

Cesaro means: $σ_{n} = (n + 1)^{- 1} \sum_{k = 0}^{n} x_{k}$ , and $\sum_{k = 0}^{n} = \sum_{k < n + 1}$ (The Cesaro means $σ_{n} = (x_{0} + \dots + x_{n}) / (n + 1)$ and $(C, 1)$ -summability, Finite sums and finite products, by recursion).

[L5]

The alternating sequence does not converge: it is bounded and divergent, which is the refutation of FALSE: every bounded sequence converges, carried out there for the very same sequence, the one determined by $s_{0} = 1$ and $s_{σ (k)} = - s_{k}$ , which The even and odd index maps and the alternating sequence: strictly increasing $e, o$ with $N$ their disjoint union, and the unique $(s_{k})$ with $s_{0} = 1$ , $s_{σ (k)} = - s_{k}$ , which satisfies $∣ s_{k} ∣ = 1$ , $s \circ e \equiv 1$ and $s \circ o \equiv - 1$ shows is unique.

[L6]

Reciprocal Archimedean property (For every $ε > 0$ in a complete ordered field there is a natural $n \geq 1$ with $1 / n < ε$ ); convergence of a real sequence (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L7]

Order arithmetic: $(n + 1) \cdot 1_{R} > 0$ (Canonical naturals are positive and strictly increasing) hence invertible with positive inverse, and reciprocation reverses the order (Inverses of positives are positive, and reciprocation reverses order); $∣ u ∣ = u$ for $u \geq 0$ (Basic properties of the absolute value); the order is total and transitive (Complete ordered field (least-upper-bound property), Ordered field).

Refutation

technique · direct

1.1

By induction on $j$ , $o_{j} = σ (e_{j})$ and $e_{σ (j)} = σ (o_{j})$ : at $j = 0$ one has $o_{0} = σ (0) = σ (e_{0})$ , and $e_{σ (j)} = σ (σ (e_{j})) = σ (o_{j})$ follows from the first identity at $j$ , while $o_{σ (j)} = σ (σ (o_{j})) = σ (e_{σ (j)})$ carries the first identity to $σ (j)$ .

L1L3

1.2

The partial sums satisfy $S_{0} = 0$ and $S_{σ (n)} = S_{n} + s_{n}$ , and $σ_{n} = (n + 1)^{- 1} S_{σ (n)}$ .

L2L4L7

1.3

$(s_{k})$ does not converge.

2.1

By induction on $j$ : $S_{e_{j}} = 0$ and $S_{o_{j}} = 1$ . At $j = 0$ : $S_{e_{0}} = S_{0} = 0$ and $S_{o_{0}} = S_{σ (0)} = S_{0} + s_{0} = 1$ . For the step, $S_{e_{σ (j)}} = S_{σ (o_{j})} = S_{o_{j}} + s_{o_{j}} = 1 + (- 1) = 0$ and $S_{o_{σ (j)}} = S_{σ (e_{σ (j)})} = S_{e_{σ (j)}} + s_{e_{σ (j)}} = 0 + 1 = 1$ .

step 1.1step 1.2L1L3

3.1

Every natural number is $e_{j}$ for exactly one $j$ or $o_{j}$ for exactly one $j$ , so $S_{m} \in {0, 1}$ for every $m$ ; in particular $0 \leq S_{σ (n)} \leq 1$ for every $n$ .

step 1.1step 2.1L1

4.1

Hence $0 \leq σ_{n} = (n + 1)^{- 1} S_{σ (n)} \leq (n + 1)^{- 1}$ and so $∣ σ_{n} ∣ \leq (n + 1)^{- 1}$ for every $n$ .

step 1.2step 3.1L7

5.1

Given a real $ε > 0$ , choose $m \geq 1$ with $1 / m < ε$ ; for every $n \geq m$ one has $n + 1 > m$ and therefore $∣ σ_{n} - 0 ∣ \leq (n + 1)^{- 1} < 1 / m < ε$ . So $(σ_{n})$ converges to $0$ , that is, $(s_{k})$ is $(C, 1)$ -summable to $0$ .

step 4.1L4L6L7

6.1

So $(s_{k})$ has convergent Cesaro means and does not converge, and the claim is false.

step 1.3step 5.1∎

Remarks

What averaging destroys. The Cesaro mean of the first $n + 1$ terms of an alternating sequence is either $0$ or $1 / (n + 1)$ , because the terms cancel in pairs and at most one is left over. The oscillation is real and is not damped by any tail condition; it is simply invisible to the average. So the transform loses information, and no regular summability method can be expected to recover a limit that does not exist (The Cesaro matrix satisfies the Silverman-Toeplitz conditions, giving a second proof of the Cesaro mean theorem).
The worked computation of the means, with the values displayed, is The Cesaro means of $(- 1)^{k}$ converge to $0$ although the sequence diverges ↗.
A correct converse needs an extra hypothesis. The classical one is Tauberian: if the Cesaro means converge and in addition $k (x_{k} - x_{k - 1})$ is bounded, then $(x_{k})$ converges. No such theorem is proved in this library, and none may be cited from it; the statement is mentioned only to say what the repaired claim would look like.
The failure is not caused by unboundedness. The witness is bounded, with $∣ s_{k} ∣ = 1$ at every index. It is the same sequence that refutes the claim that bounded sequences converge (FALSE: every bounded sequence converges), and for the same underlying reason: boundedness forbids escaping, not oscillating.

Depends on

Used by

The Cesaro means of (-1)ᵏ converge to 0 although the sequence diverges Example

Dependency tree · two levels

40 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

Grandi's series (Wikipedia) (standard reference, not scraped)
Cesàro summation (Wikipedia) (standard reference, not scraped)
Divergent series (Wikipedia) (standard reference, not scraped)
G. H. Hardy, Divergent Series, Ch. 1 (standard reference, not scraped)