Proving Inverse Matrices: Simplifying the Last Step

  • Thread starter Thread starter swuster
  • Start date Start date
  • Tags Tags
    Inverse Matrices
swuster
Messages
40
Reaction score
0

Homework Statement


I'm trying to show that a given matrix is the inverse of the other, by showing that multiplying them together generates the identity matrix. I can't see a way to simplify the last step and I feel like I'm missing something..? Any input on this would be helpful. Thanks!

Homework Equations


see below
j = sqrt(-1)

The Attempt at a Solution


ece2200.jpg

How do I prove that the rest of the terms are 0?
 

Attachments

  • ece2200.jpg
    ece2200.jpg
    26.4 KB · Views: 461
Physics news on Phys.org
It looks to me like the last sentence, which you cut off at the comma, might give you a hint. What does it say?
 
It's not cut off. It's as far as I have gotten with the proof, haha. There is nothing obvious that jumps out at me when I consider the case where the exponential argument isn't 0.
 
Try using

\sum_{m=0}^{M-1} z^m = \frac{1 - z^{M}}{1 - z}

which holds for any complex number z \neq 1.
 
Thanks so much! That did the trick!

finishedproof.jpg
 
swuster said:
Thanks so much! That did the trick!

finishedproof.jpg

Looks good, nice job.

It's also insightful to consider what is going on geometrically.

This sum:

\sum_{i=0}^{M-1}\frac{1}{M}e^{j\left(\frac{2\pi(\lambda-\kappa)i}{M}\right)

is calculating the average of M complex numbers. Furthermore, since \lambda - \kappa is a nonzero integer, these complex numbers are evenly spaced samples around the unit circle, so their average is zero.
 
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

Back
Top