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.

Interior Hk+2 elliptic regularity

Statement

Assume Countable Choice. Let Ω⊆Rn be open, n≥1, K∈{R,C}, let k≥0, and let L,a be as in Uniformly elliptic divergence-form operators and their sesquilinear forms with aij∈Wlock+1,∞(Ω), bi,c∈Wlock,∞(Ω), all derivatives bounded by constants Mℓ; let f∈Hlock(Ω) and let u∈H1(Ω) be a local weak solution of Lu=f (Local weak solutions of a divergence-form operator). Then u∈Hlock+2(Ω), and for all open sets Ω′⋐Ω′′⋐Ω there is C=C(n,θ,k,M0,…,Mk+1,Ω′,Ω′′) with ∥u∥Hk+2(Ω′)≤C(∥f∥Hk(Ω′′)+∥u∥L2(Ω′′)). The gain is exactly two derivatives; the coefficient regularity required is one order above the data order. For k=0 the theorem reduces to Interior H2 regularity for divergence-form equations. The scaffold wrote ∥f∥Hk(Ω)+∥u∥L2(Ω) on the right-hand side, which is ill-posed for locally Sobolev data on an unbounded Ω; the nested formulation is the well-posed local statement.

Facts & Assumptions

Given: Countable Choice; the open set Ω; the principal coefficient bounds through order k+1 and lower-order coefficient bounds through order k; the datum f∈Hlock(Ω); and the local weak solution u∈H1(Ω).

[F1]

Nested-domain induction: for every chain Ω−1⋑Ω0⋑⋯⋑Ωk+1 with Ω−1‾⋐Ω, Ω0‾⋐Ω−1 and Ωj+1‾⋐Ωj, one has u∈Hj+2(Ωj) for 0≤j≤k with the quantitative bound of that lemma. (Nested-domain induction for interior elliptic derivatives)

[F2]

Sobolev restriction and nesting: regularity on an open set restricts to every open subset, with non-increasing norms, and the compact inclusions of a chain are transitive. (Integer-order Sobolev spaces and their norms, The notation Hk and the reserved zero-boundary symbol)

Proof

technique · direct
1.1F2given

Setup. Fix Ω′⋐Ω′′⋐Ω and choose a chain Ω−1,Ω0,…,Ωk+1 with Ω−1:=Ω′′, Ω′‾⊂Ωk, and all compact inclusions strict. This is possible by inserting finitely many intermediate open sets between Ω′‾ and Ω′′; after choosing Ωk, choose the extra Ωk+1⋐Ωk required by [F1].

2.1F1F2step 1.1

Applying the induction. Lemma [F1] with this chain and j=k gives u∈Hk+2(Ωk) and ∥u∥Hk+2(Ωk)≤Ck(∥f∥Hk(Ω−1)+∥u∥L2(Ω−1)) with Ck=C(n,θ,k,M0,…,Mk+1,Ω−1,…,Ωk). Since Ω′⊂Ωk, restriction [F2] gives u∈Hk+2(Ω′) with the same bound.

3.1F1step 2.1∎

Conclusion. Hence u∈Hk+2(Ω′) for every Ω′⋐Ω, i.e. u∈Hlock+2(Ω), with the displayed estimate. At k=0, the base case of [F1] is the interior H2 estimate; the intermediate open set in the chain only provides room to restrict that bound to Ω′.

Source notes

Hunter's Theorem 4.28 (printed p. 114) states the result with the bound ∥f∥Hk(Ω)+∥u∥L2(Ω) for data in Hk(Ω); the library formulation localises to Hlock data on a nested pair, which is the form actually proved by the chain induction. Teschl's Corollary 10.17 and Laugesen's Theorem 5.8 give the same theorem by the same iteration of the interior estimate.

Depends on

Used by

Dependency tree · two levels

39 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