# Ordering on topologies and (co)induced topologies #

Topologies on a fixed type α are ordered, by reverse inclusion. That is, for topologies t₁ and t₂ on α, we write t₁ ≤ t₂ if every set open in t₂ is also open in t₁. (One also calls t₁ finer than t₂, and t₂ coarser than t₁.)

Any function f : α → β induces

• TopologicalSpace.induced f : TopologicalSpace β → TopologicalSpace α;
• TopologicalSpace.coinduced f : TopologicalSpace α → TopologicalSpace β.

Continuity, the ordering on topologies and (co)induced topologies are related as follows:

• The identity map (α, t₁) → (α, t₂) is continuous iff t₁ ≤ t₂.
• A map f : (α, t) → (β, u) is continuous
• iff t ≤ TopologicalSpace.induced f u (continuous_iff_le_induced)
• iff TopologicalSpace.coinduced f t ≤ u (continuous_iff_coinduced_le).

Topologies on α form a complete lattice, with ⊥ the discrete topology and ⊤ the indiscrete topology.

For a function f : α → β, (TopologicalSpace.coinduced f, TopologicalSpace.induced f) is a Galois connection between topologies on α and topologies on β.

## Implementation notes #

There is a Galois insertion between topologies on α (with the inclusion ordering) and all collections of sets in α. The complete lattice structure on topologies on α is defined as the reverse of the one obtained via this Galois insertion. More precisely, we use the corresponding Galois coinsertion between topologies on α (with the reversed inclusion ordering) and collections of sets in α (with the reversed inclusion ordering).

## Tags #

finer, coarser, induced topology, coinduced topology

inductive TopologicalSpace.GenerateOpen {α : Type u} (g : Set (Set α)) :
Set αProp

The open sets of the least topology containing a collection of basic sets.

Instances For
def TopologicalSpace.generateFrom {α : Type u} (g : Set (Set α)) :

The smallest topological space containing the collection g of basic sets

Equations
• = { IsOpen := , isOpen_univ := , isOpen_inter := , isOpen_sUnion := }
Instances For
theorem TopologicalSpace.isOpen_generateFrom_of_mem {α : Type u} {g : Set (Set α)} {s : Set α} (hs : s g) :
theorem TopologicalSpace.nhds_generateFrom {α : Type u} {g : Set (Set α)} {a : α} :
nhds a = s{s : Set α | a s s g},
theorem TopologicalSpace.tendsto_nhds_generateFrom_iff {α : Type u} {β : Type u_1} {m : αβ} {f : } {g : Set (Set β)} {b : β} :
Filter.Tendsto m f (nhds b) sg, b sm ⁻¹' s f
@[deprecated TopologicalSpace.tendsto_nhds_generateFrom_iff]
theorem TopologicalSpace.tendsto_nhds_generateFrom {α : Type u} {β : Type u_1} {m : αβ} {f : } {g : Set (Set β)} {b : β} :
(sg, b sm ⁻¹' s f)Filter.Tendsto m f (nhds b)

Alias of the reverse direction of TopologicalSpace.tendsto_nhds_generateFrom_iff.

def TopologicalSpace.mkOfNhds {α : Type u} (n : α) :

Construct a topology on α given the filter of neighborhoods of each point of α.

Equations
• = { IsOpen := fun (s : Set α) => as, s n a, isOpen_univ := , isOpen_inter := , isOpen_sUnion := }
Instances For
theorem TopologicalSpace.nhds_mkOfNhds_of_hasBasis {α : Type u} {n : α} {ι : αSort u_1} {p : (a : α) → ι aProp} {s : (a : α) → ι aSet α} (hb : ∀ (a : α), (n a).HasBasis (p a) (s a)) (hpure : ∀ (a : α) (i : ι a), p a ia s a i) (hopen : ∀ (a : α) (i : ι a), p a i∀ᶠ (x : α) in n a, s a i n x) (a : α) :
nhds a = n a
theorem TopologicalSpace.nhds_mkOfNhds {α : Type u} (n : α) (a : α) (h₀ : pure n) (h₁ : ∀ (a : α), sn a, ∀ᶠ (y : α) in n a, s n y) :
nhds a = n a
theorem TopologicalSpace.nhds_mkOfNhds_single {α : Type u} [] {a₀ : α} {l : } (h : pure a₀ l) (b : α) :
nhds b = Function.update pure a₀ l b
theorem TopologicalSpace.nhds_mkOfNhds_filterBasis {α : Type u} (B : α) (a : α) (h₀ : ∀ (x : α), nB x, x n) (h₁ : ∀ (x : α), nB x, n₁B x, x'n₁, n₂B x', n₂ n) :
nhds a = (B a).filter

The ordering on topologies on the type α. t ≤ s if every set open in s is also open in t (t is finer than s).

Equations
• TopologicalSpace.instPartialOrder = let __src := PartialOrder.lift (fun (t : ) => OrderDual.toDual IsOpen) ;
theorem TopologicalSpace.le_def {α : Type u_1} {t : } {s : } :
t s IsOpen IsOpen
theorem TopologicalSpace.le_generateFrom_iff_subset_isOpen {α : Type u} {g : Set (Set α)} {t : } :
g {s : Set α | }
def TopologicalSpace.mkOfClosure {α : Type u} (s : Set (Set α)) (hs : {u : Set α | } = s) :

If s equals the collection of open sets in the topology it generates, then s defines a topology.

Equations
• = { IsOpen := fun (u : Set α) => u s, isOpen_univ := , isOpen_inter := , isOpen_sUnion := }
Instances For
theorem TopologicalSpace.mkOfClosure_sets {α : Type u} {s : Set (Set α)} {hs : {u : Set α | } = s} :
theorem TopologicalSpace.gc_generateFrom (α : Type u_1) :
GaloisConnection (fun (t : ) => OrderDual.toDual {s : Set α | }) (TopologicalSpace.generateFrom OrderDual.ofDual)
def TopologicalSpace.gciGenerateFrom (α : Type u_1) :
GaloisCoinsertion (fun (t : ) => OrderDual.toDual {s : Set α | }) (TopologicalSpace.generateFrom OrderDual.ofDual)

The Galois coinsertion between TopologicalSpace α and (Set (Set α))ᵒᵈ whose lower part sends a topology to its collection of open subsets, and whose upper part sends a collection of subsets of α to the topology they generate.

Equations
• One or more equations did not get rendered due to their size.
Instances For

Topologies on α form a complete lattice, with ⊥ the discrete topology and ⊤ the indiscrete topology. The infimum of a collection of topologies is the topology generated by all their open sets, while the supremum is the topology whose open sets are those sets open in every member of the collection.

Equations
• TopologicalSpace.instCompleteLattice = .liftCompleteLattice
theorem TopologicalSpace.generateFrom_anti {α : Type u_1} {g₁ : Set (Set α)} {g₂ : Set (Set α)} (h : g₁ g₂) :
theorem TopologicalSpace.leftInverse_generateFrom {α : Type u} :
Function.LeftInverse TopologicalSpace.generateFrom fun (t : ) => {s : Set α | }
theorem TopologicalSpace.generateFrom_surjective {α : Type u} :
Function.Surjective TopologicalSpace.generateFrom
theorem TopologicalSpace.setOf_isOpen_injective {α : Type u} :
Function.Injective fun (t : ) => {s : Set α | }
theorem IsOpen.mono {α : Type u_1} {t₁ : } {t₂ : } {s : Set α} (hs : ) (h : t₁ t₂) :
theorem IsClosed.mono {α : Type u_1} {t₁ : } {t₂ : } {s : Set α} (hs : ) (h : t₁ t₂) :
theorem closure.mono {α : Type u_1} {t₁ : } {t₂ : } {s : Set α} (h : t₁ t₂) :
theorem isOpen_implies_isOpen_iff {α : Type u_1} {t₁ : } {t₂ : } :
(∀ (s : Set α), ) t₂ t₁
theorem TopologicalSpace.isOpen_top_iff {α : Type u_2} (U : Set α) :
U = U = Set.univ

The only open sets in the indiscrete topology are the empty set and the whole space.

class DiscreteTopology (α : Type u_2) [t : ] :

A topological space is discrete if every set is open, that is, its topology equals the discrete topology ⊥.

• eq_bot : t =

The TopologicalSpace structure on a type with discrete topology is equal to ⊥.

Instances
theorem DiscreteTopology.eq_bot {α : Type u_2} [t : ] [self : ] :
t =

The TopologicalSpace structure on a type with discrete topology is equal to ⊥.

theorem discreteTopology_bot (α : Type u_2) :
@[simp]
theorem isOpen_discrete {α : Type u_1} [] [] (s : Set α) :
@[simp]
theorem isClosed_discrete {α : Type u_1} [] [] (s : Set α) :
@[simp]
theorem closure_discrete {α : Type u_1} [] [] (s : Set α) :
= s
@[simp]
theorem dense_discrete {α : Type u_1} [] [] {s : Set α} :
s = Set.univ
@[simp]
theorem denseRange_discrete {α : Type u_1} [] [] {ι : Type u_3} {f : ια} :
theorem continuous_of_discreteTopology {α : Type u_1} [] [] {β : Type u_2} [] {f : αβ} :
theorem continuous_discrete_rng {α : Type u_1} [] {β : Type u_2} [] [] {f : αβ} :
∀ (b : β), IsOpen (f ⁻¹' {b})

A function to a discrete topological space is continuous if and only if the preimage of every singleton is open.

@[simp]
theorem nhds_discrete (α : Type u_3) [] [] :
nhds = pure
theorem mem_nhds_discrete {α : Type u_1} [] [] {x : α} {s : Set α} :
s nhds x x s
theorem le_of_nhds_le_nhds {α : Type u_1} {t₁ : } {t₂ : } (h : ∀ (x : α), nhds x nhds x) :
t₁ t₂
@[deprecated TopologicalSpace.ext_nhds]
theorem eq_of_nhds_eq_nhds {X : Type u} {t : } {t' : } :
(∀ (x : X), nhds x = nhds x)t = t'

Alias of the reverse direction of TopologicalSpace.ext_iff_nhds.

Alias of the reverse direction of TopologicalSpace.ext_iff_nhds.

theorem eq_bot_of_singletons_open {α : Type u_1} {t : } (h : ∀ (x : α), IsOpen {x}) :
t =
theorem forall_open_iff_discrete {X : Type u_2} [] :
(∀ (s : Set X), )
theorem discreteTopology_iff_forall_isClosed {α : Type u_1} [] :
∀ (s : Set α),
theorem singletons_open_iff_discrete {X : Type u_2} [] :
(∀ (a : X), IsOpen {a})
theorem discreteTopology_iff_singleton_mem_nhds {α : Type u_1} [] :
∀ (x : α), {x} nhds x
theorem discreteTopology_iff_nhds {α : Type u_1} [] :
∀ (x : α), nhds x = pure x

This lemma characterizes discrete topological spaces as those whose singletons are neighbourhoods.

theorem discreteTopology_iff_nhds_ne {α : Type u_1} [] :
∀ (x : α), nhdsWithin x {x} =
theorem DiscreteTopology.of_continuous_injective {α : Type u_1} {β : Type u_2} [] [] [] {f : αβ} (hc : ) (hinj : ) :

If the codomain of a continuous injective function has discrete topology, then so does the domain.

See also Embedding.discreteTopology for an important special case.

theorem isOpen_induced_iff {α : Type u_1} {β : Type u_2} [t : ] {s : Set α} {f : αβ} :
∃ (t_1 : Set β), IsOpen t_1 f ⁻¹' t_1 = s
theorem isClosed_induced_iff {α : Type u_1} {β : Type u_2} [t : ] {s : Set α} {f : αβ} :
∃ (t_1 : Set β), IsClosed t_1 f ⁻¹' t_1 = s
theorem isOpen_coinduced {α : Type u_1} {β : Type u_2} {t : } {s : Set β} {f : αβ} :
theorem isClosed_coinduced {α : Type u_1} {β : Type u_2} {t : } {s : Set β} {f : αβ} :
theorem preimage_nhds_coinduced {α : Type u_1} {β : Type u_2} [] {π : αβ} {s : Set β} {a : α} (hs : s nhds (π a)) :
π ⁻¹' s nhds a
theorem Continuous.coinduced_le {α : Type u_1} {β : Type u_2} {t : } {t' : } {f : αβ} (h : ) :
theorem coinduced_le_iff_le_induced {α : Type u_1} {β : Type u_2} {f : αβ} {tα : } {tβ : } :
theorem Continuous.le_induced {α : Type u_1} {β : Type u_2} {t : } {t' : } {f : αβ} (h : ) :
theorem gc_coinduced_induced {α : Type u_1} {β : Type u_2} (f : αβ) :
theorem induced_mono {α : Type u_1} {β : Type u_2} {t₁ : } {t₂ : } {g : βα} (h : t₁ t₂) :
theorem coinduced_mono {α : Type u_1} {β : Type u_2} {t₁ : } {t₂ : } {f : αβ} (h : t₁ t₂) :
@[simp]
theorem induced_top {α : Type u_1} {β : Type u_2} {g : βα} :
@[simp]
theorem induced_inf {α : Type u_1} {β : Type u_2} {t₁ : } {t₂ : } {g : βα} :
@[simp]
theorem induced_iInf {α : Type u_1} {β : Type u_2} {g : βα} {ι : Sort w} {t : ι} :
TopologicalSpace.induced g (⨅ (i : ι), t i) = ⨅ (i : ι), TopologicalSpace.induced g (t i)
@[simp]
theorem coinduced_bot {α : Type u_1} {β : Type u_2} {f : αβ} :
@[simp]
theorem coinduced_sup {α : Type u_1} {β : Type u_2} {t₁ : } {t₂ : } {f : αβ} :
@[simp]
theorem coinduced_iSup {α : Type u_1} {β : Type u_2} {f : αβ} {ι : Sort w} {t : ι} :
TopologicalSpace.coinduced f (⨆ (i : ι), t i) = ⨆ (i : ι),
theorem induced_id {α : Type u_1} [t : ] :
theorem induced_compose {α : Type u_1} {β : Type u_2} {γ : Type u_3} {tγ : } {f : αβ} {g : βγ} :
theorem induced_const {α : Type u_1} {β : Type u_2} [t : ] {x : α} :
TopologicalSpace.induced (fun (x_1 : β) => x) t =
theorem coinduced_id {α : Type u_1} [t : ] :
theorem coinduced_compose {α : Type u_1} {β : Type u_2} {γ : Type u_3} [tα : ] {f : αβ} {g : βγ} :
theorem Equiv.induced_symm {α : Type u_4} {β : Type u_5} (e : α β) :
theorem Equiv.coinduced_symm {α : Type u_4} {β : Type u_5} (e : α β) :
instance inhabitedTopologicalSpace {α : Type u} :
Equations
• inhabitedTopologicalSpace = { default := }
@[instance 100]
Equations
• Subsingleton.uniqueTopologicalSpace = { default := , uniq := }
@[instance 100]
instance Subsingleton.discreteTopology {α : Type u} [t : ] [] :
Equations
• =
Equations
Equations
Equations
Equations
Equations
Equations
Equations
Equations
Equations
Equations
Equations
Equations
instance instTopologicalSpaceFin {n : } :
Equations
• instTopologicalSpaceFin =
instance instDiscreteTopologyFin {n : } :
Equations
• =
instance sierpinskiSpace :
Equations
theorem continuous_empty_function {α : Type u} {β : Type v} [] [] [] (f : αβ) :
theorem le_generateFrom {α : Type u} {t : } {g : Set (Set α)} (h : sg, ) :
theorem induced_generateFrom_eq {α : Type u_1} {β : Type u_2} {b : Set (Set β)} {f : αβ} :
theorem le_induced_generateFrom {α : Type u_1} {β : Type u_2} [t : ] {b : Set (Set β)} {f : αβ} (h : ab, IsOpen (f ⁻¹' a)) :
theorem generateFrom_insert_of_generateOpen {α : Type u_1} {s : Set (Set α)} {t : Set α} (ht : ) :
@[simp]
theorem generateFrom_insert_univ {α : Type u_1} {s : Set (Set α)} :
def nhdsAdjoint {α : Type u} (a : α) (f : ) :

This construction is left adjoint to the operation sending a topology on α to its neighborhood filter at a fixed point a : α.

Equations
• = { IsOpen := fun (s : Set α) => a ss f, isOpen_univ := , isOpen_inter := , isOpen_sUnion := }
Instances For
theorem gc_nhds {α : Type u} (a : α) :
GaloisConnection () fun (t : ) => nhds a
theorem nhds_mono {α : Type u} {t₁ : } {t₂ : } {a : α} (h : t₁ t₂) :
theorem le_iff_nhds {α : Type u_1} (t : ) (t' : ) :
t t' ∀ (x : α), nhds x nhds x
theorem isOpen_singleton_nhdsAdjoint {α : Type u_1} {a : α} {b : α} (f : ) (hb : b a) :
IsOpen {b}
theorem nhds_nhdsAdjoint_same {α : Type u} (a : α) (f : ) :
nhds a = pure a f
theorem nhdsAdjoint_nhds {α : Type u} (a : α) (f : ) :
nhds a = pure a f

Alias of nhds_nhdsAdjoint_same.

theorem nhds_nhdsAdjoint_of_ne {α : Type u} {a : α} {b : α} (f : ) (h : b a) :
nhds b = pure b
theorem nhdsAdjoint_nhds_of_ne {α : Type u} (a : α) (f : ) {b : α} (h : b a) :
nhds b = pure b
theorem nhds_nhdsAdjoint {α : Type u} [] (a : α) (f : ) :
nhds = Function.update pure a (pure a f)
theorem le_nhdsAdjoint_iff' {α : Type u} {a : α} {f : } {t : } :
t nhds a pure a f ∀ (b : α), b anhds b = pure b
theorem le_nhdsAdjoint_iff {α : Type u_1} (a : α) (f : ) (t : ) :
t nhds a pure a f ∀ (b : α), b aIsOpen {b}
theorem nhds_iInf {α : Type u} {ι : Sort u_1} {t : ι} {a : α} :
nhds a = ⨅ (i : ι), nhds a
theorem nhds_sInf {α : Type u} {s : } {a : α} :
nhds a = ts, nhds a
theorem nhds_inf {α : Type u} {t₁ : } {t₂ : } {a : α} :
theorem nhds_top {α : Type u} {a : α} :
theorem isOpen_sup {α : Type u} {t₁ : } {t₂ : } {s : Set α} :
theorem continuous_iff_coinduced_le {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } :
t₂
theorem continuous_iff_le_induced {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } :
t₁
theorem continuous_generateFrom_iff {α : Type u} {β : Type v} {f : αβ} {t : } {b : Set (Set β)} :
sb, IsOpen (f ⁻¹' s)
@[deprecated continuous_generateFrom_iff]
theorem continuous_generateFrom {α : Type u} {β : Type v} {f : αβ} {t : } {b : Set (Set β)} :
(sb, IsOpen (f ⁻¹' s))

Alias of the reverse direction of continuous_generateFrom_iff.

theorem continuous_induced_dom {α : Type u} {β : Type v} {f : αβ} {t : } :
theorem continuous_induced_rng {α : Type u} {β : Type v} {γ : Type u_1} {f : αβ} {g : γα} {t₂ : } {t₁ : } :
theorem continuous_coinduced_rng {α : Type u} {β : Type v} {f : αβ} {t : } :
theorem continuous_coinduced_dom {α : Type u} {β : Type v} {γ : Type u_1} {f : αβ} {g : βγ} {t₁ : } {t₂ : } :
theorem continuous_le_dom {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } (h₁ : t₂ t₁) (h₂ : ) :
theorem continuous_le_rng {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } (h₁ : t₂ t₃) (h₂ : ) :
theorem continuous_sup_dom {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } :
theorem continuous_sup_rng_left {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₃ : } {t₂ : } :
theorem continuous_sup_rng_right {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₃ : } {t₂ : } :
theorem continuous_sSup_dom {α : Type u} {β : Type v} {f : αβ} {T : } {t₂ : } :
tT,
theorem continuous_sSup_rng {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t : } (h₁ : t t₂) (hf : ) :
theorem continuous_iSup_dom {α : Type u} {β : Type v} {f : αβ} {ι : Sort u_2} {t₁ : ι} {t₂ : } :
∀ (i : ι),
theorem continuous_iSup_rng {α : Type u} {β : Type v} {f : αβ} {ι : Sort u_2} {t₁ : } {t₂ : ι} {i : ι} (h : ) :
theorem continuous_inf_rng {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } :
theorem continuous_inf_dom_left {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } :
theorem continuous_inf_dom_right {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t₃ : } :
theorem continuous_sInf_dom {α : Type u} {β : Type v} {f : αβ} {t₁ : } {t₂ : } {t : } (h₁ : t t₁) :
theorem continuous_sInf_rng {α : Type u} {β : Type v} {f : αβ} {t₁ : } {T : } :
tT,
theorem continuous_iInf_dom {α : Type u} {β : Type v} {f : αβ} {ι : Sort u_2} {t₁ : ι} {t₂ : } {i : ι} :
theorem continuous_iInf_rng {α : Type u} {β : Type v} {f : αβ} {ι : Sort u_2} {t₁ : } {t₂ : ι} :
∀ (i : ι),
theorem continuous_bot {α : Type u} {β : Type v} {f : αβ} {t : } :
theorem continuous_top {α : Type u} {β : Type v} {f : αβ} {t : } :
theorem continuous_id_iff_le {α : Type u} {t : } {t' : } :
t t'
theorem continuous_id_of_le {α : Type u} {t : } {t' : } (h : t t') :
theorem mem_nhds_induced {α : Type u} {β : Type v} [T : ] (f : βα) (a : β) (s : Set β) :
s nhds a unhds (f a), f ⁻¹' u s
theorem nhds_induced {α : Type u} {β : Type v} [T : ] (f : βα) (a : β) :
nhds a = Filter.comap f (nhds (f a))
theorem induced_iff_nhds_eq {α : Type u} {β : Type v} [tα : ] [tβ : ] (f : βα) :
= ∀ (b : β), nhds b = Filter.comap f (nhds (f b))
theorem map_nhds_induced_of_surjective {α : Type u} {β : Type v} [T : ] {f : βα} (hf : ) (a : β) :
Filter.map f (nhds a) = nhds (f a)
theorem isOpen_induced_eq {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} {s : Set α} :
s '' {s : Set β | }
theorem isOpen_induced {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} {s : Set β} (h : ) :
theorem map_nhds_induced_eq {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} (a : α) :
Filter.map f (nhds a) = nhdsWithin (f a) ()
theorem map_nhds_induced_of_mem {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} {a : α} (h : nhds (f a)) :
Filter.map f (nhds a) = nhds (f a)
theorem closure_induced {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} {a : α} {s : Set α} :
a f a closure (f '' s)
theorem isClosed_induced_iff' {α : Type u_1} {β : Type u_2} [t : ] {f : αβ} {s : Set α} :
∀ (a : α), f a closure (f '' s)a s
@[simp]
@[simp]
theorem nhds_true :
@[simp]
theorem nhds_false :
theorem tendsto_nhds_true {α : Type u_1} {l : } {p : αProp} :
∀ᶠ (x : α) in l, p x
theorem tendsto_nhds_Prop {α : Type u_1} {l : } {p : αProp} {q : Prop} :
Filter.Tendsto p l (nhds q) q∀ᶠ (x : α) in l, p x
theorem continuous_Prop {α : Type u_1} [] {p : αProp} :
IsOpen {x : α | p x}
theorem isOpen_iff_continuous_mem {α : Type u_1} [] {s : Set α} :
Continuous fun (x : α) => x s
theorem generateFrom_union {α : Type u} (a₁ : Set (Set α)) (a₂ : Set (Set α)) :
theorem setOf_isOpen_sup {α : Type u} (t₁ : ) (t₂ : ) :
{s : Set α | } = {s : Set α | } {s : Set α | }
theorem generateFrom_iUnion {α : Type u} {ι : Sort v} {f : ιSet (Set α)} :
TopologicalSpace.generateFrom (⋃ (i : ι), f i) = ⨅ (i : ι),
theorem setOf_isOpen_iSup {α : Type u} {ι : Sort v} {t : ι} :
{s : Set α | } = ⋂ (i : ι), {s : Set α | }
theorem generateFrom_sUnion {α : Type u} {S : Set (Set (Set α))} :
=
theorem setOf_isOpen_sSup {α : Type u} {T : } :
{s : Set α | } = tT, {s : Set α | }
theorem generateFrom_union_isOpen {α : Type u} (a : ) (b : ) :
TopologicalSpace.generateFrom ({s : Set α | } {s : Set α | }) = a b
theorem generateFrom_iUnion_isOpen {α : Type u} {ι : Sort v} (f : ι) :
TopologicalSpace.generateFrom (⋃ (i : ι), {s : Set α | }) = ⨅ (i : ι), f i
theorem generateFrom_inter {α : Type u} (a : ) (b : ) :
TopologicalSpace.generateFrom ({s : Set α | } {s : Set α | }) = a b
theorem generateFrom_iInter {α : Type u} {ι : Sort v} (f : ι) :
TopologicalSpace.generateFrom (⋂ (i : ι), {s : Set α | }) = ⨆ (i : ι), f i
theorem generateFrom_iInter_of_generateFrom_eq_self {α : Type u} {ι : Sort v} (f : ιSet (Set α)) (hf : ∀ (i : ι), {s : Set α | } = f i) :
TopologicalSpace.generateFrom (⋂ (i : ι), f i) = ⨆ (i : ι),
theorem isOpen_iSup_iff {α : Type u} {ι : Sort v} {t : ι} {s : Set α} :
∀ (i : ι),
theorem isClosed_iSup_iff {α : Type u} {ι : Sort v} {t : ι} {s : Set α} :
∀ (i : ι),