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 elliptic regularity
Statement
Assume Countable Choice. Let be open, , , let , and let be as in Uniformly elliptic divergence-form operators and their sesquilinear forms with , , all derivatives bounded by constants ; let and let be a local weak solution of (Local weak solutions of a divergence-form operator). Then , and for all open sets there is with The gain is exactly two derivatives; the coefficient regularity required is one order above the data order. For the theorem reduces to Interior regularity for divergence-form equations. The scaffold wrote 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 and lower-order coefficient bounds through order ; the datum ; and the local weak solution .
Nested-domain induction: for every chain with , and , one has for with the quantitative bound of that lemma. (Nested-domain induction for interior elliptic derivatives)
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 and the reserved zero-boundary symbol)
Proof
Setup. Fix and choose a chain with , , and all compact inclusions strict. This is possible by inserting finitely many intermediate open sets between and ; after choosing , choose the extra required by [F1].
Applying the induction. Lemma [F1] with this chain and gives and with . Since , restriction [F2] gives with the same bound.
Conclusion. Hence for every , i.e. , with the displayed estimate. At , the base case of [F1] is the interior 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 for data in ; the library formulation localises to 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
- Local weak solutions of a divergence-form operator
- Nested-domain induction for interior elliptic derivatives
- Interior $H^2$ regularity for divergence-form equations
- Integer-order Sobolev spaces and their norms
- The notation $H^k$ and the reserved zero-boundary symbol
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter graduate notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, 2020, complete 158-page graduate notes) (standard reference, not scraped)