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.
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
Statement
Let be any subset of the extended real line (The extended real line , its order, and the arithmetic that is left undefined) and write . Then has a least upper bound and a greatest lower bound in (Upper bound, least upper bound, and strict upper bound), each unique, which we write and with the ambient set always . Explicitly:
- if , or if is not bounded above in ;
- if and ;
- is the real supremum (Complete ordered field (least-upper-bound property)) if and is nonempty and bounded above in ;
and dually, with and exchanged and "above" replaced by "below", for (Greatest lower bound (infimum), Every nonempty set bounded below has an infimum).
Agreement. If is nonempty and bounded above in (Lower bound, bounded below, bounded set) then computed in is the real number of Complete ordered field (least-upper-bound property); if is nonempty and bounded below then computed in is the real number of Every nonempty set bounded below has an infimum. In particular the notation is unambiguous on the sets for which the real supremum and infimum are defined, and , in .
No hypothesis is placed on . This is exactly what the real supremum cannot do, and it is why every statement on this page holds for every sequence rather than for bounded ones only. It is also not a weakening of the discipline this library keeps around suprema: the operation supplied here is a different operation, taken in a different ordered set, and the agreement clause records exactly where the two coincide.
Facts & Assumptions
Given: A subset , and its real part .
is a totally ordered set in which is the least element and the greatest, and whose order restricted to is the order of (The extended real line , its order, and the arithmetic that is left undefined, Partial order and partially ordered set, Order on the reals).
Upper and lower bounds in a poset: is an upper bound of when for all , and a least upper bound when moreover for every upper bound ; dually for lower bounds and greatest lower bounds. Each is unique when it exists, by antisymmetry (Upper bound, least upper bound, and strict upper bound, Partial order and partially ordered set).
Least-upper-bound property of : every nonempty that is bounded above in has a real least upper bound (Complete ordered field (least-upper-bound property)).
Greatest-lower-bound property of : every nonempty that is bounded below in has a real greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).
Bounded above and bounded below in mean the existence of a real upper, respectively lower, bound (Lower bound, bounded below, bounded set).
Proof
Case S1 for the supremum: .
Case S2 for the supremum: and , so that every element of equals .
Case S3 for the supremum: , , and is bounded above in .
Case S4 for the supremum: , , and is not bounded above in .
Case I1 for the infimum: .
Case I2 for the infimum: and , so that every element of equals .
Case I3 for the infimum: , , and is bounded below in .
Case I4 for the infimum: , , and is not bounded below in .
In case S1 the element is an upper bound of , being the greatest element of ; and if is any upper bound of then gives , whence by antisymmetry. So is the least upper bound of .
In case S2 every element of equals , so is an upper bound of by reflexivity; and for every , being the least element. So is the least upper bound of .
In case S3 the real number exists, and it is an upper bound of in : an element of is either real, hence lies in and satisfies in and so in , or equals , which is ; the value does not occur in in this case.
In case S4 the element is an upper bound of ; and if is an upper bound then , because fixing , which is possible in this case, gives with real and is below no real, while real would make a real upper bound of and contradict the case hypothesis. So , and is the least upper bound of .
In case I1 the element is a lower bound of , being least; and any lower bound satisfies because , whence by antisymmetry. So is the greatest lower bound of .
In case I2 every element of equals , so is a lower bound of by reflexivity, and for every . So is the greatest lower bound of .
In case I3 the real number exists and is a lower bound of in : an element of is either real, hence in and , or equals ; the value does not occur in in this case.
In case I4 the element is a lower bound of ; any lower bound satisfies , because fixing gives with real and is above no real, while real would be a real lower bound of and contradict the case hypothesis. So is the greatest lower bound of .
In case S3 let be any upper bound of and fix , which is possible since . From with real we get , since is below no real. If then because is greatest. Otherwise is real, and it bounds above in , so by leastness of the real supremum. Hence is the least upper bound of .
In case I3 let be a lower bound of and fix . From with real we get . If then ; otherwise is real and bounds below in , so . Hence is the greatest lower bound of .
The four supremum cases are exhaustive and mutually exclusive: either , which is S1, or not, and then either , which is S2, or and it is bounded above in , which is S3, or it is not, which is S4. In each case a least upper bound was produced, and it is unique. The same four alternatives with , and "below" in place of , and "above" are I1 to I4, and in each a greatest lower bound was produced.
The agreement clause follows: a nonempty bounded above in satisfies and , so case S3 applies and is the real supremum; a nonempty bounded below satisfies case I3 and is the real infimum; and falls under S2 and I2, giving and .
Remarks
-
What makes this work is that has a top and a bottom. The three defining clauses of the order (The extended real line , its order, and the arithmetic that is left undefined) put above everything and below everything, and every case above is settled by one of those two facts or by the least-upper-bound property of applied to the real part. Nothing else about is used, and in particular no arithmetic is used at all.
-
The two exceptional cases of FALSE: every subset of has a supremum are not repaired, they are relocated. That false statement records that in a set may fail to have a supremum, and it stays true; the discipline of Conventions: , unbounded sets, and the extended reals, which refuses to write inside , also stays in force. What is proved here is a statement about a different ordered set.
-
The empty set is not an exception here, and that is the point of the ambient set. In the empty set has no supremum, because every real is an upper bound and there is no least one. In every element is still an upper bound of , but now there is a least one, namely . The two statements are about different ordered sets and neither contradicts the other.
-
Where this is consumed. Limit superior and limit inferior of a real sequence as and in needs the supremum of a tail range of an arbitrary real sequence, which may be unbounded, and then the infimum of the resulting family, which may contain ; both are supplied here and by nothing earlier in the library. Fourteen items on this page depend on it, and five more on the companion page of examples.
Depends on
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Upper bound, least upper bound, and strict upper bound
- Partial order and partially ordered set
- Complete ordered field (least-upper-bound property)
- Every nonempty set bounded below has an infimum
- Lower bound, bounded below, bounded set
- Greatest lower bound (infimum)
- Order on the reals
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
- xₖ = 1 + (-1)ᵏ, yₖ = 1 + (-1)ᵏ⁺¹ give limsup(xₖ yₖ) = 0 < 4 Counterexample
- A real power series about a centre, its interval of convergence, and its radius in [0,+∞] Definition
- Limit superior and limit inferior of a real sequence as infₙ sup_k ≥ n xₖ and supₙ inf_k ≥ n xₖ in overlineℝ Definition
- Oscillation of a real function on subsets of ℝᵐ and at a point Definition
- The oscillation ω_f(S) = sup{ |f(x) - f(y)| : x, y ∈ S } of f on a set and the oscillation ω_f(c) = inf_δ > 0 ω_f(A ∩ N_δ(c)) at a point, both taken in the extended reals Definition
- (-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 every real ε > 0 the set { x ∈ A : ω_f(x) ≥ ε } is the intersection with A of a closed subset of ℝ; in particular it is closed in ℝ when A = ℝ Lemma
- 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
- The tail suprema of any real sequence are nonincreasing in overlineℝ, so the limit superior exists for every sequence Lemma
- Which extended-real operations this library leaves undefined, and where each limsup statement needs the hypothesis Remark
- A real sequence converges to L ∈ ℝ iff liminf xₖ = limsup xₖ = L, and diverges to ±∞ iff both equal ±∞ Theorem
- f : A → ℝ is continuous at c ∈ A if and only if ω_f(c) = 0 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 Dirichlet function is continuous at no point of ℝ, and Thomae's function is continuous at every irrational and at no rational, so its set of continuity points is exactly the set of irrationals and its oscillation at c equals t(c) 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: 27 results over 9 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
- Extended real number line (Wikipedia) (standard reference, not scraped)
- Complete lattice (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)