|Feb25-12, 02:02 PM||#1|
Sub-quotients and Gaussian Integer rings
This has to do with number theory along with group and set theory, but the main focus of the proof is number theory, so forgive me if I'm in the wrong place. I've been struggling to understand a piece of a proof put forth in my book. I know what the Gaussian integers are exactly, and what a subquotient group and isomorphism is (although probably not perfectly, right?), but I don't know what pZ[i] is exactly.
p is a prime.
"We know that p is reducible [ie p=(a+bi)(a-bi), a,b∈Z] iff (p)=pZ[i] is not prime.
Consider the isomorphisms
If p≠2, we have
(p) reducible⇔X2+1 factors in Fp[X]"
⇔-1∈(Fp*)2, the group of squares in Fp*
⇔p congruent to 1 mod(4) (Euler's criterion)
I just barely know where to start with what he's getting at. What is (p), exactly? What is Z[X] and Fp[X]?
|Feb25-12, 02:09 PM||#2|
(p) is the ideal generated by p in Z[i].
Z[X] and F_p[X] are the rings of polynomials in the indeterminate X with coefficients in the rings Z and F_p, resp.
What your book is doing is showing that just because p is a prime in Z (so the ideal generated by p in Z is a prime ideal), it doesn't follow that the ideal generated by p is prime in Z[i]. The book is (essentially) trying to determine when this is the case, which is precisely when the quotient Z[i]/(p) is a domain.
P.S. You probably don't mean to say "subquotient" here; "quotient" will do just fine.
|Feb25-12, 09:59 PM||#3|
|Similar Threads for: Sub-quotients and Gaussian Integer rings|
|z Gaussian integer and (z|uv => z|u or z|v) then z is a Gaussian prime||Calculus & Beyond Homework||0|
|Polynomial Rings/Fields/Division Rings||Calculus & Beyond Homework||9|
|Frequency of Greatest Integer quotients||Linear & Abstract Algebra||4|
|Angular momentum - integer or half-integer||Quantum Physics||2|
|Proof Question: Prove integer + 1/2 is not an integer||Calculus & Beyond Homework||4|