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.
The image of a compact subset of under a continuous real function is compact
Statement
Let , let be continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) and let be compact in the sense of Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset, that is, every family of open subsets of whose union contains has a finite subfamily whose union contains . Then the image
is a compact subset of .
This theorem is stated twice in this library, on purpose. Its metric-space twin is The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset, proved from the cover machinery of metric spaces; the proof below is -native and uses only open subsets of and the definition of continuity of this page. The duplication is deliberate and is acknowledged in exactly one place, Dictionary: for with the metric , continuity and uniform continuity of 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 later on this page, which proves that the two notions of "compact subset of " and the two notions of "continuous" coincide, so that the two theorems really are the same statement in two vocabularies.
No choice principle is used. The covering family built below is cut out by a property rather than selected point by point, and the only selection made is from a finite list, which needs no axiom.
Facts & Assumptions
Given: A set , a function continuous on , and a compact set ; .
Continuity of at : for every real there is a real with for every satisfying ; equivalently (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, The -neighbourhood and the punctured -neighbourhood of a point of ).
Open sets: is open when every point of has a neighbourhood inside , and every neighbourhood is itself an open set containing (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
Compactness of : for every family of open subsets of with , either and the empty subfamily covers it, or there are and with (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Proof
If , then , which is compact by [L3]. Hence suppose for the rest of the proof.
Let be a family of open subsets of with . Define This family is cut out by a property of the pair , so it is a set and nothing is selected in forming it; every member is an open subset of by [L2].
covers . Let . Then and , so for some . As is open, [L2] gives a real with , and [L1] gives a real with . Since we get , so , and by [L2]. Hence .
By [L3] there are and members of with . For each the membership asserts the existence of some with ; naming one such for each of the finitely many indices requires no choice principle.
The finite subfamily works. Let , say with . By step 3.1 there is with , hence and . Therefore , a union of finitely many members of .
Every family of open subsets of covering thus has a finite subfamily covering , so is compact.
Remarks
-
The proof is the preimage characterisation, made canonical. is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets says that is the trace on of an open set; the textbook argument pulls back each to such an open set and covers with those. Doing it that way selects one open set per member of , a family that may be arbitrarily large. Uniting all admissible balls instead, as above, reaches the same cover with no selection, and the only naming step left is over a finite index set.
-
The image of a compact set is closed and bounded, by A subset of is compact if and only if it is closed and bounded. That is what the next two items use, and it is the shortest route to both boundedness and the attainment of extrema.
-
Compactness cannot be weakened to closedness or to boundedness. The image of a closed set need not be closed (FALSE: the image of a closed subset of under a continuous real function is closed), and the image of a bounded set need not be bounded, since carries the bounded set onto .
Depends on
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Open cover, subcover, compact subset of $\mathbb{R}$ (every open cover has a finite subcover), and sequentially compact subset
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
Used by
- A continuous real function on a compact subset of ℝ is bounded Corollary
- 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
- Extreme value theorem: a continuous real function on a nonempty compact subset of ℝ attains a greatest and a least value Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 32 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)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.14) (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §3.3 (standard reference, not scraped)
- W. Trench, Introduction to Real Analysis, Ch. 8: Metric Spaces (standard reference, not scraped)
- MIT 18.100B lecture notes (standard reference, not scraped)