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.
Harnack inequality on compact subsets
Statement
For , a domain and a nonempty compact , there is such that every nonnegative harmonic function on satisfies The compact set need not be connected.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
On a nonnegative harmonic function satisfies . (Harnack inequality on a ball).
Any compact subset of a domain has a finite cover by interior balls with connected overlap graph and fourfold closed balls in the domain. (Finite harnack chain on a compact connected subset).
A nonnegative harmonic function on a domain is identically zero or strictly positive everywhere. (Nonnegative harmonic function with an interior zero vanishes).
Proof
If has an interior zero, it vanishes throughout , and the inequality is immediate. Otherwise it is strictly positive. Fix the finite admissible-ball family of the chain lemma, of size , independently of .
If from this family, then and . Ball Harnack gives . Thus any two points of one of the small balls are comparable by the same constant.
For , connect balls containing them by a simple path in the finite connected graph, with at most vertices. Choose one point in each of its finitely many overlaps and apply the local comparison in successive balls. It gives . Taking the supremum in and the infimum in proves the claim with .
Depends on
Used by
- Harnack convergence principle Theorem
Dependency tree · two levels
8 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
- John K. Hunter, Notes on Partial Differential Equations (2014) (standard reference, not scraped)
- Tsogtgerel Gantumur, Harmonic functions (2012) (standard reference, not scraped)