Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge 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.

Limit superior and limit inferior of a real sequence as inf⁡nsup⁡k≥nxk and sup⁡ninf⁡k≥nxk in R‾

Definition

Let (xk) be a sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences). For n∈N let

Tn  :=  { xk:k∈N, k≥n }⊆R

be the n-th tail range of (xk), a nonempty subset of R since xn∈Tn. Regard Tn as a subset of R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined) and put

sn  :=  sup⁡Tn∈R‾,in  :=  inf⁡Tn∈R‾,

the supremum and infimum taken in R‾, which exist for every n and for every sequence by Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R. The limit superior and limit inferior of (xk) are then

lim sup⁡kxk  :=  inf⁡{ sn:n∈N },lim inf⁡kxk  :=  sup⁡{ in:n∈N },

again taken in R‾ and again existing by Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R, since {sn:n∈N} and {in:n∈N} are subsets of R‾ on which no hypothesis is needed. Both are elements of R‾, and either may be +∞ or −∞. The notations lim sup⁡k→∞xk, lim‾⁡kxk and lim⁡‾kxk all denote the first of them elsewhere; this library writes lim sup⁡kxk.

Every quantity written here exists, and that is why the extended line was introduced. Each of the four operations above is an application of Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R to a subset of R‾ carrying no hypothesis whatever. Written with the real supremum of Complete ordered field (least-upper-bound property) and the real infimum of Every nonempty set bounded below has an infimum instead, the definition would be available only for sequences that are bounded (Lower bound, bounded below, bounded set): sup⁡Tn needs Tn bounded above, and inf⁡{sn} needs {sn} nonempty, bounded below, and made of real numbers (Greatest lower bound (infimum)). None of those is automatic, and the discipline recorded in Conventions: sup⁡∅, unbounded sets, and the extended reals forbids papering over the gap with a convention. The extended supremum is a different operation in a different ordered set, and it is total.

Values, when the sequence is bounded. If (xk) is bounded, say ∣xk∣≤M for every k, then each Tn is a nonempty subset of R bounded above by M and below by −M, so by the agreement clause of Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R each sn and each in is the real supremum or infimum of Tn, and lies in [−M,M]. The family {sn} is then a nonempty set of reals bounded below by −M, so lim sup⁡kxk is likewise the real infimum of {sn} and lies in [−M,M]; dually for lim inf⁡kxk. So for a bounded sequence both quantities are ordinary real numbers computed with the ordinary real supremum and infimum, and the extended line is doing no work. It is only for unbounded sequences that the values ±∞ occur.

Remarks

Depends on

Used by

…and 4 more results.

Dependency tree · two levels

22 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