Defining Notion of Congruence for Quadratic Integers in Q[sqrt(-d)]

[Brimley]

Hello PhysicsForums!

I had been reading some examples of notions of congruence and I came across one that miffed me. I was hoping that someone could help me define this notion of congruence as described below.

If \alpha is a quadratic integer in Q[\sqrt{-d}], a notion of congruence (mod \alpha) can be defined. Additionally, the +,-, and x can be defined for for congruence classes.

Can someone help me define this notion of congruence as well as the +,-, and x for congruence classes?

Much Thanks, --Brim

 

[hochs]

You just mod the ring of integers by the ideal generated by element \alpha.

 

[Brimley]

You just mod the ring of integers by the ideal generated by element \alpha.

Could someone maybe expand/elaborate on hochs post as well as address the cases I had mentioned above? Thanks --Brim

 

[ramsey2879]

Could someone maybe expand/elaborate on hochs post as well as address the cases I had mentioned above? Thanks --Brim

I am not sure but I think the ideal of \alpha = A + B\sqrt{-D} is A^2 +B^2*D which is found by multiplying \alpha by its complement.
Therefore, the ring of integers would be {0,1,2,3 ... A^2 + B^2*D - 1}.

 

[Brimley]

I am not sure but I think the ideal of \alpha = A + B\sqrt{-D} is A^2 +B^2*D which is found by multiplying \alpha by its complement.

Can anyone confirm this? And what is meant by modding the ring of integers by this \alpha ?

 

[Brimley]

Therefore, the ring of integers would be {0,1,2,3 ... A^2 + B^2*D - 1}.

If this is true, how to we modify this to define the + , -, x notions of congruence for congruence classes? --Brim

 

[hochs]

Simply define +,-,x on the representatives (as usual), then check that it's well-defined. The equivalence relation is two algebraic integers x,y in the field are equivalent iff x - y = \alpha * k for some algebraic integer k in the field.

And no, I didn't mean take the norm of alpha and look at Z/(norm of alpha) (which is what the above posts are doing).

In particular, the number of elements in the congruence class is |Norm of alpha|.

 

[Brimley]

Simply define +,-,x on the representatives (as usual), then check that it's well-defined. The equivalence relation is two algebraic integers x,y in the field are equivalent iff x - y = \alpha * k for some algebraic integer k in the field.

And no, I didn't mean take the norm of alpha and look at Z/(norm of alpha) (which is what the above posts are doing).

In particular, the number of elements in the congruence class is |Norm of alpha|.

Okay, I'm confused between what hochs and ramsey2879 are saying here. Hochs said above he didn't mean to take the norm of alpha and look at Z/(norm of alpha).

I essentially don't know what he's saying, nor what he means by "simply define +,-,x on the representatives (as usual), then check that it's well-defined " or how to use this equivalence relation.

Can someone help explain this and put this together? (if possible take it from the top?)

 

[hochs]

Okay, I'm confused between what hochs and ramsey2879 are saying here. Hochs said above he didn't mean to take the norm of alpha and look at Z/(norm of alpha).

I essentially don't know what he's saying, nor what he means by "simply define +,-,x on the representatives (as usual), then check that it's well-defined " or how to use this equivalence relation.

Can someone help explain this and put this together? (if possible take it from the top?)

Tell me, do you know some abstract algebra? Do you know what integral closure is? How much algebra and number theory do you know? I'm asking this so I can explain in accordance to your level.

 

[Brimley]

Tell me, do you know some abstract algebra? Do you know what integral closure is? How much algebra and number theory do you know? I'm asking this so I can explain in accordance to your level.

I had taken abstract algebra and number theory years ago, however this is brushing up. I totally understand what you and ramsey are saying individually, but I'm not seeing how they coexist and mesh with one another. If you or someone could make one accurate explanation that flows from one piece to another, I'd really appreciate it. At the moment, I'm lost trying to combine yours and ramsey's posts together into something conclusive.

 

[hochs]

I had taken abstract algebra and number theory years ago, however this is brushing up. I totally understand what you and ramsey are saying individually, but I'm not seeing how they coexist and mesh with one another. If you or someone could make one accurate explanation that flows from one piece to another, I'd really appreciate it. At the moment, I'm lost trying to combine yours and ramsey's posts together into something conclusive.

I personally feel that what Ramsey is saying is irrelevant to your question, since you're asking how to define (mod alpha) for the ring of integers, O_K with K = your quadratic field.

For analogy How would you define (mod n) for the integers? You mod the ring Z by the ideal generated by n, nZ, to get Z/nZ the congruence group mod n.

By analogy if you have \alpha in the ring of integers O_K, you can form O_K / (\alpha), which is the ring of integers in K mod the ideal generated by \alpha. This is a perfectly good ring and is what people usually mean by (mod \alpha) in ring of integers.

In some literature you may find people saying x mod p, where p is a rational prime. What they mean is that K is galois over Q, so that every residue field of any prime lying above p in K is the same, and you look at the ring of integers in K modulo any prime ideal lying above p.

 

[Brimley]

I personally feel that what Ramsey is saying is irrelevant to your question, since you're asking how to define (mod alpha) for the ring of integers, O_K with K = your quadratic field.

That is what I was saying, I couldn't piece the two of yours together.

You mod the ring Z by the ideal generated by n, nZ, to get Z/nZ the congruence group mod n.

Could you explain this in a little more detail?

By analogy if you have \alpha in the ring of integers O_{K}, you can form O_{K} / (\alpha), which is the ring of integers in K mod the ideal generated by \alpha. This is a perfectly good ring and is what people usually mean by (mod \alpha) in ring of integers.

So summing it up, what will the notion of congruence mod \alpha be defined as?

 

[hochs]

Could you explain this in a little more detail?

Um, Z is a ring, n is an element of Z, nZ = {nx : x is integer} is an ideal of Z, so you can form a factor ring Z/nZ, which has n elements. This is just the ring of integers modulo n. You should already be very familiar with this from your response.

So summing it up, what will the notion of congruence mod \alpha be defined as?

I already explained! If O_K is the ring of integers in K, then mod \alpha is just O_K / (alpha * O_K)!

 

[Brimley]

I already explained! If O_K is the ring of integers in K, then mod \alpha is just O_K / (alpha * O_K)!

So how does one define the +,-,[/tex] and x congruence classes? Are the +,- just modifying your statement above by +\alpha and -\alpha?

 

[hochs]

So how does one define the +,-,[/tex] and x congruence classes? Are the +,- just modifying your statement above by +\alpha and -\alpha?

<br /> <br /> The same way you define +,-, x in R/I for any ring R and ideal I. You said you already know abstract algebra, and this is a very standard construction.

 

[Brimley]

The same way you define +,-, x in R/I for any ring R and ideal I. You said you already know abstract algebra, and this is a very standard construction.

I said I took a course in it years ago and I could use some refreshment. Could you please expand on this? (In terms of time utility, it would be more efficient for this example to be finished than for me to dig up my textbooks, read 4 chapters, and flood this forum with questions as opposed to finishing this example here and now).

 

[hochs]

I said I took a course in it years ago and I could use some refreshment. Could you please expand on this? (In terms of time utility, it would be more efficient for this example to be finished than for me to dig up my textbooks, read 4 chapters, and flood this forum with questions as opposed to finishing this example here and now).

I had already given you all the data you need to define this on your own. I don't know why you expect people to spoon-feed trivial verifications, but I'll play along:

define an equivalence class on the integers O_K, by x ~ y iff x - y = \alpha * k for some k in O_K. Check that this is an equivalence relation.

Denote [x] by the class of elements z in O_K that is equivalent to x (so it's a set).

define + and [x] + [y] = [x+y]. You need to check that this is well-defined, i.e. if x ~ x' and y ~ y' then x+y ~ x' + y'.

define - by [x] - [y] = [x-y]. Same Story.

define * by [x]*[y] = [xy]. Same story.

And no, you're going to have to check these yourself.

 

[Brimley]

The only thing that I don't understand is how you define y. Is y an additional set in O_K akin to x ?

 

[hochs]

The only thing that I don't understand is how you define y. Is y an additional set in O_K akin to x ?

?? y is just any other element of O_K, then [y] is another class. [x] is a class and [y] is a class. Now define [x] + [y] by [x+y]. You need to check that this is well-defined. I don't know what/why you're asking this. There's nothing to define for y. That's just an element of O_K.

 

[Brimley]

Denote [x] by the class of elements z in O_K that is equivalent to x (so it's a set).

This is what confused me. I think you meant to say "that is equivalent to [x] (so it's a set)".

Is this correct?

 

[hochs]

This is what confused me. I think you meant to say "that is equivalent to [x] (so it's a set)".

Is this correct?

[x] = {z in O_K : z ~ x}

 

[VKint]

Part of the misunderstanding might be that hochs's original statement, while correct, recommended modding the "ring of integers" by \alpha, which Brimley seems to have interpreted to mean \mathbb{Z} / (\alpha)--which is not well-defined, and which could, therefore, have understandably caused confusion. To clarify, O_k denotes the ring of quadratic integers in the number field \mathbb{Q}(\sqrt{d}), and the ideal (\alpha) consists of all multiples of \alpha in O_k. The quotient O_k / (\alpha) then consists, as hochs said, of all equivalence classes modulo the relation x \equiv y \iff x - y \in (\alpha). In other words, two quadratic integers x and y are equivalent "mod \alpha" if x - y is a multiple of \alpha.

An interesting follow-up question to think about is the question of which ideals in O_k are maximal. If you don't remember what this means, just think about primes in \mathbb{Z}: The integers mod p form a field whenever p is prime (i.e., every nonzero residue class mod p is invertible). Is this always true for "primes" in O_k? What does "prime" even mean there? In the integers, reducing "mod m and mod n" is always equivalent to reducing mod the gcd of m and n. Can a similar construction always work in quadratic integer rings? In particular, when does a meaningful division algorithm exist in O_k?

 

[hochs]

Part of the misunderstanding might be that hochs's original statement, while correct, recommended modding the "ring of integers" by \alpha, which Brimley seems to have interpreted to mean \mathbb{Z} / (\alpha)--which is not well-defined, and which could, therefore, have understandably caused confusion. To clarify, O_k denotes the ring of quadratic integers in the number field \mathbb{Q}(\sqrt{d}), and the ideal (\alpha) consists of all multiples of \alpha in O_k. The quotient O_k / (\alpha) then consists, as hochs said, of all equivalence classes modulo the relation x \equiv y \iff x - y \in (\alpha). In other words, two quadratic integers x and y are equivalent "mod \alpha" if x - y is a multiple of \alpha.

Yes, thank you.

An interesting follow-up question to think about is the question of which ideals in O_k are maximal. If you don't remember what this means, just think about primes in \mathbb{Z}: The integers mod p form a field whenever p is prime (i.e., every nonzero residue class mod p is invertible). Is this always true for "primes" in O_k? What does "prime" even mean there? In the integers, reducing "mod m and mod n" is always equivalent to reducing mod the gcd of m and n. Can a similar construction always work in quadratic integer rings? In particular, when does a meaningful division algorithm exist in O_k?

I'm guessing this is intended for Brimley. The last question regarding division algorithm is, of course, a difficult one.

 

[ramsey2879]

I had taken abstract algebra and number theory years ago, however this is brushing up. I totally understand what you and ramsey are saying individually, but I'm not seeing how they coexist and mesh with one another. If you or someone could make one accurate explanation that flows from one piece to another, I'd really appreciate it. At the moment, I'm lost trying to combine yours and ramsey's posts together into something conclusive.

Please ignore what I said. Back to the drawing board! Sorry I confused the norm with the Ideal, but I am 64 years old and never had math beyond differential and intergral calculas for engineers and I don't remember that much.