Scribd
Upload
17 views2 pages

Values of a for Equation Solutions

This document outlines 19 problems related to matrices and systems of linear equations for Problem Set 2 of an advanced linear algebra course. The problems cover topics such as finding products of matrices, properties of matrices including invertibility and rank, solving systems of linear equations, and determining whether systems have solutions over different fields. Students are asked to prove various statements about matrices, find bases of solution spaces, and perform row reduction to determine matrix ranks.

Uploaded by

Soumya Ranjan Sahoo
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
17 views2 pages

Values of a for Equation Solutions

This document outlines 19 problems related to matrices and systems of linear equations for Problem Set 2 of an advanced linear algebra course. The problems cover topics such as finding products of matrices, properties of matrices including invertibility and rank, solving systems of linear equations, and determining whether systems have solutions over different fields. Students are asked to prove various statements about matrices, find bases of solution spaces, and perform row reduction to determine matrix ranks.

Uploaded by

Soumya Ranjan Sahoo
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

MA 202 - Advanced Linear Algebra

Problem Set 2 (Matrices and System of Equations)


IIT Dharwad, Spring 2024
(1) Let D = diag (d1 , d2 , . . . , dn ). Let A = ( aij ) be an n × n matrix with entries in F. Find
DA and AD. When is D invertible?
(2) Let A be an m × n matrix and B an n × p matrix. Let Ai denote the ith row of A
and A j denote the jth column of A. Show that AB = ( AB1 , AB2 , . . . , AB p ) and AB =
( A1 B, A2 B, . . . , Am B)t .
(3) A square matrix A is called nilpotent if Ak = 0 for some positive integer k. Show that
if A is nilpotent, then I + A is invertible.  
2 3
(4) Find infinitely many matrices B such that BA = I2 where A = 1 2 . Show that
 

2 5
there is no matrix C such that AC = I3 . Here In denotes the identity matrix of order
n × n.
(5) Let A and B be square matrices. Let trace ( A) denote the trace of A which is the sum
of its diagonal entries. Show that for two n × n matrices A and B, trace ( A + B) =
trace ( A) + trace ( B) and trace ( AB) = trace ( BA). Show that if B is invertible, then
trace ( A) = trace ( BAB−1 ).
(6) Show that the inverse of a symmetric matrix is also symmetric.
(7) Find all 2 × 2 matrices A such that A2 = − I.
(8) Find all 2 × 2 matrices A such that A2 = 0.
(9) Show that if A3 − A + I = 0, then A is invertible.
(10) Test for for solvability of the following systems of equations, and if solvable, find all
the solutions:
(a)
x1 + x2 + x3 =8
x1 + x2 + x4 =1
x1 + x3 + x4 = 14
x2 + x3 + x4 = 14

(b)
x1 +2x2 +4x3 =1
2x1 + x2 +5x3 =0
3x1 − x2 +5x3 =0
(11) For what values of a does the following system of equations have a solution?

3x1 − x2 ax3 =1
3x1 − x2 + x3 =5

(12) Show that a system of homogeneous linear equations in n unknowns has a nontrivial
solution if and only if the coefficient matrix has rank less than n.
1
2

(13) Find a basis of the solution space of the system:


3x1 − x2 x4 = 0
x1 + x2 + x3 + x4 = 0
(14) Find a point in R3 where the line joining the points (1, −1, 0) and (−2, 1, 1) pierces the
plane 3x1 − x2 + x3 − 1 = 0.
(15) Using row and columns operations find the rank of the matrix
 
1 2 −3
 −1 −2 3 
 
8 −12
 
 4
1 −1 5
(16) Find the rank of an upper triangular matrix in terms of the diagonal entries.
(17) Let A be an m × n matrix and B be an n × r matrix.
(a) Show that the columns of AB are linear combinations of the columns of A. Hence
prove that rank( AB) ≤ rank( A).
(b) Using ( a) and the fact that rank of a matrix and its transpose are equal, prove that
rank( AB) ≤ rank( B).
(18) Let A be an m × n matrix with coefficients in R and let A1 , . . . , An be column vectors
of A. Assume that A1 , . . . , An are linearly independent over R. Show that they are
linearly independent over C.
(19) Consider a homogeneous system of equations AX = 0 where A is an m × n matrix
with coefficients in R. If this system has a non-trivial solution in C, show that it has a
non-trivial solution in R.

Common questions

Powered by AI

A system is solvable if its augmented matrix has the same rank as its coefficient matrix. For consistent systems, if rank equals the number of variables, the solution is unique; otherwise, it results in infinitely many solutions with free variables. To find the general solution, express the free variables in terms of the pivot ones .

A right inverse matrix C for a matrix A satisfies AC = I. For the 2x3 matrix A given, showing AC = I3 (the 3x3 identity matrix) would imply that A must have full row rank, which is not possible here due to the constraints of dimensions (more columns than rows). Thus, a right inverse C does not exist under these conditions .

If B is invertible in matrices A and B, then matrix transformation like trace(A) = trace(BAB^(-1)) maintains because B^(-1)AB is similar to A. This affine transformation doesn't affect trace proportionality due to symmetry in multiplication, offering trace consistency across such transformations .

A square matrix A is nilpotent if there exists a positive integer k such that A^k = 0. To prove that I + A is invertible, consider the series sum S = I - A + A^2 - ... ± A^(k-1). Calculating (I + A) * S gives I, showing that I + A has an inverse S and thus is invertible .

For any n × n matrices A and B, the trace of their sum is the sum of their traces: trace(A + B) = trace(A) + trace(B). Also, trace(AB) = trace(BA). If B is invertible, trace(A) = trace(BAB^(-1)) because BAB^(-1) is similar to A and trace is invariant under similarity transformations .

Vectors linearly independent over R remain independent over any extension field such as C due to unchanged linear relation possibilities. This extensibility ensures that operations valid in R suffice in more complex fields unless specific algebra constraints like dependencies arise uniquely in these fields due to additional dimensions .

The product DA, where D = diag(d1, d2, ..., dn) and A is an n × n matrix, results in a matrix where each element in the ith row of A is multiplied by di. Similarly, for AD, each element in the jth column of A is multiplied by dj. This shows that the diagonal matrix D scales each row or column of A depending on the multiplication order .

A matrix A is invertible if and only if all its eigenvalues are non-zero. For instance, in systems given by A^3 - A + I = 0, A is shown to have non-zero eigenvalues using spectral theorem arguments, ensuring invertibility despite polynomial constraints due to I providing offset non-zero eigenvalues .

A diagonal matrix D = diag(d1, d2, ..., dn) is invertible if and only if all of its diagonal entries (d1, d2, ..., dn) are non-zero. If these conditions are met, then the inverse of D is simply the diagonal matrix where each entry is the reciprocal of the original diagonal entries, i.e., diag(1/d1, 1/d2, ..., 1/dn).

The rank of an upper triangular matrix is determined by the number of non-zero diagonal entries. This is because the row echelon form of an upper triangular matrix will have these entries as the leading coefficient in each non-zero row, indicating independent vectors contributing to the column space .

You might also like