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.
Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset
Definition
Let , with open sets as in Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen.
- An open cover of is a family of open subsets of with .
- A subcover of is a subfamily that is still an open cover of .
- A subfamily is finite when or there are and members of with ; repetitions in the list are allowed and harmless.
- is compact when every open cover of has a finite subcover: for every open cover of , either and the empty subfamily covers it, or there are and with
- is sequentially compact when every sequence of reals with for all (Sequences of reals: bounded, eventually, frequently, tails, subsequences) has a subsequence converging (Limits and Cauchy sequences of reals) to some point of ; equivalently, when every such sequence has a subsequential limit (Subsequential limit of a real sequence, and the subsequential limit set) that lies in .
Compactness is a property of alone. The covering families range over open subsets of , not over sets open in some other ambient space, so the notion defined here is compactness of as a subset of . Nothing below relativises it to a smaller ambient field; where an ordered field other than is meant, as in FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness, the whole vocabulary is set up again there for that field.
is compact and sequentially compact. The empty subfamily covers it, and there is no sequence with all terms in , so both conditions hold vacuously.
Remarks
-
Why "finite" is spelled out by listing. A finite subfamily is described here as one that can be written with , which is exactly the form every proof on this page produces or consumes: the bisection argument of Heine-Borel by bisection: every closed bounded interval is compact produces a one-member list, and the arguments of A compact subset of is closed and bounded consume a list by taking a maximum over it (Every nonempty finite set of reals has a maximum and a minimum). Since contains , the shortest nonempty list is .
-
The two notions are not defined to be equivalent, and their equivalence is a theorem. For subsets of it is A subset of is compact iff it is sequentially compact; both of its implications run through the characterisation of compactness by closed and bounded, and its forward implication additionally uses Bolzano-Weierstrass. Neither implication is formal.
-
Compactness is not inherited by subsets, but by closed subsets. A closed subset of a compact set is compact, which is immediate from A subset of is compact if and only if it is closed and bounded once that is available, whereas shows that an arbitrary subset of a compact set need not be compact.
-
The empty cover. If then no open cover of is empty, so the case distinction in the definition of compactness only ever matters for ; it is written out so that the definition does not quietly assume nonempty.
Depends on
Used by
- A continuous real function on a compact subset of ℝ is bounded Corollary
- The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval Corollary
- {q ∈ ℚ : q ≥ 0, q² < 2} is closed and bounded in ℚ and is not compact Counterexample
- The cover {(1/k, 1)} of (0,1) has no finite subcover, so (0,1) is not compact Counterexample
- The identity on (0,1) is bounded with no greatest value, and on [0,∞) it is continuous and unbounded Counterexample
- x ↦ 1/x is continuous on (0,1) and not uniformly continuous there, the pairs 1/(k+2) and 1/(k+3) defeating every δ Counterexample
- x ↦ x² is continuous on ℝ and not uniformly continuous, the pairs k+1 and k+1+1/(k+1) defeating every δ Counterexample
- ℤ is closed and not compact, and (0,1) is bounded and not compact: neither hypothesis of Heine-Borel can be dropped Counterexample
- FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness False statement
- FALSE: in the substitution theorem the continuity of f may be weakened to integrability, f∘φ still being integrable False statement
- FALSE: the image of a closed subset of ℝ under a continuous real function is closed False statement
- A compact subset of ℝ is closed and bounded Lemma
- A sequence of intervals covering [a,b] has total length at least b - a, so no interval of positive length has measure zero 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
- Which results on this page use the order of ℝ and therefore have no general-topological analogue Remark
- A bounded function on [a,b] that is continuous except at finitely many points is Riemann integrable Theorem
- A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion Theorem
- A subset of ℝ is compact if and only if it is closed and bounded Theorem
- A subset of ℝ is compact iff it is sequentially compact Theorem
- Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫ₐᵇ fg = f(a)∫ₐ^ξ g + f(b)∫_ξᵇ g Theorem
- Extreme value theorem: a continuous real function on a nonempty compact subset of ℝ attains a greatest and a least value Theorem
- For a compact subset of ℝ, measure zero and content zero coincide Theorem
- Heine-Borel by bisection: every closed bounded interval [a,b] is compact Theorem
- Heine-Cantor in ℝ: a continuous real function on a compact subset of ℝ is uniformly continuous, proved ℝ-natively from sequential compactness Theorem
- If f is continuous on [a,b] and g is integrable with g ≥ 0, there is ξ ∈ [a,b] with ∫ₐᵇ fg = f(ξ)∫ₐᵇ g Theorem
- If f is integrable on [a,b] with values in [m,M] and φ is continuous on [m,M], then φ ∘ f is integrable Theorem
- Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero Theorem
- Rolle's theorem: if a < b, f is continuous on [a,b], differentiable at every point of (a,b), and f(a) = f(b), then f'(c) = 0 for some c ∈ (a,b) Theorem
- Rudin 4.20, the sharp converse: on a noncompact E ⊆ ℝ there is an unbounded continuous function and a bounded continuous function with no greatest value, and if E is bounded there is a continuous function on E that is not uniformly continuous Theorem
- Semicontinuous extreme value theorem: an upper semicontinuous function on a nonempty compact K ⊆ ℝ is bounded above and attains a maximum, and a lower semicontinuous one is bounded below and attains a minimum Theorem
- The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points Theorem
- The image of a compact subset of ℝ under a continuous real function is compact Theorem
- The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 41 results over 11 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)
- Sequentially compact space (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (Def. 2.31, 2.32) (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §7.4 (standard reference, not scraped)
- J. K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)