Complex analysis again

  • Thread starter Mystic998
  • Start date
  • #1
206
0

Homework Statement



Let [itex]p(z)[/itex] be a polynomial of degree [itex]n \geq 1[/itex]. Show that [itex]\left\{z \in \mathbb{C} : \left|p(z)\right| > 1 \right\}[/tex] is connected with connectivity at most [itex]n+1[/itex].

Homework Equations



A region (connected, open set) considered as a set in the complex plane has finite connectivity n if its complement has n connected components in the extended complex plane.

The Attempt at a Solution



I'm not sure where to start, frankly. Showing the set is connected seems really tricky, though I'm admittedly probably overlooking something really obvious. As for connectivity, I think it has to do with the fact that the complement of the set is [itex]\left\{z \in \mathbb{C} : \left|p(z)\right| \leq 1\right\} \cup \left\{\infty\right\}[/itex] in the extended complex plane. So I think that because the polynomial has at most n roots, any preimage of the first set can have at most n disjoint connected sets mapped to it, then the point at infinity gives you one more connected component. But I'm not sure how to say that rigorously.
 

Answers and Replies

  • #2
206
0
Bump before bed
 

Related Threads on Complex analysis again

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
3
Views
593
  • Last Post
Replies
1
Views
646
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
2
Views
693
  • Last Post
Replies
8
Views
2K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
3
Views
807
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
5
Views
2K
Top