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.
Strong maximum principle for classical subharmonic functions
Statement
Assume countable choice for the mean-inequality input. Let , let be a domain, and let satisfy . If there is with for every , then is constant.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Under countable choice, classical subharmonic functions lie below their ball averages on compactly contained balls. (Classical subharmonic mean value inequalities).
A connected space admits no partition into two nonempty disjoint open subsets. (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).
Proof
Put and . This is nonempty and relatively closed by continuity.
For choose with . The ball mean inequality gives , while the integrand is nonnegative. If it were positive at a point, continuity would give a positive lower bound on a smaller ball of positive volume, contradicting that integral inequality. Thus throughout , and is open.
If were nonempty, it and would separate into disjoint nonempty relatively open sets. Connectedness therefore gives .
Remarks
The alternative Hopf argument is recorded with its proof after the boundary-point lemma. The present proof uses only the mean inequality and connectedness.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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)