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.
A finite interior ball chain propagates weak Harnack bounds
Statement
Assume Countable Choice and the Axiom of Choice. Let , let be open and connected, let be as in De Giorgi local boundedness of homogeneous subsolutions, let with , and let with a.e. be a weak solution of (Harnack inequality for nonnegative weak solutions). Let be compact and connected with positive Lebesgue measure. Then there are a number and balls with together with a constant such that The connectedness of makes the finite cover's overlap graph connected, and the constant grows with ; the forcing sum is finite because the cover is finite.
Facts & Assumptions
Given: Countable Choice and the Axiom of Choice; a connected open set ; uniformly elliptic measurable symmetric coefficients with constants ; a source , ; a nonnegative weak solution of ; a compact connected set with positive Lebesgue measure.
Assume the Axiom of Choice. Harnack inequality on doubled balls: for every ball with , with (Harnack inequality for nonnegative weak solutions, Weak subsolutions and supersolutions of a divergence-form equation).
Assume the Axiom of Choice. Compactness and containment: since is compact and is open, , so a finite family of balls , , can be chosen with the half-balls covering (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Since is connected, the finite cover by the relative open sets has a connected intersection graph: otherwise the unions corresponding to two components of the graph would separate . If two such relative open sets intersect, the corresponding open balls intersect in a nonempty open set and hence in a set of positive Lebesgue measure (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).
Assume Countable Choice. The zero extension of lies in ; applying the cited Lebesgue-point theorem and restricting to gives a full-measure Lebesgue set (Lebesgue points and the Lebesgue set of an class, Almost every point is a Lebesgue point of a locally integrable function). At a Lebesgue point in a ball , : if either inequality failed, the averages of over sufficiently small balls centered at would stay bounded below by a positive constant.
For two measurable balls with , ; otherwise a real number strictly between them would be both an almost-everywhere lower bound on and an almost-everywhere upper bound on , impossible on their positive-measure intersection (The essential supremum of a measurable function with respect to a measure).
If for and , then by expanding the finite recurrence. [algebra]
Proof
The finite cover and connected overlap graph. By [F2] choose finitely many balls , , with whose half-balls cover . By [F3] their intersection graph is connected. Let , where ; this sum is finite because the cover is finite and .
Endpoint estimate along a graph path. Put , where is the local Harnack constant in [F1]. Let be Lebesgue points of , and choose cover half-balls and containing them. By [F3] there is a path in the finite intersection graph, with . Write and . For , the Harnack bound [F1] and the correctly oriented overlap comparison [F5] give . Iterating by [F6] and applying [F1] on the last ball gives , because [F4] gives and at Lebesgue points.
Conclusion for essential extrema on . The set of Lebesgue points in has full measure in by [F4]. For any , the positive-measure hypothesis on and the definition of essential infimum give a Lebesgue point with . Applying step 2.1 with this fixed gives for almost every Lebesgue point . Taking the essential supremum over and then letting proves the stated inequality with .
Depends on
- Harnack inequality for nonnegative weak solutions
- De Giorgi local boundedness of homogeneous subsolutions
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Weak subsolutions and supersolutions of a divergence-form equation
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets
- The average of a locally integrable function over a Euclidean ball
- Lebesgue points and the Lebesgue set of an $L^1_{loc}$ class
- Almost every point is a Lebesgue point of a locally integrable function
- The space $L^p(\mu)$ as the quotient by null functions
- The essential supremum of a measurable function with respect to a measure
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
- The global Harnack comparison needs connectedness Counterexample
Dependency tree · two levels
100 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, Consequences of De Giorgi-Nash-Moser (4 March 2016; complete 7-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)