0% found this document useful (0 votes)
4 views2 pages

Understanding Matrices and Their Types

Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views2 pages

Understanding Matrices and Their Types

Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MATRICES

Matrices: A rectangular arrangement of numbers. Matrices are denoted by Capital Letters.


Each number of matrices is known as element of matrix.
Order of a Matrix: Number of rows(m) × Number of columns(n)
Compact form of a Matrix: 𝐴 = 𝑎
×
𝑊ℎ𝑒𝑟𝑒 𝑎 𝑖𝑠 𝑡ℎ𝑒 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑙𝑜𝑐𝑎𝑡𝑒𝑑 𝑎𝑡 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑟𝑠𝑒𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑚𝑡ℎ 𝑟𝑜𝑤 𝑎𝑛𝑑 𝑗𝑡ℎ 𝑐𝑜𝑙𝑢𝑚𝑛.
TYPES OF MATRICES:
(1) Row Matrix: Matrix having one row only.
(2) Column Matrix: Matrix having one column only.
(3) Square Matrix: Matrix having same number of rows and columns. It means m=n.
If it is written that order of matrix is m, then it means it is a square matrix having m rows
and m columns.
(4) Zero Matrix: A matrix whose all elements are zero and denoted by O.
(5) Diagonal Matrix: A square matrix is said to be diagonal matrix if all those elements who are
not on leading diagonal are zero.
OR
A square matrix is said to be diagonal matrix if 𝑎 = 0 ∀ 𝑖 ≠ 𝑗
𝑎 0 0
Example: 𝐴 = 0 𝑎 0 = 𝑑𝑖𝑎𝑔[𝑎 𝑎 𝑎 ]
0 0 𝑎
(6) Scalar Matrix: A diagonal matrix is said to be scalar matrix if all the elements on leading
diagonal is same.
OR
A square matrix is said to be scalar matrix if 𝑎 = 0 𝑤ℎ𝑒𝑛 𝑖 ≠ 𝑗 & 𝑎 = 𝑘 𝑤ℎ𝑒𝑛 𝑖 = 𝑗.
4 0 0
3 0
Example: 𝐴 = [2], 𝐵 = , 𝐶= 0 4 0
0 3
0 0 4
(7) Identity Matrix: A scalar matrix is said to be identity matrix if all the elements on leading
diagonal is 1 and denoted by I.
OR
A square matrix is said to be scalar matrix if 𝑎 = 0 𝑤ℎ𝑒𝑛 𝑖 ≠ 𝑗 & 𝑎 = 1 𝑤ℎ𝑒𝑛 𝑖 = 𝑗.
1 0 0
1 0
Example: [1], , 0 1 0
0 1
0 0 1
Equality of Matrices: Two matrices are said to be equal if (i) they are of same order.
(ii) their corresponding elements are same.

Addition and Subtraction of Matrices: Two matrices can be added or subtracted if they are of
same order. We get their addition or subtraction by adding or subtracting their corresponding
elements.

Multiplication of a matrix by a scalar: Let A be a matrix and we have to multiply by a scalar


quantity k. kA is obtained by multiplying each and every element of matrix by k.
𝑎 𝑎 𝑎 𝑘𝑎 𝑘𝑎 𝑘𝑎
Example: 𝑘𝐴 = 𝑘 𝑎 𝑎 𝑎 = 𝑘𝑎 𝑘𝑎 𝑘𝑎
𝑎 𝑎 𝑎 𝑘𝑎 𝑘𝑎 𝑘𝑎

Properties of Matrix Addition:


(i) Commutative Law: 𝐴 + 𝐵 = 𝐵 + 𝐴
(ii) Associative Law: (𝐴 + 𝐵) + 𝐶 = 𝐴 + (𝐵 + 𝐶)
(iii) Additive Identity: 𝐴 + 𝑂 = 𝑂 + 𝐴 = 𝐴
(iv) Additive Inverse: 𝐴 + (−𝐴) = (−𝐴) + 𝐴 = 𝑂
Properties of Scalar Multiplication of a Matrix:
(i) 𝑘(𝐴 + 𝐵) = 𝑘𝐴 + 𝑘𝐵
(ii) (𝑚 + 𝑛)𝐴 = 𝑚𝐴 + 𝑛𝐴
Multiplication of Matrices: Two matrices are multiplicable if number of columns in pre-
multiplicand and number of rows in post-multiplicand are equal.
𝐴 × × 𝐵 × 𝑤𝑖𝑙𝑙 𝑒𝑥𝑖𝑠𝑡 𝑜𝑛𝑙𝑦 𝑖𝑓 𝑛 = 𝑝
𝑂𝑟𝑑𝑒𝑟 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝐴 × × 𝐵 × 𝑤𝑖𝑙𝑙 𝑏𝑒 𝑚 × 𝑞
𝑎 𝑡ℎ 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 = 𝑆𝑢𝑚 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑜𝑓 𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑖𝑛𝑔 𝑒𝑙𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑖𝑡ℎ 𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑓
𝑝𝑟𝑒 − 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑐𝑎𝑛𝑑 𝑎𝑛𝑑 𝑗𝑡ℎ 𝑐𝑜𝑙𝑢𝑚𝑛 𝑜𝑓 𝑝𝑜𝑠𝑡 − 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑐𝑎𝑛𝑑.
Properties of Matrix Multiplication:
(i) Matrix multiplication is not commutative i.e. 𝐴 × 𝐵 ≠ 𝐵 × 𝐴
(ii) Product of two non zero matrices may be a zero matrix
0 𝑎 𝑐 𝑑 0 0
Example: =
0 𝑏 0 0 0 0
(iii) Associative Law: 𝐴(𝐵𝐶) = (𝐴𝐵)𝐶
(iv) Distributive Law: Multiplication distributes over addition
(a) 𝐴(𝐵 + 𝐶) = 𝐴𝐵 + 𝐴𝐶 (b) (𝐴 + 𝐵)𝐶 = 𝐴𝐶 + 𝐵𝐶
(v) Multiplicative Identity: 𝐴𝑰 = 𝑰𝐴 = 𝐴 whenever multiplicable.
Transpose of a Matrix: Transpose of a matrix A is obtained by interchanging corresponding
rows and columns. Transpose of a matrix A is denoted by A’.
OR
Transpose of a matrix 𝐴 = 𝑎 is 𝐴′ = 𝑎
× ×
Properties of Transpose of a Matrix:
(i) (A ) = A (ii) (A + B) = A + B′ (iii) (AB) = B′A (iv) (𝑘𝐴) = 𝑘𝐴

Symmetric Matrix: A square matrix is said to be symmetric if 𝐴 = 𝐴


OR
A square matrix 𝐴 = 𝑎 is said to be symmetric if 𝑎 = 𝑎 ∀ 𝑖 & 𝑗
Skew Symmetric Matrix: A square matrix is said to be symmetric if 𝐴 = −𝐴
OR
A square matrix 𝐴 = 𝑎 is said to be symmetric if 𝑎 = −𝑎 ∀ 𝑖 & 𝑗

Properties of Symmetric and Skew Symmetric Matrices:


(i) All the elements on leading diagonal of a skew symmetric matrix are zero.
(ii) For any square matrix A, A + A is a symmetric matrix.
(iii) For any square matrix A, A − A is a skew symmetric matrix.
(iv) Any square matrix A can be expressed as the sum of a symmetric and skew symmetric
matrix. 𝐴 = (A + A ) + (A − A )

Theorem (Uniqueness of Inverse): Inverse of a square matrix, if it exists, is unique.


Proof: Let 𝐴 = 𝑎 be a square matrix of order n.
If possible, let B and C are two inverses of A.
Now our target is to show that B and C are not different, they are same.
As B and C are inverses of A, therefore by definition of inverse
𝐴𝐵 = 𝐵𝐴 = 𝐼 & 𝐴𝐶 = 𝐶𝐴 = 𝐼 ----------(1)
𝐵 = 𝐵𝐼 (𝐼 𝑖𝑠 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑓𝑜𝑟 𝑚𝑎𝑡𝑟𝑖𝑥 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑐𝑎𝑡𝑖𝑜𝑛)
𝐵 = 𝐵(𝐴𝐶) (𝑓𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 1)
𝐵 = (𝐵𝐴)𝐶 (𝑀𝑎𝑡𝑟𝑖𝑥 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑐𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 𝑎𝑠𝑠𝑜𝑐𝑖𝑎𝑡𝑖𝑣𝑒. )
𝐵 = 𝐼𝐶 (𝑓𝑟𝑜𝑚 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 1)
𝐵=𝐶 (𝐼 𝑖𝑠 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑓𝑜𝑟 𝑚𝑎𝑡𝑟𝑖𝑥 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑐𝑎𝑡𝑖𝑜𝑛)
Hence, Inverse of a square matrix, if it exists, is unique.

You might also like