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.
Higher elliptic regularity cannot gain more than two derivatives
Statement refuted
Assume Countable Choice. For every integer , smooth constant coefficients and force every local weak solution of into .
Facts & Assumptions
Given: Countable Choice; a fixed integer ; the interval ; the datum ; and the function with .
On each half-interval the classical derivative of order of is a nonzero constant times , with a possible sign change across . For these derivatives tend to at and are in ; the order derivative is locally integrable with magnitude a positive constant times , but is not in near . Since all derivatives through order extend continuously across , the piecewise classical derivatives are the weak derivatives through order , with no point-mass terms. Thus but near . (Integer-order Sobolev spaces and their norms, Weak derivative of a locally integrable function)
A class is a local weak solution of if for every . (Local weak solutions of a divergence-form operator)
Put and . For , its derivatives through order are piecewise constant multiples of , hence lie in ; the rd derivative has magnitude a positive constant times and is not locally in at . The derivatives through order extend continuously across , so these piecewise formulas are the weak derivatives and no delta mass occurs. (Integer-order Sobolev spaces and their norms, Weak derivative of a locally integrable function)
Assume Countable Choice. For the operator in dimension one, and , so it is uniformly elliptic with , , and its constant coefficients lie in for every . If and is a local weak solution of , the interior theorem gives . (Interior elliptic regularity, Uniformly elliptic divergence-form operators and their sesquilinear forms, The Axiom of Countable Choice ())
Counterexample
Data regularity. The piecewise derivative calculation in [F1] shows but near .
The solution's regularity. With from [F3], one has on both sides of . Since is continuous at and is locally integrable, this also holds distributionally across . The piecewise derivative calculation in [F3] gives but near .
The weak equation. For every , the distributional identity gives . Thus is a local weak solution by [F2].
The interior theorem agrees with the direct calculation. The Laplacian has smooth constant coefficients, , and the weak solution satisfies the hypotheses of [F4], so that theorem gives . The explicit formula in step 1.2 gives the stronger global membership.
No third extra local derivative. If on a neighborhood of , then its third weak derivative lies in . But in distributions, so and hence , contradicting step 1.1. Therefore this interior weak solution belongs to but not to near , even with constant smooth coefficients.
Source notes
Hunter's Theorems 4.28 and 4.31 and Teschl's Corollary 10.19 (printed pp. 114-116 and p. 243) record the gain of exactly two derivatives. The interior cusp shows the sharpness at an interior point, rather than only at the boundary; the exact and failure of follow directly from the explicit formula.
Depends on
- Interior $H^{k+2}$ elliptic regularity
- Local weak solutions of a divergence-form operator
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- Integer-order Sobolev spaces and their norms
- Weak derivative of a locally integrable function
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript, complete 392 pages) (standard reference, not scraped)