Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-29
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.

Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YXY^{X} and on C(X,Y)C(X,Y)

Definition

Let XX be a nonempty set and let (Y,d)(Y,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric).

Uniform convergence. A sequence (fk)(f_k) in YXY^{X} (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)) converges uniformly to fYXf \in Y^{X} if for every real ε>0\varepsilon > 0 there is KNK \in \mathbb{N} such that

d(fk(x),f(x))<εfor every xX and every kK.d\big(f_k(x), f(x)\big) < \varepsilon \qquad \text{for every } x \in X \text{ and every } k \ge K .

The whole content is the quantifier order: one index KK must serve every point of XX at once, whereas pointwise convergence allows KK to depend on the point as well as on ε\varepsilon. As everywhere in this library N\mathbb{N} contains 00 and a sequence is indexed from 00 (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)).

The topology. The topology of uniform convergence (the uniform topology) on YXY^{X} is the metric topology Tρˉ\mathcal{T}_{\bar\rho} (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) of the uniform metric

ρˉ(f,g)=supxXmin{d(f(x),g(x)), 1}\bar\rho(f,g) = \sup_{x \in X} \min\{\, d(f(x),g(x)),\ 1 \,\}

of For a nonempty set XX and a metric space (Y,d)(Y,d) the uniform metric ρˉ(f,g)=supxmin{d(f(x),g(x)),1}\bar\rho(f,g) = \sup_{x} \min\{d(f(x),g(x)), 1\} is a metric on YXY^{X}. Its basic open sets are the balls Bρˉ(f,ε)B_{\bar\rho}(f,\varepsilon) (Open ball, closed ball and sphere in a metric space), and YXY^{X} with this topology is a metrizable space (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

On C(X,Y)C(X,Y). If XX carries a topology, the topology of uniform convergence on C(X,Y)C(X,Y) (Continuity of a map of topological spaces at a point and globally) is the subspace topology inherited from YXY^{X} (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace). It is the metric topology of the restriction of ρˉ\bar\rho to C(X,Y)×C(X,Y)C(X,Y) \times C(X,Y): the subspace topology of a metric topology is the metric topology of the subspace metric (Isometry, isometric embedding, and the subspace metric on a subset, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). So the two readings of the phrase agree, and C(X,Y)C(X,Y) carrying it is again metrizable.

The name is justified by the next item. That convergence in Tρˉ\mathcal{T}_{\bar\rho} is exactly uniform convergence in the sense defined above is not part of the definition; it is Convergence in the uniform metric is exactly uniform convergence: one NN serving every point , and it is what entitles the topology to the name.

XX is nonempty throughout. The uniform metric is defined only for nonempty XX (For a nonempty set XX and a metric space (Y,d)(Y,d) the uniform metric ρˉ(f,g)=supxmin{d(f(x),g(x)),1}\bar\rho(f,g) = \sup_{x} \min\{d(f(x),g(x)), 1\} is a metric on YXY^{X}), so the topology of uniform convergence is defined only there. The notion of uniform convergence itself makes sense for X=X = \varnothing and is vacuous, every sequence converging uniformly to the unique element of YY^{\varnothing}; nothing below uses that case.

Remarks

  • Uniform convergence is a property of the metric dd, not of the topology of YY. Both quantifiers above are about distances. Two metrics inducing the same topology on YY can disagree about which sequences of functions converge uniformly, exactly as they can disagree about which sequences are Cauchy (Topologically, uniformly and Lipschitz equivalent metrics on a set). Read uniformly convergent as an abbreviation for uniformly convergent with respect to this metric, always.

  • The truncation at 11 does not affect the notion. The uniform metric truncates distances at 11 so that a supremum exists without a boundedness hypothesis, and the next item shows that the truncation is invisible to convergence: below the threshold 11 the truncated and untruncated distances agree, and convergence is a statement about arbitrarily small distances.

  • Uniform convergence is strictly stronger than pointwise convergence. Taking KK from the uniform condition serves at each individual point, so a uniformly convergent sequence converges pointwise; the converse fails, and the companion page exhibits a sequence of continuous functions on [0,1][0,1] converging pointwise to 00 with ρˉ(fk,0)=1\bar\rho(f_k, 0) = 1 for every kk.

Depends on

Used by

Dependency tree · next 3 levels

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