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

j0(1+(1)j/j+2)\prod_{j \ge 0} \bigl(1 + (-1)^{j}/\sqrt{j+2}\bigr) has partial products tending to 00 although j0(1)j/j+2\sum_{j \ge 0} (-1)^{j}/\sqrt{j+2} converges

Statement refuted

Refuted claim: if pk\sum p_k converges then (1+pk)\prod(1 + p_k) converges (Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors, Series, partial sums, convergence and the sum, divergence, and the tail series).

For nonnegative pkp_k this is true, and is For pk0p_k \ge 0 the product (1+pk)\prod (1 + p_k) converges iff pk\sum p_k converges, with 1+k<npkk<n(1+pk)1/(1k<npk)1 + \sum_{k<n} p_k \le \prod_{k<n}(1+p_k) \le 1/\bigl(1 - \sum_{k<n} p_k\bigr) when k<npk<1\sum_{k<n} p_k < 1; for 0pk<10 \le p_k < 1 the product (1pk)\prod (1 - p_k) converges iff pk\sum p_k converges and its partial products tend to 00 otherwise; and pk\sum |p_k| convergent implies (1+pk)\prod (1+p_k) convergent. For signed pkp_k it is false, and the witness is

pj  :=  (1)jι(j+2)(jN),p_j \;:=\; \frac{(-1)^{j}}{\sqrt{\iota(j+2)}} \qquad (j \in \mathbb{N}),

with  \sqrt{\ } the nonnegative square root (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}). The series jpj\sum_j p_j converges by the alternating series test. The factors 1+pj1 + p_j are all positive, since pj1/2<1|p_j| \le 1/\sqrt{2} < 1; nevertheless the partial products

Πm  =  j<m(1+(1)jj+2)\Pi_m \;=\; \prod_{j<m}\Bigl(1 + \frac{(-1)^{j}}{\sqrt{j+2}}\Bigr)

tend to 00, so no tail of the product has partial products with a nonzero limit and the product diverges.

The mechanism, and why no logarithm is needed. Consecutive factors are paired. With a=ι(2i+2)a = \iota(2i+2) and b=ι(2i+3)b = \iota(2i+3), so that ba=1b - a = 1,

(1+1a)(11b)  =  11ab(11a+b)    11ι(4i+6),\Bigl(1 + \frac{1}{\sqrt a}\Bigr)\Bigl(1 - \frac{1}{\sqrt b}\Bigr) \;=\; 1 - \frac{1}{\sqrt{ab}}\Bigl(1 - \frac{1}{\sqrt a + \sqrt b}\Bigr) \;\le\; 1 - \frac{1}{\iota(4i+6)} ,

and i1/ι(4i+6)\sum_i 1/\iota(4i+6) diverges. So the even partial products are dominated by i<n(11/ι(4i+6))\prod_{i<n}\bigl(1 - 1/\iota(4i+6)\bigr), which tends to 00 by For pk0p_k \ge 0 the product (1+pk)\prod (1 + p_k) converges iff pk\sum p_k converges, with 1+k<npkk<n(1+pk)1/(1k<npk)1 + \sum_{k<n} p_k \le \prod_{k<n}(1+p_k) \le 1/\bigl(1 - \sum_{k<n} p_k\bigr) when k<npk<1\sum_{k<n} p_k < 1; for 0pk<10 \le p_k < 1 the product (1pk)\prod (1 - p_k) converges iff pk\sum p_k converges and its partial products tend to 00 otherwise; and pk\sum |p_k| convergent implies (1+pk)\prod (1+p_k) convergent; the odd ones differ from them by one bounded factor.

Facts & Assumptions

Given: The alternating sequence (εj)(\varepsilon_j) with index maps ei=2ie_i = 2i and oi=2i+1o_i = 2i+1; the sequence pj=εj/ι(j+2)p_j = \varepsilon_j/\sqrt{\iota(j+2)}; the factors fj:=1+pjf_j := 1 + p_j; and the partial products Πm=j<mfj\Pi_m = \prod_{j<m} f_j.

[L1]

The alternating sequence: εei=1\varepsilon_{e_i} = 1, εoi=1\varepsilon_{o_i} = -1, εj=1|\varepsilon_j| = 1, e0=0e_0 = 0, ei+1=ei+2e_{i+1} = e_i + 2, oi=ei+1o_i = e_i + 1, and N\mathbb{N} is the disjoint union of the two ranges (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]

Square roots: every t0t \ge 0 has a unique t0\sqrt t \ge 0 with (t)2=t(\sqrt t)^2 = t; uv=uv\sqrt{uv} = \sqrt u \sqrt v and  \sqrt{\ } is strictly increasing on the nonnegative reals; and t=t1/2\sqrt t = t^{1/2} (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}, 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, Rational powers ara^r of a positive base).

[L3]

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

[L5]

AM-GM for two nonnegative reals: uv((u+v)/2)2uv \le ((u+v)/2)^{2} (The arithmetic mean, geometric mean inequality).

[L6]

Finite products: j<0xj=1\prod_{j<0}x_j = 1, j<n+1xj=(j<nxj)xn\prod_{j<n+1}x_j = \bigl(\prod_{j<n}x_j\bigr)x_n, splitting at an intermediate index, and a finite product of positive factors is positive (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L7]

The principle of induction on N\mathbb{N} (The principle of mathematical induction).

[L10]

The squeeze theorem (The squeeze theorem).

Counterexample

technique · direct
1.1

For every jj, ι(j+2)ι(2)=2\iota(j+2) \ge \iota(2) = 2, so ι(j+2)2>1\sqrt{\iota(j+2)} \ge \sqrt 2 > 1 and pj=1/ι(j+2)1/2<1|p_j| = 1/\sqrt{\iota(j+2)} \le 1/\sqrt 2 < 1; hence every factor satisfies 0<fj1+1/2<20 < f_j \le 1 + 1/\sqrt 2 < 2, and every Πm\Pi_m is positive.

givenL1L2L3L6
1.2

Fix ii and put a:=ι(2i+2)a := \iota(2i+2), b:=ι(2i+3)b := \iota(2i+3), so ba=1b - a = 1 and a+b=ι(4i+5)a + b = \iota(4i+5), both positive. By [L1], f2i=1+1/af_{2i} = 1 + 1/\sqrt a and f2i+1=11/bf_{2i+1} = 1 - 1/\sqrt b.

L1L3
1.3

An induction gives that finite products are monotone in nonnegative factors: if 0xiyi0 \le x_i \le y_i for all i<ni < n then i<nxii<nyi\prod_{i<n}x_i \le \prod_{i<n}y_i, since both products are nonnegative and i<n+1xi=(i<nxi)xn(i<nyi)xn(i<nyi)yn\prod_{i<n+1}x_i = \bigl(\prod_{i<n}x_i\bigr)x_n \le \bigl(\prod_{i<n}y_i\bigr)x_n \le \bigl(\prod_{i<n}y_i\bigr)y_n.

L6L7
2.1

The sequence βj:=1/ι(j+2)\beta_j := 1/\sqrt{\iota(j+2)} is positive, nonincreasing and converges to 00: monotonicity from 0<ι(j+2)<ι(j+3)0 < \iota(j+2) < \iota(j+3) and strict increase of the square root, and convergence because, given a rational ε>0\varepsilon > 0, an n1n \ge 1 with 1/ι(n)<ε21/\iota(n) < \varepsilon^{2} gives ι(j+2)>(1/ε)2\iota(j+2) > (1/\varepsilon)^{2} and so βj<ε\beta_j < \varepsilon for every jnj \ge n.

step 1.1L2L3
2.2

Since ba=(ba)/(a+b)=1/(a+b)\sqrt b - \sqrt a = (b-a)/(\sqrt a + \sqrt b) = 1/(\sqrt a + \sqrt b), one has 1a1b=baab=1ab(a+b)\dfrac1{\sqrt a} - \dfrac1{\sqrt b} = \dfrac{\sqrt b - \sqrt a}{\sqrt{a}\sqrt{b}} = \dfrac{1}{\sqrt{ab}\,(\sqrt a + \sqrt b)}, so Pi:=f2if2i+1=1+1a1b1ab=11ab(11a+b)P_i := f_{2i}f_{2i+1} = 1 + \dfrac1{\sqrt a} - \dfrac1{\sqrt b} - \dfrac1{\sqrt{ab}} = 1 - \dfrac{1}{\sqrt{ab}}\Bigl(1 - \dfrac{1}{\sqrt a + \sqrt b}\Bigr).

step 1.2L2algebra
2.3

Here a2>1\sqrt a \ge \sqrt 2 > 1 and b3>1\sqrt b \ge \sqrt 3 > 1, so a+b>2\sqrt a + \sqrt b > 2 and 11/(a+b)>1/21 - 1/(\sqrt a + \sqrt b) > 1/2; and by [L5], ab(a+b)/2=ι(4i+5)/2\sqrt{ab} \le (a+b)/2 = \iota(4i+5)/2, so 1/ab2/ι(4i+5)1/\sqrt{ab} \ge 2/\iota(4i+5).

step 1.2L2L3L5
2.4

An induction gives Π2n=i<nPi\Pi_{2n} = \prod_{i<n} P_i for every nn: at n=0n = 0 both are the empty product 11, and Π2(n+1)=Π2nf2nf2n+1=Π2nPn\Pi_{2(n+1)} = \Pi_{2n} f_{2n} f_{2n+1} = \Pi_{2n}P_n.

step 1.2L6L7
3.1

By the alternating series test jpj=jεjβj\sum_j p_j = \sum_j \varepsilon_j \beta_j converges.

step 2.1L4
3.2

Combining, Pi1(2/ι(4i+5))12=11/ι(4i+5)1qiP_i \le 1 - \bigl(2/\iota(4i+5)\bigr)\cdot\tfrac12 = 1 - 1/\iota(4i+5) \le 1 - q_i, where qi:=1/ι(4i+6)q_i := 1/\iota(4i+6), using ι(4i+5)<ι(4i+6)\iota(4i+5) < \iota(4i+6); and 0<Pi0 < P_i by step 1.1, while 0<qi<10 < q_i < 1.

step 1.1step 2.2step 2.3L3
4.1

Hence 0<Π2n=i<nPii<n(1qi)0 < \Pi_{2n} = \prod_{i<n}P_i \le \prod_{i<n}(1 - q_i) for every nn.

step 1.1step 3.2step 2.4step 1.3
4.2

The series iqi\sum_i q_i diverges: 6(i+1)=6i+64i+66(i+1) = 6i+6 \ge 4i+6, so ι(4i+6)6ι(i+1)\iota(4i+6) \le 6\,\iota(i+1) and qi161ι(i+1)q_i \ge \tfrac16\cdot\dfrac1{\iota(i+1)}; the series i161/ι(i+1)\sum_i \tfrac16 \cdot 1/\iota(i+1) diverges, being a nonzero multiple of the harmonic series, so iqi\sum_i q_i diverges by comparison.

step 3.2L3L9
5.1

By [L8] applied to (qi)(q_i), the partial products i<n(1qi)\prod_{i<n}(1-q_i) tend to 00; with step 4.1 and the squeeze, Π2n0\Pi_{2n} \to 0.

step 4.1step 4.2L8L10
6.1

Also Π2n+1=Π2nf2n\Pi_{2n+1} = \Pi_{2n} f_{2n} with 0<f2n<20 < f_{2n} < 2, so 0<Π2n+1<2Π2n0 < \Pi_{2n+1} < 2\,\Pi_{2n} and Π2n+10\Pi_{2n+1} \to 0 as well.

step 1.1step 5.1L6L10
7.1

Therefore Πm0\Pi_m \to 0: given a rational ε>0\varepsilon > 0, choose NN with Π2n<ε/2\Pi_{2n} < \varepsilon/2 for all nNn \ge N; then for m2N+1m \ge 2N+1, writing mm as 2n2n or 2n+12n+1 according to the partition of N\mathbb{N} by the two index maps, in either case nNn \ge N and Πm2Π2n<ε\Pi_m \le 2\Pi_{2n} < \varepsilon.

step 1.1step 5.1step 6.1L1
8.1

For every NN' the NN'-th tail products satisfy j=NN+n1fj=ΠN+n/ΠN\prod_{j=N'}^{N'+n-1}f_j = \Pi_{N'+n}/\Pi_{N'} with ΠN>0\Pi_{N'} > 0 fixed, so they tend to 00 too; no tail has partial products with a nonzero limit, and j(1+pj)\prod_j (1+p_j) diverges.

step 1.1step 7.1L6L11

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: 129 results over 32 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