Networks and monolithic spaces

DefinitionCountable network#βœ“fully proved

A topological space \(X\) has a countable network if there is a countable family \(\mathcal{N}\) of subsets of \(X\) such that for every open set \(U \subseteq X\) and every point \(x \in U\) there is some \(V \in \mathcal{N}\) with \(x \in V \subseteq U\).

Network sets need not themselves be open.

def HasCountableNetwork (X : Type*) [TopologicalSpace X] : Prop :=
  βˆƒ 𝒩 : Set (Set X), 𝒩.Countable ∧
    βˆ€ ⦃U : Set X⦄, IsOpen U β†’ βˆ€ x ∈ U,
      βˆƒ V ∈ 𝒩, x ∈ V ∧ V βŠ† U
Used by 2

TheoremSecond-countable spaces have a countable network#βœ“fully proved

Every second-countable topological space has a countable network.

theorem hasCountableNetwork_of_secondCountable (X : Type*) [TopologicalSpace X]
    [SecondCountableTopology X] : HasCountableNetwork X
Uses 1
Statement usesCountable network

ClassCountably monolithic space#βœ“fully proved

A topological space is countably monolithic (Ο‰-monolithic) if the closure of every countable subspace has a countable network.

class CountablyMonolithicSpace (X : Type*) [TopologicalSpace X] : Prop where
  hasCountableNetwork_closure_of_countable :
    βˆ€ ⦃s : Set X⦄, s.Countable β†’ HasCountableNetwork β†₯(closure s)
Uses 1
Statement usesCountable network
3 fully proved

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.