Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Lipschitz map, α\alpha-Hölder map for rational 0<α10 < \alpha \le 1, and contraction

Definition

Let (X,dX)(X,d_X) and (Y,dY)(Y,d_Y) be metric spaces (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let f:XYf : X \to Y be a function. Recall that a metric takes nonnegative real values (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).

  • ff is Lipschitz with constant LL, where LRL \in \mathbb{R} and L0L \ge 0, if dY(f(x),f(x))    LdX(x,x)for all x,xX.d_Y\big(f(x), f(x')\big) \;\le\; L \, d_X(x,x') \qquad \text{for all } x, x' \in X . ff is Lipschitz if it is Lipschitz with some such constant.
  • Let αQ\alpha \in \mathbb{Q} with 0<α10 < \alpha \le 1 (Order on the rationals). ff is α\alpha-Hölder with constant CC, where CRC \in \mathbb{R} and C0C \ge 0, if dY(f(x),f(x))    CdX(x,x)αfor all x,xX,d_Y\big(f(x), f(x')\big) \;\le\; C \, d_X(x,x')^{\alpha} \qquad \text{for all } x, x' \in X , the power being the rational power of a nonnegative base (Rational powers ara^r of a positive base). ff is α\alpha-Hölder if it is so with some such constant, and Hölder if it is α\alpha-Hölder for some rational α(0,1]\alpha \in (0,1].
  • ff is a contraction with constant qq if it is Lipschitz with constant qq and 0q<10 \le q < 1. The number qq is then called a contraction constant for ff.

The power dX(x,x)αd_X(x,x')^{\alpha} is defined at every pair, including x=xx = x'. The base dX(x,x)d_X(x,x') is a nonnegative real, and Rational powers ara^r of a positive base defines aαa^{\alpha} for every a>0a > 0 and, by its supplementary clause, sets 0α=00^{\alpha} = 0 for every rational α>0\alpha > 0. Since α>0\alpha > 0 is required here, the displayed inequality at x=xx = x' reads 0C00 \le C \cdot 0, which holds; so no separate clause and no restriction to xxx \ne x' is needed. Note that this does not by itself explain the strict inequality α>0\alpha>0: if one extended the formula to α=0\alpha=0 using the convention 00=10^0=1 of Integer powers ama^m, the equal-point inequality would still be the automatic 0C0\le C. Globally, however, that extension would reduce to the bounded-diameter condition dY(f(x),f(x))Cd_Y(f(x),f(x'))\le C, outside the standard Hölder range adopted here.

Why the exponent is rational on this page and why it is at most 11. At this point in the reading order only rational powers are available (Rational powers ara^r of a positive base), so α\alpha ranges over the rationals. The upper bound α1\alpha \le 1 is the standard convention, and it is where the notion is useful: the classical theory reserves the name for α(0,1]\alpha \in (0,1], and nothing in this library uses an exponent outside that range. No claim is made here about what an exponent α>1\alpha > 1 would do.

Constants are not unique and are not part of the data. If ff is Lipschitz with constant LL it is Lipschitz with every constant LLL' \ge L, and likewise for Hölder constants; the adjectives above are existential statements. A contraction, by contrast, requires a constant strictly below 11, and that is a real restriction: exhibiting the constant is part of exhibiting a contraction, and a map that shrinks every distance without admitting one uniform constant is not a contraction here.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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