Homotopic Jordan curves in C [pic included]

  • Thread starter Thread starter mick25
  • Start date Start date
  • Tags Tags
    Curves
Click For Summary
SUMMARY

This discussion centers on the concepts of homotopic and non-homotopic Jordan curves within the context of complex analysis. A Jordan curve is defined as a simple closed curve that separates the complex plane into an inside and outside, with specific properties regarding boundedness and connectedness. The conversation highlights the uniqueness of Jordan curves, particularly in the presence of omitted points in the topological space, such as the origin and the points -1, i, and 1. The participants clarify that two curves can share the same index yet remain non-homotopic due to the inability to continuously deform one into the other without crossing excluded points.

PREREQUISITES
  • Understanding of Jordan curves in complex analysis
  • Familiarity with homotopy and topological spaces
  • Knowledge of complex plane properties
  • Basic concepts of connectedness and boundedness in topology
NEXT STEPS
  • Study the properties of Jordan curves in complex analysis
  • Explore the concept of homotopy in greater depth
  • Investigate the implications of omitted points in topological spaces
  • Learn about the index of curves and its significance in topology
USEFUL FOR

Mathematicians, students of complex analysis, and anyone interested in advanced topology concepts, particularly those studying the properties and classifications of Jordan curves.

mick25
Messages
13
Reaction score
0
This isn't homework but I'm having trouble understanding the concept of non-homotopic and homotopic Jordan curves.

My understanding of Jordan curves and homotopy:

A Jordan curve is a simple closed curve (ie a closed curve that only intersects at the endpoints; f(z1)=f(z2) => z1=z2) such that its exterior is a disjoint union of two open sets:

i) the "inside" (of the J. curve) is a bounded connected open set
ii) the "outside" (of the J. curve) is an unbounded connected open set
iii) the said Jordan curve is the boundary of BOTH "inside" and "outside" (not true for general curves)

Two closed curves, f1, f2 are homotopic in a connected open set A in C when we can continuously deform with closed curves fk; k in [0,1].​

This is an example from my lecture notes:

Let A = C\<0>; ie. A is the complex plane with a "hole" at the origin

There are precisely 3 non-homotopic Jordan curves in A.

fm4zuq.jpg


Here's my confusion:
thanks Office Shredder
 
Last edited:
Physics news on Phys.org
The boundary of a set is the points you get in it's closure, if the origin is omitted from your topological space to begin with, it cannot possibly be in the closure of any set
 
Office_Shredder said:
The boundary of a set is the points you get in it's closure, if the origin is omitted from your topological space to begin with, it cannot possibly be in the closure of any set

Looks like I had a brain fart there haha, jeez I feel dumb. Thanks.

Also, I have another question if you could answer it: what makes a Jordan curve unique?

For example, there is this question: Sketch infinitely many non-homotopic Jordan curves in C\<-1, i, 1>.

4v1c2v.jpg


I have these two curves f1 and f2: they have the same index at each point but aren't these two curves essentially the same?
 
They're not essentially the same (that is, they're not homotopic) because you can't continuously transform one into the other while staying in the set. That's what homotopic means. Remember that (-1,1,i) have been removed from the set. There's no way you can continuously morph the first curve into the second without having an intermediate curve that passes through i. That's not allowed since i is not in the set. Thus, they're not homotopic.

Think of the removed points as posts in the ground and the jordan curve as a loop of string. It's not a perfect analogy since technically you would need a string that could pass through itself, but it's still helpful for visualizing these problems. For the infinite number of non-homotopic curves, imagine dropping your loop of string around one post (-1), wrapping the loop and arbitrary number of times arouND -1 and i (in such a way that it doesn't cross itself), and then finally dropping the other end over the final post (+1).

Good luck on the midterm on Monday :biggrin:
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 61 ·
3
Replies
61
Views
12K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 26 ·
Replies
26
Views
5K