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
Statement
Let 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 is not bounded above (Lower bound, bounded below, bounded set). Then diverges to (Divergence to and to ): for every there is with for all .
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 .
Facts & Assumptions
Given: A nondecreasing sequence of reals whose range is not bounded above.
Monotonicity: whenever (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).
Bounded above: is bounded above exactly when some satisfies for every (Lower bound, bounded below, bounded set).
Trichotomy: for reals and , exactly one of , , holds, so the failure of is (Complete ordered field (least-upper-bound property), Ordered field).
Divergence to : when for every there is such that for all (Divergence to and to ).
Every element of is a term of the sequence, and conversely (Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Proof
Let be arbitrary. Since is not bounded above, is not an upper bound of , so some fails .
By trichotomy that satisfies , and being an element of it is a term: fix with , so .
For every monotonicity gives , hence and so .
For every real an index has been produced with for all , which is exactly divergence to .
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 (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 . Reflecting through the origin turns one into the other.
-
is not a limit. Divergence to and to is deliberately not a case of Limits and Cauchy sequences of reals: a sequence diverging to is unbounded, hence not convergent (Every convergent sequence is bounded), and the arrow in 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 , with no third possibility.