Chapter 3 Matrices (Concepts)

Introduction to Matrices

The study of Matrices originated from the necessity to solve systems of simultaneous linear equations effectively. While various methods existed for solving these equations, the need for a more structured algebraic approach led to the birth of matrix theory. In 1857, the mathematician Arthur Cayley pioneered the development of matrices as a pure algebraic structure, moving beyond just a tool for solving equations to a branch of mathematics in its own right.

In modern times, matrices have become an indispensable tool in diverse fields such as Algebra, Geometry, Statistics, Physics, Chemistry, Psychology, Economics, and Industrial Management. They allow for the compact representation of large sets of data and the simplification of complex linear transformations.

---

Mathematical Representation of Systems

To understand the utility of a matrix, consider a system of simultaneous linear equations in two unknowns $x$ and $y$. For the purpose of this explanation, let us consider the following equations:

This is a system of two linear equations. In such systems, the variables $x$ and $y$ serve as placeholders, and the primary information is contained within the coefficients and the constants. To specify the Left Hand Side (L.H.S.) of this system, we focus on the array of coefficients of $x$ and $y$ in their respective order:

$\begin{bmatrix} 3 & 2 \\ 4 & -5 \end{bmatrix}$

Similarly, the Right Hand Side (R.H.S.) constants provide the necessary information to complete the system specification, which can be represented by the following array:

$\begin{bmatrix} 15 \\ 8 \end{bmatrix}$

Elements, Rows, and Columns

Each array of the above type is known as a Matrix. A matrix is essentially an ordered rectangular array of elements. These elements are the building blocks of the matrix and their specific position is of paramount importance.

Rows of a Matrix

In a matrix, each horizontal line of elements is called a Row. In the coefficient matrix above:

Columns of a Matrix

Each vertical line of elements within the matrix is called a Column. In the coefficient matrix above:

Elements or Entries

The individual numbers, constants, or functions of which a matrix is constituted are called the elements or entries of the matrix. In the examples above, all elements are real numbers, although in advanced studies, elements can be complex numbers or even functions of variables.

---

System of Simultaneous Linear Equations in Three Variables

To understand why matrices are essential, let us look at how they represent mathematical information. A matrix is essentially an ordered rectangular array where the position of every number is fixed and significant. Let us consider a system of simultaneous linear equations in three variables ($x, y, \text{ and } z$):

This system of equations is fully specified by two distinct sets of data: the coefficients of the variables and the constant terms on the right-hand side. We can extract these numbers into rectangular arrays called matrices.

1. The Coefficient Matrix

By extracting the coefficients of $x, y, \text{ and } z$ from the equations above, we form a $3 \times 3$ matrix:

$\begin{bmatrix} 3 & 4 & -5 \\ 2 & -1 & 6 \\ 1 & 3 & 0 \end{bmatrix}$

2. The Constant (R.H.S.) Matrix

The numbers on the right side of the equals sign form a vertical array, often called a Column Matrix:

$\begin{bmatrix} 12 \\ 7 \\ -4 \end{bmatrix}$

Rows, Columns, and Elements

A matrix is defined by its dimensions and its individual components. These are structured as follows:

Rows ($m$): These are the horizontal lines of elements. In our coefficient matrix above, the first row is $[3 \ \ 4 \ \ -5]$, which represents the coefficients of the first equation.

Columns ($n$): These are the vertical lines of elements. The first column is $\begin{bmatrix} 3 \\ 2 \\ 1 \end{bmatrix}$, which represents all the coefficients of the variable $x$.

Elements (or Entries): The individual numbers constituting the matrix are called elements. For example, in the array below, the number $6$ is an element located at the second row and third column.

---

Components of the Matrix System

Component	Visual Orientation	Representation
Row	Horizontal ($\leftrightarrow$)	Equation level data
Column	Vertical ($\updownarrow$)	Variable level data
Element	Specific Point $(\cdot)$	Individual coefficients or constants

---

Formal Definition and Notation of Matrices

A Matrix is a systematic rectangular arrangement of $mn$ elements, which can be numbers (real or complex), variables, or even functions. These elements are organized into $m$ horizontal lines, known as Rows, and $n$ vertical lines, known as Columns. The primary purpose of this arrangement is to represent data or mathematical relationships in a structured format that allows for advanced algebraic operations.

To distinguish a matrix from a simple list of numbers, it is traditionally enclosed within square brackets $[\ ]$ or parentheses $( \ )$. It is standard practice to denote a matrix using a capital letter of the alphabet, such as $A, B, \text{ or } C$.

Order and Size of a Matrix

The Order (or dimension) of a matrix is a fundamental property that defines its size. If a matrix $A$ consists of $m$ rows and $n$ columns, it is said to be of order $m \times n$. This is read as "m by n".

Calculation of Total Elements

The total number of elements or entries present in a matrix is simply the product of the number of rows and the number of columns. If the order of a matrix is $m \times n$, then the total elements are $mn$. For example, if a matrix represents the prices of $5$ different items in $3$ different cities in India, the order would be $5 \times 3$, resulting in a total of $15$ data entries.

General Notation and Element Positioning

To identify a specific element within a matrix, we use a small letter (usually the lowercase version of the matrix name) followed by two suffixes. The first suffix, $i$, represents the row number, and the second suffix, $j$, represents the column number. This is denoted as $a_{ij}$.

The general representation of a matrix $A$ of order $m \times n$ is given as:

$A = \begin{bmatrix} a_{11} & a_{12} & a_{13} & \dots & a_{1n} \\ a_{21} & a_{22} & a_{23} & \dots & a_{2n} \\ a_{31} & a_{32} & a_{33} & \dots & a_{3n} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ a_{m1} & a_{m2} & a_{m3} & \dots & a_{mn} \end{bmatrix}$

For a quick and compact representation, we express it as:

Comparability and Equality of Matrices

Two matrices are not necessarily equal just because they contain the same numbers. The concepts of comparability and equality are defined as follows:

1. Comparable Matrices

Two matrices $A$ and $B$ are said to be Comparable if they possess the same order. This means the number of rows in $A$ must equal the number of rows in $B$, and the number of columns in $A$ must equal the number of columns in $B$. Comparability is a prerequisite for matrix addition and subtraction.

2. Equal Matrices

Two matrices $A = [a_{ij}]$ and $B = [b_{ij}]$ are defined as Equal (written as $A = B$) if and only if they satisfy two strict conditions:

Condition I: They must be of the same order (they are comparable).

Condition II: Their corresponding elements must be identical, meaning $a_{ij} = b_{ij}$ for all possible values of $i$ and $j$.

---

Answer:

---

Classification of Matrices

Matrices are classified into various types based on the arrangement of their elements, the number of rows and columns, and the specific values of their entries. Understanding these classifications is essential for performing advanced operations in linear algebra.

1. Row and Column Matrices

These matrices are characterized by having a single dimension (either one row or one column) and are often referred to as Vectors in physical sciences.

Row Matrix

A matrix is called a Row Matrix if it has exactly one row ($m = 1$) and any number of columns. The general order of a row matrix is $1 \times n$.

For example, if we represent the scores of a batsman in four consecutive matches, we might use a $1 \times 4$ row matrix:

$A = [45 \ \ 12 \ \ 102 \ \ 0]_{1 \times 4}$

Column Matrix

A matrix is called a Column Matrix if it has exactly one column ($n = 1$) and any number of rows. The general order of a column matrix is $m \times 1$.

For example, a price list for three different items can be shown as a $3 \times 1$ matrix:

$B = \begin{bmatrix} 50 \\ 150 \\ 200 \end{bmatrix}_{3 \times 1}$

2. Zero or Null Matrix

A matrix in which every single element is zero is known as a Zero Matrix or Null Matrix. It is generally denoted by the symbol $O$. The order of a zero matrix can be any $m \times n$.

A $2 \times 3$ zero matrix is represented as:

$O_{2 \times 3} = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}$

In matrix algebra, the zero matrix acts as the additive identity, similar to the number $0$ in standard arithmetic.

3. Square Matrix

A matrix in which the number of rows is exactly equal to the number of columns ($m = n$) is called a Square Matrix. A square matrix with $n$ rows and $n$ columns is said to be of order $n$.

The Principal Diagonal

In a square matrix $A = [a_{ij}]_{n \times n}$, the elements $a_{11}, a_{22}, a_{33}, \dots, a_{nn}$ are of particular importance. These elements are called the diagonal elements. The line along which these elements lie is called the Principal Diagonal or the Leading Diagonal.

Consider a square matrix of order 3:

$A = \begin{bmatrix} \mathbf{5} & 2 & 1 \\ 0 & \mathbf{7} & 9 \\ 4 & -3 & \mathbf{2} \end{bmatrix}$

Here, the diagonal elements are $5, 7, \text{ and } 2$. Note that non-square matrices do not have a principal diagonal.

4. Diagonal, Scalar, and Identity Matrices

These are special types of Square Matrices with specific patterns in their diagonal and non-diagonal elements.

Diagonal Matrix

A square matrix is called a Diagonal Matrix if all its non-diagonal elements are zero. That is, $a_{ij} = 0$ whenever $i \ne j$. The diagonal elements themselves may or may not be zero.

$D = \begin{bmatrix} 4 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & -1 \end{bmatrix}$

Scalar Matrix

A diagonal matrix in which all the diagonal elements are equal to the same constant $k$ is called a Scalar Matrix.

$S = \begin{bmatrix} \sqrt{3} & 0 & 0 \\ 0 & \sqrt{3} & 0 \\ 0 & 0 & \sqrt{3} \end{bmatrix}$

Identity Matrix (Unit Matrix)

A scalar matrix in which every diagonal element is exactly $1$ (unity) is called an Identity Matrix. It is denoted by $I_n$, where $n$ is the order. The identity matrix plays a role similar to the number $1$ in scalar multiplication.

$I_3 = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}$

5. Triangular Matrices

A Triangular Matrix is a special type of Square Matrix where the elements on one side of the principal diagonal are all zeros.

Depending on which side of the principal diagonal the zeros are located, triangular matrices are classified into two primary categories: Upper Triangular and Lower Triangular.

(i) Upper Triangular Matrix

A square matrix $A = [a_{ij}]$ is defined as an Upper Triangular Matrix if all the elements below the principal diagonal are zero. In such a matrix, the non-zero elements form a triangle in the upper right portion of the array, including the diagonal itself.

Mathematical Condition

The formal condition for a matrix to be upper triangular is:

This means that whenever the row index ($i$) is greater than the column index ($j$), the entry must be zero. Let us look at a $3 \times 3$ example:

$U = \begin{bmatrix} 1 & 4 & 5 \\ 0 & 2 & 6 \\ 0 & 0 & 3 \end{bmatrix}$

In the above matrix $U$, the elements $a_{21}, a_{31},$ and $a_{32}$ are all zero because for these positions, the row number is greater than the column number.

(ii) Lower Triangular Matrix

A square matrix $A = [a_{ij}]$ is defined as a Lower Triangular Matrix if all the elements above the principal diagonal are zero. Here, the non-zero elements are concentrated in the lower left portion of the matrix.

Mathematical Condition

The formal condition for a matrix to be lower triangular is:

In this case, whenever the row index ($i$) is less than the column index ($j$), the entry must be zero. For example:

$L = \begin{bmatrix} 1 & 0 & 0 \\ 4 & 2 & 0 \\ 5 & 6 & 3 \end{bmatrix}$

In matrix $L$, the elements $a_{12}, a_{13},$ and $a_{23}$ are zero as they satisfy the condition $i < j$.

Strictly Triangular Matrices

A triangular matrix (either upper or lower) is called Strictly Triangular if all the diagonal elements are also zero. Mathematically, this adds the condition:

---

Answer:

Operations on Matrices

Matrix algebra involves several fundamental operations such as Addition, Subtraction, Scalar Multiplication, and Matrix Multiplication. These operations allow us to manipulate linear data sets and solve complex systems of equations. In this section, we shall explore these operations along with their properties and derivations.

---

1. Addition of Matrices

The operation of Addition in matrix algebra is an entry-wise operation. It is the process of combining two matrices to form a single matrix by summing their corresponding elements. However, unlike regular addition of numbers, matrix addition is subject to a strict condition regarding the dimensions of the matrices involved.

Conformability for Addition

Two matrices $A$ and $B$ are said to be conformable or compatible for addition if and only if they are of the same order. This means if matrix $A$ has $m$ rows and $n$ columns, then matrix $B$ must also have exactly $m$ rows and $n$ columns. If the orders are different, their sum is not defined because some elements would lack a corresponding partner for addition.

Mathematical Definition and Derivation

Let $A = [a_{ij}]$ and $B = [b_{ij}]$ be two matrices of the same order $m \times n$. The sum $A + B$ is defined as a new matrix $C = [c_{ij}]$ of the same order $m \times n$, such that every element $c_{ij}$ is the sum of the elements $a_{ij}$ and $b_{ij}$.

For example, if we consider two $2 \times 2$ matrices:

$\begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} + \begin{bmatrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{bmatrix} = \begin{bmatrix} a_{11} + b_{11} & a_{12} + b_{12} \\ a_{21} + b_{21} & a_{22} + b_{22} \end{bmatrix}$

Properties of Matrix Addition

Matrix addition follows several algebraic laws that are similar to the properties of addition of real numbers.

1. Commutative Law

Matrix addition is commutative, meaning the order in which two matrices are added does not change the resulting sum. If $A$ and $B$ are of the same order, then:

Proof: Since the elements of matrices are real numbers and addition of real numbers is commutative ($a_{ij} + b_{ij} = b_{ij} + a_{ij}$), it follows that $A + B = B + A$.

2. Associative Law

Matrix addition is associative. If $A, B,$ and $C$ are three matrices of the same order, the way they are grouped during addition does not affect the result:

3. Existence of Additive Identity

For any $m \times n$ matrix $A$, there exists an $m \times n$ Zero Matrix (denoted by $O$) such that adding it to $A$ leaves $A$ unchanged. The Zero matrix acts as the Additive Identity.

4. Existence of Additive Inverse

For every matrix $A = [a_{ij}]$, there exists a unique matrix $-A = [-a_{ij}]$ (obtained by changing the sign of every element in $A$) such that their sum is the Zero matrix. The matrix $-A$ is called the Negative or Additive Inverse of $A$.

Summary of Addition Rules

Property	Mathematical Expression
Conformability	Order of $A$ = Order of $B$
Identity	$A + O = A$
Inverse	$A + (-A) = O$
Resulting Order	Same as the original matrices

---

Answer:

---

2. Subtraction of Matrices

The Subtraction of matrices is a fundamental operation that involves finding the difference between two matrices by subtracting their corresponding elements. Much like matrix addition, this operation is performed entry-wise and follows specific rules regarding the dimensions of the matrices involved.

Essentially, subtracting a matrix $B$ from a matrix $A$ is equivalent to adding the negative (additive inverse) of matrix $B$ to matrix $A$. This can be expressed as:

Conformability for Subtraction

Two matrices $A$ and $B$ are said to be compatible or conformable for subtraction if and only if they are of the same order. This ensures that every element in the first matrix has exactly one corresponding element in the second matrix to be subtracted from. If the matrices have different dimensions, the subtraction operation is not defined.

Mathematical Definition

Let $A = [a_{ij}]_{m \times n}$ and $B = [b_{ij}]_{m \times n}$ be two matrices of the same order. The difference $A - B$ is a matrix $C = [c_{ij}]_{m \times n}$ where each element is calculated as follows:

In terms of full matrix notation for $2 \times 2$ matrices, it appears as:

$\begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} - \begin{bmatrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{bmatrix} = \begin{bmatrix} a_{11} - b_{11} & a_{12} - b_{12} \\ a_{21} - b_{21} & a_{22} - b_{22} \end{bmatrix}$

---

Answer:

Properties of Matrix Subtraction

Unlike matrix addition, matrix subtraction does not satisfy all algebraic properties. It is important to note the following:

1. Non-Commutative: Matrix subtraction is not commutative. In general, $A - B \ne B - A$.

2. Non-Associative: Matrix subtraction is not associative. In general, $(A - B) - C \ne A - (B - C)$.

Property	Matrix Addition	Matrix Subtraction
Conformability	Same Order Required	Same Order Required
Commutative	Yes ($A+B = B+A$)	No ($A-B \ne B-A$)
Identity	Zero Matrix ($A+O=A$)	No specific Right Identity

Negative of a Matrix

The Negative of a Matrix (also known as the Additive Inverse) is a matrix obtained by changing the sign of every element within the original matrix. If we have a matrix $A$, its negative is denoted by $-A$. This operation is equivalent to multiplying the matrix $A$ by the scalar $-1$.

The primary property of a negative matrix is that when it is added to the original matrix, the result is always a Zero Matrix (Null Matrix) of the same order.

Mathematical Definition

Let $A = [a_{ij}]_{m \times n}$ be a matrix of order $m \times n$. The negative of matrix $A$, denoted by $-A$, is defined as:

In terms of specific elements, if an element in $A$ is positive, it becomes negative in $-A$, and if it is negative, it becomes positive. Zero remains unchanged as $-0 = 0$.

The Additive Property

The relationship between a matrix and its negative is expressed by the following identity:

Role in Matrix Subtraction

The concept of the negative of a matrix allows us to define Subtraction in terms of Addition. Subtracting matrix $B$ from matrix $A$ is mathematically identical to adding the negative of matrix $B$ to matrix $A$.

This shows that the negative matrix is a critical component in understanding the linear structure of matrix algebra.

Answer:

---

3. Scalar Multiplication

In matrix algebra, Scalar Multiplication refers to the operation of multiplying a matrix by a constant number, known as a scalar. Unlike matrix multiplication (which involves two matrices), scalar multiplication involves a single matrix and a real or complex number. This operation is fundamental in scaling the data represented by a matrix, such as adjusting prices in Indian Markets due to inflation or tax changes.

When a matrix is multiplied by a scalar $k$, every individual element within that matrix is multiplied by $k$. This results in a new matrix of the same order as the original.

Mathematical Definition

Let $A = [a_{ij}]_{m \times n}$ be a matrix of order $m \times n$ and let $k$ be any scalar (number). The scalar multiple of $A$ by $k$, denoted by $kA$, is defined as:

For a $2 \times 2$ matrix, the operation looks like this:

$k \begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} = \begin{bmatrix} k \cdot a_{11} & k \cdot a_{12} \\ k \cdot a_{21} & k \cdot a_{22} \end{bmatrix}$

Properties of Scalar Multiplication

Let $A$ and $B$ be two matrices of the same order $m \times n$, and let $k$ and $l$ be any two scalars. The following properties hold true:

1. Distributive Law for Scalars

If two scalars are added and then multiplied by a matrix, it is equal to the sum of the scalar multiples of that matrix.

2. Distributive Law for Matrices

If a scalar is multiplied by the sum of two matrices, it is distributed over each matrix.

3. Associative Law for Scalars

The order in which scalars are multiplied by the matrix does not change the result.

4. Identity and Negative Properties

Multiplying a matrix by $1$ leaves it unchanged, while multiplying by $-1$ gives its Negative Matrix.

Summary Table

Operation	Property Name
$k(A+B) = kA+kB$	Distributivity over Matrix Addition
$(k+l)A = kA+lA$	Distributivity over Scalar Addition
$(kl)A = k(lA)$	Associativity of Scalars
$0 \cdot A = O$	Zero Scalar Property

Answer:

---

Answer:

---

4. Multiplication of Matrices

The multiplication of two matrices is a fundamental operation in linear algebra. Unlike the addition of matrices, which is performed element-wise, matrix multiplication involves a Row-by-Column traversal process. The product of two matrices $A$ and $B$ is defined only when they are compatible for multiplication.

Rule of Compatibility

The product $AB$ of two matrices $A$ and $B$ exists if and only if the number of columns in matrix A is equal to the number of rows in matrix B.

If $A = [a_{ij}]_{m \times n}$ and $B = [b_{jk}]_{n \times p}$, then the resulting product matrix $C = AB$ will have the order $m \times p$.

If the dimensions are represented as $(m \times n)$ and $(p \times q)$, the "inner" numbers ($n$ and $p$) must be equal for the product to be defined, and the "outer" numbers ($m$ and $q$) define the order of the resulting matrix.

General Formula and Derivation

To understand matrix multiplication, we must look at it as a process of finding the dot product of a row from the first matrix and a column from the second matrix. Let us consider two matrices $A$ and $B$ that are compatible for multiplication.

Let $A = [a_{ij}]$ be a matrix of order $m \times n$ and $B = [b_{jk}]$ be a matrix of order $n \times p$. The resulting matrix $C = AB$ will be of order $m \times p$.

Derivation of the $(i, k)^{th}$ Element

The element $c_{ik}$ situated in the $i^{th}$ row and $k^{th}$ column of the product matrix $C$ is derived by taking the entire $i^{th}$ row of matrix A and the entire $k^{th}$ column of matrix B.

Let the $i^{th}$ row of $A$ be: $R_i = \begin{bmatrix} a_{i1} & a_{i2} & a_{i3} & \dots & a_{in} \end{bmatrix}$

Let the $k^{th}$ column of $B$ be: $C_k = \begin{bmatrix} b_{1k} \\ b_{2k} \\ b_{3k} \\ \vdots \\ b_{nk} \end{bmatrix}$

The product $c_{ik}$ is the sum of the products of the corresponding elements:

In compact sigma notation, this is expressed as:

Here, the index $j$ runs from $1$ to $n$. Note that $n$ is the number of columns in A and also the number of rows in B. This shared index $j$ is what allows the elements to pair up perfectly.

Answer:

---

Answer:

---

Answer:

Properties of Matrix Multiplication

Matrix multiplication is a sophisticated operation that does not always follow the intuitive rules of scalar algebra (the algebra of real numbers). Understanding these properties is vital for solving complex problems in competitive exams like JEE Main, JEE Advanced, and NDA. Below is an elaborate explanation of these properties with derivations and examples.

1. Non-Commutativity of Matrix Multiplication

In real numbers, $a \times b$ is always equal to $b \times a$. However, for matrices $A$ and $B$, the product $AB$ is generally not equal to $BA$. This is known as being non-commutative.

Why is it Non-Commutative?

There are three main reasons why $AB \neq BA$:

Case A: Compatibility Issues - The product $AB$ might be defined, but $BA$ might not even exist because the number of columns in $B$ may not match the number of rows in $A$.

Case B: Order Mismatch - Even if both $AB$ and $BA$ exist, the resulting matrices might have different orders. For instance, if $A$ is $2 \times 3$ and $B$ is $3 \times 2$, $AB$ is $2 \times 2$ while $BA$ is $3 \times 3$.

Case C: Element Mismatch - Even if $A$ and $B$ are square matrices of the same order (so $AB$ and $BA$ are both defined and have the same order), the corresponding elements are usually different.

2. Associative Law

The Associative Law is one of the fundamental properties of matrix algebra. It states that when multiplying three or more matrices, the way in which the matrices are grouped (using parentheses) does not change the result, provided the sequence of the matrices remains identical and the dimensions are compatible for multiplication.

Formal Statement

If $A$, $B$, and $C$ are three matrices such that the products $(AB)C$ and $A(BC)$ are defined, then:

Condition for Compatibility (Dimensions)

For the associative law to hold, the dimensions of the matrices must be conformable for multiplication. Let the orders of the matrices be:

$\bullet$ Matrix $A$ of order $m \times n$

$\bullet$ Matrix $B$ of order $n \times p$

$\bullet$ Matrix $C$ of order $p \times q$

In this case, the resulting matrix from both $(AB)C$ and $A(BC)$ will have the order $m \times q$.

Mathematical Derivation

To prove that $(AB)C = A(BC)$, we must show that the corresponding elements of the matrices on both sides are equal.

Let $A = [a_{ij}]_{m \times n}$, $B = [b_{jk}]_{n \times p}$, and $C = [c_{kl}]_{p \times q}$.

Step 1: Elements of $(AB)C$

Let $AB = D$, where $D = [d_{ik}]_{m \times p}$. The element $d_{ik}$ is given by:

$d_{ik} = \sum\limits_{j=1}^{n} a_{ij}b_{jk}$

Now, let $(AB)C = DC = X$, where $X = [x_{il}]_{m \times q}$. The element $x_{il}$ is:

$x_{il} = \sum\limits_{k=1}^{p} d_{ik}c_{kl} = \sum\limits_{k=1}^{p} \left( \sum\limits_{j=1}^{n} a_{ij}b_{jk} \right) c_{kl}$

Step 2: Elements of $A(BC)$

Let $BC = E$, where $E = [e_{jl}]_{n \times q}$. The element $e_{jl}$ is given by:

$e_{jl} = \sum\limits_{k=1}^{p} b_{jk}c_{kl}$

Now, let $A(BC) = AE = Y$, where $Y = [y_{il}]_{m \times q}$. The element $y_{il}$ is:

$y_{il} = \sum\limits_{j=1}^{n} a_{ij}e_{jl} = \sum\limits_{j=1}^{n} a_{ij} \left( \sum\limits_{k=1}^{p} b_{jk}c_{kl} \right)$

Step 3: Conclusion

Since scalar multiplication is associative, $(a_{ij}b_{jk})c_{kl} = a_{ij}(b_{jk}c_{kl})$. Also, the order of summation can be interchanged for finite sums. Therefore, the expressions in (ii) and (iii) are identical.

Significance

The Associative Law allows us to define Powers of a Square Matrix. For a square matrix $A$, we can write:

$\bullet$ $A^2 = A \cdot A$

$\bullet$ $A^3 = (A \cdot A) \cdot A = A \cdot (A \cdot A)$

$\bullet$ In general, $A^n = A \cdot A^{n-1} = A^{n-1} \cdot A$.

In problems involving large matrices, it is often easier to calculate $A(BC)$ if the product $BC$ results in a simpler matrix (like a diagonal or identity matrix) compared to $AB$.

Answer:

3. Distributive Law

The Distributive Law ensures that matrix multiplication interacts with matrix addition in a manner similar to real numbers. It confirms that multiplying a matrix by the sum of two other matrices is equivalent to multiplying them individually and then adding the results. This property is fundamental for expanding algebraic expressions involving matrices, such as $(A + B)^2$ or $(A + B)(A - B)$.

Left Distributive Law

If $A$ is a matrix of order $m \times n$, and $B$ and $C$ are matrices of order $n \times p$, then matrix $A$ distributes over the sum of $B$ and $C$ from the left.

Derivation of Left Distributive Law

Let $A = [a_{ij}]_{m \times n}$, $B = [b_{jk}]_{n \times p}$, and $C = [c_{jk}]_{n \times p}$.

Step 1: Elements of the Left Hand Side (LHS)

Let $S = B + C$. The $(j, k)^{th}$ element of $S$ is given by $s_{jk} = b_{jk} + c_{jk}$.

Now, let $X = A(B + C) = AS$. The $(i, k)^{th}$ element of $X$, denoted by $x_{ik}$, is:

$x_{ik} = \sum\limits_{j=1}^{n} a_{ij}s_{jk}$

By the distributive property of real numbers, $a_{ij}(b_{jk} + c_{jk}) = a_{ij}b_{jk} + a_{ij}c_{jk}$. Thus:

Step 2: Elements of the Right Hand Side (RHS)

The $(i, k)^{th}$ element of $AB$ is $\sum\limits_{j=1}^{n} a_{ij}b_{jk}$ and the $(i, k)^{th}$ element of $AC$ is $\sum\limits_{j=1}^{n} a_{ij}c_{jk}$.

Let $Y = AB + AC$. The $(i, k)^{th}$ element of $Y$, denoted by $y_{ik}$, is:

Comparing (i) and (ii), we see $x_{ik} = y_{ik}$. Hence, $A(B + C) = AB + AC$.

Right Distributive Law

If $A$ and $B$ are matrices of order $m \times n$, and $C$ is a matrix of order $n \times p$, then matrix $C$ distributes over the sum of $A$ and $B$ from the right.

Note: It is crucial to maintain the order. Since matrix multiplication is non-commutative, $(A + B)C$ is not necessarily equal to $CA + CB$. Distribution must happen from the specific side indicated.

---

Answer:

Important Identities Based on Distributive Law

The following identities are valid for square matrices $A$ and $B$ of the same order, provided $AB = BA$ (Commutative case):

Identity Name	Formula for Matrices	Condition
Square of Sum	$(A + B)^2 = A^2 + AB + BA + B^2$	In general
Simplified Square	$(A + B)^2 = A^2 + 2AB + B^2$	Only if $AB = BA$
Difference of Squares	$(A - B)(A + B) = A^2 + AB - BA - B^2$	In general
Identity Product	$(A - I)(A + I) = A^2 - I$	Always (since $AI = IA$)

4. Existence of Multiplicative Identity

In the algebra of real numbers, the number $1$ is called the multiplicative identity because $a \times 1 = 1 \times a = a$ for any real number $a$. In matrix algebra, a similar role is played by the Identity Matrix (also known as the Unit Matrix). For every square matrix, there exists a unique identity matrix that leaves the matrix unchanged upon multiplication.

Definition of Identity Matrix

An identity matrix $I$ is a square matrix in which all the elements of the principal diagonal (from top left to bottom right) are $1$ and all other elements are $0$. It is denoted by $I_n$ where $n$ is the order of the matrix.

Example of Identity Matrices:

$I_2 = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}$, $I_3 = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}$

The Identity Law

For every square matrix $A$ of order $n \times n$, there exists an identity matrix $I$ of order $n \times n$ such that:

Formal Proof (Derivation)

Let $A = [a_{ij}]$ be a square matrix of order $n \times n$ and $I = [\delta_{ij}]$ be the identity matrix of the same order, where $\delta_{ij}$ is the Kronecker delta defined as:

$\delta_{ij} = \begin{cases} 1 & , & i = j \\ 0 & , & i \neq j \end{cases}$

To Prove: $AI = A$

Let the product $AI = C$, where $C = [c_{ij}]$. By the definition of matrix multiplication:

$c_{ij} = \sum\limits_{k=1}^{n} a_{ik}\delta_{kj}$

In the summation $\sum\limits_{k=1}^{n} a_{ik}\delta_{kj}$, the term $\delta_{kj}$ is zero for all values of $k$ except when $k = j$. When $k = j$, $\delta_{jj} = 1$.

$c_{ij} = a_{ij} \cdot \delta_{jj} = a_{ij} \cdot 1 = a_{ij}$

Since the $(i, j)^{th}$ element of $AI$ is the same as the $(i, j)^{th}$ element of $A$ for all $i, j$, we conclude that $AI = A$. Similarly, it can be proven that $IA = A$.

Identity in Non-Square Matrices

If $A$ is a non-square matrix of order $m \times n$, the identity property still holds, but the identity matrices used for left and right multiplication will have different orders:

$\bullet$ Left Identity: $I_m A = A$ (where $I$ is of order $m \times m$)

$\bullet$ Right Identity: $A I_n = A$ (where $I$ is of order $n \times n$)

Answer:

5. Interaction with Scalar Multiplication

In matrix algebra, a scalar is a real number (or complex number) used to scale the elements of a matrix. When a scalar interacts with the product of two matrices, it exhibits a high degree of flexibility. This property, often called Scalar Association, allows the scalar to be shifted freely between the matrices in a product string without affecting the final outcome.

The Scalar Association Law

If $A$ and $B$ are two matrices compatible for multiplication, and $k$ is any scalar, then the following relation holds true:

This property indicates that we can either multiply the matrices first and then scale the result, or scale one of the individual matrices before performing the multiplication.

Mathematical Derivation

To prove this property, we examine the $(i, j)^{th}$ element of the resulting matrices on all sides of the equation.

Given:

Let $A = [a_{ir}]$ be a matrix of order $m \times n$ and $B = [b_{rj}]$ be a matrix of order $n \times p$. Let $k$ be a scalar.

Proof:

The $(i, j)^{th}$ element of the product $AB$ is given by $\sum\limits_{r=1}^{n} a_{ir}b_{rj}$.

Step 1: Elements of $k(AB)$

The $(i, j)^{th}$ element of $k(AB)$ is:

$k \left( \sum\limits_{r=1}^{n} a_{ir}b_{rj} \right) = \sum\limits_{r=1}^{n} k(a_{ir}b_{rj})$

Step 2: Elements of $(kA)B$

The matrix $(kA)$ has elements $[k a_{ir}]$. Thus, the $(i, j)^{th}$ element of $(kA)B$ is:

$\sum\limits_{r=1}^{n} (k a_{ir})b_{rj} = \sum\limits_{r=1}^{n} k(a_{ir}b_{rj})$

Step 3: Elements of $A(kB)$

The matrix $(kB)$ has elements $[k b_{rj}]$. Thus, the $(i, j)^{th}$ element of $A(kB)$ is:

$\sum\limits_{r=1}^{n} a_{ir}(k b_{rj}) = \sum\limits_{r=1}^{n} k(a_{ir}b_{rj})$

Conclusion:

Since the $(i, j)^{th}$ elements of $k(AB)$, $(kA)B$, and $A(kB)$ are identical for all $i$ and $j$, the property is proved.

Distributive Law for Scalars

If $k$ and $l$ are scalars and $A$ is a matrix, then:

Answer:

6. The Zero Product Property

In the algebra of real numbers, one of the most fundamental properties is the Zero Product Law, which states that if the product of two numbers is zero, then at least one of the numbers must be zero. However, in matrix algebra, this intuition fails. Matrix multiplication allows for the existence of "Zero Divisors"—non-zero matrices that, when multiplied, produce a zero matrix ($O$).

Comparison with Real Numbers

To understand why this is a crucial concept, consider the following comparison:

In Real Numbers ($a, b \in \mathbb{R}$):

In Matrices ($A, B \in \text{M}_n$):

This means that $AB$ can be a zero matrix even if both $A$ and $B$ are non-zero matrices.

Why does this happen?

Matrix multiplication involves the dot product of rows of the first matrix and columns of the second matrix. If every row of $A$ is orthogonal to every column of $B$, the resulting product will be a zero matrix, regardless of whether $A$ or $B$ contain non-zero elements.

The Failure of the Cancellation Law

Because the Zero Product Property does not hold, the Cancellation Law also fails in matrix multiplication. In real numbers, if $ab = ac$ and $a \neq 0$, we can "cancel" $a$ to get $b = c$. In matrices, this is not permitted.

Mathematical Explanation:

Suppose $AB = AC$. We can rewrite this as:

$AB - AC = O$

$A(B - C) = O$

Since the product of two non-zero matrices can be zero, $A(B - C) = O$ does not imply that $A = O$ or $B - C = O$. Therefore, $B$ is not necessarily equal to $C$.

Summary Comparison Table

Property	Real Numbers ($a, b, c$)	Matrices ($A, B, C$)
Zero Product	$ab = 0 \Rightarrow a=0 \text{ or } b=0$	$AB = O \nRightarrow A=O \text{ or } B=O$
Cancellation Law	$ab = ac \Rightarrow b = c$ ($a \neq 0$)	$AB = AC \nRightarrow B = C$ (even if $A \neq O$)
Condition for Success	Always holds for non-zero $a$	Only holds if $A$ is Non-Singular ($|A| \neq 0$)

Tip: In multiple-choice questions, look for options that suggest $A$ is "invertible" or "non-singular". If $|A| \neq 0$, then the Cancellation Law does hold because we can multiply both sides by $A^{-1}$. If the determinant is zero, the law fails.

Answer:

---

Comprehensive Comparison: Real Numbers vs. Matrix Algebra

To master the properties of matrix multiplication, it is essential to contrast them with the familiar rules of real number algebra. While many properties are shared, the points of divergence (like non-commutativity and the failure of the cancellation law) are where examiners typically frame tricky questions.

The table below provides an elaborate comparison to help students identify the unique behavior of matrices during multiplication.

Property	Real Numbers ($a, b, c \in \mathbb{R}$)	Matrices ($A, B, C \in \text{M}_n$)
Commutativity	$ab = ba$ (Always)	$AB \neq BA$ (Generally). Exceptions occur with Identity ($I$) or Inverse ($A^{-1}$).
Associativity	$(ab)c = a(bc)$	$(AB)C = A(BC)$ (Always) provided they are compatible.
Distributivity	$a(b+c) = ab + ac$	$A(B+C) = AB + AC$ (Left) and $(A+B)C = AC + BC$ (Right).
Identity Element	$a \cdot 1 = 1 \cdot a = a$	$AI = IA = A$, where $I$ is the Identity Matrix.
Existence of Inverse	$a \cdot \frac{1}{a} = 1$ (exists for all $a \neq 0$)	$AA^{-1} = A^{-1}A = I$ (exists only if $|A| \neq 0$).
Zero Product Property	$ab = 0 \Rightarrow a=0$ or $b=0$	$AB = O$ does not necessarily imply $A=O$ or $B=O$.
Cancellation Law	If $ab = ac$ and $a \neq 0$, then $b=c$	If $AB = AC$, then $B$ is not necessarily equal to $C$.
Binomial Expansion	$(a+b)^2 = a^2 + 2ab + b^2$	$(A+B)^2 = A^2 + AB + BA + B^2$. (Equals $A^2 + 2AB + B^2$ only if $AB=BA$).

---

5. Powers of a Square Matrix and Matrix Polynomials

The concept of Powers of a Square Matrix and Matrix Polynomials is a vital extension of matrix multiplication. These concepts are frequently tested in competitive exams like JEE Main, JEE Advanced, and BITSAT, often involving the calculation of higher powers or finding the roots of a matrix-based equation.

Powers of a Square Matrix

For any square matrix $A$ of order $n$, the product $AA$ is defined. Similarly, higher powers are defined through repeated multiplication. It is important to note that powers are only defined for square matrices because the number of rows must match the number of columns for continuous multiplication.

Definitions:

$\bullet$ $A^1 = A$

$\bullet$ $A^2 = A \cdot A$

$\bullet$ $A^3 = A^2 \cdot A = A \cdot A \cdot A$

$\bullet$ In general, $A^{n+1} = A^n \cdot A$, where $n$ is a positive integer.

$\bullet$ For $n = 0$, $A^0 = I$, where $I$ is the Identity Matrix of the same order as $A$.

Laws of Exponents for Matrices

If $A$ is a square matrix and $m, n$ are non-negative integers, the following laws hold:

Note: Unlike real numbers, $(AB)^n = A^n B^n$ is not always true. It only holds if $A$ and $B$ commute ($AB = BA$).

Matrix Polynomials

Let $f(x) = a_0x^n + a_1x^{n-1} + a_2x^{n-2} + \dots + a_{n-1}x + a_n$ be a polynomial in $x$. If $A$ is a square matrix of order $n$, then the expression $f(A)$ is called a Matrix Polynomial.

Rules for Conversion:

To obtain $f(A)$ from $f(x)$:

1. Replace every occurrence of the variable $x$ with the matrix $A$.

2. Crucially, replace the constant term $a_n$ with $a_n I$, where $I$ is the Identity matrix of the same order as $A$. This is because we cannot add a scalar to a matrix directly.

If $f(A) = O$ (Zero Matrix), then the matrix $A$ is said to be a "root" of the polynomial $f(x)$. This is the basis of the Cayley-Hamilton Theorem used in advanced competitive problems.

Transpose of a Matrix

The Transpose of a Matrix is a fundamental operation in linear algebra where the rows and columns of a given matrix are interchanged. This operation is widely used in solving systems of linear equations, finding the inverse of a matrix, and in various engineering applications.

---

Definition

Let $A = [a_{ij}]$ be an $m \times n$ matrix. Then the transpose of $A$, denoted by $A'$ or $A^T$, is the matrix obtained from $A$ by interchanging its rows and columns. Mathematically, $A'$ is an $n \times m$ matrix such that:

i.e., if $A = [a_{ij}]_{m \times n}$, then $A' = [a_{ji}]_{n \times m}$.

Example:

If $A = \begin{bmatrix} 2 & 7 \\ 5 & 4 \end{bmatrix}_{2 \times 2}$, then $A' = \begin{bmatrix} 2 & 5 \\ 7 & 4 \end{bmatrix}_{2 \times 2}$.

If $B = \begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{bmatrix}_{2 \times 3}$, then $B' = \begin{bmatrix} 1 & 4 \\ 2 & 5 \\ 3 & 6 \end{bmatrix}_{3 \times 2}$.

---

Properties of Transpose

For any matrices $A$ and $B$ of suitable orders, the following properties hold:

(i) Double Transpose

The Double Transpose Property is one of the most intuitive yet essential properties of matrix algebra. It states that if the operation of transposing a matrix (interchanging rows and columns) is applied twice in succession, the matrix returns to its original form. This property is analogous to the double negation law in logic or the reciprocal of a reciprocal in arithmetic.

Mathematical Statement

For any matrix $A$ of order $m \times n$, the transpose of its transpose is equal to the matrix $A$ itself.

Formal Proof (Derivation)

To prove this property rigorously for competitive exams, we use element-wise notation and track the dimensions of the matrix through each transformation.

Step 1: Define the Original Matrix

Let $A$ be a matrix of order $m \times n$ such that:

$A = [a_{ij}]_{m \times n}$

where $1 \le i \le m$ (rows) and $1 \le j \le n$ (columns).

Step 2: First Transpose Operation

By the definition of a transpose, $A'$ is obtained by interchanging rows and columns. Let $A' = B$. Then $B$ is a matrix of order $n \times m$ such that:

$B = [b_{ji}]_{n \times m}$

Step 3: Second Transpose Operation

Now, we take the transpose of $B$ (which is $A'$). Let $B' = C$. Then $C$ is a matrix of order $m \times n$ such that:

$c_{ij} = b_{ji}$

Substituting the value of $b_{ji}$ from above equation:

Step 4: Conclusion

Since the matrix $C$ (which is $(A')'$) and the matrix $A$ have the same order ($m \times n$) and their corresponding elements $c_{ij}$ and $a_{ij}$ are equal for all $i$ and $j$, we conclude:

Significance in Algebraic Simplification

This property is frequently used to simplify complex matrix expressions before solving. For example, when dealing with sums or products:

$\bullet$ To solve for $A$ when $A'$ is given: Just take the transpose of the given matrix.

$\bullet$ Simplifying $(A' + B')'$: Using the sum property and double transpose:

$\bullet$ Simplifying $(B'A')'$: Using the reversal law and double transpose:

Answer:

(ii) Scalar Multiplication

The Scalar Multiplication Property of transposes describes how a constant (scalar) interacts with the transpose operation. It states that when a matrix is multiplied by a scalar and then transposed, the result is the same as transposing the matrix first and then multiplying it by the scalar. In other words, the scalar is "unaffected" by the transpose operation because a scalar does not have rows or columns to interchange.

Mathematical Statement

If $A$ is any matrix of order $m \times n$ and $k$ is a scalar (any real or complex number), then:

Formal Proof (Derivation)

To prove this property, we compare the elements of the matrix on the Left Hand Side (LHS) with the elements of the matrix on the Right Hand Side (RHS).

Step 1: Elements of LHS $(kA)'$

Let $A = [a_{ij}]$ be a matrix of order $m \times n$.

Then, the matrix $kA$ is obtained by multiplying every element of $A$ by $k$:

$kA = [k \cdot a_{ij}]_{m \times n}$

Now, taking the transpose of $kA$, the $(j, i)^{th}$ element of $(kA)'$ is the $(i, j)^{th}$ element of $kA$:

Step 2: Elements of RHS $kA'$

The matrix $A'$ is the transpose of $A$, so its $(j, i)^{th}$ element is $a_{ij}$:

$A' = [a_{ji}]_{n \times m}$ where the $(j, i)^{th}$ element is $a_{ij}$.

Now, multiplying the matrix $A'$ by the scalar $k$, the $(j, i)^{th}$ element of $kA'$ is:

Step 3: Conclusion

Comparing the above results, we see that the corresponding elements of $(kA)'$ and $kA'$ are equal. Also, both matrices have the same order $n \times m$.

Answer:

(iii) Negative of a Matrix

The Negative of a Matrix property of transposes is a specific application of the scalar multiplication property. It states that the operation of taking the negative of a matrix and then transposing it is equivalent to transposing the matrix first and then taking its negative. This property is particularly useful in the study of Skew-Symmetric Matrices and algebraic manipulation of matrix equations.

Mathematical Statement

If $A$ is any matrix of order $m \times n$, and $-A$ represents the negative of matrix $A$ (where every element $a_{ij}$ is replaced by $-a_{ij}$), then:

Formal Proof (Derivation)

The derivation of this property relies on the definition of the negative of a matrix as scalar multiplication by $k = -1$.

Step 1: Expressing Negative as Scalar Multiplication

By definition, the negative of matrix $A$ is obtained by multiplying the matrix by the scalar $-1$.

Step 2: Applying the Scalar Property

We know from the general property of transposes that for any scalar $k$, $(kA)' = kA'$. Substituting $k = -1$ into this property:

Step 3: Conclusion

Since $(-1)A = -A$ and $(-1)A' = -A'$, we can substitute these back into the above equation:

Element-wise Explanation

Let $A = [a_{ij}]$. Then the $(i, j)^{th}$ element of $A$ is $a_{ij}$.

$\bullet$ The $(i, j)^{th}$ element of $-A$ is $-a_{ij}$.

$\bullet$ The $(j, i)^{th}$ element of $(-A)'$ is $-a_{ij}$.

$\bullet$ The $(j, i)^{th}$ element of $A'$ is $a_{ij}$.

$\bullet$ The $(j, i)^{th}$ element of $-A'$ is $-a_{ij}$.

Since the $(j, i)^{th}$ elements of both matrices are identical for all $j$ and $i$, the matrices are equal.

Answer:

(iv) Sum and Difference

The Sum and Difference Property of transposes (often referred to as the Distributive Property over Addition) states that the transpose of the sum of two matrices is equal to the sum of their individual transposes. This linearity property simplifies complex matrix operations, especially when dealing with symmetric and skew-symmetric matrix decompositions.

Mathematical Statement

Let $A$ and $B$ be two matrices of the same order $m \times n$. Then:

For Addition:

For Subtraction:

Formal Proof (Derivation)

To prove these properties, we compare the elements of the matrices on both sides of the equation.

Proof for Addition:

Let $A = [a_{ij}]$ and $B = [b_{ij}]$ be two $m \times n$ matrices.

$\bullet$ LHS: $(A + B)'$

The $(i, j)^{th}$ element of $(A + B)$ is $(a_{ij} + b_{ij})$.

The $(j, i)^{th}$ element of $(A + B)'$ is the $(i, j)^{th}$ element of $(A + B)$.

$\bullet$ RHS: $A' + B'$

The $(j, i)^{th}$ element of $A'$ is $a_{ij}$.

The $(j, i)^{th}$ element of $B'$ is $b_{ij}$.

Since the corresponding elements of $(A + B)'$ and $A' + B'$ are equal for all $j$ and $i$, and both result in an $n \times m$ matrix:

Proof for Subtraction:

The difference $A - B$ can be written as $A + (-1)B$. Using the sum property and the scalar property $(kB)' = kB'$:

$(A - B)' = (A + (-B))'$

$(A - B)' = A' + (-B)'$

Extension to Multiple Matrices

The property is also applicable for the sum of three or more matrices of the same order. For any $k$ matrices $A_1, A_2, \dots, A_k$:

Answer:

(v) Reversal Law for Multiplication

The Reversal Law is one of the most significant properties of the transpose operation. It states that the transpose of the product of two matrices is equal to the product of their transposes taken in the reverse order. This property is a common area of testing in competitive exams because it contradicts the intuitive (but incorrect) assumption that $(AB)' = A'B'$.

Mathematical Statement

If $A$ is an $m \times n$ matrix and $B$ is an $n \times p$ matrix (such that the product $AB$ is defined), then:

Dimensional Compatibility

To understand why the order must reverse, consider the dimensions:

$\bullet$ Order of $A = m \times n \Rightarrow$ Order of $A' = n \times m$

$\bullet$ Order of $B = n \times p \Rightarrow$ Order of $B' = p \times n$

$\bullet$ Order of $AB = m \times p \Rightarrow$ Order of $(AB)' = p \times m$

$\bullet$ Product $A'B'$ is not defined unless $m = p$. However, the product $B'A'$ has dimensions $(p \times n) \times (n \times m)$, resulting in a $p \times m$ matrix, which matches $(AB)'$.

Formal Proof (Derivation)

Let $A = [a_{ij}]$ be an $m \times n$ matrix and $B = [b_{jk}]$ be an $n \times p$ matrix.

Step 1: Element of $(AB)'$

The $(i, k)^{th}$ element of the product $AB$ is given by:

$(AB)_{ik} = \sum\limits_{j=1}^{n} a_{ij}b_{jk}$

By definition of transpose, the $(k, i)^{th}$ element of $(AB)'$ is the $(i, k)^{th}$ element of $AB$:

Step 2: Element of $B'A'$

Let $B' = [d_{kj}]$ where $d_{kj} = b_{jk}$ and $A' = [c_{ji}]$ where $c_{ji} = a_{ij}$.

The $(k, i)^{th}$ element of the product $B'A'$ is:

$(B'A')_{ki} = \sum\limits_{j=1}^{n} d_{kj}c_{ji}$

Substituting the original elements $b_{jk}$ and $a_{ij}$:

Step 3: Conclusion

Comparing the above results, we see that the corresponding elements are identical. Since both matrices also have the same order $p \times m$, we have:

Answer:

---

3. Symmetric and Skew-Symmetric Matrices

A. Symmetric Matrix

A Symmetric Matrix is a special type of square matrix that remains identical even after its rows and columns are interchanged. This property of "self-reflection" across the principal diagonal makes it a cornerstone of linear algebra.

Definition and Condition

A square matrix $A = [a_{ij}]$ is said to be Symmetric if the transpose of the matrix is equal to the matrix itself. In other words, $A$ and its transpose $A'$ are indistinguishable.

Element-wise Property

At the element level, the entry in the $i^{th}$ row and $j^{th}$ column must be exactly equal to the entry in the $j^{th}$ row and $i^{th}$ column for all values of $i$ and $j$.

Structural Characteristics

$\bullet$ Diagonal Elements: There are no restrictions on the diagonal elements ($a_{ii}$). They can be any real or complex number, as they remain in their original positions during a transpose operation.

$\bullet$ Geometric Symmetry: If you imagine the principal diagonal (from top-left to bottom-right) as a mirror, the elements on one side are the mirror images of the elements on the other side.

Standard Symbolic Example ($3 \times 3$):

A general symmetric matrix of order $3$ is often represented in Indian textbooks as:

$A = \begin{bmatrix} a & h & g \\ h & b & f \\ g & f & c \end{bmatrix}$

Notice how $a_{12} = a_{21} = h$, $a_{13} = a_{31} = g$, and $a_{23} = a_{32} = f$.

Answer:

B. Skew-Symmetric Matrix

A Skew-Symmetric Matrix (also known as an anti-symmetric matrix) is a square matrix whose transpose is equal to its negative. This property results in a unique structure where elements reflected across the principal diagonal have equal magnitude but opposite signs, and the principal diagonal itself consists entirely of zeros.

Definition and Condition

A square matrix $A = [a_{ij}]$ is called Skew-Symmetric if it satisfies the following matrix equation:

Element-wise Property

In terms of individual elements, for all values of $i$ and $j$, the entry in the $i^{th}$ row and $j^{th}$ column must be the negative of the entry in the $j^{th}$ row and $i^{th}$ column.

The Principal Diagonal Property

A fundamental characteristic of every skew-symmetric matrix is that all its diagonal elements are zero.

Proof:

Given: $A$ is a skew-symmetric matrix, therefore $a_{ij} = -a_{ji}$ for all $i, j$.

For the elements of the principal diagonal, the row index is equal to the column index, i.e., $i = j$.

Substituting $j = i$ in the skew-symmetric condition:

Adding $a_{ii}$ to both sides:

Thus, every diagonal element of a skew-symmetric matrix must be zero.

General Structure

A general $3 \times 3$ skew-symmetric matrix is represented as follows:

$A = \begin{bmatrix} 0 & h & g \\ -h & 0 & f \\ -g & -f & 0 \end{bmatrix}$

Note that the elements $a_{12}=h$ and $a_{21}=-h$ are negatives of each other, as are the other pairs across the diagonal.

---

Answer:

---

4. Decomposition of a Square Matrix

In linear algebra, a powerful property exists that allows any square matrix to be broken down into two distinct parts: a Symmetric Matrix and a Skew-Symmetric Matrix. This decomposition is not only possible for all square matrices but is also unique.

Theoretical Statement

Every square matrix $A$ can be uniquely expressed as the sum of a symmetric matrix and a skew-symmetric matrix.

The Decomposition Formula

For any square matrix $A$, we can write:

Derivation and Proof

To establish this result, we first demonstrate that the two parts ($P$ and $Q$) satisfy the required conditions of symmetry and skew-symmetry.

Proof of Symmetry for P:

Let $P = \frac{1}{2}(A + A')$. Taking the transpose of $P$:

$P' = \left[ \frac{1}{2}(A + A') \right]'$

$P' = \frac{1}{2}(A' + (A')')$

$P' = \frac{1}{2}(A' + A) = P$

Since $P' = P$, matrix $P$ is Symmetric.

Proof of Skew-Symmetry for Q:

Let $Q = \frac{1}{2}(A - A')$. Taking the transpose of $Q$:

$Q' = \left[ \frac{1}{2}(A - A') \right]'$

$Q' = \frac{1}{2}(A' - (A')')$

$Q' = \frac{1}{2}(A' - A) = -\frac{1}{2}(A - A') = -Q$

Since $Q' = -Q$, matrix $Q$ is Skew-Symmetric.

Proof of Uniqueness

To prove that this representation is unique, we assume there is another representation and show it leads to the same matrices.

Given: Suppose $A = R + S$ where $R$ is symmetric ($R' = R$) and $S$ is skew-symmetric ($S' = -S$).

Taking transpose on both sides:

$A' = (R + S)'$

$A' = R' + S'$

We already have $A = R + S$ as equation (ii). Now, adding (i) and (ii):

$A + A' = (R + S) + (R - S)$

$A + A' = 2R \Rightarrow R = \frac{1}{2}(A + A')$

Subtracting (i) from (ii):

$A - A' = (R + S) - (R - S)$

$A - A' = 2S \Rightarrow S = \frac{1}{2}(A - A')$

This shows that $R$ and $S$ are exactly the same as $P$ and $Q$ derived earlier. Hence, the representation is unique.

---

Answer:

Elementary Operations on a Matrix

The operations performed on the rows or columns of a matrix to transform it into another form are called elementary operations or transformations. These operations are fundamental in finding the inverse of a matrix and solving systems of linear equations. There are six types of elementary operations: three due to rows and three due to columns.

Types of Elementary Operations

1. The interchange of any two rows (or columns)

This operation involves swapping all the elements of any two chosen rows or columns within a matrix. This transformation is often the first step in reducing a matrix to its Row Echelon Form or Identity Matrix, especially when the first element ($a_{11}$) is zero and needs to be replaced with a non-zero value from another row.

The symbolic notation used to represent the interchange of the $i^{th}$ row and the $j^{th}$ row is $R_i \leftrightarrow R_j$. Similarly, the interchange of the $i^{th}$ column and the $j^{th}$ column is denoted by $C_i \leftrightarrow C_j$.

It is important to note that interchanging rows or columns results in an Equivalent Matrix. While the visual arrangement of numbers changes, the systemic properties remain related.

Answer:

---

Answer:

---

2. Multiplication of the elements of any row (or column) by a non-zero real number

This operation involves taking every element in a specific row (or column) and multiplying it by a constant scalar $k$. It is important to note that this scalar $k$ must be non-zero ($k \neq 0$). If we were to multiply a row by zero, all elements in that row would become zero, effectively destroying the information contained in that row and changing the rank of the matrix.

The symbolic representation for this transformation is as follows:

Similarly, for column operations, the notation is:

This operation is frequently used to make the leading element (pivot) of a row equal to $1$, which simplifies subsequent subtraction or addition steps.

Answer:

---

3. Addition to the elements of any row (or column), the corresponding elements of any other row (or column) multiplied by any non-zero real number

This is the most versatile and frequently utilized operation in matrix theory. It involves modifying a target row (or column) by adding to it a scalar multiple of another row (or column). This operation is specifically designed to create zeros in desired positions.

The symbolic representation for this transformation is as follows:

Similarly, for column operations, the notation is:

In these notations, $k$ is any non-zero real number. It is important to note that the row being used as a reference ($R_j$) remains unchanged in the matrix; only the target row ($R_i$) is modified.

---

Answer:

---

Answer:

---

Equivalent Matrices

Two matrices $A$ and $B$ are said to be equivalent if one can be obtained from the other by applying a finite number of elementary row or column operations. In mathematical notation, this relationship is expressed using the tilde symbol ($\sim$).

It is important to understand that equivalent matrices have the same order and the same rank. For example, if we take a matrix $A$ and perform a row interchange ($R_1 \leftrightarrow R_2$) to get matrix $B$, then $A$ and $B$ are equivalent.

Summary of Notations

Operation Type	Row Notation	Column Notation
Interchange of any two rows/columns	$R_i \leftrightarrow R_j$	$C_i \leftrightarrow C_j$
Multiplication by a non-zero scalar $k$	$R_i \rightarrow kR_i$	$C_i \rightarrow kC_i$
Addition of a multiple of another row/column	$R_i \rightarrow R_i + kR_j$	$C_i \rightarrow C_i + kC_j$

Invertible Matrices

In the study of Linear Algebra, a square matrix is considered invertible (or non-singular) if there exists another square matrix that, when multiplied with it, results in the Identity matrix. This concept is analogous to the reciprocal of a non-zero number in arithmetic.

Let $A$ be a square matrix of order $n$. $A$ is called invertible if there exists a square matrix $B$ of the same order $n$ such that:

Where $I$ is the identity matrix of order $n$. In such a case, matrix $B$ is called the inverse of matrix $A$ and is denoted by $A^{-1}$.

Important Remarks

1. Square Matrix Requirement: A rectangular matrix does not possess an inverse. For the products $AB$ and $BA$ to be defined and equal, both $A$ and $B$ must be square matrices of the same order.

2. Mutual Inverse: If $B$ is the inverse of $A$, then by symmetry, $A$ is also the inverse of $B$.

3. Condition for Invertibility: Not every square matrix has an inverse. If the determinant of a matrix is zero, it is called a singular matrix and is not invertible.

---

Answer:

---

Uniqueness of Inverse

Theorem: If a square matrix has an inverse, then that inverse is unique.

Proof:

Let $A$ be an invertible square matrix of order $n$. Suppose $B$ and $C$ are two different inverses of $A$.

By the definition of inverse:

Now, consider the matrix $B$. We can write:

$B = BI$

$B = B(AC)$

$B = IC$

This proves that the inverse of a square matrix is unique.

---

Inverse of a Matrix by Elementary Operations

The inverse of an invertible matrix $A$ can be found using either Elementary Row Operations or Elementary Column Operations. However, it is mandatory to use only one type of operation throughout the process.

1. Using Elementary Row Operations

To find the inverse of a square matrix $A$ using Elementary Row Operations, we utilize the property of the identity matrix. Any matrix multiplied by the identity matrix remains unchanged. For a square matrix $A$, we can write the fundamental relation:

In this method, we perform a sequence of row transformations on the matrix $A$ on the Left Hand Side (LHS) until it is reduced to the Identity Matrix ($I$). Crucially, every operation performed on the LHS must be simultaneously performed on the identity matrix $I$ situated on the Right Hand Side (RHS). The matrix $A$ on the extreme right of the RHS remains untouched throughout the process.

The Mathematical Logic

When we apply a row operation, it is mathematically equivalent to pre-multiplying by an elementary matrix. Suppose we apply a series of row operations represented by elementary matrices $E_1, E_2, \dots, E_n$ such that:

Applying the same operations to the identity matrix on the RHS:

Since $(E_n \dots E_1) = A^{-1}$, it follows that $B = A^{-1}$. Thus, the final matrix obtained on the RHS is the unique inverse of the original matrix.

Step-by-Step Procedure

1. Write the matrix equation $A = IA$.

2. Use row transformations ($R_i \leftrightarrow R_j$, $R_i \rightarrow kR_i$, or $R_i \rightarrow R_i + kR_j$) to transform the LHS into an identity matrix.

3. Always target the elements in a specific order: first make $a_{11} = 1$, then make other elements in the first column zero, then move to $a_{22} = 1$, and so on.

4. Caution: If at any stage during the operations, all elements of a row in the LHS matrix become zero, then $A^{-1}$ does not exist.

Answer:

2. Using Elementary Column Operations

The Elementary Column Operation method is an alternative to row operations for finding the inverse of a square matrix. While row operations involve pre-multiplication by elementary matrices, column operations rely on post-multiplication. This is why we must start with a different fundamental identity compared to the row method.

For any square matrix $A$ of order $n$, we can express it as the product of itself and the identity matrix $I$ as follows:

In this approach, we apply a sequence of column transformations on the matrix $A$ located on the Left Hand Side (LHS) to reduce it to the Identity Matrix ($I$). Simultaneously, we apply the exact same sequence of column transformations to the identity matrix $I$ located on the Right Hand Side (RHS). Note that the matrix $A$ on the RHS remains unchanged.

The Mathematical Derivation

Suppose $A$ is an invertible matrix. By performing elementary column operations, we are essentially post-multiplying $A$ by elementary matrices $E_1, E_2, \dots, E_n$. Our goal is to find a sequence of such operations such that:

Applying these same operations to the identity matrix on the RHS of equation (v):

Since the product $(E_1 E_2 \dots E_n)$ effectively represents $A^{-1}$, the matrix $B$ generated on the RHS is the unique inverse of $A$.

Operational Procedure

1. Setup: Write the equation $A = AI$.

2. Transformation: Use column operations ($C_i \leftrightarrow C_j$, $C_i \rightarrow kC_i$, or $C_i \rightarrow C_i + kC_j$) to transform the LHS matrix $A$ into $I$.

3. Simultaneity: Apply every operation performed on the LHS to the $I$ on the RHS.

4. Order of Operations: It is generally recommended to fix the matrix row by row when using column operations. First, make $a_{11} = 1$, then make other elements in the first row zero using column transformations.

Answer:

---

Important Observation for Competitions

During the process of finding the inverse of a matrix using elementary transformations, there are specific indicators that tell us whether an inverse actually exists.

While performing a sequence of elementary row operations on $A = IA$ (or elementary column operations on $A = AI$), if we arrive at a stage where all the elements in one or more rows (or columns) of the matrix $A$ on the Left Hand Side (LHS) become zero, then the inverse of the matrix does not exist.