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

j0(1)j(j+3)/(j+1)2\sum_{j \ge 0} (-1)^{j}\,(j+3)/(j+1)^{2} converges, by Abel's test with the monotone bounded factor (j+3)/(j+1)(j+3)/(j+1)

Example

Put

aj:=(1)jι(j+1),bj:=ι(j+3)ι(j+1)(jN),a_j := \frac{(-1)^j}{\iota(j+1)}, \qquad b_j := \frac{\iota(j+3)}{\iota(j+1)} \qquad (j \in \mathbb{N}),

so that

ajbj  =  (1)jι(j+3)ι(j+1)2.a_j b_j \;=\; \frac{(-1)^j\,\iota(j+3)}{\iota(j+1)^{2}} .

Then jaj\sum_j a_j is the alternating harmonic series, which converges (j0(1)j/(j+1)\sum_{j \ge 0} (-1)^{j}/(j+1) converges conditionally, with sum strictly between 1/21/2 and 11), while (bj)(b_j) is nonincreasing (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences) and bounded, with 1<bj31 < b_j \le 3. By Abel's test (Abel's test: if ak\sum a_k converges and (bk)(b_k) is monotone and bounded then akbk\sum a_k b_k converges) the series

j0(1)j(j+3)(j+1)2\sum_{j \ge 0} \frac{(-1)^{j}\,(j+3)}{(j+1)^{2}}

converges.

Neither of the two earlier tests reaches it as directly. The alternating series test: if (bk)(b_k) is nonincreasing with bk0b_k \to 0 then k(1)kbk\sum_{k} (-1)^{k} b_k converges, the sum lies between any two consecutive partial sums, and the error after nn terms is at most bnb_n would require the sequence ι(j+3)/ι(j+1)2\iota(j+3)/\iota(j+1)^{2} to be nonincreasing, which is true but is an extra computation; Dirichlet's test: if the partial sums of ak\sum a_k are bounded and (bk)(b_k) is nonincreasing with bk0b_k \to 0, then akbk\sum a_k b_k converges would require a factor tending to 00, and bj10b_j \to 1 \ne 0. Abel's test is designed for exactly this shape: a convergent series multiplied by a monotone bounded factor.

Facts & Assumptions

Given: The sequences aj=(1)j/ι(j+1)a_j = (-1)^j/\iota(j+1) and bj=ι(j+3)/ι(j+1)b_j = \iota(j+3)/\iota(j+1).

[L2]

The canonical naturals are positive for n1n \ge 1 and strictly increasing, and ι(m+n)=ι(m)+ι(n)\iota(m+n) = \iota(m)+\iota(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]

Integer powers: x2=xxx^{2} = x\cdot x (Integer powers ama^m, Laws of integer exponents).

Verification

technique · direct
1.1

For every jj, ι(j+3)=ι(j+1)+2\iota(j+3) = \iota(j+1) + 2, so bj=1+2/ι(j+1)b_j = 1 + 2/\iota(j+1), the canonical natural ι(j+1)\iota(j+1) being positive.

givenL2
1.2

For every jj, ajbj=(1)jι(j+1)ι(j+3)ι(j+1)=(1)jι(j+3)ι(j+1)2a_j b_j = \dfrac{(-1)^j}{\iota(j+1)}\cdot\dfrac{\iota(j+3)}{\iota(j+1)} = \dfrac{(-1)^j \iota(j+3)}{\iota(j+1)^{2}}.

givenL4
2.1

The sequence (bj)(b_j) is nonincreasing: 0<ι(j+1)<ι(j+2)0 < \iota(j+1) < \iota(j+2) gives 2/ι(j+2)<2/ι(j+1)2/\iota(j+2) < 2/\iota(j+1), hence bj+1<bjb_{j+1} < b_j.

step 1.1L2
3.1

The sequence (bj)(b_j) is bounded, with 1<bjb0=1+2=31 < b_j \le b_0 = 1 + 2 = 3: the lower bound because 2/ι(j+1)>02/\iota(j+1) > 0, the upper because (bj)(b_j) is nonincreasing.

step 1.1step 2.1L2
4.1

By [L1] the series jaj\sum_j a_j converges, and by step 2.1 and step 3.1 the sequence (bj)(b_j) is monotone and bounded; so by Abel's test jajbj\sum_j a_j b_j converges.

step 2.1step 3.1L1L3
5.1

By step 1.2 that series is j0(1)j(j+3)/(j+1)2\sum_{j\ge0}(-1)^j(j+3)/(j+1)^{2}, which therefore converges.

step 1.2step 4.1

Remarks

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: 112 results over 28 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