Documentation

Mathlib.Topology.Compactness.CountablyCompact

Countably compact sets #

A set A in a topological space is countably compact if every countably generated proper filter contained in A has a cluster point in A. Equivalently, every sequence in A has a cluster point in A, and every countable open cover of A admits a finite subcover.

Main definitions #

Main results #

References #

def IsCountablyCompact {E : Type u_2} [TopologicalSpace E] (A : Set E) :

A set A is countably compact if every countably generated proper filter f with f ≀ π“Ÿ A has a cluster point in A.

Instances For

    A topological space is countably compact if every countably generated proper filter has a cluster point.

    Instances

      The empty set is countably compact.

      A singleton set is countably compact.

      theorem IsCountablyCompact.of_isClosed_subset {E : Type u_2} [TopologicalSpace E] {A B : Set E} (hA : IsCountablyCompact A) (hB : IsClosed B) (hBA : B βŠ† A) :

      A closed subset of a countably compact set is countably compact.

      theorem isCountablyCompact_iff_seq_clusterPt {E : Type u_2} [TopologicalSpace E] {A : Set E} :
      IsCountablyCompact A ↔ βˆ€ (x : β„• β†’ E), (βˆ€αΆ  (n : β„•) in Filter.atTop, x n ∈ A) β†’ βˆƒ a ∈ A, MapClusterPt a Filter.atTop x

      A set is countably compact if and only if every sequence eventually in it has a cluster point in it.

      theorem IsCountablyCompact.seq_clusterPt {E : Type u_2} [TopologicalSpace E] {A : Set E} :
      IsCountablyCompact A β†’ βˆ€ (x : β„• β†’ E), (βˆ€αΆ  (n : β„•) in Filter.atTop, x n ∈ A) β†’ βˆƒ a ∈ A, MapClusterPt a Filter.atTop x

      Alias of the forward direction of isCountablyCompact_iff_seq_clusterPt.


      A set is countably compact if and only if every sequence eventually in it has a cluster point in it.

      theorem IsCountablyCompact.of_seq_clusterPt {E : Type u_2} [TopologicalSpace E] {A : Set E} :
      (βˆ€ (x : β„• β†’ E), (βˆ€αΆ  (n : β„•) in Filter.atTop, x n ∈ A) β†’ βˆƒ a ∈ A, MapClusterPt a Filter.atTop x) β†’ IsCountablyCompact A

      Alias of the reverse direction of isCountablyCompact_iff_seq_clusterPt.


      A set is countably compact if and only if every sequence eventually in it has a cluster point in it.

      theorem IsCountablyCompact.elim_directed_cover {ΞΉ : Type u_1} {E : Type u_2} [TopologicalSpace E] {A : Set E} [Countable ΞΉ] [Nonempty ΞΉ] (hA : IsCountablyCompact A) (U : ΞΉ β†’ Set E) (hUo : βˆ€ (i : ΞΉ), IsOpen (U i)) (hAU : A βŠ† ⋃ (i : ΞΉ), U i) (hdU : Directed (fun (x1 x2 : Set E) => x1 βŠ† x2) U) :
      βˆƒ (i : ΞΉ), A βŠ† U i

      For every countable open directed cover of a countably compact set, there exists a single element of the cover which itself includes the set.

      theorem IsCountablyCompact.elim_finite_subcover {ΞΉ : Type u_1} {E : Type u_2} [TopologicalSpace E] {A : Set E} (hA : IsCountablyCompact A) [Countable ΞΉ] {U : ΞΉ β†’ Set E} (hUo : βˆ€ (i : ΞΉ), IsOpen (U i)) (hAU : A βŠ† ⋃ (i : ΞΉ), U i) :
      βˆƒ (t : Finset ΞΉ), A βŠ† ⋃ i ∈ t, U i

      A countably compact set has a finite subcover for any countable open cover.

      theorem isCountablyCompact_iff_countable_open_cover {E : Type u_2} [TopologicalSpace E] {A : Set E} :
      IsCountablyCompact A ↔ βˆ€ (U : β„• β†’ Set E), (βˆ€ (i : β„•), IsOpen (U i)) β†’ A βŠ† ⋃ (i : β„•), U i β†’ βˆƒ (t : Finset β„•), A βŠ† ⋃ i ∈ t, U i

      A set is countably compact if and only if every countable open cover has a finite subcover.

      theorem IsCountablyCompact.elim_finite_subcover_image {ΞΉ : Type u_1} {E : Type u_2} [TopologicalSpace E] {A : Set E} (hA : IsCountablyCompact A) {b : Set ΞΉ} (hb : b.Countable) {U : ΞΉ β†’ Set E} (hUo : βˆ€ i ∈ b, IsOpen (U i)) (hAU : A βŠ† ⋃ i ∈ b, U i) :
      βˆƒ t βŠ† b, t.Finite ∧ A βŠ† ⋃ i ∈ t, U i

      A countably compact set has a finite subcover for any countable open cover indexed by a subset.

      theorem isCountablyCompact_iff_countable_open_cover' {E : Type u_2} [TopologicalSpace E] {A : Set E} :
      IsCountablyCompact A ↔ βˆ€ (U : β„• β†’ Set E), (βˆ€ (i : β„•), IsOpen (U i)) β†’ A βŠ† ⋃ (i : β„•), U i β†’ βˆƒ (t : Set β„•), t.Finite ∧ A βŠ† ⋃ i ∈ t, U i

      Variant of isCountablyCompact_iff_countable_open_cover with Set β„• instead of Finset β„•.

      A compact set is countably compact.

      A sequentially compact set is countably compact.

      A sequentially compact space is countably compact.

      In a first-countable space, a countably compact set is sequentially compact.

      In a first-countable countably compact space is sequentially compact.

      In a first-countable space, a set is countably compact iff it is sequentially compact.

      theorem IsCountablyCompact.exists_accPt_of_infinite {E : Type u_2} [TopologicalSpace E] {A B : Set E} (hA : IsCountablyCompact A) (hBA : B βŠ† A) (hB : B.Infinite) :
      βˆƒ a ∈ A, AccPt a (Filter.principal B)

      Every infinite subset of a countably compact set has an accumulation point in the set.

      theorem isCountablyCompact_iff_infinite_subset_has_accPt {E : Type u_2} [TopologicalSpace E] [T1Space E] {A : Set E} :
      IsCountablyCompact A ↔ βˆ€ B βŠ† A, B.Infinite β†’ βˆƒ a ∈ A, AccPt a (Filter.principal B)

      In a T₁ space, a set is countably compact if and only if every infinite subset has an accumulation point in the set.

      theorem IsLindelof.isCompact {E : Type u_2} [TopologicalSpace E] {A : Set E} (hA : IsCountablyCompact A) (hl : IsLindelof A) :

      A countably compact LindelΓΆf set is compact.

      A countably compact LindelΓΆf space is compact.

      In a Hereditarily LindelΓΆf space, a countably compact set is compact.

      theorem IsCountablyCompact.image {E : Type u_2} {F : Type u_3} [TopologicalSpace E] [TopologicalSpace F] {A : Set E} (hA : IsCountablyCompact A) {f : E β†’ F} (hf : Continuous f) :

      The continuous image of a countably compact set is countably compact.

      theorem IsCountablyCompact.union {E : Type u_2} [TopologicalSpace E] {A B : Set E} (hA : IsCountablyCompact A) (hB : IsCountablyCompact B) :
      IsCountablyCompact (A βˆͺ B)

      The union of two countably compact sets is countably compact.

      theorem Finset.isCountablyCompact_biUnion {ΞΉ : Type u_1} {E : Type u_2} [TopologicalSpace E] (s : Finset ΞΉ) {f : ΞΉ β†’ Set E} (hf : βˆ€ i ∈ s, IsCountablyCompact (f i)) :
      IsCountablyCompact (⋃ i ∈ s, f i)

      A finite union of countably compact sets is countably compact.

      theorem Set.Finite.isCountablyCompact_biUnion {ΞΉ : Type u_1} {E : Type u_2} [TopologicalSpace E] {s : Set ΞΉ} {f : ΞΉ β†’ Set E} (hs : s.Finite) (hf : βˆ€ i ∈ s, IsCountablyCompact (f i)) :
      IsCountablyCompact (⋃ i ∈ s, f i)

      A finite union of countably compact sets is countably compact.

      theorem Set.Finite.isCountablyCompact_sUnion {E : Type u_2} [TopologicalSpace E] {S : Set (Set E)} (hf : S.Finite) (hc : βˆ€ s ∈ S, IsCountablyCompact s) :

      A finite union of countably compact sets is countably compact.

      theorem isCountablyCompact_iUnion {E : Type u_2} [TopologicalSpace E] {ΞΉ : Sort u_4} {f : ΞΉ β†’ Set E} [Finite ΞΉ] (h : βˆ€ (i : ΞΉ), IsCountablyCompact (f i)) :
      IsCountablyCompact (⋃ (i : ΞΉ), f i)

      A finite union of countably compact sets is countably compact.