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.
Maximum modulus principle with boundary and infinity control
Statement
Boundary control together with control at infinity bounds the modulus throughout an unbounded complex domain.
In full, let be a complex domain, let be holomorphic, and let . Suppose that for every :
- for every , some neighbourhood satisfies for all ;
- if is unbounded, some satisfies whenever and .
Then for every . For bounded , only the finite-boundary clause is required.
Facts & Assumptions
Given: A complex domain , a holomorphic function on it, a real , and the two stated control hypotheses. The complex and Euclidean plane topologies agree ( as the Euclidean plane and as a normed real algebra: what the identification preserves), and closure and boundary have the meanings of Interior, closure, boundary, limit point, isolated point and dense subset of a metric space.
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).
A closed bounded subset of the Euclidean plane is compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
A continuous real-valued function on a nonempty compact metric space attains a maximum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
The Euclidean plane is connected ( is polygonally connected, connected, locally path-connected and locally connected).
A complex differentiable function is continuous at every point of complex differentiability (Complex differentiability at a point implies continuity there).
Proof
Fix and form the superlevel set .
By [L5] and the reverse triangle inequality, is continuous, so is relatively closed in : at a point where , that strict inequality persists on a neighbourhood. Boundary control excludes every point of from the closure of , so is closed in the plane. It is bounded because is bounded or, in the unbounded case, because infinity control excludes all points with sufficiently large modulus. Thus [L2] makes compact and it lies entirely inside .
If were nonempty, [L3] would give a maximizer of on it. Outside the modulus is smaller than , so this is also an interior global maximum on ; [L1] makes constant. When is bounded, its boundary is nonempty because otherwise it would be a nonempty clopen subset of the connected plane [L4] and hence the whole unbounded plane, so the constant contradicts finite-boundary control. When is unbounded, it contradicts infinity control. Hence is empty.
The set is empty for every . If some had , taking would put in , a contradiction; therefore on .
Depends on
- Local maximum modulus principle
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- Complex differentiability at a point implies continuity there
- $\mathbb{R}^n$ is polygonally connected, connected, locally path-connected and locally connected
- $\mathbb C=\mathbb R[x]/(x^2+1)$ as the Euclidean plane and as a normed real algebra: what the identification preserves
Used by
Dependency tree · two levels
57 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. Lebl, Guide to Cultivating Complex Analysis, Exercise 3.3.19 (standard reference, not scraped)