Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value

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 nonempty and compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset). Then sup⁡f[K] and inf⁡f[K] exist and are attained: there are p,q∈K with

f(q)  =  inf⁡f[K]  ≤  f(x)  ≤  sup⁡f[K]  =  f(p)for every x∈K.

Equivalently, the set f[K] has a maximum and a minimum (Maximum and minimum of a set), namely max⁡f[K]=f(p) and min⁡f[K]=f(q).

Nonemptiness of K is a hypothesis, not an oversight. For K=∅ the set f[K] is empty, and neither a supremum nor a maximum of the empty set exists in this library (Complete ordered field (least-upper-bound property) supplies suprema of nonempty sets bounded above only).

This theorem is stated twice in this library, on purpose. Its metric-space twin is A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, proved from the cover machinery of metric spaces; the proof below is R-native, running through Heine-Borel for R and the order-completeness of R, and it uses no cover argument beyond the one already spent in The image of a compact subset of R under a continuous real function is compact. That the two statements are the same statement in two vocabularies is proved in Dictionary: for A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→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.

Facts & Assumptions

Given: A set A⊆R, a function f:A→R continuous on A, and a nonempty compact set K⊆A; write S:=f[K].

[L1]

S=f[K] is compact (The image of a compact subset of R under a continuous real function is compact), and it is nonempty because K is.

[L2]

S is bounded: there is a real M≥0 with ∣z∣≤M for every z∈S, so −M is a lower bound and M an upper bound of S (A continuous real function on a compact subset of R is bounded, Lower bound, bounded below, bounded set).

[L4]

Least upper bounds: a nonempty subset of R bounded above has a supremum (Complete ordered field (least-upper-bound property)); a nonempty subset bounded below has an infimum (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).

[L5]

Epsilon characterisations: for nonempty S bounded above and u=sup⁡S, every real ε>0 admits s∈S with u−ε<s; dually for ℓ=inf⁡S there is s∈S with s<ℓ+ε (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum).

[L7]

A maximum of a set is an element of it that bounds it above, and a minimum is an element that bounds it below (Maximum and minimum of a set).

Proof

technique · direct
1.1

By [L1] the set S=f[K] is nonempty and compact, and by [L2] it is bounded; by [L3] it is closed.

L1L2L3
2.1

By [L4] the supremum u:=sup⁡S and the infimum ℓ:=inf⁡S exist.

step 1.1L4
3.1

u is adherent to S. Let a real ε>0 be given. By [L5] there is s∈S with u−ε<s, and s≤u<u+ε since u bounds S above; hence ∣s−u∣<ε, that is s∈Nε(u)∩S. So every neighbourhood of u meets S.

step 2.1L5L6
3.2

ℓ is adherent to S. Symmetrically, [L5] gives s∈S with s<ℓ+ε, and ℓ≤s since ℓ bounds S below; hence s∈Nε(ℓ)∩S for every real ε>0.

step 2.1L5L6
4.1

By [L6] the two steps above say u∈S‾ and ℓ∈S‾; and S is closed by step 1.1, so S‾=S and therefore u∈S and ℓ∈S.

step 1.1step 3.1step 3.2L6
5.1

Since u∈S=f[K] there is p∈K with f(p)=u, and since ℓ∈S there is q∈K with f(q)=ℓ.

step 4.1choose
6.1

For every x∈K the value f(x) lies in S, so ℓ≤f(x)≤u, that is f(q)≤f(x)≤f(p). Hence u=sup⁡f[K]=f(p) is a maximum of f[K] and ℓ=inf⁡f[K]=f(q) is a minimum of it, both attained at points of K.

step 2.1step 4.1step 5.1L7∎

Remarks

Depends on

Used by

Dependency tree · two levels

36 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