[Proof] It is not difficult to prove by mathematical induction that when ∣x∣>2, there must be pn(x)>x. Therefore, we discuss pn(x) on the domain [−2,2], and make the substitution
x=2cost,t∈[0,π]
First, we use mathematical induction to prove that for any natural number n,
pn(2cost)=2cos2nt
In fact, when n=1, we have
p1(2cost)=2(2cos2t−1)=2cos2t
which shows that the proposition is correct.
Assume the proposition is correct for n−1, i.e.,
pn−1(2cost)=2cos2n−1t
By the definition of pn(x), we have
pn(2cost)=p1[pn−1(2cost)]=p1(2cos2n−1t)=2(2cos22n−1t−1)=2cos2nt
Thus, the proposition is also correct for n.
Next, we solve the equation pn(2cost)=2cost,
i.e., solve the equation 2cos2nt=2cost,
Solving it, we get 2nt=±t+2mπ (where m is an integer).
From the above solutions, we take the following 2n values:
tk=2n−12kπ,k=0,1,⋯,2n−1−1sl=2n+12lπ,l=1,2,⋯,2n−1
Obviously, these two sets of values satisfy the following relationships:
0⩽t0<t1<⋯<t2n−1−1<π0<s1<s2<⋯<s2n−1<π
Since the cosine function is monotonically decreasing in the interval [0,π], it follows that 2costk (correspondingly, 2cossl),
k=0,1,⋯,2n−1−1 (correspondingly, l=1,2,⋯,2n−1) are different solutions of the equation.
Next, we prove that tk0=sl0(0⩽k0⩽2n−1−1,1⩽l0⩽2n−1).
If not, from 2n−12k0π=2n+12l0π
we get l0=k02n−12n+1=k0+k02n−12.
Since (2,2n−1)=1, i.e., 2 and 2n−1 are coprime, and l0 is a natural number, it follows that 2n−1 must divide k0, but 0⩽k0⩽2n−1−1, so it must be that k0=0, thus l0=0, which contradicts 1⩽l0.
Therefore, 2costk0=2cosSl0(0⩽k0⩽2n−1−1,1⩽l0⩽2n−1), which means
xk=2costk(k=0,1,⋯,2n−1−1)
and xl=2cosSl(l=1,2,⋯,2n−1) are 2n distinct real solutions of the equation pn(x)=x. And by the definition of pn(x), this equation is a 2n-degree algebraic equation. By the fundamental theorem of algebra, the equation has no other solutions.