LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26

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.

A nondecreasing sequence that is not bounded above diverges to $+ \infty$

Statement

Let $(x_{k})$ be a nondecreasing sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences) whose range $S = {x_{k} : k \in N}$ is not bounded above (Lower bound, bounded below, bounded set). Then $(x_{k})$ diverges to $+ \infty$ (Divergence to $+ \infty$ and to $- \infty$ ): for every $M \in R$ there is $K \in N$ with $x_{k} > M$ for all $k \geq K$ .

Read together with the monotone convergence theorem this says that a nondecreasing sequence has exactly two possible behaviours, with nothing in between: it converges to the supremum of its range, or it runs away to $+ \infty$ .

Facts & Assumptions

Given: A nondecreasing sequence $(x_{k})$ of reals whose range $S = {x_{k} : k \in N}$ is not bounded above.

[L1]

Monotonicity: $x_{j} \leq x_{k}$ whenever $j \leq k$ (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L2]

Bounded above: $S$ is bounded above exactly when some $M \in R$ satisfies $s \leq M$ for every $s \in S$ (Lower bound, bounded below, bounded set).

[L3]

Trichotomy: for reals $s$ and $M$ , exactly one of $s < M$ , $s = M$ , $s > M$ holds, so the failure of $s \leq M$ is $s > M$ (Complete ordered field (least-upper-bound property), Ordered field).

[L4]

Divergence to $+ \infty$ : $x_{k} \to + \infty$ when for every $M \in R$ there is $K \in N$ such that $x_{k} > M$ for all $k \geq K$ (Divergence to $+ \infty$ and to $- \infty$ ).

[L5]

Every element of $S$ is a term of the sequence, and conversely (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Proof

technique · direct

1.1

Let $M \in R$ be arbitrary. Since $S$ is not bounded above, $M$ is not an upper bound of $S$ , so some $s \in S$ fails $s \leq M$ .

givenL2

2.1

By trichotomy that $s$ satisfies $s > M$ , and being an element of $S$ it is a term: fix $K \in N$ with $s = x_{K}$ , so $x_{K} > M$ .

step 1.1L3L5choose

3.1

For every $k \geq K$ monotonicity gives $x_{K} \leq x_{k}$ , hence $x_{k} \geq x_{K} > M$ and so $x_{k} > M$ .

step 2.1L1

4.1

For every real $M$ an index $K$ has been produced with $x_{k} > M$ for all $k \geq K$ , which is exactly divergence to $+ \infty$ .

step 3.1L4∎

Remarks

Only "not bounded above" is used, not unboundedness of the sequence. For a nondecreasing sequence the two coincide, since such a sequence is bounded below by $x_{0}$ (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences), so a nondecreasing sequence is unbounded exactly when its range is not bounded above. The hypothesis is stated in the one-sided form because that is the form the proof consumes.
The dual statement holds with the same proof: a nonincreasing sequence whose range is not bounded below diverges to $- \infty$ . Reflecting through the origin turns one into the other.
$+ \infty$ is not a limit. Divergence to $+ \infty$ and to $- \infty$ is deliberately not a case of Limits and Cauchy sequences of reals: a sequence diverging to $+ \infty$ is unbounded, hence not convergent (Every convergent sequence is bounded), and the arrow in $x_{k} \to + \infty$ is an abbreviation for the displayed quantifier statement and never an equation.
The companion statement is A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum: between them, a nondecreasing sequence converges to the supremum of its range or diverges to $+ \infty$ , with no third possibility.

Depends on

Used by

Dependency tree · two levels

19 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

Monotone convergence theorem (Wikipedia) (standard reference, not scraped)
W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (Thm 3.14 and Def. 3.15) (standard reference, not scraped)
J. Lebl, Basic Analysis I, §2.2 (standard reference, not scraped)

A nondecreasing sequence that is not bounded above diverges to +∞+∞