Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Statement

Let (X,d)(X,d) be a nonempty compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space, Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let f:XRf : X \to \mathbb{R} be continuous (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form), R\mathbb{R} carrying its usual metric dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded). Then the image f[X]f[X] is bounded above and below (Lower bound, bounded below, bounded set), and it has a maximum and a minimum (Maximum and minimum of a set): there are points xmax,xminXx_{\max}, x_{\min} \in X with

f(xmin)    f(x)    f(xmax)for every xX,f(x_{\min}) \;\le\; f(x) \;\le\; f(x_{\max}) \qquad \text{for every } x \in X,

and then f(xmax)=supf[X]f(x_{\max}) = \sup f[X] and f(xmin)=inff[X]f(x_{\min}) = \inf f[X] (Complete ordered field (least-upper-bound property), Greatest lower bound (infimum)).

Nonemptiness of XX is a hypothesis and not an oversight: for X=X = \emptyset the image is empty and has neither a supremum nor a maximum. No choice principle is used.

Facts & Assumptions

Given: A nonempty compact metric space (X,d)(X,d) and a continuous f:XRf : X \to \mathbb{R}.

[L1]

The image of a compact metric space under a continuous map is a compact subset of the codomain (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).

[L4]

A nonempty subset of R\mathbb{R} that is bounded above has a supremum, and one bounded below has an infimum (Complete ordered field (least-upper-bound property), Greatest lower bound (infimum), Lower bound, bounded below, bounded set).

[L5]

For SS nonempty and bounded above with supremum uu: for every real ε>0\varepsilon > 0 there is sSs \in S with uε<suu - \varepsilon < s \le u; dually for the infimum (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum).

[L7]

A subset of a metric space is compact exactly when the corresponding metric subspace is compact, the subspace metric being the restriction (Open cover, subcover, compact metric space, and compact subset of a metric space, Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct
1.1

f[X]f[X] is a compact subset of (R,dR)(\mathbb{R}, d_{\mathbb{R}}), and it is nonempty because XX is.

L1L7
2.1

So f[X]f[X] is closed in R\mathbb{R} and bounded as a subset of the metric space (R,dR)(\mathbb{R},d_{\mathbb{R}}): there are x0Rx_0 \in \mathbb{R} and a real ρ>0\rho > 0 with f[X]B(x0,ρ)=(x0ρ, x0+ρ)f[X] \subseteq B(x_0,\rho) = (x_0-\rho,\ x_0+\rho).

L2L3step 1.1
3.1

Hence x0+ρx_0 + \rho is an upper bound and x0ρx_0 - \rho a lower bound of f[X]f[X], so f[X]f[X] is bounded above and below, and being nonempty it has a supremum uu and an infimum \ell.

L4step 2.1
4.1

For every real ε>0\varepsilon > 0 there is tf[X]t \in f[X] with uε<tuu - \varepsilon < t \le u, so tu<ε|t - u| < \varepsilon and tB(u,ε)f[X]t \in B(u,\varepsilon) \cap f[X]; therefore every ball around uu meets f[X]f[X] and uu lies in the closure of f[X]f[X].

L3L5L6step 3.1
5.1

Since f[X]f[X] is closed, uf[X]u \in f[X]; so uu is a member of f[X]f[X] bounding it above, that is u=maxf[X]u = \max f[X], and u=f(xmax)u = f(x_{\max}) for some xmaxXx_{\max} \in X.

L6step 2.1step 4.1
6.1

The same argument with \ell in place of uu, using the infimum form of step 4.1, gives f[X]\ell \in f[X], so =minf[X]\ell = \min f[X] and =f(xmin)\ell = f(x_{\min}) for some xminXx_{\min} \in X.

L5L6step 3.1step 5.1
7.1

For every xXx \in X the value f(x)f(x) lies in f[X]f[X], hence f(xmin)=f(x)u=f(xmax)f(x_{\min}) = \ell \le f(x) \le u = f(x_{\max}), which is the assertion, with f(xmax)=supf[X]f(x_{\max}) = \sup f[X] and f(xmin)=inff[X]f(x_{\min}) = \inf f[X].

L4step 3.1step 5.1step 6.1

Remarks

Compactness is what is used, not boundedness of the domain. A bounded non-compact domain is not enough: on the interval (0,1)(0,1) the identity map is continuous and bounded with no greatest value, and x1/xx \mapsto 1/x is continuous and unbounded (On (0,1)(0,1) the identity is bounded with no greatest value and x1/xx \mapsto 1/x is continuous and unbounded, so the extreme value theorem needs compactness and not merely boundedness of the domain ).

Why the supremum has to be shown to be attained at all. supf[X]\sup f[X] exists as soon as f[X]f[X] is nonempty and bounded above, which needs only boundedness; what compactness adds is that f[X]f[X] is closed, and a closed set contains the supremum it approaches. Steps 4.1 and 5.1 are exactly that passage, and they are where the theorem is more than the least-upper-bound property.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 82 results over 15 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