Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Interior gradient bound for Poisson solutions

Statement

Assume Countable Choice, n≥2 and 0<α<1. Let u∈C2(Br(a))∩L∞(Br(a)) and let f∈C0,α(Br(a)) have finite Hölder seminorm, with −Δu=f pointwise. Then ∥Du∥∞;Br/2(a)≤Cn(r−1∥u∥∞;Br(a)+r∥f∥∞;Br(a)). No Hölder seminorm of f occurs on the right-hand side.

Facts & Assumptions

Given: Countable Choice, an integer n≥2, 0<α<1, a centre a∈Rn, a radius r>0, u∈C2(Br(a))∩L∞(Br(a)) and f∈C0,α(Br(a)) with finite Hölder seminorm and −Δu=f pointwise.

[F1]

The normalized kernel is Φ(z)=∣z∣2−n/((n−2)ωn−1) for n≥3 and Φ(z)=−(2π)−1log⁡∣z∣ for n=2, with ∇Φ(z)=−z/(ωn−1∣z∣n) for n≥3 and ∇Φ(z)=−z/(2π∣z∣2) for n=2 (Fundamental solution for the positive operator minus Laplacian, Continuity and derivatives of positive-base real powers, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)); Φ is locally integrable (Local integrability of the Laplace fundamental kernel).

[F2]

For nonnegative Borel F, polar coordinates give ∫BsF(∣z∣)dz=ωn−1∫0sF(ρ)ρn−1dρ (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, Sphere and ball measures scale in Rn).

[F3]

The Newtonian potential of G is NG(x)=∫RnΦ(x−y)G(y)dy (Newtonian potential of compactly supported data).

[F4]

For compactly supported α-Hölder G, its Newtonian potential is C2 and satisfies −ΔNG=G pointwise (Hölder data give a classical Newtonian solution).

[F5]

Dominated convergence for Lebesgue integrals on Rn (Dominated convergence).

[F6]

For 0<ρ<R there is a smooth η with η=1 on B‾ρ(0) and supp⁡η⊆BR(0) (A smooth bump between concentric Euclidean balls); rescaled and translated, such cutoffs exist between any two concentric Euclidean balls.

[F8]

For harmonic v on an open set containing Bρ(x)‾: ∣Dαv(x)∣≤Cn,α′ρ−∣α∣sup⁡Bρ(x)∣v∣ (Harmonic Cauchy estimates in supremum norm).

[F9]

Countable Choice ACω is the standing hypothesis (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF9

Work under [F9], let x0∈Br/2(a) be arbitrary, and put ρ:=r/4, so that Bρ(x0)‾⊂Br(a); write Mu:=∥u∥∞;Br(a) and Mf:=∥f∥∞;Br(a). Both are finite: Mu<∞ is given, and the finite Hölder seminorm bounds ∣f(x)∣≤∣f(a)∣+[f]0,α;Br(a)(2r)α for every x∈Br(a).

2.1givenF1F2algebra

Kernel integrals. By [F1] and [F2], ∣DΦ(z)∣≤Cn∣z∣1−n and ∫Bs∣DΦ(z)∣dz≤Cns for every s>0. For the fixed scale ρ of step 1.1, a change of variables z=ρζ in the power-kernel case n≥3, and the identity Φ(ρζ)−Φ(ρ)=−(2π)−1log⁡∣ζ∣ when n=2, give ∫B3ρ/2∣Φ(z)−Φ(ρ)∣dz≤Cnρ2. The scaled integral is finite in every dimension by polar coordinates; constants depend only on n.

2.2step 1.1F3F4F6

Cutoff and normalized potential at x0. By [F6] fix a smooth cutoff η with η=1 on B‾3ρ/4(x0) and supp⁡η⊆Bρ(x0), and put G:=ηf on Bρ(x0), extended by 0 to Rn. Then G is continuous, compactly supported and has finite α-Hölder seminorm. Define w(x):=∫Rn(Φ(x−y)−Φ(ρ))G(y)dy=NG(x)−Φ(ρ)∫RnG(y)dy. By [F3] and [F4], w∈C2(Rn) and −Δw=G pointwise; the subtracted term is constant in x.

3.1step 2.2algebra

The remainder h:=u−w is harmonic on B3ρ/4(x0): there η=1, so G=f and −Δh=−Δu+Δw=f−G=0 by the hypothesis and step 2.2.

3.2step 2.1step 2.2F1F2F5F7algebra

Explicit form and bound for Dw. Fix x∈B3ρ/4(x0) and a coordinate k. For y with ∣x−y∣>2∣t∣, the real mean value theorem [F7] and ∣DΦ(z)∣≤Cn∣z∣1−n give ∣Φ(x+tek−y)−Φ(x−y)t∣≤Cn∣x−y∣1−n, since every point on the segment between x−y and x+tek−y has norm at least ∣x−y∣/2. The right side is integrable on the bounded support of G. On this far region the quotients converge pointwise for y≠x to ∂kΦ(x−y), so dominated convergence [F5], with the indicator of ∣x−y∣>2∣t∣, gives convergence of the far-region integrals to ∫∂kΦ(x−y)G(y)dy. On the near region ∣x−y∣≤2∣t∣, the quotient integral is bounded by Mf∣t∣(∫B2∣t∣(tek)∣Φ(z)∣dz+∫B2∣t∣(0)∣Φ(z)∣dz), which tends to zero: it is O(∣t∣) for n≥3 and O(∣t∣(1+∣log⁡∣t∣∣)) for n=2, by polar coordinates [F1, F2]. The integral of ∣DΦ(x−y)G(y)∣ over that near region is O(Mf∣t∣) by step 2.1. Hence ∂kw(x)=∫∂kΦ(x−y)G(y)dy. At x=x0, this yields ∣Dw(x0)∣≤Mf∫Bρ(x0)∣DΦ(x0−y)∣dy≤CnMfρ. For x∈Bρ/2(x0), the normalized kernel and the inclusion Bρ(x0)⊂B3ρ/2(x) give ∣w(x)∣≤Mf∫B3ρ/2∣Φ(z)−Φ(ρ)∣dz≤CnMfρ2 by step 2.1.

4.1step 3.1step 3.2F8algebra

Harmonic gradient bound. Since h is harmonic on B3ρ/4(x0)⊇Bρ/2(x0)‾, apply [F8] separately to each coordinate derivative ∂ih(x0), 0≤i<n. The vector norm satisfies ∣Dh(x0)∣≤nmax⁡i∣∂ih(x0)∣, so, absorbing n into Cn′, ∣Dh(x0)∣≤Cn′(2/ρ)sup⁡Bρ/2(x0)∣h∣≤Cn′(2/ρ)(Mu+CnMfρ2) by steps 3.1 and 3.2.

5.1step 3.2step 4.1algebra

Combining steps 3.2 and 4.1 at the point x0, ∣Du(x0)∣≤∣Dw(x0)∣+∣Dh(x0)∣≤CnMfρ+Cn′(2/ρ)(Mu+CnMfρ2)≤Cn′′(ρ−1Mu+ρMf)=Cn′′(4r−1Mu+14rMf), and absorbing the numerical factors into Cn′′ gives ∣Du(x0)∣≤Cn(r−1Mu+rMf).

6.1step 5.1cases∎

Since x0∈Br/2(a) was arbitrary, taking the supremum over x0 gives ∥Du∥∞;Br/2(a)≤Cn(r−1∥u∥∞;Br(a)+r∥f∥∞;Br(a)), the displayed estimate; the constants encountered in steps 2.1, 3.2 and 4.1 depend only on n, and the Hölder seminorm of f entered only through the qualitative C2 clause of [F4] used to define w and h, never through a quantitative bound. The argument covers complex-valued u and f by applying the real case to real and imaginary parts.

Depends on

Used by

Dependency tree · two levels

92 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