TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)

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 $R$ under a continuous real function is compact

Statement

Let $A \subseteq R$ , let $f : A \to R$ be continuous on $A$ (Continuity of $f : A \to R$ at a point of $A$ and on $A$ : the $ε$ - $δ$ condition, its agreement with $\lim_{x \to c} f (x) = f (c)$ at a limit point, and continuity at an isolated point) and let $K \subseteq A$ be compact in the sense of Open cover, subcover, compact subset of $R$ (every open cover has a finite subcover), and sequentially compact subset, that is, every family of open subsets of $R$ whose union contains $K$ has a finite subfamily whose union contains $K$ . Then the image

$f [K] : = {f (x) : x \in K}$

is a compact subset of $R$ .

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 $R$ -native and uses only open subsets of $R$ and the definition of continuity of this page. The duplication is deliberate and is acknowledged in exactly one place, Dictionary: for $A \subseteq R$ with the metric $d (x, y) = ∣ x - y ∣$ , continuity and uniform continuity of $f : A \to R$ agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of $R$ is compact in the open-cover sense of $R$ exactly when it is a compact metric subspace later on this page, which proves that the two notions of "compact subset of $R$ " 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 \subseteq R$ , a function $f : A \to R$ continuous on $A$ , and a compact set $K \subseteq A$ ; $f [K] = {f (x) : x \in K}$ .

[L1]

Continuity of $f$ at $x \in A$ : for every real $ε > 0$ there is a real $δ > 0$ with $∣ f (y) - f (x) ∣ < ε$ for every $y \in A$ satisfying $∣ y - x ∣ < δ$ ; equivalently $f (A \cap N_{δ} (x)) \subseteq N_{ε} (f (x))$ (Continuity of $f : A \to R$ at a point of $A$ and on $A$ : the $ε$ - $δ$ condition, its agreement with $\lim_{x \to c} f (x) = f (c)$ at a limit point, and continuity at an isolated point, The $ε$ -neighbourhood and the punctured $ε$ -neighbourhood of a point of $R$ ).

[L2]

Open sets: $V \subseteq R$ is open when every point of $V$ has a neighbourhood inside $V$ , and every neighbourhood $N_{δ} (x)$ is itself an open set containing $x$ (Open subset of $R$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The $ε$ -neighbourhood and the punctured $ε$ -neighbourhood of a point of $R$ ).

[L3]

Compactness of $K$ : for every family $W$ of open subsets of $R$ with $K \subseteq ⋃ W$ , either $K = \emptyset$ and the empty subfamily covers it, or there are $n \in N$ and $W_{0}, \dots, W_{n} \in W$ with $K \subseteq W_{0} \cup \dots \cup W_{n}$ (Open cover, subcover, compact subset of $R$ (every open cover has a finite subcover), and sequentially compact subset).

Proof

technique · direct

1.1

If $K = \emptyset$ , then $f [K] = \emptyset$ , which is compact by [L3]. Hence suppose $K \neq \emptyset$ for the rest of the proof.

L3cases

1.2

Let $V$ be a family of open subsets of $R$ with $f [K] \subseteq ⋃ V$ . Define $W : = {N_{δ} (x) : x \in K, δ \in R, δ > 0, and f (K \cap N_{δ} (x)) \subseteq V for some V \in V} .$ This family is cut out by a property of the pair $(x, δ)$ , so it is a set and nothing is selected in forming it; every member is an open subset of $R$ by [L2].

2.1

$W$ covers $K$ . Let $x \in K$ . Then $x \in A$ and $f (x) \in f [K] \subseteq ⋃ V$ , so $f (x) \in V$ for some $V \in V$ . As $V$ is open, [L2] gives a real $ε > 0$ with $N_{ε} (f (x)) \subseteq V$ , and [L1] gives a real $δ > 0$ with $f (A \cap N_{δ} (x)) \subseteq N_{ε} (f (x)) \subseteq V$ . Since $K \subseteq A$ we get $f (K \cap N_{δ} (x)) \subseteq V$ , so $N_{δ} (x) \in W$ , and $x \in N_{δ} (x)$ by [L2]. Hence $K \subseteq ⋃ W$ .

step 1.2L1L2

3.1

By [L3] there are $n \in N$ and members $W_{0}, \dots, W_{n}$ of $W$ with $K \subseteq W_{0} \cup \dots \cup W_{n}$ . For each $i \leq n$ the membership $W_{i} \in W$ asserts the existence of some $V \in V$ with $f (K \cap W_{i}) \subseteq V$ ; naming one such $V_{i}$ for each of the finitely many indices $i \leq n$ requires no choice principle.

step 1.1step 1.2step 2.1L3choose

4.1

The finite subfamily works. Let $z \in f [K]$ , say $z = f (x)$ with $x \in K$ . By step 3.1 there is $i \leq n$ with $x \in W_{i}$ , hence $x \in K \cap W_{i}$ and $z = f (x) \in V_{i}$ . Therefore $f [K] \subseteq V_{0} \cup \dots \cup V_{n}$ , a union of finitely many members of $V$ .

step 3.1

5.1

Every family of open subsets of $R$ covering $f [K]$ thus has a finite subfamily covering $f [K]$ , so $f [K]$ is compact.

step 1.1step 1.2step 4.1L3∎

Remarks

The proof is the preimage characterisation, made canonical. $f : A \to R$ is continuous on $A$ if and only if the preimage of every open subset of $R$ is the intersection with $A$ of an open subset of $R$ , and dually for closed sets says that $f^{- 1} (V)$ is the trace on $A$ of an open set; the textbook argument pulls back each $V \in V$ to such an open set and covers $K$ with those. Doing it that way selects one open set per member of $V$ , 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 $R$ 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 $R$ under a continuous real function is closed), and the image of a bounded set need not be bounded, since $x \mapsto 1 / x$ carries the bounded set $(0, 1)$ onto $(1, \infty)$ .

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on 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)

The image of a compact subset of RR under a continuous real function is compact