Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-10 (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.

C(K,R)C(K,\mathbb{R}) is complete in the supremum metric for every nonempty compact metric space KK

Statement

Let (K,d)(K,d) be a nonempty compact metric space. Every member of C(K,R)C(K,\mathbb{R}) is bounded, so the supremum metric

d(f,g):=supxKf(x)g(x)d_\infty(f,g):=\sup_{x\in K}|f(x)-g(x)|

is defined on C(K,R)C(K,\mathbb{R}). With this metric, C(K,R)C(K,\mathbb{R}) is complete.

Facts & Assumptions

Given: A nonempty compact metric space (K,d)(K,d) and the set C(K,R)C(K,\mathbb{R}) of continuous real-valued functions on it.

[L1]

Every continuous real-valued function on a nonempty compact metric space has a bounded range (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[L2]

If SS is nonempty, the formula d(f,g)=supxSf(x)g(x)d_\infty(f,g)=\sup_{x\in S}|f(x)-g(x)| defines a metric on the set of bounded functions SRS\to\mathbb{R} (The supremum metric d(f,g)=supxf(x)g(x)d_\infty(f,g) = \sup_x |f(x) - g(x)| is a metric on the bounded real-valued functions on a nonempty set).

[L3]

A sequence is Cauchy in a metric dd when, for every positive error, all pairwise distances sufficiently far out are below that error; it converges to pp when its distances to pp tend to zero (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).

[L4]

A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy (A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy).

[L5]

A uniform limit of continuous real-valued functions on a metric space is continuous (The uniform limit of continuous real-valued functions on a metric space is continuous).

[L6]

A metric space is complete when every Cauchy sequence in it converges to one of its points (Complete metric space: every Cauchy sequence converges in the space).

Proof

technique · direct
1.1

By [L1], every fC(K,R)f\in C(K,\mathbb{R}) is bounded. Thus C(K,R)C(K,\mathbb{R}) is a subset of the bounded functions on KK, and the restriction of the metric in [L2] is a metric on C(K,R)C(K,\mathbb{R}).

L1L2
1.2

Let (fj)(f_j) be a Cauchy sequence in this supremum metric.

givenL3
2.1

Given a real ε>0\varepsilon>0, choose JJ such that d(fm,fn)<εd_\infty(f_m,f_n)<\varepsilon for all m,nJm,n\ge J. Then fm(x)fn(x)d(fm,fn)<ε|f_m(x)-f_n(x)|\le d_\infty(f_m,f_n)<\varepsilon for all such m,nm,n and every xKx\in K, so (fj)(f_j) is uniformly Cauchy.

step 1.2L2L3
3.1

By [L4] there is a function f:KRf:K\to\mathbb{R} such that fjff_j\to f uniformly on KK.

step 2.1L4
4.1

The function ff is continuous by [L5], hence belongs to C(K,R)C(K,\mathbb{R}) and is bounded by [L1].

step 3.1L1L5
5.1

Let ε>0\varepsilon>0. Uniform convergence gives JJ such that fj(x)f(x)<ε/2|f_j(x)-f(x)|<\varepsilon/2 for every jJj\ge J and xKx\in K; hence d(fj,f)ε/2<εd_\infty(f_j,f)\le\varepsilon/2<\varepsilon, so fjff_j\to f in the supremum metric.

step 3.1step 4.1L2L3
6.1

Every Cauchy sequence in C(K,R)C(K,\mathbb{R}) therefore converges in the supremum metric to a member of C(K,R)C(K,\mathbb{R}), so the metric space is complete.

step 1.1step 5.1L6

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 97 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