$mathbb Z[frac{2+i}{5}]cap mathbb Q =mathbb Z$
up vote
3
down vote
favorite
As it says in the title I want to show that $mathbb Z[frac{2+i}{5}]cap mathbb Q =mathbb Z$.
Set $omega=frac{2+i}{5}$. $mathbb Z[omega]$ is the smallest ring that contains $mathbb Z$ and $omega$. Therefore,
begin{equation}
mathbb Z[omega] = {a_0+a_1 omega+cdots+a_k omega^kmid a_iin mathbb
Z,kin mathbb N}
end{equation}
Let, then, $qinmathbb Z[frac{2+i}{5}]cap mathbb Q$. Since $qinmathbb Q$ we can write $q=frac{m}{n}$, where $m,n$ are relatively prime integers and $mneq 0$. Now, since $qinmathbb Z[frac{2+i}{5}]$ we have that
begin{equation}
q=a_0+a_1 omega+cdots+a_k omega^k
end{equation}
for some $a_iin mathbb Z$. Then,
begin{align}
&frac{m}{n}=a_0+a_1 frac{2+i}{5}+cdots+a_k left(frac{2+i}{5}right)^k \
Longrightarrow &5^km=5^kna_0+5^{k-1}na_1(2+i)+cdots+a_kn(2+i)^k
end{align}
Hence, $nmid 5^km$ and since $gcd(n,m)=1$ we have that $n|5^k$.
Thus, every rational number in $mathbb Z[omega]$ is of the form $frac{m}{5^l}$ where $minmathbb Z$, $l$ is a positive integer and when $lgeq 1$ it holds that $5nmid m$. It suffice then to show that it always hold that $l=0$. I am stuck here. I would very much appreciate some help!
abstract-algebra complex-numbers
add a comment |
up vote
3
down vote
favorite
As it says in the title I want to show that $mathbb Z[frac{2+i}{5}]cap mathbb Q =mathbb Z$.
Set $omega=frac{2+i}{5}$. $mathbb Z[omega]$ is the smallest ring that contains $mathbb Z$ and $omega$. Therefore,
begin{equation}
mathbb Z[omega] = {a_0+a_1 omega+cdots+a_k omega^kmid a_iin mathbb
Z,kin mathbb N}
end{equation}
Let, then, $qinmathbb Z[frac{2+i}{5}]cap mathbb Q$. Since $qinmathbb Q$ we can write $q=frac{m}{n}$, where $m,n$ are relatively prime integers and $mneq 0$. Now, since $qinmathbb Z[frac{2+i}{5}]$ we have that
begin{equation}
q=a_0+a_1 omega+cdots+a_k omega^k
end{equation}
for some $a_iin mathbb Z$. Then,
begin{align}
&frac{m}{n}=a_0+a_1 frac{2+i}{5}+cdots+a_k left(frac{2+i}{5}right)^k \
Longrightarrow &5^km=5^kna_0+5^{k-1}na_1(2+i)+cdots+a_kn(2+i)^k
end{align}
Hence, $nmid 5^km$ and since $gcd(n,m)=1$ we have that $n|5^k$.
Thus, every rational number in $mathbb Z[omega]$ is of the form $frac{m}{5^l}$ where $minmathbb Z$, $l$ is a positive integer and when $lgeq 1$ it holds that $5nmid m$. It suffice then to show that it always hold that $l=0$. I am stuck here. I would very much appreciate some help!
abstract-algebra complex-numbers
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
As it says in the title I want to show that $mathbb Z[frac{2+i}{5}]cap mathbb Q =mathbb Z$.
Set $omega=frac{2+i}{5}$. $mathbb Z[omega]$ is the smallest ring that contains $mathbb Z$ and $omega$. Therefore,
begin{equation}
mathbb Z[omega] = {a_0+a_1 omega+cdots+a_k omega^kmid a_iin mathbb
Z,kin mathbb N}
end{equation}
Let, then, $qinmathbb Z[frac{2+i}{5}]cap mathbb Q$. Since $qinmathbb Q$ we can write $q=frac{m}{n}$, where $m,n$ are relatively prime integers and $mneq 0$. Now, since $qinmathbb Z[frac{2+i}{5}]$ we have that
begin{equation}
q=a_0+a_1 omega+cdots+a_k omega^k
end{equation}
for some $a_iin mathbb Z$. Then,
begin{align}
&frac{m}{n}=a_0+a_1 frac{2+i}{5}+cdots+a_k left(frac{2+i}{5}right)^k \
Longrightarrow &5^km=5^kna_0+5^{k-1}na_1(2+i)+cdots+a_kn(2+i)^k
end{align}
Hence, $nmid 5^km$ and since $gcd(n,m)=1$ we have that $n|5^k$.
Thus, every rational number in $mathbb Z[omega]$ is of the form $frac{m}{5^l}$ where $minmathbb Z$, $l$ is a positive integer and when $lgeq 1$ it holds that $5nmid m$. It suffice then to show that it always hold that $l=0$. I am stuck here. I would very much appreciate some help!
abstract-algebra complex-numbers
As it says in the title I want to show that $mathbb Z[frac{2+i}{5}]cap mathbb Q =mathbb Z$.
Set $omega=frac{2+i}{5}$. $mathbb Z[omega]$ is the smallest ring that contains $mathbb Z$ and $omega$. Therefore,
begin{equation}
mathbb Z[omega] = {a_0+a_1 omega+cdots+a_k omega^kmid a_iin mathbb
Z,kin mathbb N}
end{equation}
Let, then, $qinmathbb Z[frac{2+i}{5}]cap mathbb Q$. Since $qinmathbb Q$ we can write $q=frac{m}{n}$, where $m,n$ are relatively prime integers and $mneq 0$. Now, since $qinmathbb Z[frac{2+i}{5}]$ we have that
begin{equation}
q=a_0+a_1 omega+cdots+a_k omega^k
end{equation}
for some $a_iin mathbb Z$. Then,
begin{align}
&frac{m}{n}=a_0+a_1 frac{2+i}{5}+cdots+a_k left(frac{2+i}{5}right)^k \
Longrightarrow &5^km=5^kna_0+5^{k-1}na_1(2+i)+cdots+a_kn(2+i)^k
end{align}
Hence, $nmid 5^km$ and since $gcd(n,m)=1$ we have that $n|5^k$.
Thus, every rational number in $mathbb Z[omega]$ is of the form $frac{m}{5^l}$ where $minmathbb Z$, $l$ is a positive integer and when $lgeq 1$ it holds that $5nmid m$. It suffice then to show that it always hold that $l=0$. I am stuck here. I would very much appreciate some help!
abstract-algebra complex-numbers
abstract-algebra complex-numbers
edited Dec 2 at 20:50
asked Dec 2 at 20:45
richarddedekind
697315
697315
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
3
down vote
accepted
Hint: Look at the equation $5^km = n(5^ka_0+5^{k-1}a_1(2+i)+ cdots + a_k(2+i)^k)$ as an equation between Gaussian integers.
Note that $2+i$ is a prime in the ring of Gaussian integers arising from the factorization of the integer prime $5$, namely $(2+i)(2-i)=5$.
You already noticed that $n$ is a power of $5$. In particular, if $m/n$ is not an integer, you may assume that $m$ is not divisible by $5$.
Hence, viewing it as a Gaussian integer, it should not be divisible by $2+i$ or $2-i$.
Can you see the contradiction from here?
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Hint: Look at the equation $5^km = n(5^ka_0+5^{k-1}a_1(2+i)+ cdots + a_k(2+i)^k)$ as an equation between Gaussian integers.
Note that $2+i$ is a prime in the ring of Gaussian integers arising from the factorization of the integer prime $5$, namely $(2+i)(2-i)=5$.
You already noticed that $n$ is a power of $5$. In particular, if $m/n$ is not an integer, you may assume that $m$ is not divisible by $5$.
Hence, viewing it as a Gaussian integer, it should not be divisible by $2+i$ or $2-i$.
Can you see the contradiction from here?
add a comment |
up vote
3
down vote
accepted
Hint: Look at the equation $5^km = n(5^ka_0+5^{k-1}a_1(2+i)+ cdots + a_k(2+i)^k)$ as an equation between Gaussian integers.
Note that $2+i$ is a prime in the ring of Gaussian integers arising from the factorization of the integer prime $5$, namely $(2+i)(2-i)=5$.
You already noticed that $n$ is a power of $5$. In particular, if $m/n$ is not an integer, you may assume that $m$ is not divisible by $5$.
Hence, viewing it as a Gaussian integer, it should not be divisible by $2+i$ or $2-i$.
Can you see the contradiction from here?
add a comment |
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Hint: Look at the equation $5^km = n(5^ka_0+5^{k-1}a_1(2+i)+ cdots + a_k(2+i)^k)$ as an equation between Gaussian integers.
Note that $2+i$ is a prime in the ring of Gaussian integers arising from the factorization of the integer prime $5$, namely $(2+i)(2-i)=5$.
You already noticed that $n$ is a power of $5$. In particular, if $m/n$ is not an integer, you may assume that $m$ is not divisible by $5$.
Hence, viewing it as a Gaussian integer, it should not be divisible by $2+i$ or $2-i$.
Can you see the contradiction from here?
Hint: Look at the equation $5^km = n(5^ka_0+5^{k-1}a_1(2+i)+ cdots + a_k(2+i)^k)$ as an equation between Gaussian integers.
Note that $2+i$ is a prime in the ring of Gaussian integers arising from the factorization of the integer prime $5$, namely $(2+i)(2-i)=5$.
You already noticed that $n$ is a power of $5$. In particular, if $m/n$ is not an integer, you may assume that $m$ is not divisible by $5$.
Hence, viewing it as a Gaussian integer, it should not be divisible by $2+i$ or $2-i$.
Can you see the contradiction from here?
answered Dec 2 at 21:20
A. Pongrácz
5,073725
5,073725
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%2f3023154%2fmathbb-z-frac2i5-cap-mathbb-q-mathbb-z%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