2000 character limit reached
How to construct a upper triangular matrix that satisfy the quadratic polynomial equation with different roots
Published 20 Aug 2020 in math.GM | (2008.11272v1)
Abstract: Let $R$ be an associative ring with identity $1$. We describe all matrices in $T_n(R)$ the ring of $n\times n$ upper triangular matrices over $R$ ($n\in \mathbb{N}$), and $T_{\infty}(R)$ the ring of infinite upper triangular matrices over $R$, satisfying the quadratic polynomial equation $x2-rx+s=0$. For such propose we assume that the above polynomial have two different roots in $R$. Moreover, in the case that $R$ in finite, we compute the number of all matrices to solves the matrix equation $A2-rA+sI=0,$ where $I$ is the identity matrix.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.