0% found this document useful (0 votes)
16 views2 pages

Assignment 1

The document is an assignment for a Linear Algebra and Matrices course for B.Tech. CSE students, detailing various problems related to vector spaces, subspaces, linear independence, and matrix operations. It includes tasks such as proving properties of vector spaces, finding bases, determining linear dependence, and solving systems of equations. The assignment is due on September 4, 2025, and is worth a maximum of 10 marks.

Uploaded by

SUPERMAN
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)
16 views2 pages

Assignment 1

The document is an assignment for a Linear Algebra and Matrices course for B.Tech. CSE students, detailing various problems related to vector spaces, subspaces, linear independence, and matrix operations. It includes tasks such as proving properties of vector spaces, finding bases, determining linear dependence, and solving systems of equations. The assignment is due on September 4, 2025, and is worth a maximum of 10 marks.

Uploaded by

SUPERMAN
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

MA204 - Linear Algebra and Matrices Assignment

IInd year/ [Link]./ CSE / July-2025 August 18, 2025


Last date for submission: September 04, 2025 Max. mark: 10

1. Which of the following is a vector space over R, under usual operation?


(a) The set of all n × n matrices A with real entries such that A2 = A.
(b) B={(x1 , x2 , . . . , xn ) ∈ Rn : x1 = 0}.
2. Let V1 and V2 be the subspaces of V . Prove:
(a) If V1 ∩ V2 = {0}, and E1 , E2 are bases of V1 , V2 , then E1 ∪ E2 is a basis of V1 + V2 . In
particular, dim(V1 + V2 ) = dim(V1 ) + dim(V2 );
(b) dim(V1 + V2 ) = dim(V1 ) + dim(V2 ) − dim(V1 ∩ V2 ).
3. Prove the following statements:
(a) S = {(α1 , α2 , α3 ) ∈ R3 : α1 + α2 − α3 = 0} is a subspace of R3 .
(b) If V1 , V2 ⊂ V are subspaces, then V1 + V2 = span(V1 ∪ V2 ).
4. Find x1 , x2 , x3 , x4 ∈ R3 such that any three are linearly independent.
5. Find conditions on α such that:
(a) (1 + α, 1 − α), (1 − α, 1 + α) are linearly dependent in R2 .
(b) (α, 1, 0), (1, α, 1), (0, 1, α) are linearly dependent in R3 .
6. Suppose x, y, z are linearly independent. Are x + y, y + z, z + x linearly independent?
7. If V0 is a subspace of a vector space V , then there exists a subspace V1 of V such that V = V0 +V1
and V0 ∩ V1 = {0}.
8. Prove the following
(a) The set {(1, 0, 0, −1), (0, 1, 0, −1), (0, 0, 1, −1), (0, 0, 0, −1)} is a basis for R4 .
(b) The set {x2 + 3x − 2, 2x2 + 5x − 3, −x2 − 4x + 4} is a basis for P2 (R), set of all polynomials
of degree less than or equal to two.
9. Show that W = {(a1 , a2 , a3 , a4 , a5 ) ∈ R5 : a1 + a3 + a5 = 0, a2 = a4 } is a subspace of R5 . Also
find the dim(W ).
10. Determine whether the following sets are linearly dependent or linearly independent.
(" # " #)
1 −3 −2 6
(a) , in M2×2 (R)
−2 4 4 −8
         


 1 1 0 0 0 0 1 0 0 1 

        
(b) 0 0 , 1 1 , 0 0 , 1 0 , 0 1 in M3×2 (R)
         

 

 0 0 0 0 1 1 1 0 0 1 
11. Prove that W1 = {(a1 , a2 , . . . an ) ∈ Rn : a1 + a2 + · · · + an = 0} is a subspace of Rn , but
W2 = {(a1 , a2 , . . . , an ) ∈ Rn : a1 + a2 + · · · + an = 1} is not a subspace of Rn .
12. Obtain the orthonormal vectors from the given vectors (1, 0, 1), (0, 1, 1), (1, 3, 3) of R3 , using
Gram Schmidt process.

1
13. Obtain the orthonormal vectors from the given vectors (2, 1, 2, 1), (1, 2, 1, 2), (1, 1, 2, 2), (1, 1, 2, −1)
of R4 , using Gram Schmidt process.
14. Solve the system of equations using row transformation:
x1 + 3x2 + 2x3 + 4x4 − 3x5 = −7
2x1 + 6x2 − x4 − 2x5 = 0
6x3 + 2x4 − x5 = 12
x1 + 3x2 − x3 + 4x4 + 2x5 = −6
15. Solve the system of equations using row transformation:
x1 + x2 − 2x3 + 4x4 = 5
2x1 + 2x2 − 3x3 + x4 = 3
3x1 + 3x2 − 4x3 − 2x4 = 1
 
0 −3 −6 4 9
 
−1 −2 −1 1 3
16. Obtain the row echelon canonical form of the following: 
−2 −3 0

 3 −1 
1 4 5 −9 −7
 
1 1 1 1 4
1 2 3 −4 2 
 
 
2 1 1 2 6
17. Obtain the row echelon canonical form of the following: 
 

3 2 −1 −1 3 
 
1 2 2 2 −2
 
 
2 3 −3 1 1
 
1 −1 1 1 −1
 
−1 2 −1 3 1
 
18. Find the inverse of the matrix by elementary row transformation:  1 1 1 −1 1 
 
 
1 3 1 2 1 
 
1 −1 −1 −1 2
 
1 3 3 2 1
 
1 4
 3 3 −1 
19. Find the inverse of the matrix by partition: 1 3 4 1 1
 
 
1 1
 1 1 −1 
1 −2 −1 2 2
 
5 3 1 7 9
 
6 4 2 8 −8
 
20. Find the inverse of the matrix by partition: 7 5 3 10 9 
 
 
9 6 4 −9 −5
 
8 5 2 11 4

Common questions

Powered by AI

The Gram-Schmidt process involves taking a set of linearly independent vectors and orthogonalizing them one by one. Starting with the first vector, each subsequent vector is projected onto the already orthogonalized vectors, removing its component in those directions. This orthogonal set is then normalized to unit vectors, forming an orthonormal basis. This process is instrumental in transforming any basis into an orthonormal set .

A set is a vector space over R if it satisfies vector addition and scalar multiplication axioms, contains the zero vector, and is closed under these operations. For example, the set of all n×n matrices A with real entries such that A^2 = A (idempotent matrices) does not form a vector space because it may not close under addition or scalar multiplication. Each operation can yield matrices outside the original set, violating vector space properties .

To find linearly independent vectors from a given set of linearly dependent ones, apply techniques like the row reduction of the corresponding matrix to its row echelon form, or apply the Gram-Schmidt process. This process iteratively constructs orthogonal vectors from the original set, removing dependencies and providing a linearly independent set .

The condition required is that the intersection of the two subspaces, V1 and V2, must only be the zero vector, i.e., V1 ∩ V2 = {0}. In such a case, if E1 and E2 are bases of V1 and V2 respectively, the union E1 ∪ E2 forms a basis of V1 + V2. Consequently, the dimension of their sum, dim(V1 + V2), equals the sum of their individual dimensions, dim(V1) + dim(V2).

The subspace generated by span(V1 ∪ V2) is equivalent to V1 + V2 because both represent the smallest subspace containing all vectors from V1 and V2. This equivalence holds as span(V1 ∪ V2) generates every vector formed by linear combinations of vectors in V1 and V2. Consequently, this union effectively builds the entire span as V1 + V2 .

To find the inverse of a matrix using elementary row transformations, augment the matrix with the identity matrix, then apply row operations to transform the original matrix into the identity. Simultaneously, these row operations will transform the identity matrix into the inverse of the original matrix. This technique is effective for computational verification of matrix non-singularity through invertibility .

A set W in R5 is a subspace if it is closed under vector addition and scalar multiplication and includes the zero vector. For W = {(a1, a2, a3, a4, a5) ∈ R5 : a1 + a3 + a5 = 0, a2 = a4}, it meets these criteria. The dimension of W is determined by the number of free variables; here, two constraints make dim(W) = 3 .

To prove linear independence of a set of vectors in R3, say {(x1, x2, x3)}, you must show that if a linear combination a1*x1 + a2*x2 + a3*x3 = 0 results in all coefficients a1, a2, a3 being zero, then the vectors are linearly independent. A practical method involves setting up a matrix with these vectors as columns and checking that its determinant is non-zero, indicating linear independence .

A set of polynomials is a basis for a polynomial space P2(R) if it is linearly independent and spans the space of polynomials of degree less than or equal to two. For example, the set {x^2 + 3x - 2, 2x^2 + 5x - 3, -x^2 - 4x + 4} forms a basis for P2(R) by fulfilling these conditions — no polynomial can be represented as a linear combination of others .

Matrix partitioning for inversion involves dividing a larger matrix into sub-matrices, facilitating computational efficiency and manageability, especially for matrices with specific patterns. It allows more straightforward manipulation and recursive application of simpler inversion formulas. Partitioning can outperform direct inversion for its reduced complexity in extensive systems compared to classical methods like Gaussian elimination .

You might also like