Theorems · Definition · order theory
Filter.limsup
{α : Type u_1} → {β : Type u_2} → [ConditionallyCompleteLattice α] → (β → α) → Filter β → αThe limsup of a function u along a filter f is the infimum of the a such that
the inequality u x ≤ a eventually holds for f.
- Defined in
- Mathlib.Order.LiminfLimsup
- Cited by
- 226 results in Mathlib
- Foundations
- Depth 10 from the axioms, rests on 67 definitions · uses no axioms
- Assumes
- ConditionallyCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Filterstatement and proof · cited by 8,121
- Filter.mapproof · cited by 819
- ConditionallyCompleteLatticestatement and proof · cited by 364
- Filter.limsSupproof · cited by 29
Cited by230
Results whose statement or proof uses this declaration.
- essSupproof · cited by 69
- ExpGrowth.expGrowthSupproof · cited by 42
- LinearGrowth.linearGrowthSupproof · cited by 38
- ProbabilityTheory.Kernel.densityproof · cited by 24
- Filter.eventually_lt_of_limsup_ltstatement and proof · cited by 21
- Filter.limsup_congrstatement and proof · cited by 20
- Filter.limsup_le_limsupstatement · cited by 16
- Filter.Tendsto.limsup_eqstatement · cited by 12
- Filter.limsup_conststatement · cited by 12
- Filter.limsup_le_iffstatement and proof · cited by 11
- Filter.limsup_le_of_lestatement · cited by 11
- Filter.frequently_lt_of_lt_limsupstatement and proof · cited by 10
Showing the 200 most cited of 230.