I'm reading a proof of linear recurrence relation with constant coefficients of order $k$, which gives the formula of $a_n$ when some roots of its characteristic equation has multiplicity $\ge2$ . In one step it says:
\begin{align*} &\textrm{Since }\alpha_i\textrm{ satisfy}\\ &C_n\alpha^n+C_{n-1}\alpha^{n-1}+\dots+C_{n-k}\alpha^{n-k}=0,\,\,\,\,\,\,\,\textrm{(A)}\\ &\textrm{and }\alpha_i\textrm{ has multiplicity }m_i,\textrm{it satisfies up to }(m_i-1)\textrm{-th derivative of (A).} \end{align*}
So what's the reason the last sentence makes sense?
The theorem:
\begin{align*} &\textrm{Let }k\in\mathbb Z^+, C_n,C_{n-1},\cdots,C_{n-k}\in\mathbb R,\textrm{and }C_n,C_{n-k}\not=0;\\ &C_na_n+C_{n-1}a_{n-1}+\dots+C_{n-k}a_{n-k}=f(n)\\ &\textrm{Assume }\alpha_1,\alpha_2,\dots,\alpha_t\textrm{ are its characteristic roots, and }\alpha_i\textrm{ has multiplicity }m_i,\\ & 1\le i\le t\textrm{ and let }u_i(n)=(d_{i_0}+d_{i_1}n+\dots+d_{i_{m_i-1}}n^{m_i-1})\alpha_i^n,\textrm{where }d_k\textrm{ are any constant, then}\\ &a_n=u_1(n)+u_2(n)+\dots+u_t(n). \end{align*}
Let r be a root of p(x) in R[x] with multiplicity k.
Then p(x) = (x - r)$^k$ q(x) for some q(x) in R[x].
By induction show r is a root of the j-th derivative
for all j's upto k - 1.