Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

The 11-Lipschitz maps of a metric space into R\mathbb{R} form a uniformly equicontinuous family, and the distance functions xd(x,A)x \mapsto d(x,A) all belong to it

Example

Let (X,d)(X,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) and let R\mathbb{R} carry its usual metric (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). Put

L  :=  {f:XR  :  f is Lipschitz with constant 1}    RX\mathcal{L} \;:=\; \{\, f : X \to \mathbb{R} \;:\; f \text{ is Lipschitz with constant } 1 \,\} \;\subseteq\; \mathbb{R}^{X}

(Lipschitz map, α\alpha-Hölder map for rational 0<α10 < \alpha \le 1, and contraction, The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)). Then:

  1. L\mathcal{L} is uniformly equicontinuous (Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces), with δ:=ε\delta := \varepsilon serving at every ε\varepsilon;
  2. for every nonempty AXA \subseteq X the distance function φA(x):=d(x,A)\varphi_A(x) := d(x,A) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) belongs to L\mathcal{L};
  3. if XX \ne \varnothing then L\mathcal{L} is not pointwise bounded, since it contains every constant function.

So equicontinuity and pointwise boundedness are genuinely independent hypotheses: this family has the first and not the second, and the next counterexample on this page has the second and not the first.

Facts & Assumptions

Given: A metric space (X,d)(X,d), the target R\mathbb{R} with the metric dR(s,t)=std_{\mathbb{R}}(s,t) = |s-t|, and the family L\mathcal{L} displayed above.

[L2]

A family F\mathcal{F} is uniformly equicontinuous when for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 with f(x)f(x)<ε|f(x) - f(x')| < \varepsilon for every fFf \in \mathcal{F} and all x,xx,x' with d(x,x)<δd(x,x') < \delta; and F\mathcal{F} is pointwise bounded when each set {f(x):fF}\{\, f(x) : f \in \mathcal{F} \,\} is bounded (Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces, Uniform continuity of a map of metric spaces: one δ\delta serving every point, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[L3]

For nonempty AXA \subseteq X the function xd(x,A)x \mapsto d(x,A) is defined and satisfies d(x,A)d(x,A)d(x,x)|d(x,A) - d(x',A)| \le d(x,x') (d(x,A)d(y,A)d(x,y)|d(x,A) - d(y,A)| \le d(x,y), so the distance to a fixed nonempty set is 11-Lipschitz, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

Verification

technique · direct
1.1

Let ε>0\varepsilon > 0 be real and put δ:=ε\delta := \varepsilon; for every fLf \in \mathcal{L} and all x,xXx, x' \in X with d(x,x)<δd(x,x') < \delta we get f(x)f(x)d(x,x)<ε|f(x) - f(x')| \le d(x,x') < \varepsilon.

L1L2
1.2

For nonempty AXA \subseteq X the function φA\varphi_A is defined at every point and satisfies φA(x)φA(x)d(x,x)|\varphi_A(x) - \varphi_A(x')| \le d(x,x'), so it is Lipschitz with constant 11 and lies in L\mathcal{L}; this is claim 2.

L1L3
2.1

As ε\varepsilon was arbitrary, step 1.1 is exactly uniform equicontinuity of L\mathcal{L}, which is claim 1; in particular every member of L\mathcal{L} is uniformly continuous and continuous.

step 1.1L2L5
3.1

Every constant function c:XRc : X \to \mathbb{R} satisfies c(x)c(x)=0d(x,x)|c(x)-c(x')| = 0 \le d(x,x'), so lies in L\mathcal{L}; hence for XX \ne \varnothing and any xXx \in X the set {f(x):fL}\{\, f(x) : f \in \mathcal{L} \,\} contains every real and so lies in no ball of R\mathbb{R}, and L\mathcal{L} is not pointwise bounded, which is claim 3.

L1L2L4

Remarks

  • A common constant is what makes the family equicontinuous, not Lipschitzness of each member. Every member of L\mathcal{L} is Lipschitz, but so is every member of {xι(k)x:kN}\{\, x \mapsto \iota(k) x : k \in \mathbb{N} \,\} on R\mathbb{R}, and that family is not equicontinuous at any point: the constants grow without bound. Fixing the constant at 11 is the hypothesis doing the work, exactly as the last remark of Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces records.

  • Claim 2 is why equicontinuity is worth defining at all here. The distance functions φA\varphi_A are the standard supply of Lipschitz maps in a metric space, and they are what an Ascoli-type argument on a later page will use; that they all sit in one uniformly equicontinuous family is the reason such arguments do not need any hypothesis on AA beyond nonemptiness.

  • Claim 3 is a warning about reading the two hypotheses as one. Pointwise boundedness is a condition on the values and equicontinuity a condition on the variation; a family may satisfy either without the other, and the theorem that uses both needs both.

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: 123 results over 26 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