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.
The tail suprema of any real sequence are nonincreasing in , so the limit superior exists for every sequence
Statement
Let be a sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences), with tail ranges and extended tail bounds , as in Limit superior and limit inferior of a real sequence as and in .
- Monotonicity of the extended bounds under inclusion. If (The extended real line , its order, and the arithmetic that is left undefined) then the four quantities being the extended bounds of Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in . No hypothesis is placed on or ; in particular may be empty.
- The tail bounds are monotone. whenever , and hence In particular and for every , and for every .
- Existence. and exist in for every sequence of reals, bounded or not.
Claim 1 is the tool the rest of this page uses whenever two extended suprema are compared. It is proved here, from the definition of a least upper bound, rather than quoted from the suprema page, for the reason given in the remarks below.
Facts & Assumptions
Given: A sequence of reals, its tail ranges , and the extended bounds , (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limit superior and limit inferior of a real sequence as and in ).
Every subset of has a least upper bound and a greatest lower bound in , with no hypothesis on the subset (Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ).
Least upper bound and greatest lower bound in a poset: is an upper bound of that is every upper bound of , and is a lower bound that is every lower bound; each is unique when it exists (Upper bound, least upper bound, and strict upper bound, Partial order and partially ordered set).
is a totally ordered set, so its order is reflexive and transitive (The extended real line , its order, and the arithmetic that is left undefined, Partial order and partially ordered set).
The order on is total and transitive (Order on the natural numbers, is a linear order on ).
Proof
Let be arbitrary. By [L1] the four elements , , , of all exist and are uniquely determined.
Let in . Every element of has the form with , and then by transitivity, so ; hence .
For every the tail range contains , so because is a lower bound of , and because is an upper bound of ; transitivity gives .
Since is an upper bound of and , every element of is , so is an upper bound of ; as is the least of the upper bounds of , this gives . Dually is a lower bound of , hence of , and as is the greatest of the lower bounds of this gives . Claim 1 is proved.
Applying claim 1 to the inclusion valid for gives and ; the special case gives and . Together with this is claim 2.
The families and are subsets of , so [L1] applies to them with no hypothesis, and and exist in for every sequence of reals. This is claim 3.
Remarks
-
The monotonicity is where the two operations of the definition interlock. Because is nonincreasing, the outer infimum in is an infimum of a decreasing family, so it is the value the tail suprema are pressing down towards; and because is nondecreasing, is the value the tail infima are pressing up towards. Nothing in this lemma says the pressing converges, and for an unbounded sequence there is nothing in for it to converge to; the exact statement is For finite : iff for every one has eventually and frequently.
-
Why the word "nonincreasing" is spelled out rather than cited. Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences defines monotone for sequences of reals, and takes values in , so the definition does not apply to it. Claim 2 is therefore stated as the inequality it is. When is bounded every is real (Limit superior and limit inferior of a real sequence as and in ) and is then a nonincreasing sequence of reals in the sense of Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences, but no proof on this page needs that reading.
-
Claim 1 is not Monotonicity of the supremum under inclusion. That lemma is the same one-line argument carried out in , and its statement carries the hypotheses that the smaller set be nonempty and the larger one bounded above, without which neither supremum denotes anything. Those are exactly the hypotheses that the extended bounds of Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in dispense with, so the extended statement is not an instance of the real one and is proved from the definition of a least upper bound instead.
-
Claim 1 costs nothing and is used everywhere. It is the one-line poset argument: the larger set's supremum bounds the smaller set, and leastness does the rest. It is stated as part of this lemma rather than as an item of its own because it is used only in company with the tail bounds.
Depends on
- Limit superior and limit inferior of a real sequence as $\inf_n \sup_{k \ge n} x_k$ and $\sup_n \inf_{k \ge n} x_k$ in $\overline{\mathbb{R}}$
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- Upper bound, least upper bound, and strict upper bound
- Partial order and partially ordered set
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Order on the natural numbers
- $\le$ is a linear order on $\mathbb{N}$
Used by
- Kummer with ζₖ = 1 recovers the ratio test Corollary
- Raabe is Kummer with ζₖ = k+1: for positive terms, liminf (k+1)(aₖ/aₖ₊₁ - 1) > 1 gives convergence and limsup < 1 gives divergence Corollary
- A sequence with limsup = +∞: the greatest subsequential limit exists only in overlineℝ Counterexample
- aₖ = 2^-k+(-1)ᵏ has ratio limsup 2 and liminf 1/8, so the ratio test fails, while the root test gives convergence Counterexample
- xₖ = 1 + (-1)ᵏ, yₖ = 1 + (-1)ᵏ⁺¹ give limsup(xₖ yₖ) = 0 < 4 Counterexample
- (-1)ᵏ has liminf = -1 and limsup = 1, so it does not converge Example
- A positive sequence making all three inequalities of the ratio-to-root chain strict Example
- A series with ratio limit exactly 1 that Raabe decides Example
- The block sequence 1/1; 1/2, 2/2; 1/3, 2/3, 3/3; … has subsequential limit set exactly [0,1] Example
- FALSE: limsup |aₖ₊₁/aₖ| ≥ 1 implies the series diverges False statement
- FALSE: limsup aₖ^1/k = limsup aₖ₊₁/aₖ for every positive sequence False statement
- FALSE: limsup(xₖ + yₖ) = limsup xₖ + limsup yₖ False statement
- For finite L: L = limsup xₖ iff for every ε > 0 one has xₖ < L + ε eventually and xₖ > L - ε frequently Lemma
- If xₖ ≤ yₖ eventually then limsup xₖ ≤ limsup yₖ and liminf xₖ ≤ liminf yₖ Lemma
- liminf xₖ ≤ limsup xₖ for every real sequence Lemma
- limsup(-xₖ) = -liminf(xₖ), with the reflection of overlineℝ exchanging ±∞ Lemma
- A real sequence converges to L ∈ ℝ iff liminf xₖ = limsup xₖ = L, and diverges to ±∞ iff both equal ±∞ Theorem
- Cauchy–Hadamard: the reciprocal radius is limsup_k→∞|aₖ₊₁|^1/(k+1), with the zero and infinite cases included Theorem
- For aₖ > 0: liminf aₖ₊₁/aₖ ≤ liminf aₖ^1/k ≤ limsup aₖ^1/k ≤ limsup aₖ₊₁/aₖ Theorem
- For bounded nonnegative sequences, limsup(xₖ yₖ) ≤ (limsup xₖ)(limsup yₖ) Theorem
- Gauss: for positive terms, if aₖ/aₖ₊₁ = 1 + h/k + rₖ with |rₖ| ≤ C k^-1-ε for k ≥ 1, some constant C and some rational ε > 0, the series converges iff h > 1 Theorem
- Kummer: for positive terms aₖ and weights ζₖ > 0, liminf(ζₖ aₖ/aₖ₊₁ - ζₖ₊₁) > 0 gives convergence, and if ∑ 1/ζₖ diverges while that expression is eventually ≤ 0 the series diverges Theorem
- limsup(xₖ + yₖ) ≤ limsup xₖ + limsup yₖ whenever the right-hand side is defined in overlineℝ, and dually for liminf Theorem
- Ratio test: limsup |aₖ₊₁/aₖ| < 1 gives absolute convergence and hence convergence, and liminf |aₖ₊₁/aₖ| > 1 gives divergence Theorem
- Root test: limsup |aₖ|^1/k < 1 gives absolute convergence and hence convergence, > 1 gives divergence, and = 1 decides nothing Theorem
- The limit superior is itself a subsequential limit in overlineℝ and is the greatest one Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 53 results over 17 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
- Limit superior and limit inferior (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §2.3 (standard reference, not scraped)
- N. Donaldson, Math 140A: Real Analysis notes (standard reference, not scraped)