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.

Freezing coefficients makes the Schauder error absorbable on a small ball

Statement

Let n≥2, 0<α<1, R>0 and x0∈Rn. Let L=aij∂i∂j+bi∂i+c be uniformly elliptic on BR(x0) with constants 0<λ≤Λ<∞, [A]0,α;BR(x0)≤K, and b,c∈C0,α(BR(x0)). Put L0:=aij(x0)∂i∂j and MR:=RαK+R∥b∥∞+R1+α[b]0,α+R2∥c∥∞+R2+α[c]0,α. Assume MR<∞. For every ε>0 there are ηε∈(0,1] and Cε<∞, depending only on n,α,λ,Λ,MR,ε, such that for every radius 0<ρ≤Rηε and every u with ∥u∥2,α;Bρ(x0)∗<∞, ρ2∥(L−L0)u∥0,α;Bρ(x0)∗≤ε∥u∥2,α;Bρ(x0)∗+Cεsup⁡Bρ(x0)∣u∣, where the cutoff Rηε is at most R and the constant is uniform over all smaller radii, and ∥g∥0,α;Bρ∗:=sup⁡Bρ∣g∣+ρα[g]0,α;Bρ.

Facts & Assumptions

Given: n≥2, 0<α<1, R>0, x0, an operator L with the coefficient bounds of the Statement, a fixed ε>0, and any 0<ρ≤Rηε with ∥u∥2,α;Bρ(x0)∗<∞.

[F1]

L0 is the constant-coefficient operator with matrix A(x0), so (L−L0)u=(aij−aij(x0))∂i∂ju+bi∂iu+cu; the coefficient bounds are recorded by MR in the Statement, and x0 is the base point for every frozen coefficient. (Uniformly elliptic nondivergence-form operators and their frozen coefficients, Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains)

[F2]

In the normalized variables of step 1.1, put K:=RαK and let B,C be the scaled C0,α bounds of b~,c~; then K+B+C≤MR. On Bt, ∣a~ij(z)−a~ij(0)∣≤Ktα and [a~ij−a~ij(0)]0,α;Bt≤K. Also [Diu~]0,α;Bt≤(2t)1−αsup⁡Bt∣D2u~∣ and [u~]0,α;Bt≤(2t)1−αsup⁡Bt∣Du~∣. (Local Hölder and scaled C-two-alpha norms on balls, Hölder spaces Ck,α, closure and interior scaled norms, and Ck,α domains)

[F3]

Interpolation with ε-loss: for every ε′>0 there is Cε′ with (i) ρsup⁡Bρ∣Du∣≤ε′∥u∥2,α;Bρ∗+Cε′sup⁡∣u∣, (ii) sup⁡∣D2u∣≤ε′ρα[D2u]0,α;Bρ+Cε′ρ−2sup⁡∣u∣, and ρ2+α[D2u]0,α;Bρ≤∥u∥2,α;Bρ∗. (Ehrling-type Hölder and derivative interpolation with an epsilon loss)

[F4]

The product rule for the Hölder seminorm: [fg]0,α≤[f]0,αsup⁡∣g∣+sup⁡∣f∣[g]0,α, and the elementary inequality ab≤εap+Cpε−1/(p−1)bp/(p−1) for a,b≥0 and p>1. (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, Young's inequality for conjugate real exponents)

Proof

technique · direct
1.1F1F2F3given

Normalize the scale and record the coefficient oscillation. Put z=(x−x0)/R and u~(z)=u(x0+Rz). In these variables the operator has coefficients a~(z)=a(x0+Rz), b~(z)=Rb(x0+Rz) and c~(z)=R2c(x0+Rz) on B1, and their dimensionless Hölder bounds are controlled by MR in the Statement. Write t:=ρ/R≤1. Since x0 is the centre of the original ball, [F1] gives sup⁡Bt∣a~ij−a~ij(0)∣≤(RαK)tα and [a~ij−a~ij(0)]0,α;Bt≤RαK. Fix ε′>0 to be chosen below and let Cε′ be the constant of [F3]; all estimates below are in the normalized variables on Bt and the scaled norm is ∥u~∥∗:=∥u~∥2,α;Bt∗.

2.1step 1.1F2F3F4algebra

The second-order part. By [F4] and step 1.1, [(a~ij−a~ij(0))∂i∂ju~]0,α≤Ksup⁡∣D2u~∣+Ktα[D2u~]0,α and sup⁡∣(a~ij−a~ij(0))∂i∂ju~∣≤Ktαsup⁡∣D2u~∣. Hence F3 and its last bound give t2(sup⁡∣(a~ij−a~ij(0))∂i∂ju~∣+tα[(a~ij−a~ij(0))∂i∂ju~]0,α)≤[ε′(K+Ktα)+CKtα]∥u~∥∗+Cε′Ktαsup⁡∣u~∣. The CKtα∥u~∥∗ contribution is the product-seminorm term sup⁡∣a~ij−a~ij(0)∣[DiDju~]0,α after scaling; it has no interpolation factor ε′.

2.2step 1.1F2F3F4algebra

The lower-order part. Write M~:=∥b~∥C0,α+∥c~∥C0,α≤MR. By [F4] and [F2], the supremum of b~i∂iu~+c~u~ is bounded by M~(sup⁡∣Du~∣+sup⁡∣u~∣), and its Hölder seminorm is bounded by M~(sup⁡∣Du~∣+(2t)1−αsup⁡∣D2u~∣+sup⁡∣u~∣+(2t)1−αsup⁡∣Du~∣). Multiplying by t2 and t2+α, respectively, and inserting F3,(ii) shows that this contribution is at most ε′C1low(t)∥u~∥∗+Cn,α,ε′(1+M~)sup⁡∣u~∣, where C1low(t) is bounded for 0<t≤1 and has a finite limit as t↓0.

3.1step 1.1step 2.1step 2.2F3givenalgebra∎

Uniform choice of the normalized radius and conclusion. In normalized variables, collect the top-norm coefficients from steps 2.1 and 2.2 as Cerr(t):=ε′Cinterp(t)+CoscKtα, where Cinterp(t) is bounded on 0<t≤1 and has a finite limit at 0, and Cosc depends only on n,α,λ,Λ. The second term explicitly includes the product-seminorm term of step 2.1, which has no ε′ factor and tends to zero as t↓0. Given ε>0, choose first ε′>0 so that ε′Cinterp(0)≤ε/4 (if Cinterp(0)=0, any positive ε′ suffices); then choose ηε∈(0,1] so small that ε′Cinterp(t)≤ε/2 and CoscKtα≤ε/2 for every 0<t≤ηε. Thus Cerr(t)≤ε uniformly over every such radius. The lower-order remainder coefficients are also uniformly bounded there by Cε depending only on the displayed dimensionless parameters; the cap t≤1 is the small-scale condition used for those terms. Scaling back gives the same estimate for every physical radius 0<ρ≤Rηε.

Remarks

  • The quantitative structure is the classical one: after normalization, the oscillation of the principal coefficients on a radius-t ball is at most (RαK)tα; the frozen error carries the two extra derivatives scaled as t2, and interpolation converts the resulting powers into an arbitrarily small multiple of the full scaled norm plus a bounded multiple of sup⁡∣u∣.
  • The estimate is uniform over every smaller radius below Rηε. The cutoff fraction ηε≤1 is chosen from the dimensionless coefficient bounds, including the small-scale cap needed for the lower-order terms.

Depends on

Used by

Dependency tree · two levels

32 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