For $p(t)=a_0+a_1t+\cdots+a_kt^k$ and square $A$, define $p(A)=a_0I+a_1A+\cdots+a_kA^k$. The constant term uses $I$, not an all-ones matrix. Polynomial evaluation preserves sums and products for polynomials in the same matrix.
Like how this is organised?
Build your own knowledge tree on knowen.md: notes, decisions and tasks in one connected markdown graph, shared with your team and your AI agents.