Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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 supremum metric d(f,g)=supxf(x)g(x)d_\infty(f,g) = \sup_x |f(x) - g(x)| on the bounded real-valued functions on a set

Example

Let SS be a nonempty set, let B(S)\mathcal{B}(S) be the set of bounded functions SRS \to \mathbb{R} and let d(f,g)=sup{f(s)g(s):sS}d_\infty(f,g) = \sup\{|f(s)-g(s)| : s \in S\} be the supremum metric; that this is a metric is 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 and is quoted here rather than reproved. This example records two things about it.

  1. The constants form an isometric copy of the real line. For cRc \in \mathbb{R} let c^B(S)\hat c \in \mathcal{B}(S) be the constant function with value cc. Then cc^c \mapsto \hat c is an isometric embedding of (R,dR)(\mathbb{R}, d_{\mathbb{R}}) into (B(S),d)(\mathcal{B}(S), d_\infty) (Isometry, isometric embedding, and the subspace metric on a subset, 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): d(c^,c^)=cc(c,cR).d_\infty(\hat c, \hat c\,') = |c - c\,'| \qquad (c, c\,' \in \mathbb{R}).
  2. The supremum need not be attained. Take S=NS = \mathbb{N}, so that B(N)\mathcal{B}(\mathbb{N}) is the set of bounded sequences of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences), and put f(k):=11k+1(kN),g:=0^.f(k) := 1 - \frac{1}{k+1} \quad (k \in \mathbb{N}), \qquad g := \hat 0 . Then f,gB(N)f, g \in \mathcal{B}(\mathbb{N}), d(f,g)=1d_\infty(f,g) = 1, and f(k)g(k)<1|f(k) - g(k)| < 1 for every kNk \in \mathbb{N}. So d(f,g)d_\infty(f,g) is a supremum that is not a maximum, and no single point of SS realises the distance.

The index shift in 1/(k+1)1/(k+1) is forced: N\mathbb{N} contains 00 (The natural numbers N\mathbb{N} (von Neumann)) and sequences here are indexed from 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so 1/k1/k would be undefined at k=0k = 0.

Facts & Assumptions

Given: A nonempty set SS; reals c,cc, c'; the constant functions c^,c^:SR\hat c, \hat c' : S \to \mathbb{R}; and, for S=NS = \mathbb{N}, the functions f(k)=11/(k+1)f(k) = 1 - 1/(k+1) and g=0^g = \hat 0, together with D(f,g):={f(k)g(k):kN}D(f,g) := \{\, |f(k) - g(k)| : k \in \mathbb{N} \,\}.

[L1]

The supremum metric is a metric on B(S)\mathcal{B}(S) for nonempty SS, and d(u,v)d_\infty(u,v) is the least upper bound of {u(s)v(s):sS}\{|u(s)-v(s)| : s \in S\} (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, Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L2]

Least upper bounds: a nonempty subset of R\mathbb{R} bounded above has a unique least upper bound (Complete ordered field (least-upper-bound property), Suprema and infima are unique); bounded subsets of R\mathbb{R} are as in Lower bound, bounded below, bounded set.

[L3]

Epsilon characterisation of the supremum: for a nonempty TRT \subseteq \mathbb{R} bounded above and an upper bound uu of TT, one has u=supTu = \sup T if and only if for every real ε>0\varepsilon > 0 there is tTt \in T with uε<tu - \varepsilon < t (Epsilon characterisation of the supremum).

[L4]

Reciprocal Archimedean property: for every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean); and m1R>0m \cdot 1_{\mathbb{R}} > 0 with 1/m>01/m > 0 for m1m \ge 1 (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L5]

Absolute value: t=t|t| = t for t0t \ge 0, t0|t| \ge 0 (Basic properties of the absolute value, Absolute value in an ordered field); and the usual metric of R\mathbb{R} is dR(c,c)=ccd_{\mathbb{R}}(c,c') = |c-c'| (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).

[L6]

Isometric embedding: a map preserving distances exactly (Isometry, isometric embedding, and the subspace metric on a subset); trichotomy and transitivity of the order of R\mathbb{R} (Ordered field, Complete ordered field (least-upper-bound property)).

Verification

technique · direct
1.1

Each constant function c^\hat c has range {c}\{c\}, a bounded subset of R\mathbb{R}, so c^B(S)\hat c \in \mathcal{B}(S); and {c^(s)c^(s):sS}={cc}\{|\hat c(s) - \hat c'(s)| : s \in S\} = \{|c - c'|\}, a nonempty one-element set whose least upper bound is cc|c - c'| itself.

givenL1L2L5
2.1

For S=NS = \mathbb{N}: each k+1k + 1 is a natural 1\ge 1, so 1/(k+1)1/(k+1) is a positive real and 0f(k)=11/(k+1)<10 \le f(k) = 1 - 1/(k+1) < 1; hence the range of ff is bounded and fB(N)f \in \mathcal{B}(\mathbb{N}), while g=0^g = \hat 0 is bounded by step 1.1, and D(f,g)={11/(k+1):kN}D(f,g) = \{\, 1 - 1/(k+1) : k \in \mathbb{N} \,\} is nonempty with 11 as an upper bound.

step 1.1L4L5
2.2

Claim 1: by step 1.1, d(c^,c^)=cc=dR(c,c)d_\infty(\hat c, \hat c') = |c - c'| = d_{\mathbb{R}}(c,c') for all reals c,cc, c', which is exactly the statement that cc^c \mapsto \hat c is an isometric embedding of (R,dR)(\mathbb{R},d_{\mathbb{R}}) into (B(S),d)(\mathcal{B}(S), d_\infty).

step 1.1L1L5L6
3.1

d(f,g)=1d_\infty(f,g) = 1: the number 11 is an upper bound of D(f,g)D(f,g) by step 2.1, and for an arbitrary real ε>0\varepsilon > 0 choose a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon and put k:=n1k := n - 1, a natural since n1n \ge 1, so that 11/(k+1)=11/n>1ε1 - 1/(k+1) = 1 - 1/n > 1 - \varepsilon; by the epsilon characterisation 11 is the least upper bound.

step 2.1L3L4L6
4.1

The supremum is not attained: every element of D(f,g)D(f,g) has the form 11/(k+1)1 - 1/(k+1) with 1/(k+1)>01/(k+1) > 0, hence is <1=d(f,g)< 1 = d_\infty(f,g), so no kNk \in \mathbb{N} satisfies f(k)g(k)=d(f,g)|f(k) - g(k)| = d_\infty(f,g).

step 2.1step 3.1L4L6
5.1

Claims 1 and 2 are established, by step 2.2 and by steps 3.1 and 4.1 respectively.

step 2.2step 3.1step 4.1

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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