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.
An exact polynomial bound from the boundary maximum principle
Example
For on the closed unit disc, and equality is attained at the boundary point .
Facts & Assumptions
Given: The polynomial and the triangle inequality and multiplicative law for complex modulus (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
If is a bounded complex domain and is continuous on and holomorphic on , then attains its maximum on (Boundary maximum modulus principle on a bounded domain).
Every complex polynomial is entire (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero).
Verification
If , then .
By [L2], is entire, so [L1] applies to the open unit disc and confirms that its maximum on the closed disc occurs on the unit circle.
The point lies on that circle and . Together with step 1.1, this proves that the exact maximum is .
Depends on
- Boundary maximum modulus principle on a bounded domain
- Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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, §3.3 (standard reference, not scraped)