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.
FALSE: the local maximum modulus principle needs no connectedness
Statement
Every holomorphic function on an open subset of whose modulus has an interior local maximum is constant on that open set, even when the open set is disconnected.
Facts & Assumptions
Given: The disjoint open discs and in the complex metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and their union .
If the modulus of a holomorphic function on a complex domain has an interior local maximum, then the function is constant (Local maximum modulus principle).
Refutation
The two discs are nonempty, open, and disjoint, so is open but disconnected and therefore is not a complex domain (A complex domain is a nonempty connected open subset of ).
Define on and on . Every point has a neighbourhood on which is constant, so is holomorphic on .
At every point of the second disc, is a local maximum, but is not constant on because it is on the first disc. Thus the statement is false; the connected-domain hypothesis in [L1] is exactly what prevents this componentwise witness.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- B. V. Shabat, Introduction to Complex Analysis, Theorem 1.14 (standard reference, not scraped)