Understand the problem

The set of nilpotent matrices in \(M_3(R)\) spans \(M_3(R)\) considered as an R-vector space (a matrix A is said to be nilpotent if there exists n ∈ N such that \(A^n = 0)\).
Source of the problem
TIFR 2018 Part A, Problem 15
Topic
LINEAR  ALGEBRA
Difficulty Level
Medium
Suggested Book
Linear Algebra, Hoffman and Kunze

Start with hints

Do you really need a hint? Try it first!

Let’s first try an easier problem first :
  • Whether there exists a and b such that I = a N + b M,where N and M are nilpotent matrices and a,b are real numbers ?
  • To use the given definition to prove or disprove this we need to take powers and things will become too messy for larger n though here it is 3.[We have to take only \(A^3=0\) it is a small exercise to verify]
  • So let us recapitulate some properties of nilpotent matrices: They are the matrices which has only eigenvalue 0. How to use this?
  • We wish to have some linear operator acting on the right side for the RHS is a linear combination and the natural choice is Trace.
  • Trace of a nilpotent matrix is 0.
  • Now assume that I is a finite linear combination of Nilpotent matrices and then take Trace Operator on both sides.
  • Thus LHS has trace n and RHS has trace 0.(Contradiction)
  • So the answer is False.
Food for Thought:
  • Observe that the order of the matrices is not at all a big issue here!
  • Does span of the nilpotent matrices contain all the matrices with trace 0?
  • Hint:Try to find all the 2×2 nilpotent matrices and check the above statement out!

Watch the video

Connected Program at Cheenta

College Mathematics Program

The higher mathematics program caters to advanced college and university students. It is useful for I.S.I. M.Math Entrance, GRE Math Subject Test, TIFR Ph.D. Entrance, I.I.T. JAM. The program is problem driven. We work with candidates who have a deep love for mathematics. This program is also useful for adults continuing who wish to rediscover the world of mathematics.

Similar Problems

Sequences & Subsequences : IIT 2018 Problem 10

This problem appeared in IIT JAM 2018 whch pricisely reqiures concepts of sequences and subsequences from mathematical field real analysis

Cyclic Groups & Subgroups : IIT 2018 Problem 1

This is an application abstract algebra question that appeared in IIT JAM 2018. The concept required is the cyclic groups , subgroups and proper subgroups.

Acute angles between surfaces: IIT JAM 2018 Qn 6

This is an application analysis question that appeared in IIT JAM 2018. The concept required is the multivarible calculus and vector analysis.

Finding Tangent plane: IIT JAM 2018 problem 5

What are we learning?Gradient is one of the key concepts of vector calculus. We will use this problem from IIT JAM 2018 will use these ideasUnderstand the problemThe tangent plane to the surface $latex z= \sqrt{x^2+3y^2}$ at (1,1,2) is given by \(x-3y+z=0\)...

An excursion in Linear Algebra

Did you know Einstein badly needed linear algebra? We will begin from scratch in this open seminar and master useful tools on the way. The open seminar on linear algebra is coming up on 14th November 2019, (8 PM IST).

Linear Algebra total recall (Open Seminar)

Open Seminar on linear algebra. A review of all major ideas. Even if you have little or no knowledge about Linear Algebra, you may join. Register now.

4 questions from Sylow’s theorem: Qn 4

I have prepared some common questions ok application of Sylow’s theorem with higher difficulty level. It is most propably cover all possible combination.

4 questions from Sylow’s theorem: Qn 3

I have prepared some common questions ok application of Sylow’s theorem with higher difficulty level. It is most propably cover all possible combination.

4 questions from Sylow’s theorem: Qn 2

I have prepared some common questions ok application of Sylow’s theorem with higher difficulty level. It is most propably cover all possible combination.

4 questions from Sylow’s theorem: Qn 1

I have prepared some common questions ok application of Sylow’s theorem with higher difficulty level. It is most propably cover all possible combination.