0% found this document useful (0 votes)
14 views4 pages

Matrix Concepts and Operations Guide

The document provides a comprehensive overview of matrices, including definitions, properties, and operations such as addition, multiplication, and transposition. It discusses concepts like matrix equality, scalar multiplication, and the characteristics of symmetric and skew-symmetric matrices. Additionally, it covers invertible matrices and the conditions for their existence and uniqueness.

Uploaded by

ananyadananyad87
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)
14 views4 pages

Matrix Concepts and Operations Guide

The document provides a comprehensive overview of matrices, including definitions, properties, and operations such as addition, multiplication, and transposition. It discusses concepts like matrix equality, scalar multiplication, and the characteristics of symmetric and skew-symmetric matrices. Additionally, it covers invertible matrices and the conditions for their existence and uniqueness.

Uploaded by

ananyadananyad87
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

ABHYAAS ACADEMY BELTHANGADY

MATRICES
Concept 3.1
Definition : A matrix is an ordered rectangular array of numbers (or functions)
The numbers (or functions) are called the elements or the entries of the matrix.
The horizontal lines of elements are said to constitute rows of the matrix and the vertical lines of elements are said
to constitute columns of the matrix.
1 2 3
1 −1 0
Example: = 0 −1 5 =
5 3 −2
2 6 7
Order of matrix: A matrix having m rows and n columns is called a matrix of order × or simply ×
matrix (read as m by n matrix)
In general × matrix has the following rectangular array.

= = …
×
… ×
1≤ ≤ , 1≤ ≤ , ∈
The element is an element in the row and coloum and is known as the ( , ) element of A. The number
of elements in an × matrix will be equal to mn.

Concept 3.2 :
Equality of Matrices: Two matrices = = are said to be equal if
(i) They are of same order (ii) = ∀ ,

Concept 3.3 :
Addition of Matrices: Let A and B be two matrices each of order × . Then the sum matrix + is defined
only if matrices A and B are of same order.
Thus, if = = then + = + for all
× ×

Properties of addition of Matrices:


If A, B and C are 3 matrices of same order and 0 is null matrix of same order as that of A.
Then (1) + = + [Commutative Law]
(ii) ( + ) + = + ( + ) [Associative law]
(iii) + 0 = = 0 + [Identity Law]
(iv) + (− ) = (− ) + = 0 [Inverse Law]
(v) + = + ⇒ = [left Cancellation Law]
(vi) + = + ⇒ B = C [right Cancellation Law]
Negative of a Matrix : The negative of a matrix A is denoted by − . We define − = (−1)

Concept 3.4 :
Multiplication of a Matrix by a scalar: If = is a matrix and k is a scalar, then kA is another matrix
×
which is obtained by multiplying each element of A by the scalar k
Properties: If = = be two matrices of the same order say × and k and l are scalars, then
(i) ( + ) = + (ii) ( + ) = +

Concept 3.5 :
Multiplication of Matrices: If A and B are two matrices, then the product AB exists if number of columns of A is
equal to the number of rows of B. i.e. if = be an × matrix and = be an × matrix. Then
the product AB is of order × matrix.
n
= =[ ] , where = a b ij jk
j 1

Properties of Multiplication of Matrices :


(1) The Associative Law: For any three matrices A, B and C , ( ) = ( ), whenever both sides of the
equality are defined.
(2) The Distributive Law: For any three matrices A, B and C
(1) ( + ) = + (ii) ( + ) = +
whenever both sides of equality are defined
(3) For every square matrix A, there exist an identity matrix of same order such that = =
(4) If = 0, then it is not necessary that either A or B is 0 or both are 0
(5) ≠ (Matrix multiplication is non commutative)

Concept 3.6:
0 ′′
0
i) If = ℎ =
0 0 ′′
0 0 ′′ 0 0
ii) If = 0 0 ℎ = 0 ′′ 0
0 0 0 0 ′′
0 ′′ 0 if n is even and ′′ = 0 ′′ if n is odd
iii) If = ℎ =
0 0 ′′ ′′ 0
0 0 0 0 ′′ ′′ 0 0
iv) If = 0 0 ℎ = 0 ′′ 0 if n is odd and = 0 ′′ 0 if n is even
0 0 ′′ 0 0 0 0 ′′

Concept 3.7 :
[Powers of A using Mathematical Induction]
1 1 1
i) If = ℎ = ∀ ∈
0 1 0 1
1 2 1 1
ii) If = ℎ = ∀ ∈
0 1 0 1
1 0
iii) If = ℎ = − ( − 1) ∀ ∈
1 1
3 −4 1+2 −4
iv) If = ℎ = ∀ ∈
1 −1 1−2
0 1
v) If = ℎ ( + ) = + where I is the identity matrix of order 2 and ∈
0 0
Concept 3.8 :
1 1
i) If = ℎ =2 , ∈
1 1
1 1
ii) If = ℎ =0 ∀ ∈ with ≥2
−1 −1
−1 −1
iii) If = ℎ =0 ∀ ∈ with ≥2
1 1
−1 1
iv) If = ℎ = (−2) , ∈
1 −1
1 −1
v) If = ℎ =2 , ∈
−1 1
1 1 1
vi) If = 1 1 1 ℎ =3 , ∈
1 1 1

Concept 3.9 :
cos sin cos sin
If = ℎ = ∈
− sin cos − sin cos

Concept 3.10
Transpose of a Matrix :
If = be an × matrix, then the matrix obtained by interchanging the rows and columns of A is called
the transpose of A. Transpose of the matrix A is denoted by ′

Properties of Transpose of the Matrix: For any matrices A and B of suitable order, we have
i) ( ) = ii) ( ) = ′ iii) ( + ) = + ′ iv) ( ) = ′ ′
Where k is a constant

Symmetric Matrix: A square matrix = is said to be symmetric if = . = ∀ ,


Skew Symmetric Matrix: A square matrix = is said to be skew symmetric matrix if ′ = − that is
= − for all possible value of i and j. In particular, =− ⇒ 2 =0 ⇒ =0

Results:
1) For any square matrix A with real number entries, + ′ is symmetric matrix and − ′ is a skew
symmetric matrix.
2) = ( + ) + ( − ) i.e every square matrix can be expressed of symmetric matrix and skew
symmetric matrix.
Concept 3.11
i) Let A and B be two matrices such that the product AB is defined. If denotes a row operation,
then ( ) = ( ) ∙
Here ( ) denotes the matrix obtained by applying the row operation on AB.
( ) denotes the matrix obtained by applying the same row operation on A.
ii) Let A and B be two matrices such that the product AB is defined. If denotes a column operation then,
( ) = ∙ ( )
Here ( ) denotes the matrix obtained by applying the column operation on AB.
(B) denotes the matrix obtained by applying the same column operation on B.
Concept 3.12
Invertible Matrices:
If A is a square matrix of order m and if there exists an other square matrix B of order m, such that
= = , then B is called the inverse of A and it is denoted by
Results:
(i) Inverse of a square matrix, if it exists is unique.
(ii) If A and B are invertible matrices of the same order, then ( ) =
(iii) ( ) =
Note: = =

Common questions

Powered by AI

The transpose of a matrix A is determined by interchanging its rows and columns. If A is an m×n matrix, the transpose, denoted A', will be an n×m matrix. Properties include: (A')' = A, (kA)' = kA', (A+B)' = A' + B', and (AB)' = B'A' for matrices A and B where defined .

Every square matrix A can be expressed as the sum of a symmetric matrix (1/2(A + A')) and a skew symmetric matrix (1/2(A - A')). This decomposition utilizes properties of symmetric (A' = A) and skew symmetric matrices (A' = -A).

The associative property in matrix multiplication states that for any matrices A, B, and C, the equation (AB)C = A(BC) holds, assuming both sides of the operation are defined. This means the way in which the matrices are grouped in the multiplication does not affect the result .

When applying a row operation σ to the product AB, it applies directly to matrix A, such that σ(AB) = σ(A)B. Conversely, when a column operation σ is applied to the product AB, it affects B, as σ(AB) = Aσ(B). This property ensures that operations are applied appropriately based on the structure of the matrices .

Using mathematical induction, the power of a matrix A, denoted A^n, is determined by multiplying the matrix by itself n times. For example, if A = [[1, 1], [0, 1]], then A^n = [[1, n], [0, 1]] for all n in natural numbers, demonstrating that powers of matrices can simplify to particular forms depending on the original matrix .

The identity matrix I acts as the multiplicative identity in matrix operations. For any square matrix A of the same order as I, the product AI = IA = A. This property is crucial for defining the inverse of a matrix since the inverse A^-1, if it exists, must satisfy AA^-1 = A^-1A = I .

The product of two matrices A and B can be zero even if neither A nor B is a zero matrix. The condition for the product to be zero only requires the matrix multiplication to satisfy AB = 0, not that A or B is the zero matrix themselves. This highlights that matrix multiplication does not have the zero-product property as in scalar multiplication .

Two matrices A and B are equal if they have the same order and their corresponding elements are equal, meaning for every index (i, j), the element a_ij in matrix A must be equal to b_ij in matrix B .

When matrix A = [[3, -2], [1, 0]] is multiplied by a scalar k, the resultant matrix kA will be [[3k, -2k], [k, 0]]. This is achieved by multiplying each element of A by the scalar k .

A matrix A is invertible if there exists a matrix B such that AB = BA = I, where I is the identity matrix of the same order. The uniqueness property of invertible matrices states that if an inverse exists, it is unique; that is, there is only one such matrix B that satisfies these conditions .

You might also like