Skip to content

ChebyshevT ​

The Chebyshev polynomial of the first kind Tn(x)T_n(x), defined by Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos\theta) = \cos(n\theta). Provided by @enumeratio/analytic.

✓ checked against that system · ! checked, with disagreements (hover a chip)WikipediaChebyshev polynomialsMathWorldChebyshevPolynomialoftheFirstKindDLMF18.3FungrimChebyshevT✓Fungrim entryWolfram LanguageChebyshevT!
ChebyshevT(n, x)the degree-nn Chebyshev polynomial of the first kind at xx, for an integer nn.
Typed signatures
TypePackageApplies
(integer, number) -> numberanalyticalways

Domain: Special functions

Details
  • T0=1T_0 = 1, T1=xT_1 = x, and Tn+1=2x Tn−Tn−1T_{n+1} = 2x\,T_n - T_{n-1}. The coefficients are integers and the leading one is 2n−12^{n-1} for n≥1n \ge 1.
  • Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos\theta) = \cos(n\theta), so on [−1,1][-1, 1] the polynomial oscillates between −1-1 and 11, and Tn(1)=1T_n(1) = 1, Tn(−1)=(−1)nT_n(-1) = (-1)^n.
  • Composition multiplies degrees: Tm(Tn(x))=Tmn(x)T_m(T_n(x)) = T_{mn}(x). Parity follows the degree: Tn(−x)=(−1)nTn(x)T_n(-x) = (-1)^n T_n(x).
  • A negative order folds as Wolfram does: T−n=TnT_{-n} = T_n.
  • At an integer nn and a symbolic or exact xx the result is the expanded polynomial. At a floating-point or complex xx the recurrence runs directly on the number.
  • A symbolic order stays unevaluated. The signature takes an integer order only; Wolfram continues TνT_\nu to non-integer ν\nu, and that is not implemented here.

Examples

7 more kept as data, checked against the oracles
Basic #

T3(x)=4x3−3xT_3(x) = 4x^3 - 3x

live ↗
InChebyshevT(3,x)\mathrm{ChebyshevT}(3, x)Out4x3−3x4x^3-3x

T4(x)=8x4−8x2+1T_4(x) = 8x^4 - 8x^2 + 1

live ↗
InChebyshevT(4,x)\mathrm{ChebyshevT}(4, x)Out8x4−8x2+18x^4-8x^2+1

At an integer the value is exact

live ↗
InChebyshevT(5,2)\mathrm{ChebyshevT}(5, 2)Out362362

At a floating-point xx

live ↗
InChebyshevT(5,0.7)\mathrm{ChebyshevT}(5, 0.7)Out−0.670 879 999 999 999 8-0.670\,879\,999\,999\,999\,8

Evaluates at an integer: T2(3)=2⋅9−1T_2(3) = 2\cdot9 - 1

live ↗
InChebyshevT(2,3)\mathrm{ChebyshevT}(2, 3)Out1717

The degree-10 polynomial in xx

live ↗
InChebyshevT(10,x)\mathrm{ChebyshevT}(10, x)Out512x10−1 280x8+1 120x6−400x4+50x2−1512x^{10}-1\,280x^8+1\,120x^6-400x^4+50x^2-1
live ↗
InSeries⁡(ChebyshevT(5,x),x,0,5)\operatorname{Series}(\mathrm{ChebyshevT}(5, x), x, 0, 5)OutxChebyshevT(0,1)(5,0)+12(ChebyshevT(0,2)(5,0)x2)+16(ChebyshevT(0,3)(5,0)x3)+124(ChebyshevT(0,4)(5,0)x4)+1120(ChebyshevT(0,5)(5,0)x5)+O(x6)x\mathrm{ChebyshevT}^{(0, 1)}(5, 0)+\frac{1}{2}(\mathrm{ChebyshevT}^{(0, 2)}(5, 0)x^2)+\frac{1}{6}(\mathrm{ChebyshevT}^{(0, 3)}(5, 0)x^3)+\frac{1}{24}(\mathrm{ChebyshevT}^{(0, 4)}(5, 0)x^4)+\frac{1}{120}(\mathrm{ChebyshevT}^{(0, 5)}(5, 0)x^5)+O\left(x^6\right)
Scope #

At a rational xx the value is an exact rational

live ↗
InChebyshevT(5,13)\mathrm{ChebyshevT}(5, \frac{1}{3})Out241243\frac{241}{243}

At a Gaussian integer

live ↗
InChebyshevT(4,2+3i)\mathrm{ChebyshevT}(4, 2+3i)Out−911−1 056i-911-1\,056i

A symbolic order stays unevaluated

live ↗
InChebyshevT(n,x)\mathrm{ChebyshevT}(n, x)OutChebyshevT(n,x)\mathrm{ChebyshevT}(n, x)

Exact integer argument

live ↗
InChebyshevT(2,5)\mathrm{ChebyshevT}(2, 5)Out4949

T0T_0 is constant 1

live ↗
InChebyshevT(0,0)\mathrm{ChebyshevT}(0, 0)Out11

T0T_0 is 1 even at infinity

live ↗
InChebyshevT(0,∞)\mathrm{ChebyshevT}(0, ∞)Out11

Symbolic argument gives the odd degree-7 polynomial

live ↗
InChebyshevT(7,x)\mathrm{ChebyshevT}(7, x)Out64x7−112x5+56x3−7x64x^7-112x^5+56x^3-7x

Odd degree: T1(−x)=−T1(x)T_1(-x) = -T_1(x)

live ↗
InChebyshevT(1,−x)=−ChebyshevT(1,x)\mathrm{ChebyshevT}(1, -x)=-\mathrm{ChebyshevT}(1, x)OutTrue\mathrm{True}

Even degree: T2(−x)=T2(x)T_2(-x) = T_2(x)

live ↗
InChebyshevT(2,−x)=ChebyshevT(2,x)\mathrm{ChebyshevT}(2, -x)=\mathrm{ChebyshevT}(2, x)OutTrue\mathrm{True}

Applied to a matrix as a matrix function, giving exact radicals

live ↗
InMatrixFunction(()↦ChebyshevT(2,_1⁡),[[1,2],[3,4]])\mathrm{MatrixFunction}(()↦\mathrm{ChebyshevT}(2, \operatorname{\_1}), \bigl\lbrack\bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack3, 4\bigr\rbrack\bigr\rbrack)Out[[1132(33(331/2−3)((5+331/2)2−2))−1132(33(−331/2−3)((5−331/2)2−2)),133(33(5+331/2)2)−133(33(5−331/2)2)],[122(33(5+331/2)2)−122(33(5−331/2)2),1132(33((5+331/2)2−2)(3+33))−1132(33((5−331/2)2−2)(3−331/2))]]\bigl\lbrack\bigl\lbrack\frac{1}{132}(\sqrt{33}(33^{1/2}-3)((5+33^{1/2})^2-2))-\frac{1}{132}(\sqrt{33}(-33^{1/2}-3)((5-33^{1/2})^2-2)), \frac{1}{33}(\sqrt{33}(5+33^{1/2})^2)-\frac{1}{33}(\sqrt{33}(5-33^{1/2})^2)\bigr\rbrack, \bigl\lbrack\frac{1}{22}(\sqrt{33}(5+33^{1/2})^2)-\frac{1}{22}(\sqrt{33}(5-33^{1/2})^2), \frac{1}{132}(\sqrt{33}((5+33^{1/2})^2-2)(3+\sqrt{33}))-\frac{1}{132}(\sqrt{33}((5-33^{1/2})^2-2)(3-33^{1/2}))\bigr\rbrack\bigr\rbrack
Properties #

Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos\theta) = \cos(n\theta), here at θ=π/3\theta = \pi/3

live ↗
InChebyshevT(6,12)=cos⁡(6π3)\mathrm{ChebyshevT}(6, \frac{1}{2})=\cos(\frac{6π}{3})OutTrue\mathrm{True}

Tn(1)=1T_n(1) = 1

live ↗
InChebyshevT(7,1)\mathrm{ChebyshevT}(7, 1)Out11

Tn(−1)=(−1)nT_n(-1) = (-1)^n

live ↗
InChebyshevT(7,−1)\mathrm{ChebyshevT}(7, -1)Out−1-1

Odd degree, odd function: Tn(−x)=(−1)nTn(x)T_n(-x) = (-1)^n T_n(x)

live ↗
InChebyshevT(5,−13)=−ChebyshevT(5,13)\mathrm{ChebyshevT}(5, -\frac{1}{3})=-\mathrm{ChebyshevT}(5, \frac{1}{3})OutTrue\mathrm{True}

A negative order folds: T−n=TnT_{-n} = T_n

live ↗
InChebyshevT(−3,x)\mathrm{ChebyshevT}(-3, x)Out4x3−3x4x^3-3x

Tn(x)2−(x2−1) Un−1(x)2=1T_n(x)^2 - (x^2 - 1)\,U_{n-1}(x)^2 = 1, here at x=3x = 3. See ChebyshevU

live ↗
InChebyshevT(4,3)2−8ChebyshevU(3,3)2\mathrm{ChebyshevT}(4, 3)^2-8\mathrm{ChebyshevU}(3, 3)^2Out11

T0(1)=1T_0(1) = 1

live ↗
InChebyshevT(0,1)\mathrm{ChebyshevT}(0, 1)Out11

Known value · Wolfram MathematicalFunctionData, ChebyshevT

T1T_1 at infinity grows without bound

live ↗
InChebyshevT(1,∞)\mathrm{ChebyshevT}(1, ∞)Out∞∞

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial

Likewise toward negative infinity

live ↗
InChebyshevT(1,−∞)\mathrm{ChebyshevT}(1, -∞)Out−∞-∞

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial

live ↗
InChebyshevT(2,∞)\mathrm{ChebyshevT}(2, ∞)Out∞∞

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial

live ↗
InChebyshevT(2,−∞)\mathrm{ChebyshevT}(2, -∞)Out∞∞

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial

live ↗
In∑k=02ChebyshevT(k,12)ChebyshevT(k,2)\sum_{k=0}^2\mathrm{ChebyshevT}(k, \frac{1}{2})\mathrm{ChebyshevT}(k, 2)Out−32-\frac{3}{2}

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial, Christoffel‐Darboux formula

live ↗
In∑k=03ChebyshevT(k,12)ChebyshevT(k,2)\sum_{k=0}^3\mathrm{ChebyshevT}(k, \frac{1}{2})\mathrm{ChebyshevT}(k, 2)Out−552-\frac{55}{2}

Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial, Christoffel‐Darboux formula

About
Examples37
Checked againstWolfram Language 35 agree2 differ
CrosswalkWikipediaMathWorldDLMFFungrimFungrim entry ×34Wolfram Language

Implementation

primitive · kernela kernel — an algorithm over mutable state that would not be readable as a tree

nativeenginetypescriptpackages/symbols/analysis/analytic/src/chebyshev.ts
mappedexternalwolfram / mpmath / sympypackages/oracle/src/mappings.ts

ChebyshevT[n, x]; mpmath.chebyt(n, x); sympy.chebyshevt(n, x).

See also: ChebyshevU, LegendrePolynomial, Cos