Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-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.

j0(1)j/(j+1)\sum_{j \ge 0} (-1)^{j}/(j+1) converges conditionally, with sum strictly between 1/21/2 and 11

Example

Let (εj)(\varepsilon_j) 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), written εj=(1)j\varepsilon_j = (-1)^j, and put bj:=1/ι(j+1)b_j := 1/\iota(j+1), with ι(j+1)\iota(j+1) the canonical natural, positive for every jj (Canonical naturals are positive and strictly increasing). The alternating harmonic series is

j0(1)jj+1  =  jεjbj.\sum_{j \ge 0} \frac{(-1)^{j}}{j+1} \;=\; \sum_j \varepsilon_j b_j .

It converges conditionally (Absolutely convergent and conditionally convergent series, and the general starting index): it converges, by the alternating series test, while its series of absolute values is the harmonic series k11/k\sum_{k\ge1} 1/k, which diverges (For rational p>0p > 0, 1/kp\sum 1/k^p converges iff p>1p > 1). Writing SS for its sum,

12  <  712    S    56  <  1.\tfrac{1}{2} \;<\; \tfrac{7}{12} \;\le\; S \;\le\; \tfrac{5}{6} \;<\; 1 .

The value of SS is not asserted. The classical evaluation is a logarithm and is not available at this point in the reading order; what is proved here is that SS exists and where it lies. See Selected sums and products on this page that are proved to exist without being evaluated, and what their evaluation waits for.

This is the series that gives the whole page its content: it is the standard witness for FALSE: every convergent series converges absolutely and, through The Riemann series theorem: a conditionally convergent real series has, for every cRc \in \mathbb{R}, a rearrangement with sum cc, and rearrangements diverging to ++\infty, to -\infty, and oscillating with any prescribed lim inflim sup\liminf \le \limsup in R\overline{\mathbb{R}}, the source of every rearrangement example below.

Facts & Assumptions

Given: The alternating sequence (εj)(\varepsilon_j) with index maps ee and oo, the sequence bj=1/ι(j+1)b_j = 1/\iota(j+1), and the partial sums tn=j<nεjbjt_n = \sum_{j<n} \varepsilon_j b_j (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L1]

The alternating sequence: ε0=1\varepsilon_0 = 1, εj+1=εj\varepsilon_{j+1} = -\varepsilon_j, εj=1|\varepsilon_j| = 1; e0=0e_0 = 0, ej+1=ej+2e_{j+1} = e_j + 2, o0=1o_0 = 1, oj+1=oj+2o_{j+1} = o_j + 2; εej=1\varepsilon_{e_j} = 1 and εoj=1\varepsilon_{o_j} = -1 (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).

[L2]

The canonical naturals are positive for n1n \ge 1 and strictly increasing; reciprocation reverses the order on the positives; and for every real ε>0\varepsilon > 0 there is n1n \ge 1 with 1/ι(n)<ε1/\iota(n) < \varepsilon (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon).

[L4]

k11/kp\sum_{k\ge1} 1/k^{p} converges if and only if p>1p > 1, with ι(k)1=ι(k)\iota(k)^{1} = \iota(k); and k1xk\sum_{k\ge1}x_k is the series of jxj+1j \mapsto x_{j+1} (For rational p>0p > 0, 1/kp\sum 1/k^p converges iff p>1p > 1, Rational powers ara^r of a positive base, Existence and uniqueness of nn-th roots: a unique a1/n0a^{1/n} \ge 0 with (a1/n)n=a(a^{1/n})^n = a, Integer powers ama^m, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L5]

Absolute value: xy=xy|xy| = |x|\,|y| (Basic properties of the absolute value).

[L6]

Partial sums: t0=0t_0 = 0 and tn+1=tn+εnbnt_{n+1} = t_n + \varepsilon_n b_n (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L7]

Verification

technique · direct
1.1

Every bj=1/ι(j+1)b_j = 1/\iota(j+1) is positive, and (bj)(b_j) is nonincreasing, since 0<ι(j+1)<ι(j+2)0 < \iota(j+1) < \iota(j+2).

givenL2
1.2

By [L1], e1=2e_1 = 2, e2=4e_2 = 4, o1=3o_1 = 3; and by [L6] together with εej=1\varepsilon_{e_j} = 1, εoj=1\varepsilon_{o_j} = -1, the first partial sums are t1=b0=1t_1 = b_0 = 1, t2=11/2=1/2t_2 = 1 - 1/2 = 1/2, t3=1/2+1/3=5/6t_3 = 1/2 + 1/3 = 5/6 and t4=5/61/4=7/12t_4 = 5/6 - 1/4 = 7/12.

L1L6algebra
2.1

(bj)(b_j) converges to 00: given a rational ε>0\varepsilon > 0, take n1n \ge 1 with 1/ι(n)<ε1/\iota(n) < \varepsilon; for jnj \ge n one has ι(j+1)ι(n)>0\iota(j+1) \ge \iota(n) > 0, so bj1/ι(n)<εb_j \le 1/\iota(n) < \varepsilon.

step 1.1L2
2.2

For every jj, εjbj=εjbj=1/ι(j+1)|\varepsilon_j b_j| = |\varepsilon_j|\,b_j = 1/\iota(j+1), and j1/ι(j+1)\sum_j 1/\iota(j+1) is the pp-series k11/k\sum_{k\ge1}1/k at p=1p = 1, which diverges.

step 1.1L1L4L5
3.1

By the alternating series test the series converges; write SS for its sum, and tejStojt_{e_j} \le S \le t_{o_j} holds for every jj.

step 1.1step 2.1L3
4.1

Taking j=2j = 2 in the lower bound and j=1j = 1 in the upper bound of step 3.1 gives 7/12=t4=te2Sto1=t3=5/67/12 = t_4 = t_{e_2} \le S \le t_{o_1} = t_3 = 5/6.

step 3.1step 1.2
5.1

Since 1/2<7/121/2 < 7/12 and 5/6<15/6 < 1, the sum satisfies 1/2<S<11/2 < S < 1.

step 4.1algebra
6.1

So the series converges while its series of absolute values diverges: it converges conditionally, with sum strictly between 1/21/2 and 11.

step 3.1step 5.1step 2.2L7

Remarks

  • The bracketing is exactly the error bound of the test, used twice. Any pair of an even-index and an odd-index partial sum brackets SS, and the further out the pair is taken the tighter the bracket becomes; t4t_4 and t3t_3 are simply the first pair whose values separate SS strictly from 1/21/2 and from 11. Taking t2=1/2t_2 = 1/2 and t1=1t_1 = 1 would give only the non-strict bounds.

  • Conditional convergence is a statement about cancellation. The terms have absolute value 1/(j+1)1/(j+1) and their sum without signs is infinite; the series converges only because consecutive terms nearly cancel. Everything that follows on this page, that the terms may be reordered to sum to anything at all, is a consequence of exactly that.

  • What the bracket does not say. It gives no rate and no closed form. Better numerical bounds come from later pairs tej,tojt_{e_j}, t_{o_j} and cost only arithmetic; the closed form costs the logarithm.

Depends on

Used by

Dependency tree · next 3 levels

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