Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (15)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (10)
  • Network (66)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (3)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [Understanding Analysis by Stephen Abbott] - [Chapter 3 Basic Topology of R] - [3.3 Compact Sets]

    Published Jun 27, 2021 [  RealAnalysis  ]

    Compact Sets

    Definition 3.3.1 (Compactness). A set \(K \subseteq \mathbb{R}\) is compact if every sequence in \(K\) has a subsequence that converges to a limit that is also in \(K\).

    Definition 3.3.3 A set \(A \subseteq \mathbb{R}\) is bounded if there exists \(M > 0\) such that \(|a| \leqslant M\) for all \(a \in A\)

    Theorem 3.3.4 (Characterization of Compactness in R). A set \(K \subseteq \mathbb{R}\) is compact if and only if it is closed and bounded.

    Theorem 3.3.5 (Nested Compact Set Property). If $$ K_1 \supseteq K_2 \supseteq K_3 \supseteq K_4 \supseteq \cdot \cdot \cdot $$ is a nested sequence of nonempty compact sets, then the intersection \(\bigcap_{n=1}^\infty K_n\) is not empty

    Definition 3.3.6 Let \(A \subseteq \mathbb{R}\). An open cover for \(A\) is a (possibly finite) collection of open sets \(\{O_\lambda : \lambda \in \Lambda\}\) whose union contains the set \(A\); that is, \(A \subseteq \bigcup_{\lambda \in \Lambda} O_\lambda\). Given an open cover for \(A\), a finite subcover is a finite subcollection of open sets from the original open cover whose union still manages to completely contain \(A\).

    Theorem 3.3.8 (Heine-Borel Theorem). Let \(K\) be a subset of \(\mathbb{R}\). All of the following statements are equivalent in the sense that any one of them implies the two others:

    1. \(K\) is compact
    2. \(K\) is closed and bounded
    3. Every open cover for \(K\) has a finite subcover.