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.
Chebyshev constant of a compact planar set
Definition
All polynomials below are complex formal polynomials with the evaluation and monic conventions of Formal complex polynomials, evaluation, degree, leading coefficient, and monic polynomials, and is identified with .
Let be nonempty and compact. For a polynomial put
The supremum is finite and is a maximum: is entire (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero), hence continuous, and satisfies the modulus laws of Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive; a continuous real-valued function on the nonempty compact space is bounded and attains its bounds (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value). No choice principle is used: the only selection is that of an extremal point of a continuous function on a compact set, which the cited extreme-value theorem supplies.
For every integer define
This infimum is a real number: the set is nonempty because is monic of degree , it consists of nonnegative numbers by the modulus laws, and every nonempty subset of bounded below has a greatest lower bound, the infimum (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)). Thus for every .
The Chebyshev constant of is
where is the unique nonnegative -th root of (Existence and uniqueness of -th roots: a unique with ). This infimum exists by the same argument: the index set is nonempty, each , so the set is nonempty and bounded below by (Every nonempty set bounded below has an infimum). For the empty set one uses the separate convention
Remarks
No extremal polynomial is claimed. The quantity is an infimum over polynomials of a fixed degree and is not defined as the norm of a polynomial that attains it. Existence of a best monic polynomial is not asserted, and the definition does not choose one.
Dependence on only through the sup norms. Every ingredient of the definition is a function of the compact set ; for one has and for all because is a monic degree- polynomial vanishing at , so .
The root limit is proved later. That the infimum defining is also the limit of the sequence is the content of The Chebyshev constant is the root limit of monic extremal norms and is not assumed here.
Depends on
- Formal complex polynomials, evaluation, degree, leading coefficient, and monic polynomials
- 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
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Every nonempty set bounded below has an infimum
- Existence and uniqueness of $n$-th roots: a unique $a^{1/n} \ge 0$ with $(a^{1/n})^n = a$
- Greatest lower bound (infimum)
Used by
- Chebyshev extremals and the exact disk Fekete polynomial Example
- Monic polynomial lower bounds for the Chebyshev constant and capacity Lemma
- The Chebyshev constant is the root limit of monic extremal norms Lemma
- Fekete–Szegő equality of logarithmic capacity, transfinite diameter, and Chebyshev constant Theorem
Dependency tree · two levels
52 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
- E. B. Saff, Logarithmic Potential Theory with Applications to Approximation Theory, §1 (standard reference, not scraped)