Math 2.0

Associative rings and algebras Definition

Generic matrix algebra

Builds on FieldPolynomial ringSquare matrixAssociative algebraFree algebraPolynomial identity ring

Definition

Let kk be a field and let m,n≥1m, n \ge 1 be integers. Let P=k[xij(l):1≤l≤m, 1≤i,j≤n]P = k\big[x^{(l)}_{ij} : 1 \le l \le m, \ 1 \le i, j \le n\big] be the polynomial ring in mn2m n^2 commuting variables. For 1≤l≤m1 \le l \le m, the generic matrix Xl∈Mn(P)X_l \in M_n(P) is the matrix whose (i,j)(i, j) entry is xij(l)x^{(l)}_{ij}. The generic matrix algebra k{X1,…,Xm}k\{X_1, \ldots, X_m\} is the kk-subalgebra of Mn(P)M_n(P) generated by X1,…,XmX_1, \ldots, X_m and the identity matrix.

Remarks

The algebra k{X1,…,Xm}k\{X_1, \ldots, X_m\} is an associative algebra over kk, and it is a subring of Mn(P)M_n(P), so it satisfies every polynomial identity of Mn(P)M_n(P). Let π ⁣:k⟨x1,…,xm⟩→k{X1,…,Xm}\pi \colon k\langle x_1, \ldots, x_m \rangle \to k\{X_1, \ldots, X_m\} be the homomorphism from the free algebra with π(xl)=Xl\pi(x_l) = X_l. If kk is infinite, the kernel of π\pi is the set of polynomial identities of Mn(k)M_n(k) in mm variables. Indeed, f(X1,…,Xm)=0f(X_1, \ldots, X_m) = 0 means that each entry of the matrix f(X1,…,Xm)f(X_1, \ldots, X_m) is the zero polynomial. Over an infinite field, a polynomial is zero exactly when it vanishes at all points, that is, when f(a1,…,am)=0f(a_1, \ldots, a_m) = 0 for all al∈Mn(k)a_l \in M_n(k).

Example: for n=1n = 1 the generic matrices are the variables x11(l)x^{(l)}_{11}, and k{X1,…,Xm}k\{X_1, \ldots, X_m\} is the polynomial ring in mm variables.

Non-example: for n≥2n \ge 2, the scalar matrix x11(1)Ix^{(1)}_{11} I lies in Mn(P)M_n(P) but not in k{X1,…,Xm}k\{X_1, \ldots, X_m\}. The entries of f(X1,…,Xm)f(X_1, \ldots, X_m) have degree-11 part equal to the corresponding entry of ∑lclXl\sum_l c_l X_l, where clc_l is the coefficient of xlx_l in ff. If f(X1,…,Xm)=x11(1)If(X_1, \ldots, X_m) = x^{(1)}_{11} I, comparing the (1,1)(1, 1) entries gives c1=1c_1 = 1, and comparing the (2,2)(2, 2) entries gives ∑lclx22(l)=x11(1)\sum_l c_l x^{(l)}_{22} = x^{(1)}_{11}, which is impossible. So the subalgebra generated by the XlX_l over the commutative ring PP is strictly larger than the generic matrix algebra.

For n≥2n \ge 2 and m≥2m \ge 2, the generic matrix algebra is a noncommutative domain.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Associative algebra concept
  2. Field concept
  3. Free algebra concept
  4. Polynomial identity ring concept
  5. Polynomial ring concept
  6. Square matrix concept
  7. Generic matrix algebra definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Generic_matrix_ring
About this page
TagARGNTXTAST
URIm2://ARGNTXTAST
Kinddefinition
WritingW0 stub
MSC16R30, 16R10
DefinesGeneric matrix algebra
UsesField, Polynomial ring, Square matrix, Associative algebra, Free algebra, Polynomial identity ring

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

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

What links here

No page links to this page yet.