Sum of Series of Product of Power and Cosine

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $r \in \R$ such that $\size r < 1$.

Then:

\(\ds \sum_{k \mathop = 0}^n r^k \map \cos {k x}\) \(=\) \(\ds 1 + r \cos x + r^2 \cos 2 x + r^3 \cos 3 x + \cdots + r^n \cos n x\)
\(\ds \) \(=\) \(\ds \dfrac {r^{n + 2} \cos n x - r^{n + 1} \map \cos {n + 1} x - r \cos x + 1} {1 - 2 r \cos x + r^2}\)


Proof

From Euler's Formula:

$e^{i \theta} = \cos \theta + i \sin \theta$

Hence:

\(\ds \sum_{k \mathop = 0}^n r^k \map \cos {k x}\) \(=\) \(\ds \map \Re {\sum_{k \mathop = 0}^n r^k e^{i k x} }\)
\(\ds \) \(=\) \(\ds \map \Re {\sum_{k \mathop = 0}^n \paren {r e^{i x} }^k}\)
\(\ds \) \(=\) \(\ds \map \Re {\frac {1 - r^{n + 1} e^{i \paren {n + 1} x} } {1 - r e^{i x} } }\) Sum of Infinite Geometric Sequence: valid because $\size r < 1$
\(\ds \) \(=\) \(\ds \map \Re {\frac {\paren {1 - r^{n + 1} e^{i \paren {n + 1} x} } \paren {1 - r e^{-i x} } } {\paren {1 - r e^{-i x} } \paren {1 - r e^{i x} } } }\)
\(\ds \) \(=\) \(\ds \map \Re {\frac {r^{n + 2} e^{i n x} - r^{n + 1} e^{i \paren {n + 1} x} - r e^{-i x} + 1} {1 - r \paren {e^{i x} + e^{- i x} } + r^2} }\)
\(\ds \) \(=\) \(\ds \map \Re {\frac {r^{n + 2} \paren {\cos n x + i \sin n x} - r^{n + 1} \paren {\map \cos {n + 1} x + i \map \sin {n + 1} x} - r \paren {\cos x - i \sin x} + 1} {1 - 2 r \cos x + a^2} }\) Euler's Formula and Euler's Formula: Corollary
\(\ds \) \(=\) \(\ds \dfrac {r^{n + 2} \cos n x - r^{n + 1} \map \cos {n + 1} x - r \cos x + 1} {1 - 2 r \cos x + r^2}\) after simplification

$\blacksquare$


Also see


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Sum_of_Series_of_Product_of_Power_and_Cosine&oldid=653411"