Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Ehrling-type Hölder and derivative interpolation with an epsilon loss

Statement

Let n≥1, 0<α<1, let k≥1 be an integer, R>0, and let BR⊆Ω be a ball in an open set. For every ε>0 there is C=C(n,k,α,ε)<∞ such that every u with ∥u∥k,α;BR∗<∞ satisfies (i)∑j=0k−1Rjmax⁡∣β∣=j sup⁡BR∣Dβu∣≤ε∥u∥k,α;BR∗+Csup⁡BR∣u∣, (ii)max⁡∣β∣=k sup⁡BR∣Dβu∣≤εRαmax⁡∣β∣=k[Dβu]0,α;BR+CR−ksup⁡BR∣u∣. For 0<α<β≤1 and f∈C0,β(BR), one also has (iii)[f]0,α;BR≤εRβ−α[f]0,β;BR+C(n,α,β)ε−α/(β−α)R−αsup⁡BR∣f∣. The constants are independent of u,f,R; the inequalities are scale-invariant.

Facts & Assumptions

Given: n≥1, 0<α<1, an integer k≥1, a radius R>0, a ball BR=BR(x0), a fixed ε>0, and a function u with ∥u∥k,α;BR∗<∞ (respectively f∈C0,β(BR) in the third part).

[F1]

The scaled norm is ∥u∥k,α;BR∗=∑j=0kRjmax⁡∣β∣=jsup⁡BR∣Dβu∣+Rk+αmax⁡∣β∣=k[Dβu]0,α;BR, and [v]0,γ;B=sup⁡B∣v(x)−v(y)∣/∣x−y∣γ. Under v(z)=u(x0+Rz) one has Dβv(z)=R∣β∣Dβu(x0+Rz), the scaling identity ∥v∥k,α;B1∗=∥u∥k,α;BR∗, and for g(z)=f(x0+Rz) the identities [g]0,γ;B1=Rγ[f]0,γ;BR for γ∈{α,β} and sup⁡B1∣g∣=sup⁡BR∣f∣. (Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains, Local Hölder and scaled C-two-alpha norms on balls)

[F2]

All derivatives are canonical-order partial derivatives. The mean value theorem bounds increments along a segment, and iterating Botsko's theorem: if F is continuous on [a,b], F′(x)=f(x) off a countable subset of (a,b), and f is Riemann integrable, then ∫abf=F(b)−F(a) on the smooth restrictions to a segment gives the Taylor formula with integral remainder; Continuous mixed partials of order k are invariant under permutations identifies derivative words of orders at least two. Consequently ∣v(x+h)−∑∣γ∣<mDγv(x)γ!hγ∣≤Cn,m∣h∣mmax⁡∣γ∣=msup⁡[x,x+h]∣Dγv∣. Under a linear change y=x+Vz, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a) expresses each z-derivative of order m as a linear combination of y-derivatives of order m, with coefficients bounded in terms of m,n,∥V∥; if V is invertible with bounded inverse, the same holds in reverse. An α-Hölder bound for the top-order y-derivatives therefore gives the corresponding z-derivative bound, with a factor controlled by ∥V∥α. (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a), Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, Ck maps and multi-index derivative notation in Euclidean space)

[F3]

Young's inequality for real exponents: for conjugate exponents p,q>1 and a,b≥0 one has ab≤εap+Cp,qε−q/pbq; in part (ii) it is applied with p=(k+α)/k and q=(k+α)/α, both greater than one. Part (iii) uses only its direct low/high increment split and does not use Young's inequality. (Young's inequality for conjugate real exponents)

Proof

technique · direct
1.1F1given

Reduction to B1. Put x0 for the centre of BR, v(z):=u(x0+Rz) on B1 and g(z):=f(x0+Rz). By the scaling identities of [F1] the three claims for (u,f,R) are equivalent to the same claims for (v,g,1): the factors Rj, Rk+α, Rα, R−k and Rγ reproduce exactly the displayed powers. It therefore suffices to prove all three statements for R=1 with constants independent of the function; this is assumed from now on.

1.2F1givencasesalgebra

Part (iii). Let 0<α<β≤1, f∈C0,β(B1), M:=sup⁡B1∣f∣ and F:=[f]0,β;B1. If M=0 or F=0 the claim is immediate (for F=0, use that f is constant, so [f]0,α=0; for M=0 the function vanishes), so assume M,F>0. If ε≥2β−α, then for all x≠y in B1, ∣x−y∣≤2 and [f]0,α;B1≤F⋅2β−α≤εF, which is stronger than the claim; hence assume ε<2β−α and put h0:=ε1/(β−α)∈(0,2). For a pair with ∣x−y∣≥h0 use the trivial bound ∣f(x)−f(y)∣≤2M, and for a pair with ∣x−y∣<h0 use the β-Hölder bound: ∣f(x)−f(y)∣∣x−y∣α≤max⁡{2Mh0−α,Fh0β−α}=max⁡{2Mε−α/(β−α), Fε}≤Fε+2Mε−α/(β−α). This is the claim for R=1 with C3=2.

1.3F2givenalgebra

Interior-point difference estimates, including points near the boundary. Write Mj:=max⁡∣γ∣=jsup⁡B1∣Dγu∣, M0=sup⁡B1∣u∣, and H:=max⁡∣γ∣=k[Dγu]0,α;B1, and set ρ∗:=1/(8nk). For each x∈B1 choose an invertible frame Vx as follows. If ∣x∣≤1/2, take Vx=I. If ∣x∣>1/2, put ν=x/∣x∣, choose an orthonormal basis e1,…,en−1 of the tangent space ν⊥, and take the columns of Vx to be ei−ν for 1≤i<n and −ν for the last column (when n=1 there is just the column −ν). These frames and their inverses have norms bounded by constants depending only on n. Define u~x(z):=u(x+Vxz) wherever x+Vxz∈B1. For any vector ℓ∈[0,∞)n with m:=∑iℓi≤nk and any 0≤t≤1, the whole segment x+tρVxℓ lies in B1 whenever 0<ρ≤ρ∗. In the inner case, ∣x+tρVxℓ∣≤1/2+ρm≤5/8. In the outer case write Vxℓ=−mν+∑i<nℓiei; its tangential component has norm at most m, so ∣x+tρVxℓ∣2≤r2−2tρmr+2t2ρ2m2≤r2<1, since r=∣x∣≥1/2 and tρm≤1/8≤r/2. Thus every sample point and Taylor segment below is contained in B1. For 0≤d≤k−1, choose the unique weights a0(d),…,ak−1(d) solving the Vandermonde system ∑ℓ=0k−1aℓ(d)ℓq=d! 1q=d for q=0,…,k−1. For a multi-index δ of order j<k, define the tensor stencil Qρδu~x(0):=ρ−j∑ℓ∈{0,…,k−1}n(∏i=1naℓi(δi))u~x(ρℓ). Taylor-expand u~x at 0 through degree k−1. The moment identities make this stencil equal to Dzδu~x(0) on every polynomial of total degree less than k. The integral remainder at each stencil point is bounded by Cn,kρkMk using [F2] and the uniform frame bound. The weights and stencil are fixed by n,k, hence ∣Qρδu~x(0)−Dzδu~x(0)∣≤Cn,kρk−jMk,∣Qρδu~x(0)∣≤Cn,kρ−jM0. For a multi-index δ of order k, instead use the ordinary iterated forward difference in the z-coordinates, Δρδu~x(0):=∑0≤γ≤δ(−1)k−∣γ∣(δγ)u~x(ργ). Repeated use of the fundamental theorem of calculus gives ρ−kΔρδu~x(0) as the average of Dzδu~x at points ρ∑q=1ktqeiq, where the list i1,…,ik contains δi copies of i and 0≤tq≤1. These segments lie in B1 by the preceding geometry; the chain rule and the α-Hölder seminorm of the order-k derivatives therefore give ∣ρ−kΔρδu~x(0)−Dzδu~x(0)∣≤Cn,kραH,∣Δρδu~x(0)∣≤2kM0. Finally, ∂xa=∑i(Vx−1)ia∂zi, so each canonical derivative of order j is a uniformly bounded linear combination of frame derivatives of that order. We have proved, for every x∈B1, 0<ρ≤ρ∗, and canonical multi-index β, ∣Dβu(x)∣≤Cn,k(ρ−jM0+ρk−jMk)(j=∣β∣<k),∣Dβu(x)∣≤Cn,k(ρ−kM0+ραH)(j=k). Taking suprema gives these same bounds for the full-ball quantities Mj; the estimates are valid up to points arbitrarily close to ∂B1.

2.1step 1.3F1F3casesalgebra

Part (ii). By step 1.3, for every x∈B1, 0<ρ≤ρ∗, and ∣β∣=k, ∣Dβu(x)∣≤Cn,k(M0ρ−k+ραH). If M0=0, then u=0. If H=0 and M0>0, use ρ=ρ∗ and take the supremum to obtain Mk≤C(n,k)M0. Otherwise assume M0,H>0 and put s=(M0/H)1/(k+α). If s≥ρ∗, then H≤ρ∗−(k+α)M0, and the estimate with ρ=ρ∗ gives Mk≤C(n,k,α)M0. If s<ρ∗, take ρ=s to get Mk≤Cn,k,αM0α/(k+α)Hk/(k+α). Young's inequality [F3], with p=(k+α)/k and q=(k+α)/α, then gives Mk≤εH+C(n,k,α,ε)M0. This proves (ii) for R=1.

3.1step 1.3step 2.1F1algebra

Part (i). By part (ii), for every δ>0 there is Cδ such that Mk≤δH+CδM0. Choose δ:=ε/(2kCn,k), increasing Cn,k in step 1.3 if necessary so it is at least 1. Fix any ρ∈(0,ρ∗]. For 0≤j<k, the lower-order estimate of step 1.3 gives Mj≤Cn,kρ−jM0+Cn,kρk−jMk≤C(n,k,α,ε)M0+ε2kH, since ρ∗<1. Summing over the k orders yields ∑j=0k−1Mj≤C(n,k,α,ε)M0+ε2H≤CM0+ε∥u∥k,α;B1∗, which is (i) for R=1.

4.1step 1.1step 1.2step 2.1step 3.1F1given∎

Scaling back and conclusion. Undoing the change of variables of step 1.1 with the scaling identities of [F1] transforms (i), (ii) and (iii) for R=1 into the three displayed statements for general R, with the same constants: RjMj(u)=Mj(v), Rk+αH(u)=H(v), Rγ[f]0,γ;BR=[g]0,γ;B1 and sup⁡BR∣f∣=sup⁡B1∣g∣. The constants depend only on n,k,α,ε (and on n,α,β,ε in (iii)), never on u,f,R or the centre, and no choice principle is used.

Remarks

  • Parts (i) and (ii) are the derivative form of the Ehrling inequality: in part (ii), the smallness parameter ε is bought at the price of a constant blowing up like ε−k/α under the displayed Young exponents, which is the price paid in the freezing and Schauder estimates below.
  • The proof of parts (i) and (ii) uses the top-order Hölder seminorm only through the difference-quotient approximation; no compactness of the embedding Ck↪Ck−1 or Arzelà–Ascoli argument is used, so the estimate is fully quantitative.

Depends on

Used by

Dependency tree · two levels

44 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