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.
De Giorgi local boundedness of homogeneous subsolutions
Statement
Assume Countable Choice and the Axiom of Choice. Let , let be open, let , let be measurable symmetric with for a.e. and all , and let . Let satisfy a.e. and i.e. is a nonnegative weak subsolution of (Weak subsolutions and supersolutions of a divergence-form equation). Then is locally bounded, and for every ball , every and every , For the same statement holds with the critical Sobolev embedding in place of the embedding. The constant is scale invariant: it does not depend on or .
Facts & Assumptions
Given: Countable Choice and the Axiom of Choice; an open , ; constants ; a measurable symmetric coefficient field with a.e.; a nonnegative class with for every nonnegative ; a ball .
Assume Countable Choice and the Axiom of Choice. is defined for , and the subsolution inequality is the one of Weak subsolutions and supersolutions of a divergence-form equation with ; for and the class is an admissible nonnegative test (Positive-part truncation calculus and admissible cut-off weak tests).
Assume Countable Choice and the Axiom of Choice. Truncated Caccioppoli estimate: for , and concentric balls , with (Caccioppoli inequality for truncated subsolutions).
Assume Countable Choice and the Axiom of Choice. Level-set step: if and holds for all and all levels , then for , . For and each , the power and integral exponent use and , and the radius factor is ; the constant may depend on (Sobolev level-set step: energy decay with explicit level gap and radius loss).
Nonlinear iteration: if , , and with , then with (The nonlinear geometric iteration: an explicit threshold forces convergence to zero).
Essential supremum and means: a class satisfies a.e. if and only if . For every , Hölder applied to and with exponents and gives (The essential supremum is attained as the least essential bound, The essential supremum of a measurable function with respect to a measure, Holder's inequality for integrals, including the endpoint cases, The space as the quotient by null functions, The average of a locally integrable function over a Euclidean ball).
Assume the Axiom of Choice. The globally Lipschitz chain rule and weak product rule justify the compositions and cutoff tests. For a convex Lipschitz truncation , scalar convolution followed by subtracting the value at zero gives smooth convex nondecreasing approximants; their compositions converge in by the chain rule and dominated convergence. Monotone convergence applies to as (Chain rule for globally Lipschitz scalar maps of Sobolev functions, Weak Leibniz rule with a smooth factor, Dominated convergence, Monotone convergence for the integral).
Weighted Young inequality: if , then for and every , , with depending only on (Young's inequality for conjugate real exponents).
Proof
Convex power truncations. Fix and , and define the convex nondecreasing Lipschitz function It satisfies and since . Let be a smooth convolution of minus its value at zero. Then , , , and the Lipschitz constants are uniformly bounded for this fixed . For a nonnegative , the test is nonnegative and belongs to on a bounded neighborhood of its support. Since the equation is homogeneous, density extends the subsolution inequality to this test. The chain and product rules give As , the compositions converge to in by [F6], so the displayed inequality passes to against each smooth nonnegative test. Thus is a nonnegative local weak subsolution. No subsolution property of the smooth approximants is required.
The dyadic recurrence. Assume (otherwise a.e. on ), fix and , and put , , for . Set if , and if (so the latter uses the finite exponent ). Applying [F3] with outer radius and inner radius , and using and , gives where . For , the scaled radius factor in [F3] contributes ; for , and the same displayed scale follows directly.
The iteration closes. Write . Then the recurrence of step 1.2 reads , with for and for , and . By [F4], if then ; choosing with meets this condition. Then , so a.e. on and hence, by [F5], with .
Every smaller-ball ratio with a gap bound. Fix and set . A finite collection of balls with centers in covers , and each outer ball is compactly contained in . Applying the half-ball estimate of step 2.1 to each outer ball yields Taking the finite union gives the same bound on . This quantitative gap dependence controls the radius losses in the subsequent small-exponent argument. In particular, is essentially bounded on each strictly smaller ball.
The case . If the estimate is automatic. Fix and put . For each , is a nonnegative local weak subsolution by step 1.1 and lies in because is globally Lipschitz with . The zero-source inequality extends to all nonnegative tests, so the local boundedness theorem applies. The arbitrary-ratio estimate of step 3.1 gives . As , and , so monotone convergence [F6] and monotonicity of essential supremum give . Taking the -th root proves the estimate, with constant .
The case . Put . If , then a.e. on ; otherwise . Let , , and . By step 3.1, . Apply the estimate of step 3.1 to on the outer ball with inner ratio . Its explicit gap bound gives a constant (because is a fixed multiple of ), and Holder gives For any , [F7] yields . Choose with and iterate. The geometric series converges, while by step 3.1 on the fixed ball , so . Hence , proving the desired estimate on . This proves every directly and requires no limit as the radius approaches .
Conclusion. Steps 4.1 and 4.2 prove the estimate for every ; the constants depend only on , and scaling shows independence of and .
Depends on
- Weak subsolutions and supersolutions of a divergence-form equation
- Positive-part truncation calculus and admissible cut-off weak tests
- Chain rule for globally Lipschitz scalar maps of Sobolev functions
- Weak Leibniz rule with a smooth factor
- Caccioppoli inequality for truncated subsolutions
- Sobolev level-set step: energy decay with explicit level gap and radius loss
- The nonlinear geometric iteration: an explicit threshold forces convergence to zero
- The average of a locally integrable function over a Euclidean ball
- Chebyshev-Markov inequality for the integral
- The essential supremum is attained as the least essential bound
- $L^p$ norms converge to the essential supremum for essentially bounded $L^r$ functions
- Holder's inequality for integrals, including the endpoint cases
- Young's inequality for conjugate real exponents
- The essential supremum of a measurable function with respect to a measure
- The space $L^p(\mu)$ as the quotient by null functions
- Dominated convergence
- Monotone convergence for the integral
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
- Strong maximum principle for weak elliptic solutions Corollary
- The essential supremum precedes the Holder representative in De Giorgi theory Example
- A finite interior ball chain propagates weak Harnack bounds Lemma
- De Giorgi oscillation reduction: one half-level set is small Lemma
- Logarithmic Caccioppoli estimate for positive supersolutions Lemma
- Moser iteration for positive supersolutions: negative-power and logarithmic comparison Lemma
- Zero-set propagation for a nonnegative Holder weak solution Lemma
- De Giorgi local boundedness with a scale-correct forcing term Theorem
- De Giorgi-Nash interior Holder regularity for divergence-form equations Theorem
- Harnack inequality for nonnegative weak solutions Theorem
- Weak Harnack inequality for nonnegative supersolutions Theorem
Dependency tree · two levels
115 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)