The question came up under comments to this YT presentation on FFT as a point taken as self evident, and Math SE seems like a natural place to answer it.
The idea is to evaluate a polynomial of degree $n$ at $\pm x_1, \pm x_2, \dots, \pm x_{n/2}$ points.
The example given is $P(x)= 3x^5 + 2x^4 + x^3 + 7 x^2 + 5x +1$ split as $P(x) = (2x^4+7x^2+ 1 x^0) + x (3x^4 + x^2 + 5).$
The next relabeling is confusing:
$$P(x) = (2x^4+7x^2+ 1 x^0) + x (3x^4 + x^2 + 5)=P_{\text{even}}(x^2) + xP_{\text{odd}}(x^2).$$
These even and odd degree polynomials are functions of $x^2$ and hence polynomials of degree $2.$
Here is the transcription of the YT presentation at this time:
... a bonus fact is that since these even and odd polynomials are functions of $x^2$ they are polynomials of degree $2,$ which is a much simpler problem than our original degree $5$ polynomial.
This is totally in line with the points made in comments about the author making reference to the specific example polynomial above. However, it does go on:
Generalizing these observations if we have an $n-1$ degree polynomial that we want to evaluate at $n$ points, we can split the polynomial into even and odd terms with these two smaller polynomials now having degree $n/2 - 1.$
This is also pointed out in the comments, and makes complete sense.
Evidently, the claim is not that $x^4$ is of degree $2,$ or anything outrageous like that. The observation is that this decomposition into even and odd polynomials can be regarded as functions of $x^2$ to make sure it matches the appropriate coefficients, as explained also in this MIT lecture at this juncture:
If the generic polynomial in which the idea is to evaluate sample points is
$$P(x) = a_nx^n+ a_{n-1}x^{n-1}+\cdots+ a_1 x^1+a_0 x^0$$
Then this can be split into
$$P_{\text{even}}(x^2)=\sum_{k=0}^{n/2} a_{2k}(x^2)^k$$
and
$$P_{\text{odd}}(x^2)=\sum_{k=0}^{n/2-1} a_{2k+1}(x^2)^k$$
but to match the coefficients with the powers of $x,$ these even and odd polynomials (of half the degree of the original polynomial) have to be evaluated at $x^2$ when combined as
$$P(x) =P_{\text{even}}(x^2) + xP_{\text{odd}}(x^2).$$
For instance, considering the even polynomial, at $k=n/2,$ the input $x$ would be raised to $(x^2)^{n/2}=x^n$ and this would be matched with the coefficient $a_{n}.$ On the odd side, at $k=n/2-1,$ the coefficient to be matched with $x^{2(n/2-1)}=x^{n-2}$ (of course multiplied by the $x$ in front, yielding $x^{n-1})$ is $a_{2(n/2-1)+1}=a_{n-1}.$