Congruence Class Relationships in \mathbb{Q}[\sqrt{3}]

  • Thread starter Brimley
  • Start date
  • Tags
    Class
In summary, the three relationships (A, B, and C) exist because of the factorization of x^3 - 1 into linear factors in \mathbb{Q}[\sqrt{3}]. By manipulating the equations, it can be shown that x^3 \equiv 1 (mod \lambda)^3 for x \equiv 1 (mod \lambda), x^3 \equiv -1 (mod \lambda)^3 for x \equiv -1 (mod \lambda), and x^3 \equiv 0 (mod \lambda)^3 for x \equiv 0 (mod \lambda). This is due to the fact that x can be written as a combination of a and b, which are integers in
  • #1
Brimley
77
0
Hello PhysicsForums!

I had been reading up on a congruence classes when I came across an example that miffed me. A lot of information was given but I can't seem to make sense of it: Here it is:

Assume [itex]\lambda = (3+\sqrt{-3})/2 \in \mathbb{Q}[\sqrt{3}][/itex]. We know that [itex]\lambda[/itex] is prime and that there are three congruence classes [itex] (mod \lambda)[/itex], one with 0, one with 1, and the last with -1.

The following three relationships exist:
A. If [itex]x \equiv 1 (mod \lambda)[/itex], then [itex]x^3 \equiv 1 (mod \lambda)^3[/itex].
B. If [itex]x \equiv -1 (mod \lambda)[/itex], then [itex]x^3 \equiv -1 (mod \lambda)^3[/itex].
C. If [itex]x \equiv 0 (mod \lambda)[/itex], then [itex]x^3 \equiv 0 (mod \lambda)^3[/itex].

Can someone help explain to me why these three relationships exist? I don't know if factoring [itex]x^3 - 1[/itex] in [itex]\mathbb{Q}[\sqrt{d}][/itex] completely into linear factors can help, but its an idea.
 
Physics news on Phys.org
  • #2
A. follows from x^3 - 1 = (x-1)(x - w)(x - w^2) where w is a primitive 3rd root of unity, i.e. 1 - w = (3 + sqrt(-3))/2 = lambda.

B. similar.
C. trivial.

Yes, factoring x^3 - 1 completely helps.
 
  • #3
hochs said:
A. follows from x^3 - 1 = (x-1)(x - w)(x - w^2) where w is a primitive 3rd root of unity, i.e. 1 - w = (3 + sqrt(-3))/2 = lambda.

B. similar.
C. trivial.

Yes, factoring x^3 - 1 completely helps.

Okay, so let me make sure I'm getting this right:

A. [itex]x^3 - 1 = (x - 1)(x - w)(x - w^2)[/itex] where [itex]w[/itex] is a primitive third root of unit, or [itex] w = (-1-\sqrt{-3})/2[/itex]. This can be written as also as [itex]1 - w = (3+\sqrt{-3})/2 = 1 - \lambda[/itex], however I don't see the significance of writing it in this form.

Does the following above truly prove why that relationship exists? I want to be sure I understand A before I try to explain my interpretation of B and C.
 
  • #4
You mean 1 - w = (3 + sqrt(-3))/2 = lambda.

If x = 1 (mod lambda), then x = 1 + a(1 - w) + b(1 - w)^2 for some a,b integers (the ring of integers in this cyclotomic field is Z[1 - w]). Note that all of x-1, x-w, and x-w^2 are now divisible by 1-w = lambda.
 
  • #5
hochs said:
You mean 1 - w = (3 + sqrt(-3))/2 = lambda.

If x = 1 (mod lambda), then x = 1 + a(1 - w) + b(1 - w)^2 for some a,b integers (the ring of integers in this cyclotomic field is Z[1 - w]). Note that all of x-1, x-w, and x-w^2 are now divisible by 1-w = lambda.

I didn't know why you intentionally wrote it in the form of [itex](1 - w)[/itex] as opposed to [itex]w[/itex], however I see why now. I understand why this makes the relation on the left side true, but I don't see how it explains the right side, [itex]x^3 \equiv 1 (mod \lambda)^3[/itex]. Could you explain this?
 
  • #6
Brimley said:
I didn't know why you intentionally wrote it in the form of [itex](1 - w)[/itex] as opposed to [itex]w[/itex], however I see why now. I understand why this makes the relation on the left side true, but I don't see how it explains the right side, [itex]x^3 \equiv 1 (mod \lambda)^3[/itex]. Could you explain this?

Same story, except with x^3 + 1 = (x+1)(x + w)(x + w^2) now.
 
  • #7
hochs said:
Same story, except with x^3 + 1 = (x+1)(x + w)(x + w^2) now.

I'm just trying to make the connection between the translation you made from the right side of the first equation and the second (shown below again):

RHS1: [itex]1 + a(1 - w) + b(1 - w)^2[/itex].
RHS2: [itex](x + 1)(x + w)(x + w^2)[/itex].

The differences in form and the omission of a and b are confusing me.
 
  • #8
Brimley said:
I'm just trying to make the connection between the translation you made from the right side of the first equation and the second (shown below again):

RHS1: [itex]1 + a(1 - w) + b(1 - w)^2[/itex].
RHS2: [itex](x + 1)(x + w)(x + w^2)[/itex].

The differences in form and the omission of a and b are confusing me.

... just do the exact same thing with x = -1 + a*(1 - w) + b*(1 - w)^2.
 
  • #9
hochs said:
... just do the exact same thing with x = -1 + a*(1 - w) + b*(1 - w)^2.

I'm totally confused as to what you mean by this (as I was trying to explain in my previous post) simply because I'm not making the relation to what you wrote afterwards for [itex]x^3 \equiv 1 (mod \lambda)^3[/itex].
 
  • #10
Brimley said:
I'm totally confused as to what you mean by this (as I was trying to explain in my previous post) simply because I'm not making the relation to what you wrote afterwards for [itex]x^3 \equiv 1 (mod \lambda)^3[/itex].

For the first one, if x = 1 (mod lambda) then x = 1 + a*(1 - w) + b*(1 - w)^2. Then x-1, x-w, x-w^2 are all divisible by lambda, so clearly x^3 - 1 = (x-1)(x-w)(x-w^2) is divisible by lambda^3.

Do the same for part B.

Part C is trivial.
 
  • #11
hochs said:
For the first one, if x = 1 (mod lambda) then x = 1 + a*(1 - w) + b*(1 - w)^2. Then x-1, x-w, x-w^2 are all divisible by lambda, so clearly x^3 - 1 = (x-1)(x-w)(x-w^2) is divisible by lambda^3.

Do the same for part B.

Part C is trivial.

How do you reach the conclusion I have bolded above? I'm trying to manipulate this algebraically but I don't see it.
 
  • #12
Brimley said:
How do you reach the conclusion I have bolded above? I'm trying to manipulate this algebraically but I don't see it.

if x = 1 + a*(1 - w) + b*(1 - w)^2 then x - 1 = a*(1 - w) + b*(1 - w)^2 = (1-w)*(a + b*(1 - w)) is clearly divisible by 1-w = lambda. It's exactly the same trivial algebraic verifications for the others.
 
  • #13
hochs said:
if x = 1 + a*(1 - w) + b*(1 - w)^2 then x - 1 = a*(1 - w) + b*(1 - w)^2 = (1-w)*(a + b*(1 - w)) is clearly divisible by 1-w = lambda. It's exactly the same trivial algebraic verifications for the others.

Okay, I see what you did there, but how did you get from:

[itex](1 - w)*(a + b*(1-w))[/itex]

to

[itex](x-1)(x-w)(x-w^2)[/itex]?
 
  • #14
Brimley said:
Okay, I see what you did there, but how did you get from:

[itex](1 - w)*(a + b*(1-w))[/itex]

to

[itex](x-1)(x-w)(x-w^2)[/itex]?

I didn't. Just show that x-1, x-w, and x-w^2 are each divisible by 1-w. I can't give more hints than this. I feel like I'm doing your homework 100%.
 
  • #15
hochs said:
I didn't. Just show that x-1, x-w, and x-w^2 are each divisible by 1-w. I can't give more hints than this. I feel like I'm doing your homework 100%.

This isn't homework at all. I'm just trying to understand that. I guess I'm just confused in your translation from using a,b,w to using solely x and w.
 
  • #16
Brimley said:
This isn't homework at all. I'm just trying to understand that. I guess I'm just confused in your translation from using a,b,w to using solely x and w.

You just need to show that each of x-1, x-w, and x-w^2 are divisible by lambda to show that x^3 - 1 = (x-1)(x-w)(x-w^2) is divisible by lambda^3.

The above sentence should've been super clear. If not, think more.

So it suffices to show that each of x-1, x-w, and x-w^2 are divisible by lambda. This is what you need to show.
 
  • #17
hochs said:
You just need to show that each of x-1, x-w, and x-w^2 are divisible by lambda to show that x^3 - 1 = (x-1)(x-w)(x-w^2) is divisible by lambda^3.

The above sentence should've been super clear. If not, think more.

So it suffices to show that each of x-1, x-w, and x-w^2 are divisible by lambda. This is what you need to show.

So I should have the following then (for a truly complete explanation):

A. [itex]x \equiv 1 (mod \lambda)[/itex], then [itex] x^3 \equiv 1(mod \lambda)^3[/itex].

If [itex] x = 1 (mod \lambda)[/itex], then [itex] x = 1 + a*(1 - w) + b*(1 - w)^2. [/itex]
[itex]x - 1 = a*(1 - w) + b*(1 - w)^2[/itex]
[itex] = (1 - w)*(a + b*(1 - w))[/itex]. Clearly, this is divisible by [itex]1 - w = \lambda[/itex]. From here, we can see that:

[itex] x^3 - 1 = (x - 1)(x - w)(x - w^2)[/itex] is also divisible by [itex]1-w = \lambda[/itex], and hence also divisible by [itex]\lambda[/itex]. Since this is divisible by [itex]\lambda[/itex], this means it is also divisble by [itex]\lambda^3[/itex] (This last line seems weak).

Afterwards I'll just explain what I think the mods for B and C should be.
 
  • #18
Brimley said:
So I should have the following then (for a truly complete explanation):

A. [itex]x \equiv 1 (mod \lambda)[/itex], then [itex] x^3 \equiv 1(mod \lambda)^3[/itex].

If [itex] x = 1 (mod \lambda)[/itex], then [itex] x = 1 + a*(1 - w) + b*(1 - w)^2. [/itex]
[itex]x - 1 = a*(1 - w) + b*(1 - w)^2[/itex]
[itex] = (1 - w)*(a + b*(1 - w))[/itex]. Clearly, this is divisible by [itex]1 - w = \lambda[/itex]. From here, we can see that:

[itex] x^3 - 1 = (x - 1)(x - w)(x - w^2)[/itex] is also divisible by [itex]1-w = \lambda[/itex], and hence also divisible by [itex]\lambda[/itex]. Since this is divisible by [itex]\lambda[/itex], this means it is also divisble by [itex]\lambda^3[/itex] (This last line seems weak).

Afterwards I'll just explain what I think the mods for B and C should be.

Just wow... are you a native English speaker?

I told you, you need to show separately that x-1, x-w, and x-w^2 are all divisible by lambda. That's 3 statements to show.

my god..
 
  • #19
Alright I'm wasting way too much time on this triviality. Here's the complete ****ing proof, leave me alone now:

if x = 1 (mod lambda) then x = 1 + a*(1 - w) + b*(1 - w)^2 for some integers a,b.

Then x-1 = a*(1 - w) + b*(1 - w)^2 is divisible by 1-w clearly.

x-w = 1 - w + a*(1 - w) + b*(1 - w)^2 = (1-w)(1 + a + b*(1 - w)) is divisible by 1-w clearly.

Finally,
x-w^2 = 1 - w^2 + a*(1 - w) + b*(1 - w)^2 = (1 - w)(1 + w) + a*(1 - w) + b*(1 - w)^2 = (1 - w)(1 + w + a + b(1 - w)) is divisible by 1-w.

So all of x-1, x-w, and x-w^2 are divisible by lambda. Do you not see that (x - 1)(x - w)(x - w^2) is now divisible by lambda^3 ?
 
  • #20
hochs said:
Just wow... are you a native English speaker?

I told you, you need to show separately that x-1, x-w, and x-w^2 are all divisible by lambda. That's 3 statements to show.

my god..

I'm sorry about your frustration hochs! I'm really trying here! (Btw, it takes a ton of time to write it in LaTeX, but I think its easier on the eyes of those reading it herein). I'm putting in the time and effort to understand this, so I do appreciate the patience!

If you remember, I told you in several posts that I had trouble understanding your translation from using [itex]a,b,[/itex] and [itex]w[/itex] to just [itex]x[/itex] and [itex]w[/itex]. I'm strill trying to make that connection, then I could better attempt explaining why [itex]\lambda[/itex] divides [itex]x-1,x-w,[/itex] and [itex]x-w^2[/itex].
 
  • #21
hochs said:
if x = 1 (mod lambda) then x = 1 + a*(1 - w) + b*(1 - w)^2 for some integers a,b.

Then x-1 = a*(1 - w) + b*(1 - w)^2 is divisible by 1-w clearly.

x-w = 1 - w + a*(1 - w) + b*(1 - w)^2 = (1-w)(1 + a + b*(1 - w)) is divisible by 1-w clearly.

Finally,
x-w^2 = 1 - w^2 + a*(1 - w) + b*(1 - w)^2 = (1 - w)(1 + w) + a*(1 - w) + b*(1 - w)^2 = (1 - w)(1 + w + a + b(1 - w)) is divisible by 1-w.

So all of x-1, x-w, and x-w^2 are divisible by lambda. Do you not see that (x - 1)(x - w)(x - w^2) is now divisible by lambda^3 ?

I do see it now. I really appreciate it, but please don't get mad at me. I'm just trying to understand what you were doing, and I had most of it but was confused in the translation. Seeing that performed makes sense of it. I do appreciate it and I understand your frustration, but please don't get mad at someone who is just trying to learn mathematics.

I take it to alter this for part B, all I would need to do is flip the + and - signs for part A's?
Is there a quick explanation on why part C's is trivial?
 
  • #22
Brimley said:
I take it to alter this for part B, all I would need to do is flip the + and - signs for part A's?

interesting thread. I've tried my best to follow along and i believe that this is all you need to do. hochs should confirm it first though as he's beek working with you this whole time.
 
  • #23
stoolie77 said:
interesting thread. I've tried my best to follow along and i believe that this is all you need to do. hochs should confirm it first though as he's beek working with you this whole time.

Can anyone help me finish this? Stoolie I appreciate your input, but yes, I'd really appreciate if someone could confirm this or give me a hand finishing this.
 

What is a congruence class?

A congruence class is a set of integers that have the same remainder when divided by a specific integer, known as the modulus.

How is a congruence class represented?

A congruence class is typically denoted by [a] or {a} where a is an integer. The brackets or curly braces indicate that the set contains all integers that are congruent to a modulo the given modulus.

What is the importance of congruence classes?

Congruence classes are important in number theory as they allow us to group integers with similar properties. They also help in simplifying calculations involving remainders and modular arithmetic.

How are congruence classes related to modular arithmetic?

Congruence classes are closely related to modular arithmetic, where the modulus is used to define a new number system. In this system, all integers are grouped into congruence classes, and operations such as addition, subtraction, and multiplication are performed within these classes.

What is the difference between a congruence class and an equivalence class?

A congruence class is a subset of integers, while an equivalence class is a subset of elements from a larger set that are related to each other by a specific equivalence relation. In simpler terms, congruence classes deal with numbers and equivalence classes deal with objects or concepts.

Similar threads

  • Linear and Abstract Algebra
Replies
2
Views
705
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
17
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
979
  • Precalculus Mathematics Homework Help
Replies
27
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
670
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
25
Views
1K
  • Calculus and Beyond Homework Help
Replies
30
Views
2K
Back
Top