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.
A compact subset of a metric space is closed and bounded
Statement
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and let be a compact subset (Open cover, subcover, compact metric space, and compact subset of a metric space). Then is closed 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 bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
No choice principle is used: both covers below are given by a rule, and the indexed form of A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it returns indices rather than sets.
The converse is false in general. A closed and bounded subset of an arbitrary metric space need not be compact (FALSE: a closed and bounded subset of a metric space is compact); it is exactly in that the converse holds (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Facts & Assumptions
Given: A metric space and a compact subset .
is a compact subset exactly when for every set and every family of open subsets of with there are and with , or else (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, Open cover, subcover, compact metric space, and compact subset of a metric space).
For in and one has and (Distinct points of a metric space have disjoint balls around them).
Open balls are open, is open, and a set is closed exactly when its complement is open (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, 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, Open ball, closed ball and sphere in a metric space).
A nonempty finite set of reals has a maximum and a minimum, each one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
A subset is bounded when it is empty or contained in some ball with ; and whenever (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space).
Proof
If then is bounded by the first clause of the definition, and it is closed because is open.
Assume from now on that and fix ; the family indexed by the set of positive reals consists of open sets and covers , since every satisfies and so lies in .
The indexed characterisation gives and positive reals with ; putting , a positive real, the balls with common centre are nested, so and is bounded.
Boundedness being settled, take up closedness: let and for each put , which is a positive real because , and which satisfies .
The family consists of open subsets of and covers , since ; so there are and with .
Put , a positive real.
Then : a point of the intersection would lie in for some by step 4.1, and also in by step 5.1, whereas those two balls are disjoint by step 3.1.
So every point of has a ball around it inside , that set is open, and is closed; together with steps 1.1 and 2.1 this proves the theorem.
Remarks
Both conclusions use compactness through the same characterisation. The first cover is by concentric balls of every positive radius, which is what boundedness is about; the second is by balls small enough to keep a fixed outside point away, which is what closedness is about. In each case what compactness returns is a finite list of indices, and a maximum or a minimum of finitely many positive reals then does the rest.
Hausdorffness is what makes the second argument work, and every metric space has it (Distinct points of a metric space have disjoint balls around them). The statement is false for topological spaces without that separation property, which is why the proof cites the separation lemma rather than the metric axioms directly.
Depends on
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
- Distinct points of a metric space have disjoint balls around them
- Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
- 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
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Open ball, closed ball and sphere in a metric space
- Every nonempty finite set of reals has a maximum and a minimum
- Maximum and minimum of a set
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
Used by
- In any metric space the range of a convergent sequence together with its limit is compact, worked out for {0} ∪ {1/(k+1) : k ∈ ℕ} in ℝ Example
- The distance from a point to a nonempty compact set is attained at a point of that set, and two disjoint compact sets are at positive distance Example
- FALSE: a closed and bounded subset of a metric space is compact False statement
- FALSE: the evaluation map on C(X,Y) with the compact-open topology is continuous for every metric X False statement
- 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 Remark
- A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous Theorem
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value Theorem
- Every open cover of a compact metric space has a Lebesgue number: a δ > 0 such that every nonempty subset of diameter less than δ lies inside a single member of the cover Theorem
- Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 69 results over 16 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
- Compact space (Wikipedia) (standard reference, not scraped)
- Heine-Borel theorem (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)