LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)

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 positive terms, null and divergence to $+ \infty$ are reciprocal

Statement

Let $(x_{k})$ be a sequence of reals with $x_{k} > 0$ for every $k \in N$ (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Order on the reals). Then

$(x_{k}) converges to 0 ⟺ (1 / x_{k}) diverges to + \infty,$

with convergence as in Limits and Cauchy sequences of reals and divergence to $+ \infty$ as in Divergence to $+ \infty$ and to $- \infty$ .

The positivity hypothesis is essential and is not a convenience; see the remarks.

Facts & Assumptions

Given: A sequence $(x_{k})$ of reals with $x_{k} > 0$ for every $k$ , so that each $x_{k}$ is nonzero and $1 / x_{k}$ is defined (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Order on the reals, Field).

[L1]

Convergence, quantified over rational $ε > 0$ (Limits and Cauchy sequences of reals); divergence to $+ \infty$ , quantified over real $M$ (Divergence to $+ \infty$ and to $- \infty$ ).

[L2]

Inverses and order: $a > 0$ implies $a^{- 1} > 0$ , and $0 < a < b$ implies $0 < b^{- 1} < a^{- 1}$ (Inverses of positives are positive, and reciprocation reverses order).

[L3]

The involution $(u^{- 1})^{- 1} = u$ for $u \neq 0$ , from uniqueness of multiplicative inverses (Field).

[L4]

Absolute value: $∣ u ∣ = u$ when $u \geq 0$ , and $∣ u - 0 ∣ = ∣ u ∣$ (Basic properties of the absolute value, Order on the reals).

[L5]

Small rationals: for every real $η > 0$ there is a rational $ε$ with $0 < ε < η$ , by density (The rationals embed densely in the reals) or by the Archimedean property (Every complete ordered field is Archimedean) applied to $1 / η$ .

[L6]

Order arithmetic in $R$ : trichotomy and transitivity, and $u > 0 \geq M$ gives $u > M$ (Complete ordered field (least-upper-bound property), Ordered field).

Proof

technique · direct

1.1

Since $x_{k} > 0$ we have $∣ x_{k} ∣ = x_{k}$ and, by [L2], $1 / x_{k} > 0$ , for every $k$ .

L2L4

2.1

Forward direction. Assume $(x_{k})$ converges to $0$ and let $M \in R$ be arbitrary. If $M \leq 0$ , then $1 / x_{k} > 0 \geq M$ for every $k$ by step 1.1, so the threshold $K = 0$ works. If $M > 0$ , then $1 / M > 0$ by [L2]; by [L5] choose a rational $ε$ with $0 < ε < 1 / M$ , and by [L1] take $K$ with $∣ x_{k} - 0 ∣ < ε$ for all $k \geq K$ ; for such $k$ , step 1.1 gives $0 < x_{k} = ∣ x_{k} ∣ < ε < 1 / M$ , and applying [L2] to $0 < x_{k} < 1 / M$ gives $1 / x_{k} > (1 / M)^{- 1} = M$ by [L3]. In both cases there is $K$ with $1 / x_{k} > M$ for all $k \geq K$ , so $(1 / x_{k})$ diverges to $+ \infty$ .

step 1.1assume-hypL1L2L3L5L6

2.2

Backward direction. Assume $(1 / x_{k})$ diverges to $+ \infty$ and let $ε > 0$ be rational. Then $1 / ε > 0$ by [L2], and by [L1] there is $K$ with $1 / x_{k} > 1 / ε$ for all $k \geq K$ . For such $k$ , both $1 / ε$ and $1 / x_{k}$ are positive by step 1.1, so applying [L2] to $0 < 1 / ε < 1 / x_{k}$ gives $0 < (1 / x_{k})^{- 1} < (1 / ε)^{- 1}$ , that is $0 < x_{k} < ε$ by [L3]; hence $∣ x_{k} - 0 ∣ = x_{k} < ε$ . So $(x_{k})$ converges to $0$ .

step 1.1assume-hypL1L2L3L4

3.1

The two implications together give the stated equivalence.

step 2.1step 2.2∎

Remarks

Positivity is essential. Let $(x_{k})$ be as in the lemma, so that $x_{k} > 0$ for every $k$ and $(x_{k})$ converges to $0$ ; such sequences exist, $x_{k} = 1 / (k + 1)$ being the standard one (FALSE: limits preserve strict inequalities). Put $w_{k} : = - x_{k}$ . Then $∣ w_{k} - 0 ∣ = ∣ - x_{k} ∣ = ∣ x_{k} ∣ = ∣ x_{k} - 0 ∣$ for every $k$ (Basic properties of the absolute value), so $(w_{k})$ converges to $0$ as well, and every $w_{k}$ is nonzero. Yet $(1 / w_{k})$ does not diverge to $+ \infty$ : $1 / w_{k} = - (1 / x_{k})$ by field arithmetic (Field), and $1 / x_{k} > 0$ (Inverses of positives are positive, and reciprocation reverses order), so $1 / w_{k} < 0$ at every index, its negative $1 / x_{k}$ being positive (Ordered field), and no threshold works even for $M = 0$ . Dropping positivity therefore breaks the forward implication outright. What survives without a sign hypothesis is the statement about absolute values: for a sequence of nonzero terms, $(∣ x_{k} ∣)$ converges to $0$ if and only if $(1 / ∣ x_{k} ∣)$ diverges to $+ \infty$ , which is this lemma applied to $(∣ x_{k} ∣)$ , whose terms are positive (Basic properties of the absolute value).
The hypothesis $x_{k} > 0$ is imposed at every index so that $1 / x_{k}$ is defined at every index. It is tempting to relax it to "eventually positive" by passing to a tail, and on the convergence side that is exactly Convergence depends only on the tail; but the equivalence also has a divergence side, and the corresponding tail statement for divergence to $+ \infty$ (Divergence to $+ \infty$ and to $- \infty$ ) is proved nowhere in this library, Convergence depends only on the tail covering convergence and the Cauchy condition only. The relaxed form is therefore not asserted here.
Taking $x_{k} : = 1 / (k + 1)$ , which is null (FALSE: limits preserve strict inequalities), the lemma turns that one fact into $k + 1 \to + \infty$ . The two are the same statement seen twice, which is why this lemma is the standard bridge between the Archimedean property (Every complete ordered field is Archimedean) and statements about growth.

Depends on

Used by

Dependency tree · two levels

32 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

J. K. Hunter, An Introduction to Real Analysis, Ch. 3 (standard reference, not scraped)
Limit of a sequence (Wikipedia) (standard reference, not scraped)
T. Tao, Analysis I, 3rd ed., §6.1 (standard reference, not scraped)
W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)

For positive terms, null and divergence to +∞+∞ are reciprocal