In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(nx) and cos(nx) with n taking on the values of one or more natural numbers. The coefficients may be taken as real numbers, for real-valued functions. For complex coefficients, there is no difference between such a function and a finite Fourier series.

Trigonometric polynomials are widely used, for example in trigonometric interpolation applied to the interpolation of periodic functions. They are used also in the discrete Fourier transform.

The term trigonometric polynomial for the real-valued case can be seen as using the analogy: the functions sin(nx) and cos(nx) are similar to the monomial basis for polynomials. In the complex case the trigonometric polynomials are spanned by the positive and negative powers of e i x {\displaystyle e^{ix}}, i.e., Laurent polynomials in z {\displaystyle z} under the change of variables x ↦ z := e i x {\displaystyle x\mapsto z:=e^{ix}}.

Definition

Any function T of the form

T ( x ) = a 0 + ∑ n = 1 N a n cos ⁡ n x + ∑ n = 1 N b n sin ⁡ n x ( x ∈ R ) {\displaystyle T(x)=a_{0}+\sum _{n=1}^{N}a_{n}\cos nx+\sum _{n=1}^{N}b_{n}\sin nx\qquad (x\in \mathbb {R} )}

with complex-valued coefficients a n {\displaystyle a_{n}} and b n {\displaystyle b_{n}} and at least one of the highest-degree coefficients a N {\displaystyle a_{N}} and b N {\displaystyle b_{N}} non-zero, is called a complex trigonometric polynomial of degree N. The cosine and sine are the even and odd parts of the exponential of an imaginary variable, cos ⁡ n x = 1 2 ( e i n x + e − i n x ) , sin ⁡ n x = − 1 2 i ( e i n x − e − i n x ) , {\displaystyle \cos nx={\tfrac {1}{2}}{\bigl (}e^{inx}+e^{-inx}{\bigr )},\quad \sin nx=-{\tfrac {1}{2}}i{\bigl (}e^{inx}-e^{-inx}{\bigr )},} so the trigonometric polynomial can alternately be written as T ( x ) = ∑ n = − N N c n e i n x ( x ∈ R ) , {\displaystyle T(x)=\sum _{n=-N}^{N}c_{n}e^{inx}\qquad (x\in \mathbb {R} ),} with complex coefficients ⁠c 0 = a 0 {\displaystyle c_{0}=a_{0}}⁠ and c k = 1 2 ( a k − b k i ) , c − k = 1 2 ( a k + b k i ) , {\displaystyle \quad c_{k}={\tfrac {1}{2}}(a_{k}-b_{k}i),\quad c_{-k}={\tfrac {1}{2}}(a_{k}+b_{k}i),} for all ⁠k {\displaystyle k}⁠ from 1 to ⁠N {\displaystyle N}⁠.

If the coefficients a n {\displaystyle a_{n}} and b n {\displaystyle b_{n}} are real for all ⁠n {\displaystyle n}⁠, then ⁠T {\displaystyle T}⁠ is called a real trigonometric polynomial. When using the exponential form, the complex coefficients satisfy c − n = c ¯ n {\displaystyle c_{-n}={\overline {c}}_{n}} for all n ∈ [ − N , N ] {\displaystyle n\in [-N,N]}.

Properties

A trigonometric polynomial can be considered a periodic function on the real line, with period some divisor of ⁠2 π {\displaystyle 2\pi }⁠, or as a function on the unit circle.

Trigonometric polynomials are dense in the space of continuous functions on the unit circle, with the uniform norm; this is a special case of the Stone–Weierstrass theorem. More concretely, for every continuous function ⁠f {\displaystyle f}⁠ and every ⁠ϵ > 0 {\displaystyle \epsilon >0}⁠ there exists a trigonometric polynomial ⁠T {\displaystyle T}⁠ such that | f ( z ) − T ( z ) | < ϵ {\displaystyle |f(z)-T(z)|<\epsilon } for all ⁠z {\displaystyle z}⁠. Fejér's theorem states that the arithmetic means of the partial sums of the Fourier series of ⁠f {\displaystyle f}⁠ converge uniformly to ⁠f {\displaystyle f}⁠ provided ⁠f {\displaystyle f}⁠ is continuous on the circle; these partial sums can be used to approximate ⁠f {\displaystyle f}⁠.

A trigonometric polynomial of degree ⁠N {\displaystyle N}⁠ has a maximum of ⁠2 N {\displaystyle 2N}⁠ roots in a real interval ⁠[ a , a + 2 π ) {\displaystyle [a,a+2\pi )}⁠ unless it is the zero function.

Fejér-Riesz theorem

The Fejér-Riesz theorem states that every positive real trigonometric polynomial t ( x ) = ∑ n = − N N c n e i n x , {\displaystyle t(x)=\sum _{n=-N}^{N}c_{n}e^{inx},} satisfying t ( x ) > 0 {\displaystyle t(x)>0} for all x ∈ R {\displaystyle x\in \mathbb {R} }, can be represented as the square of the modulus of another (usually complex) trigonometric polynomial q ( x ) {\displaystyle q(x)} such that: t ( x ) = | q ( x ) | 2 = q ( x ) q ( x ) ¯ . {\displaystyle t(x)=|q(x)|^{2}=q(x){\overline {q(x)}}.} Or, equivalently, every Laurent polynomial w ( z ) = ∑ n = − N N w n z n , {\displaystyle w(z)=\sum _{n=-N}^{N}w_{n}z^{n},} with w n ∈ C {\displaystyle w_{n}\in \mathbb {C} } that satisfies w ( ζ ) ≥ 0 {\displaystyle w(\zeta )\geq 0} for all ζ ∈ T {\displaystyle \zeta \in \mathbb {T} } can be written as: w ( ζ ) = | p ( ζ ) | 2 = p ( ζ ) p ( ζ ) ¯ , {\displaystyle w(\zeta )=|p(\zeta )|^{2}=p(\zeta ){\overline {p(\zeta )}},} for some polynomial p ( z ) = p 0 + p 1 z + ⋯ + p N z N , {\displaystyle p(z)=p_{0}+p_{1}z+\cdots +p_{N}z^{N},} and p ( z ) {\displaystyle p(z)} can be chosen to have no zeroes in the open unit disk D {\displaystyle \mathbb {D} }. The Fejér-Riesz theorem arises naturally in spectral theory and the polynomial factorization w ( ζ ) = p ( ζ ) p ( ζ ) ¯ {\displaystyle w(\zeta )=p(\zeta ){\overline {p(\zeta )}}} is also called the spectral factorization (or Wiener-Hopf factorization) of w ( ζ ) {\displaystyle w(\zeta )}.

Notes

  • Böttcher, Albrecht; Halwass, Martin (2013). . Linear Algebra and its Applications. 438 (12): 4760–4805. doi:.
  • Dritschel, Michael A.; Rovnyak, James (2010). "The Operator Fejér-Riesz Theorem". A Glimpse at Hilbert Space Operators. Basel: Springer Basel. doi:. ISBN 978-3-0346-0346-1.
  • Nikol'skii, S. M. (1975). "Trigonometric Polynomials". Approximation of Functions of Several Variables and Imbedding Theorems. Berlin: Springer. Ch. 2, pp. 81–97. doi:. ISBN 978-3-642-65713-9.
  • Powell, Michael J. D. (1981), Approximation Theory and Methods, Cambridge University Press, ISBN 978-0-521-29514-7
  • Riesz, Frigyes; Szőkefalvi-Nagy, Béla (1990). Functional analysis. New York: Dover Publications. ISBN 978-0-486-66289-3.
  • Rudin, Walter (1987), Real and complex analysis (3rd ed.), New York: McGraw-Hill, ISBN 978-0-07-054234-1, MR
  • Simon, Barry (2005), , American Mathematical Society Colloquium Publications, vol. 54, Providence, R.I.: American Mathematical Society, ISBN 978-0-8218-3446-6, MR

See also