Scribd
Upload
55 views

Unit 1-Matrices

The document defines matrices and their basic properties. It can be summarized as: 1. A matrix is a rectangular array of numbers (or functions) that can be added, multiplied by scalars, and multiplied together under certain rules. 2. There are different types of matrices including row, column, square, and identity matrices. 3. The determinant of a square matrix provides a scalar value associated with the matrix. Determinants are used to determine properties like invertibility. 4. The inverse of a non-singular square matrix is the matrix that undoes the original matrix when multiplied, satisfying AA-1 = A-1A = I.

Uploaded by

Mohammad Saleem
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
55 views

Unit 1-Matrices

The document defines matrices and their basic properties. It can be summarized as: 1. A matrix is a rectangular array of numbers (or functions) that can be added, multiplied by scalars, and multiplied together under certain rules. 2. There are different types of matrices including row, column, square, and identity matrices. 3. The determinant of a square matrix provides a scalar value associated with the matrix. Determinants are used to determine properties like invertibility. 4. The inverse of a non-singular square matrix is the matrix that undoes the original matrix when multiplied, satisfying AA-1 = A-1A = I.

Uploaded by

Mohammad Saleem
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
You are on page 1/ 7

Unit one: Matrices

A matrix is a rectangular array of numbers (or functions) enclosed in brackets. These


numbers (or functions) are called the entries (or sometimes the elements) of the matrix.
For example,

(1)

The first matrix has two rows (horizontal lines of entries) and three columns (vertical
lines). The second and third matrices are square matrices. Matrices having just a single
row or column are called vectors. Thus the fourth and last matrices are called row and
column vectors, respectively.
We shall denote matrices by capital letters A, B, C, …, or A = [aij]
m × n is called the size of the matrix.
𝑎11 𝑎21 . . . 𝑎𝑚1
𝑎12 𝑎22 . . . 𝑎𝑚2
. . . .
A ≡ [aij] = . . .
.
. . . .
[𝑎1𝑛 𝑎2𝑛 . . . 𝑎𝑚𝑛 ]
If m = n, we call A an n×n square matrix. A matrix that is not square is called a
rectangular matrix.

Equality of Matrices:
Two matrices A = [ajk ] and B = [bjk] are equal (written A = B) if and only if they have
the same size, and the corresponding elements are equal, that is, a11 = b11, a12 = b12, and
so on. Matrices that are not equal are called different.
Example:
Addition of Matrices
The sum of two matrices A = [aij ] and B = [bij] of the same size is written A + B and has
the entries aij+bij obtained by adding the corresponding entries of A and B. Matrices of
different sizes cannot be added.
Example

Scalar Multiplication (Multiplication by a Number)


The product of any m×n matrix A = [aij] and any scalar c (number c) is written cA and is
the m×n matrix cA = [cajk] obtained by multiplying each entry of A by c.
Example:

Rules for Matrix Addition and Scalar Multiplication:


(a) A + B = B + A
(b) (A + B) + C = A + (B + C)
(c) A + 0 = A
(d) A +(-A)= 0
(a) c(A + B) = cA + cB
(b) (c + k)A = cA + kA
(c) c(kA) = (ck)A
(d) IA = A
Matrix multiplication
The product C = AB (in this order) of an m×n matrix A = [aij] times an r×p matrix B=[bij]
is defined if and only if r = n and is then the m×p matrix C = [cij] with entries
𝑛
𝑐𝑖𝑗 = ∑ 𝑎𝑖𝑙 𝑏𝑙𝑗 = 𝑎𝑖1 𝑏1𝑗 + 𝑎𝑖2 𝑏2𝑗 + ⋯ + 𝑎𝑖𝑛 𝑏𝑛𝑗 i = 1,···,m
𝑙=1

j = 1,···,p
A B = C
[m×n] [n×p] [m×p]
Example:

Note: Matrix Multiplication is Not Commutative, AB ≠ BA in General.


Rules of Matrix Multiplication:
(a) (kA)B = k(AB) = A(kB)
(b) A(BC) = (AB)C
(c) (A + B)C = AC + BC
(d) C(A + B)= CA + CB
Transpose of a Matrix
Given any m×n matrix A=[aij], we define the transpose of A, denoted as AT and read as “
A-transpose,” as
𝑎11 𝑎21 . . . 𝑎𝑚1
𝑎12 𝑎22 . . . 𝑎𝑚2
. . . .
AT =[aij]T = [aji] = . . .
.
. . . .
[𝑎1𝑛 𝑎2𝑛 . . . 𝑎𝑚𝑛 ]
Example:
Types of Matrices:
Type of Matrix Details Example
Row Matrix A = [aij]1×n [0 1 1 -2]
Column Matrix A = [aij]m×1

Zero or Null Matrix A = [aij]m×n where, aij = 0

Singleton Matrix A = [aij]m×n where, m = n =1 [2]

Horizontal Matrix [aij]m×n where n > m

Vertical Matrix [aij]m×n where, m > n

Square Matrix [aij]m×n where, m = n

Diagonal Matrix A = [aij] , aij = 0, when i ≠ j

A = [aij]m×n where,
Identity (Unit) Matrix (I)

Can be either upper triangular


Triangular Matrices (aij = 0, when i > j) or lower
triangular (aij = 0 when i < j)
Upper Matrix Lower Matrix
Singular Matrix |A| = 0
Non-Singular Matrix |A| ≠ 0
A = [aij] where, aij = aji
Symmetric Matrices or A=AT
(A is a square matrix)
A = [aij] where, aij = -aji
Skew-Symmetric Matrices or A= -AT
(A is a square matrix)
Determinants
The scalar quantity associated with a square matrix, is called “determinant”. We denote
the determinant of an n×n matrix A=[aij] as

𝑎11 𝑎12 . . . 𝑎1𝑛


𝑎21 𝑎22 . . . 𝑎2𝑛
| . . . . | 𝑛
det A= .
| . . . | = ∑1 𝑎𝑖𝑗 𝐴𝑖𝑗
. . . .
𝑎𝑛1 𝑎𝑛2 . . . 𝑎𝑛𝑛
𝑛
|A|= 𝑎𝑖1 𝐴𝑖1 + 𝑎𝑖2 𝐴𝑖2 + …+𝑎𝑖𝑛 𝐴𝑖𝑛 =∑ 𝑎𝑖𝑗 𝐴𝑖𝑗 (row definition)
𝑗=1
𝑛
|A|= 𝑎1𝑗 𝐴1𝑗 + 𝑎2𝑗 𝐴2𝑗 + …+𝑎𝑛𝑗 𝐴𝑛𝑗 =∑ 𝑎𝑖𝑗 𝐴𝑖𝑗 (column definition)
𝑖=1

where Ajk is called the cofactor of the aij element and is defined as
Aij ≡ (-1)i+j Mij
where Mij is called the minor of aij , namely the determinant of (n-1) × (n-1) matrix that
survives when the row and column containing aij are struck out.

Special Cases in Determinants:


1- Determinant of order 1: The determinant of a matrix of the first order (n=1) is the
element itself.
Example: If A=[-1], then detA= -1.
2- Determinant of order 2:

3- Determinant of order 3:
(a) The Leibniz formula:
(b) The rule of Sarrus:

det(A)=

det(A)= a11 a22 a33+a12a23a31+a13a21a32-a31a22a13-a32a23a11-a33a21a12


Notes:
1- The scheme of Sarrus for calculating the determinant of a 3 × 3 matrix does not
carry over into higher dimensions.
2- The Leibniz formula expresses the determinant of an n × n-matrix in a manner
which is consistent across higher dimensions.
Some Properties of determinants:
1- If any row or column of a determinant detA only contains zero elements, then
determinants detA = 0.
2- If A is a square matrix with the transpose AT, then detA = detAT.
3- If each element of a row or column of a square matrix A is multiplied by a
constant k, then the value of the determinant is kdetA.
4- If two rows (or columns) of a square matrix are interchanged, the sign of the
determinant is changed.
5- If any two rows or columns of a square matrix A are proportional, then
detA = 0.
Matrix Partitioning:
The idea of matrix partitioning is that any matrix A (which is larger than 1×1) may be
portioned into a number of smaller matrices called blocks.
Example: The matrix

Inverse of a Matrix
If A is a non-singular square matrix, there is an existence of n × n matrix A-1, which is
called the inverse matrix of A, such that it satisfies the property:
1
A-1=
𝐴
and AA-1 = A-1A = I, where I is the Identity matrix. The inverse of a nonsingular n × n
matrix A=[aij] is

𝑐11 𝑐21 … 𝑐𝑛1


1 𝑇 1 𝑐12 𝑐22 … 𝑐𝑛2 adj(𝐴)
A-1=
|𝐴|
[𝐶𝑖𝑗 ] = |𝐴|
[ ⋮ ⋮ ⋱ ⋮ ] =
|𝐴|
𝑐1𝑛 𝑐2𝑛 … 𝑐𝑛𝑛
where adj(A) is the adjoint matrix of A.

You might also like