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.
Bootstrapping a smooth Poisson problem
Example
Assume the Axiom of Choice (inherited from the embedding theorem used below) together with Countable Choice. Let be open, let , and let be a local weak solution of on in the sense of Local weak solutions of a divergence-form operator; for instance, when is a nonempty bounded open set and also , may be the zero-trace weak Dirichlet solution, whose existence and uniqueness under the Axiom of Choice are Existence and uniqueness for the weak Dirichlet Poisson problem. Iterating Interior elliptic regularity with the constant coefficients of the Laplacian gives for every , hence a representative of class by Higher-order Sobolev embedding, and for that representative the equation holds pointwise on . No boundary data and no boundary regularity are used: the smoothness of alone permits the induction to continue at every order.
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice; an open set ; ; and a local weak solution of on .
A class is a local weak solution of when for every , with the form of the divergence-form operator; by the closure definition this is equivalent to the same identity for every bounded and every . (Local weak solutions of a divergence-form operator)
Assume Countable Choice. The Laplacian has constant coefficients , , hence and for every with zeroth-order principal bound and all positive-order derivative bounds zero; it is uniformly elliptic with . (Uniformly elliptic divergence-form operators and their sesquilinear forms)
Assume Countable Choice. Let , let have and with all coefficient derivatives through the indicated orders bounded by constants , let , and let be a local weak solution of . Then . (Interior elliptic regularity)
Assume the Axiom of Choice. For , let be a bounded extension domain in , let , with . If and satisfy , then every has a representative in with norm bounded by . In particular, and an integer give a continuous representative on . (Higher-order Sobolev embedding)
Every open ball in , , is a bounded extension domain: it is a bounded domain in the graph sense, so Bounded C^k domains admit integer-order Sobolev extension supplies an extension operator. For , on each bounded open interval every class in has a unique continuous, locally absolutely continuous representative by One-dimensional functions have unique absolutely continuous representatives. (Sobolev extension domains and extension operators)
Assume Countable Choice. If is a local weak solution of with , bounded first coefficient derivatives, and , then the equation holds pointwise almost everywhere, with understood through the a.e. defined product ; for the constant coefficients of the Laplacian this is the a.e. identity . (Interior regularity for divergence-form equations)
Verification
Local smoothness at every order. Fix and a bounded open . By [F2] the Laplacian satisfies the coefficient hypotheses of [F3] at order , and gives ; since is a local weak solution, [F3] gives , hence . As was arbitrary, for every .
A smooth representative. If , fix a ball and an integer . Choose a slightly larger ball and an integer . Step 1.1 gives , and [F5] makes a bounded extension domain; [F4] then gives a representative on for some . For different these representatives agree everywhere on overlaps: they are continuous and represent the same almost-everywhere class. Thus they define a representative on . If , fix a bounded open interval . Step 1.1 gives for every . By [F5] each has a unique continuous, locally absolutely continuous representative . The weak derivative of is , so the fundamental theorem gives for in ; continuity of implies and . Iterating, is . These local representatives agree on overlaps, yielding a smooth representative on all components of .
The equation holds pointwise. For the representative of step 2.1, and , so by [F6] the equation holds pointwise almost everywhere, the Laplacian's expression being the a.e. function . Both sides, by step 2.1 and by hypothesis, are continuous on , and two continuous functions that agree almost everywhere on an open set agree at every point. Thus the smoothed representative solves the classical equation pointwise.
Source notes
Hunter's Corollary 4.29 and Laugesen's Theorems 5.8-5.9 (printed pp. 114 and 111-112, read in full) iterate the interior estimate to obtain for every and then a smooth representative; the same two-step pattern is used above. The example separates the two inputs: the coefficient regime of the Laplacian never obstructs the induction, and the smoothness of is exactly what allows the data order to increase; the Axiom of Choice is carried only by the Sobolev embedding used for the representative.
Depends on
- Interior $H^{k+2}$ elliptic regularity
- Interior $H^2$ regularity for divergence-form equations
- Higher-order Sobolev embedding
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- Local weak solutions of a divergence-form operator
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- The notation $H^k$ and the reserved zero-boundary symbol
- Sobolev extension domains and extension operators
- Bounded C^k domains admit integer-order Sobolev extension
- Existence and uniqueness for the weak Dirichlet Poisson problem
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
83 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)