Lindelöf sets and Lindelöf spaces

Main definitions

We define the following properties for sets in a topological space:

• IsLindelof s: Two definitions are possible here. The more standard definition is that every open cover that contains s contains a countable subcover. We choose for the equivalent definition where we require that every nontrivial filter on s with the countable intersection property has a clusterpoint. Equivalence is established in isLindelof_iff_countable_subcover.
• LindelofSpace X: X is Lindelöf if it is Lindelöf as a set.
• NonLindelofSpace: a space that is not a Lindëlof space, e.g. the Long Line.

Main results

• isLindelof_iff_countable_subcover: A set is Lindelöf iff every open cover has a countable subcover.

Implementation details

• This API is mainly based on the API for IsCompact and follows notation and style as much as possible.

def IsLindelof {X : Type u} [TopologicalSpace X] (s : Set X) : Prop

A set s is Lindelöf if every nontrivial filter f with the countable intersection property that contains s, has a clusterpoint in s. The filter-free definition is given by isLindelof_iff_countable_subcover.

Equations

• IsLindelof s = ∀ ⦃f : Filter X⦄ [inst : f.NeBot] [inst : CountableInterFilter f], f ≤ Filter.principal s → ∃ x ∈ s, ClusterPt x f

theorem IsLindelof.compl_mem_sets {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) {f : Filter X} [CountableInterFilter f] (hf : ∀ x ∈ s, sᶜ ∈ nhds x ⊓ f) : sᶜ ∈ f

The complement to a Lindelöf set belongs to a filter f with the countable intersection property if it belongs to each filter 𝓝 x ⊓ f, x ∈ s.

theorem IsLindelof.compl_mem_sets_of_nhdsWithin {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) {f : Filter X} [CountableInterFilter f] (hf : ∀ x ∈ s, ∃ t ∈ nhdsWithin x s, tᶜ ∈ f) : sᶜ ∈ f

The complement to a Lindelöf set belongs to a filter f with the countable intersection property if each x ∈ s has a neighborhood t within s such that tᶜ belongs to f.

theorem IsLindelof.induction_on {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) {p : Set X → Prop} (hmono : ∀ ⦃s t : Set X⦄, s ⊆ t → p t → p s) (hcountable_union : ∀ (S : Set (Set X)), S.Countable → (∀ s ∈ S, p s) → p (⋃₀ S)) (hnhds : ∀ x ∈ s, ∃ t ∈ nhdsWithin x s, p t) : p s

If p : Set X → Prop is stable under restriction and union, and each point x of a Lindelöf set s has a neighborhood t within s such that p t, then p s holds.

theorem IsLindelof.inter_right {X : Type u} [TopologicalSpace X] {s t : Set X} (hs : IsLindelof s) (ht : IsClosed t) : IsLindelof (s ∩ t)

The intersection of a Lindelöf set and a closed set is a Lindelöf set.

theorem IsLindelof.inter_left {X : Type u} [TopologicalSpace X] {s t : Set X} (ht : IsLindelof t) (hs : IsClosed s) : IsLindelof (s ∩ t)

The intersection of a closed set and a Lindelöf set is a Lindelöf set.

theorem IsLindelof.diff {X : Type u} [TopologicalSpace X] {s t : Set X} (hs : IsLindelof s) (ht : IsOpen t) : IsLindelof (s \ t)

The set difference of a Lindelöf set and an open set is a Lindelöf set.

theorem IsLindelof.of_isClosed_subset {X : Type u} [TopologicalSpace X] {s t : Set X} (hs : IsLindelof s) (ht : IsClosed t) (h : t ⊆ s) : IsLindelof t

A closed subset of a Lindelöf set is a Lindelöf set.

theorem IsLindelof.image_of_continuousOn {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hs : IsLindelof s) (hf : ContinuousOn f s) : IsLindelof (f '' s)

A continuous image of a Lindelöf set is a Lindelöf set.

theorem IsLindelof.image {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hs : IsLindelof s) (hf : Continuous f) : IsLindelof (f '' s)

A continuous image of a Lindelöf set is a Lindelöf set within the codomain.

theorem IsLindelof.adherence_nhdset {X : Type u} [TopologicalSpace X] {s t : Set X} {f : Filter X} [CountableInterFilter f] (hs : IsLindelof s) (hf₂ : f ≤ Filter.principal s) (ht₁ : IsOpen t) (ht₂ : ∀ x ∈ s, ClusterPt x f → x ∈ t) : t ∈ f

A filter with the countable intersection property that is finer than the principal filter on a Lindelöf set s contains any open set that contains all clusterpoints of s.

theorem IsLindelof.elim_countable_subcover {X : Type u} [TopologicalSpace X] {s : Set X} {ι : Type v} (hs : IsLindelof s) (U : ι → Set X) (hUo : ∀ (i : ι), IsOpen (U i)) (hsU : s ⊆ ⋃ (i : ι), U i) : ∃ (r : Set ι), r.Countable ∧ s ⊆ ⋃ i ∈ r, U i

For every open cover of a Lindelöf set, there exists a countable subcover.

theorem IsLindelof.elim_nhds_subcover' {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) (U : (x : X) → x ∈ s → Set X) (hU : ∀ (x : X) (hx : x ∈ s), U x hx ∈ nhds x) : ∃ (t : Set ↑s), t.Countable ∧ s ⊆ ⋃ x ∈ t, U ↑x ⋯

theorem IsLindelof.elim_nhds_subcover {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) (U : X → Set X) (hU : ∀ x ∈ s, U x ∈ nhds x) : ∃ (t : Set X), t.Countable ∧ (∀ x ∈ t, x ∈ s) ∧ s ⊆ ⋃ x ∈ t, U x

theorem IsLindelof.indexed_countable_subcover {X : Type u} [TopologicalSpace X] {s : Set X} {ι : Type v} [Nonempty ι] (hs : IsLindelof s) (U : ι → Set X) (hUo : ∀ (i : ι), IsOpen (U i)) (hsU : s ⊆ ⋃ (i : ι), U i) : ∃ (f : ℕ → ι), s ⊆ ⋃ (n : ℕ), U (f n)

For every nonempty open cover of a Lindelöf set, there exists a subcover indexed by ℕ.

theorem IsLindelof.disjoint_nhdsSet_left {X : Type u} [TopologicalSpace X] {s : Set X} {l : Filter X} [CountableInterFilter l] (hs : IsLindelof s) : Disjoint (nhdsSet s) l ↔ ∀ x ∈ s, Disjoint (nhds x) l

The neighborhood filter of a Lindelöf set is disjoint with a filter l with the countable intersection property if and only if the neighborhood filter of each point of this set is disjoint with l.

theorem IsLindelof.disjoint_nhdsSet_right {X : Type u} [TopologicalSpace X] {s : Set X} {l : Filter X} [CountableInterFilter l] (hs : IsLindelof s) : Disjoint l (nhdsSet s) ↔ ∀ x ∈ s, Disjoint l (nhds x)

A filter l with the countable intersection property is disjoint with the neighborhood filter of a Lindelöf set if and only if it is disjoint with the neighborhood filter of each point of this set.

theorem IsLindelof.elim_countable_subfamily_closed {X : Type u} [TopologicalSpace X] {s : Set X} {ι : Type v} (hs : IsLindelof s) (t : ι → Set X) (htc : ∀ (i : ι), IsClosed (t i)) (hst : s ∩ ⋂ (i : ι), t i = ∅) : ∃ (u : Set ι), u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅

For every family of closed sets whose intersection avoids a Lindelö set, there exists a countable subfamily whose intersection avoids this Lindelöf set.

theorem IsLindelof.inter_iInter_nonempty {X : Type u} [TopologicalSpace X] {s : Set X} {ι : Type v} (hs : IsLindelof s) (t : ι → Set X) (htc : ∀ (i : ι), IsClosed (t i)) (hst : ∀ (u : Set ι), u.Countable ∧ (s ∩ ⋂ i ∈ u, t i).Nonempty) : (s ∩ ⋂ (i : ι), t i).Nonempty

To show that a Lindelöf set intersects the intersection of a family of closed sets, it is sufficient to show that it intersects every countable subfamily.

theorem IsLindelof.elim_countable_subcover_image {X : Type u} {ι : Type u_1} [TopologicalSpace X] {s : Set X} {b : Set ι} {c : ι → Set X} (hs : IsLindelof s) (hc₁ : ∀ i ∈ b, IsOpen (c i)) (hc₂ : s ⊆ ⋃ i ∈ b, c i) : ∃ b' ⊆ b, b'.Countable ∧ s ⊆ ⋃ i ∈ b', c i

For every open cover of a Lindelöf set, there exists a countable subcover.

theorem isLindelof_of_countable_subcover {X : Type u} [TopologicalSpace X] {s : Set X} (h : ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ (i : ι), U i → ∃ (t : Set ι), t.Countable ∧ s ⊆ ⋃ i ∈ t, U i) : IsLindelof s

A set s is Lindelöf if for every open cover of s, there exists a countable subcover.

theorem isLindelof_of_countable_subfamily_closed {X : Type u} [TopologicalSpace X] {s : Set X} (h : ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → s ∩ ⋂ (i : ι), t i = ∅ → ∃ (u : Set ι), u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅) : IsLindelof s

A set s is Lindelöf if for every family of closed sets whose intersection avoids s, there exists a countable subfamily whose intersection avoids s.

theorem isLindelof_iff_countable_subcover {X : Type u} [TopologicalSpace X] {s : Set X} : IsLindelof s ↔ ∀ {ι : Type u} (U : ι → Set X), (∀ (i : ι), IsOpen (U i)) → s ⊆ ⋃ (i : ι), U i → ∃ (t : Set ι), t.Countable ∧ s ⊆ ⋃ i ∈ t, U i

A set s is Lindelöf if and only if for every open cover of s, there exists a countable subcover.

theorem isLindelof_iff_countable_subfamily_closed {X : Type u} [TopologicalSpace X] {s : Set X} : IsLindelof s ↔ ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → s ∩ ⋂ (i : ι), t i = ∅ → ∃ (u : Set ι), u.Countable ∧ s ∩ ⋂ i ∈ u, t i = ∅

A set s is Lindelöf if and only if for every family of closed sets whose intersection avoids s, there exists a countable subfamily whose intersection avoids s.

@[simp]

theorem isLindelof_empty {X : Type u} [TopologicalSpace X] : IsLindelof ∅

The empty set is a Lindelof set.

@[simp]

theorem isLindelof_singleton {X : Type u} [TopologicalSpace X] {x : X} : IsLindelof {x}

A singleton set is a Lindelof set.

theorem Set.Subsingleton.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : s.Subsingleton) : IsLindelof s

theorem Set.Countable.isLindelof_biUnion {X : Type u} {ι : Type u_1} [TopologicalSpace X] {s : Set ι} {f : ι → Set X} (hs : s.Countable) (hf : ∀ i ∈ s, IsLindelof (f i)) : IsLindelof (⋃ i ∈ s, f i)

theorem Set.Finite.isLindelof_biUnion {X : Type u} {ι : Type u_1} [TopologicalSpace X] {s : Set ι} {f : ι → Set X} (hs : s.Finite) (hf : ∀ i ∈ s, IsLindelof (f i)) : IsLindelof (⋃ i ∈ s, f i)

theorem Finset.isLindelof_biUnion {X : Type u} {ι : Type u_1} [TopologicalSpace X] (s : Finset ι) {f : ι → Set X} (hf : ∀ i ∈ s, IsLindelof (f i)) : IsLindelof (⋃ i ∈ s, f i)

theorem isLindelof_accumulate {X : Type u} [TopologicalSpace X] {K : ℕ → Set X} (hK : ∀ (n : ℕ), IsLindelof (K n)) (n : ℕ) : IsLindelof (Set.Accumulate K n)

theorem Set.Countable.isLindelof_sUnion {X : Type u} [TopologicalSpace X] {S : Set (Set X)} (hf : S.Countable) (hc : ∀ s ∈ S, IsLindelof s) : IsLindelof (⋃₀ S)

theorem Set.Finite.isLindelof_sUnion {X : Type u} [TopologicalSpace X] {S : Set (Set X)} (hf : S.Finite) (hc : ∀ s ∈ S, IsLindelof s) : IsLindelof (⋃₀ S)

theorem isLindelof_iUnion {X : Type u} [TopologicalSpace X] {ι : Sort u_2} {f : ι → Set X} [Countable ι] (h : ∀ (i : ι), IsLindelof (f i)) : IsLindelof (⋃ (i : ι), f i)

theorem Set.Countable.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : s.Countable) : IsLindelof s

theorem Set.Finite.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : s.Finite) : IsLindelof s

theorem IsLindelof.countable_of_discrete {X : Type u} [TopologicalSpace X] {s : Set X} [DiscreteTopology X] (hs : IsLindelof s) : s.Countable

theorem isLindelof_iff_countable {X : Type u} [TopologicalSpace X] {s : Set X} [DiscreteTopology X] : IsLindelof s ↔ s.Countable

theorem IsLindelof.union {X : Type u} [TopologicalSpace X] {s t : Set X} (hs : IsLindelof s) (ht : IsLindelof t) : IsLindelof (s ∪ t)

theorem IsLindelof.insert {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) (a : X) : IsLindelof (insert a s)

theorem isLindelof_open_iff_eq_countable_iUnion_of_isTopologicalBasis {X : Type u} {ι : Type u_1} [TopologicalSpace X] (b : ι → Set X) (hb : TopologicalSpace.IsTopologicalBasis (Set.range b)) (hb' : ∀ (i : ι), IsLindelof (b i)) (U : Set X) : IsLindelof U ∧ IsOpen U ↔ ∃ (s : Set ι), s.Countable ∧ U = ⋃ i ∈ s, b i

If X has a basis consisting of compact opens, then an open set in X is compact open iff it is a finite union of some elements in the basis

def Filter.coLindelof (X : Type u_2) [TopologicalSpace X] : Filter X

Filter.coLindelof is the filter generated by complements to Lindelöf sets.

Equations

• Filter.coLindelof X = ⨅ (s : Set X), ⨅ (_ : IsLindelof s), Filter.principal sᶜ

theorem hasBasis_coLindelof {X : Type u} [TopologicalSpace X] : (Filter.coLindelof X).HasBasis IsLindelof compl

theorem mem_coLindelof {X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.coLindelof X ↔ ∃ (t : Set X), IsLindelof t ∧ tᶜ ⊆ s

theorem mem_coLindelof' {X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.coLindelof X ↔ ∃ (t : Set X), IsLindelof t ∧ sᶜ ⊆ t

theorem IsLindelof.compl_mem_coLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) : sᶜ ∈ Filter.coLindelof X

theorem coLindelof_le_cofinite {X : Type u} [TopologicalSpace X] : Filter.coLindelof X ≤ Filter.cofinite

theorem Tendsto.isLindelof_insert_range_of_coLindelof {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} {y : Y} (hf : Filter.Tendsto f (Filter.coLindelof X) (nhds y)) (hfc : Continuous f) : IsLindelof (insert y (Set.range f))

def Filter.coclosedLindelof (X : Type u_2) [TopologicalSpace X] : Filter X

Filter.coclosedLindelof is the filter generated by complements to closed Lindelof sets.

Equations

• Filter.coclosedLindelof X = ⨅ (s : Set X), ⨅ (_ : IsClosed s), ⨅ (_ : IsLindelof s), Filter.principal sᶜ

theorem hasBasis_coclosedLindelof {X : Type u} [TopologicalSpace X] : (Filter.coclosedLindelof X).HasBasis (fun (s : Set X) => IsClosed s ∧ IsLindelof s) compl

theorem mem_coclosedLindelof {X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.coclosedLindelof X ↔ ∃ (t : Set X), IsClosed t ∧ IsLindelof t ∧ tᶜ ⊆ s

theorem mem_coclosed_Lindelof' {X : Type u} [TopologicalSpace X] {s : Set X} : s ∈ Filter.coclosedLindelof X ↔ ∃ (t : Set X), IsClosed t ∧ IsLindelof t ∧ sᶜ ⊆ t

theorem coLindelof_le_coclosedLindelof {X : Type u} [TopologicalSpace X] : Filter.coLindelof X ≤ Filter.coclosedLindelof X

theorem IsLindeof.compl_mem_coclosedLindelof_of_isClosed {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) (hs' : IsClosed s) : sᶜ ∈ Filter.coclosedLindelof X

class LindelofSpace (X : Type u_2) [TopologicalSpace X] : Prop

X is a Lindelöf space iff every open cover has a countable subcover.

• isLindelof_univ : IsLindelof Set.univ

  In a Lindelöf space, Set.univ is a Lindelöf set.

@[instance 10]

instance Subsingleton.lindelofSpace {X : Type u} [TopologicalSpace X] [Subsingleton X] : LindelofSpace X

theorem isLindelof_univ_iff {X : Type u} [TopologicalSpace X] : IsLindelof Set.univ ↔ LindelofSpace X

theorem isLindelof_univ {X : Type u} [TopologicalSpace X] [h : LindelofSpace X] : IsLindelof Set.univ

theorem cluster_point_of_Lindelof {X : Type u} [TopologicalSpace X] [LindelofSpace X] (f : Filter X) [f.NeBot] [CountableInterFilter f] : ∃ (x : X), ClusterPt x f

theorem LindelofSpace.elim_nhds_subcover {X : Type u} [TopologicalSpace X] [LindelofSpace X] (U : X → Set X) (hU : ∀ (x : X), U x ∈ nhds x) : ∃ (t : Set X), t.Countable ∧ ⋃ x ∈ t, U x = Set.univ

theorem lindelofSpace_of_countable_subfamily_closed {X : Type u} [TopologicalSpace X] (h : ∀ {ι : Type u} (t : ι → Set X), (∀ (i : ι), IsClosed (t i)) → ⋂ (i : ι), t i = ∅ → ∃ (u : Set ι), u.Countable ∧ ⋂ i ∈ u, t i = ∅) : LindelofSpace X

theorem IsClosed.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} [LindelofSpace X] (h : IsClosed s) : IsLindelof s

theorem IsCompact.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsCompact s) : IsLindelof s

A compact set s is Lindelöf.

theorem IsSigmaCompact.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsSigmaCompact s) : IsLindelof s

A σ-compact set s is Lindelöf

@[instance 100]

instance instLindelofSpaceOfCompactSpace {X : Type u} [TopologicalSpace X] [CompactSpace X] : LindelofSpace X

A compact space X is Lindelöf.

@[instance 100]

instance instLindelofSpaceOfSigmaCompactSpace {X : Type u} [TopologicalSpace X] [SigmaCompactSpace X] : LindelofSpace X

A sigma-compact space X is Lindelöf.

class NonLindelofSpace (X : Type u_2) [TopologicalSpace X] : Prop

X is a non-Lindelöf topological space if it is not a Lindelöf space.

• nonLindelof_univ : ¬IsLindelof Set.univ

  In a non-Lindelöf space, Set.univ is not a Lindelöf set.

theorem nonLindelof_univ (X : Type u_2) [TopologicalSpace X] [NonLindelofSpace X] : ¬IsLindelof Set.univ

theorem IsLindelof.ne_univ {X : Type u} [TopologicalSpace X] {s : Set X} [NonLindelofSpace X] (hs : IsLindelof s) : s ≠ Set.univ

instance instNeBotCoLindelofOfNonLindelofSpace {X : Type u} [TopologicalSpace X] [NonLindelofSpace X] : (Filter.coLindelof X).NeBot

@[simp]

theorem Filter.coLindelof_eq_bot {X : Type u} [TopologicalSpace X] [LindelofSpace X] : Filter.coLindelof X = ⊥

instance instNeBotCoclosedLindelofOfNonLindelofSpace {X : Type u} [TopologicalSpace X] [NonLindelofSpace X] : (Filter.coclosedLindelof X).NeBot

theorem nonLindelofSpace_of_neBot {X : Type u} [TopologicalSpace X] : (Filter.coLindelof X).NeBot → NonLindelofSpace X

theorem Filter.coLindelof_neBot_iff {X : Type u} [TopologicalSpace X] : (Filter.coLindelof X).NeBot ↔ NonLindelofSpace X

theorem not_LindelofSpace_iff {X : Type u} [TopologicalSpace X] : ¬LindelofSpace X ↔ NonLindelofSpace X

@[instance 100]

instance instLindelofSpaceOfCompactSpace_1 {X : Type u} [TopologicalSpace X] [CompactSpace X] : LindelofSpace X

A compact space X is Lindelöf.

theorem countable_of_Lindelof_of_discrete {X : Type u} [TopologicalSpace X] [LindelofSpace X] [DiscreteTopology X] : Countable X

theorem countable_cover_nhds_interior {X : Type u} [TopologicalSpace X] [LindelofSpace X] {U : X → Set X} (hU : ∀ (x : X), U x ∈ nhds x) : ∃ (t : Set X), t.Countable ∧ ⋃ x ∈ t, interior (U x) = Set.univ

theorem countable_cover_nhds {X : Type u} [TopologicalSpace X] [LindelofSpace X] {U : X → Set X} (hU : ∀ (x : X), U x ∈ nhds x) : ∃ (t : Set X), t.Countable ∧ ⋃ x ∈ t, U x = Set.univ

theorem Filter.comap_coLindelof_le {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Continuous f) : Filter.comap f (Filter.coLindelof Y) ≤ Filter.coLindelof X

The comap of the coLindelöf filter on Y by a continuous function f : X → Y is less than or equal to the coLindelöf filter on X. This is a reformulation of the fact that images of Lindelöf sets are Lindelöf.

theorem isLindelof_range {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [LindelofSpace X] {f : X → Y} (hf : Continuous f) : IsLindelof (Set.range f)

theorem isLindelof_diagonal {X : Type u} [TopologicalSpace X] [LindelofSpace X] : IsLindelof (Set.diagonal X)

theorem Topology.IsInducing.isLindelof_iff {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hf : Topology.IsInducing f) : IsLindelof s ↔ IsLindelof (f '' s)

If f : X → Y is an inducing map, the image f '' s of a set s is Lindelöf if and only if s is compact.

@[deprecated Topology.IsInducing.isLindelof_iff]

theorem Inducing.isLindelof_iff {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hf : Topology.IsInducing f) : IsLindelof s ↔ IsLindelof (f '' s)

Alias of Topology.IsInducing.isLindelof_iff.

---

If f : X → Y is an inducing map, the image f '' s of a set s is Lindelöf if and only if s is compact.

theorem Topology.IsEmbedding.isLindelof_iff {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hf : Topology.IsEmbedding f) : IsLindelof s ↔ IsLindelof (f '' s)

If f : X → Y is an Embedding, the image f '' s of a set s is Lindelöf if and only if s is Lindelöf.

@[deprecated Topology.IsEmbedding.isLindelof_iff]

theorem Embedding.isLindelof_iff {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {s : Set X} {f : X → Y} (hf : Topology.IsEmbedding f) : IsLindelof s ↔ IsLindelof (f '' s)

Alias of Topology.IsEmbedding.isLindelof_iff.

---

If f : X → Y is an Embedding, the image f '' s of a set s is Lindelöf if and only if s is Lindelöf.

theorem Topology.IsInducing.isLindelof_preimage {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsInducing f) (hf' : IsClosed (Set.range f)) {K : Set Y} (hK : IsLindelof K) : IsLindelof (f ⁻¹' K)

The preimage of a Lindelöf set under an inducing map is a Lindelöf set.

@[deprecated Topology.IsInducing.isLindelof_preimage]

theorem Inducing.isLindelof_preimage {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsInducing f) (hf' : IsClosed (Set.range f)) {K : Set Y} (hK : IsLindelof K) : IsLindelof (f ⁻¹' K)

Alias of Topology.IsInducing.isLindelof_preimage.

---

The preimage of a Lindelöf set under an inducing map is a Lindelöf set.

theorem Topology.IsClosedEmbedding.isLindelof_preimage {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) {K : Set Y} (hK : IsLindelof K) : IsLindelof (f ⁻¹' K)

The preimage of a Lindelöf set under a closed embedding is a Lindelöf set.

@[deprecated Topology.IsClosedEmbedding.isLindelof_preimage]

theorem ClosedEmbedding.isLindelof_preimage {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) {K : Set Y} (hK : IsLindelof K) : IsLindelof (f ⁻¹' K)

Alias of Topology.IsClosedEmbedding.isLindelof_preimage.

---

The preimage of a Lindelöf set under a closed embedding is a Lindelöf set.

theorem Topology.IsClosedEmbedding.tendsto_coLindelof {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : Filter.Tendsto f (Filter.coLindelof X) (Filter.coLindelof Y)

A closed embedding is proper, ie, inverse images of Lindelöf sets are contained in Lindelöf. Moreover, the preimage of a Lindelöf set is Lindelöf, see Topology.IsClosedEmbedding.isLindelof_preimage.

@[deprecated Topology.IsClosedEmbedding.tendsto_coLindelof]

theorem ClosedEmbedding.tendsto_coLindelof {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : Filter.Tendsto f (Filter.coLindelof X) (Filter.coLindelof Y)

Alias of Topology.IsClosedEmbedding.tendsto_coLindelof.

---

A closed embedding is proper, ie, inverse images of Lindelöf sets are contained in Lindelöf. Moreover, the preimage of a Lindelöf set is Lindelöf, see Topology.IsClosedEmbedding.isLindelof_preimage.

theorem Subtype.isLindelof_iff {X : Type u} [TopologicalSpace X] {p : X → Prop} {s : Set { x : X // p x }} : IsLindelof s ↔ IsLindelof (Subtype.val '' s)

Sets of subtype are Lindelöf iff the image under a coercion is.

theorem isLindelof_iff_isLindelof_univ {X : Type u} [TopologicalSpace X] {s : Set X} : IsLindelof s ↔ IsLindelof Set.univ

theorem isLindelof_iff_LindelofSpace {X : Type u} [TopologicalSpace X] {s : Set X} : IsLindelof s ↔ LindelofSpace ↑s

theorem IsLindelof.of_coe {X : Type u} [TopologicalSpace X] {s : Set X} [LindelofSpace ↑s] : IsLindelof s

theorem IsLindelof.countable {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsLindelof s) (hs' : DiscreteTopology ↑s) : s.Countable

theorem Topology.IsClosedEmbedding.nonLindelofSpace {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [NonLindelofSpace X] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : NonLindelofSpace Y

@[deprecated Topology.IsClosedEmbedding.nonLindelofSpace]

theorem ClosedEmbedding.nonLindelofSpace {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [NonLindelofSpace X] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : NonLindelofSpace Y

Alias of Topology.IsClosedEmbedding.nonLindelofSpace.

theorem Topology.IsClosedEmbedding.LindelofSpace {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [h : LindelofSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : LindelofSpace X

@[deprecated Topology.IsClosedEmbedding.LindelofSpace]

theorem ClosedEmbedding.LindelofSpace {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [h : LindelofSpace Y] {f : X → Y} (hf : Topology.IsClosedEmbedding f) : LindelofSpace X

Alias of Topology.IsClosedEmbedding.LindelofSpace.

@[instance 100]

instance Countable.LindelofSpace {X : Type u} [TopologicalSpace X] [Countable X] : LindelofSpace X

Countable topological spaces are Lindelof.

instance instLindelofSpaceSum {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] [LindelofSpace X] [LindelofSpace Y] : LindelofSpace (X ⊕ Y)

The disjoint union of two Lindelöf spaces is Lindelöf.

instance instLindelofSpaceSigmaOfCountable {ι : Type u_1} {X : ι → Type u_2} [Countable ι] [(i : ι) → TopologicalSpace (X i)] [∀ (i : ι), LindelofSpace (X i)] : LindelofSpace ((i : ι) × X i)

instance Quot.LindelofSpace {X : Type u} [TopologicalSpace X] {r : X → X → Prop} [LindelofSpace X] : LindelofSpace (Quot r)

instance Quotient.LindelofSpace {X : Type u} [TopologicalSpace X] {s : Setoid X} [LindelofSpace X] : LindelofSpace (Quotient s)

theorem LindelofSpace.of_continuous_surjective {X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f : X → Y} [LindelofSpace X] (hf : Continuous f) (hsur : Function.Surjective f) : LindelofSpace Y

A continuous image of a Lindelöf set is a Lindelöf set within the codomain.

def IsHereditarilyLindelof {X : Type u} [TopologicalSpace X] (s : Set X) : Prop

A set s is Hereditarily Lindelöf if every subset is a Lindelof set. We require this only for open sets in the definition, and then conclude that this holds for all sets by ADD.

Equations

• IsHereditarilyLindelof s = ∀ t ⊆ s, IsLindelof t

class HereditarilyLindelofSpace (X : Type u_2) [TopologicalSpace X] : Prop

Type class for Hereditarily Lindelöf spaces.

• isHereditarilyLindelof_univ : IsHereditarilyLindelof Set.univ

  In a Hereditarily Lindelöf space, Set.univ is a Hereditarily Lindelöf set.

theorem IsHereditarilyLindelof.isLindelof_subset {X : Type u} [TopologicalSpace X] {s t : Set X} (hs : IsHereditarilyLindelof s) (ht : t ⊆ s) : IsLindelof t

theorem IsHereditarilyLindelof.isLindelof {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsHereditarilyLindelof s) : IsLindelof s

@[instance 100]

instance HereditarilyLindelof.to_Lindelof {X : Type u} [TopologicalSpace X] [HereditarilyLindelofSpace X] : LindelofSpace X

theorem HereditarilyLindelof_LindelofSets {X : Type u} [TopologicalSpace X] [HereditarilyLindelofSpace X] (s : Set X) : IsLindelof s

@[instance 100]

instance SecondCountableTopology.toHereditarilyLindelof {X : Type u} [TopologicalSpace X] [SecondCountableTopology X] : HereditarilyLindelofSpace X

theorem eq_open_union_countable {X : Type u} [TopologicalSpace X] [HereditarilyLindelofSpace X] {ι : Type u} (U : ι → Set X) (h : ∀ (i : ι), IsOpen (U i)) : ∃ (t : Set ι), t.Countable ∧ ⋃ i ∈ t, U i = ⋃ (i : ι), U i

instance HereditarilyLindelof.lindelofSpace_subtype {X : Type u} [TopologicalSpace X] [HereditarilyLindelofSpace X] (p : X → Prop) : LindelofSpace { x : X // p x }