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.
Caccioppoli inequality for truncated subsolutions
Statement
Assume Countable Choice and the Axiom of Choice. Let , let be open, and let , and let be measurable with and Write and for real . Let and let satisfy the local weak subsolution inequality Then for every and every with , and for concentric balls , , All integrands are restricted to the superlevel set , where ; the estimate is uniform in and in the localisation.
Facts & Assumptions
Given: Countable Choice and the Axiom of Choice; an open , ; constants ; a measurable symmetric coefficient field with a.e.; ; and a real class with for every nonnegative .
Assume Countable Choice and the Axiom of Choice. For and , the class lies in with , and a.e. on . Global membership is not asserted for arbitrary on an infinite-measure domain. For the product lies in , is nonnegative, and satisfies a.e. (Positive-part truncation calculus and admissible cut-off weak tests, Weak subsolutions and supersolutions of a divergence-form equation).
Assume Countable Choice. Every element of has weak first derivatives in , the weak derivative is linear, and products of classes with bounded measurable coefficients are integrable on compact sets (Integer-order Sobolev spaces and their norms).
Bumps: for there is with , on and for a universal constant ; the explicit radial bump , , of A smooth bump between concentric Euclidean balls and Compactly supported scaled Euclidean bumps provides it, since on the support and the chain rule give .
Young's inequality with conjugate exponents and weight: for and , (Young's inequality for conjugate real exponents); Cauchy–Schwarz in gives (Holder's inequality for integrals, including the endpoint cases).
Proof
Fix and with , and put and . By [F1], is nonnegative; since and the support is compact, density extends the local subsolution inequality to this test. Thus . Expanding and using , define . The correct identity is The matrix Cauchy--Schwarz inequality and bound the last term by .
By Young's inequality with , step 1.1 gives . Ellipticity gives , and therefore This is the first estimate.
For the ball form let with and choose the bump of [F3], so that , on , and . Applying step 2.1 gives the second estimate, with . Both estimates are uniform in , and no choice principle beyond the declared Countable Choice and Axiom of Choice is used.
Depends on
- Weak subsolutions and supersolutions of a divergence-form equation
- Positive-part truncation calculus and admissible cut-off weak tests
- A smooth bump between concentric Euclidean balls
- Compactly supported scaled Euclidean bumps
- Young's inequality for conjugate real exponents
- Holder's inequality for integrals, including the endpoint cases
- Integer-order Sobolev spaces and their norms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
Dependency tree · two levels
67 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
- Bozhidar Velichkov, Elliptic PDEs: Teorema di De Giorgi (Universita di Pisa; complete 7-page note, in Italian) (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)
- Brian Krummel, DeGiorgi-Nash lecture notes (15 March 2016; complete 9-page notes) (standard reference, not scraped)