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

Global W2,p estimate for the Laplacian on Euclidean space

Statement

Assume Countable Choice. Let n≥2 and 1<p<∞. Then there is C=C(n,p)<∞ such that every u∈Cc∞(Rn) satisfies ∥D2u∥Lp(Rn)≤C∥Δu∥Lp(Rn),∥∂i∂ju∥Lp(Rn)≤C∥Δu∥Lp(Rn), for all i,j, where ∥D2u∥Lp:=max⁡∣β∣=2∥Dβu∥Lp; by density the bound extends to every u∈W2,p(Rn) (for which Δu∈Lp holds automatically). The constant may be taken as the square of the Riesz-transform bound of The Riesz transforms are bounded on Lp, hence is finite throughout 1<p<∞, including p=2. No sharp endpoint growth rate is claimed.

Facts & Assumptions

Given: ACω, n≥2, 1<p<∞, and a function u that is either in Cc∞(Rn) or, in the density step, in W2,p(Rn).

[A1]

The only choice assumption is Countable Choice ACω; it enters through the choice-qualified Riesz-transform, Fourier and Sobolev interfaces below. No full Axiom of Choice is used. (The Axiom of Countable Choice (ACω))

[F1]

The Riesz transforms are the L2 operators Rj=F2−1MmjF2 with mj(ξ)=−iξj/∣ξ∣ for ξ≠0 and mj(0)=0, and for every 1<p<∞ each Rj extends uniquely to a bounded operator on Lp(Rn;C) with norm at most Cn,p; the bound of The Riesz transforms are bounded on Lp is ≤Cn,p(1+∣Sn−1∣2−1Cn)max⁡(p,(p−1)−1) ; this is an upper bound, not a lower bound on the operator norm. (Riesz transforms on Euclidean space, Exact L2 Fourier multiplier norm)

[F2]

The unitary Plancherel transform F2 is complex-linear, isometric and injective on L2(Rn;C); the negative-sign 2π-normalized distributional transform equals F2 on L2 classes in the sense that Fuf=uF2f, and it satisfies F(∂αu)=(2πiξ)αFu for tempered distributions. (Plancherel theorem, Fourier transform agrees with l one and plancherel transforms, Fourier differentiation and multiplication identities on tempered distributions)

[F3]

Compactly supported smooth functions are dense in W2,p(Rn) for finite p, and the Sobolev norm is the p-sum of the Lp norms of the weak derivatives; for u∈W2,p all weak second derivatives and hence Δu=∑i∂i2u lie in Lp. (Compactly supported smooth functions are dense in W^{k,p}(R^n), Integer-order Sobolev spaces and their norms)

Proof

technique · direct
1.1F1F2givenalgebra

Fourier identification. Let u∈Cc∞(Rn) and put f:=−Δu∈Cc∞(Rn). Since u is smooth, the classical identity ∂i∂ju^=(2πiξi)(2πiξj)u^ and the distributional Fourier calculus of [F2] give, as tempered distributions, F(∂i∂ju)=(2πiξi)(2πiξj)Fu=−4π2ξiξjFu and F(−Δu)=4π2∣ξ∣2Fu; on L2 classes these equal F2(∂i∂ju) and F2f respectively by the agreement statement of [F2]. Since f∈L2 and Rj is the L2 multiplier by mj, the composition satisfies RiRjf=F2−1(mimjF2f) and, on {ξ≠0}, mimj⋅4π2∣ξ∣2=(−iξi/∣ξ∣)(−iξj/∣ξ∣)4π2∣ξ∣2=−4π2ξiξj. Plancherel injectivity [F2] therefore gives the L2 identity ∂i∂ju=RiRjf=RiRj(−Δu).

2.1step 1.1F1algebra

Lp bound for smooth compactly supported data. For u∈Cc∞ the function f=−Δu lies in Cc∞⊂Lp∩L2, so both operators in step 1.1 are defined on Lp and the identity holds a.e.; using twice the Lp bound of [F1], ∥∂i∂ju∥Lp=∥RiRjf∥Lp≤Cn,p2∥f∥Lp=Cn,p2∥Δu∥Lp. Taking the maximum over i,j gives ∥D2u∥Lp≤Cn,p2∥Δu∥Lp for every u∈Cc∞(Rn).

3.1step 2.1F3algebra

Density. Let u∈W2,p(Rn) and let uk∈Cc∞(Rn) satisfy uk→u in W2,p(Rn), which exists by [F3]. Then Δuk→Δu and ∂i∂juk→∂i∂ju in Lp by the definition of the Sobolev norm [F3], and applying step 2.1 to uk and passing to the limit gives ∥D2u∥Lp≤Cn,p2∥Δu∥Lp(Rn) and the same bound for each ∂i∂ju. Since Δu∈Lp holds automatically for W2,p classes by [F3], the inequality applies to every such class.

4.1step 2.1step 3.1F1A1given∎

Conclusion and constants. The two displayed inequalities hold with C=Cn,p2, which is finite for every 1<p<∞ by [F1]. Squaring an upper bound supplies an upper bound only; no sharp growth rate or endpoint estimate is inferred. The proof uses the Riesz-transform Lp theory, whose choice assumption is the Countable Choice of [A1] together with those of the Fourier interfaces; no compactness, no extension operator and no maximal-function argument is used.

Remarks

  • The identity ∂i∂ju=RiRj(−Δu) is the multiplier form of the classical relation ξiξj=(ξiξj/∣ξ∣2)∣ξ∣2; the cancellation at ξ=0 is immaterial because single points are Lebesgue null.
  • The estimate is the Lp counterpart of the Schauder estimate of this page: both control second derivatives by the Laplacian/operator, but the Lp scale accepts merely Lp data and its constant degenerates at p=1 and p=∞.

Depends on

Used by

Dependency tree · two levels

62 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