You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A polynomial map is a function $F: S^n \rightarrow S^n$ where each component of $F(x)$ is a polynomial in the coordinates of $x$.
The goal is to construct such maps where $F(x)$ remains on $S^n$ for all $x \in S^n$. Caveat: $F(x)$ is not allowed to be a linear transformation and must have degree $m$.
Quadratic Maps: The Starting Point
Intuition: in $S^1$, the unit circle, think of doubling angles:
Can we construct a degree- $m$ polynomial map $F: S^n \rightarrow S^n$ for any positive integer $m$? Yes! The key lies in leveraging Chebyshev polynomials and trigonometric identities. We see what we did above is a special case of this, because we are now not doubling angles, but multiplying them by $m$.
Chebyshev Polynomials Connection
Chebyshev Polynomials of the First Kind ($T_m$):
$$
T_m(x) = \cos(m \arccos x)
$$
Properties:
$T_m(\cos \theta) = \cos m\theta$
They are polynomials of degree $m$.
Now for $x = (x_0, x_1, \dots, x_n) \in S^n$, define:
where $U_{m-1}$ is the Chebyshev polynomial of the second kind.
Why Does This Work?
Degree $m$: Both $T_m$ and $U_{m-1}$ are polynomials of degrees $m$ and $m-1$, respectively.
Maps $S^n$ to $S^n$: Using trigonometric identities, we can show that $|F(x)| = 1$. For $x_0 = \cos \theta$, and $1 - x_0^2 = \sin ^2 \theta$, the map essentially multiplies the angle $\theta$ by $m$.