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.
Moser iteration for positive supersolutions: negative-power and logarithmic comparison
Statement
Assume Countable Choice and the Axiom of Choice. Let , let be open, let and be as in De Giorgi local boundedness of homogeneous subsolutions, and let with a.e. be a positive weak supersolution of . Then the negative-power chain of the Moser iteration holds: for every , every and every ball , Moreover there is an exponent such that, for every , The proof does not assume that is bounded away from zero: the negative-power tests and positive moments are handled after regularisation ; monotone convergence passes the increasing negative moments, while dominated convergence passes the decreasing positive moments. The logarithmic estimate Logarithmic Caccioppoli estimate for positive supersolutions supplies the input for the comparison of opposite powers.
Facts & Assumptions
Given: Countable Choice and the Axiom of Choice; an open set , ; measurable symmetric coefficients with ; the principal operator and its form ; a class with a.e. and for every nonnegative ; a ball and .
Assume the Axiom of Choice. Composition, products and density: a globally Lipschitz scalar composition of an class obeys the Sobolev chain rule; a compactly supported smooth factor obeys the weak product rule; and a compactly supported class lies in by zero extension and smooth approximation. Thus the bounded truncation of and its cutoff test in step 1.1 are admissible (Chain rule for globally Lipschitz scalar maps of Sobolev functions, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n), Zero-boundary Sobolev space as a norm closure, Weak subsolutions and supersolutions of a divergence-form equation, Integer-order Sobolev spaces and their norms).
Assume the Axiom of Choice. Ellipticity and boundedness of the coefficients: for a.e. point and every (Uniformly elliptic divergence-form operators and their sesquilinear forms, The elliptic form is well defined and bounded on ).
Assume the Axiom of Choice. Sobolev input: there is , namely for and any fixed finite for , and a constant with for every (The Sobolev inequality for zero-boundary Sobolev closures on open sets, The critical Sobolev embedding into every finite ). In dimension two the gradient-only form follows directly from the zero-boundary supplier: set , so . The same smooth approximants and finite measure put in , and Holder gives .
Assume the Axiom of Choice. If on a finite-measure ball, then as ( norms converge to the essential supremum for essentially bounded functions, The space as the quotient by null functions, The essential supremum of a measurable function with respect to a measure).
Assume the Axiom of Choice. Logarithmic Caccioppoli estimate: for every and every , (Logarithmic Caccioppoli estimate for positive supersolutions).
Assume the Axiom of Choice. Poincare-Wirtinger inequality on balls, and the existence of smooth bumps between concentric balls with (Poincare inequality on a ball, A smooth bump between concentric Euclidean balls).
Assume the Axiom of Choice. Monotone and dominated convergence for the integral, used to pass to the limit in the regularised estimates (Monotone convergence for the integral, Dominated convergence, The essential supremum of a measurable function with respect to a measure, The average of a locally integrable function over a Euclidean ball).
Dyadic differentiation and layer cake: for a locally integrable function, averages over shrinking dyadic subcubes containing converge to its Lebesgue value at almost every . To use the whole-space supplier on a fixed covering cube, first zero-extend its integrable restriction. At a Lebesgue point , enclose each containing cube of side in ; the volume ratio is fixed, so the cube average of tends to zero by Almost every point is a Lebesgue point of a locally integrable function. For , , with extended nonnegative values (Lebesgue differentiation theorem on , For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).
Proof
Here denotes the normalized integral of over the ball in the surrounding estimate.
Proof technique: direct; regularise by , test with bounded truncations of negative powers to derive a positive-power Sobolev iteration for , and use the scale-invariant logarithmic Caccioppoli estimate to obtain local mean oscillation, a dyadic stopping estimate and exponential integrability of the logarithm.
Scaling, bounded truncation, density and the energy estimate. Under , the principal divergence form and the weak supersolution inequality retain the same ellipticity bounds, while ball averages are invariant; it is enough to work on . Fix , put , and for choose . Then , so and its weak gradient are bounded by constants (depending on ) times and , respectively. More explicitly, for the globally Lipschitz bounded truncation satisfies a.e. The cutoff product lies in by the chain and product rules and compact-support zero extension; approximate it in by nonnegative smooth tests and use continuity of the form to pass the supersolution inequality to this test. Testing with gives By Cauchy--Schwarz in the -energy, . Absorbing the resulting energy square root yields Ellipticity and then give .
Local logarithmic oscillation. Put and . The logarithmic Caccioppoli estimate [F5], with a smooth cutoff supported in and equal to one on , gives ; Poincare [F6] therefore gives . Cover by finitely many axis-parallel cubes of a fixed side so small that their closures lie in and every concentric ball below lies in . For each dyadic subcube of side , let be the concentric ball of radius , which contains . The logarithmic estimate with a smooth cutoff equal to one on and supported in the concentric ball of radius gives . The ball Poincare inequality [F6] on , together with , then yields , with independent of , and .
The reverse-exponent iteration. Let for and fix for , so the Sobolev inequality is available in both cases by [F3]. Combining step 1.1 with the product rule and a cutoff equal to one on and supported in , , yields For and , apply this with and multiply. The logarithm of the product is bounded by a constant multiple of , so Taking reciprocals and inserting the volume factor gives . This is a positive-exponent iteration for ; in particular the reverse-exponent range is , with arbitrary starting .
Bounded truncations, stopping cubes and factorial moments. For each set . It is a bounded truncation by the Lipschitz chain rule; its mean oscillation on every dyadic subcube of a covering cube is at most . By [F8], dyadic averages differentiate almost everywhere, so the stopping cubes cover the relevant superlevel set up to a null set. For and every dyadic cube , : compare first with the constant using the -Lipschitz scalar map, then with . Set . In each cube select the maximal proper dyadic subcubes with . They are disjoint and their total measure is at most , where . Their immediate parents are not bad, so . Outside their union, dyadic differentiation gives a.e. Repeat the same selection inside each selected cube, recentering at its own mean; its mean oscillation is still at most . The generation- union has measure at most , while outside it the accumulated mean differences and final good-set bound give for . Consequently there are dimensional constants such that The layer-cake formula [F8] then yields for every integer . The factorial cancels the denominator in the exponential series: its th averaged term is at most . Choose . The geometric bound and monotone convergence of the nonnegative series give By step 1.2 and the fixed cube size, uniformly in , hence . Since , monotone convergence gives . Summing over the finite cover and normalizing yields , uniformly in . The bounded negative-power test in step 1.1 was placed in by compact-support smooth density; here the bounded logarithm truncations ensure every oscillation estimate is finite before the monotone limit.
The product constant and the limit . Since , step 2.2 gives hence the second assertion with comparison constant . For the fixed exponent , and as ; dominated convergence for the positive moment (using since on this bounded ball) and monotone convergence for the negative moment pass the product bound. Since a.e., the limiting positive moment is strictly positive, so the product bound also shows that this particular negative moment is finite. For an arbitrary exponent in the first assertion, monotone convergence passes with its extended value; interpret , so the reciprocal negative-moment inequality remains valid without asserting finiteness. The same scaling as in step 1.1 restores arbitrary ; all constants depend only on the listed parameters, and no positive lower bound for is assumed.
Depends on
- De Giorgi local boundedness of homogeneous subsolutions
- Logarithmic Caccioppoli estimate for positive supersolutions
- Weak subsolutions and supersolutions of a divergence-form equation
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- The elliptic form is well defined and bounded on $H^1$
- Chain rule for globally Lipschitz scalar maps of Sobolev functions
- Weak Leibniz rule with a smooth factor
- Compactly supported Sobolev functions extend by zero in every integer order
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Zero-boundary Sobolev space as a norm closure
- Integer-order Sobolev spaces and their norms
- Poincare inequality on a ball
- The Sobolev inequality for zero-boundary Sobolev closures on open sets
- The critical Sobolev embedding into every finite $L^q$
- A smooth bump between concentric Euclidean balls
- $L^p$ norms converge to the essential supremum for essentially bounded $L^r$ functions
- Monotone convergence for the integral
- Dominated convergence
- The space $L^p(\mu)$ as the quotient by null functions
- The essential supremum of a measurable function with respect to a measure
- The average of a locally integrable function over a Euclidean ball
- Lebesgue differentiation theorem on $\mathbb{R}^n$
- For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
- Almost every point is a Lebesgue point of a locally integrable function
Used by
Dependency tree · two levels
151 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)