Fundamental Concepts and Operations of Matrices

Fundamental Concepts of Matrices and Basic Operations

The study of matrices forms the backbone of Finite Mathematics, providing a structured way to handle large sets of data and solve systems of linear equations. This guide covers the basic components of matrices, their various classifications based on dimensions and elements, and the mathematical operations that can be performed upon them.

Common Types of Matrices Categorized by Dimensions

Matrices are often classified by the relationship between the number of rows (mm) and the number of columns (nn).

a. Row Matrix: A row matrix is characterized by having only one row and any number of columns. Its dimension is represented as 1×n1 \times n. For example, the matrix A=[135]A = [1 \, -3 \, 5] is a row matrix because it consists of a single horizontal line of elements.

b. Rectangular Matrix: A rectangular matrix is one where the number of rows is not equal to the number of columns (mnm \neq n). An example is a 2×32 \times 3 matrix, such as B=(1amp;0amp;32amp;4amp;5)B = \begin{pmatrix} 1 & 0 & -3 \\ 2 & 4 & 5 \end{pmatrix}.

c. Square Matrix: A square matrix occurs when the number of rows is exactly equal to the number of columns (m=nm = n). For example, a 2×22 \times 2 matrix is considered square, such as D=(3amp;21amp;4)D = \begin{pmatrix} 3 & 2 \\ 1 & 4 \end{pmatrix}.

Special Square Matrices and the Principal Diagonal

Square matrices contain a specific feature known as the principal diagonal (or main diagonal), which runs from the top-left corner to the bottom-right corner. Several special matrices are defined based on the configuration of elements relative to this diagonal.

a. Diagonal Matrix: This is a square matrix where every element outside the main diagonal is exactly zero. The elements on the diagonal itself can be any number, including zero. Example: E=(3amp;0amp;00amp;7amp;00amp;0amp;1.5)E = \begin{pmatrix} 3 & 0 & 0 \\ 0 & -7 & 0 \\ 0 & 0 & 1.5 \end{pmatrix}

b. Scalar Matrix: A scalar matrix is a specific type of diagonal matrix where all the elements on the principal diagonal are equal to the same non-zero scalar value. Example: F=(5amp;0amp;00amp;5amp;00amp;0amp;5)F = \begin{pmatrix} 5 & 0 & 0 \\ 0 & 5 & 0 \\ 0 & 0 & 5 \end{pmatrix}

c. Identity Matrix (or Unit Matrix): This is a scalar matrix where all elements on the principal diagonal are exactly equal to 11. It is typically denoted by the symbol II. In matrix algebra, the identity matrix functions similarly to the number 11 in regular multiplication: multiplying any matrix by the identity matrix leaves the original matrix unchanged. Example of a 3×33 \times 3 identity matrix (I3I_3): I3=(1amp;0amp;00amp;1amp;00amp;0amp;1)I_3 = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix}

Triangular Matrices

Triangular matrices are square matrices that contain zeros either above or below the main diagonal.

a. Upper Triangular Matrix: A square matrix where all the elements below the main diagonal are zero. Example: U=(2amp;4amp;10amp;5amp;30amp;0amp;9)U = \begin{pmatrix} 2 & 4 & -1 \\ 0 & 5 & 3 \\ 0 & 0 & 9 \end{pmatrix}

b. Lower Triangular Matrix: A square matrix where all elements above the main diagonal are zero. Example: L=(6amp;0amp;01amp;2amp;04amp;8amp;3)L = \begin{pmatrix} 6 & 0 & 0 \\ 1 & -2 & 0 \\ 4 & 8 & 3 \end{pmatrix}

Matrices Based on Elements and Operations

a. Zero Matrix (or Null Matrix): A matrix where every single element is zero. These can be square or rectangular and are denoted by the letter OO. Example: O=(0amp;0amp;00amp;0amp;0)O = \begin{pmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}

b. Symmetric Matrix: A square matrix that is equal to its own transpose (A=ATA = A^T). This means the elements are mirror images across the main diagonal (aij=ajia_{ij} = a_{ji}). Example: S=(1amp;2amp;32amp;5amp;63amp;6amp;9)S = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 5 & 6 \\ 3 & 6 & 9 \end{pmatrix}

c. Skew-Symmetric Matrix: A square matrix that is equal to its negative transpose (A=ATA = -A^T). For this property to hold, all elements on the main diagonal must be zero (aii=0a_{ii} = 0), and the off-diagonal elements must satisfy aij=ajia_{ij} = -a_{ji}. Example: K=(0amp;2amp;42amp;0amp;34amp;3amp;0)K = \begin{pmatrix} 0 & -2 & 4 \\ 2 & 0 & -3 \\ -4 & 3 & 0 \end{pmatrix}

d. Orthogonal Matrix: A square matrix whose transpose is also its inverse (ATA=AAT=IA^T A = A A^T = I). A classic example involves trigonometric functions: Q=(cos(θ)amp;sin(θ)sin(θ)amp;cos(θ))Q = \begin{pmatrix} \cos(\theta) & -\sin(\theta) \\ \sin(\theta) & \cos(\theta) \end{pmatrix}

Matrix Operations: Addition and Subtraction

To add or subtract matrices, they must have the same dimensions (the same number of rows and columns). This is known as the "Dimension Rule" or the "Must Match" Rule. If the dimensions do not match, the operation is undefined. The "Element-by-Element Rule" dictates that you add or subtract elements residing in the exact same positions.

General Formula for 2×22 \times 2 matrices: If A=(aamp;bcamp;d)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} and B=(eamp;fgamp;h)B = \begin{pmatrix} e & f \\ g & h \end{pmatrix}, then: A+B=(a+eamp;b+fc+gamp;d+h)A + B = \begin{pmatrix} a+e & b+f \\ c+g & d+h \end{pmatrix} AB=(aeamp;bfcgamp;dh)A - B = \begin{pmatrix} a-e & b-f \\ c-g & d-h \end{pmatrix}

Properties of Addition:

  • Commutative Property (A+B=B+AA + B = B + A): The order of addition does not matter. If A=(1amp;23amp;4)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} and B=(0amp;12amp;3)B = \begin{pmatrix} 0 & -1 \\ 2 & 3 \end{pmatrix}, then both A+BA+B and B+AB+A result in (1amp;15amp;7)\begin{pmatrix} 1 & 1 \\ 5 & 7 \end{pmatrix}.

  • Associative Property ((A+B)+C=A+(B+C)(A + B) + C = A + (B + C)): The grouping of matrices does not change the resulting sum.

Scalar Multiplication

Scalar multiplication involves multiplying every element inside a matrix by a single constant number called a scalar (cc). A key property is the Distributive Property: c(A+B)=cA+cBc(A + B) = cA + cB.

Example with scalar c=2c = 2, A=(1amp;23amp;4)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}, and B=(0amp;12amp;3)B = \begin{pmatrix} 0 & -1 \\ 2 & 3 \end{pmatrix}: A+B=(1amp;15amp;7)A + B = \begin{pmatrix} 1 & 1 \\ 5 & 7 \end{pmatrix} 2(A+B)=(2(1)amp;2(1)2(5)amp;2(7))=(2amp;210amp;14)2(A + B) = \begin{pmatrix} 2(1) & 2(1) \\ 2(5) & 2(7) \end{pmatrix} = \begin{pmatrix} 2 & 2 \\ 10 & 14 \end{pmatrix}

On the right side: 2A=(2amp;46amp;8)2A = \begin{pmatrix} 2 & 4 \\ 6 & 8 \end{pmatrix}, 2B=(0amp;24amp;6)2B = \begin{pmatrix} 0 & -2 \\ 4 & 6 \end{pmatrix} 2A+2B=(2+0amp;426+4amp;8+6)=(2amp;210amp;14)2A + 2B = \begin{pmatrix} 2+0 & 4-2 \\ 6+4 & 8+6 \end{pmatrix} = \begin{pmatrix} 2 & 2 \\ 10 & 14 \end{pmatrix}

Matrix Multiplication

To multiply matrix AA by matrix BB (ABAB), you multiply the rows of AA by the columns of BB. Matrix multiplication is fundamentally different from real number multiplication due to the following:

  • Non-Commutative Property (ABBAAB \neq BA): Unlike addition, the order in matrix multiplication is crucial. Changing the order usually results in a different matrix.

  • Multiplicative Identity: Multiplying by the identity matrix (II) leaves the matrix unchanged (AI=IA=AAI = IA = A).

Calculation Example for ABAB versus BABA: Given A=(1amp;23amp;4)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} and B=(0amp;12amp;3)B = \begin{pmatrix} 0 & -1 \\ 2 & 3 \end{pmatrix} AB=((1)(0)+(2)(2)amp;(1)(1)+(2)(3)(3)(0)+(4)(2)amp;(3)(1)+(4)(3))=(4amp;58amp;9)AB = \begin{pmatrix} (1)(0) + (2)(2) & (1)(-1) + (2)(3) \\ (3)(0) + (4)(2) & (3)(-1) + (4)(3) \end{pmatrix} = \begin{pmatrix} 4 & 5 \\ 8 & 9 \end{pmatrix} BA=((0)(1)+(1)(3)amp;(0)(2)+(1)(4)(2)(1)+(3)(3)amp;(2)(2)+(3)(4))=(3amp;411amp;16)BA = \begin{pmatrix} (0)(1) + (-1)(3) & (0)(2) + (-1)(4) \\ (2)(1) + (3)(3) & (2)(2) + (3)(4) \end{pmatrix} = \begin{pmatrix} -3 & -4 \\ 11 & 16 \end{pmatrix}

Transpose of a Matrix

The transpose of a matrix (ATA^T) is formed by flipping a matrix over its diagonal, effectively turning its rows into columns and its columns into rows. If A=(1amp;23amp;4)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}, then AT=(1amp;32amp;4)A^T = \begin{pmatrix} 1 & 3 \\ 2 & 4 \end{pmatrix}.

Transpose of a Product (The "Socks and Shoes" Property): The transpose of a product of two matrices is the product of their transposes in reverse order: (AB)T=BTAT(AB)^T = B^T A^T.

  • Example Left Side: (AB)T(AB)^T from the previous multiplication resulted in AB=(4amp;58amp;9)AB = \begin{pmatrix} 4 & 5 \\ 8 & 9 \end{pmatrix}, so (AB)T=(4amp;85amp;9)(AB)^T = \begin{pmatrix} 4 & 8 \\ 5 & 9 \end{pmatrix}.

  • Example Right Side: BT=(0amp;21amp;3)B^T = \begin{pmatrix} 0 & 2 \\ -1 & 3 \end{pmatrix} and AT=(1amp;32amp;4)A^T = \begin{pmatrix} 1 & 3 \\ 2 & 4 \end{pmatrix}. Multiplying BTATB^T A^T yields: ((0)(1)+(2)(2)amp;(0)(3)+(2)(4)(1)(1)+(3)(2)amp;(1)(3)+(3)(4))=(4amp;85amp;9)\begin{pmatrix} (0)(1) + (2)(2) & (0)(3) + (2)(4) \\ (-1)(1) + (3)(2) & (-1)(3) + (3)(4) \end{pmatrix} = \begin{pmatrix} 4 & 8 \\ 5 & 9 \end{pmatrix}

Contextual Note: Linear Algebra in the Philippine Education System

In the Philippine basic education system, Linear Algebra is not typically taught as a standalone subject in the Department of Education (DepEd) K-12 standard curriculum. Grade 11 STEM students focus on Pre-Calculus and Basic Calculus, while other tracks take General Mathematics. To strengthen this curriculum, it is suggested that Linear Algebra be introduced via enrichment modules that bridge algebra, geometry, physics, and computer science rather than as abstract university-level theory. Key enrichments include systems of linear equations, matrices, matrix operations, and finding the inverse of 2×22 \times 2 matrices.