Scribd
Upload
10 views7 pages

Introduction to Matrices and Operations

This document provides information about matrices including: 1) It defines what a matrix is and provides examples of different types of matrices such as square, diagonal, identity, and zero matrices. 2) It discusses operations that can be performed on matrices including addition, subtraction, and multiplication. Matrix multiplication is only defined when the number of columns of the first matrix equals the number of rows of the second matrix. 3) It introduces special types of matrices such as commutative, anti-commutative, periodic, idempotent, nilpotent, involutory, and Hermitian matrices and provides examples. Exercises are also provided to work with these matrix concepts.

Uploaded by

Adil Sifat
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
10 views7 pages

Introduction to Matrices and Operations

This document provides information about matrices including: 1) It defines what a matrix is and provides examples of different types of matrices such as square, diagonal, identity, and zero matrices. 2) It discusses operations that can be performed on matrices including addition, subtraction, and multiplication. Matrix multiplication is only defined when the number of columns of the first matrix equals the number of rows of the second matrix. 3) It introduces special types of matrices such as commutative, anti-commutative, periodic, idempotent, nilpotent, involutory, and Hermitian matrices and provides examples. Exercises are also provided to work with these matrix concepts.

Uploaded by

Adil Sifat
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

Lecture 01

Matrices

Matrix:
A set of 𝑚𝑛 numbers arranged in the form of an ordered set of 𝑚 rows and 𝑛 columns is
called 𝑚 × 𝑛 (read as 𝑚 by 𝑛) matrix.
Example: A matrix with 9 elements is shown below.

Matrix [A] has 3 rows and 3 columns. Each element of matrix [A] can be referred to by its
row and column number. For example,

ORDER OF A MATRIX

The order of a matrix is defined in terms of its number of rows and columns.

Order of a matrix = No. of rows ×No. of columns


Matrix [A], therefore, is a matrix of order 3×3.

COLUMN MATRIX
A matrix with only one column is called a column matrix or column vector.

ROW MATRIX
A matrix with only one row is called a row matrix or row vector.
Square Matrix:
A matrix in which the number of rows is equal to the number of columns is called square
matrix.
Example:
𝑎11 𝑎12 𝑎13
[𝑎21 𝑎22 𝑎23 ]
𝑎31 𝑎32 𝑎33 3×3

Diagonal Elements:
In a square matrix all those elements 𝑎𝑖𝑗 for which 𝑖 = 𝑗 that is all those elements which
occurs in the same row and same column namely 𝑎11 , 𝑎22 , 𝑎33 are called diagonal
elements.
Example:
𝑎11 𝑎12 𝑎13
𝑎
[ 21 𝑎22 𝑎23 ]
𝑎31 𝑎32 𝑎33 3×3

Diagonal Matrix:
A square matrix is said to be diagonal matrix if it’s all non-diagonal elements be zero.
Example:
𝑎11 0 0 1 0 0
[ 0 𝑎22 0 ] , [0 2 0]
0 0 𝑎33 3×3 0 0 5 3×3
Unit Matrix or Identity Matrix:
A diagonal matrix is said to be unit matrix if it’s all diagonal elements be unity. It is
denoted by 𝐼.
Example:
1 0 0
1 0
𝐼3 = [0 1 0] , 𝐼2 = [ ]
0 1
0 0 1 3×3

ZERO or NULL MATRIX


A matrix whose elements are all equal to zero is called the null or zero matrix.
Lecture 2

Addition and Subtraction:


Addition and Subtraction of matrices is defined only for the matrices having same
number of rows and same number of columns.
Ex:
1 5 3 7
If 𝐴 = [ ] and 𝐵 = [ ] then
3 6 2 6

1 5 3 7 1+3 5+7 4 12
𝐴+𝐵 =[ ]+[ ]=[ ]=[ ],
3 6 2 6 3+2 6+6 5 12

1.2 5.2 2 10
2𝐴 = [ ]=[ ],
3.2 6.2 6 12

1 5 3 7 1−3 5−7 −2 −2
𝐴−𝐵 =[ ]−[ ]=[ ]=[ ]
3 6 2 6 3−2 6−6 1 0
1 5 1 0 1 5 5 0 −4 5
And 𝐴 − 5 = 𝐴 − 5𝐼 = [ ]− 5[ ]=[ ]−[ ]=[ ]
3 6 0 1 3 6 0 5 3 1

𝟏 𝟐 𝟑 𝟑 𝟓 𝟔
H.W: If 𝑨 = [𝟒 𝟐 𝟓] and 𝑩 = [𝟒 𝟎 𝟑] then find 𝟑𝑨 − 𝟓𝑩 + 𝟔.
𝟔 𝟕 𝟗 𝟏 𝟑 𝟓

Matrix multiplication
Two matrices can be multiplied together provided they are compatible with respect to their
orders. The number of columns in the first matrix [A] must be equal to the number of rows in the
second matrix [B]. The resulting matrix [C] will have the same number of rows as [A] and the
same number of columns as [B].
Example:

Try the following multiplication:


Lecture 3

Special types of matrix:


If A and B are square matrices such that AB=BA, then A and B are called commutative r are
said to commute.
If A and B are such that AB= -BA, the matrices A and B are said to anti-commute.
A matrix for which Ak+1=A where k is a positive integer, is called a periodic matrix. If k is the
least positive integer for which Ak+1=A, then A is said to be of period k.
If k=1, so that A2=A, then A is called idempotent.
A matrix A for which Ap=0, where p is a positive integer, is called nilpotent. If p is the least
positive integer for which Ap=0, then A is said to be nilpotent of index p.
When A is a matrix having complex numbers as elements, the matrix obtained from A by
replacing each element by its conjugate is called the conjugate of A and is denoted by 𝐴̅.
A square matrix A is called Hermitian matrix if 𝑎𝑖𝑗 = ̅̅̅
𝑎𝑗𝑖

Exercise
2 −2 −4 −1 3 5
Ex. 1. Show that 𝐴 = [−1 3 4 ] and 𝐵 = [ 1 −3 −5]are idempotent.
1 −2 −3 −1 3 5
Ex. 2. Show that if AB=A and BA =B, then A and B are idempotent.
1 1 3 1 −3 −4
Ex. 3. Show that 𝐴 = [ 5 2 6 ] and 𝐵 = [−1 3 4 ]are nilpotent.
−2 −1 −3 1 −3 −4
Ex. 4. A matrix A is involuntry if and only if (I-A)(I+A)=0.
1 −2 −6
Ex. 5. Show that 𝐴 = [−3 2 9 ] is periodic of period 2.
2 0 −3
1 2 3 −2 −1 −6
Ex. 6. Show that 𝐴 = [ 3 2 0 ] and 𝐵 = [ 3 2 9 ] commute.
−1 −1 −1 −1 −1 −4
1 1+𝑖 2 + 3𝑖
Ex. 7. Show that 𝐴 = [ 1 − 𝑖 2 −𝑖 ] is Hermitian.
2 − 3𝑖 𝑖 0
Ex. 8. Every square matrix can be written as the sum of a symmetric and a skew-symmetric
matrix.

Common questions

Powered by AI

A nilpotent matrix A is characterized by the property that Ap = 0 for some positive integer p, where 0 represents the null matrix. The smallest such p is called the index of nilpotency. Nilpotent matrices are important in the study of matrix algebra and linear transformations, as they reveal insights into the structure of the matrix. For example, the matrix A = [1 -3 -4 -1 3 4 1 -3 -4] is demonstrated to be nilpotent as described in Source 2 .

Two matrices A and B are said to anti-commute if AB = -BA. This implies that the matrices, when multiplied in reverse order, yield the negative of the result obtained by multiplying them in the original order. Anti-commuting matrices are of particular interest in quantum mechanics and abstract algebra, as they signal specific kinds of symmetries or transformations .

The order of a matrix is determined by the number of rows and columns it contains, expressed as 'm×n' where 'm' is the number of rows and 'n' is the number of columns. This is significant because many matrix operations, such as addition, subtraction, and multiplication, require matrices to have specific dimensions. For instance, matrices can only be added or subtracted if they have the same order .

A periodic matrix A is one for which there exists a positive integer k such that A^k+1 = A, with the smallest such k being the matrix's period. The period is important because it reveals repetitive behavior in the matrix's powers, which can simplify calculations and predict long-term behavior of linear systems, especially in dynamical systems and computational simulations .

An identity matrix is defined as a diagonal matrix where all diagonal elements are equal to one, typically denoted by I. In matrix algebra, it serves as the multiplicative identity because multiplying any matrix by the identity matrix (of compatible dimensions) results in the original matrix itself. This property is analogous to the number 1 in arithmetic operations .

Matrix multiplication compatibility is crucial in ensuring operations can be performed; specifically, the number of columns in the first matrix must equal the number of rows in the second matrix. When two matrices are multiplied, the dimensions of the resultant matrix are defined by the number of rows of the first and the number of columns of the second matrix. This compatibility condition determines whether multiplication is feasible and influences the applicability of matrix-related methods in applications like solving systems of equations .

Any square matrix A can be decomposed into symmetric and skew-symmetric components. This means A can be written as the sum of two matrices: one symmetric and the other skew-symmetric. The symmetric part is 0.5(A + A^T) and the skew-symmetric part is 0.5(A - A^T). This decomposition is valuable for simplifying matrix analysis and finding properties like eigenvalues .

A diagonal matrix is a square matrix in which all the non-diagonal elements are zero, meaning only the diagonal elements from the top left to the bottom right (where the row and column index are equal) can potentially be non-zero. For example, a 3×3 diagonal matrix can be [a11 0 0; 0 a22 0; 0 0 a33]. An important property of diagonal matrices is that their transpose is identical to the original matrix, simplifying operations like matrix multiplication. A common special case is the identity matrix, where all diagonal elements are 1 .

A Hermitian matrix is characterized by the condition a_ij = a_ji̅, meaning each element is equal to the conjugate of its transpose counterpart. Hermitian matrices are significant in matrix theory because they generalize symmetric real matrices to complex numbers and have properties conducive to quantum mechanics, such as having real eigenvalues. The matrix provides an example: A = [1 1+i 2+3i; 1-i 2-i 2-3i; i 0 0] shows Hermitian properties, illustrating such symmetry in complex number space .

Two matrices A and B are considered commutative if their product in both orders results in the same matrix, i.e., AB = BA. This property is significant because, generally, matrix multiplication is not commutative. Identifying commutative matrices can simplify calculations in mathematics and physics, where such properties help in proving theorems and simplifying complex systems .

You might also like