Lemmas about liminf and limsup in an order topology. #
THIS FILE IS SYNCHRONIZED WITH MATHLIB4. Any changes to this file require a corresponding PR to mathlib4.
theorem
is_bounded_le_nhds
{α : Type u}
[semilattice_sup α]
[topological_space α]
[order_topology α]
(a : α) :
theorem
filter.tendsto.is_bounded_under_le
{α : Type u}
{β : Type v}
[semilattice_sup α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
(h : filter.tendsto u f (nhds a)) :
theorem
filter.tendsto.bdd_above_range_of_cofinite
{α : Type u}
{β : Type v}
[semilattice_sup α]
[topological_space α]
[order_topology α]
{u : β → α}
{a : α}
(h : filter.tendsto u filter.cofinite (nhds a)) :
theorem
filter.tendsto.bdd_above_range
{α : Type u}
[semilattice_sup α]
[topological_space α]
[order_topology α]
{u : ℕ → α}
{a : α}
(h : filter.tendsto u filter.at_top (nhds a)) :
theorem
is_cobounded_ge_nhds
{α : Type u}
[semilattice_sup α]
[topological_space α]
[order_topology α]
(a : α) :
theorem
filter.tendsto.is_cobounded_under_ge
{α : Type u}
{β : Type v}
[semilattice_sup α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
[f.ne_bot]
(h : filter.tendsto u f (nhds a)) :
theorem
filter.tendsto.is_bounded_under_le_at_bot
{β : Type v}
{α : Type u_1}
[nonempty α]
[preorder α]
{f : filter β}
{u : β → α}
(h : filter.tendsto u f filter.at_bot) :
theorem
bdd_above_range_of_tendsto_at_top_at_bot
{α : Type u_1}
[nonempty α]
[semilattice_sup α]
{u : ℕ → α}
(hx : filter.tendsto u filter.at_top filter.at_bot) :
theorem
is_bounded_ge_nhds
{α : Type u}
[semilattice_inf α]
[topological_space α]
[order_topology α]
(a : α) :
filter.is_bounded ge (nhds a)
theorem
filter.tendsto.is_bounded_under_ge
{α : Type u}
{β : Type v}
[semilattice_inf α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
(h : filter.tendsto u f (nhds a)) :
theorem
filter.tendsto.bdd_below_range_of_cofinite
{α : Type u}
{β : Type v}
[semilattice_inf α]
[topological_space α]
[order_topology α]
{u : β → α}
{a : α}
(h : filter.tendsto u filter.cofinite (nhds a)) :
theorem
filter.tendsto.bdd_below_range
{α : Type u}
[semilattice_inf α]
[topological_space α]
[order_topology α]
{u : ℕ → α}
{a : α}
(h : filter.tendsto u filter.at_top (nhds a)) :
theorem
is_cobounded_le_nhds
{α : Type u}
[semilattice_inf α]
[topological_space α]
[order_topology α]
(a : α) :
theorem
filter.tendsto.is_cobounded_under_le
{α : Type u}
{β : Type v}
[semilattice_inf α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
[f.ne_bot]
(h : filter.tendsto u f (nhds a)) :
theorem
filter.tendsto.is_bounded_under_ge_at_top
{β : Type v}
{α : Type u_1}
[nonempty α]
[preorder α]
{f : filter β}
{u : β → α}
(h : filter.tendsto u f filter.at_top) :
theorem
bdd_below_range_of_tendsto_at_top_at_top
{α : Type u_1}
[nonempty α]
[semilattice_inf α]
{u : ℕ → α}
(hx : filter.tendsto u filter.at_top filter.at_top) :
theorem
lt_mem_sets_of_Limsup_lt
{α : Type u}
[conditionally_complete_linear_order α]
{f : filter α}
{b : α}
(h : filter.is_bounded has_le.le f)
(l : f.Limsup < b) :
theorem
gt_mem_sets_of_Liminf_gt
{α : Type u}
[conditionally_complete_linear_order α]
{f : filter α}
{b : α} :
theorem
le_nhds_of_Limsup_eq_Liminf
{α : Type u}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter α}
{a : α}
(hl : filter.is_bounded has_le.le f)
(hg : filter.is_bounded ge f)
(hs : f.Limsup = a)
(hi : f.Liminf = a) :
If the liminf and the limsup of a filter coincide, then this filter converges to their common value, at least if the filter is eventually bounded above and below.
theorem
Limsup_nhds
{α : Type u}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
(a : α) :
theorem
Liminf_nhds
{α : Type u}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
(a : α) :
theorem
Liminf_eq_of_le_nhds
{α : Type u}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter α}
{a : α}
[f.ne_bot]
(h : f ≤ nhds a) :
If a filter is converging, its limsup coincides with its limit.
theorem
Limsup_eq_of_le_nhds
{α : Type u}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter α}
{a : α}
[f.ne_bot] :
If a filter is converging, its liminf coincides with its limit.
theorem
filter.tendsto.limsup_eq
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
[f.ne_bot]
(h : filter.tendsto u f (nhds a)) :
filter.limsup u f = a
If a function has a limit, then its limsup coincides with its limit.
theorem
filter.tendsto.liminf_eq
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
[f.ne_bot]
(h : filter.tendsto u f (nhds a)) :
filter.liminf u f = a
If a function has a limit, then its liminf coincides with its limit.
theorem
tendsto_of_liminf_eq_limsup
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
(hinf : filter.liminf u f = a)
(hsup : filter.limsup u f = a)
(h : filter.is_bounded_under has_le.le f u . "is_bounded_default")
(h' : filter.is_bounded_under ge f u . "is_bounded_default") :
filter.tendsto u f (nhds a)
If the liminf and the limsup of a function coincide, then the limit of the function exists and has the same value
theorem
tendsto_of_le_liminf_of_limsup_le
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
{f : filter β}
{u : β → α}
{a : α}
(hinf : a ≤ filter.liminf u f)
(hsup : filter.limsup u f ≤ a)
(h : filter.is_bounded_under has_le.le f u . "is_bounded_default")
(h' : filter.is_bounded_under ge f u . "is_bounded_default") :
filter.tendsto u f (nhds a)
If a number a is less than or equal to the liminf of a function f at some filter
and is greater than or equal to the limsup of f, then f tends to a along this filter.
theorem
tendsto_of_no_upcrossings
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
[densely_ordered α]
{f : filter β}
{u : β → α}
{s : set α}
(hs : dense s)
(H : ∀ (a : α), a ∈ s → ∀ (b : α), b ∈ s → a < b → ¬((∃ᶠ (n : β) in f, u n < a) ∧ ∃ᶠ (n : β) in f, b < u n))
(h : filter.is_bounded_under has_le.le f u . "is_bounded_default")
(h' : filter.is_bounded_under ge f u . "is_bounded_default") :
∃ (c : α), filter.tendsto u f (nhds c)
Assume that, for any a < b, a sequence can not be infinitely many times below a and
above b. If it is also ultimately bounded above and below, then it has to converge. This even
works if a and b are restricted to a dense subset.
theorem
eventually_le_limsup
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
[topological_space.first_countable_topology α]
{f : filter β}
[countable_Inter_filter f]
{u : β → α}
(hf : filter.is_bounded_under has_le.le f u . "is_bounded_default") :
∀ᶠ (b : β) in f, u b ≤ filter.limsup u f
theorem
eventually_liminf_le
{α : Type u}
{β : Type v}
[conditionally_complete_linear_order α]
[topological_space α]
[order_topology α]
[topological_space.first_countable_topology α]
{f : filter β}
[countable_Inter_filter f]
{u : β → α}
(hf : filter.is_bounded_under ge f u . "is_bounded_default") :
∀ᶠ (b : β) in f, filter.liminf u f ≤ u b
@[simp]
theorem
limsup_eq_bot
{α : Type u}
{β : Type v}
[complete_linear_order α]
[topological_space α]
[topological_space.first_countable_topology α]
[order_topology α]
{f : filter β}
[countable_Inter_filter f]
{u : β → α} :
@[simp]
theorem
liminf_eq_top
{α : Type u}
{β : Type v}
[complete_linear_order α]
[topological_space α]
[topological_space.first_countable_topology α]
[order_topology α]
{f : filter β}
[countable_Inter_filter f]
{u : β → α} :
theorem
antitone.map_Limsup_of_continuous_at
{R : Type u_2}
{S : Type u_3}
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{F : filter R}
[F.ne_bot]
{f : R → S}
(f_decr : antitone f)
(f_cont : continuous_at f F.Limsup) :
f F.Limsup = filter.liminf f F
An antitone function between complete linear ordered spaces sends a filter.Limsup
to the filter.liminf of the image if it is continuous at the Limsup.
theorem
antitone.map_limsup_of_continuous_at
{ι : Type u_1}
{R : Type u_2}
{S : Type u_3}
{F : filter ι}
[F.ne_bot]
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{f : R → S}
(f_decr : antitone f)
(a : ι → R)
(f_cont : continuous_at f (filter.limsup a F)) :
f (filter.limsup a F) = filter.liminf (f ∘ a) F
A continuous antitone function between complete linear ordered spaces sends a filter.limsup
to the filter.liminf of the images.
theorem
antitone.map_Liminf_of_continuous_at
{R : Type u_2}
{S : Type u_3}
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{F : filter R}
[F.ne_bot]
{f : R → S}
(f_decr : antitone f)
(f_cont : continuous_at f F.Liminf) :
f F.Liminf = filter.limsup f F
An antitone function between complete linear ordered spaces sends a filter.Liminf
to the filter.limsup of the image if it is continuous at the Liminf.
theorem
antitone.map_liminf_of_continuous_at
{ι : Type u_1}
{R : Type u_2}
{S : Type u_3}
{F : filter ι}
[F.ne_bot]
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{f : R → S}
(f_decr : antitone f)
(a : ι → R)
(f_cont : continuous_at f (filter.liminf a F)) :
f (filter.liminf a F) = filter.limsup (f ∘ a) F
A continuous antitone function between complete linear ordered spaces sends a filter.liminf
to the filter.limsup of the images.
theorem
monotone.map_Limsup_of_continuous_at
{R : Type u_2}
{S : Type u_3}
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{F : filter R}
[F.ne_bot]
{f : R → S}
(f_incr : monotone f)
(f_cont : continuous_at f F.Limsup) :
f F.Limsup = filter.limsup f F
A monotone function between complete linear ordered spaces sends a filter.Limsup
to the filter.limsup of the image if it is continuous at the Limsup.
theorem
monotone.map_limsup_of_continuous_at
{ι : Type u_1}
{R : Type u_2}
{S : Type u_3}
{F : filter ι}
[F.ne_bot]
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{f : R → S}
(f_incr : monotone f)
(a : ι → R)
(f_cont : continuous_at f (filter.limsup a F)) :
f (filter.limsup a F) = filter.limsup (f ∘ a) F
A continuous monotone function between complete linear ordered spaces sends a filter.limsup
to the filter.limsup of the images.
theorem
monotone.map_Liminf_of_continuous_at
{R : Type u_2}
{S : Type u_3}
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{F : filter R}
[F.ne_bot]
{f : R → S}
(f_incr : monotone f)
(f_cont : continuous_at f F.Liminf) :
f F.Liminf = filter.liminf f F
A monotone function between complete linear ordered spaces sends a filter.Liminf
to the filter.liminf of the image if it is continuous at the Liminf.
theorem
monotone.map_liminf_of_continuous_at
{ι : Type u_1}
{R : Type u_2}
{S : Type u_3}
{F : filter ι}
[F.ne_bot]
[complete_linear_order R]
[topological_space R]
[order_topology R]
[complete_linear_order S]
[topological_space S]
[order_topology S]
{f : R → S}
(f_incr : monotone f)
(a : ι → R)
(f_cont : continuous_at f (filter.liminf a F)) :
f (filter.liminf a F) = filter.liminf (f ∘ a) F
A continuous monotone function between complete linear ordered spaces sends a filter.liminf
to the filter.liminf of the images.
theorem
infi_eq_of_forall_le_of_tendsto
{ι : Type u_1}
{R : Type u_2}
[complete_linear_order R]
[topological_space R]
[order_topology R]
{x : R}
{as : ι → R}
(x_le : ∀ (i : ι), x ≤ as i)
{F : filter ι}
[F.ne_bot]
(as_lim : filter.tendsto as F (nhds x)) :
theorem
supr_eq_of_forall_le_of_tendsto
{ι : Type u_1}
{R : Type u_2}
[complete_linear_order R]
[topological_space R]
[order_topology R]
{x : R}
{as : ι → R}
(le_x : ∀ (i : ι), as i ≤ x)
{F : filter ι}
[F.ne_bot]
(as_lim : filter.tendsto as F (nhds x)) :
theorem
Union_Ici_eq_Ioi_of_lt_of_tendsto
{R : Type u_2}
[complete_linear_order R]
[topological_space R]
[order_topology R]
{ι : Type u_1}
(x : R)
{as : ι → R}
(x_lt : ∀ (i : ι), x < as i)
{F : filter ι}
[F.ne_bot]
(as_lim : filter.tendsto as F (nhds x)) :
theorem
Union_Iic_eq_Iio_of_lt_of_tendsto
{R : Type u_2}
[complete_linear_order R]
[topological_space R]
[order_topology R]
{ι : Type u_1}
(x : R)
{as : ι → R}
(lt_x : ∀ (i : ι), as i < x)
{F : filter ι}
[F.ne_bot]
(as_lim : filter.tendsto as F (nhds x)) :
theorem
limsup_eq_tendsto_sum_indicator_nat_at_top
{α : Type u}
(s : ℕ → set α) :
filter.limsup s filter.at_top = {ω : α | filter.tendsto (λ (n : ℕ), (finset.range n).sum (λ (k : ℕ), (s (k + 1)).indicator 1 ω)) filter.at_top filter.at_top}
theorem
limsup_eq_tendsto_sum_indicator_at_top
{α : Type u}
(R : Type u_1)
[strict_ordered_semiring R]
[archimedean R]
(s : ℕ → set α) :
filter.limsup s filter.at_top = {ω : α | filter.tendsto (λ (n : ℕ), (finset.range n).sum (λ (k : ℕ), (s (k + 1)).indicator 1 ω)) filter.at_top filter.at_top}