Elliptic functions, periodic lattice, equivalence classes

Click For Summary
The discussion centers on the concept of equivalence classes defined by the relation ##z_1 ~ z_2## if ##z_1 - z_2 \in \Omega##, where ##\Omega## is generated by the lattice formed by the basis vectors ##w_1 = i## and ##w_2 = 1##. It is clarified that equivalence classes form a partition of the complex numbers, meaning any two classes are either equal or disjoint. The equivalence classes are represented as ##[z] = {z + mw_1 + nw_2}##, and the notation indicates that if ##z_1 ~ z_2##, then ##[z_1]## and ##[z_2]## refer to the same set. The discussion also emphasizes the importance of identifying unique representatives within these classes to understand their structure better. Overall, the equivalence classes derived from the lattice structure provide a systematic way to categorize complex numbers based on their relationships.
binbagsss
Messages
1,291
Reaction score
12

Homework Statement



##\Omega = {nw_1+mw_2| m,n \in Z} ##

##z_1 ~ z_2 ## is defined by if ##z_1-z_2 \in \Omega ##

My notes say ##z + \Omega## are the cosets/ equivalence classes , denoted by ##[z] = {z+mw_1+nw_2} ##

Homework Equations



above

The Attempt at a Solution



So equivalance classe form a partition, i.e. two elements that are equivalent are within the same equivalence class,

But if I consider ##\Omega ## with basis ##w_1 = i ## ##w_2 =1 ##

##z_1 = 1/2 + i/2 ##, ##z_2 = 1/2-i/2##
Then ##z_1 - z_2 = i \in \Omega ## , ##(m=1, n=0)##

And so ##z_1 ~ z_2 ## so these two are in the same equivalent class right?

However my notes say that ##[z_1]## and ##[z_2]## are each equivalence classes, or is this definition not ##\all z \in C##, what is an efficient way to look, from the basis, which ##z \in C## are equivalent so how many equivalence classes there will be?

thanks in advance

- also a notation question:
Say ##~## is defined by the difference between ##x \in Z## being ##2##, then equivalence classes are odd and even numbers, and we use the notation ##[1],[7],[3]..## represent the same element for ##Z/\~##

Can you equally use the notation ##[1]=[7]## (mod 2) ?

So above I can either say:
- ##[z_1]=[z_2] ## (mod ##\Omega##)
OR
- ##[z_1],[z_2] ## represent the same element for ##C/\Omega##

and these mean the same thing?
 
Physics news on Phys.org
binbagsss said:

Homework Statement



##\Omega = {nw_1+mw_2| m,n \in Z} ##

##z_1 ~ z_2 ## is defined by if ##z_1-z_2 \in \Omega ##

My notes say ##z + \Omega## are the cosets/ equivalence classes , denoted by ##[z] = {z+mw_1+nw_2} ##

Homework Equations



above

The Attempt at a Solution



So equivalance classe form a partition, i.e. two elements that are equivalent are within the same equivalence class,
I think you are looking for "two equivalence classes are either equal or disjoint".

But if I consider ##\Omega ## with basis ##w_1 = i ## ##w_2 =1 ##

##z_1 = 1/2 + i/2 ##, ##z_2 = 1/2-i/2##
Then ##z_1 - z_2 = i \in \Omega ## , ##(m=1, n=0)##

And so ##z_1 ~ z_2 ## so these two are in the same equivalent class right?

However my notes say that ##[z_1]## and ##[z_2]## are each equivalence classes, or is this definition not ##\all z \in C##, what is an efficient way to look, from the basis, which ##z \in C## are equivalent so how many equivalence classes there will be?

The latex for ~ is \sim.

[z] is the equivalence class of z. [w] is the equivalence class of w. If z ~ w then [z] and [w] are different names for the same set. You should think of [\cdot] as a function from \mathbb{C} to the set of equivalence classes.

Frequently we want to define a function from the set of equivalence classes to some other set where the image of [z] is given by a formula involving z; here we must check that the formula gives the same result for every w \in [z].

For example:

Since \{w_1,w_2\} is a basis for \mathbb{C}, for each z \in \mathbb{C} there exists a unique (n,m) \in \mathbb{Z}^2 and a unique (u,v) \in [0,1)^2 such that z = (n + u)w_1 + (m + v)w_2. Then z_1 \sim z_2 if and only if u(z_1) = u(z_2) and v(z_1) = v(z_2). Hence we may define a bijection \phi from the set E of equivalence classes to [0,1)^2 by \phi([z]) = (u(z),v(z)).
 
binbagsss said:

Homework Statement



##\Omega = {nw_1+mw_2| m,n \in Z} ##

##z_1 ~ z_2 ## is defined by if ##z_1-z_2 \in \Omega ##

My notes say ##z + \Omega## are the cosets/ equivalence classes , denoted by ##[z] = {z+mw_1+nw_2} ##

Homework Equations



above

The Attempt at a Solution



So equivalance classe form a partition, i.e. two elements that are equivalent are within the same equivalence class,
I think you are looking for "two equivalence classes are either equal or disjoint".

But if I consider ##\Omega ## with basis ##w_1 = i ## ##w_2 =1 ##

##z_1 = 1/2 + i/2 ##, ##z_2 = 1/2-i/2##
Then ##z_1 - z_2 = i \in \Omega ## , ##(m=1, n=0)##

And so ##z_1 ~ z_2 ## so these two are in the same equivalent class right?

However my notes say that ##[z_1]## and ##[z_2]## are each equivalence classes, or is this definition not ##\all z \in C##, what is an efficient way to look, from the basis, which ##z \in C## are equivalent so how many equivalence classes there will be?

The latex for ~ is \sim.

[z] is the equivalence class of z. [w] is the equivalence class of w. If z ~ w then [z] and [w] are different names for the same set. You should think of [\cdot] as a function from \mathbb{C} to the set of equivalence classes.

Frequently we want to define a function from the set of equivalence classes to some other set where the image of [z] is given by a formula involving z; here we must check that the formula gives the same result for every w \in [z].

For example:

Since \{w_1,w_2\} is a basis for \mathbb{C}, for each z \in \mathbb{C} there exists a unique (n,m) \in \mathbb{Z}^2 and a unique (u,v) \in [0,1)^2 such that z = (n + u)w_1 + (m + v)w_2. Then z_1 \sim z_2 if and only if u(z_1) = u(z_2) and v(z_1) = v(z_2). Hence we may define a bijection \phi from the set E of equivalence classes to [0,1)^2 by \phi([z]) = (u(z),v(z)).
 
pasmith said:
I think you are looking for "two equivalence classes are either equal or disjoint".
The latex for ~ is \sim.

[z] is the equivalence class of z. [w] is the equivalence class of w. If z ~ w then [z] and [w] are different names for the same set. You should think of [\cdot] as a function from \mathbb{C} to the set of equivalence classes.

Frequently we want to define a function from the set of equivalence classes to some other set where the image of [z] is given by a formula involving z; here we must check that the formula gives the same result for every w \in [z].

For example:

Since \{w_1,w_2\} is a basis for \mathbb{C}, for each z \in \mathbb{C} there exists a unique (n,m) \in \mathbb{Z}^2 and a unique (u,v) \in [0,1)^2 such that z = (n + u)w_1 + (m + v)w_2. Then z_1 \sim z_2 if and only if u(z_1) = u(z_2) and v(z_1) = v(z_2). Hence we may define a bijection \phi from the set E of equivalence classes to [0,1)^2 by \phi([z]) = (u(z),v(z)).

Okay so equivalence classes may be either equal or disjoint, fine.
Now I think my confusion is coming from this... cosets form a partition of the set right?
To be a partition they must be disjoint,##z_1## and ##z_2## are not, they are equal? But my notes say ##[z] ## are cosets?
Or cosets do not form a partition?
Or when my notes say ##[z] ## are cosets it is reffering to non-equivalent ##z_i ## s ?

thanks
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 9 ·
Replies
9
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
19
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K