TheoremBase

Tail Suprema and Tail Infima of a Bounded Sequence of Real Numbers

The terms of a bounded real sequence from any index on form a nonempty bounded set, with a supremum and an infimum that bracket the term at that index; these tail suprema decrease and tail infima increase with the index, and they converge to their infimum and supremum respectively, which exist.

Statement

In the setting of The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness, let bounds, suprema and infima of subsets of R\mathbb{R} be as in Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order, bounded and monotone sequences as in Bounded Sequences of Real Numbers §bounded and Monotone Sequences §monotone, and convergence as in Convergent Sequences of Real Numbers §converges. Let (an)(a_{n}) be a bounded sequence in R\mathbb{R}, and for k∈Nk\in\mathbb{N} let Tk={am:m∈N, m≥k}T_{k}=\{a_{m}:m\in\mathbb{N},\ m\ge k\} be the set of its terms from the kk-th on.

For every k∈Nk\in\mathbb{N} the set TkT_{k} is nonempty and bounded, so it has a supremum and an infimum; write a‾k=sup⁡Tk\overline{a}_{k}=\sup T_{k} and a‾k=inf⁡Tk\underline{a}_{k}=\inf T_{k} for them, the tail supremum and the tail infimum of (an)(a_{n}).

a‾k≤ak≤a‾k\underline{a}_{k}\le a_{k}\le\overline{a}_{k} for every k∈Nk\in\mathbb{N}.

The sequence (a‾k)k∈N(\overline{a}_{k})_{k\in\mathbb{N}} of tail suprema is nonincreasing and bounded below, and the sequence (a‾k)k∈N(\underline{a}_{k})_{k\in\mathbb{N}} of tail infima is nondecreasing and bounded above.

The infimum inf⁡{a‾k:k∈N}\inf\{\overline{a}_{k}:k\in\mathbb{N}\} and the supremum sup⁡{a‾k:k∈N}\sup\{\underline{a}_{k}:k\in\mathbb{N}\} exist, and a‾k→inf⁡{a‾k:k∈N}\overline{a}_{k}\to\inf\{\overline{a}_{k}:k\in\mathbb{N}\} and a‾k→sup⁡{a‾k:k∈N}\underline{a}_{k}\to\sup\{\underline{a}_{k}:k\in\mathbb{N}\}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…