Scribd
Upload
96 views7 pages

Matrix Rank and Consistency Analysis

Study material for 1 year 1 sem engineering student...

Uploaded by

praveenmesta1
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
96 views7 pages

Matrix Rank and Consistency Analysis

Study material for 1 year 1 sem engineering student...

Uploaded by

praveenmesta1
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

Module 2

Linear Algebra
Elementary transformations associated with a matrix

• Interchange any two rows(columns)


• Multiplication of any row(column) by a nonzero constant
• Addition to any row(column), a constant multiple of any other row(column)
Equivalent matrices:
Two matrices A & B of the same order are said to be equivalent if one matrix can be obtained from
the other by a finite number of successive elementary row(column) transformations and is denoted by
𝑨~𝑩
Rank of a matrix:

Let A be a non-zero matrix of order mn.


A positive integer ‘r’ is said to be the rank of A, if the following conditions are satisfied

• A has at least one non-zero minor of order ‘r’


• Every minor of A whose order is greater than ‘r’ is equal to zero
i.e. Rank is the order of any highest order non-vanishing minor of the matrix.
The rank of a matrix A in echelon form is equal to the number non-zero rows and is denoted by 𝜌(𝐴)
Echelon form of a matrix:

• All zero rows are below non zero rows


• The first non-zero element in any non-zero row is to the right of first non-zero element in the
previous row.

1. Find rank of the following matrices by using elementary row transformations


𝟏 𝟐 𝟑
i. 𝑨 = [𝟏 𝟒 𝟐]
𝟐 𝟔 𝟓
Solution:
1 2 3
𝐴 = [1 4 2]
2 6 5
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 2 3
~ [0 2 −1]
0 2 −1
𝑅3 → 𝑅3 − 𝑅2
1 2 3
~ [0 2 −1]
0 0 0
𝝆(𝑨) = 𝟐
𝟏 𝟒 𝟓
ii. 𝑨 = [𝟐 𝟔 𝟖 ]
𝟐 𝟕 𝟐𝟐
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 4 5
~ [0 −2 −2]
0 −1 12
𝑅3 → 2𝑅3 − 𝑅2
1 4 5
~ [0 −2 −2]
0 0 26
𝝆(𝑨) = 𝟑
𝟐 𝟏 𝟑 𝟓
iii. 𝑨=[𝟒 𝟐 𝟏 𝟑 ]
𝟖 𝟒 𝟕 𝟏𝟑
𝟏𝟔 𝟖 −𝟔 −𝟐
Solution:
2 1 3 5
𝐴=[4 2 1 3 ]
8 4 7 13
16 8 −6 −2
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 4𝑅1 , 𝑅4 → 𝑅4 − 8𝑅1
2 1 3 5
~ [0 0 −5 −7 ]
0 0 −5 −7
0 0 −30 −42
𝑅3 → 𝑅3 − 𝑅2 , 𝑅4 → 𝑅4 − 6𝑅2
2 1 3 5
~ [0 0 −5 −7]
0 0 0 0
0 0 0 0
𝝆(𝑨) = 𝟐
𝟐 𝟑 −𝟏 −𝟏
iv. 𝑨=[𝟏 −𝟏 −𝟐 −𝟒]
𝟑 𝟏 𝟑 −𝟐
𝟔 𝟑 𝟎 −𝟕
2 3 −1 −1
Solution:𝐴 = [1 −1 −2 −4]
3 1 3 −2
6 3 0 −7
𝑅1 ↔ 𝑅2
1 −1 −2 −4
~ [2 3 −1 −1]
3 1 3 −2
6 3 0 −7
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 6𝑅1
1 −1 −2 −4
~ [0 5 3 7]
0 4 9 10
0 9 12 −7
4 9
𝑅3 → 𝑅3 − 𝑅2 , 𝑅4 → 𝑅4 − 𝑅2
5 5
1 −1 −2 −4
0 5 3 7
33 22
~
0 0 5 5
0 0 33 22
[ 5 5]

𝑅4 → 𝑅4 − 𝑅3
𝝆(𝑨) = 𝟑
v. Find the values of k such that the matrix A may have rank equal to a) 3 b)2
1 1 1 1
𝐴 = [1 2 4 𝑘]
1 4 10 𝑘 2

Solution of system of linear equations-Consistency:


Let
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 + ⋯ + 𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 + ⋯ + 𝑎2𝑛 𝑥𝑛 = 𝑏2
-----------------------------------------------------
-----------------------------------------------------
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + 𝑎𝑚3 𝑥3 + ⋯ + 𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚 be the system of linear equations.
The above system of equations can be written in the matrix form AX=B
The system is said to be Homogeneous if 𝑏1 = 𝑏2 = 𝑏3 = ⋯ = 𝑏𝑛 = 0 otherwise said to be Non
homogeneous system of linear equations
Solution: It is the set of values of 𝑥1 , 𝑥2 , 𝑥3 , … 𝑥𝑛 that satisfy all the equations of the system
If 𝑥1 = 𝑥2 = 𝑥3 = … = 𝑥𝑛 = 0 is called trivial solution of the homogeneous system of equations
otherwise it is said to be non trivial solution.
Consistent: The system of linear equations has solution
Inconsistent: The system of linear equations has no solution. Here (n-r) unknowns can be taken
arbitrarily.
To determine whether the system is consistent or inconsistent, consider augmented matrix [𝐴: 𝑩] and
find its rank.
Unique solution: if 𝜌([𝐴: 𝐵] ) = 𝜌(𝐴) = 𝑟 = 𝑛
Infinite number of solutions: 𝜌([𝐴: 𝐵] ) = 𝜌(𝐴) = 𝑟 < 𝑛
No solution: 𝜌([𝐴: 𝐵] ) ≠ 𝜌(𝐴)
Test the following system of equations for consistency
i. 𝑥 + 𝑦 + 𝑧 = −3
3𝑥 + 𝑦 − 2𝑧 = −2
3𝑥 + 4𝑦 + 7𝑧 = 7
Solution:
1 1 1 : −3
[𝐴: 𝑩] = [3 1 −2 : −2]
3 4 7 : 7
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1
1 1 1 : −3
[𝐴: 𝑩] = [0 −2 −5 : 7]
0 1 4 : 16
𝑅3 → 𝑅3 + 𝑅2
1 1 1 : −3
[𝐴: 𝑩] = [0 −2 −5 : 7]
0 0 3 : 39

𝜌([𝐴: 𝐵] ) = 𝜌(𝐴) = 3
Hence the given system of equations is consistent and has unique solution.

ii. 𝑥+𝑦+𝑧 =6
𝑥 − 𝑦 + 2𝑧 = 5
3𝑥 + 𝑦 + 𝑧 = 8
Solution:
1 1 1 : 6
[𝐴: 𝑩] = [1 −1 2 : 5]
3 1 1 : 8

𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1

1 1 1 : 6
~ [0 −2 1 : −1 ]
0 −2 −2 : −10

𝑅3 → 𝑅3 − 𝑅2
1 1 1 : 6
~ [0 −2 1 : −1 ]
0 0 −3 : −9

𝜌([𝐴: 𝐵] ) = 𝜌(𝐴) = 3 = 𝑛

Hence the given system of equations is consistent and has unique solution.
𝑥+𝑦+𝑧 =6
−2𝑦 + 𝑧 = −1
−3𝑧 = −9
Hence the unique solution is 𝑥 = 1, 𝑦 = 2, 𝑧=3
iii. 5𝑥 + 3𝑦 + 7𝑧 = 4
3𝑥 + 26𝑦 + 2𝑧 = 9
7𝑥 + 2𝑦 + 10𝑧 = 5
Solution:
5 3 7 : 4
[𝐴: 𝑩] = [3 26 2 : 9 ]
7 2 10 : 5
𝑅2 → 5𝑅2 − 3𝑅1 , 𝑅3 → 5𝑅3 − 7𝑅1
5 3 7 : 4
~ [0 121 −11 : 33]
0 −11 1 : −3
𝑅3 → 11𝑅3 + 𝑅2
5 3 7 : 4
~ [0 11 −1 : 3]
0 −11 1 : −3
𝑅3 → 𝑅3 + 𝑅2
5 3 7 : 4
~ [0 11 −1 : 3]
0 0 0 : 0
𝜌([𝐴: 𝐵] ) = 𝜌(𝐴) = 2 < 𝑛
Hence the given system of equations is consistent and has infinite number of solutions.
5𝑥 + 3𝑦 + 7𝑧 = 4
11𝑦 − 𝑧 = 3
𝑘+3 7−16𝑘
Let 𝑧 = 𝑘  𝑦 =  𝑥=
11 11

iv. Find the values of  and  so that that the equations


𝑥+𝑦+𝑧 =6
𝑥 + 2𝑦 + 3𝑧 = 10
𝑥 + 2𝑦 + 𝜆 𝑧 = 𝜇 may have a) unique solution b)Infinite solution c) No solution
Solution:
1 1 1 : 6
[𝐴: 𝑩] = [1 2 3 : 10]
1 2 𝜆 : 𝜇
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 1 1 : 6
~ [0 1 2 : 4 ]
0 1 𝜆−1 : 𝜇−6
𝑅3 → 𝑅3 − 𝑅2
1 1 1 : 6
~ [0 1 2 : 4 ]
0 0 𝜆 − 3 : 𝜇 − 10
• Unique solution if 𝜆 ≠ 3
• Infinite solution if 𝜆 = 3, 𝜇 = 10
• No solution if 𝜆 = 3, 𝜇 ≠ 10
v. Find for what value of k the system of equation possesses a solution and solve in each case
𝑥+𝑦+𝑧 =1
𝑥 + 2𝑦 + 4𝑧 = 𝑘
𝑥 + 4𝑦 + 10𝑧 = 𝑘 2
Solution of system of equations by Gauss elimination method:
In this method, the augmented matrix [𝐴: 𝑩] is reduced to an upper triangular matrix and the solution
is obtained by back substitution.
𝑎11 𝑎12 𝑎13 : 𝑏1
[𝐴: 𝑩] = ~ [ 0 𝑎22 ′ 𝑎23 ′ : 𝑏2 ′ ] is upper triangular matrix.
0 0 𝑎33 ′ : 𝑏3 ′
Solve the following system of equations by Gauss elimination method
i. 𝑥+𝑦+𝑧 =9
𝑥 − 2𝑦 + 3𝑧 = 8
2𝑥 + 𝑦 − 𝑧 = 3
Solution:
1 1 1 : 9
[𝐴: 𝑩] = [1 −2 3 : 8 ]
2 1 −1 : 3
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 1 1 : 9
~ [0 −3 2 : −1 ]
0 −1 −3 : −15
𝑅3 → −3𝑅3 + 𝑅2
1 1 1 : 9
~ [0 −3 2 : −1 ]
0 0 11 : 44

𝑥+𝑦+𝑧 =9
−3𝑦 + 2𝑧 = −1
11𝑧 = 44
Hence the solution is 𝑥 = 2, 𝑦 = 3, 𝑧=4

ii. 𝑥1 + 𝑥2 + 𝑥3 + 4𝑥4 = −6
𝑥1 + 7𝑥2 + 𝑥3 + 𝑥4 = 12
𝑥1 + 𝑥2 + 6𝑥3 + 𝑥4 = −5
5𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 =4
Solution:
1 1 1 4 : −6
[𝐴 ∶ 𝐵] = [1 7 1 1 : 12
]
1 1 6 1 : −5
5 1 1 1 : 4

1 1 1 4 : −6
0 6 0 −3 : 18
~[ ]
0 0 5 −3 : 1
0 −4 −4 −19 : 34

1 1 1 4 : −6
0 2 0 −1 : 6
~[ ]
0 0 5 −3 : 1
0 −4 −4 −19 : 34

1 1 1 4 : −6
0 2 0 −1 : 6
~[ ]
0 0 5 −3 : 1
0 0 −4 −21 : 46

1 1 1 4 : −6
0 2 0 −1 : 6 ]
~[
0 0 5 −3 : 1
0 0 0 −117 : 234

𝑥1 + 𝑥2 + 𝑥3 + 4𝑥4 = −6
2𝑥2 − 𝑥4 = 6
5𝑥3 − 3𝑥4 = 1
−117𝑥4 = 234
Hence the solution is 𝑥1 = 1, 𝑥2 = 2, 𝑥3 = −1, 𝑥4 = −2
iii. 2𝑥1 − 𝑥2 + 3𝑥3 = 1
−3𝑥1 + 4𝑥2 − 5𝑥3 = 0
9 23 13
𝑥1 + 3𝑥2 − 6𝑥3 = 0 (Ans: 𝑥1 = 34 , 𝑥2 = 34 , 𝑥3 = 34 )
iv.
3𝑥 + 3𝑦 + 2𝑧 = 1
𝑥 + 2𝑦 = 4
10𝑦 + 3𝑧 = −2
2𝑥 − 3𝑦 − 𝑧 = 5 (Ans: x=2, y=1, z=-4)

Common questions

Powered by AI

Two matrices A and B are considered equivalent if one can be obtained from the other through a finite sequence of elementary row (or column) transformations. This connection is denoted by A~B. These transformations include row or column interchanges, multiplication of any row or column by a non-zero constant, and the addition of a constant multiple of any row or column to another row or column .

To verify if two matrices are equivalent, apply elementary row (or column) transformations: (1) Swap rows or columns, (2) Multiply any row or column by a non-zero constant, (3) Add a constant multiple of one row or column to another. Through these transformations, if one can convert one matrix into the other, they are equivalent, denoted by A~B .

The consistency and nature of solutions in a matrix equation system are affected by changes in parameters that influence the rank of the matrix. The parameter values can alter the number of non-zero rows, leading to varied ranks. Consistency is compromised if the rank of the augmented matrix differs from the coefficient matrix's rank, and unique or infinite solutions emerge based on equality between these ranks and the number of variables .

Finding non-zero minors in a matrix is significant for determining its rank, as the rank is defined by the highest order non-vanishing minor. This measure quantifies the linear independence within the matrix, where non-zero minors of certain orders indicate the presence of independent row vectors at those specific positions, thereby establishing the matrix's rank .

A system of linear equations is consistent if there exists at least one set of values for the variables that satisfies all equations simultaneously. This occurs when the rank of the augmented matrix [A:B] is equal to the rank of the matrix A itself. Conversely, the system is inconsistent when these ranks differ, implying that no set of variables can satisfy all equations .

The Gauss elimination method involves transforming the augmented matrix [A:B] into an upper triangular matrix, and then back-solving for the variables. This is achieved by performing row operations to eliminate variables progressively and reduce the matrix to a simpler form. By ensuring the system is in upper triangular form, solutions are found by substituting backwards from the last row up to the first .

A matrix in echelon form reveals its rank by the number of non-zero rows remaining after transformation. Each leading entry (or pivot) indicates a non-zero independent factor, contributing to the rank count. Zero rows lie below non-zero rows, and each leading non-zero entry in a row is to the right of the leading entry in the row above, highlighting the matrix's structural hierarchy .

The rank of a matrix is determined by two conditions: (1) the matrix must have at least one non-zero minor of order 'r', and (2) every minor of the matrix of order greater than 'r' must be zero. The rank is the order of the highest order non-vanishing minor. Additionally, when a matrix is in echelon form, its rank equals the number of non-zero rows .

To determine the value of a parameter so that a matrix has a specific rank, one must adjust the parameter such that the number of non-zero rows or the highest order non-zero minor aligns with the desired rank. This involves transforming the matrix using row operations to its echelon form and analyzing how changes in the parameter affect the matrix configuration and non-zero minors .

A system of matrix equations has a unique solution if the rank of the coefficient matrix (A) equals the number of variables, and this is equal to the rank of the augmented matrix [A:B]. Infinite solutions occur when the ranks equal but are less than the total number of unknowns, indicating dependent relationships among the variables .

You might also like