4
$\begingroup$

Let $T:\mathbb{C}_n[x] \to \mathbb{C}_n[x]$ be a linear map from the vector space of polynomials of degree $n$ to itself.

Let $S \subset \mathbb{C}$ be a set with at least $3$ points, such that for every polynomial $P$ of degree $n$ with all roots in $S$, then $T(P)$ is either a constant, or has also all roots in $S$.

If $S$ is a finite set, is it necessarily the case that $T[p(x)] = p(\phi(x))$ for some affine map $\phi: \mathbb{C} \to \mathbb{C}$, or a Mobius map as Robert indicate below?

Can we even conclude that $T$ must be invertible?

$\endgroup$
2
  • $\begingroup$ Is $T(S)$ the image of the set of some contant polynomials ? $\endgroup$ Mar 13, 2019 at 12:11
  • $\begingroup$ @Bleuderk It should be T(P). $\endgroup$ Mar 13, 2019 at 20:19

2 Answers 2

4
$\begingroup$

Try $T f(x) = f(-x)$, and $S = \{-1, 0, 1\}$ (or any finite subset of $\mathbb C$ that is invariant under multiplication by $-1$).

EDIT: Of course, the vector space is polynomials of degree $\le n$, not $=n$.

Try $Tf(x) = x^n f(1/x)$, with $S$ the union of $\{0\}$ and the $m$'th roots of unity.

Still more generally, let $g(z) = (a z + b)/(c z + d)$ be a Möbius transformation of finite order (i.e. such that the $m$-fold composition $g^m$ is the identity), take $T f(x) = (c x + d)^n f(g(x))$, and $S \cup \{\infty\}$ a set invariant under $g$.

And if you want something more general than that, I don't know.

$\endgroup$
3
  • $\begingroup$ Ah, right.. but ok, can it be the case that it does not act in a simple diagonal fashion on the monomial basis? $\endgroup$ Feb 13, 2019 at 20:12
  • 1
    $\begingroup$ $Tf(x) = f(2-x)$ and $S = \{0,1,2\}$. $\endgroup$ Feb 14, 2019 at 1:47
  • $\begingroup$ Ah, right - what if T does not induce a rotation/reflection on C? $\endgroup$ Feb 14, 2019 at 12:31
0
$\begingroup$

For $l$ a linear form on this space take $T = j\circ l$ where $j$ is the inclusion of $\mathbb C$ into constant polynomials.

This is not invertible.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.