9.10 Polynomials and Matrices Tutorial
Matrices
Let \(\mathbb{R}\) be a ring \((\mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C})\).
Definition: A matrix \(A\) with size \(m \times n\) with coefficients in \(\mathbb{R}\) is a rectangular array of elements in \(\mathbb{R}\) of the form
where \(m\) is the number of rows and \(n\) is the number of columns.
The matrix \(A\) is denoted \(A = (a_{ij})_{m \times n}\) and the set of all matrices of size \(m \times n\) with coefficients in \(\mathbb{R}\) is denoted \(M_{m \times n}(\mathbb{R})\).
Definition: The identity matrix of size \(n\), denoted \(I_n\), is defined by \(I_n = (\delta_{ij})_{n \times n}\), where
Examples:
Definition:
Definition: The main diagonal of a square matrix \(A = (a_{ij})_{n \times n}\) consists of the elements \(a_{11}, a_{22}, \dots, a_{nn}\).
Definition: A diagonal matrix is a square matrix \(A = (a_{ij})_{n \times n}\) where \(a_{ij} = 0\) for \(i \neq j\), that is, a square matrix such that the elements outside the main diagonal are \(0\).
Examples:
Definition: A scalar matrix is a diagonal matrix in which the elements of the main diagonal are equal.
Examples:
Definition: Given a matrix \(A = (a_{ij})_{m \times n}\) and \(\alpha \in \mathbb{R}\), the scalar product of \(A\) by \(\alpha\) is the matrix \(\alpha A = (b_{ij})_{m \times n}\) defined by:
Example: If \(A = \begin{pmatrix} 1 & 7 \\ 2 & 6 \\ 3 & 5 \end{pmatrix}\), then \(2A = \begin{pmatrix} 2 & 14 \\ 4 & 12 \\ 6 & 10 \end{pmatrix}\)
Theorem: Let \(A\), \(B\), \(C \in M_{m \times n}(\mathbb{R})\) and let \(\alpha, \beta \in \mathbb{R}\), then:
-
\((A + B) + C = A + (B + C)\)
-
\(A + B = B + A\)
-
\(A + 0 = A\)
-
\(A + (-A) = 0\)
-
\(\alpha(A + B) = \alpha A + \alpha B\)
-
\((\alpha + \beta)A = \alpha A + \beta A\)
-
\((\alpha \beta) A = \alpha (\beta A)\)
-
\(1 A = A\)
Definition: Given two matrices \(A = (a_{ij})_{m \times n}\) and \(B = (b_{jk})_{n \times p}\), the product of \(A\) and \(B\) is the matrix \(AB = (c_{ik})_{m \times p}\) defined by:
for all \(1 \leq i \leq m\), \(1 \leq k \leq p\).
Example: Let \(A = \begin{pmatrix} 1 & 2 & -1 \\ 3 & 1 & 4 \end{pmatrix}\) and \(B = \begin{pmatrix} -2 & 5 \\ 4 & -3 \\ 2 & 1 \end{pmatrix}\), then
Where:
Theorem.
Let \(A\), \(B\), \(C\) be matrices with sizes such that the following equations are valid, then:
(1) \((AB)C = A(BC)\)
(2) \((A + B)C = AC + BC\)
(3) \(A(B + C) = AB + AC\)
(4) \(\alpha(AB) = (\alpha A)B = A(\alpha B)\)
(5) \(AI_n = A = I_mA\) if \(A \in M_{m \times n}(\mathbb{R})\)