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.
Weak minimum principle for the laplacian
Statement
For , a bounded nonempty open and with satisfy .
Facts & Assumptions
Given: The objects and hypotheses in the statement.
On a bounded nonempty open set, a subharmonic function continuous on the closure has its closure maximum on the boundary. (Weak maximum principle for the laplacian).
Proof
Put . It has the same regularity and .
Apply the weak maximum principle to and multiply its equality by . Maxima of are negatives of minima of , which proves the claimed equality.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- Hunter, Notes on Partial Differential Equations (standard reference, not scraped)