Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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] the function xβ is β-Hölder and is α-Hölder for no rational α>β, so the Hölder classes are strictly nested

Example

Let β∈Q with 0<β≤1 (Order on the rationals) and let

fβ:[0,1]→R,fβ(x):=xβ

be the rational power of a nonnegative base (Rational powers ar of a positive base, with the convention 0β=0), on the closed bounded interval [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length). Hölder conditions for a real function on [0,1] are the metric ones instantiated, by Dictionary: for A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of R exactly when it is a compact metric subspace, clause 4: g is γ-Hölder with constant C when ∣g(x)−g(y)∣≤C ∣x−y∣γ for all x,y∈[0,1] (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction). Then:

  1. fβ is β-Hölder with constant 1: ∣xβ−yβ∣  ≤  ∣x−y∣βfor all x,y∈[0,1].
  2. fβ is α-Hölder for no rational α with β<α≤1: for such an α there is no real C≥0 with ∣xβ−yβ∣≤C∣x−y∣α throughout [0,1].
  3. The classes are nested: if 0<β<α≤1 are rational and g:[0,1]→R is α-Hölder with constant C, then g is β-Hölder with the same constant C.
  4. Hence the nesting is strict, at every pair of rational exponents 0<β<α≤1: the α-Hölder functions on [0,1] form a proper subclass of the β-Hölder ones, fβ lying in the second and not the first. Taking α=1: for rational 0<β<1 the function fβ is uniformly continuous on [0,1] (Uniform continuity of f:A→R: one δ serving every pair of points of A) 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 ⇒ uniformly continuous ⇒ continuous and α-Hölder ⇒ 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 A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of R exactly when it is a compact metric subspace. The other is x↦1/x is continuous on (0,1) and not uniformly continuous there, the pairs 1/(k+2) and 1/(k+3) defeating every δ, which separates continuity from uniform continuity.

Why the exponents are rational. Rational powers ar 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 1 are excluded there for a reason of substance: they force constancy (If ∣f(x)−f(y)∣≤C∣x−y∣α on an interval for some rational α>1 then f is constant).

Facts & Assumptions

Given: A rational β with 0<β≤1, the interval [0,1], and fβ(x)=xβ. Naturals are identified with their canonical images in R.

[L1]

Rational powers: ar is defined for a>0 and r∈Q, with a1=a and aq/1=aq agreeing with the integer power; 0r=0 for rational r>0; and 1r=1 (Rational powers ar of a positive base, Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a, Integer powers am, Monotonicity of r↦ar and of a↦ar).

[L2]

Laws of rational exponents for a,b>0 and r,s∈Q: ar>0; ar+s=aras; (ab)r=arbr; a−r=1/ar; (ar)s=ars. The product law persists for a,b≥0 when r>0 (Laws of rational exponents).

[L3]

Monotonicity: for 0<a<1 and rationals r<s one has ar>as; for a>1 and r<s one has ar<as; for a=1 all powers are 1; and for rational r>0 and 0<a<b one has ar<br (Monotonicity of r↦ar and of a↦ar).

[L5]

Archimedean property: for every real η>0 there is a natural q≥1 with 1/q<η, and for every real t a natural n with t<n; and 0<s<t implies 0<1/t<1/s (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

[L6]

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

Verification

technique · direct
1.1

For 0≤t≤1 one has tβ≥t. If t=0 then tβ=0=t by [L1]; if t=1 then tβ=1=t by [L1]. If 0<t<1 then, when β<1, [L3] with r:=β<s:=1 gives tβ>t1=t, and when β=1 it is an equality.

L1L3L6
1.2

Claim 3. Let 0<β<α≤1 be rational and let g satisfy ∣g(x)−g(y)∣≤C∣x−y∣α on [0,1]. For x,y∈[0,1] put a:=∣x−y∣, so 0≤a≤1 by [L6]. If a=0 then aα=aβ=0 by [L1]; if a=1 then both are 1 by [L1]; and if 0<a<1 then [L3] with r:=β<s:=α gives aα<aβ. In every case aα≤aβ, so ∣g(x)−g(y)∣≤Caα≤Caβ and g is β-Hölder with the same constant.

L1L3L4L6
1.3

Claim 2, the setup. Let α∈Q with β<α≤1 and suppose, for contradiction, that some real C≥0 satisfies ∣xβ−yβ∣≤C∣x−y∣α for all x,y∈[0,1]. Taking x:=1 and y:=0 gives 1=∣1−0∣≤C⋅1=C by [L1], so C≥1>0. Taking y:=0 and an arbitrary x with 0<x≤1 gives xβ≤Cxα.

L1L6
2.1

Subadditivity: (u+v)β≤uβ+vβ for all reals u,v≥0. If u+v=0 then u=v=0 and both sides are 0 by [L1]. Otherwise put s:=u+v>0, p:=u/s and q:=v/s, so p,q≥0 and p+q=1, whence 0≤p≤1 and 0≤q≤1. By step 1.1, pβ≥p and qβ≥q, so pβ+qβ≥p+q=1. By the product law of [L2], valid for nonnegative bases since β>0, uβ=(ps)β=pβsβ and vβ=qβsβ; hence uβ+vβ=(pβ+qβ)sβ≥sβ=(u+v)β, using sβ>0 from [L2].

step 1.1L1L2L6
2.2

Claim 2, the estimate. Put γ:=α−β, a rational with γ>0. For 0<x≤1, dividing the inequality of step 1.3 by xα>0 and using [L2] gives xβ−α=xβx−α≤C, that is 1/xγ≤C and hence xγ≥1/C>0 by [L5]. Applying this at x:=1/n for a natural n≥1, and using (1/n)γ=1/nγ from [L2], gives nγ≤C for every natural n≥1.

step 1.3L2L5
3.1

Claim 1. Let x,y∈[0,1]; by [L6] name them so that y≤x. Put u:=y≥0 and v:=x−y≥0, so x=u+v. By step 2.1, xβ≤yβ+(x−y)β, that is xβ−yβ≤(x−y)β=∣x−y∣β. Also yβ≤xβ: for y=0 this reads 0≤xβ by [L1] and [L2], and for 0<y≤x it is [L3] with the exponent β>0, together with equality when y=x. Hence ∣xβ−yβ∣=xβ−yβ≤∣x−y∣β, so fβ is β-Hölder with constant 1.

step 2.1L1L2L3L4L6
3.2

Claim 2, the contradiction. By [L5] fix a natural q≥1 with 1/q<γ, and then a natural n with Cq<n; since Cq>0 we have n≥1, and since C≥1 we have Cq≥1 and so n>1. By [L3] with the exponent 1/q>0 applied to the bases Cq<n, and by (Cq)1/q=Cq⋅(1/q)=C1=C from [L1] and [L2], we get n1/q>C; and by [L3] with the base n>1 and the exponents 1/q<γ we get nγ>n1/q>C. That contradicts step 2.2, so no such C exists and claim 2 holds.

step 2.2L1L2L3L5
4.1

Claim 4. Let 0<β<α≤1 be rational. Every α-Hölder function on [0,1] is β-Hölder by step 1.2, and fβ is β-Hölder by step 3.1 and not α-Hölder by step 3.2; so the inclusion of classes is proper. With α:=1 and 0<β<1: fβ is β-Hölder, hence uniformly continuous on [0,1] by [L4], and it is not 1-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 · two levels

70 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources