File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -501,3 +501,27 @@ theorem Monotone.map_liminf_of_continuousAt {f : R → S} (f_incr : Monotone f)
501501 f_incr.map_limsInf_of_continuousAt f_cont cobdd bdd_below
502502
503503end Monotone
504+
505+ section
506+
507+ variable [LinearOrder α] [TopologicalSpace α] [OrderTopology α] [DenselyOrdered α]
508+ [CompleteLattice β] {f : α → β}
509+
510+ lemma Antitone.liminf_nhdsGT_eq_iSup₂_of_exists_gt (hf : Antitone f) (a : α) (hb : ∃ b, a < b) :
511+ (𝓝[>] a).liminf f = ⨆ r > a, f r := by
512+ rw [(nhdsGT_basis_of_exists_gt hb).liminf_eq_iSup_iInf]
513+ refine le_antisymm (iSup₂_mono' fun r hr ↦ ?_) (iSup₂_mono' fun r hr ↦ ?_)
514+ · obtain ⟨b, hb⟩ := exists_between hr
515+ use b, hb.1
516+ exact iInf₂_le b hb
517+ · use r, hr
518+ apply le_iInf
519+ simp only [Set.mem_Ioo, le_iInf_iff, and_imp]
520+ intro i hi0 hir
521+ exact hf hir.le
522+
523+ lemma liminf_nhdsGT_eq_iSup₂ [NoMaxOrder α] (hf : Antitone f) (a : α) :
524+ (𝓝[>] a).liminf f = ⨆ r > a, f r :=
525+ hf.liminf_nhdsGT_eq_iSup₂_of_exists_gt a (exists_gt a)
526+
527+ end
You can’t perform that action at this time.
0 commit comments