How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Countably compact, sequentially compact and limit point compact metric spaces
Definition
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), with open sets as in The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement and open covers, subcovers, finiteness and compactness as in Open cover, subcover, compact metric space, and compact subset of a metric space.
- is countably compact when every open cover of that is at most countable (Finite, countably infinite, countable, uncountable) has a finite subcover.
- is sequentially compact when every sequence in , that is every function (Sequences of reals: bounded, eventually, frequently, tails, subsequences), has a subsequence converging to a point of (Convergence of a sequence in a metric space: iff in ), the index map being strictly increasing (A strictly increasing index map satisfies ).
- is limit point compact when every infinite subset has a limit point in , that is a point with for every real (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space). Here infinite means not finite in the sense of Finite, countably infinite, countable, uncountable, equivalently not listable as and not empty (Open cover, subcover, compact metric space, and compact subset of a metric space).
A subset is called countably compact, sequentially compact or limit point compact when the metric subspace is (Isometry, isometric embedding, and the subspace metric on a subset), exactly as for compactness.
The countable covers may be listed. A nonempty at most countable family admits a surjection (A nonempty set is at most countable iff it is a surjective image of ), so countable compactness says: for every sequence of open sets with there are finitely many indices whose sets already cover . That surjection is produced from the countability assumption alone and no choice principle is involved; the empty family covers only the empty space, which is compact anyway.
Limit points are computed where the set lives. For and , the identity (Isometry, isometric embedding, and the subspace metric on a subset) shows that is a limit point of in the subspace exactly when is a limit point of in and lies in . So " is limit point compact" says that every infinite has a limit point belonging to ; a limit point outside does not count, and that is what distinguishes the property from a statement about .
Remarks
Three conditions, and none of them is compactness by definition. Each of the three weakens or replaces the open-cover condition of Open cover, subcover, compact metric space, and compact subset of a metric space: countable compactness restricts the covers tested, sequential compactness speaks about sequences instead of covers, and limit point compactness speaks about subsets. That the four conditions are not equivalent for topological spaces in general is standard and is quoted from the references, not proved here. For metric spaces they do coincide, but the coincidence is a theorem with a choice cost that varies from implication to implication, and it is proved on this page one arrow at a time (In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, What each implication between the compactness properties of a metric space costs: which are theorems of ZF, which use countable choice, and which use dependent choice).
Indexing starts at . A sequence here is a function on and contains (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so a subsequence is with and (A strictly increasing index map satisfies ). Every recursive construction of a subsequence on this page produces first and then , and every radius written is written that way because is undefined at .
Depends on
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- A strictly increasing index map satisfies $n_k \ge k$
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Finite, countably infinite, countable, uncountable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Isometry, isometric embedding, and the subspace metric on a subset
Used by
- For n ≥ 1 every bounded sequence in ℝⁿ has a convergent subsequence Corollary
- Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets Definition
- FALSE: a closed and bounded subset of a metric space is compact False statement
- FALSE: in every normed space a closed bounded set is compact False statement
- A sequentially compact metric space is complete, with no choice principle used Lemma
- Dictionary: for A ⊆ ℝ with the metric d(x,y) = |x-y|, continuity and uniform continuity of f : A → ℝ agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of ℝ is compact in the open-cover sense of ℝ exactly when it is a compact metric subspace Lemma
- A sequentially compact metric space is totally bounded, proved from the axiom of dependent choice Theorem
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice Theorem
- In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 66 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Sequentially compact space (Wikipedia) (standard reference, not scraped)
- Limit point compact (Wikipedia) (standard reference, not scraped)
- Countably compact space (Wikipedia) (standard reference, not scraped)