Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Geometric oscillation decay implies a Hölder modulus

Statement

Let n≥1, let Ω⊆Rn be open, let u:Ω→R and let θ∈(0,1) satisfy osc⁡Br(x)u≤θ osc⁡B2r(x)uwhenever B2r(x)⋐Ω, where osc⁡Bu:=sup⁡Bu−inf⁡Bu, and assume osc⁡BR(x0)u<∞ for every BR(x0)⋐Ω. Put α0:=log⁡(1/θ)log⁡2>0 and α:=min⁡{α0,1/2}∈(0,1). Then for every ball BR(x0)⋐Ω and all x,y∈BR/2(x0), ∣u(x)−u(y)∣≤4α(∣x−y∣R)αosc⁡BR(x0)u, so u is locally α-Hölder in Ω (Local Hölder and scaled C-two-alpha norms on balls) with [u]0,α;BR/2(x0)≤4αR−αosc⁡BR(x0)u; moreover for every 0<α′<α the same estimate holds with α′ and constant 4α′.

Facts & Assumptions

Given: an integer n≥1, an open set Ω⊆Rn, a function u:Ω→R with finite oscillation on every compactly contained ball, a number θ∈(0,1) with osc⁡Br(x)u≤θosc⁡B2r(x)u whenever B2r(x)⋐Ω, and α0=log⁡(1/θ)/log⁡2, α=min⁡{α0,1/2}.

[F1]

For every x and r>0, osc⁡Br(x)u=sup⁡Br(x)u−inf⁡Br(x)u∈[0,+∞], and if A⊆B⊆Ω then osc⁡Au≤osc⁡Bu, because a supremum over a smaller set is no larger and an infimum over a smaller set is no smaller.

[F2]

Since 2α0=1/θ and θ=2−α0 by the definition of the real power, for 0<a≤1 the map β↦aβ is nonincreasing, and for a,b>0 and real β one has (ab)β=aβbβ (Real powers for positive bases, with the zero-base positive-exponent convention).

[F3]

For a ball BR(x0), the seminorm [u]0,α;BR(x0) is the supremum of ∣u(x)−u(y)∣/∣x−y∣α over all x,y∈BR(x0) with x≠y (Local Hölder and scaled C-two-alpha norms on balls).

Proof

technique · direct dyadic iteration of the oscillation hypothesis
1.1givenF1

Fix a ball BR(x0)⋐Ω. The claim is immediate when x=y, so assume x≠y and put d:=∣x−y∣>0 and z:=(x+y)/2. Since x,y∈BR/2(x0), the midpoint satisfies z∈BR/2(x0) and d<R. The oscillation of u on BR(x0) is finite by hypothesis. If d≥R/2, then ∣u(x)−u(y)∣≤osc⁡BR(x0)u≤4α(d/R)αosc⁡BR(x0)u, so assume henceforth d<R/2.

1.2givenF1algebra

Let k≥0 be the largest integer with 2k+1d≤R; it exists because d<R/2, and the set of admissible exponents is bounded above. For every 0≤j≤k one has B2jd(z)⋐BR(x0): the midpoint z is within R/2 of x0, while 2jd≤R/2. Consequently the given oscillation hypothesis applies to the pair of radii 2j−1d and 2jd for every 1≤j≤k.

2.1step 1.2F1

Iterating the hypothesis, osc⁡Bd(z)u≤θkosc⁡B2kd(z)u. Indeed the case k=0 is an equality, and if the claim holds for k−1 then it holds for k by appending the one step osc⁡B2k−1d(z)u≤θosc⁡B2kd(z)u supplied by step 1.2. Since B2kd(z)⊆BR(x0), monotonicity of the oscillation gives osc⁡Bd(z)u≤θkosc⁡BR(x0)u.

2.2step 1.2F2algebra

By maximality of k, 2k+2d>R, so 2−k<4d/R. Since 2−k≤1 and α≤α0, [F2] gives θk=(2−k)α0≤(2−k)α<(4d/R)α=4α(d/R)α.

3.1step 2.1step 2.2F1F3

Since x,y∈Bd(z), combining steps 2.1 and 2.2 gives ∣u(x)−u(y)∣≤osc⁡Bd(z)u≤4α(d/R)αosc⁡BR(x0)u, which is the displayed inequality because d=∣x−y∣. Dividing by ∣x−y∣α and taking the supremum over x≠y in BR/2(x0) yields [u]0,α;BR/2(x0)≤4αR−αosc⁡BR(x0)u by [F3]; since every point of Ω has a ball BR(x0)⋐Ω about it and R/2 is available, u is locally α-Hölder on Ω.

4.1step 2.1step 2.2F2given∎

For the exponent clause, fix 0<α′<α. If d<R/4, then 4d/R<1, and α′<α≤α0 gives θk=(2−k)α0≤(2−k)α′<(4d/R)α′. If d≥R/4, then ∣u(x)−u(y)∣≤osc⁡BR(x0)u≤4α′(d/R)α′osc⁡BR(x0)u. Combining these cases proves the claimed α′ estimate with constant 4α′; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

10 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