TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass

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 $∣ r ∣ < 1$ , $\sum_{k \geq 0} r^{k} = 1 / (1 - r)$ , and for $∣ r ∣ \geq 1$ the series diverges

Statement

Let $r \in R$ and let $r^{k}$ be the integer power (Integer powers $a^{m}$ ), so that $r^{0} = 1$ for every $r$ , including $r = 0$ .

If $∣ r ∣ < 1$ then the series $\sum r^{k}$ converges (Series, partial sums, convergence and the sum, divergence, and the tail series) and $\sum_{k = 0}^{\infty} r^{k} = \frac{1}{1 - r} .$
If $∣ r ∣ \geq 1$ then $\sum r^{k}$ diverges.

The series starts at $k = 0$ and its first term is $r^{0} = 1$ ; in particular $\sum_{k = 0}^{\infty} 2^{- k} = 2$ , while the series starting at $k = 1$ sums to $1$ . Which starting index is meant has to be said, and it is said here.

Statement references

Integer powers $a^{m}$

Series, partial sums, convergence and the sum, divergence, and the tail series

Facts & Assumptions

Given: A real number $r$ , the integer powers $r^{k}$ (Integer powers $a^{m}$ ), and the partial sums $s_{n} = \sum_{k < n} r^{k}$ of $\sum r^{k}$ (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).

[L1]

Factorisation of a difference of powers: for $a, b \in R$ and natural $n \geq 1$ , $b^{n} - a^{n} = (b - a) \sum_{k = 0}^{n - 1} a^{k} b^{n - 1 - k}$ (Factorisation of $b^{n} - a^{n}$ , and the resulting Lipschitz estimate).

[L2]

For $∣ r ∣ < 1$ the sequence $(r^{k})$ is null, that is $r^{k} \to 0$ (For $∣ r ∣ < 1$ the sequence $r^{k}$ is null, and for $∣ r ∣ > 1$ the sequence $∣ r ∣^{k}$ diverges to $+ \infty$ ).

[L3]

Algebra of limits: sums, differences and quotients of convergent sequences converge to the corresponding combination, the quotient rule requiring a nonzero limit and nonzero denominators (Algebra of limits: sums, scalar multiples, products and quotients, Limits and Cauchy sequences of reals).

[L4]

Absolute value: $∣ x y ∣ = ∣ x ∣ ∣ y ∣$ , $∣ x ∣ \geq 0$ , and $∣ x ∣ = 0$ exactly when $x = 0$ ; also $∣ 1 ∣ = 1$ , since $1 > 0$ (The multiplicative identity is positive, Basic properties of the absolute value).

[L5]

Powers and order: $a^{0} = 1$ for every $a$ ; if $a \geq 1$ and $n \geq 1$ then $a^{n} \geq a \geq 1$ ; and $1^{n} = 1$ for every $n$ (Monotonicity of $x \mapsto x^{n}$ and of $n \mapsto a^{n}$ , Integer powers $a^{m}$ ).

[L6]

The principle of induction (The principle of mathematical induction).

[L7]

If a series converges then its terms tend to $0$ (If a series converges then its terms tend to $0$ ).

[L8]

Notation of Finite sums and finite products, by recursion: $\sum_{k = 0}^{n - 1} x_{k}$ is $\sum_{k < n} x_{k}$ , and the empty sum $\sum_{k < 0} x_{k}$ is $0$ .

[L9]

Integer-power laws: $(a b)^{k} = a^{k} b^{k}$ for natural $k$ ; if $a \neq 0$ , then $a^{k} \neq 0$ and $a^{- k} = (a^{k})^{- 1}$ , with $a^{0} = 1$ at $k = 0$ . (Laws of integer exponents, Integer powers $a^{m}$ ).

Proof

technique · cases

1.1assume-case lt

Assume $∣ r ∣ < 1$ .

1.2assume-case ge

Assume instead $∣ r ∣ \geq 1$ .

1.3L1L5L8

For every natural $n \geq 1$ , applying [L1] with $b = 1$ and $a = r$ gives $1 - r^{n} = (1 - r) \sum_{k = 0}^{n - 1} r^{k} \cdot 1^{n - 1 - k} = (1 - r) s_{n}$ , using $1^{m} = 1$ and the notation of [L8].

1.4L5L8

At $n = 0$ the identity $1 - r^{n} = (1 - r) s_{n}$ also holds, both sides being $0$ because $r^{0} = 1$ and $s_{0}$ is the empty sum.

2.1step 1.1L4algebra

In the case $∣ r ∣ < 1$ we have $r \neq 1$ , since $∣ 1 ∣ = 1$ and $∣ r ∣ < 1$ ; hence $1 - r \neq 0$ .

2.2step 1.2L4L5L6

In the case $∣ r ∣ \geq 1$ , an induction gives $∣ r^{k} ∣ = ∣ r ∣^{k}$ for every $k \in N$ : at $k = 0$ both sides are $1$ , and if $∣ r^{k} ∣ = ∣ r ∣^{k}$ then $∣ r^{k + 1} ∣ = ∣ r^{k} \cdot r ∣ = ∣ r^{k} ∣ ∣ r ∣ = ∣ r ∣^{k} ∣ r ∣ = ∣ r ∣^{k + 1}$ .

2.3step 1.2L5

In the case $∣ r ∣ \geq 1$ we get $∣ r ∣^{k} \geq 1$ for every $k \in N$ : at $k = 0$ this reads $1 \geq 1$ , and for $k \geq 1$ it is the comparison $∣ r ∣^{k} \geq ∣ r ∣ \geq 1$ .

3.1step 2.1step 1.3step 1.4algebra

In the case $∣ r ∣ < 1$ , dividing by $1 - r \neq 0$ gives $s_{n} = (1 - r^{n}) / (1 - r)$ for every $n \in N$ .

3.2step 2.2step 2.3

In the case $∣ r ∣ \geq 1$ , combining the two previous steps gives $∣ r^{k} - 0 ∣ = ∣ r^{k} ∣ = ∣ r ∣^{k} \geq 1$ for every $k \in N$ .

4.1step 1.1step 3.1step 2.1L2L3

In the case $∣ r ∣ < 1$ the sequence $(r^{n})$ is null, so $1 - r^{n} \to 1$ and therefore $s_{n} \to 1 / (1 - r)$ , the denominator being the nonzero constant $1 - r$ ; hence $\sum r^{k}$ converges with sum $1 / (1 - r)$ , which is claim 1.

4.2step 3.2L7

In the case $∣ r ∣ \geq 1$ the sequence $(r^{k})$ does not converge to $0$ , since the rational tolerance $ε = 1$ admits no index $K$ with $∣ r^{k} - 0 ∣ < 1$ for all $k \geq K$ ; so by the term test $\sum r^{k}$ diverges, which is claim 2.

4.3L3L5L8L9step 4.1algebra

For the stated special case, $(1 / 2)^{0} = 2^{0} = 1$ . For every natural $k \geq 1$ , [L9] gives $2^{k} (1 / 2)^{k} = (2 (1 / 2))^{k} = 1^{k} = 1$ , so $(1 / 2)^{k} = (2^{k})^{- 1} = 2^{- k}$ . Applying step 4.1 at $r = 1 / 2$ gives $\sum_{k = 0}^{\infty} 2^{- k} = \sum_{k = 0}^{\infty} (1 / 2)^{k} = 1 / (1 - 1 / 2) = 2$ . The partial sums starting at $k = 1$ are the corresponding partial sums starting at $k = 0$ minus their first term $2^{0} = 1$ ; [L3] therefore gives $\sum_{k = 1}^{\infty} 2^{- k} = 2 - 1 = 1$ .

5.1step 4.1step 4.2step 4.3cases-exhaustive∎

The two cases $∣ r ∣ < 1$ and $∣ r ∣ \geq 1$ exhaust the possibilities, since the order on $R$ is total, so claims 1 and 2 together cover every real $r$ ; step 4.3 proves the two stated special sums and their starting indices.

Remarks

The divergence half needs no separate treatment of $r = 1$ and $r = - 1$ . Both are covered by $∣ r ∣ \geq 1$ , and the single reason is the same in every case: the terms have absolute value at least $1$ , so they cannot tend to $0$ . For $r = 1$ the partial sums are $s_{n} = n$ and run to $+ \infty$ ; for $r = - 1$ they oscillate between $0$ and $1$ . The theorem says only that neither converges, which is all that "diverges" means here (Series, partial sums, convergence and the sum, divergence, and the tail series).
Why the identity is proved at $n = 0$ separately. Factorisation of $b^{n} - a^{n}$ , and the resulting Lipschitz estimate requires $n \geq 1$ , since its right-hand side is a sum over $k < n$ of a term involving $b^{n - 1 - k}$ , and $n - 1$ is not a natural number at $n = 0$ . The identity is still true at $n = 0$ , but by inspection of two empty objects rather than by that lemma, and step 1.4 says so rather than letting the reader assume the citation covers it.

For $∣ r ∣ < 1$ , $\sum_{k \geq 0} r^{k} = 1 / (1 - r)$ , and for $∣ r ∣ \geq 1$ the series diverges

Statement

Statement references

Facts & Assumptions

Proof

Remarks

Depends on

Dependency tree · 2 levels

Sources

For ∣r∣<1∣r∣<1, ∑k≥0rk=1/(1−r)∑k≥0​rk=1/(1−r), and for ∣r∣≥1∣r∣≥1 the series diverges

Statement

Statement references

Facts & Assumptions

Proof

Remarks

Depends on

Dependency tree · 2 levels

Sources

For $∣ r ∣ < 1$ , $\sum_{k \geq 0} r^{k} = 1 / (1 - r)$ , and for $∣ r ∣ \geq 1$ the series diverges