Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 functions on a set form a complete metric space in the supremum metric, and the coding map of the two-sign shift space is an isometry

Statement

Let S be a nonempty set, let B(S) be the set of bounded functions S→R and let d∞ be the supremum 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); write 0 for the zero function. For R≥0 put

BR(S):={ f∈B(S) : ∣f(s)∣≤R for every s∈S }.

Let X±, φ, X2, d2, D± be as in The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences. Then:

  1. (B(S),d∞) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space);
  2. for every R≥0, (BR(S),d∞) is a complete metric space;
  3. D±(s,t)=d2(φ(s),φ(t)) is a metric on X± (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), and φ:(X±,D±)→(X2,d2) is a bijective isometry (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R for the underlying notion of distance);
  4. consequently ℓ∞(Z) with the distance ∥x−y∥∞ is a complete metric space, BR is complete for every R≥0, and the same holds for the one-sided bounded sequences, that is for S=N.

Facts & Assumptions

Given: A nonempty set S, the space B(S) of bounded real functions on S with supremum metric d∞, the numbers R≥0, and the objects X±,φ,X2,d2,D± of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences.

[F2]

d2 is a metric on X2 (The bilateral shift metric is a metric, cylinders are its basic balls, and the shift space is sequentially compact, clause 1) and D±(s,t)=d2(φ(s),φ(t)) by definition of D±; φ is a bijection with inverse t↦(2tk−1)k∈Z (The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences).

[F3]

Cauchy sequences, convergence and completeness are those of Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R and Complete metric space: every Cauchy sequence converges in the space; a sequence in a metric space converges to z exactly when the distances to z tend to 0.

[F5]

Limits preserve eventual inequalities: if the real sequences (xj) and (yj) converge and xj≤yj eventually, then lim⁡jxj≤lim⁡jyj (Limits preserve non-strict inequalities, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[F6]

Absolute value: ∣a∣≥0, ∣a∣=0 exactly for a=0, ∣a−b∣=∣b−a∣, ∣a+b∣≤∣a∣+∣b∣ and ∣a∣≤M exactly when −M≤a≤M for M≥0 (Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality).

Proof

technique · direct; take coordinatewise limits of a Cauchy sequence and estimate the supremum distance by an eventual coordinate bound
1.1givenF1F3F4F6

Let (fj)j∈N be a Cauchy sequence in (B(S),d∞) and fix s∈S. For all j,k one has ∣fj(s)−fk(s)∣∈{∣fj(s′)−fk(s′)∣:s′∈S} and therefore ∣fj(s)−fk(s)∣≤d∞(fj,fk) by [F1] and [F6]. Hence (fj(s))j is a Cauchy sequence of reals, so it converges; define f(s):=lim⁡jfj(s)∈R. This defines a function f:S→R.

1.2givenF2F6

Isometry property: for s,t∈X± put Φ(s,t):=d2(φ(s),φ(t)). Then Φ(s,t)=0 if and only if φ(s)=φ(t) (by [F2], [F6] and definiteness of d2), if and only if s=t since φ is injective ([F2]). Symmetry holds because d2 is symmetric, and the triangle inequality follows from that of d2: D±(s,u)=d2(φs,φu)≤d2(φs,φt)+d2(φt,φu)=D±(s,t)+D±(t,u) ([F2], [F6]). Finally D±(s,t)=d2(φs,φt) says exactly that the bijection φ preserves distances, so it is an isometry onto (X2,d2).

2.1step 1.1F1F5F6

Boundedness of f: since (fj) is Cauchy, there is N with d∞(fj,fN)≤1 for all j≥N; then ∣fj(s)∣≤∣fN(s)∣+1≤sup⁡s′∣fN(s′)∣+1=:M for all j≥N and all s, where M<∞ because fN is bounded ([F1], [F6]). For fixed s, the bounds −M≤fj(s)≤M pass to the limit by [F5], giving −M≤f(s)≤M, hence ∣f(s)∣≤M by [F6]. Thus f∈B(S).

3.1step 1.1step 2.1F1F3F5F6

Uniform error estimate: given ε>0, choose N with d∞(fj,fk)≤ε for all j,k≥N. Fix j≥N and s∈S; then ∣fk(s)−fj(s)∣≤d∞(fk,fj)≤ε for every k≥N ([F1], [F6]), thus fj(s)−ε≤fk(s)≤fj(s)+ε. Passing these inequalities to the coordinate limit with [F5] gives fj(s)−ε≤f(s)≤fj(s)+ε, or ∣f(s)−fj(s)∣≤ε by [F6]. Taking the supremum over s in [F1] gives d∞(f,fj)≤ε for every j≥N, so fj→f in (B(S),d∞).

4.1step 2.1step 3.1F1F5F6

The space (BR(S),d∞) is complete: if (fj) is Cauchy in (BR(S),d∞), then by steps 2.1 and 3.1 its pointwise limit f lies in B(S) and fj→f; for each s one has −R≤fj(s)≤R for all j, so [F5] gives −R≤f(s)≤R, hence ∣f(s)∣≤R by [F6]; hence f∈BR(S) and the Cauchy sequence converges inside BR(S).

5.1step 3.1step 4.1step 1.2givenF1∎

Conclusion. Clause 1 is proved by steps 1.1, 2.1 and 3.1: the pointwise limit of a Cauchy sequence of bounded functions is bounded (step 2.1) and is the uniform limit (step 3.1). Clause 2 is step 4.1, and clause 3 is step 1.2. For clause 4, take S=Z: by the definitions of The two-sign bilateral shift space, its coding map, and the ball of bounded bilateral real sequences the space B(Z) is exactly ℓ∞(Z) and d∞(f,g)=sup⁡k∣fk−gk∣=∥f−g∥∞, so clauses 1 and 2 give completeness of ℓ∞(Z) and of each BR, R≥0; with S=N the same identifications give the one-sided statement, the argument being identical since it never uses any structure of the index set beyond its nonemptiness.

Remarks

  • The proof is a coordinatewise limit argument plus one uniform two-index estimate; no choice principle is used, since the limit function is defined by the uniquely determined real limits of the coordinate sequences.

  • Clause 3 is the only point of contact between the two-sign space and the published two-symbol space: because φ is a bijective isometry, every metric statement about (X2,d2) transfers verbatim, and it will be used in this form for sequential compactness and for the chaos properties of the shift.

Depends on

Dependency tree · 2 levels

Sources