TITLE: Counterpart of cyclotomic polynomials for elliptic divisibility sequences
QUESTION [18 upvotes]: Let $(U_n)_{n \in \mathbb{N}}$ be a Lucas sequences given by
$$U_0 = 0,\quad U_1 = 1,\quad U_n = P U_{n - 1} - Q U_{n-2},$$
where $P,Q$ are integers with $P^2 - 4Q \neq 0$. It is well known that the following product formula holds
$$U_n = \prod_{d \mid n} \Phi_d(\alpha, \beta) ,$$
where $\Phi_d(\alpha, \beta) \in \mathbb{Z}$,
$$\Phi_k(X,Y) := \prod_{\zeta \,\text{ $k$th primitive root of $1$}}(X - \zeta Y)$$
denotes the $k$th homogenous cyclotomic polynomial, and $\alpha,\beta$ are the two roots of $X^2 - PX + Q = 0$.
Let $(D_n)_{n \in \mathbb{N}}$ be an elliptic divisibility sequence, that is, there exists an elliptic curve $E$ over the rationals with a point $P$ of infinite order, and $D_n$ is determined by
$$nP = \left(\frac{A_n}{D_n^2}, \frac{B_n}{D_n^3}\right) ,$$
where $A_n, B_n$ are integers with $\gcd(A_n, D_n) = \gcd(B_n, D_n) = 1$.
As far as I understand, elliptic divisibility sequences have many properties in common with Lucas sequences. For example, like Lucas sequences, they are strong divisibility sequences and (under certain condition) satisfy a primitive divisor theorem.
My question is if there exists a counterpart of cyclotomic polynomials for elliptic divisibility sequences, that is, some quantities $\Psi_d \in \mathbb{Z}$ such that a product formula
$$D_n = \prod_{d \mid n} \Psi_d ,$$
holds; and, if so, what is known about $\Psi_d$.

REPLY [16 votes]: The counterpart of the cyclotomic polynomials are elliptic division polynomials, which can be defined recursively by a non-linear recursion (usually presented as a pair of recursions, one for odd indices and one for even). They are classical, dating back to the 19th century, and you can find them in many sources, including for example Exercise 3.7 of my Arithmetic of Elliptic Curves. However, if you take an point $P$ on $E(\mathbb Q)$ and write $\,x(nP)=A_n/D_n^2$, then you generally don't quite get $D_1^{(n^2-1)/2}\Psi_n(x(P))$. The issue is that the generic numerator and denominator of $\,x(nP)\,$ can have some cancellation at primes of bad reduction. So assuming that you've taken a minimal Weierstrass equation you should get something like
$$ D_n = \pm D_1^{(n^2-1)/2}\Psi_n(x(P)) \cdot\! \prod_{p\mid \Delta_E} p^{k_{n,p}}, $$
Okay, here $\Psi_n$ is the analogue of $x^n-1$, so now instead of taking $\Psi_n$, which contains the $x$-coordinates of all of the points of order $n$, you can just use only the points whose order is exactly $n$, just as for primitive $n$th roots of unity. Let's call that $\Psi_n^*$, and then
$$ \Psi_n = \prod_{d\mid n} \Psi_n^*. $$
Evaluating this at $P$ and multiplying by $D_1$ to the appropriate power will give a decomposition of the sort you want for $D_n$ except that the primes dividing $\Delta_E$ may not work quite right. There's likely some way to adjust them so that everything works, but I don't know a reference offhand.
Addendum: Let
$$
E[n] = \{P\in E\!: nP = 0\}
\quad\text{and}\quad
E[n]^* = \{P\in E\!: \text{$nP=0$ and $mP\ne0$ for $m<n$}\}.
$$
Then
$$
\Psi_n(X) = \prod_{P\in (E[n]\setminus 0)/\pm1} \bigl(X-x(P)\bigr)
$$
and
$$
\Psi_n^*(X) = \prod_{P\in (E[n]^*\setminus 0)/\pm1} \bigl(X-x(P)\bigr).
$$