Documentation

Mathlib.Topology.NhdsKer

Neighborhoods kernel of a set #

In Mathlib/Topology/Defs/Filter.lean, nhdsKer s is defined to be the intersection of all neighborhoods of s. Note that this construction has no standard name in the literature.

In this file we prove basic properties of this operation.

theorem mem_nhdsKer {X : Type u_2} [TopologicalSpace X] {s : Set X} {x : X} :
x โˆˆ nhdsKer s โ†” โˆ€ (U : Set X), IsOpen U โ†’ s โІ U โ†’ x โˆˆ U
theorem subset_nhdsKer_iff {X : Type u_2} [TopologicalSpace X] {s t : Set X} :
s โІ nhdsKer t โ†” โˆ€ (U : Set X), IsOpen U โ†’ t โІ U โ†’ s โІ U
theorem nhdsKer_minimal {X : Type u_2} [TopologicalSpace X] {s t : Set X} (hโ‚ : s โІ t) (hโ‚‚ : IsOpen t) :
@[simp]
theorem nhdsKer_iUnion {ฮน : Sort u_1} {X : Type u_2} [TopologicalSpace X] (s : ฮน โ†’ Set X) :
nhdsKer (โ‹ƒ (i : ฮน), s i) = โ‹ƒ (i : ฮน), nhdsKer (s i)
theorem nhdsKer_biUnion {X : Type u_2} [TopologicalSpace X] {ฮน : Type u_3} (s : Set ฮน) (t : ฮน โ†’ Set X) :
nhdsKer (โ‹ƒ i โˆˆ s, t i) = โ‹ƒ i โˆˆ s, nhdsKer (t i)
@[simp]
theorem nhdsKer_sUnion {X : Type u_2} [TopologicalSpace X] (S : Set (Set X)) :
nhdsKer (โ‹ƒโ‚€ S) = โ‹ƒ s โˆˆ S, nhdsKer s
theorem mem_nhdsKer_iff_specializes {X : Type u_2} [TopologicalSpace X] {s : Set X} {x : X} :
x โˆˆ nhdsKer s โ†” โˆƒ y โˆˆ s, x โคณ y
theorem nhdsKer_subset_nhdsKer {X : Type u_2} [TopologicalSpace X] {s t : Set X} (h : s โІ t) :

This name was used to be used for the Iff version, see nhdsKer_subset_nhdsKer_iff_nhdsSet.

theorem nhdsKer_iInter_subset {ฮน : Sort u_1} {X : Type u_2} [TopologicalSpace X] {s : ฮน โ†’ Set X} :
nhdsKer (โ‹‚ (i : ฮน), s i) โІ โ‹‚ (i : ฮน), nhdsKer (s i)
theorem nhdsKer_singleton_pi {ฮน : Type u_3} {X : ฮน โ†’ Type u_4} [(i : ฮน) โ†’ TopologicalSpace (X i)] (p : (i : ฮน) โ†’ X i) :
nhdsKer {p} = Set.univ.pi fun (i : ฮน) => nhdsKer {p i}
theorem nhdsKer_pi {ฮน : Type u_3} {X : ฮน โ†’ Type u_4} [(i : ฮน) โ†’ TopologicalSpace (X i)] (s : (i : ฮน) โ†’ Set (X i)) :
nhdsKer (Set.univ.pi s) = Set.univ.pi fun (i : ฮน) => nhdsKer (s i)