Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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(11/(j+2))\prod_{j \ge 0} \bigl(1 - 1/(j+2)\bigr) has partial products 1/(n+1)1/(n+1), which tend to 00, so the product does not converge in the sense used here

Example

Put pj:=1/ι(j+2)p_j := 1/\iota(j+2), so 0<pj1/2<10 < p_j \le 1/2 < 1, and consider

j0(11j+2)  =  j0ι(j+1)ι(j+2)  =  122334\prod_{j \ge 0}\Bigl(1 - \frac{1}{j+2}\Bigr) \;=\; \prod_{j \ge 0}\frac{\iota(j+1)}{\iota(j+2)} \;=\; \frac12 \cdot \frac23 \cdot \frac34 \cdots

Its partial products telescope:

j<n(11ι(j+2))  =  1ι(n+1)(nN),\prod_{j<n}\Bigl(1 - \frac{1}{\iota(j+2)}\Bigr) \;=\; \frac{1}{\iota(n+1)} \qquad (n \in \mathbb{N}),

so they tend to 00. Every factor is nonzero, and yet the product does not converge in the sense of Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors, because no tail of it has partial products with a nonzero limit.

This is the example the definition of a convergent infinite product is written to exclude, and Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors names it for that purpose. Were a limit of 00 admitted, this product would "converge to 00" with no factor equal to 00, and a convergent product could no longer be divided by.

The behaviour is also exactly what 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 predicts: jpj\sum_j p_j is a tail of the harmonic series and diverges, so the partial products of (1pj)\prod(1-p_j) tend to 00.

Facts & Assumptions

Given: The sequence pj=1/ι(j+2)p_j = 1/\iota(j+2) and the partial products Qn=j<n(1pj)Q_n = \prod_{j<n}(1 - p_j).

[L1]

Finite products: j<0xj=1\prod_{j<0}x_j = 1 and 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; a finite product of positive factors is positive (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L2]

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

[L3]

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

[L4]

Convergence of an infinite product: some tail must have nonvanishing factors and partial products with a nonzero limit (Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors, Limits and Cauchy sequences of reals).

Verification

technique · direct
1.1

For every jj, ι(j+2)ι(2)=2>0\iota(j+2) \ge \iota(2) = 2 > 0, so 0<pj1/2<10 < p_j \le 1/2 < 1 and 1pj=ι(j+1)/ι(j+2)>01 - p_j = \iota(j+1)/\iota(j+2) > 0.

givenL2
2.1

An induction gives Qn=1/ι(n+1)Q_n = 1/\iota(n+1) for every nn: at n=0n = 0 the empty product is 1=1/ι(1)1 = 1/\iota(1); and Qn+1=Qn(1pn)=1ι(n+1)ι(n+1)ι(n+2)=1ι(n+2)Q_{n+1} = Q_n(1 - p_n) = \dfrac{1}{\iota(n+1)}\cdot\dfrac{\iota(n+1)}{\iota(n+2)} = \dfrac{1}{\iota(n+2)}.

step 1.1L1L2L3
2.2

The same conclusion follows from the general criterion: jpj=j1/ι(j+2)\sum_j p_j = \sum_j 1/\iota(j+2) is the first tail series of j1/ι(j+1)\sum_j 1/\iota(j+1), which is the harmonic series and diverges, so jpj\sum_j p_j diverges and the partial products of (1pj)\prod(1-p_j) tend to 00.

step 1.1L5L6
3.1

Hence Qn0Q_n \to 0: given a rational ε>0\varepsilon > 0, an n01n_0 \ge 1 with 1/ι(n0)<ε1/\iota(n_0) < \varepsilon gives 0<Qn=1/ι(n+1)1/ι(n0)<ε0 < Q_n = 1/\iota(n+1) \le 1/\iota(n_0) < \varepsilon for every nn0n \ge n_0.

step 2.1L2
4.1

For every NN the NN-th tail products satisfy j=NN+n1(1pj)=QN+n/QN\prod_{j=N}^{N+n-1}(1-p_j) = Q_{N+n}/Q_N, the finite product QNQ_N being positive; so they also tend to 00 as nn grows, QNQ_N being a fixed nonzero real.

step 1.1step 2.1step 3.1L1
5.1

Therefore no tail of the product has partial products with a nonzero limit, and j(1pj)\prod_j (1-p_j) does not converge, although every one of its factors is nonzero.

step 4.1L4
6.1

So the partial products are 1/ι(n+1)1/\iota(n+1), they tend to 00, and the product diverges in the sense of Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors.

step 2.1step 5.1step 2.2

Remarks

  • The telescoping is the reason the answer is exactly 1/(n+1)1/(n+1). Each factor is ι(j+1)/ι(j+2)\iota(j+1)/\iota(j+2), so consecutive numerators and denominators cancel and only the first numerator ι(1)=1\iota(1) = 1 and the last denominator ι(n+1)\iota(n+1) survive. Written informally, 1223nn+1=1n+1\tfrac12\cdot\tfrac23\cdots\tfrac{n}{n+1} = \tfrac{1}{n+1}.

  • Why a zero limit is excluded from the definition. If it were admitted, this product would have value 00 although no factor is 00; and then from ak=0\prod a_k = 0 one could infer nothing about the factors, whereas Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors arranges that a convergent product is 00 exactly when some factor is. The exclusion costs this one example and buys that.

  • The index shift is not decorative. Written as n1(11/n)\prod_{n \ge 1}(1 - 1/n) the same product begins with the factor 11/1=01 - 1/1 = 0; the shift to 11/(j+2)1 - 1/(j+2) is what keeps every factor nonzero, so that the failure is genuinely about the limit and not about a vanishing factor.

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 31 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