Show that $q$ must divide one of the prime integer factors of $N(q)$.
up vote
3
down vote
favorite
The following is from Aluffi's Algebra
Why this is true? :
.. since q is prime in Z[i] ⊇ Z, q must divide one of
the prime integer factors of N(q).
abstract-algebra number-theory algebraic-number-theory gaussian-integral
asked Dec 3 at 13:07
72D
52416
add a comment |
up vote
3
down vote
favorite
The following is from Aluffi's Algebra
Why this is true? :
.. since q is prime in Z[i] ⊇ Z, q must divide one of
the prime integer factors of N(q).
abstract-algebra number-theory algebraic-number-theory gaussian-integral
asked Dec 3 at 13:07
72D
52416
1
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
The following is from Aluffi's Algebra
Why this is true? :
.. since q is prime in Z[i] ⊇ Z, q must divide one of
the prime integer factors of N(q).
abstract-algebra number-theory algebraic-number-theory gaussian-integral
asked Dec 3 at 13:07
72D
52416
The following is from Aluffi's Algebra
Why this is true? :
.. since q is prime in Z[i] ⊇ Z, q must divide one of
the prime integer factors of N(q).
abstract-algebra number-theory algebraic-number-theory gaussian-integral
abstract-algebra number-theory algebraic-number-theory gaussian-integral
asked Dec 3 at 13:07
72D
52416
asked Dec 3 at 13:07
72D
52416
asked Dec 3 at 13:07
72D
52416
asked Dec 3 at 13:07
72D
52416
asked Dec 3 at 13:07
72D
52416
52416
1
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17
add a comment |
1
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17
1
1
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
This might make a lot more sense to you if you look at specific numbers. I suggest $2$ and $3$.
Although $2$ is prime in $mathbb{Z}$, it's not prime in $mathbb{Z}[i]$, since $(1 - i)(1 + i) = 2$. So $N(2) = 4$, no surprise there. We also see that $N(1 - i) = 2$, and $N(1 + i) = 2$ as well. These facts may not seem obvious but they are easily verified.
And these facts mesh perfectly well with the multiplicative property of the norm function. If $ab = 2$, then $N(a)$ can only be $1$, $2$ or $4$, and the choice of $b$ follows immediately.
Compare $3$, which is indeed prime in both $mathbb{Z}$ and $mathbb{Z}[i]$. Its norm in the latter is still its square, and since it neither ramifies nor splits in this domain, it likewise follows that $N(z) = 3$ is impossible for $z in mathbb{Z}[i]$.
answered Dec 7 at 0:10
Mr. Brooks
30811237
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
This might make a lot more sense to you if you look at specific numbers. I suggest $2$ and $3$.
Although $2$ is prime in $mathbb{Z}$, it's not prime in $mathbb{Z}[i]$, since $(1 - i)(1 + i) = 2$. So $N(2) = 4$, no surprise there. We also see that $N(1 - i) = 2$, and $N(1 + i) = 2$ as well. These facts may not seem obvious but they are easily verified.
And these facts mesh perfectly well with the multiplicative property of the norm function. If $ab = 2$, then $N(a)$ can only be $1$, $2$ or $4$, and the choice of $b$ follows immediately.
Compare $3$, which is indeed prime in both $mathbb{Z}$ and $mathbb{Z}[i]$. Its norm in the latter is still its square, and since it neither ramifies nor splits in this domain, it likewise follows that $N(z) = 3$ is impossible for $z in mathbb{Z}[i]$.
answered Dec 7 at 0:10
Mr. Brooks
30811237
add a comment |
up vote
1
down vote
This might make a lot more sense to you if you look at specific numbers. I suggest $2$ and $3$.
Although $2$ is prime in $mathbb{Z}$, it's not prime in $mathbb{Z}[i]$, since $(1 - i)(1 + i) = 2$. So $N(2) = 4$, no surprise there. We also see that $N(1 - i) = 2$, and $N(1 + i) = 2$ as well. These facts may not seem obvious but they are easily verified.
And these facts mesh perfectly well with the multiplicative property of the norm function. If $ab = 2$, then $N(a)$ can only be $1$, $2$ or $4$, and the choice of $b$ follows immediately.
Compare $3$, which is indeed prime in both $mathbb{Z}$ and $mathbb{Z}[i]$. Its norm in the latter is still its square, and since it neither ramifies nor splits in this domain, it likewise follows that $N(z) = 3$ is impossible for $z in mathbb{Z}[i]$.
answered Dec 7 at 0:10
Mr. Brooks
30811237
add a comment |
up vote
1
down vote
up vote
1
down vote
This might make a lot more sense to you if you look at specific numbers. I suggest $2$ and $3$.
Although $2$ is prime in $mathbb{Z}$, it's not prime in $mathbb{Z}[i]$, since $(1 - i)(1 + i) = 2$. So $N(2) = 4$, no surprise there. We also see that $N(1 - i) = 2$, and $N(1 + i) = 2$ as well. These facts may not seem obvious but they are easily verified.
And these facts mesh perfectly well with the multiplicative property of the norm function. If $ab = 2$, then $N(a)$ can only be $1$, $2$ or $4$, and the choice of $b$ follows immediately.
Compare $3$, which is indeed prime in both $mathbb{Z}$ and $mathbb{Z}[i]$. Its norm in the latter is still its square, and since it neither ramifies nor splits in this domain, it likewise follows that $N(z) = 3$ is impossible for $z in mathbb{Z}[i]$.
answered Dec 7 at 0:10
Mr. Brooks
30811237
This might make a lot more sense to you if you look at specific numbers. I suggest $2$ and $3$.
Although $2$ is prime in $mathbb{Z}$, it's not prime in $mathbb{Z}[i]$, since $(1 - i)(1 + i) = 2$. So $N(2) = 4$, no surprise there. We also see that $N(1 - i) = 2$, and $N(1 + i) = 2$ as well. These facts may not seem obvious but they are easily verified.
And these facts mesh perfectly well with the multiplicative property of the norm function. If $ab = 2$, then $N(a)$ can only be $1$, $2$ or $4$, and the choice of $b$ follows immediately.
Compare $3$, which is indeed prime in both $mathbb{Z}$ and $mathbb{Z}[i]$. Its norm in the latter is still its square, and since it neither ramifies nor splits in this domain, it likewise follows that $N(z) = 3$ is impossible for $z in mathbb{Z}[i]$.
answered Dec 7 at 0:10
Mr. Brooks
30811237
answered Dec 7 at 0:10
Mr. Brooks
30811237
answered Dec 7 at 0:10
Mr. Brooks
30811237
answered Dec 7 at 0:10
Mr. Brooks
30811237
30811237
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3024039%2fshow-that-q-must-divide-one-of-the-prime-integer-factors-of-nq%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Write $N(q) = p_1 times cdots times p_n$ a product of $mathbb Z$-primes. Now, in $mathbb Z[i]$, $q mid p_1 times cdots times p_n$. By definition of primality, there is an $m$ such that $q mid p_m$.
– Mees de Vries
Dec 3 at 13:12
@MeesdeVries, wow, that simple! thanks :)
– 72D
Dec 3 at 13:17