TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)

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.

For $p_k \ge 0$ the product $\prod (1 + p_k)$ converges iff $\sum p_k$ converges, with $1 + \sum_{k<n} p_k \le \prod_{k<n}(1+p_k) \le 1/\bigl(1 - \sum_{k<n} p_k\bigr)$ when $\sum_{k<n} p_k < 1$ ; for $0 \le p_k < 1$ the product $\prod (1 - p_k)$ converges iff $\sum p_k$ converges and its partial products tend to $0$ otherwise; and $\sum |p_k|$ convergent implies $\prod (1+p_k)$ convergent

Statement

Write $S_n := \sum_{k<n} p_k$ and $\Pi_n := \prod_{k<n}(1+p_k)$ , $Q_n := \prod_{k<n}(1-p_k)$ (Finite sums and finite products, by recursion, Series, partial sums, convergence and the sum, divergence, and the tail series, Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors).

Elementary inequalities. Let $p_k \ge 0$ for every $k$ . Then for every $n \in \mathbb{N}$ : $1 + S_n \;\le\; \Pi_n, \qquad\text{and}\qquad \Pi_n \;\le\; \frac{1}{1 - S_n} \ \text{ whenever } S_n < 1 ;$ and if in addition $p_k \le 1$ for every $k$ , then $1 - S_n \;\le\; Q_n \qquad\text{and}\qquad Q_n\,\Pi_n \le 1, \ \text{ hence } \ Q_n \le \frac{1}{1 + S_n} .$
The nonnegative criterion. Let $p_k \ge 0$ for every $k$ . Then $\prod (1 + p_k)$ converges if and only if $\sum p_k$ converges.
The $(1-p_k)$ form. Let $0 \le p_k < 1$ for every $k$ . Then $\prod (1 - p_k)$ converges if and only if $\sum p_k$ converges; and if $\sum p_k$ diverges then $Q_n \to 0$ , so that no tail of the product has partial products with a nonzero limit.
Absolute convergence. Let $(p_k)$ be an arbitrary sequence of reals with $\sum |p_k|$ convergent. Then $\prod (1 + p_k)$ converges.

No logarithm occurs anywhere. The exponential and the logarithm, through which these criteria are usually derived, are later in the reading order; every inequality above is an induction on finite products. The refinement that decides $\prod(1+p_k)$ for signed $p_k$ with $\sum p_k$ convergent, in terms of the convergence of $\sum p_k^2$ , does need the logarithm and is not stated here; see Selected sums and products on this page that are proved to exist without being evaluated, and what their evaluation waits for.

Facts & Assumptions

Given: A sequence $(p_k)$ of reals, with $S_n = \sum_{k<n}p_k$ , $\Pi_n = \prod_{k<n}(1+p_k)$ and $Q_n = \prod_{k<n}(1-p_k)$ .

[L1]

Finite sums and products: $\sum_{k<0}x_k = 0$ , $\prod_{k<0}x_k = 1$ , $\sum_{k<n+1}x_k = \sum_{k<n}x_k + x_n$ , $\prod_{k<n+1}x_k = \bigl(\prod_{k<n}x_k\bigr)x_n$ , splitting at an intermediate index, and $\prod_{k<n}(x_ky_k) = \bigl(\prod_{k<n}x_k\bigr)\bigl(\prod_{k<n}y_k\bigr)$ ; a finite product of nonnegative factors is nonnegative and of positive factors is positive (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L2]

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

[L3]

For a series of nonnegative terms: convergence is equivalent to the range of the partial sums being bounded above, the sum is then the supremum and every partial sum is at most the sum, and if the range is unbounded the partial sums diverge to $+\infty$ (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Divergence to $+\infty$ and to $-\infty$ ).

[L4]

A series converges if and only if some tail series converges, and then the sum equals the initial partial sum plus the tail sum (A series converges iff each of its tail series converges, and the sum splits as $s_N$ plus the $N$ -th tail).

[L5]

A nondecreasing sequence bounded above converges, and a nonincreasing sequence bounded below converges; a monotone sequence converges if and only if it is bounded (A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum, A monotone sequence converges if and only if it is bounded, Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L6]

Order and inverses: $0 < a < b$ implies $0 < 1/b < 1/a$ , and $a > 0$ implies $1/a > 0$ (Inverses of positives are positive, and reciprocation reverses order).

[L7]

Absolute value: $|xy| = |x|\,|y|$ , $|x| \ge 0$ , $-|x| \le x \le |x|$ , and $|x + y| \le |x| + |y|$ (Basic properties of the absolute value).

[L8]

Algebra of limits, and limits preserve non-strict inequalities holding eventually (Algebra of limits: sums, scalar multiples, products and quotients, Limits preserve non-strict inequalities, Limits and Cauchy sequences of reals).

[L9]

The squeeze theorem (The squeeze theorem).

[L10]

Every Cauchy sequence of reals converges (The reals are complete, Limits and Cauchy sequences of reals).

[L11]

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

Proof

technique · direct

1.1

Assume $p_k \ge 0$ for every $k$ . An induction gives $1 + S_n \le \Pi_n$ : at $n = 0$ both sides are $1$ ; and if $1 + S_n \le \Pi_n$ then, since $1 + S_n \ge 1 > 0$ and $1 + p_n \ge 1 > 0$ , $\Pi_{n+1} = \Pi_n(1+p_n) \ge (1+S_n)(1+p_n) = 1 + S_n + p_n + S_n p_n \ge 1 + S_{n+1}$ .

givenL1L2

1.2

Assume further $p_k \le 1$ for every $k$ . An induction gives $1 - S_n \le Q_n$ : at $n=0$ both sides are $1$ ; and if $1 - S_n \le Q_n$ then, since $1 - p_n \ge 0$ , $Q_{n+1} = Q_n(1-p_n) \ge (1-S_n)(1-p_n) = 1 - S_n - p_n + S_np_n \ge 1 - S_{n+1}$ .

givenL1L2

1.3

Assume $p_k \ge 0$ and $\sum p_k$ convergent, with sum $L$ . By [L3] and [L4] the tail sums $L - S_N$ tend to $0$ , so fix $N$ with $\sum_{k \ge N} p_k < 1/2$ .

givenL3L4choose

1.4

Three inductions on finite products, valid for arbitrary reals $x_k, y_k, z_k$ : first, $\bigl|\prod_{k<n}x_k\bigr| = \prod_{k<n}|x_k|$ , from $|xy| = |x||y|$ and $|1| = 1$ ; second, if $0 \le x_k \le y_k$ for all $k<n$ then $\prod_{k<n}x_k \le \prod_{k<n}y_k$ , since the products are nonnegative and $\prod_{k<n+1}x_k = (\prod_{k<n}x_k)x_n \le (\prod_{k<n}y_k)x_n \le (\prod_{k<n}y_k)y_n$ ; third, $\bigl|\prod_{k<n}(1+z_k) - 1\bigr| \le \prod_{k<n}(1+|z_k|) - 1$ , since at $n=0$ both sides are $0$ and $\bigl|\prod_{k<n+1}(1+z_k) - 1\bigr| = \bigl|(\prod_{k<n}(1+z_k) - 1)(1+z_n) + z_n\bigr| \le (\prod_{k<n}(1+|z_k|) - 1)(1+|z_n|) + |z_n| = \prod_{k<n+1}(1+|z_k|) - 1$ .

L1L2L7

1.5

Assume $\sum |p_k|$ converges, with sum $L$ , and fix $N$ with $\tau_N := \sum_{k \ge N}|p_k| < 1/2$ ; write $\tau_{N+n} = \sum_{k \ge N+n}|p_k|$ , so $\tau_{N+n} \to 0$ and $\sum_{j<m}|p_{N+j}| \le \tau_N$ for every $m$ . For $k \ge N$ we get $|p_k| \le \tau_N < 1/2$ , so $1 + p_k \ge 1/2 > 0$ and every factor from $N$ on is nonzero.

givenL3L4L7choose

2.1

An induction gives: for every $n$ with $S_n < 1$ , $\Pi_n(1 - S_n) \le 1$ . At $n = 0$ this reads $1 \cdot 1 \le 1$ . Suppose it holds at $n$ and $S_{n+1} < 1$ ; then $S_n \le S_{n+1} < 1$ , so $\Pi_n \le 1/(1-S_n)$ by [L6], and $\Pi_{n+1} = \Pi_n(1+p_n) \le (1+p_n)/(1-S_n)$ . Multiplying out, $(1+p_n)(1 - S_n - p_n) = 1 - S_n - p_nS_n - p_n^2 \le 1 - S_n$ , and dividing by the positive $(1-S_n)(1-S_{n+1})$ turns this into $(1+p_n)/(1-S_n) \le 1/(1-S_{n+1})$ .

givenstep 1.1L1L2L6

2.2

Under the same assumption, $Q_n \Pi_n = \prod_{k<n}(1-p_k)(1+p_k) = \prod_{k<n}(1 - p_k^2) \le 1$ , the last step by the induction: the empty product is $1$ , and multiplying a value in $[0,1]$ by a factor $1 - p_n^2 \in [0,1]$ again gives a value in $[0,1]$ . Since $\Pi_n \ge 1 + S_n \ge 1 > 0$ , dividing gives $Q_n \le 1/\Pi_n \le 1/(1+S_n)$ . This completes claim 1.

step 1.1step 1.2L1L2L6

2.3

Assume $0 \le p_k < 1$ and $\sum p_k$ convergent. Fix $N$ with $\sum_{k \ge N}p_k < 1/2$ as in step 1.3. By step 1.2 applied to the shifted sequence, $U_n := \prod_{j<n}(1 - p_{N+j}) \ge 1 - \sum_{j<n}p_{N+j} \ge 1/2$ for every $n$ ; and $(U_n)$ is nonincreasing, each factor lying in $(0,1]$ . So $(U_n)$ converges to a limit $\ge 1/2 > 0$ , and every factor $1 - p_k$ is positive, hence nonzero; $\prod(1-p_k)$ converges.

step 1.2step 1.3L1L5L8L11

3.1

For the shifted sequence $j \mapsto p_{N+j}$ , whose partial sums are at most $1/2 < 1$ , step 2.1 gives $T_n := \prod_{j<n}(1+p_{N+j}) \le 1/(1 - 1/2) = 2$ for every $n$ , and step 1.1 gives $T_n \ge 1$ . The sequence $(T_n)$ is nondecreasing, each factor being at least $1$ , so it converges to a limit $\ell$ with $1 \le \ell \le 2$ ; in particular $\ell \ne 0$ , and every factor $1 + p_k$ is at least $1$ , hence nonzero. So $\prod(1+p_k)$ converges.

step 1.1step 2.1step 1.3L1L5L8L11

3.2

Assume instead $0 \le p_k < 1$ and $\sum p_k$ divergent. Then $S_n \to +\infty$ by [L3], so given a real $\varepsilon > 0$ there is $K$ with $S_n > 1/\varepsilon$ for $n \ge K$ , whence $0 < 1/(1+S_n) < \varepsilon$ ; thus $1/(1+S_n) \to 0$ . By step 2.2, $0 \le Q_n \le 1/(1+S_n)$ , so $Q_n \to 0$ by the squeeze.

step 2.2L3L6L9

3.3

Put $T_n := \prod_{j<n}(1+p_{N+j})$ . By step 1.4 and step 2.1 applied to the nonnegative sequence $j \mapsto |p_{N+j}|$ , $|T_n| \le \prod_{j<n}(1+|p_{N+j}|) \le 1/(1-\tau_N) \le 2$ ; and by step 1.4 and step 1.2, $T_n \ge \prod_{j<n}(1 - |p_{N+j}|) \ge 1 - \tau_N \ge 1/2$ , each factor $1 + p_{N+j} \ge 1 - |p_{N+j}| \ge 0$ .

step 2.1step 1.2step 1.4step 1.5L1L7

4.1

Conversely assume $p_k \ge 0$ and $\prod(1+p_k)$ convergent, with $N$ as in [L11]. Since $\Pi_n = \bigl(\prod_{k<N}(1+p_k)\bigr) T_{n-N}$ for $n \ge N$ and $(T_m)$ converges, the sequence $(\Pi_n)$ converges, hence is bounded, say $\Pi_n \le M$ for all $n$ . By step 1.1, $1 + S_n \le M$ for every $n$ , so the partial sums of the nonnegative series $\sum p_k$ are bounded above and $\sum p_k$ converges. Claim 2 is step 3.1 together with this.

step 1.1step 3.1L1L3L5L11

4.2

In that situation the product diverges: for any $N$ , $Q_{N+n} = \bigl(\prod_{k<N}(1-p_k)\bigr)U_n$ with $\prod_{k<N}(1-p_k) > 0$ , so $U_n = Q_{N+n}/\prod_{k<N}(1-p_k) \to 0$ and no tail has partial products with a nonzero limit. With step 2.3 this proves claim 3.

step 2.3step 3.2L1L8L11

4.3

For $m > n$ , splitting the product gives $T_m = T_n \prod_{j=n}^{m-1}(1+p_{N+j})$ , so $|T_m - T_n| = |T_n|\,\bigl|\prod_{j=n}^{m-1}(1+p_{N+j}) - 1\bigr| \le 2\Bigl(\prod_{j=n}^{m-1}(1+|p_{N+j}|) - 1\Bigr) \le 2\Bigl(\frac{1}{1 - \tau_{N+n}} - 1\Bigr) = \frac{2\tau_{N+n}}{1 - \tau_{N+n}} \le 4\,\tau_{N+n}$ , using step 2.1 for the shifted sequence from $N+n$ , whose partial sums are at most $\tau_{N+n} \le \tau_N < 1/2$ .

step 2.1step 1.4step 1.5step 3.3L1L6L7

5.1

Since $\tau_{N+n} \to 0$ , step 4.3 makes $(T_n)$ a Cauchy sequence, so it converges, to a limit $\ell$ ; and $\ell \ge 1/2 > 0$ by step 3.3 and [L8]. Hence $\prod(1+p_k)$ converges, which is claim 4.

step 1.5step 3.3step 4.3L8L10L11∎

Remarks

Why the two bounds of claim 1 are the right pair. The lower bound $1 + S_n \le \Pi_n$ is the Weierstrass product inequality and forces divergence of the product when $\sum p_k$ diverges; the upper bound $\Pi_n \le 1/(1-S_n)$ , available once the partial sums are below $1$ , forces convergence when $\sum p_k$ converges. Between them they prove claim 2 with no further input, and they are exactly what a logarithm would otherwise supply.
The strict inequality $p_k<1$ keeps this proof uniform, but the tail-based definition allows a slightly stronger statement. Claim 3 remains true for $0\le p_k\le1$ . If only finitely many $p_k$ equal $1$ , start the product after the last zero factor; if infinitely many do, then $\sum p_k$ diverges and no tail has all factors nonzero. The stated strict form avoids this finite/infinite split.
Claim 4 does not identify the value, and the converse fails. Absolute convergence of $\sum p_k$ gives convergence of $\prod(1+p_k)$ , but convergence of $\sum p_k$ alone does not: the companion examples page exhibits $\sum_{j\ge0}(-1)^j/\sqrt{j+2}$ convergent while the corresponding partial products tend to $0$ . What separates the two cases is the convergence of $\sum p_k^2$ , a criterion that needs the logarithm and is deferred.
Where the Cauchy criterion enters and why nothing cheaper would do. In claim 4 the factors have no sign, so the partial products are not monotone and A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum is unavailable; the estimate of step 4.3 is a Cauchy estimate and is closed by completeness of $\mathbb{R}$ .

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 97 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

Infinite product (Wikipedia) (standard reference, not scraped)
Weierstrass product inequality (Wikipedia) (standard reference, not scraped)
Thomson, Bruckner, and Bruckner, Elementary Real Analysis (standard reference, not scraped)
D. Dikranjan, Analysis 478, Chapter 6 (standard reference, not scraped)