Definitions [4]
A matrix is a rectangular arrangement of numbers arranged in rows and columns, enclosed in brackets [ ] or parentheses ( ).
Elements (Entries) of a Matrix
- Each number in a matrix is called an element (or entry).
Rows and Columns
- Horizontal lines → rows
- Vertical lines → columns
Order of a Matrix
- Order = number of rows × number of columns
- Written as m × n and read as “m by n”
Let \[A = [a_{ij}]\] be an \[m \times n\] matrix and \[B = [b_{jk}]\] be an \[n \times p\] matrix.
Then the product C = AB is an \[m \times p\] matrix \[C = [c_{ik}]\], where each entry \[c_{ik}\] is given by:
A square matrix \[A = [a_{ij}]_{n \times n}\] is called skew-symmetric if \[A^T = -A\]
i.e.,\[a_{ij} = -a_{ji}\] for all i and j.
A square matrix \[A = [a_{ij}]_{n \times n}\] is called symmetric if
i.e., \[a_{ij} = a_{ji}\] for all i and j.
Theorems and Laws [3]
If A and B are symmetric matrices, prove that AB – BA is a skew symmetric matrix.
If A and B are symmetric matrices.
∴ A’ = A and B’ = B
(AB – BA) = (AB)’ – (BA)’ ...[∵ (X – Y) = X’ – Y’]
= B’A’ – A’B’ ...[∵ (XY) = Y’X’]
= BA – AB ...[∵ B’ = B, A’ = A]
= –(AB – BA)
∴ AB – BA is a skew symmetric matrix.
Theorem 2: Any square matrix can be expressed as the sum of a symmetric and a skew-symmetric matrix.
Proof: Let A be a square matrix, then we can write
\[\mathrm{A=\frac{1}{2}(A+A^{\prime})+\frac{1}{2}(A-A^{\prime})}\]
From Theorem 1, we know that (A + A′) is a symmetric matrix and (A − A′) is a skew-symmetric matrix.
Multiplying by \[\frac{1}{2}\] does not change these properties.
Since for any matrix A, (kA)′ = kA′, it follows that \[\frac{1}{2}(\mathrm{A}+\mathrm{A}^{\prime})\] is symmetric matrix and \[\frac{1}{2}(\mathrm{A}-\mathrm{A}^{\prime})\] is skew symmetric matrix.
Thus, any square matrix can be expressed as the sum of a symmetric and a skew-symmetric matrix.
Theorem 1: For any square matrix A with real number entries, A + A′ is a symmetric matrix and A − A′ is a skew-symmetric matrix.
Proof:
Part 1: Symmetric Matrix
Let B = A + A′, then
Take transpose on both sides:
B′ = (A + A′)′
= A′ + (A′)′ (as (A + B)′ = A′ + B′)
= A′ + A (as (A′)′ = A)
= A + A′ (as A + B = B + A)
= B
Therefore, B = A + A′ is a symmetric matrix
Part 2: Skew-Symmetric Matrix
Now let
C = A − A′
C′ = (A − A′)′ = A′ − (A′)′ (Why?)
= A′ − A (Why?)
= −(A − A′) = −C
Therefore
C = A − A′ is a skew-symmetric matrix.
Key Points
-
Matrix: A rectangular array of elements.
-
Element: An entry inside a matrix.
-
Order: Size of a matrix written as rows × columns.
-
Row: Horizontal set of elements.
-
Column: Vertical set of elements.
-
aij: Element in the i-th row and j-th column.
-
Matrix multiplication is row-by-column, not term-wise.
-
Product AB exists only if columns of A = rows of B.
-
If A is \[m \times n\] and B is \[n \times p\], then AB is \[m \times p\].
-
In general, \[AB \neq BA\], and sometimes one product may not even be defined.
-
Matrix multiplication is associative and distributive over addition.
-
Identity matrix acts as a multiplicative identity: AI = IA = A.
-
Zero matrix absorbs multiplication: AO = OA = O.
-
A square matrix is symmetric if \[A^T = A\].
-
A square matrix is skew-symmetric if \[A^T = -A\].
-
In a skew-symmetric matrix, all diagonal elements are zero.
-
For any square matrix A:
-
\[A + A^T\] is symmetric.
-
\[A - A^T\] is skew-symmetric.
-
-
Any square matrix A can be written as
-
The decomposition into symmetric and skew-symmetric parts is unique.
