Math 2.0

definition

Polynomial of an endomorphism

Definition

Let FF be a field, let VV be a vector space over FF, and let T ⁣:V→VT \colon V \to V be an endomorphism. Let p(x)=c0+c1x+⋯+cdxdp(x) = c_0 + c_1 x + \cdots + c_d x^d be a polynomial in F[x]F[x]. The value of pp at TT is the endomorphism p(T)=c0id⁡V+c1T+c2T2+⋯+cdTd,p(T) = c_0 \id_V + c_1 T + c_2 T^2 + \cdots + c_d T^d, where TkT^k is the composition of kk copies of TT. For an n×nn \times n matrix AA, p(A)=c0In+c1A+⋯+cdAdp(A) = c_0 I_n + c_1 A + \cdots + c_d A^d in the same way.

Remarks

The map p↦p(T)p \mapsto p(T) is a homomorphism of algebras F[x]→End⁡F(V)F[x] \to \End_F(V): (p+q)(T)=p(T)+q(T)(p + q)(T) = p(T) + q(T) and (pq)(T)=p(T)q(T)(pq)(T) = p(T) q(T). In particular, any two polynomials in TT commute. If T(v)=λvT(v) = \lambda v, then p(T)(v)=p(λ)vp(T)(v) = p(\lambda) v.

Explanations

L1 human

We can put a matrix into a polynomial, because matrices can be added, scaled and multiplied. The constant term becomes a multiple of the identity matrix. For example, if p(x)=x2−3x+2p(x) = x^2 - 3x + 2, then p(A)=A2−3A+2Ip(A) = A^2 - 3A + 2I.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Vector space definition
  2. Linear map definition
  3. Endomorphism definition
  4. Polynomial of an endomorphism definition

What depends on this

11 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Matrix_polynomial, lead section