Prove that roots of trig polynomials are denumerable

Click For Summary
SUMMARY

The roots of trigonometric polynomials with integer coefficients are denumerable. A trigonometric polynomial is defined as the expression of the form a_0 + ∑^N_{n=1}a_n cos(nx) + ∑^N_{n=1}b_n sin(nx). The proof involves demonstrating that there are a finite number of roots within a single period and that the number of periods is denumerable. This leads to the conclusion that the overall number of roots remains denumerable, leveraging the properties of sine and cosine functions and their relationship with exponential functions.

PREREQUISITES
  • Understanding of trigonometric polynomials
  • Familiarity with the fundamental theorem of algebra
  • Knowledge of periodic functions
  • Basic concepts of cardinality in set theory
NEXT STEPS
  • Study the properties of trigonometric polynomials in detail
  • Learn about the fundamental theorem of algebra and its implications for polynomial roots
  • Explore the concept of periodicity in functions and its mathematical significance
  • Investigate cardinality and countability in set theory
USEFUL FOR

Mathematicians, students studying advanced algebra, and anyone interested in the properties of trigonometric functions and their roots.

Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Prove that the roots of trigonometric polynomials with integer coefficients are denumerable.

Homework Equations

The Attempt at a Solution


The book does not define what a trig polynomial is, but I am assuming it is something of the form ##\displaystyle a_0 + \sum^N_{n=1}a_n \cos (nx) + \sum^N_{n=1}b_n \sin(nx)##. With normal polynomials, we have access to the fundamental theorem of algebra. I am not sure what we have access to; I guess we have access to the fact that the function must be periodic.

My argument might come down to showing that there are a finite number of roots in a period, and showing that there are denumerable periods, which would show that the number of roots is denumerable. Is this on the right track?
 
Physics news on Phys.org
I would do it the other way around. First show that ##\cos nx## and ##\sin nx## have countably many roots, perhaps with Euler's formula, and then show that all possible combinations doesn't change this cardinality, because ##N\cdot \aleph_0 = \aleph_0 + \aleph_0 = \aleph_0 \cdot \aleph_0 = \aleph_0##.
 
  • Like
Likes   Reactions: Mr Davis 97
Mr Davis 97 said:

Homework Statement


Prove that the roots of trigonometric polynomials with integer coefficients are denumerable.

Homework Equations

The Attempt at a Solution


The book does not define what a trig polynomial is, but I am assuming it is something of the form ##\displaystyle a_0 + \sum^N_{n=1}a_n \cos (nx) + \sum^N_{n=1}b_n \sin(nx)##. With normal polynomials, we have access to the fundamental theorem of algebra. I am not sure what we have access to; I guess we have access to the fact that the function must be periodic.

My argument might come down to showing that there are a finite number of roots in a period, and showing that there are denumerable periods, which would show that the number of roots is denumerable. Is this on the right track?

OK, but if you have proved the result for ordinary polynomials, you have it as well for trig polynomials, because
$$\sin (nx) = \frac{1}{2i} \left( (e^{ix})^n - (e^{ix})^{-n} \right)\; \text{and} \; \cos(nx) = \frac{1}{2} \left( (e^{ix})^n + (e^{ix})^{-n} \right)$$
Thus, if ##z = e^{ix}## we have
$$a_0 + \sum_{n=1}^N (a_n \cos(nx) + b_n \sin(nx) ) = \frac{1}{z^N} \left[ a_0 z^N + \sum_{n=1}^N z^{N-n} \left(\frac{1}{2} a_n (z^{2n}+1) + \frac{1}{2i}b_n (z^{2n} - 1) \right) \right] $$
 
Last edited:
  • Like
Likes   Reactions: Mr Davis 97

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 18 ·
Replies
18
Views
5K
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K