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-Harnack exponent range and its dimension-dependent upper endpoint
Statement
The weak Harnack inequality of Weak Harnack inequality for nonnegative supersolutions is asserted only for the sourced range when (and for every finite when ). The endpoint depends only on dimension; the seed exponent and constants depend on the coefficients. Starting from , the higher exponents below that endpoint are obtained by the positive-integrability Sobolev transitions in the weak-Harnack proof, while Hölder interpolation supplies smaller exponents. No claim is made here that every positive exponent is admissible; in particular one must not restate the weak Harnack inequality with an arbitrary , and the constant for the source depends on as recorded.
Sources
Krummel, DeGiorgi-Nash lecture notes, Theorem 2 (printed p. 1) states the weak Harnack inequality for when , and its proof obtains higher exponents from the fixed seed by Sobolev transitions, with Hölder interpolation giving smaller exponents. Simon, Lectures on Partial Differential Equations, Lecture 17, Theorem 2 (printed pp. 199-210) states the same range. The remark records the exact range of the theorem of Weak Harnack inequality for nonnegative supersolutions and carries no proof obligation of its own.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Brian Krummel, DeGiorgi-Nash lecture notes (15 March 2016; complete 9-page notes) (standard reference, not scraped)
- Leon Simon, Lectures on Partial Differential Equations (Stanford University; complete author scan, 118 sheets reproducing the 223 printed pages of the manuscript, two logical pages per sheet) (standard reference, not scraped)