Documentation

Mathlib.Topology.Sets.Opens

Open sets #

Summary #

We define the subtype of open sets in a topological space.

Main Definitions #

Bundled open sets #

Bundled open neighborhoods #

Main results #

We define order structures on both opens α (complete_structure, frame) and open_nhds_of x (OrderTop, DistribLattice).

TODO #

structure TopologicalSpace.Opens (α : Type u_2) [TopologicalSpace α] :
Type u_2

The type of open subsets of a topological space.

Instances For
    Equations
    • TopologicalSpace.Opens.instSetLikeOpens = { coe := TopologicalSpace.Opens.carrier, coe_injective' := }
    theorem TopologicalSpace.Opens.forall {α : Type u_2} [TopologicalSpace α] {p : TopologicalSpace.Opens αProp} :
    (∀ (U : TopologicalSpace.Opens α), p U) ∀ (U : Set α) (hU : IsOpen U), p { carrier := U, is_open' := hU }
    @[simp]
    @[simp]
    theorem TopologicalSpace.Opens.coe_mk {α : Type u_2} [TopologicalSpace α] {U : Set α} {hU : IsOpen U} :
    { carrier := U, is_open' := hU } = U

    the coercion Opens α → Set α applied to a pair is the same as taking the first component

    @[simp]
    theorem TopologicalSpace.Opens.mem_mk {α : Type u_2} [TopologicalSpace α] {x : α} {U : Set α} {h : IsOpen U} :
    x { carrier := U, is_open' := h } x U
    theorem TopologicalSpace.Opens.ext {α : Type u_2} [TopologicalSpace α] {U : TopologicalSpace.Opens α} {V : TopologicalSpace.Opens α} (h : U = V) :
    U = V
    @[simp]
    theorem TopologicalSpace.Opens.mk_coe {α : Type u_2} [TopologicalSpace α] (U : TopologicalSpace.Opens α) :
    { carrier := U, is_open' := } = U

    See Note [custom simps projection].

    Equations
    Instances For

      The interior of a set, as an element of Opens.

      Equations
      Instances For
        theorem TopologicalSpace.Opens.gc {α : Type u_2} [TopologicalSpace α] :
        GaloisConnection SetLike.coe TopologicalSpace.Opens.interior
        def TopologicalSpace.Opens.gi {α : Type u_2} [TopologicalSpace α] :
        GaloisCoinsertion SetLike.coe TopologicalSpace.Opens.interior

        The galois coinsertion between sets and opens.

        Equations
        • TopologicalSpace.Opens.gi = { choice := fun (s : Set α) (hs : s (TopologicalSpace.Opens.interior s)) => { carrier := s, is_open' := }, gc := , u_l_le := , choice_eq := }
        Instances For
          Equations
          • One or more equations did not get rendered due to their size.
          @[simp]
          theorem TopologicalSpace.Opens.mk_inf_mk {α : Type u_2} [TopologicalSpace α] {U : Set α} {V : Set α} {hU : IsOpen U} {hV : IsOpen V} :
          { carrier := U, is_open' := hU } { carrier := V, is_open' := hV } = { carrier := U V, is_open' := }
          @[simp]
          theorem TopologicalSpace.Opens.coe_inf {α : Type u_2} [TopologicalSpace α] (s : TopologicalSpace.Opens α) (t : TopologicalSpace.Opens α) :
          (s t) = s t
          @[simp]
          theorem TopologicalSpace.Opens.coe_sup {α : Type u_2} [TopologicalSpace α] (s : TopologicalSpace.Opens α) (t : TopologicalSpace.Opens α) :
          (s t) = s t
          @[simp]
          theorem TopologicalSpace.Opens.mk_empty {α : Type u_2} [TopologicalSpace α] :
          { carrier := , is_open' := } =
          @[simp]
          theorem TopologicalSpace.Opens.coe_top {α : Type u_2} [TopologicalSpace α] :
          = Set.univ
          @[simp]
          theorem TopologicalSpace.Opens.mk_univ {α : Type u_2} [TopologicalSpace α] :
          { carrier := Set.univ, is_open' := } =
          @[simp]
          theorem TopologicalSpace.Opens.coe_eq_univ {α : Type u_2} [TopologicalSpace α] {U : TopologicalSpace.Opens α} :
          U = Set.univ U =
          @[simp]
          theorem TopologicalSpace.Opens.coe_sSup {α : Type u_2} [TopologicalSpace α] {S : Set (TopologicalSpace.Opens α)} :
          (sSup S) = ⋃ i ∈ S, i
          @[simp]
          theorem TopologicalSpace.Opens.coe_finset_sup {ι : Type u_1} {α : Type u_2} [TopologicalSpace α] (f : ιTopologicalSpace.Opens α) (s : Finset ι) :
          (Finset.sup s f) = Finset.sup s (SetLike.coe f)
          @[simp]
          theorem TopologicalSpace.Opens.coe_finset_inf {ι : Type u_1} {α : Type u_2} [TopologicalSpace α] (f : ιTopologicalSpace.Opens α) (s : Finset ι) :
          (Finset.inf s f) = Finset.inf s (SetLike.coe f)
          Equations
          • TopologicalSpace.Opens.instInhabitedOpens = { default := }
          Equations
          • TopologicalSpace.Opens.instUniqueOpens = { toInhabited := TopologicalSpace.Opens.instInhabitedOpens, uniq := }
          @[simp]
          theorem TopologicalSpace.Opens.coe_iSup {α : Type u_2} [TopologicalSpace α] {ι : Sort u_5} (s : ιTopologicalSpace.Opens α) :
          (⨆ (i : ι), s i) = ⋃ (i : ι), (s i)
          theorem TopologicalSpace.Opens.iSup_def {α : Type u_2} [TopologicalSpace α] {ι : Sort u_5} (s : ιTopologicalSpace.Opens α) :
          ⨆ (i : ι), s i = { carrier := ⋃ (i : ι), (s i), is_open' := }
          @[simp]
          theorem TopologicalSpace.Opens.iSup_mk {α : Type u_2} [TopologicalSpace α] {ι : Sort u_5} (s : ιSet α) (h : ∀ (i : ι), IsOpen (s i)) :
          ⨆ (i : ι), { carrier := s i, is_open' := } = { carrier := ⋃ (i : ι), s i, is_open' := }
          @[simp]
          theorem TopologicalSpace.Opens.mem_iSup {α : Type u_2} [TopologicalSpace α] {ι : Sort u_5} {x : α} {s : ιTopologicalSpace.Opens α} :
          x iSup s ∃ (i : ι), x s i
          @[simp]
          theorem TopologicalSpace.Opens.mem_sSup {α : Type u_2} [TopologicalSpace α] {Us : Set (TopologicalSpace.Opens α)} {x : α} :
          x sSup Us ∃ u ∈ Us, x u
          Equations

          An open set in the indiscrete topology is either empty or the whole space.

          A set of opens α is a basis if the set of corresponding sets is a topological basis.

          Equations
          Instances For
            theorem TopologicalSpace.Opens.IsBasis.isCompact_open_iff_eq_finite_iUnion {α : Type u_2} [TopologicalSpace α] {ι : Type u_5} (b : ιTopologicalSpace.Opens α) (hb : TopologicalSpace.Opens.IsBasis (Set.range b)) (hb' : ∀ (i : ι), IsCompact (b i)) (U : Set α) :
            IsCompact U IsOpen U ∃ (s : Set ι), Set.Finite s U = ⋃ i ∈ s, (b i)

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

            The preimage of an open set, as an open set.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              @[simp]
              theorem TopologicalSpace.Opens.coe_comap {α : Type u_2} {β : Type u_3} [TopologicalSpace α] [TopologicalSpace β] (f : C(α, β)) (U : TopologicalSpace.Opens β) :
              theorem TopologicalSpace.Opens.comap_injective {α : Type u_2} {β : Type u_3} [TopologicalSpace α] [TopologicalSpace β] [T0Space β] :
              Function.Injective TopologicalSpace.Opens.comap

              A homeomorphism induces an order-preserving equivalence on open sets, by taking comaps.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                structure TopologicalSpace.OpenNhdsOf {α : Type u_2} [TopologicalSpace α] (x : α) extends TopologicalSpace.Opens :
                Type u_2

                The open neighborhoods of a point. See also Opens or nhds.

                Instances For
                  theorem TopologicalSpace.OpenNhdsOf.toOpens_injective {α : Type u_2} [TopologicalSpace α] {x : α} :
                  Function.Injective TopologicalSpace.OpenNhdsOf.toOpens
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instSetLikeOpenNhdsOf = { coe := fun (U : TopologicalSpace.OpenNhdsOf x) => U.toOpens, coe_injective' := }
                  instance TopologicalSpace.OpenNhdsOf.canLiftSet {α : Type u_2} [TopologicalSpace α] {x : α} :
                  CanLift (Set α) (TopologicalSpace.OpenNhdsOf x) SetLike.coe fun (s : Set α) => IsOpen s x s
                  Equations
                  • =
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instOrderTopOpenNhdsOfToLEToPreorderInstPartialOrderInstSetLikeOpenNhdsOf = OrderTop.mk
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instInhabitedOpenNhdsOf = { default := }
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instInfOpenNhdsOf = { inf := fun (U V : TopologicalSpace.OpenNhdsOf x) => { toOpens := U.toOpens V.toOpens, mem' := } }
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instSupOpenNhdsOf = { sup := fun (U V : TopologicalSpace.OpenNhdsOf x) => { toOpens := U.toOpens V.toOpens, mem' := } }
                  Equations
                  • TopologicalSpace.OpenNhdsOf.instUniqueOpenNhdsOf = { toInhabited := TopologicalSpace.OpenNhdsOf.instInhabitedOpenNhdsOf, uniq := }
                  Equations

                  Preimage of an open neighborhood of f x under a continuous map f as a LatticeHom.

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