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.
and for every
Statement
For every and real , In particular, for and , . The conventions and prerequisite facts used below are recorded in Chebyshev polynomials of the first and second kinds by their three-term recurrences, The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, The principle of mathematical induction.
Facts & Assumptions
Given: A natural and a real .
Quarter-turn values and shifts by pi/2 and pi: for every real and . In particular, taking gives .
Proof
The two identities follow directly from the initial polynomial values at and .
Assume the identities at and .
The recurrences and the addition formulas give the usual second-order recurrences for and .
Hence the identities hold at , so induction proves them for every natural . Separately, by [F1]; if , the shift in [F1] gives . Natural induction therefore proves for every natural . For and , substituting in the first proved identity gives , as claimed.
Depends on
Used by
- Composite-Simpson assembly of the Chebyshev weighted mass matrix Algorithm
- Best uniform polynomial error and Chebyshev interpolation operators Definition
- Chebyshev–Gauss–Lobatto collocation grid Definition
- Analytic and nonsmooth data have geometric and algebraic Chebyshev coefficient decay Example
- Chebyshev extremal nodes converge to the arcsine equilibrium measure Example
- Chebyshev extremals and the exact disk Fekete polynomial Example
- Exact sine and cosine values at π/10, π/5, and 2π/5 Example
- Gaussian and Simpson mass assembly give distinct exact and approximate checks Example
- Gram determinants and principal minors of the non-crystallographic types H₃ and H₄ Example
- Chebyshev bounds and endpoint derivatives used by stabilized Runge–Kutta methods Lemma
- Chebyshev polynomials are orthogonal for the arcsine weight Lemma
- Chebyshev–Lobatto interpolation folds polynomial modes Lemma
- Continuous Markov derivative bound on an interval Lemma
- Exclusions for positive definite diagrams: trees, valency, labels, chains and arms Lemma
- Trigonometric formulas for Chebyshev cardinal polynomials Lemma
- Analytic ellipse data give exponential Chebyshev–Lobatto interpolation error Theorem
- Chebyshev–Lobatto interpolation has an algebraic weighted spectral-Sobolev rate Theorem
- Chebyshev–Lobatto interpolation remainder bound Theorem
- Classification of finite Coxeter systems, including the H and dihedral families Theorem
- Composite Simpson error bound for Chebyshev weighted mass entries Theorem
- DCT-II samples extract Chebyshev coefficients at first-kind roots Theorem
- For n≥1, 2¹⁻ⁿTₙ is the minimax monic polynomial of degree n on [-1,1] Theorem
Dependency tree · two levels
20 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 18 (standard reference, not scraped)