Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

The bounded real-valued functions on a set, with the supremum metric, form a complete metric space

Example

Let S be a nonempty set, let B(S):={ f:f is a bounded function S→R }, and let d∞(f,g):=sup⁡{ ∣f(s)−g(s)∣:s∈S } be the supremum metric, which is a metric on B(S) (The supremum metric d∞(f,g)=sup⁡x∣f(x)−g(x)∣ is a metric on the bounded real-valued functions on a nonempty set, Lower bound, bounded below, bounded set).

Then (B(S),d∞) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space).

The limit is produced pointwise and then shown to be bounded and to be approached uniformly; that order is the content of the proof.

Facts & Assumptions

Given: A nonempty set S; the space B(S) with the supremum metric d∞; a Cauchy sequence (fk) in (B(S),d∞); a point s∈S; a real ε>0.

[A1]

Cauchyness of (fk): for every real ε>0 there is K with d∞(fk,fl)<ε for all k,l≥K (Cauchy sequence in a metric space, The rationals embed densely in the reals).

[L1]

d∞ is a metric on B(S), and d∞(f,g) is the least upper bound of {∣f(s)−g(s)∣:s∈S}, so it dominates each of those numbers and is dominated by every upper bound of them (The supremum metric d∞(f,g)=sup⁡x∣f(x)−g(x)∣ is a metric on the bounded real-valued functions on a nonempty set, Complete ordered field (least-upper-bound property), Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L2]

A function h:S→R is bounded when its range is a bounded subset of R, that is when there is a real M≥0 with ∣h(s)∣≤M for every s; the passage from a pair of bounds to a single M is the maximum of two absolute values (Lower bound, bounded below, bounded set, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Basic properties of the absolute value).

[L3]

Every Cauchy sequence of reals converges, and the limit of a real sequence is unique, which licenses lim⁡kak for a sequence already known to converge (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, A sequence has at most one limit, Limits and Cauchy sequences of reals).

[L4]

Limits of reals preserve non-strict inequalities holding eventually, and behave additively (Limits preserve non-strict inequalities, Algebra of limits: sums, scalar multiples, products and quotients).

[L5]

∣∣a∣−∣b∣∣≤∣a−b∣ for reals, the reverse triangle inequality of the usual metric of R with third point 0; hence ak→a gives ∣ak∣→∣a∣ (The reverse triangle inequality ∣d(x,z)−d(y,z)∣≤d(x,y) in any metric space, Basic properties of the absolute value, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded).

Verification

technique · direct
1.1

For every s∈S and all k,l the number ∣fk(s)−fl(s)∣ belongs to the set whose supremum is d∞(fk,fl), so ∣fk(s)−fl(s)∣≤d∞(fk,fl).

L1
1.2

Apply [A1] with ε=1 to get K1 with d∞(fk,fl)<1 for all k,l≥K1, and let M≥0 satisfy ∣fK1(s)∣≤M for every s, which exists because fK1 is bounded.

A1L2
2.1

Hence for each fixed s the real sequence (fk(s))k is Cauchy, by [A1] and step 1.1; so it converges, and its limit is unique, so f(s):=lim⁡kfk(s) defines a function f:S→R. No choice is used, each value being a unique limit.

step 1.1A1L3
2.2

Let ε>0 be real and take K from [A1] for ε/2, so d∞(fk,fl)<ε/2 for all k,l≥K. For a fixed s and a fixed k≥K we get ∣fk(s)−fl(s)∣≤d∞(fk,fl)<ε/2 for every l≥K.

step 1.1A1
3.1

For every s and every l≥K1: ∣fl(s)∣≤∣fK1(s)∣+∣fl(s)−fK1(s)∣≤M+1 by step 1.1; letting l grow and using ∣fl(s)∣→∣f(s)∣ gives ∣f(s)∣≤M+1. So f is bounded and f∈B(S).

step 1.1step 2.1step 1.2L2L4L5
3.2

Letting l grow in step 2.2 and using fl(s)→f(s), hence ∣fk(s)−fl(s)∣→∣fk(s)−f(s)∣, gives ∣fk(s)−f(s)∣≤ε/2 for every s∈S and every k≥K.

step 2.1step 2.2L4L5
4.1

So ε/2 is an upper bound of { ∣fk(s)−f(s)∣:s∈S } for every k≥K, whence d∞(fk,f)≤ε/2<ε; note that d∞(fk,f) is defined, both functions being bounded.

step 3.1step 3.2L1
5.1

Since ε>0 was an arbitrary real, fk→f in (B(S),d∞) with f∈B(S); every Cauchy sequence therefore converges, and (B(S),d∞) is complete.

step 3.1step 4.1L6∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

58 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