Dimension of set of all linear maps that map three elements to zero

Click For Summary
The discussion revolves around determining the dimensions of linear maps that send three elements to zero. It highlights the importance of considering simpler cases, such as when only one vector, v1, is mapped to zero. The dimensions a and b are defined as the dimensions of vector spaces V and W, respectively. Utilizing the rank-nullity theorem, the dimension of the kernel is calculated as ab - b when v1 is nonzero, and as ab when v1 is the zero vector. This analysis aids in understanding the structure of linear maps in the context of vector spaces.
Mr Davis 97
Messages
1,461
Reaction score
44
Homework Statement
Note that V and W are finite dimensional vector spaces.
I know how to do the similar problem when we're looking at all of the linear maps that map ALL elements to zero (in this case you can use the rank-nullity theorem to get a definite answer on the dimension). But I am not sure how to approach this one. It seems that upperbound is (dim V)(dim W) if all the vectors ##v_1, v_2, v_3## are just the zero vectors. But I am not sure about the lower bound.
Relevant Equations
rank-nullity theorem?
Question.png
 
Physics news on Phys.org
What are a and b?

It might help to consider the simpler case where just ##v_1## goes to zero. If you're still not sure, pick V and W to be like, ##\mathbb{R}^4## and ##\mathbb{R}^3## and let ##v_1=(1,0,0,0)## and try that case.
 
Office_Shredder said:
What are a and b?

It might help to consider the simpler case where just ##v_1## goes to zero.
Sorry, ##a = \operatorname{dim} V## and ##b = \operatorname{dim} W##.

And yeah, I actually did that and I think I was able to solve it in that case. Basically, if we're trying to find the dimension of ##\{ T\in \mathrm{Hom}(V,W) : T(v_1) = 0 \}##, where ##v_1## is nonzero, then if we define the map ##\phi : \mathrm{Hom}(V, W) \to W## where ##\phi (T) = T(v_1)##, we get, using the rank-nullity theorem, and recognizing that the image of ##\phi## is ##W##, that ## \operatorname{dim} (\ker (\phi)) = ab - b ##. If ##v_1## is the zero vector, then we just get that ##\operatorname{dim} (\ker (\phi)) = ab##.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
5
Views
1K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K