Alphabeta Math
TheoremStatement: 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.

Weak global W2,p regularity for the Dirichlet Laplacian

Statement

Assume the Axiom of Choice and Countable Choice. Let n≥2, n<p<∞, and let Ω⊂Rn be a bounded C2,α domain for some 0<α<1. If u∈H01(Ω) is a weak solution of −Δu=f with f∈Lp(Ω), then u∈W2,p(Ω)∩W01,p(Ω) and ∥u∥W2,p(Ω)≤C(∥f∥Lp(Ω)+∥u∥Lp(Ω)), where C=C(n,p,Ω). This is a weak-to-strong regularity theorem; the estimate applies to the weak solution only after its W2,p membership has been established, and the assumption p>n is the range in which the bootstrap of Sobolev exponents terminates at p.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice, n≥2, n<p<∞, the bounded C2,α domain Ω, f∈Lp(Ω) and a weak solution u∈H01(Ω) of −Δu=f.

[A1]

Countable Choice is used for the measure-theoretic and Sobolev interfaces; the Axiom of Choice is inherited by the extension, embedding and a priori estimate interfaces and assumed for the quoted solvability input. (The Axiom of Countable Choice (ACω))

[F1]

Weak formulation (Weak Dirichlet solutions for a divergence-form operator, The Laplacian of a C2 function and of a C2 vector field): for the Laplacian the Dirichlet form is a(v,φ)=∫Ω∇v⋅∇φ, and u∈H01(Ω) is a weak solution of −Δu=f, f∈L2(Ω), precisely when ∫Ω∇u⋅∇φ=∫Ωfφ for every φ∈H01(Ω). Equivalently, for every λ∈R, ∫Ω∇u⋅∇φ+λ∫Ωuφ=∫Ω(f+λu)φ(φ∈H01(Ω)). (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)

[F2]

Shifted strong solvability (quoted, Haller-Dintelmann Theorem 19.7): let Ω⊂Rd be open and bounded with C2 boundary and let L have symmetric elliptic principal matrix a∈C(Ωˉ), b,c∈L∞. For each fixed 1<q<∞ there exists λ0(q)≥0 such that for every λ≥λ0(q) (indeed Re⁡λ≥λ0) and every h∈Lq(Ω) the problem λz−Lz=h in Ω, z=0 on ∂Ω, has a unique solution z∈W2,q(Ω)∩W01,q(Ω) with ∥z∥W2,q(Ω)≤C(λ,n,q,a,b,c,Ω)∥h∥Lq(Ω). For L=Δ (a the identity matrix, b=c=0) this is the solvability of (λ−Δ)z=h in W2,q∩W01,q; the constant may depend on q, and only finitely many exponents q are used below.

[F3]

Higher-order Sobolev embedding (Higher-order Sobolev embedding): on a bounded extension domain, with k≥1 and 1≤q<∞, (a) if kq<n then Wk,q↪Lr for every 1≤r≤nq/(n−kq); (b) if kq=n then Wk,q↪Lr for every finite r; (c) if kq>n then Wk,q embeds into L∞ and into C0,β(Ωˉ) for 0<β<min⁡{1,k−n/q}.

[F4]

Ω is a bounded Ck domain for k=2 (Bounded C^k domains and boundary charts), hence a Wk,q-extension domain for every k≤2 and every 1≤q≤∞ by Bounded C^k domains admit integer-order Sobolev extension; in particular [F3] applies with k=1,2 and all exponents used below. (Sobolev extension domains and extension operators)

[F5]

A priori estimate (Global W2,p Dirichlet estimate on a C1,1 domain): for the bounded C1,1 domain Ω (a C2,α domain is C1,1) there is C0=C0(n,p,Ω) with ∥v∥W2,p(Ω)≤C0(∥Δv∥Lp(Ω)+∥v∥Lp(Ω)) for every v∈W2,p(Ω)∩W01,p(Ω).

[F6]

Energy uniqueness (Weak Dirichlet solutions for a divergence-form operator): if w∈H01(Ω) satisfies ∫Ω∇w⋅∇φ+λ∫Ωwφ=0 for every φ∈H01(Ω) and λ>0, then w=0: testing with φ=w‾ (or w for real scalars) gives ∫∣∇w∣2+λ∫∣w∣2=0.

[F7]

Under Countable Choice, the map from Lloc1(Ω) classes to distributions given by g↦(φ↦∫Ωgφ) is injective; equal regular distributions therefore come from functions equal almost everywhere (Locally integrable functions embed in distributions).

Proof

technique · direct
1.1F3F4algebraA1

Initial integrability and the exponent list. Since u∈H01(Ω)=W01,2(Ω) and Ω is a bounded extension domain for W1,2 by [F4], the embedding [F3] with k=1, q=2 gives u∈Lr(Ω) for every 2≤r≤2nn−2 if n>2, and for every finite r if n=2. Put q0:=min⁡{p,2nn−2} (n>2),q0:=p (n=2), so that 2≤q0≤p and u∈Lq0(Ω). If q0=p, take the exponent list to be the singleton Q={p} and set m=0. Otherwise define a strictly increasing finite list q0<q1<⋯<qm=p by qi+1:=min⁡{p,nqin−2qi} when 2qi<n and qi+1:=p when 2qi≥n. The list is finite and depends only on n,p: while qi<p and 2qi<n one has 1qi+1=1qi−2n (unless the minimum is p, which ends the list), so the reciprocals decrease by the fixed positive amount 2n and the process reaches either p or the region 2qi≥n after at most ⌈n2(1q0−1p)⌉ steps, after which it reaches p in one more step.

2.1F1F2F6step 1.1algebra

Choice of the shift and the first solve. Let Q:={qi:0≤i≤m} be the finite set of exponents in the list, so p∈Q and this definition also covers the case q0=p (then m=0 and Q={p}). For each q∈Q, apply [F2] to L=Δ and let λ0(q) be its threshold; choose λ>max⁡({0}∪{λ0(q):q∈Q}). Since f∈Lp(Ω)⊆Lq0(Ω) and u∈Lq0(Ω) by step 1.1, the datum h0:=f+λu lies in Lq0(Ω); by [F2] there is z0∈W2,q0(Ω)∩W01,q0(Ω) with (λ−Δ)z0=h0 strongly, hence weakly by [F1] (test against compactly supported smooth functions and use density). The weak solution u satisfies the same shifted weak equation with datum h0, as recorded in [F1]. Since q0≥2, the space W01,q0(Ω) is contained in H01(Ω) (bounded Ω gives W1,q0(Ω)⊆W1,2(Ω) and the closures transfer), so z0−u∈H01(Ω) and [F6] gives z0=u. Hence u∈W2,q0(Ω)∩W01,q0(Ω).

3.1F1F2F3F6step 2.1induction

The bootstrap induction. Suppose u∈W2,qi(Ω)∩W01,qi(Ω) with qi<p. If 2qi<n, then F3 with k=2, q=qi gives u∈Lr for every r≤nqin−2qi, in particular u∈Lqi+1; if 2qi=n, then F3 gives u∈Lr for every finite r, so u∈Lp=Lqi+1; if 2qi>n, then F3 gives u∈L∞⊆Lp=Lqi+1. In all three cases hi:=f+λu∈Lqi+1 because f∈Lp and qi+1≤p; by [F2] applied at the exponent qi+1 there is zi+1∈W2,qi+1(Ω)∩W01,qi+1(Ω) solving (λ−Δ)zi+1=hi; by [F1] and [F6], applied exactly as in step 2.1 (with qi+1≥qi≥2 so that zi+1−u∈H01), we get zi+1=u and hence u∈W2,qi+1. Induction over the finite list gives u∈W2,p(Ω)∩W01,p(Ω).

4.1step 3.1F1F5F7algebra

The estimate and almost-everywhere equation. Now that u∈W2,p(Ω)∩W01,p(Ω), [F5] applies with v=u: ∥u∥W2,p≤C0(∥Δu∥Lp+∥u∥Lp). For every φ∈Cc∞(Ω), the weak equation [F1] and the definition of the weak Laplacian give ∫Ω(−Δu)φ=∫Ω∇u⋅∇φ=∫Ωfφ. Both −Δu and f lie in Lp(Ω)⊆Lloc1(Ω), so their regular distributions agree; injectivity [F7] gives −Δu=f almost everywhere. Hence ∥Δu∥Lp=∥f∥Lp and the displayed bound holds with C=C0.

5.1step 3.1step 4.1F2F5given∎

Conclusion. The weak solution u∈H01(Ω) of −Δu=f with f∈Lp(Ω), p>n, is shown to lie in W2,p(Ω)∩W01,p(Ω), and the a priori estimate of [F5] then gives ∥u∥W2,p≤C(∥f∥Lp+∥u∥Lp) with C depending only on n,p,Ω. The shifted-equation argument uses the finite sequence of Sobolev exponents and the unique solvability [F2] at each of them; it never assumes W2,p regularity of u in advance.

Remarks

  • The proof shows precisely how the range p>n is used: the weak solution starts in H01, the shifted strong solvability lifts one Sobolev order at a time, and the higher-order embedding converts a W2,q bound into a higher Lr bound; reciprocals decrease by 2/n per step, so the process reaches any prescribed finite exponent after finitely many steps.
  • The bridge from the literature's strong solvability theorem to the given weak solution is the shifted equation and energy uniqueness [F6], not an assumption of W2,p regularity. No maximum principle, no symmety of the domain and no spectral theory beyond the threshold λ0 of [F2] is used.
  • The domain is assumed C2,α for some α∈(0,1), which is stronger than the C1,1 of the a priori estimate [F5] and is used only through the C2 extension and boundary requirements of [F2] and [F3].

Depends on

Used by

Dependency tree · two levels

75 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