Loogle!
Result
Found 129 declarations mentioning Filter.cocompact.
- Filter.cocompact 📋 Mathlib.Topology.Defs.Filter
(X : Type u_1) [TopologicalSpace X] : Filter X - instNeBotCocompactOfNoncompactSpace 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] [NoncompactSpace X] : (Filter.cocompact X).NeBot - noncompactSpace_of_neBot 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] : (Filter.cocompact X).NeBot → NoncompactSpace X - Filter.cocompact_neBot_iff 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] : (Filter.cocompact X).NeBot ↔ NoncompactSpace X - Filter.cocompact_eq_cofinite 📋 Mathlib.Topology.Compactness.Compact
(X : Type u_2) [TopologicalSpace X] [DiscreteTopology X] : Filter.cocompact X = Filter.cofinite - Filter.cocompact_eq_bot 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] [CompactSpace X] : Filter.cocompact X = ⊥ - Filter.hasBasis_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] : (Filter.cocompact X).HasBasis IsCompact compl - Filter.cocompact_le_cofinite 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] : Filter.cocompact X ≤ Filter.cofinite - Filter.cocompact_le_coclosedCompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] : Filter.cocompact X ≤ Filter.coclosedCompact X - Topology.IsClosedEmbedding.tendsto_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : Filter.Tendsto f (Filter.cocompact X) (Filter.cocompact Y) - IsCompact.compl_mem_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsCompact s) : sᶜ ∈ Filter.cocompact X - Filter.coprod_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] : (Filter.cocompact X).coprod (Filter.cocompact Y) = Filter.cocompact (X × Y) - Filter.coprodᵢ_cocompact 📋 Mathlib.Topology.Compactness.Compact
{ι : Type u_1} {X : ι → Type u_3} [(d : ι) → TopologicalSpace (X d)] : (Filter.coprodᵢ fun d => Filter.cocompact (X d)) = Filter.cocompact ((d : ι) → X d) - Filter.comap_cocompact_le 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Continuous f) : Filter.comap f (Filter.cocompact Y) ≤ Filter.cocompact X - Filter.mem_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.cocompact X ↔ ∃ t, IsCompact t ∧ tᶜ ⊆ s - Filter.mem_cocompact' 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.cocompact X ↔ ∃ t, IsCompact t ∧ sᶜ ⊆ t - Filter.Tendsto.isCompact_insert_range_of_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {y : Y} (hf : Filter.Tendsto f (Filter.cocompact X) (nhds y)) (hfc : Continuous f) : IsCompact (insert y (Set.range f)) - Filter.disjoint_cocompact_left 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] (f : Filter X) : Disjoint (Filter.cocompact X) f ↔ ∃ K ∈ f, IsCompact K - Filter.disjoint_cocompact_right 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} [TopologicalSpace X] (f : Filter X) : Disjoint f (Filter.cocompact X) ↔ ∃ K ∈ f, IsCompact K - disjoint_map_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {g : X → Y} {f : Filter X} (hg : Continuous g) (hf : Disjoint f (Filter.cocompact X)) : Disjoint (Filter.map g f) (Filter.cocompact Y) - nhdsSet_prod_le_of_disjoint_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : Filter Y} (hs : IsCompact s) (hf : Disjoint f (Filter.cocompact Y)) : nhdsSet s ×ˢ f ≤ nhdsSet (s ×ˢ Set.univ) - prod_nhdsSet_le_of_disjoint_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {t : Set Y} {f : Filter X} (ht : IsCompact t) (hf : Disjoint f (Filter.cocompact X)) : f ×ˢ nhdsSet t ≤ nhdsSet (Set.univ ×ˢ t) - nhds_prod_le_of_disjoint_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : Filter Y} (x : X) (hf : Disjoint f (Filter.cocompact Y)) : nhds x ×ˢ f ≤ nhdsSet ({x} ×ˢ Set.univ) - prod_nhds_le_of_disjoint_cocompact 📋 Mathlib.Topology.Compactness.Compact
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : Filter X} (y : Y) (hf : Disjoint f (Filter.cocompact X)) : f ×ˢ nhds y ≤ nhdsSet (Set.univ ×ˢ {y}) - disjoint_nhds_cocompact 📋 Mathlib.Topology.Compactness.LocallyCompact
{X : Type u_1} [TopologicalSpace X] [WeaklyLocallyCompactSpace X] (x : X) : Disjoint (nhds x) (Filter.cocompact X) - Filter.coclosedCompact_eq_cocompact 📋 Mathlib.Topology.Separation.Basic
{X : Type u_1} [TopologicalSpace X] [R1Space X] : Filter.coclosedCompact X = Filter.cocompact X - tendsto_cofinite_cocompact_iff 📋 Mathlib.Topology.DiscreteSubset
{X : Type u_1} {Y : Type u_2} [TopologicalSpace Y] {f : X → Y} : Filter.Tendsto f Filter.cofinite (Filter.cocompact Y) ↔ ∀ (K : Set Y), IsCompact K → (f ⁻¹' K).Finite - tendsto_cofinite_cocompact_of_discrete 📋 Mathlib.Topology.DiscreteSubset
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [DiscreteTopology X] (hf : Filter.Tendsto f (Filter.cocompact X) (Filter.cocompact Y)) : Filter.Tendsto f Filter.cofinite (Filter.cocompact Y) - Continuous.discrete_of_tendsto_cofinite_cocompact 📋 Mathlib.Topology.DiscreteSubset
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [T1Space X] [WeaklyLocallyCompactSpace Y] (hf' : Continuous f) (hf : Filter.Tendsto f Filter.cofinite (Filter.cocompact Y)) : DiscreteTopology X - IsClosed.tendsto_coe_cofinite_of_isDiscrete 📋 Mathlib.Topology.DiscreteSubset
{X : Type u_1} [TopologicalSpace X] {s : Set X} (hs : IsClosed s) (hs' : IsDiscrete s) : Filter.Tendsto Subtype.val Filter.cofinite (Filter.cocompact X) - IsClosed.tendsto_coe_cofinite_iff 📋 Mathlib.Topology.DiscreteSubset
{X : Type u_1} [TopologicalSpace X] [T1Space X] [WeaklyLocallyCompactSpace X] {s : Set X} (hs : IsClosed s) : Filter.Tendsto Subtype.val Filter.cofinite (Filter.cocompact X) ↔ IsDiscrete s - Homeomorph.comap_cocompact 📋 Mathlib.Topology.Homeomorph.Lemmas
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] (h : X ≃ₜ Y) : Filter.comap (⇑h) (Filter.cocompact Y) = Filter.cocompact X - Homeomorph.map_cocompact 📋 Mathlib.Topology.Homeomorph.Lemmas
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] (h : X ≃ₜ Y) : Filter.map (⇑h) (Filter.cocompact X) = Filter.cocompact Y - HasCompactMulSupport.is_one_at_infty 📋 Mathlib.Topology.Algebra.Support
{α : Type u_2} {γ : Type u_5} [TopologicalSpace α] [One γ] {f : α → γ} [TopologicalSpace γ] (h : HasCompactMulSupport f) : Filter.Tendsto f (Filter.cocompact α) (nhds 1) - HasCompactSupport.is_zero_at_infty 📋 Mathlib.Topology.Algebra.Support
{α : Type u_2} {γ : Type u_5} [TopologicalSpace α] [Zero γ] {f : α → γ} [TopologicalSpace γ] (h : HasCompactSupport f) : Filter.Tendsto f (Filter.cocompact α) (nhds 0) - Filter.tendsto_cocompact_mul_left 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [Monoid M] [SeparatelyContinuousMul M] {a b : M} (ha : b * a = 1) : Filter.Tendsto (fun x => a * x) (Filter.cocompact M) (Filter.cocompact M) - Filter.tendsto_cocompact_mul_right 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [Monoid M] [SeparatelyContinuousMul M] {a b : M} (ha : a * b = 1) : Filter.Tendsto (fun x => x * a) (Filter.cocompact M) (Filter.cocompact M) - Tendsto.tendsto_mul_zero_of_disjoint_cocompact_left 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} {α : Type u_6} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {f g : α → M} {l : Filter α} (hf : Disjoint (Filter.map f l) (Filter.cocompact M)) (hg : Filter.Tendsto g l (nhds 0)) : Filter.Tendsto (fun x => f x * g x) l (nhds 0) - Tendsto.tendsto_mul_zero_of_disjoint_cocompact_right 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} {α : Type u_6} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {f g : α → M} {l : Filter α} (hf : Filter.Tendsto f l (nhds 0)) (hg : Disjoint (Filter.map g l) (Filter.cocompact M)) : Filter.Tendsto (fun x => f x * g x) l (nhds 0) - tendsto_mul_nhds_zero_prod_of_disjoint_cocompact 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {l : Filter M} (hl : Disjoint l (Filter.cocompact M)) : Filter.Tendsto (fun x => x.1 * x.2) (nhds 0 ×ˢ l) (nhds 0) - tendsto_mul_prod_nhds_zero_of_disjoint_cocompact 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {l : Filter M} (hl : Disjoint l (Filter.cocompact M)) : Filter.Tendsto (fun x => x.1 * x.2) (l ×ˢ nhds 0) (nhds 0) - tendsto_mul_cocompact_nhds_zero 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} {α : Type u_6} {β : Type u_7} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] [TopologicalSpace α] [TopologicalSpace β] {f : α → M} {g : β → M} (f_cont : Continuous f) (g_cont : Continuous g) (hf : Filter.Tendsto f (Filter.cocompact α) (nhds 0)) (hg : Filter.Tendsto g (Filter.cocompact β) (nhds 0)) : Filter.Tendsto (fun i => f i.1 * g i.2) (Filter.cocompact (α × β)) (nhds 0) - tendsto_mul_coprod_nhds_zero_inf_of_disjoint_cocompact 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {l : Filter (M × M)} (hl : Disjoint l (Filter.cocompact (M × M))) : Filter.Tendsto (fun x => x.1 * x.2) ((nhds 0).coprod (nhds 0) ⊓ l) (nhds 0) - tendsto_mul_nhds_zero_of_disjoint_cocompact 📋 Mathlib.Topology.Algebra.Monoid
{M : Type u_3} [TopologicalSpace M] [MulZeroClass M] [ContinuousMul M] {l : Filter (M × M)} (hl : Disjoint l (Filter.cocompact (M × M))) (h'l : l ≤ (nhds 0).coprod (nhds 0)) : Filter.Tendsto (fun x => x.1 * x.2) l (nhds 0) - Continuous.uniformContinuous_of_tendsto_cocompact 📋 Mathlib.Topology.UniformSpace.HeineCantor
{α : Type u_1} {β : Type u_2} [UniformSpace α] [UniformSpace β] {f : α → β} {x : β} (h_cont : Continuous f) (hx : Filter.Tendsto f (Filter.cocompact α) (nhds x)) : UniformContinuous f - AddSubgroup.properlyDiscontinuousVAdd_opposite_of_tendsto_cofinite 📋 Mathlib.Topology.Algebra.Group.Subgroup
{G : Type u_1} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] (S : AddSubgroup G) (hS : Filter.Tendsto (⇑S.subtype) Filter.cofinite (Filter.cocompact G)) : ProperlyDiscontinuousVAdd (↥S.op) G - Subgroup.properlyDiscontinuousSMul_opposite_of_tendsto_cofinite 📋 Mathlib.Topology.Algebra.Group.Subgroup
{G : Type u_1} [TopologicalSpace G] [Group G] [IsTopologicalGroup G] (S : Subgroup G) (hS : Filter.Tendsto (⇑S.subtype) Filter.cofinite (Filter.cocompact G)) : ProperlyDiscontinuousSMul (↥S.op) G - AddSubgroup.properlyDiscontinuousVAdd_of_tendsto_cofinite 📋 Mathlib.Topology.Algebra.Group.Subgroup
{G : Type u_1} [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] (S : AddSubgroup G) (hS : Filter.Tendsto (⇑S.subtype) Filter.cofinite (Filter.cocompact G)) : ProperlyDiscontinuousVAdd (↥S) G - Subgroup.properlyDiscontinuousSMul_of_tendsto_cofinite 📋 Mathlib.Topology.Algebra.Group.Subgroup
{G : Type u_1} [TopologicalSpace G] [Group G] [IsTopologicalGroup G] (S : Subgroup G) (hS : Filter.Tendsto (⇑S.subtype) Filter.cofinite (Filter.cocompact G)) : ProperlyDiscontinuousSMul (↥S) G - isProperMap_iff_isClosedMap_and_tendsto_cofinite 📋 Mathlib.Topology.Maps.Proper.Basic
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [T1Space Y] : IsProperMap f ↔ Continuous f ∧ IsClosedMap f ∧ Filter.Tendsto f (Filter.cocompact X) Filter.cofinite - AddSubgroup.tendsto_coe_cofinite_of_discrete 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] [T2Space G] (H : AddSubgroup G) (hH : IsDiscrete ↑H) : Filter.Tendsto Subtype.val Filter.cofinite (Filter.cocompact G) - Subgroup.tendsto_coe_cofinite_of_discrete 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
{G : Type u_1} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [T2Space G] (H : Subgroup G) (hH : IsDiscrete ↑H) : Filter.Tendsto Subtype.val Filter.cofinite (Filter.cocompact G) - AddMonoidHom.tendsto_coe_cofinite_of_discrete 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
{G : Type u_1} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] [T2Space G] {H : Type u_2} [AddGroup H] {f : H →+ G} (hf : Function.Injective ⇑f) (hf' : IsDiscrete ↑f.range) : Filter.Tendsto (⇑f) Filter.cofinite (Filter.cocompact G) - MonoidHom.tendsto_coe_cofinite_of_discrete 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
{G : Type u_1} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [T2Space G] {H : Type u_2} [Group H] {f : H →* G} (hf : Function.Injective ⇑f) (hf' : IsDiscrete ↑f.range) : Filter.Tendsto (⇑f) Filter.cofinite (Filter.cocompact G) - Filter.tendsto_cocompact_mul_left₀ 📋 Mathlib.Topology.Algebra.Field
{K : Type u_1} [DivisionRing K] [TopologicalSpace K] [SeparatelyContinuousMul K] {a : K} (ha : a ≠ 0) : Filter.Tendsto (fun x => a * x) (Filter.cocompact K) (Filter.cocompact K) - Filter.tendsto_cocompact_mul_right₀ 📋 Mathlib.Topology.Algebra.Field
{K : Type u_1} [DivisionRing K] [TopologicalSpace K] [SeparatelyContinuousMul K] {a : K} (ha : a ≠ 0) : Filter.Tendsto (fun x => x * a) (Filter.cocompact K) (Filter.cocompact K) - atBot_le_cocompact 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMinOrder α] [ClosedIicTopology α] : Filter.atBot ≤ Filter.cocompact α - atTop_le_cocompact 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMaxOrder α] [ClosedIciTopology α] : Filter.atTop ≤ Filter.cocompact α - cocompact_le_atBot 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [OrderTop α] [CompactIccSpace α] : Filter.cocompact α ≤ Filter.atBot - cocompact_le_atTop 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [OrderBot α] [CompactIccSpace α] : Filter.cocompact α ≤ Filter.atTop - cocompact_le_atBot_atTop 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [CompactIccSpace α] : Filter.cocompact α ≤ Filter.atBot ⊔ Filter.atTop - Continuous.exists_forall_ge 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIciTopology α] [Nonempty β] {f : β → α} (hf : Continuous f) (hlim : Filter.Tendsto f (Filter.cocompact β) Filter.atBot) : ∃ x, ∀ (y : β), f y ≤ f x - Continuous.exists_forall_le 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIicTopology α] [Nonempty β] {f : β → α} (hf : Continuous f) (hlim : Filter.Tendsto f (Filter.cocompact β) Filter.atTop) : ∃ x, ∀ (y : β), f x ≤ f y - Continuous.exists_forall_ge' 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIciTopology α] {f : β → α} (hf : Continuous f) (x₀ : β) (h : ∀ᶠ (x : β) in Filter.cocompact β, f x ≤ f x₀) : ∃ x, ∀ (y : β), f y ≤ f x - Continuous.exists_forall_le' 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIicTopology α] {f : β → α} (hf : Continuous f) (x₀ : β) (h : ∀ᶠ (x : β) in Filter.cocompact β, f x₀ ≤ f x) : ∃ x, ∀ (y : β), f x ≤ f y - cocompact_eq_atBot 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMinOrder α] [OrderTop α] [ClosedIicTopology α] [CompactIccSpace α] : Filter.cocompact α = Filter.atBot - cocompact_eq_atTop 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMaxOrder α] [OrderBot α] [ClosedIciTopology α] [CompactIccSpace α] : Filter.cocompact α = Filter.atTop - atBot_atTop_le_cocompact 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMinOrder α] [NoMaxOrder α] [OrderClosedTopology α] : Filter.atBot ⊔ Filter.atTop ≤ Filter.cocompact α - cocompact_eq_atBot_atTop 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} [LinearOrder α] [TopologicalSpace α] [NoMaxOrder α] [NoMinOrder α] [OrderClosedTopology α] [CompactIccSpace α] : Filter.cocompact α = Filter.atBot ⊔ Filter.atTop - ContinuousOn.exists_isMaxOn' 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIciTopology α] {s : Set β} {f : β → α} (hf : ContinuousOn f s) (hsc : IsClosed s) {x₀ : β} (h₀ : x₀ ∈ s) (hc : ∀ᶠ (x : β) in Filter.cocompact β ⊓ Filter.principal s, f x ≤ f x₀) : ∃ x ∈ s, IsMaxOn f s x - ContinuousOn.exists_isMinOn' 📋 Mathlib.Topology.Order.Compact
{α : Type u_2} {β : Type u_3} [LinearOrder α] [TopologicalSpace α] [TopologicalSpace β] [ClosedIicTopology α] {s : Set β} {f : β → α} (hf : ContinuousOn f s) (hsc : IsClosed s) {x₀ : β} (h₀ : x₀ ∈ s) (hc : ∀ᶠ (x : β) in Filter.cocompact β ⊓ Filter.principal s, f x₀ ≤ f x) : ∃ x ∈ s, IsMinOn f s x - Metric.cobounded_eq_cocompact 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] : Bornology.cobounded α = Filter.cocompact α - tendsto_dist_left_cocompact_atTop 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] (x : α) : Filter.Tendsto (dist x) (Filter.cocompact α) Filter.atTop - Metric.cobounded_le_cocompact 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] : Bornology.cobounded α ≤ Filter.cocompact α - tendsto_dist_right_cocompact_atTop 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] (x : α) : Filter.Tendsto (fun x_1 => dist x_1 x) (Filter.cocompact α) Filter.atTop - comap_dist_left_atTop_eq_cocompact 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] [ProperSpace α] (x : α) : Filter.comap (dist x) Filter.atTop = Filter.cocompact α - tendsto_cocompact_of_tendsto_dist_comp_atTop 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {β : Type v} [PseudoMetricSpace α] {f : β → α} {l : Filter β} (x : α) (h : Filter.Tendsto (fun y => dist (f y) x) l Filter.atTop) : Filter.Tendsto f l (Filter.cocompact α) - Metric.closedBall_compl_subset_of_mem_cocompact 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} [PseudoMetricSpace α] {s : Set α} (hs : s ∈ Filter.cocompact α) (c : α) : ∃ r, (Metric.closedBall c r)ᶜ ⊆ s - Metric.mem_cocompact_of_closedBall_compl_subset 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] [ProperSpace α] (c : α) (h : ∃ r, (Metric.closedBall c r)ᶜ ⊆ s) : s ∈ Filter.cocompact α - Metric.mem_cocompact_iff_closedBall_compl_subset 📋 Mathlib.Topology.MetricSpace.Bounded
{α : Type u} {s : Set α} [PseudoMetricSpace α] [ProperSpace α] (c : α) : s ∈ Filter.cocompact α ↔ ∃ r, (Metric.closedBall c r)ᶜ ⊆ s - tendsto_norm_cocompact_atTop 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedAddGroup E] [ProperSpace E] : Filter.Tendsto norm (Filter.cocompact E) Filter.atTop - tendsto_norm_cocompact_atTop' 📋 Mathlib.Analysis.Normed.Group.Bounded
{E : Type u_2} [SeminormedGroup E] [ProperSpace E] : Filter.Tendsto norm (Filter.cocompact E) Filter.atTop - instIsMeasurablyGeneratedCocompactOfR1Space 📋 Mathlib.MeasureTheory.Constructions.BorelSpace.Order
{α : Type u_1} [TopologicalSpace α] {mα : MeasurableSpace α} [OpensMeasurableSpace α] [R1Space α] : (Filter.cocompact α).IsMeasurablyGenerated - CocompactMap.cocompact_tendsto' 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] (self : CocompactMap α β) : Filter.Tendsto self.toFun (Filter.cocompact α) (Filter.cocompact β) - CocompactMap.mk 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] (toContinuousMap : C(α, β)) (cocompact_tendsto' : Filter.Tendsto toContinuousMap.toFun (Filter.cocompact α) (Filter.cocompact β)) : CocompactMap α β - CocompactMap.tendsto_of_forall_preimage 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} (h : ∀ (s : Set β), IsCompact s → IsCompact (f ⁻¹' s)) : Filter.Tendsto f (Filter.cocompact α) (Filter.cocompact β) - CocompactMapClass.cocompact_tendsto 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{F : Type u_1} {α : outParam (Type u_2)} {β : outParam (Type u_3)} {inst✝ : TopologicalSpace α} {inst✝¹ : TopologicalSpace β} {inst✝² : FunLike F α β} [self : CocompactMapClass F α β] (f : F) : Filter.Tendsto (⇑f) (Filter.cocompact α) (Filter.cocompact β) - CocompactMapClass.mk 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{F : Type u_1} {α : outParam (Type u_2)} {β : outParam (Type u_3)} [TopologicalSpace α] [TopologicalSpace β] [FunLike F α β] [toContinuousMapClass : ContinuousMapClass F α β] (cocompact_tendsto : ∀ (f : F), Filter.Tendsto (⇑f) (Filter.cocompact α) (Filter.cocompact β)) : CocompactMapClass F α β - CocompactMap.coe_mk 📋 Mathlib.Topology.ContinuousMap.CocompactMap
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : C(α, β)) (h : Filter.Tendsto (⇑f) (Filter.cocompact α) (Filter.cocompact β)) : ⇑{ toContinuousMap := f, cocompact_tendsto' := h } = ⇑f - MeasureTheory.Measure.isAddHaarMeasure_map 📋 Mathlib.MeasureTheory.Group.Measure
{G : Type u_1} [MeasurableSpace G] [AddGroup G] [TopologicalSpace G] (μ : MeasureTheory.Measure G) [μ.IsAddHaarMeasure] [BorelSpace G] [ContinuousAdd G] {H : Type u_3} [AddGroup H] [TopologicalSpace H] [MeasurableSpace H] [BorelSpace H] [IsTopologicalAddGroup H] (f : G →+ H) (hf : Continuous ⇑f) (h_surj : Function.Surjective ⇑f) (h_prop : Filter.Tendsto (⇑f) (Filter.cocompact G) (Filter.cocompact H)) : (MeasureTheory.Measure.map (⇑f) μ).IsAddHaarMeasure - MeasureTheory.Measure.isHaarMeasure_map 📋 Mathlib.MeasureTheory.Group.Measure
{G : Type u_1} [MeasurableSpace G] [Group G] [TopologicalSpace G] (μ : MeasureTheory.Measure G) [μ.IsHaarMeasure] [BorelSpace G] [ContinuousMul G] {H : Type u_3} [Group H] [TopologicalSpace H] [MeasurableSpace H] [BorelSpace H] [IsTopologicalGroup H] (f : G →* H) (hf : Continuous ⇑f) (h_surj : Function.Surjective ⇑f) (h_prop : Filter.Tendsto (⇑f) (Filter.cocompact G) (Filter.cocompact H)) : (MeasureTheory.Measure.map (⇑f) μ).IsHaarMeasure - Complex.tendsto_normSq_cocompact_atTop 📋 Mathlib.Analysis.Complex.Basic
: Filter.Tendsto (⇑Complex.normSq) (Filter.cocompact ℂ) Filter.atTop - Int.tendsto_coe_cofinite 📋 Mathlib.Topology.Instances.ZMultiples
: Filter.Tendsto Int.cast Filter.cofinite (Filter.cocompact ℝ) - Int.tendsto_zmultiplesHom_cofinite 📋 Mathlib.Topology.Instances.ZMultiples
{a : ℝ} (ha : a ≠ 0) : Filter.Tendsto (⇑((zmultiplesHom ℝ) a)) Filter.cofinite (Filter.cocompact ℝ) - AddSubgroup.tendsto_zmultiples_subtype_cofinite 📋 Mathlib.Topology.Instances.ZMultiples
(a : ℝ) : Filter.Tendsto (⇑(AddSubgroup.zmultiples a).subtype) Filter.cofinite (Filter.cocompact ℝ) - MeasureTheory.integrable_iff_integrableAtFilter_cocompact 📋 Mathlib.MeasureTheory.Function.LocallyIntegrable
{X : Type u_1} {ε : Type u_3} [MeasurableSpace X] [TopologicalSpace X] [TopologicalSpace ε] [ContinuousENorm ε] {f : X → ε} {μ : MeasureTheory.Measure X} [TopologicalSpace.PseudoMetrizableSpace ε] : MeasureTheory.Integrable f μ ↔ MeasureTheory.IntegrableAtFilter f (Filter.cocompact X) μ ∧ MeasureTheory.LocallyIntegrable f μ - Continuous.isBounded_range_iff_isBigO 📋 Mathlib.Analysis.Asymptotics.SpecificAsymptotics
{E : Type u_1} [SeminormedAddCommGroup E] {D : Type u_2} [TopologicalSpace D] {f : D → E} (hf : Continuous f) : Bornology.IsBounded (Set.range f) ↔ f =O[Filter.cocompact D] 1 - Differentiable.apply_eq_of_tendsto_cocompact 📋 Mathlib.Analysis.Complex.Liouville
{E : Type u} [NormedAddCommGroup E] [NormedSpace ℂ E] {F : Type v} [NormedAddCommGroup F] [NormedSpace ℂ F] [Nontrivial E] {f : E → F} (hf : Differentiable ℂ f) {c : F} (x : E) (hb : Filter.Tendsto f (Filter.cocompact E) (nhds c)) : f x = c - Differentiable.eq_const_of_tendsto_cocompact 📋 Mathlib.Analysis.Complex.Liouville
{E : Type u} [NormedAddCommGroup E] [NormedSpace ℂ E] {F : Type v} [NormedAddCommGroup F] [NormedSpace ℂ F] [Nontrivial E] {f : E → F} (hf : Differentiable ℂ f) {c : F} (hb : Filter.Tendsto f (Filter.cocompact E) (nhds c)) : f = Function.const E c - isProperMap_iff_tendsto_cocompact 📋 Mathlib.Topology.Maps.Proper.CompactlyGenerated
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] [T2Space Y] [CompactlyCoherentSpace Y] {f : X → Y} : IsProperMap f ↔ Continuous f ∧ Filter.Tendsto f (Filter.cocompact X) (Filter.cocompact Y) - ZeroAtInftyContinuousMap.mk 📋 Mathlib.Topology.ContinuousMap.ZeroAtInfty
{α : Type u} {β : Type v} [TopologicalSpace α] [Zero β] [TopologicalSpace β] (toContinuousMap : C(α, β)) (zero_at_infty' : Filter.Tendsto toContinuousMap.toFun (Filter.cocompact α) (nhds 0)) : ZeroAtInftyContinuousMap α β - ZeroAtInftyContinuousMap.zero_at_infty' 📋 Mathlib.Topology.ContinuousMap.ZeroAtInfty
{α : Type u} {β : Type v} [TopologicalSpace α] [Zero β] [TopologicalSpace β] (self : ZeroAtInftyContinuousMap α β) : Filter.Tendsto self.toFun (Filter.cocompact α) (nhds 0) - ZeroAtInftyContinuousMapClass.zero_at_infty 📋 Mathlib.Topology.ContinuousMap.ZeroAtInfty
{F : Type u_2} {α : outParam (Type u_3)} {β : outParam (Type u_4)} {inst✝ : TopologicalSpace α} {inst✝¹ : Zero β} {inst✝² : TopologicalSpace β} {inst✝³ : FunLike F α β} [self : ZeroAtInftyContinuousMapClass F α β] (f : F) : Filter.Tendsto (⇑f) (Filter.cocompact α) (nhds 0) - ZeroAtInftyContinuousMapClass.mk 📋 Mathlib.Topology.ContinuousMap.ZeroAtInfty
{F : Type u_2} {α : outParam (Type u_3)} {β : outParam (Type u_4)} [TopologicalSpace α] [Zero β] [TopologicalSpace β] [FunLike F α β] [toContinuousMapClass : ContinuousMapClass F α β] (zero_at_infty : ∀ (f : F), Filter.Tendsto (⇑f) (Filter.cocompact α) (nhds 0)) : ZeroAtInftyContinuousMapClass F α β - ZeroAtInftyContinuousMap.coe_mk 📋 Mathlib.Topology.ContinuousMap.ZeroAtInfty
{α : Type u} {β : Type v} [TopologicalSpace α] [TopologicalSpace β] [Zero β] {f : α → β} (hf : Continuous f) (hf' : Filter.Tendsto f (Filter.cocompact α) (nhds 0)) : ⇑{ toFun := f, continuous_toFun := hf, zero_at_infty' := hf' } = f - SchwartzMap.isBigO_cocompact_rpow 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] (f : SchwartzMap E F) [ProperSpace E] (s : ℝ) : ⇑f =O[Filter.cocompact E] fun x => ‖x‖ ^ s - SchwartzMap.isBigO_cocompact_zpow_neg_nat 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] (f : SchwartzMap E F) (k : ℕ) : ⇑f =O[Filter.cocompact E] fun x => ‖x‖ ^ (-↑k) - SchwartzMap.isBigO_cocompact_zpow 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] (f : SchwartzMap E F) [ProperSpace E] (k : ℤ) : ⇑f =O[Filter.cocompact E] fun x => ‖x‖ ^ k - SchwartzMap.tendsto_cocompact 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [ProperSpace E] (f : SchwartzMap E F) : Filter.Tendsto (⇑f) (Filter.cocompact E) (nhds 0) - MeasureTheory.LocallyIntegrable.integrable_of_isBigO_cocompact 📋 Mathlib.MeasureTheory.Integral.Asymptotics
{α : Type u_1} {E : Type u_2} {F : Type u_3} [NormedAddCommGroup E] {f : α → E} {g : α → F} [TopologicalSpace α] [SecondCountableTopology α] [MeasurableSpace α] {μ : MeasureTheory.Measure α} [NormedAddCommGroup F] [(Filter.cocompact α).IsMeasurablyGenerated] (hf : MeasureTheory.LocallyIntegrable f μ) (ho : f =O[Filter.cocompact α] g) (hg : MeasureTheory.IntegrableAtFilter g (Filter.cocompact α) μ) : MeasureTheory.Integrable f μ - Real.tsum_eq_tsum_fourier_of_rpow_decay_of_summable 📋 Mathlib.Analysis.Fourier.PoissonSummation
{f : ℝ → ℂ} (hc : Continuous f) {b : ℝ} (hb : 1 < b) (hf : f =O[Filter.cocompact ℝ] fun x => |x| ^ (-b)) (hFf : Summable fun n => FourierTransform.fourier f ↑n) (x : ℝ) : ∑' (n : ℤ), f (x + ↑n) = ∑' (n : ℤ), FourierTransform.fourier f ↑n * (fourier n) ↑x - Real.tsum_eq_tsum_fourier_of_rpow_decay 📋 Mathlib.Analysis.Fourier.PoissonSummation
{f : ℝ → ℂ} (hc : Continuous f) {b : ℝ} (hb : 1 < b) (hf : f =O[Filter.cocompact ℝ] fun x => |x| ^ (-b)) (hFf : FourierTransform.fourier f =O[Filter.cocompact ℝ] fun x => |x| ^ (-b)) (x : ℝ) : ∑' (n : ℤ), f (x + ↑n) = ∑' (n : ℤ), FourierTransform.fourier f ↑n * (fourier n) ↑x - isBigO_norm_restrict_cocompact 📋 Mathlib.Analysis.Fourier.PoissonSummation
{E : Type u_1} [NormedAddCommGroup E] (f : C(ℝ, E)) {b : ℝ} (hb : 0 < b) (hf : ⇑f =O[Filter.cocompact ℝ] fun x => |x| ^ (-b)) (K : TopologicalSpace.Compacts ℝ) : (fun x => ‖ContinuousMap.restrict (↑K) (f.comp (ContinuousMap.addRight x))‖) =O[Filter.cocompact ℝ] fun x => |x| ^ (-b) - Real.zero_at_infty_fourier 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : ℝ → E) : Filter.Tendsto (FourierTransform.fourier f) (Filter.cocompact ℝ) (nhds 0) - Real.tendsto_integral_exp_smul_cocompact 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : ℝ → E) : Filter.Tendsto (fun w => ∫ (v : ℝ), Real.fourierChar (-(v * w)) • f v) (Filter.cocompact ℝ) (nhds 0) - tendsto_integral_exp_inner_smul_cocompact 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} {V : Type u_2} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : V → E) [NormedAddCommGroup V] [MeasurableSpace V] [BorelSpace V] [InnerProductSpace ℝ V] [FiniteDimensional ℝ V] : Filter.Tendsto (fun w => ∫ (v : V), Real.fourierChar (-inner ℝ v w) • f v) (Filter.cocompact V) (nhds 0) - tendsto_integral_exp_inner_smul_cocompact_of_continuous_compact_support 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} {V : Type u_2} [NormedAddCommGroup E] [NormedSpace ℂ E] {f : V → E} [NormedAddCommGroup V] [MeasurableSpace V] [BorelSpace V] [InnerProductSpace ℝ V] [FiniteDimensional ℝ V] (hf1 : Continuous f) (hf2 : HasCompactSupport f) : Filter.Tendsto (fun w => ∫ (v : V), Real.fourierChar (-inner ℝ v w) • f v) (Filter.cocompact V) (nhds 0) - tendsto_integral_exp_smul_cocompact 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} {V : Type u_2} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : V → E) [AddCommGroup V] [TopologicalSpace V] [IsTopologicalAddGroup V] [T2Space V] [MeasurableSpace V] [BorelSpace V] [Module ℝ V] [ContinuousSMul ℝ V] [FiniteDimensional ℝ V] (μ : MeasureTheory.Measure V) [μ.IsAddHaarMeasure] : Filter.Tendsto (fun w => ∫ (v : V), Real.fourierChar (-w v) • f v ∂μ) (Filter.cocompact (StrongDual ℝ V)) (nhds 0) - tendsto_integral_exp_smul_cocompact_of_inner_product 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} {V : Type u_2} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : V → E) [NormedAddCommGroup V] [MeasurableSpace V] [BorelSpace V] [InnerProductSpace ℝ V] [FiniteDimensional ℝ V] (μ : MeasureTheory.Measure V) [μ.IsAddHaarMeasure] : Filter.Tendsto (fun w => ∫ (v : V), Real.fourierChar (-w v) • f v ∂μ) (Filter.cocompact (StrongDual ℝ V)) (nhds 0) - Real.zero_at_infty_vector_fourierIntegral 📋 Mathlib.Analysis.Fourier.RiemannLebesgueLemma
{E : Type u_1} {V : Type u_2} [NormedAddCommGroup E] [NormedSpace ℂ E] (f : V → E) [AddCommGroup V] [TopologicalSpace V] [IsTopologicalAddGroup V] [T2Space V] [MeasurableSpace V] [BorelSpace V] [Module ℝ V] [ContinuousSMul ℝ V] [FiniteDimensional ℝ V] (μ : MeasureTheory.Measure V) [μ.IsAddHaarMeasure] : Filter.Tendsto (VectorFourier.fourierIntegral Real.fourierChar μ (topDualPairing ℝ V).flip f) (Filter.cocompact (StrongDual ℝ V)) (nhds 0) - Filter.tendsto_cocompact_cocompact_of_norm 📋 Mathlib.Analysis.Normed.Group.CocompactMap
{E : Type u_1} {F : Type u_2} [NormedAddCommGroup E] [NormedAddCommGroup F] [ProperSpace E] {f : E → F} (h : ∀ (ε : ℝ), ∃ r, ∀ (x : E), r < ‖x‖ → ε < ‖f x‖) : Filter.Tendsto f (Filter.cocompact E) (Filter.cocompact F) - zero_at_infty_of_norm_le 📋 Mathlib.Analysis.Normed.Group.ZeroAtInfty
{E : Type u_1} {F : Type u_2} [SeminormedAddGroup E] [SeminormedAddCommGroup F] [ProperSpace E] (f : E → F) (h : ∀ (ε : ℝ), 0 < ε → ∃ r, ∀ (x : E), r < ‖x‖ → ‖f x‖ < ε) : Filter.Tendsto f (Filter.cocompact E) (nhds 0) - isLittleO_exp_neg_mul_sq_cocompact 📋 Mathlib.Analysis.SpecialFunctions.Gaussian.PoissonSummation
{a : ℂ} (ha : 0 < a.re) (s : ℝ) : (fun x => Complex.exp (-a * ↑x ^ 2)) =o[Filter.cocompact ℝ] fun x => |x| ^ s - tendsto_rpow_abs_mul_exp_neg_mul_sq_cocompact 📋 Mathlib.Analysis.SpecialFunctions.Gaussian.PoissonSummation
{a : ℝ} (ha : 0 < a) (s : ℝ) : Filter.Tendsto (fun x => |x| ^ s * Real.exp (-a * x ^ 2)) (Filter.cocompact ℝ) (nhds 0) - cexp_neg_quadratic_isLittleO_abs_rpow_cocompact 📋 Mathlib.Analysis.SpecialFunctions.Gaussian.PoissonSummation
{a : ℂ} (ha : a.re < 0) (b : ℂ) (s : ℝ) : (fun x => Complex.exp (a * ↑x ^ 2 + b * ↑x)) =o[Filter.cocompact ℝ] fun x => |x| ^ s - tendsto_riemannZeta_cofinite_cocompact 📋 Mathlib.NumberTheory.LSeries.ZetaZeros
: Filter.Tendsto Subtype.val Filter.cofinite (Filter.cocompact ℂ) - ModularGroup.tendsto_lcRow0 📋 Mathlib.NumberTheory.Modular
{cd : Fin 2 → ℤ} (hcd : IsCoprime (cd 0) (cd 1)) : Filter.Tendsto (fun g => (ModularGroup.lcRow0 cd) ↑((Matrix.SpecialLinearGroup.map (Int.castRingHom ℝ)) ↑g)) Filter.cofinite (Filter.cocompact ℝ) - Rat.not_countably_generated_cocompact 📋 Mathlib.Topology.Instances.RatLemmas
: ¬(Filter.cocompact ℚ).IsCountablyGenerated - Rat.cocompact_inf_nhds_neBot 📋 Mathlib.Topology.Instances.RatLemmas
{p : ℚ} : (Filter.cocompact ℚ ⊓ nhds p).NeBot
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c