Prove U1+U2+U3 Theorem with Dimensions

  • Thread starter Thread starter pte419
  • Start date Start date
  • Tags Tags
    Dimensions
pte419
Messages
4
Reaction score
0
1. For subsets U1, U2, U3 of a finite set, prove that

dim(U1+U2+U3) = dimU1 + dimU2 + dimU3 - dim(U1∩U2) - dim(U1∩U3) - dim(U2∩U3) + dim(U1∩U2∩U3)



2. dim(U1+U2) = dimU1 + dimU2 - dim(U1∩U2)



3. I found that U1+U2 theorem in my book, and I think I should use that, but I'm not sure where to start...
 
Physics news on Phys.org
Let V = U1 + U2. Now apply the theorem to V + U3.

Unless you are asked to prove 2 before proving 1. If this is the case please make it clear.
 
Last edited:
The two equations are also true, and easier to see, with the vectors spaces replaced by finite sets and the dimensions replaced by the sizes of the sets. It's possible, by picking certain bases, to make the two problems equivalent. But, as enumaelish hints, induction is probably easier.
 
proof

I am only asked to prove equation one, but in doing that, I am allowed to use equation 2.
 
Thanks guys, I've got one more question.

I did: dim(V+U3)
and I've ended up with:
dim(V+U3) = dimU1 + dimU2 - dim(U1∩U2) + dimU3 - dim(V∩U3)

Is there a property I can use to show that dim(V∩U3) is equivalent to the terms I still need to include for the proof? I can't find anything helpful in my book...
 
dim(V\cap U_{3}) = dim((U_{1}+U_{2})\cap U_{3}) = dim((U_{1}\cap U_{3}) + (U_{2}\cap U_{3}))

Break that term up again using the second part and you're done.
 
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...
Back
Top