Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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 C is identified with R2.

Let K⊆C be nonempty and compact. For a polynomial p put

∥p∥K:=sup⁡z∈K∣p(z)∣∈[0,∞).

The supremum is finite and is a maximum: z↦p(z) 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, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive; a continuous real-valued function on the nonempty compact space K 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 n≥1 define

tn(K):=inf⁡{∥p∥K: p is a monic complex polynomial of degree n}.

This infimum is a real number: the set is nonempty because p(Z)=Zn is monic of degree n, it consists of nonnegative numbers by the modulus laws, and every nonempty subset of R bounded below has a greatest lower bound, the infimum (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)). Thus 0≤tn(K)<∞ for every n≥1.

The Chebyshev constant of K is

cheb⁡(K):=inf⁡n≥1tn(K)1/n,

where tn(K)1/n is the unique nonnegative n-th root of tn(K) (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a). This infimum exists by the same argument: the index set {n∈N:n≥1} is nonempty, each tn(K)1/n≥0, so the set is nonempty and bounded below by 0 (Every nonempty set bounded below has an infimum). For the empty set one uses the separate convention

cheb⁡(∅):=0.

Remarks

No extremal polynomial is claimed. The quantity tn(K) 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 K only through the sup norms. Every ingredient of the definition is a function of the compact set K; for K={a} one has ∥p∥K=∣p(a)∣ and tn({a})=0 for all n≥1 because (Z−a)n is a monic degree-n polynomial vanishing at a, so cheb⁡({a})=0.

The root limit is proved later. That the infimum defining cheb⁡(K) is also the limit of the sequence tn(K)1/n is the content of The Chebyshev constant is the root limit of monic extremal norms and is not assumed here.

Depends on

Used by

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