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.
Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials
Definition
A formal real polynomial is either the zero polynomial , or a finite coefficient list with ; we write the latter as . The list, rather than the function it induces, is the polynomial object. Its evaluation at is the real number .
For nonzero , define and . The zero polynomial has no degree and no leading coefficient. A nonzero polynomial is monic when . Thus degree and leading coefficient are defined from the displayed finite list, without asserting that distinct formal polynomials define distinct functions. The conventions for finite sums and integer powers used in the evaluation are recorded in Finite sums and finite products, by recursion, Integer powers .
Depends on
Used by
- The best uniform polynomial approximant is unique Corollary
- Bernoulli polynomials by a normalized coefficient recursion Definition
- Best uniform polynomial error and Chebyshev interpolation operators Definition
- Best uniform polynomial error on a compact interval Definition
- Cardinal-polynomial interpolation Definition
- Chebyshev polynomials of the first and second kinds by their three-term recurrences Definition
- Peano kernel of a finite quadrature functional Definition
- The polynomial moment pairing Definition
- A cubic gives equality in the pointwise interpolation remainder Example
- Chebyshev extremals and the exact disk Fekete polynomial Example
- Equispaced interpolation of Runge's function diverges Example
- Quadratic interpolation at three nodes is exact Example
- A finite coefficient vector has a canonical polynomial representative Lemma
- A finite product of monic linear factors is monic Lemma
- A real polynomial vanishing at a is divisible by x-a Lemma
- A scaled Chebyshev polynomial suppresses a separated interval Lemma
- Bounded integer-grid values control excursions by the derivative Lemma
- Cardinal interpolation functions are polynomials of the stated degrees Lemma
- Continuous Markov derivative bound on an interval Lemma
- Polynomial coefficients are bounded by values at fixed distinct nodes Lemma
- Positive moment Gram matrices produce orthonormal polynomial families Lemma
- The Chebyshev recurrence gives degree at most its index Lemma
- The highest derivative of a polynomial Lemma
- The rational first-variation space has dimension set by defect Lemma
- The Remez alternation linear system has a unique solution Lemma
- A nonzero real polynomial of degree n has no more than n distinct real roots Theorem
- Double-node Hermite interpolation has the stated pointwise remainder Theorem
- For n≥1, 2¹⁻ⁿTₙ is the minimax monic polynomial of degree n on [-1,1] Theorem
- Monic orthogonal polynomials exist uniquely through the quadrature order Theorem
- Polynomial exactness and best-approximation error for Clenshaw–Curtis Theorem
- The Gauss orthogonal polynomial has simple roots inside the interval Theorem
Dependency tree · two levels
21 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
- NIST Digital Library of Mathematical Functions, Chapter 4 (standard reference, not scraped)