Alphabeta Math
ExampleConstruction: 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.

The Cesaro means of (1)k(-1)^k converge to 00 although the sequence diverges

Example

Let (sk)(s_k) be the alternating sequence of 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, the unique sequence of reals with s0=1s_0 = 1 and sσ(k)=sks_{\sigma(k)} = -s_k, usually written sk=(1)ks_k = (-1)^k. Its Cesaro means (The Cesaro means σn=(x0++xn)/(n+1)\sigma_n = (x_0 + \dots + x_n)/(n+1) and (C,1)(C,1)-summability) are

σn  =  s0++snn+1  =  {1n+1n even,0n odd,\sigma_n \;=\; \frac{s_0 + \dots + s_n}{n+1} \;=\; \begin{cases} \dfrac{1}{n+1} & n \text{ even},\\[4pt] 0 & n \text{ odd},\end{cases}

so the first few values are

σ0=1,σ1=0,σ2=13,σ3=0,σ4=15,σ5=0, \sigma_0 = 1,\quad \sigma_1 = 0,\quad \sigma_2 = \tfrac13,\quad \sigma_3 = 0,\quad \sigma_4 = \tfrac15,\quad \sigma_5 = 0,\ \dots

and limnσn=0\lim_n \sigma_n = 0, while (sk)(s_k) does not converge at all. So (sk)(s_k) is (C,1)(C,1)-summable to 00 and divergent: it is the standard witness that (C,1)(C,1)-summability is strictly weaker than convergence, and the one used in FALSE: if the Cesaro means of a sequence converge then the sequence converges.

The value 00 is the one an average ought to give, since the sequence spends half its indices at 11 and half at 1-1; the classical way to say this is that the series 11+11+1 - 1 + 1 - 1 + \dots has Cesaro sum 12\tfrac12, that being the Cesaro limit of its partial sums rather than of its terms.

Facts & Assumptions

Given: The alternating sequence (sk)(s_k) with s0=1s_0 = 1 and sσ(k)=sks_{\sigma(k)} = -s_k, its partial sums Sn=k<nskS_n = \sum_{k<n} s_k, and its Cesaro means σn=(n+1)1Sn+1\sigma_n = (n+1)^{-1}S_{n+1}.

[L2]

Its partial sums satisfy Sej=0S_{e_j} = 0 and Soj=1S_{o_j} = 1, and consequently σn(n+1)1|\sigma_n| \le (n+1)^{-1} and σn0\sigma_n \to 0; this is proved in FALSE: if the Cesaro means of a sequence converge then the sequence converges, steps 2.1, 3.1, 4.1 and 5.1 there.

[L3]

(sk)(s_k) is bounded and does not converge (FALSE: every bounded sequence converges).

[L6]

Order arithmetic: (n+1)1R>0(n+1)\cdot 1_{\mathbb{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|u| = u for u0u \ge 0 (Basic properties of the absolute value); the order is total (Complete ordered field (least-upper-bound property), Ordered field).

Verification

technique · direct
1.1

Sm=0S_m = 0 when mm is even and Sm=1S_m = 1 when mm is odd, since N\mathbb{N} is the disjoint union of the ranges of ee and oo and Sej=0S_{e_j} = 0, Soj=1S_{o_j} = 1.

L1L2
1.2

(sk)(s_k) does not converge.

L3
2.1

Hence σn=(n+1)1Sn+1\sigma_n = (n+1)^{-1}S_{n+1} equals (n+1)1(n+1)^{-1} when nn is even, because n+1n+1 is then odd, and equals 00 when nn is odd; in particular σ0=1\sigma_0 = 1, σ1=0\sigma_1 = 0, σ2=1/3\sigma_2 = 1/3, σ3=0\sigma_3 = 0, σ4=1/5\sigma_4 = 1/5 and σ5=0\sigma_5 = 0.

step 1.1L4L6
2.2

σn(n+1)1|\sigma_n| \le (n+1)^{-1} for every nn, and given a real ε>0\varepsilon > 0 a natural m1m \ge 1 with 1/m<ε1/m < \varepsilon gives σn(n+1)1<ε|\sigma_n| \le (n+1)^{-1} < \varepsilon for all nmn \ge m; so limnσn=0\lim_n \sigma_n = 0.

step 1.1L2L5L6
3.1

(sk)(s_k) is therefore (C,1)(C,1)-summable to 00 and divergent.

step 1.2step 2.1step 2.2L4

Remarks

  • The means converge but are not monotone, and they are not even eventually of one shape: they alternate between 00 and a positive value shrinking like 1/(n+1)1/(n+1). Convergence of a Cesaro transform therefore carries no monotonicity information, which is another way of seeing that the transform loses the oscillation rather than damping it.

  • Where the 1/21/2 comes from. The classical assertion "11+11+=1/21 - 1 + 1 - 1 + \dots = 1/2" is about the partial sums SmS_m, which are 0,1,0,1,0, 1, 0, 1, \dots; their Cesaro means tend to 1/21/2. This library has no theory of series yet, so nothing above asserts it; the sequence averaged here is (sk)(s_k) itself, whose means tend to 00.

  • This is not a failure of the Cesaro matrix. That matrix is regular (The Cesaro matrix satisfies the Silverman-Toeplitz conditions, giving a second proof of the Cesaro mean theorem): it never changes a limit that exists. What it does here is assign a value where no limit exists, which is exactly what a summability method is for.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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