Matrices and Operations
Matrices and Operations
Ashir
Course Name (Course Code): Linear Algebra (CMPE 241)
Week No. 3
Fall 2023/24
Date:
✓ Definition of a Matrix
✓ Special Types of Matrices
✓ Addition and Scalar Multiplication with Matrices
✓ Fundamental Properties of Addition and Scalar Multiplication
✓ The Transpose of a Matrix and Its Properties
✓ Symmetric and Skew-Symmetric Matrices
✓ Matrix Multiplication
2
▪ Matrix
Definition: a matrix is an 𝒎 × 𝒏 rectangular array of real numbers, arranged in 𝒎
rows and 𝒏 columns. The elements of a matrix are called the entries. The expression
𝒎 × 𝒏 denotes the size of the matrix.
• For example, consider matrices 𝑨, 𝑩, 𝑪, 𝑫, 𝑬, 𝑭 below with their correct sizes
3
• An 𝒎 × 𝒏 matrix can be thought of either as a collection of 𝒎 row vectors, each
having n coordinates, or as a collection of 𝒏 column vectors, each having m
coordinates.
• A matrix with just one row (or column) is essentially equivalent to a vector with
coordinates in row (or column) form.
• We often write 𝒂𝒊𝒋 to represent the entry in the ith row and jth column of a matrix A.
𝟕
𝑫= 𝟏 𝟑 × 𝟏 𝒎𝒂𝒕𝒓𝒊𝒙 ≡ 𝒄𝒐𝒍𝒖𝒎𝒃 𝒗𝒆𝒄𝒕𝒐𝒓
−𝟐
𝟐 𝟑 −𝟏
𝑨= 𝒂𝟏𝟑 = −𝟏, 𝒂𝟐𝟐 = 𝟎 4
𝟒 𝟎 −𝟓
• A matrix can also be represented as 𝑴𝒎𝒏 which is the set of all matrices with real-
number entries having m rows and n columns.
• A The main diagonal entries of a matrix A are 𝒂𝟏𝟏 , 𝒂𝟐𝟐 , 𝒂𝟑𝟑 , . . .,those that lie on a
diagonal line drawn down to the right, beginning from the upper-left corner of the
matrix.
• Diagonal elements occurs in a special position where 𝒊 = 𝒋 i.e., rows number is
equals to the column number.
𝟐 𝟑 𝟒 −𝟏
Diagonal elements of A are:
𝟒 𝟎 𝟏 −𝟓
𝑨= 𝒂𝟏𝟏 = 𝟐 , 𝒂𝟐𝟐 = 𝟎 ,𝒂𝟑𝟑 = 8 , 𝒂𝟒𝟒 = 𝟐
𝟑 𝟔 𝟖 𝟑𝟏
−𝟏 𝟎 −𝟗 𝟐
5
Square Matrix: is an 𝒏 × 𝒏 matrix; that is, a matrix having the same number of
rows as columns. For example, the following matrices are square:
Diagonal Matrix: A diagonal matrix is a square matrix in which all entries that are not
on the main diagonal are zero. That is, D is diagonal if and only if it is square and
𝒅𝒊𝒋 = 𝟎 for 𝒊 ≠ 𝒋 . For example, the following are diagonal matrices:
6
Identity Matrix: is a diagonal matrix with all main diagonal entries equal to
1. That is, an 𝒏 × 𝒏 matrix A is an identity matrix if and only if 𝒂𝒊𝒋 = 𝟎 for 𝒊 ≠ 𝒋 and
𝒂𝒊𝒊 = 𝟏 . The 𝒏 × 𝒏 identity matrix is denoted by 𝑰𝒏 . For example, the following are
identity matrices:
Upper Triangular Matrix : it is a square matrix with all entries below the main
diagonal equal to zero.
7
Lower Triangular Matrix : lower triangular matrix is one in which all entries above
the main diagonal equal zero; for example
Zero Matrix: is any matrix all of whose entries are zero. 𝑶𝒎𝒏 denotes the 𝒎 × 𝒏 zero
matrix, and 𝑶𝒏 denotes the 𝒏 × 𝒏 zero matrix. For example
8
Matrix Addition: Let A and B both be 𝒎 × 𝒏 matrices. The sum of A and B is the 𝒎 ×
𝒏 matrix (A + B) whose (i, j) entry is equal to 𝒂𝒊𝒋 + 𝒃𝒊𝒋 .
▪ Addition of matrices with different sizes are not allowed . For example, the following
matrices cannot be added.
𝟑 𝟒 −𝟏 𝟐 𝟏 𝟑
Let c=3 and 𝑨 = 𝟎 𝟏 −𝟓 𝑩 = 𝟖 𝟕 −𝟐
𝟎 −𝟗 𝟐 −𝟐 𝟒 𝟐
C(A+B)=cA+cB
𝟑 𝟒 −𝟏 𝟐 𝟏 𝟑 𝟑 𝟒 −𝟏 𝟐 𝟏 𝟑
𝟑 𝟎 𝟏 −𝟓 + 𝟖 𝟕 −𝟐 =𝟑 𝟎 𝟏 −𝟓 +𝟑 𝟖 𝟕 −𝟐
𝟎 −𝟗 𝟐 −𝟐 𝟒 𝟐 𝟎 −𝟗 𝟐 −𝟐 𝟒 𝟐 10
Properties of matrix addition and multiplication:
11
Matrix Transpose: If A is an 𝒎 × 𝒏 matrix, then its transpose, 𝑨𝑻 , is the 𝒏 × 𝒎
matrix whose (i, j) entry is the same as the ( j, i) entry of A.
▪ Thus, transposing A moves the (i, j) entry of A to the (j, i) entry of 𝑨𝑻 . Notice that
the entries on the main diagonal do not move as we convert A to 𝑨𝑻 .
12
Theorem: Let A and B both be 𝒎 × 𝒏 matrices, and let c be a scalar. Then
𝑻 𝑻
1. 𝑨 =𝑨
2. 𝑨 + 𝑩 𝑻 = 𝑨𝑻 + 𝑩𝑻
3. 𝒄𝑨 𝑻 = 𝒄 𝑨𝑻
𝟑 𝟒 −𝟏 𝟑 𝟒 −𝟏
▪ Prove theorem (2) for 𝑨 = 𝟎 𝟏 −𝟓 𝑩 = 𝟎 𝟏 −𝟓
𝟎 −𝟗 𝟐 𝟎 −𝟗 𝟐
𝑻 𝑻
𝟑 𝟒 −𝟏 𝟐 𝟏 𝟑 𝟓 𝟓 𝟐 𝟓 𝟖 −𝟐
𝑨+𝑩 𝑻 = + 𝟖 = = 𝟓 𝟖
𝟎 𝟏 −𝟓 𝟕 −𝟐 𝟖 𝟖 −𝟕 −𝟓
𝟎 −𝟗 𝟐 −𝟐 𝟒 𝟐 −𝟐 −𝟓 𝟒 𝟐 −𝟕 𝟒
𝑻 𝑻
𝟑 𝟒 −𝟏 𝟐 𝟏 𝟑 𝟓 𝟖 −𝟐
𝑨𝑻 + 𝑩𝑻 = 𝟎 𝟏 −𝟓 + 𝟖 𝟕 −𝟐 = 𝟓 𝟖 −𝟓
13
𝟎 −𝟗 𝟐 −𝟐 𝟒 𝟐 𝟐 −𝟕 𝟒
Definition: A matrix A is symmetric if and only if A=𝑨𝑻 . A matrix A is skew-
symmetric if and only if A = −𝑨𝑻 .
▪ Consider the following matrices.
14
Theorem: Every square matrix A can be decomposed uniquely as the sum of two
▪ matrices S and V, where S is symmetric, and V is skew-symmetric.
1
▪𝑆 = 𝑨 + 𝑨𝑻 and V = 12 𝑨 − 𝑨𝑻
2
▪ Given a matrix .
15
Exercises:
16
Exercises:
17
▪ Matrix multiplication is a generalization of the dot product of vectors. It is very useful
in many applications.
Definition:
▪ Two matrices A and B can be multiplied (in that order) only if the number of columns
of A is equal to the number of rows of B. In that case,
Size of product AB =(number of rows of A) x (number of columns of B).
▪ A matrix A with n columns multiply by matrix B with m rows: 𝑨𝒎×𝒏 × 𝑩𝒏×𝒑 = 𝑪𝒎×𝒑
18
Definition: If A is an 𝒎 × 𝒏 matrix and B is an 𝒎 × 𝒑 matrix, their matrix product
C=AB is the 𝒎 × 𝒑 matrix whose (i, j) entry is the dot product of the ith row of A with
the jth column of B. That is
19
Example: Find the product of matrix A and B below:
20
▪ Examples: Find DE, DH, GF, EE, EH, HE, HH, FG, and FD using the matrices
below:
21
Solutions:
22
Theorem: Suppose that A, B, and C are matrices for which the following sums and
products are defined. Let c be a scalar. Then,
23
Exercises:
24
1. Gilbert Strang. (2017). Introduction to Linear Algebra (5th. ed.). Wellesley-
Cambridge Press.
2. Norman, D., & Wolczuk, D. (2011). Introduction to linear algebra for science and
engineering. Pearson Education Inc.
3. Kolman, Bernard; Hill, David R. (2001). Introductory Linear Algebra with
Applications (7th Ed.).Prentice
Links
▪ https://www.youtube.com/watch?v=fNk_zzaMoSs&list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab
25