Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27 rests on later material
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.

On [0,1][0,1] the function xβx^{\beta} is β\beta-Hölder and is α\alpha-Hölder for no rational α>β\alpha > \beta, so the Hölder classes are strictly nested

Example

Let βQ\beta \in \mathbb{Q} with 0<β10 < \beta \le 1 (Order on the rationals) and let

fβ:[0,1]R,fβ(x):=xβf_{\beta} : [0,1] \to \mathbb{R}, \qquad f_{\beta}(x) := x^{\beta}

be the rational power of a nonnegative base (Rational powers ara^r of a positive base, with the convention 0β=00^{\beta} = 0), on the closed bounded interval [0,1][0,1] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Hölder conditions for a real function on [0,1][0,1] are the metric ones instantiated, by Dictionary: for ARA \subseteq \mathbb{R} with the metric d(x,y)=xyd(x,y) = |x-y|, continuity and uniform continuity of f:ARf : A \to \mathbb{R} agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R\mathbb{R} is compact in the open-cover sense of R\mathbb{R} exactly when it is a compact metric subspace, clause 4: gg is γ\gamma-Hölder with constant CC when g(x)g(y)Cxyγ|g(x) - g(y)| \le C\,|x-y|^{\gamma} for all x,y[0,1]x, y \in [0,1] (Lipschitz map, α\alpha-Hölder map for rational 0<α10 < \alpha \le 1, and contraction). Then:

  1. fβf_{\beta} is β\beta-Hölder with constant 11: xβyβ    xyβfor all x,y[0,1].\bigl|x^{\beta} - y^{\beta}\bigr| \;\le\; |x-y|^{\beta} \qquad \text{for all } x, y \in [0,1].
  2. fβf_{\beta} is α\alpha-Hölder for no rational α\alpha with β<α1\beta < \alpha \le 1: for such an α\alpha there is no real C0C \ge 0 with xβyβCxyα|x^{\beta} - y^{\beta}| \le C|x-y|^{\alpha} throughout [0,1][0,1].
  3. The classes are nested: if 0<β<α10 < \beta < \alpha \le 1 are rational and g:[0,1]Rg : [0,1] \to \mathbb{R} is α\alpha-Hölder with constant CC, then gg is β\beta-Hölder with the same constant CC.
  4. Hence the nesting is strict, at every pair of rational exponents 0<β<α10 < \beta < \alpha \le 1: the α\alpha-Hölder functions on [0,1][0,1] form a proper subclass of the β\beta-Hölder ones, fβf_{\beta} lying in the second and not the first. Taking α=1\alpha = 1: for rational 0<β<10 < \beta < 1 the function fβf_{\beta} is uniformly continuous on [0,1][0,1] (Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA) and is not Lipschitz.

What this witnesses. Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent asserts Lipschitz \Rightarrow uniformly continuous \Rightarrow continuous and α\alpha-Hölder \Rightarrow uniformly continuous, and claims no converse; it says so explicitly. This item supplies the missing witnesses on the real line, and it is one of the two named in the remarks of Dictionary: for ARA \subseteq \mathbb{R} with the metric d(x,y)=xyd(x,y) = |x-y|, continuity and uniform continuity of f:ARf : A \to \mathbb{R} agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R\mathbb{R} is compact in the open-cover sense of R\mathbb{R} exactly when it is a compact metric subspace. The other is x1/xx \mapsto 1/x is continuous on (0,1)(0,1) and not uniformly continuous there, the pairs 1/(k+2)1/(k+2) and 1/(k+3)1/(k+3) defeating every δ\delta, which separates continuity from uniform continuity.

Why the exponents are rational. Rational powers ara^r of a positive base is the exponent theory available at this page's position in the reading order, so the example is stated for rational exponents. The later Real powers for positive bases, with the zero-base positive-exponent convention supplies real exponents; the restriction here belongs to the local toolkit, not to the Hölder notion. Exponents above 11 are excluded there for a reason of substance: they force constancy (If f(x)f(y)Cxyα|f(x) - f(y)| \le C|x-y|^{\alpha} on an interval for some rational α>1\alpha > 1 then ff is constant).

Facts & Assumptions

Given: A rational β\beta with 0<β10 < \beta \le 1, the interval [0,1][0,1], and fβ(x)=xβf_{\beta}(x) = x^{\beta}. Naturals are identified with their canonical images in R\mathbb{R}.

[L1]

Rational powers: ara^{r} is defined for a>0a > 0 and rQr \in \mathbb{Q}, with a1=aa^{1} = a and aq/1=aqa^{q/1} = a^{q} agreeing with the integer power; 0r=00^{r} = 0 for rational r>0r > 0; and 1r=11^{r} = 1 (Rational powers ara^r of a positive base, Existence and uniqueness of nn-th roots: a unique a1/n0a^{1/n} \ge 0 with (a1/n)n=a(a^{1/n})^n = a, Integer powers ama^m, Monotonicity of rarr \mapsto a^{r} and of aara \mapsto a^{r}).

[L2]

Laws of rational exponents for a,b>0a, b > 0 and r,sQr, s \in \mathbb{Q}: ar>0a^{r} > 0; ar+s=arasa^{r+s} = a^{r}a^{s}; (ab)r=arbr(ab)^{r} = a^{r}b^{r}; ar=1/ara^{-r} = 1/a^{r}; (ar)s=ars(a^{r})^{s} = a^{rs}. The product law persists for a,b0a, b \ge 0 when r>0r > 0 (Laws of rational exponents).

[L3]

Monotonicity: for 0<a<10 < a < 1 and rationals r<sr < s one has ar>asa^{r} > a^{s}; for a>1a > 1 and r<sr < s one has ar<asa^{r} < a^{s}; for a=1a = 1 all powers are 11; and for rational r>0r > 0 and 0<a<b0 < a < b one has ar<bra^{r} < b^{r} (Monotonicity of rarr \mapsto a^{r} and of aara \mapsto a^{r}).

[L5]

Archimedean property: for every real η>0\eta > 0 there is a natural q1q \ge 1 with 1/q<η1/q < \eta, and for every real tt a natural nn with t<nt < n; and 0<s<t0 < s < t implies 0<1/t<1/s0 < 1/t < 1/s (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, Inverses of positives are positive, and reciprocation reverses order).

[L6]

Absolute value and order in R\mathbb{R}: u0|u| \ge 0; u=u|u| = u for u0u \ge 0; the order is total, so two points of [0,1][0,1] may be named so that one is \le the other; and [0,1]={x:0x1}[0,1] = \{\, x : 0 \le x \le 1 \,\} (Basic properties of the absolute value, Ordered field, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

For 0t10 \le t \le 1 one has tβtt^{\beta} \ge t. If t=0t = 0 then tβ=0=tt^{\beta} = 0 = t by [L1]; if t=1t = 1 then tβ=1=tt^{\beta} = 1 = t by [L1]. If 0<t<10 < t < 1 then, when β<1\beta < 1, [L3] with r:=β<s:=1r := \beta < s := 1 gives tβ>t1=tt^{\beta} > t^{1} = t, and when β=1\beta = 1 it is an equality.

L1L3L6
1.2

Claim 3. Let 0<β<α10 < \beta < \alpha \le 1 be rational and let gg satisfy g(x)g(y)Cxyα|g(x) - g(y)| \le C|x-y|^{\alpha} on [0,1][0,1]. For x,y[0,1]x, y \in [0,1] put a:=xya := |x-y|, so 0a10 \le a \le 1 by [L6]. If a=0a = 0 then aα=aβ=0a^{\alpha} = a^{\beta} = 0 by [L1]; if a=1a = 1 then both are 11 by [L1]; and if 0<a<10 < a < 1 then [L3] with r:=β<s:=αr := \beta < s := \alpha gives aα<aβa^{\alpha} < a^{\beta}. In every case aαaβa^{\alpha} \le a^{\beta}, so g(x)g(y)CaαCaβ|g(x) - g(y)| \le C a^{\alpha} \le C a^{\beta} and gg is β\beta-Hölder with the same constant.

L1L3L4L6
1.3

Claim 2, the setup. Let αQ\alpha \in \mathbb{Q} with β<α1\beta < \alpha \le 1 and suppose, for contradiction, that some real C0C \ge 0 satisfies xβyβCxyα|x^{\beta} - y^{\beta}| \le C|x-y|^{\alpha} for all x,y[0,1]x, y \in [0,1]. Taking x:=1x := 1 and y:=0y := 0 gives 1=10C1=C1 = |1 - 0| \le C \cdot 1 = C by [L1], so C1>0C \ge 1 > 0. Taking y:=0y := 0 and an arbitrary xx with 0<x10 < x \le 1 gives xβCxαx^{\beta} \le C x^{\alpha}.

L1L6
2.1

Subadditivity: (u+v)βuβ+vβ(u+v)^{\beta} \le u^{\beta} + v^{\beta} for all reals u,v0u, v \ge 0. If u+v=0u + v = 0 then u=v=0u = v = 0 and both sides are 00 by [L1]. Otherwise put s:=u+v>0s := u+v > 0, p:=u/sp := u/s and q:=v/sq := v/s, so p,q0p, q \ge 0 and p+q=1p + q = 1, whence 0p10 \le p \le 1 and 0q10 \le q \le 1. By step 1.1, pβpp^{\beta} \ge p and qβqq^{\beta} \ge q, so pβ+qβp+q=1p^{\beta} + q^{\beta} \ge p + q = 1. By the product law of [L2], valid for nonnegative bases since β>0\beta > 0, uβ=(ps)β=pβsβu^{\beta} = (p s)^{\beta} = p^{\beta}s^{\beta} and vβ=qβsβv^{\beta} = q^{\beta}s^{\beta}; hence uβ+vβ=(pβ+qβ)sβsβ=(u+v)βu^{\beta} + v^{\beta} = (p^{\beta} + q^{\beta})s^{\beta} \ge s^{\beta} = (u+v)^{\beta}, using sβ>0s^{\beta} > 0 from [L2].

step 1.1L1L2L6
2.2

Claim 2, the estimate. Put γ:=αβ\gamma := \alpha - \beta, a rational with γ>0\gamma > 0. For 0<x10 < x \le 1, dividing the inequality of step 1.3 by xα>0x^{\alpha} > 0 and using [L2] gives xβα=xβxαCx^{\beta - \alpha} = x^{\beta}x^{-\alpha} \le C, that is 1/xγC1/x^{\gamma} \le C and hence xγ1/C>0x^{\gamma} \ge 1/C > 0 by [L5]. Applying this at x:=1/nx := 1/n for a natural n1n \ge 1, and using (1/n)γ=1/nγ(1/n)^{\gamma} = 1/n^{\gamma} from [L2], gives nγCn^{\gamma} \le C for every natural n1n \ge 1.

step 1.3L2L5
3.1

Claim 1. Let x,y[0,1]x, y \in [0,1]; by [L6] name them so that yxy \le x. Put u:=y0u := y \ge 0 and v:=xy0v := x - y \ge 0, so x=u+vx = u + v. By step 2.1, xβyβ+(xy)βx^{\beta} \le y^{\beta} + (x-y)^{\beta}, that is xβyβ(xy)β=xyβx^{\beta} - y^{\beta} \le (x-y)^{\beta} = |x-y|^{\beta}. Also yβxβy^{\beta} \le x^{\beta}: for y=0y = 0 this reads 0xβ0 \le x^{\beta} by [L1] and [L2], and for 0<yx0 < y \le x it is [L3] with the exponent β>0\beta > 0, together with equality when y=xy = x. Hence xβyβ=xβyβxyβ|x^{\beta} - y^{\beta}| = x^{\beta} - y^{\beta} \le |x-y|^{\beta}, so fβf_{\beta} is β\beta-Hölder with constant 11.

step 2.1L1L2L3L4L6
3.2

Claim 2, the contradiction. By [L5] fix a natural q1q \ge 1 with 1/q<γ1/q < \gamma, and then a natural nn with Cq<nC^{q} < n; since Cq>0C^{q} > 0 we have n1n \ge 1, and since C1C \ge 1 we have Cq1C^{q} \ge 1 and so n>1n > 1. By [L3] with the exponent 1/q>01/q > 0 applied to the bases Cq<nC^{q} < n, and by (Cq)1/q=Cq(1/q)=C1=C(C^{q})^{1/q} = C^{q \cdot (1/q)} = C^{1} = C from [L1] and [L2], we get n1/q>Cn^{1/q} > C; and by [L3] with the base n>1n > 1 and the exponents 1/q<γ1/q < \gamma we get nγ>n1/q>Cn^{\gamma} > n^{1/q} > C. That contradicts step 2.2, so no such CC exists and claim 2 holds.

step 2.2L1L2L3L5
4.1

Claim 4. Let 0<β<α10 < \beta < \alpha \le 1 be rational. Every α\alpha-Hölder function on [0,1][0,1] is β\beta-Hölder by step 1.2, and fβf_{\beta} is β\beta-Hölder by step 3.1 and not α\alpha-Hölder by step 3.2; so the inclusion of classes is proper. With α:=1\alpha := 1 and 0<β<10 < \beta < 1: fβf_{\beta} is β\beta-Hölder, hence uniformly continuous on [0,1][0,1] by [L4], and it is not 11-Hölder, that is not Lipschitz.

step 3.1step 1.2step 3.2L4

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: 115 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