解題
(a)
(i) \(T_0(x) = \cos(0) = 1\) and \(T_1(x) = \cos(\arccos x) = x\).
(ii) Let \(\theta = \arccos x\), so \(x = \cos\theta\). Then \(T_2(x) = \cos(2\theta) = 2\cos^2\theta - 1 = 2x^2 - 1\).
(iii) Using \(T_{n+1}(x) = 2x T_n(x) - T_{n-1}(x)\) with \(n=2\), we get \(T_3(x) = 2x T_2(x) - T_1(x) = 2x(2x^2 - 1) - x = 4x^3 - 3x\).
(b)
(i) Adding \(\cos(A+B) = \cos A \cos B - \sin A \sin B\) and \(\cos(A-B) = \cos A \cos B + \sin A \sin B\) yields \(\cos(A+B) + \cos(A-B) = 2\cos A\cos B\).
(ii) Let \(A = n\theta\) and \(B = \theta\), where \(\theta = \arccos x\). Substituting into the identity from (b)(i) gives \(\cos((n+1)\theta) + \cos((n-1)\theta) = 2\cos(n\theta)\cos\theta\). Since \(x = \cos\theta\) and \(T_k(x) = \cos(k\theta)\), we obtain \(T_{n+1}(x) + T_{n-1}(x) = 2x T_n(x)\), which rearranges to \(T_{n+1}(x) = 2x T_n(x) - T_{n-1}(x)\).
(c)
Let \(P(n)\) be the proposition that \(T_n(x)\) is a polynomial of degree \(n\) with leading coefficient \(2^{n-1}\) for \(n \ge 1\).
Base cases:
For \(n=1\), \(T_1(x) = x\), which has degree 1 and leading coefficient \(1 = 2^0\). Thus \(P(1)\) is true.
For \(n=2\), \(T_2(x) = 2x^2-1\), which has degree 2 and leading coefficient \(2 = 2^1\). Thus \(P(2)\) is true.
Inductive step:
Assume \(P(k-1)\) and \(P(k)\) are true for some integer \(k \ge 2\). Then \(T_k(x) = 2^{k-1}x^k + \dots\) and \(T_{k-1}(x)\) has degree \(k-1\).
By the recurrence relation: \(T_{k+1}(x) = 2x T_k(x) - T_{k-1}(x) = 2x(2^{k-1}x^k + \dots) - T_{k-1}(x) = 2^k x^{k+1} + \dots - T_{k-1}(x)\).
Since \(T_{k-1}(x)\) has degree \(k-1\), the term of highest degree in \(T_{k+1}(x)\) is \(2^k x^{k+1}\). Thus \(T_{k+1}(x)\) is a polynomial of degree \(k+1\) with leading coefficient \(2^k\).
Hence, \(P(k) \land P(k-1) \implies P(k+1)\). Since both base cases are true, \(P(n)\) is true for all \(n \ge 1\) by mathematical induction.
(d)
(i) Setting \(T_n(x) = 0 \implies \cos(n \arccos x) = 0\). Let \(\theta = \arccos x\), where \(\theta \in [0, \pi]\). Then \(\cos(n\theta) = 0 \implies n\theta = \frac{\pi}{2} + m\pi\) for \(m \in \mathbb{Z}\). This gives \(\theta = \frac{(2m+1)\pi}{2n}\). Since \(0 \le \theta \le \pi\), we require \(0 \le m \le n-1\). Letting \(k = m+1\), we have \(k \in \{1, 2, \dots, n\}\) and \(\theta_k = \frac{(2k-1)\pi}{2n}\). Thus \(x_k = \cos\left(\frac{(2k-1)\pi}{2n}\right)\).
(ii) There are exactly \(n\) distinct roots because the \(n\) values of \(\theta_k\) are distinct and lie in the interval \((0, \pi)\). Since the cosine function is strictly decreasing (and thus injective) on \([0, \pi]\), each distinct \(\theta_k\) maps to a unique root \(x_k\).
(e)
(i) The local extrema occur when \(\cos(n\theta) = \pm 1\) for \(\theta \in (0, \pi)\), which gives \(n\theta = p\pi \implies \theta = \frac{p\pi}{n}\) for \(p \in \{1, 2, \dots, n-1\}\). The coordinates of these extrema are \(\left(\cos\left(\frac{p\pi}{n}\right), (-1)^p\right)\).
(ii) For \(y = T_4(x)\), the roots are \(x_k = \cos\left(\frac{(2k-1)\pi}{8}\right)\) (approx. \(\pm 0.924\), \(\pm 0.383\)). The local extrema in \((-1, 1)\) are \(\left(\pm\frac{\sqrt{2}}{2}, -1\right)\) and \((0, 1)\). The boundaries are \((-1, 1)\) and \((1, 1)\). The graph is a symmetric 'W' shape.
(f)
Let \(x = \cos\theta \implies dx = -\sin\theta d\theta\). The interval \([-1, 1]\) maps to \([\pi, 0]\).
\(\int_{-1}^{1} \frac{T_n(x)T_m(x)}{\sqrt{1-x^2}} dx = \int_{\pi}^{0} \frac{\cos(n\theta)\cos(m\theta)}{\sin\theta} (-\sin\theta d\theta) = \int_{0}^{\pi} \cos(n\theta)\cos(m\theta) d\theta\).
Using \(\cos(n\theta)\cos(m\theta) = \frac{1}{2}(\cos((n+m)\theta) + \cos((n-m)\theta))\), since \(n \neq m\), the integral becomes \(\frac{1}{2} \left[ \frac{\sin((n+m)\theta)}{n+m} + \frac{\sin((n-m)\theta)}{n-m} \right]_0^\pi = 0\).
評分準則
(a)
(i) \(T_0(x) = 1\) [A1], \(T_1(x) = x\) [A1]
(ii) Let \(\theta = \arccos x\) [M1], \(T_2(x) = \cos(2\theta) = 2\cos^2\theta - 1 = 2x^2-1\) [AG] [A1]
(iii) Using recurrence: \(T_3(x) = 2x T_2(x) - T_1(x) = 2x(2x^2-1) - x\) [M1] \(= 4x^3 - 3x\) [A1]
(b)
(i) Expanding both cosine terms [M1], and adding them yields \(2\cos A\cos B\) [A1]
(ii) Substituting \(A = n\theta\) and \(B = \theta\) [M1], rewriting in terms of \(T_n(x)\) [M1], showing the algebraic step to get the recurrence [AG] [A1]
(c)
Showing base cases: \(P(1)\) is true [A1], \(P(2)\) is true [A1].
Stating the induction hypothesis for \(k-1\) and \(k\) [M1].
Writing \(T_{k+1}(x) = 2x T_k(x) - T_{k-1}(x)\) [M1] and analyzing leading term: \(2x(2^{k-1}x^k) = 2^k x^{k+1}\) [A1].
Explaining that because \(T_{k-1}(x)\) has lower degree, the leading coefficient is unchanged [R1] and concluding the proof [R1].
(d)
(i) Setting \(\cos(n\theta) = 0\) [M1], finding general solutions for \(\theta\) in \([0, \pi]\) [M1], showing \(x_k = \cos\left(\frac{(2k-1)\pi}{2n}\right)\) [A1].
(ii) Reasoning that there are exactly \(n\) distinct roots because \(\theta_k\) are distinct in \((0, \pi)\) and \(\cos\) is injective on this interval [R1].
(e)
(i) Setting \(\cos(n\theta) = \pm 1\) [M1], finding coordinates: \(\left(\cos\left(\frac{p\pi}{n}\right), (-1)^p\right)\) [A1].
(ii) Correct 'W' shape symmetric about y-axis [A1], correct coordinates of intercepts and extrema shown on sketch [A1].
(f)
Performing substitution \(x = \cos\theta\) and correctly transforming differential and limits [M1].
Simplifying integrand to \(\cos(n\theta)\cos(m\theta)\) [A1].
Applying product-to-sum identity [M1].
Integrating to show result is 0 [A1].