Exercise 56 in chapter 1 of Lang's algebra

  • Thread starter stupiduser
  • Start date
Hi,

I have been puzzled by this exercise for some time. I won't repeat it here as the hint refers to other exercises, so I would be copying a whole page of the book.

My question is as follows. After having defined the sets [tex]S_i[/tex] and picked a complex number [tex]s[/tex] not belonging to any of the [tex]S_i[/tex] it is trivial to use part (b) of exercise 55 to show that for some large [tex]k[/tex] we have [tex]M_i^k(s)\in S_i[/tex] for all [tex]i[/tex].

Now the problem is that we still need to prove that [tex]M_i^{nk}(s)\in S_i[/tex] for all [tex]n\neq 0[/tex] i.e. all the exponents, but I don't see how this can be done for negative exponents.

Further, I have no idea how to prove that there exists such a [tex]k[/tex] that [tex]M_i^k(S_j)\subset S_i[/tex] for all [tex]j\neq i[/tex] and further for all the exponents of [tex]M_i^k[/tex]. It doesn't even seem plausible that this could happen as any element close to [tex]w'_i[/tex] is (for a large enough [tex]k[/tex]) mapped into [tex]U_i[/tex] i.e. close to [tex]w_i[/tex] by part (b) of the previous exercise. Thus, it would seem that choosing some [tex]z\in U_i'[/tex] closer and closer to [tex]w_i'[/tex] would require [tex]k[/tex] to grove without bound...

I'm just wondering whether anyone has ever done this exercise or has some tips on how to approach it?

Thanks.
 
Nevermind the first part. I just realized that the inverse of a matrix has the same fixed points, so we get the required condition for the element s for negative exponents. This doesn't help with the second problem relating the sets though.
 

Related Threads for: Exercise 56 in chapter 1 of Lang's algebra

Replies
4
Views
761
  • Posted
Replies
2
Views
2K
Replies
7
Views
14K

Physics Forums Values

We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling
We Value Civility
• Positive and compassionate attitudes
• Patience while debating
We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving
Top