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: boundary control alone gives the maximum principle on an unbounded domain
Statement
If a function is continuous on the closure of an unbounded complex domain, holomorphic inside, and has boundary modulus at most , then its modulus is at most throughout the domain.
Facts & Assumptions
Given: The upper half-plane and . The exponential is entire and holomorphic compositions obey the complex chain rule (The complex exponential is entire and its complex derivative is itself, The chain rule for complex derivatives). The bounded-domain theorem is Boundary maximum modulus principle on a bounded domain.
Boundary control together with control at infinity bounds the modulus throughout an unbounded complex domain (Maximum modulus principle with boundary and infinity control).
For real , (, , and ).
Refutation
The function is entire and hence is holomorphic on and continuous on its closed half-plane.
For , one has , so [L2] gives . Thus on the real boundary , while is unbounded as .
Step 2.1 violates the proposed conclusion. The valid unbounded-domain result [L1] requires control at infinity as well as finite-boundary control, and this example fails exactly that additional hypothesis.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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
- J. A. Tropp, Matrix Analysis, Lecture 7, §7.2.2 (standard reference, not scraped)