Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 continuous real function on a compact subset of R is bounded

Statement

Let A⊆R, let f:A→R be continuous on A (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point) and let K⊆A be compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset). Then f is bounded on K: there is a real M≥0 with

∣f(x)∣≤Mfor every x∈K.

Equivalently, f[K] is a bounded subset of R (Lower bound, bounded below, bounded set).

The hypothesis is compactness of K, not of A, and it cannot be relaxed to boundedness of K or to closedness of K alone: the identity is unbounded on the closed set [0,∞), and x↦1/x is unbounded on the bounded set (0,1). The general statement of that is Rudin 4.20, the sharp converse: on a noncompact E⊆R 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, later on this page.

Facts & Assumptions

Given: A set A⊆R, a function f:A→R continuous on A, and a compact set K⊆A.

[L2]

A subset of R is compact if and only if it is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

[L3]

A set S⊆R is bounded when there are reals ℓ,u with ℓ≤s≤u for every s∈S (Lower bound, bounded below, bounded set).

[L4]

A nonempty finite set of reals has a maximum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set), and the order of R is total (Ordered field).

[L5]

Absolute value: ∣u∣≥0; ∣u∣=u when u≥0 and ∣u∣=−u when u≤0; and t≤∣t∣ for every real t (Basic properties of the absolute value).

Proof

technique · direct
1.1

By [L1] the set f[K] is compact, and by [L2] it is therefore closed and bounded.

L1L2
2.1

By [L3] fix reals ℓ and u with ℓ≤z≤u for every z∈f[K], and put M:=max⁡{ ∣ℓ∣, ∣u∣ }, which exists by [L4] and satisfies M≥0 by [L5].

step 1.1L3L4L5choose
3.1

Let x∈K and put z:=f(x)∈f[K], so ℓ≤z≤u. If z≥0 then ∣z∣=z≤u≤∣u∣≤M; if z<0 then ∣z∣=−z≤−ℓ≤∣ℓ∣≤M, using ℓ≤z and −ℓ≤∣−ℓ∣=∣ℓ∣. In both cases ∣f(x)∣≤M.

step 2.1L4L5
4.1

So ∣f(x)∣≤M for every x∈K, with M≥0 a real; equivalently f[K] is bounded, which is what step 1.1 already recorded.

step 2.1step 3.1L3∎

Remarks

  • Boundedness is the weak half of the extreme value theorem. What compactness gives in addition is that the two bounds are attained, which is Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value; the supremum of f[K] exists as soon as f[K] is nonempty and bounded above, and the work is entirely in showing that it belongs to f[K].

  • Boundedness of the domain is not what is used. The proof never looks at K after the first line: the whole content is that the image is compact, hence bounded. That is why the same one-line argument gives boundedness of a continuous function on any compact set, however complicated.

Depends on

Used by

Dependency tree · two levels

26 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