Consider the family $f_n(x)$ of functions of $x$ for $0\leq x\leq1$, each indexed by a variable $n \in \mathbb{N}$, described by the following equation: $$f_n(x) = \sin^2\left(n \arcsin\left(\sqrt{x}\right)\right)$$ Evaluation in numerical algebra programs yields the following polynomial forms of each function $f_n(x)$ for the first few $n$:
- $f_1(x) = x$
- $f_2(x) = 4x - 4x^2$
- $f_3(x) = 16 x^3 - 24 x^2 + 9 x$
- $f_4(x) = -64 x^4 + 128 x^3 - 80 x^2 + 16 x$
and so on.
Is there any way to analytically derive the polynomial form of this family of functions in terms of $n$ and $x$ (i.e., $f_n(x) = g(n,x)$ where $g$ is a polynomial in $x$)? Or perhaps this family of polynomials is related to another "named" family of polynomials under an appropriate transformation?
COMMENT: The "Chebyshev-like" qualifier in the title comes from the fact that the Chebyshev polynomials $T_n(x)$ can be defined by a similar trigonometric identity: $T_n(x) = \cos(n\arccos(x))$.