MathLabs

Problem 2

Let P1(x)=x2−2P_1(x) = x^2 - 2 and Pj(x)=P1(Pj−1(x))P_j(x) = P_1(P_{j-1}(x)) for j=2,3,…j = 2, 3, \ldots. Prove that, for any positive integer nn, the roots of the equation Pn(x)=xP_n(x) = x are all real and distinct.
Step 2 of 6: Induction: the substitution linearizes the whole iteration
In plain words

Once one iteration of P1P_1 is seen to just double the angle, iterating nn times simply doubles the angle nn times over — the nonlinear-looking recursion x2−2x^2-2 becomes the utterly simple operation θ↦2θ\theta\mapsto 2\theta in disguise.

Pn(2cos⁡θ)=2cos⁡(2nθ)P_n(2\cos\theta) = 2\cos(2^n\theta)
Detailed analysis

By induction on nn, using Step 1 for the base case and Pn(2cos⁡θ)=P1(Pn−1(2cos⁡θ))=P1(2cos⁡(2n−1θ))=2cos⁡(2⋅2n−1θ)=2cos⁡(2nθ)P_{n}(2\cos\theta)=P_1\big(P_{n-1}(2\cos\theta)\big)=P_1\big(2\cos(2^{n-1}\theta)\big)=2\cos(2\cdot 2^{n-1}\theta)=2\cos(2^n\theta) for the inductive step, one obtains Pn(2cos⁡θ)=2cos⁡(2nθ)P_n(2\cos\theta)=2\cos(2^n\theta) for every n≥1n\ge1.