Compact sets

We define a few types of compact sets in a topological space.

Main Definitions

For a topological space α,

• TopologicalSpace.Compacts α: The type of compact sets.
• TopologicalSpace.NonemptyCompacts α: The type of non-empty compact sets.
• TopologicalSpace.PositiveCompacts α: The type of compact sets with non-empty interior.
• TopologicalSpace.CompactOpens α: The type of compact open sets. This is a central object in the study of spectral spaces.

Compact sets

structure TopologicalSpace.Compacts (α : Type u_4) [TopologicalSpace α] : Type u_4

The type of compact sets of a topological space.

• carrier : Set α

  the carrier set, i.e. the points in this set

• isCompact' : IsCompact self.carrier

instance TopologicalSpace.Compacts.instSetLike {α : Type u_1} [TopologicalSpace α] : SetLike (Compacts α) α

Equations

• TopologicalSpace.Compacts.instSetLike = { coe := TopologicalSpace.Compacts.carrier, coe_injective' := ⋯ }

def TopologicalSpace.Compacts.Simps.coe {α : Type u_1} [TopologicalSpace α] (s : Compacts α) : Set α

See Note [custom simps projection].

Equations

• TopologicalSpace.Compacts.Simps.coe s = ↑s

theorem TopologicalSpace.Compacts.isCompact {α : Type u_1} [TopologicalSpace α] (s : Compacts α) : IsCompact ↑s

instance TopologicalSpace.Compacts.instCompactSpaceSubtypeMem {α : Type u_1} [TopologicalSpace α] (K : Compacts α) : CompactSpace ↥K

instance TopologicalSpace.Compacts.instCanLiftSetCoeIsCompact {α : Type u_1} [TopologicalSpace α] : CanLift (Set α) (Compacts α) SetLike.coe IsCompact

theorem TopologicalSpace.Compacts.ext {α : Type u_1} [TopologicalSpace α] {s t : Compacts α} (h : ↑s = ↑t) : s = t

@[simp]

theorem TopologicalSpace.Compacts.coe_mk {α : Type u_1} [TopologicalSpace α] (s : Set α) (h : IsCompact s) : ↑{ carrier := s, isCompact' := h } = s

@[simp]

theorem TopologicalSpace.Compacts.carrier_eq_coe {α : Type u_1} [TopologicalSpace α] (s : Compacts α) : s.carrier = ↑s

instance TopologicalSpace.Compacts.instMax {α : Type u_1} [TopologicalSpace α] : Max (Compacts α)

Equations

• TopologicalSpace.Compacts.instMax = { max := fun (s t : TopologicalSpace.Compacts α) => { carrier := ↑s ∪ ↑t, isCompact' := ⋯ } }

instance TopologicalSpace.Compacts.instMinOfT2Space {α : Type u_1} [TopologicalSpace α] [T2Space α] : Min (Compacts α)

Equations

• TopologicalSpace.Compacts.instMinOfT2Space = { min := fun (s t : TopologicalSpace.Compacts α) => { carrier := ↑s ∩ ↑t, isCompact' := ⋯ } }

instance TopologicalSpace.Compacts.instTopOfCompactSpace {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : Top (Compacts α)

Equations

• TopologicalSpace.Compacts.instTopOfCompactSpace = { top := { carrier := Set.univ, isCompact' := ⋯ } }

instance TopologicalSpace.Compacts.instBot {α : Type u_1} [TopologicalSpace α] : Bot (Compacts α)

Equations

• TopologicalSpace.Compacts.instBot = { bot := { carrier := ∅, isCompact' := ⋯ } }

instance TopologicalSpace.Compacts.instSemilatticeSup {α : Type u_1} [TopologicalSpace α] : SemilatticeSup (Compacts α)

Equations

• TopologicalSpace.Compacts.instSemilatticeSup = Function.Injective.semilatticeSup SetLike.coe ⋯ ⋯

instance TopologicalSpace.Compacts.instDistribLatticeOfT2Space {α : Type u_1} [TopologicalSpace α] [T2Space α] : DistribLattice (Compacts α)

Equations

• TopologicalSpace.Compacts.instDistribLatticeOfT2Space = Function.Injective.distribLattice SetLike.coe ⋯ ⋯ ⋯

instance TopologicalSpace.Compacts.instOrderBot {α : Type u_1} [TopologicalSpace α] : OrderBot (Compacts α)

Equations

• TopologicalSpace.Compacts.instOrderBot = OrderBot.lift SetLike.coe ⋯ ⋯

instance TopologicalSpace.Compacts.instBoundedOrderOfCompactSpace {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : BoundedOrder (Compacts α)

Equations

• TopologicalSpace.Compacts.instBoundedOrderOfCompactSpace = BoundedOrder.lift SetLike.coe ⋯ ⋯ ⋯

instance TopologicalSpace.Compacts.instInhabited {α : Type u_1} [TopologicalSpace α] : Inhabited (Compacts α)

The type of compact sets is inhabited, with default element the empty set.

Equations

• TopologicalSpace.Compacts.instInhabited = { default := ⊥ }

@[simp]

theorem TopologicalSpace.Compacts.coe_sup {α : Type u_1} [TopologicalSpace α] (s t : Compacts α) : ↑(s ⊔ t) = ↑s ∪ ↑t

@[simp]

theorem TopologicalSpace.Compacts.coe_inf {α : Type u_1} [TopologicalSpace α] [T2Space α] (s t : Compacts α) : ↑(s ⊓ t) = ↑s ∩ ↑t

@[simp]

theorem TopologicalSpace.Compacts.coe_top {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : ↑⊤ = Set.univ

@[simp]

theorem TopologicalSpace.Compacts.coe_bot {α : Type u_1} [TopologicalSpace α] : ↑⊥ = ∅

@[simp]

theorem TopologicalSpace.Compacts.coe_finset_sup {α : Type u_1} [TopologicalSpace α] {ι : Type u_4} {s : Finset ι} {f : ι → Compacts α} : ↑(s.sup f) = s.sup fun (i : ι) => ↑(f i)

def TopologicalSpace.Compacts.map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α → β) (hf : Continuous f) (K : Compacts α) : Compacts β

The image of a compact set under a continuous function.

Equations

• TopologicalSpace.Compacts.map f hf K = { carrier := f '' K.carrier, isCompact' := ⋯ }

@[simp]

theorem TopologicalSpace.Compacts.coe_map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} (hf : Continuous f) (s : Compacts α) : ↑(Compacts.map f hf s) = f '' ↑s

@[simp]

theorem TopologicalSpace.Compacts.map_id {α : Type u_1} [TopologicalSpace α] (K : Compacts α) : Compacts.map id ⋯ K = K

theorem TopologicalSpace.Compacts.map_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} [TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace γ] (f : β → γ) (g : α → β) (hf : Continuous f) (hg : Continuous g) (K : Compacts α) : Compacts.map (f ∘ g) ⋯ K = Compacts.map f hf (Compacts.map g hg K)

def TopologicalSpace.Compacts.equiv {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α ≃ₜ β) : Compacts α ≃ Compacts β

A homeomorphism induces an equivalence on compact sets, by taking the image.

Equations

• TopologicalSpace.Compacts.equiv f = { toFun := TopologicalSpace.Compacts.map ⇑f ⋯, invFun := TopologicalSpace.Compacts.map ⇑f.symm ⋯, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem TopologicalSpace.Compacts.equiv_symm_apply {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α ≃ₜ β) (K : Compacts β) : (Compacts.equiv f).symm K = Compacts.map ⇑f.symm ⋯ K

@[simp]

theorem TopologicalSpace.Compacts.equiv_apply {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α ≃ₜ β) (K : Compacts α) : (Compacts.equiv f) K = Compacts.map ⇑f ⋯ K

@[simp]

theorem TopologicalSpace.Compacts.equiv_refl {α : Type u_1} [TopologicalSpace α] : Compacts.equiv (Homeomorph.refl α) = Equiv.refl (Compacts α)

@[simp]

theorem TopologicalSpace.Compacts.equiv_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} [TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace γ] (f : α ≃ₜ β) (g : β ≃ₜ γ) : Compacts.equiv (f.trans g) = (Compacts.equiv f).trans (Compacts.equiv g)

@[simp]

theorem TopologicalSpace.Compacts.equiv_symm {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α ≃ₜ β) : Compacts.equiv f.symm = (Compacts.equiv f).symm

theorem TopologicalSpace.Compacts.coe_equiv_apply_eq_preimage {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α ≃ₜ β) (K : Compacts α) : ↑((Compacts.equiv f) K) = ⇑f.symm ⁻¹' ↑K

The image of a compact set under a homeomorphism can also be expressed as a preimage.

def TopologicalSpace.Compacts.prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : Compacts α) (L : Compacts β) : Compacts (α × β)

The product of two TopologicalSpace.Compacts, as a TopologicalSpace.Compacts in the product space.

Equations

• K.prod L = { carrier := ↑K ×ˢ ↑L, isCompact' := ⋯ }

@[simp]

theorem TopologicalSpace.Compacts.coe_prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : Compacts α) (L : Compacts β) : ↑(K.prod L) = ↑K ×ˢ ↑L

Nonempty compact sets

structure TopologicalSpace.NonemptyCompacts (α : Type u_4) [TopologicalSpace α] extends TopologicalSpace.Compacts α : Type u_4

The type of nonempty compact sets of a topological space.

• carrier : Set α
• isCompact' : IsCompact self.carrier
• nonempty' : self.carrier.Nonempty

instance TopologicalSpace.NonemptyCompacts.instSetLike {α : Type u_1} [TopologicalSpace α] : SetLike (NonemptyCompacts α) α

Equations

• TopologicalSpace.NonemptyCompacts.instSetLike = { coe := fun (s : TopologicalSpace.NonemptyCompacts α) => s.carrier, coe_injective' := ⋯ }

def TopologicalSpace.NonemptyCompacts.Simps.coe {α : Type u_1} [TopologicalSpace α] (s : NonemptyCompacts α) : Set α

See Note [custom simps projection].

Equations

• TopologicalSpace.NonemptyCompacts.Simps.coe s = ↑s

theorem TopologicalSpace.NonemptyCompacts.isCompact {α : Type u_1} [TopologicalSpace α] (s : NonemptyCompacts α) : IsCompact ↑s

theorem TopologicalSpace.NonemptyCompacts.nonempty {α : Type u_1} [TopologicalSpace α] (s : NonemptyCompacts α) : (↑s).Nonempty

def TopologicalSpace.NonemptyCompacts.toCloseds {α : Type u_1} [TopologicalSpace α] [T2Space α] (s : NonemptyCompacts α) : Closeds α

Reinterpret a nonempty compact as a closed set.

Equations

• s.toCloseds = { carrier := ↑s, closed' := ⋯ }

theorem TopologicalSpace.NonemptyCompacts.ext {α : Type u_1} [TopologicalSpace α] {s t : NonemptyCompacts α} (h : ↑s = ↑t) : s = t

@[simp]

theorem TopologicalSpace.NonemptyCompacts.coe_mk {α : Type u_1} [TopologicalSpace α] (s : Compacts α) (h : s.carrier.Nonempty) : ↑{ toCompacts := s, nonempty' := h } = ↑s

theorem TopologicalSpace.NonemptyCompacts.carrier_eq_coe {α : Type u_1} [TopologicalSpace α] (s : NonemptyCompacts α) : s.carrier = ↑s

@[simp]

theorem TopologicalSpace.NonemptyCompacts.coe_toCompacts {α : Type u_1} [TopologicalSpace α] (s : NonemptyCompacts α) : ↑s.toCompacts = ↑s

instance TopologicalSpace.NonemptyCompacts.instMax {α : Type u_1} [TopologicalSpace α] : Max (NonemptyCompacts α)

Equations

• TopologicalSpace.NonemptyCompacts.instMax = { max := fun (s t : TopologicalSpace.NonemptyCompacts α) => { toCompacts := s.toCompacts ⊔ t.toCompacts, nonempty' := ⋯ } }

instance TopologicalSpace.NonemptyCompacts.instTopOfCompactSpaceOfNonempty {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : Top (NonemptyCompacts α)

Equations

• TopologicalSpace.NonemptyCompacts.instTopOfCompactSpaceOfNonempty = { top := { toCompacts := ⊤, nonempty' := ⋯ } }

instance TopologicalSpace.NonemptyCompacts.instSemilatticeSup {α : Type u_1} [TopologicalSpace α] : SemilatticeSup (NonemptyCompacts α)

Equations

• TopologicalSpace.NonemptyCompacts.instSemilatticeSup = Function.Injective.semilatticeSup SetLike.coe ⋯ ⋯

instance TopologicalSpace.NonemptyCompacts.instOrderTopOfCompactSpaceOfNonempty {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : OrderTop (NonemptyCompacts α)

Equations

• TopologicalSpace.NonemptyCompacts.instOrderTopOfCompactSpaceOfNonempty = OrderTop.lift SetLike.coe ⋯ ⋯

@[simp]

theorem TopologicalSpace.NonemptyCompacts.coe_sup {α : Type u_1} [TopologicalSpace α] (s t : NonemptyCompacts α) : ↑(s ⊔ t) = ↑s ∪ ↑t

@[simp]

theorem TopologicalSpace.NonemptyCompacts.coe_top {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : ↑⊤ = Set.univ

instance TopologicalSpace.NonemptyCompacts.instInhabited {α : Type u_1} [TopologicalSpace α] [Inhabited α] : Inhabited (NonemptyCompacts α)

In an inhabited space, the type of nonempty compact subsets is also inhabited, with default element the singleton set containing the default element.

Equations

• TopologicalSpace.NonemptyCompacts.instInhabited = { default := { carrier := {default}, isCompact' := ⋯, nonempty' := ⋯ } }

instance TopologicalSpace.NonemptyCompacts.toCompactSpace {α : Type u_1} [TopologicalSpace α] {s : NonemptyCompacts α} : CompactSpace ↥s

instance TopologicalSpace.NonemptyCompacts.toNonempty {α : Type u_1} [TopologicalSpace α] {s : NonemptyCompacts α} : Nonempty ↥s

def TopologicalSpace.NonemptyCompacts.prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : NonemptyCompacts α) (L : NonemptyCompacts β) : NonemptyCompacts (α × β)

The product of two TopologicalSpace.NonemptyCompacts, as a TopologicalSpace.NonemptyCompacts in the product space.

Equations

• K.prod L = { toCompacts := K.prod L.toCompacts, nonempty' := ⋯ }

@[simp]

theorem TopologicalSpace.NonemptyCompacts.coe_prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : NonemptyCompacts α) (L : NonemptyCompacts β) : ↑(K.prod L) = ↑K ×ˢ ↑L

Positive compact sets

structure TopologicalSpace.PositiveCompacts (α : Type u_4) [TopologicalSpace α] extends TopologicalSpace.Compacts α : Type u_4

The type of compact sets with nonempty interior of a topological space. See also TopologicalSpace.Compacts and TopologicalSpace.NonemptyCompacts.

• carrier : Set α
• isCompact' : IsCompact self.carrier
• interior_nonempty' : (interior self.carrier).Nonempty

instance TopologicalSpace.PositiveCompacts.instSetLike {α : Type u_1} [TopologicalSpace α] : SetLike (PositiveCompacts α) α

Equations

• TopologicalSpace.PositiveCompacts.instSetLike = { coe := fun (s : TopologicalSpace.PositiveCompacts α) => s.carrier, coe_injective' := ⋯ }

def TopologicalSpace.PositiveCompacts.Simps.coe {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : Set α

See Note [custom simps projection].

Equations

• TopologicalSpace.PositiveCompacts.Simps.coe s = ↑s

theorem TopologicalSpace.PositiveCompacts.isCompact {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : IsCompact ↑s

theorem TopologicalSpace.PositiveCompacts.interior_nonempty {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : (interior ↑s).Nonempty

theorem TopologicalSpace.PositiveCompacts.nonempty {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : (↑s).Nonempty

def TopologicalSpace.PositiveCompacts.toNonemptyCompacts {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : NonemptyCompacts α

Reinterpret a positive compact as a nonempty compact.

Equations

• s.toNonemptyCompacts = { toCompacts := s.toCompacts, nonempty' := ⋯ }

theorem TopologicalSpace.PositiveCompacts.ext {α : Type u_1} [TopologicalSpace α] {s t : PositiveCompacts α} (h : ↑s = ↑t) : s = t

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_mk {α : Type u_1} [TopologicalSpace α] (s : Compacts α) (h : (interior s.carrier).Nonempty) : ↑{ toCompacts := s, interior_nonempty' := h } = ↑s

theorem TopologicalSpace.PositiveCompacts.carrier_eq_coe {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : s.carrier = ↑s

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_toCompacts {α : Type u_1} [TopologicalSpace α] (s : PositiveCompacts α) : ↑s.toCompacts = ↑s

instance TopologicalSpace.PositiveCompacts.instMax {α : Type u_1} [TopologicalSpace α] : Max (PositiveCompacts α)

Equations

• TopologicalSpace.PositiveCompacts.instMax = { max := fun (s t : TopologicalSpace.PositiveCompacts α) => { toCompacts := s.toCompacts ⊔ t.toCompacts, interior_nonempty' := ⋯ } }

instance TopologicalSpace.PositiveCompacts.instTopOfCompactSpaceOfNonempty {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : Top (PositiveCompacts α)

Equations

• TopologicalSpace.PositiveCompacts.instTopOfCompactSpaceOfNonempty = { top := { toCompacts := ⊤, interior_nonempty' := ⋯ } }

instance TopologicalSpace.PositiveCompacts.instSemilatticeSup {α : Type u_1} [TopologicalSpace α] : SemilatticeSup (PositiveCompacts α)

Equations

• TopologicalSpace.PositiveCompacts.instSemilatticeSup = Function.Injective.semilatticeSup SetLike.coe ⋯ ⋯

instance TopologicalSpace.PositiveCompacts.instOrderTopOfCompactSpaceOfNonempty {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : OrderTop (PositiveCompacts α)

Equations

• TopologicalSpace.PositiveCompacts.instOrderTopOfCompactSpaceOfNonempty = OrderTop.lift SetLike.coe ⋯ ⋯

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_sup {α : Type u_1} [TopologicalSpace α] (s t : PositiveCompacts α) : ↑(s ⊔ t) = ↑s ∪ ↑t

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_top {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : ↑⊤ = Set.univ

def TopologicalSpace.PositiveCompacts.map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α → β) (hf : Continuous f) (hf' : IsOpenMap f) (K : PositiveCompacts α) : PositiveCompacts β

The image of a positive compact set under a continuous open map.

Equations

• TopologicalSpace.PositiveCompacts.map f hf hf' K = { toCompacts := TopologicalSpace.Compacts.map f hf K.toCompacts, interior_nonempty' := ⋯ }

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} (hf : Continuous f) (hf' : IsOpenMap f) (s : PositiveCompacts α) : ↑(PositiveCompacts.map f hf hf' s) = f '' ↑s

@[simp]

theorem TopologicalSpace.PositiveCompacts.map_id {α : Type u_1} [TopologicalSpace α] (K : PositiveCompacts α) : PositiveCompacts.map id ⋯ ⋯ K = K

theorem TopologicalSpace.PositiveCompacts.map_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} [TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace γ] (f : β → γ) (g : α → β) (hf : Continuous f) (hg : Continuous g) (hf' : IsOpenMap f) (hg' : IsOpenMap g) (K : PositiveCompacts α) : PositiveCompacts.map (f ∘ g) ⋯ ⋯ K = PositiveCompacts.map f hf hf' (PositiveCompacts.map g hg hg' K)

theorem exists_positiveCompacts_subset {α : Type u_1} [TopologicalSpace α] [LocallyCompactSpace α] {U : Set α} (ho : IsOpen U) (hn : U.Nonempty) : ∃ (K : TopologicalSpace.PositiveCompacts α), ↑K ⊆ U

theorem IsOpen.exists_positiveCompacts_closure_subset {α : Type u_1} [TopologicalSpace α] [R1Space α] [LocallyCompactSpace α] {U : Set α} (ho : IsOpen U) (hn : U.Nonempty) : ∃ (K : TopologicalSpace.PositiveCompacts α), closure ↑K ⊆ U

instance TopologicalSpace.PositiveCompacts.instInhabitedOfCompactSpaceOfNonempty {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [Nonempty α] : Inhabited (PositiveCompacts α)

Equations

• TopologicalSpace.PositiveCompacts.instInhabitedOfCompactSpaceOfNonempty = { default := ⊤ }

instance TopologicalSpace.PositiveCompacts.nonempty' {α : Type u_1} [TopologicalSpace α] [WeaklyLocallyCompactSpace α] [Nonempty α] : Nonempty (PositiveCompacts α)

In a nonempty locally compact space, there exists a compact set with nonempty interior.

def TopologicalSpace.PositiveCompacts.prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : PositiveCompacts α) (L : PositiveCompacts β) : PositiveCompacts (α × β)

The product of two TopologicalSpace.PositiveCompacts, as a TopologicalSpace.PositiveCompacts in the product space.

Equations

• K.prod L = { toCompacts := K.prod L.toCompacts, interior_nonempty' := ⋯ }

@[simp]

theorem TopologicalSpace.PositiveCompacts.coe_prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : PositiveCompacts α) (L : PositiveCompacts β) : ↑(K.prod L) = ↑K ×ˢ ↑L

Compact open sets

structure TopologicalSpace.CompactOpens (α : Type u_4) [TopologicalSpace α] extends TopologicalSpace.Compacts α : Type u_4

The type of compact open sets of a topological space. This is useful in non Hausdorff contexts, in particular spectral spaces.

• carrier : Set α
• isCompact' : IsCompact self.carrier
• isOpen' : IsOpen self.carrier

instance TopologicalSpace.CompactOpens.instSetLike {α : Type u_1} [TopologicalSpace α] : SetLike (CompactOpens α) α

Equations

• TopologicalSpace.CompactOpens.instSetLike = { coe := fun (s : TopologicalSpace.CompactOpens α) => s.carrier, coe_injective' := ⋯ }

def TopologicalSpace.CompactOpens.Simps.coe {α : Type u_1} [TopologicalSpace α] (s : CompactOpens α) : Set α

See Note [custom simps projection].

Equations

• TopologicalSpace.CompactOpens.Simps.coe s = ↑s

theorem TopologicalSpace.CompactOpens.isCompact {α : Type u_1} [TopologicalSpace α] (s : CompactOpens α) : IsCompact ↑s

theorem TopologicalSpace.CompactOpens.isOpen {α : Type u_1} [TopologicalSpace α] (s : CompactOpens α) : IsOpen ↑s

def TopologicalSpace.CompactOpens.toOpens {α : Type u_1} [TopologicalSpace α] (s : CompactOpens α) : Opens α

Reinterpret a compact open as an open.

Equations

• s.toOpens = { carrier := ↑s, is_open' := ⋯ }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_toOpens {α : Type u_1} [TopologicalSpace α] (s : CompactOpens α) : ↑s.toOpens = ↑s

def TopologicalSpace.CompactOpens.toClopens {α : Type u_1} [TopologicalSpace α] [T2Space α] (s : CompactOpens α) : Clopens α

Reinterpret a compact open as a clopen.

Equations

• s.toClopens = { carrier := ↑s, isClopen' := ⋯ }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_toClopens {α : Type u_1} [TopologicalSpace α] [T2Space α] (s : CompactOpens α) : ↑s.toClopens = ↑s

theorem TopologicalSpace.CompactOpens.ext {α : Type u_1} [TopologicalSpace α] {s t : CompactOpens α} (h : ↑s = ↑t) : s = t

@[simp]

theorem TopologicalSpace.CompactOpens.coe_mk {α : Type u_1} [TopologicalSpace α] (s : Compacts α) (h : IsOpen s.carrier) : ↑{ toCompacts := s, isOpen' := h } = ↑s

instance TopologicalSpace.CompactOpens.instMax {α : Type u_1} [TopologicalSpace α] : Max (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instMax = { max := fun (s t : TopologicalSpace.CompactOpens α) => { toCompacts := s.toCompacts ⊔ t.toCompacts, isOpen' := ⋯ } }

instance TopologicalSpace.CompactOpens.instBot {α : Type u_1} [TopologicalSpace α] : Bot (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instBot = { bot := { toCompacts := ⊥, isOpen' := ⋯ } }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_sup {α : Type u_1} [TopologicalSpace α] (s t : CompactOpens α) : ↑(s ⊔ t) = ↑s ∪ ↑t

@[simp]

theorem TopologicalSpace.CompactOpens.coe_bot {α : Type u_1} [TopologicalSpace α] : ↑⊥ = ∅

instance TopologicalSpace.CompactOpens.instSemilatticeSup {α : Type u_1} [TopologicalSpace α] : SemilatticeSup (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instSemilatticeSup = Function.Injective.semilatticeSup SetLike.coe ⋯ ⋯

instance TopologicalSpace.CompactOpens.instOrderBot {α : Type u_1} [TopologicalSpace α] : OrderBot (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instOrderBot = OrderBot.lift SetLike.coe ⋯ ⋯

instance TopologicalSpace.CompactOpens.instInhabited {α : Type u_1} [TopologicalSpace α] : Inhabited (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instInhabited = { default := ⊥ }

instance TopologicalSpace.CompactOpens.instInf {α : Type u_1} [TopologicalSpace α] [QuasiSeparatedSpace α] : Min (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instInf = { min := fun (U V : TopologicalSpace.CompactOpens α) => { carrier := ↑U ∩ ↑V, isCompact' := ⋯, isOpen' := ⋯ } }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_inf {α : Type u_1} [TopologicalSpace α] [QuasiSeparatedSpace α] (s t : CompactOpens α) : ↑(s ⊓ t) = ↑s ∩ ↑t

instance TopologicalSpace.CompactOpens.instSemilatticeInf {α : Type u_1} [TopologicalSpace α] [QuasiSeparatedSpace α] : SemilatticeInf (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instSemilatticeInf = Function.Injective.semilatticeInf SetLike.coe ⋯ ⋯

instance TopologicalSpace.CompactOpens.instSDiff {α : Type u_1} [TopologicalSpace α] [T2Space α] : SDiff (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instSDiff = { sdiff := fun (s t : TopologicalSpace.CompactOpens α) => { carrier := ↑s \ ↑t, isCompact' := ⋯, isOpen' := ⋯ } }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_sdiff {α : Type u_1} [TopologicalSpace α] [T2Space α] (s t : CompactOpens α) : ↑(s \ t) = ↑s \ ↑t

instance TopologicalSpace.CompactOpens.instGeneralizedBooleanAlgebra {α : Type u_1} [TopologicalSpace α] [T2Space α] : GeneralizedBooleanAlgebra (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instGeneralizedBooleanAlgebra = Function.Injective.generalizedBooleanAlgebra SetLike.coe ⋯ ⋯ ⋯ ⋯ ⋯

instance TopologicalSpace.CompactOpens.instTop {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : Top (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instTop = { top := { toCompacts := ⊤, isOpen' := ⋯ } }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_top {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : ↑⊤ = Set.univ

instance TopologicalSpace.CompactOpens.instBoundedOrder {α : Type u_1} [TopologicalSpace α] [CompactSpace α] : BoundedOrder (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instBoundedOrder = BoundedOrder.lift SetLike.coe ⋯ ⋯ ⋯

instance TopologicalSpace.CompactOpens.instHasCompl {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [T2Space α] : HasCompl (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instHasCompl = { compl := fun (s : TopologicalSpace.CompactOpens α) => { carrier := (↑s)ᶜ, isCompact' := ⋯, isOpen' := ⋯ } }

instance TopologicalSpace.CompactOpens.instHImp {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [T2Space α] : HImp (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instHImp = { himp := fun (s t : TopologicalSpace.CompactOpens α) => { carrier := ↑s ⇨ ↑t, isCompact' := ⋯, isOpen' := ⋯ } }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_compl {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [T2Space α] (s : CompactOpens α) : ↑sᶜ = (↑s)ᶜ

@[simp]

theorem TopologicalSpace.CompactOpens.coe_himp {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [T2Space α] (s t : CompactOpens α) : ↑(s ⇨ t) = ↑s ⇨ ↑t

instance TopologicalSpace.CompactOpens.instBooleanAlgebra {α : Type u_1} [TopologicalSpace α] [CompactSpace α] [T2Space α] : BooleanAlgebra (CompactOpens α)

Equations

• TopologicalSpace.CompactOpens.instBooleanAlgebra = Function.Injective.booleanAlgebra SetLike.coe ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯

def TopologicalSpace.CompactOpens.map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α → β) (hf : Continuous f) (hf' : IsOpenMap f) (s : CompactOpens α) : CompactOpens β

The image of a compact open under a continuous open map.

Equations

• TopologicalSpace.CompactOpens.map f hf hf' s = { toCompacts := TopologicalSpace.Compacts.map f hf s.toCompacts, isOpen' := ⋯ }

@[simp]

theorem TopologicalSpace.CompactOpens.map_toCompacts {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (f : α → β) (hf : Continuous f) (hf' : IsOpenMap f) (s : CompactOpens α) : (map f hf hf' s).toCompacts = Compacts.map f hf s.toCompacts

@[simp]

theorem TopologicalSpace.CompactOpens.coe_map {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {f : α → β} (hf : Continuous f) (hf' : IsOpenMap f) (s : CompactOpens α) : ↑(map f hf hf' s) = f '' ↑s

@[simp]

theorem TopologicalSpace.CompactOpens.map_id {α : Type u_1} [TopologicalSpace α] (K : CompactOpens α) : map id ⋯ ⋯ K = K

theorem TopologicalSpace.CompactOpens.map_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} [TopologicalSpace α] [TopologicalSpace β] [TopologicalSpace γ] (f : β → γ) (g : α → β) (hf : Continuous f) (hg : Continuous g) (hf' : IsOpenMap f) (hg' : IsOpenMap g) (K : CompactOpens α) : map (f ∘ g) ⋯ ⋯ K = map f hf hf' (map g hg hg' K)

def TopologicalSpace.CompactOpens.prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : CompactOpens α) (L : CompactOpens β) : CompactOpens (α × β)

The product of two TopologicalSpace.CompactOpens, as a TopologicalSpace.CompactOpens in the product space.

Equations

• K.prod L = { toCompacts := K.prod L.toCompacts, isOpen' := ⋯ }

@[simp]

theorem TopologicalSpace.CompactOpens.coe_prod {α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] (K : CompactOpens α) (L : CompactOpens β) : ↑(K.prod L) = ↑K ×ˢ ↑L