Find the continued fraction digits of $sqrt{3+i} notin mathbb{Q}(i)$
$begingroup$
We can show that $sqrt{3+i} notin mathbb{Q}(i)$ without too much effort, e.g. by solving $$(x+yi)^2 = (x^2 - y^2) + (2xy)i = 3+i$$ Therefore, we can try to find approximations, using only rational elements of the field. What are the continued fraction digits
$$ sqrt{3+i} = [a_0;overline{a_1, a_2, dots, a_n}] in mathbb{C}$$
with $a_i in mathbb{Z}[i]$. I'm quite sure they repeat.
Even the first digit, I wonder how we can compute it?
$$ lfloor sqrt{3+i}rfloor in mathbb{Z}[i] $$
We could solve an equation of some kind perhaps $a^2 + b^2 < 3^2 + 1^2 = 10$. Not too many solutions to that.
I guess, there's no "positive" $sqrt{3+i}$ so I guess it's the one with positive real an imaginary part, something like $mathbb{R}_{geq}oplusmathbb{R}_{geq}$.
algebraic-number-theory continued-fractions
$endgroup$
add a comment |
$begingroup$
We can show that $sqrt{3+i} notin mathbb{Q}(i)$ without too much effort, e.g. by solving $$(x+yi)^2 = (x^2 - y^2) + (2xy)i = 3+i$$ Therefore, we can try to find approximations, using only rational elements of the field. What are the continued fraction digits
$$ sqrt{3+i} = [a_0;overline{a_1, a_2, dots, a_n}] in mathbb{C}$$
with $a_i in mathbb{Z}[i]$. I'm quite sure they repeat.
Even the first digit, I wonder how we can compute it?
$$ lfloor sqrt{3+i}rfloor in mathbb{Z}[i] $$
We could solve an equation of some kind perhaps $a^2 + b^2 < 3^2 + 1^2 = 10$. Not too many solutions to that.
I guess, there's no "positive" $sqrt{3+i}$ so I guess it's the one with positive real an imaginary part, something like $mathbb{R}_{geq}oplusmathbb{R}_{geq}$.
algebraic-number-theory continued-fractions
$endgroup$
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20
add a comment |
$begingroup$
We can show that $sqrt{3+i} notin mathbb{Q}(i)$ without too much effort, e.g. by solving $$(x+yi)^2 = (x^2 - y^2) + (2xy)i = 3+i$$ Therefore, we can try to find approximations, using only rational elements of the field. What are the continued fraction digits
$$ sqrt{3+i} = [a_0;overline{a_1, a_2, dots, a_n}] in mathbb{C}$$
with $a_i in mathbb{Z}[i]$. I'm quite sure they repeat.
Even the first digit, I wonder how we can compute it?
$$ lfloor sqrt{3+i}rfloor in mathbb{Z}[i] $$
We could solve an equation of some kind perhaps $a^2 + b^2 < 3^2 + 1^2 = 10$. Not too many solutions to that.
I guess, there's no "positive" $sqrt{3+i}$ so I guess it's the one with positive real an imaginary part, something like $mathbb{R}_{geq}oplusmathbb{R}_{geq}$.
algebraic-number-theory continued-fractions
$endgroup$
We can show that $sqrt{3+i} notin mathbb{Q}(i)$ without too much effort, e.g. by solving $$(x+yi)^2 = (x^2 - y^2) + (2xy)i = 3+i$$ Therefore, we can try to find approximations, using only rational elements of the field. What are the continued fraction digits
$$ sqrt{3+i} = [a_0;overline{a_1, a_2, dots, a_n}] in mathbb{C}$$
with $a_i in mathbb{Z}[i]$. I'm quite sure they repeat.
Even the first digit, I wonder how we can compute it?
$$ lfloor sqrt{3+i}rfloor in mathbb{Z}[i] $$
We could solve an equation of some kind perhaps $a^2 + b^2 < 3^2 + 1^2 = 10$. Not too many solutions to that.
I guess, there's no "positive" $sqrt{3+i}$ so I guess it's the one with positive real an imaginary part, something like $mathbb{R}_{geq}oplusmathbb{R}_{geq}$.
algebraic-number-theory continued-fractions
algebraic-number-theory continued-fractions
edited Dec 24 '18 at 18:19
cactus314
asked May 3 '18 at 11:58
cactus314cactus314
15.5k42269
15.5k42269
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20
add a comment |
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The floor of $sqrt{3+i}$ isn't well defined (at least, at present, without thinking about it and giving it a definition). For that matter, neither is $sqrt{3+i}$ (there are two of them). Thus your question as stated can't be answered without some clarification.
That said, let's think about how to define continued fraction expansions with entries in $Bbb{Z}[i]$ for a general complex number.
Let $a+bi$ be some complex number. What is the closest Gaussian integer to $a+bi$?
Well, let $n$ be the closest integer to $a$ and let $m$ be the closest integer to $b$.
Then $$|(a+bi)-(n+mi)|=(a-n)^2+(b-m)^2le sqrt{frac{1}{4} +frac{1}{4}} = frac{1}{sqrt{2}}<1.$$
Thus we can call this Gaussian integer (which may not be unique) a floor of $a+bi$. The floors of a complex number have the important property that $|z-newcommandfloor[1]{leftlfloor {#1}rightrfloor}floor{z}|<1$, so we can then do the usual continued fraction expansion, by recursively defining
$$z_0=z, quad a_i = floor{z_i},quadtext{and }z_{i+1}=frac{1}{z_i-a_i}.$$
Then we should have
$$z=a_0 + frac{1}{a_1+frac{1}{a_2+cdots}},$$
probably. There's some stuff to check here, with convergence and all that, but it should probably work the same as with the real numbers and the integers.
Note however that the coefficients aren't necessarily unique, and this continued fraction expansion won't necessarily be as nice as it is for the integers.
Apparently I've described the Hurwitz algorithm for complex continued fractions, described in more detail in the linked paper.
$endgroup$
add a comment |
$begingroup$
Continued fraction are defined for $xinmathbb R_+$ and can be calculated via the Euclidean algorithm, i.e. integer division.
Complex numbers can not be compared to "less" and "greater", so the operation of integer division is not defined on $mathbb C.$ This possibility can be defined only for special subsets of $mathbb C.$
Therefore, in the Hurwitz decomposition algorithm, instead of integer division, rounding is used independently for real and imaginary parts.
Let us find the point $a(x,y)in mathbb Z_i,$ the square of which is the nearest to $3+i.$
Attempt of approximation using norm
$$N=|a^2(x,y)-(3+i)|$$
cannot guarantee N < 1 for the considered example.

More perspective looks preliminary square root extraction,
$$r(s,t) = sqrt{3+i},$$
$$s^2-t^2 + i(2st) = 3+i,quad s^2+t^2 = sqrt{10},$$
$$s^2=dfrac{sqrt{10}+3}2,quad t^2=dfrac{sqrt{10}+3}2,quad 2st=1,$$
with the solutions
$$r=pm(s+it),quad s=dfrac{sqrt{sqrt{40}+6}}2approx1.75532,quad
t = dfrac1{2s}=dfrac{sqrt{sqrt{40}-6}}2approx0.284849.$$
For the "positive" root Wolfram Alpha gives continued fraction
$$r=[2; {-2 - 2i, 4}]$$
(using the Hurwitz expansion).
How does it work?
$$a_0 = [Re r+0.5]+i[Im r+0.5] = 2,$$
$$r_1 = dfrac1{r-a_0} = dfrac{(r-a_0)^*}{|r-a_0|^2}= dfrac {s-2-i t}{(s-2)^2+t^2},$$
$$r_1 = dfrac{sqrt{sqrt{40}+6}-4}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})} - dfrac{sqrt{sqrt{40}-6}}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})}i approx -1.73523 - 2.02008 i,$$
$$r_1=dfrac1{sqrt{3+i}-2}=dfrac{sqrt{3+i}+2}{-1+i} = -dfrac{1+i}2(sqrt{3+i}+2)$$
$$a_1 = [Re r_1+0.5]+i[Im r_1+0.5] = -2-2i,$$
$$r_2 = dfrac1{r_1-a_1} = dfrac{(r_1-a_1)^*}{|r_1-a_1|^2}= dfrac {s+2-i(t+2)}{(s+2)^2+(t+2)^2},$$
$$r_2=-dfrac2{(1+i)(sqrt{3+i}-2]}= -2dfrac{sqrt{3+i}+2}{(i+1)(i-1)} = sqrt{3+i}+2approx3.75532+i0.284849$$
(see also Wolfram Alpha).
Easily to see that
$$a_2=a_0+2,$$
and that the denominator $r_2-a_2$ repeated.
$endgroup$
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
|
show 10 more comments
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f2764807%2ffind-the-continued-fraction-digits-of-sqrt3i-notin-mathbbqi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The floor of $sqrt{3+i}$ isn't well defined (at least, at present, without thinking about it and giving it a definition). For that matter, neither is $sqrt{3+i}$ (there are two of them). Thus your question as stated can't be answered without some clarification.
That said, let's think about how to define continued fraction expansions with entries in $Bbb{Z}[i]$ for a general complex number.
Let $a+bi$ be some complex number. What is the closest Gaussian integer to $a+bi$?
Well, let $n$ be the closest integer to $a$ and let $m$ be the closest integer to $b$.
Then $$|(a+bi)-(n+mi)|=(a-n)^2+(b-m)^2le sqrt{frac{1}{4} +frac{1}{4}} = frac{1}{sqrt{2}}<1.$$
Thus we can call this Gaussian integer (which may not be unique) a floor of $a+bi$. The floors of a complex number have the important property that $|z-newcommandfloor[1]{leftlfloor {#1}rightrfloor}floor{z}|<1$, so we can then do the usual continued fraction expansion, by recursively defining
$$z_0=z, quad a_i = floor{z_i},quadtext{and }z_{i+1}=frac{1}{z_i-a_i}.$$
Then we should have
$$z=a_0 + frac{1}{a_1+frac{1}{a_2+cdots}},$$
probably. There's some stuff to check here, with convergence and all that, but it should probably work the same as with the real numbers and the integers.
Note however that the coefficients aren't necessarily unique, and this continued fraction expansion won't necessarily be as nice as it is for the integers.
Apparently I've described the Hurwitz algorithm for complex continued fractions, described in more detail in the linked paper.
$endgroup$
add a comment |
$begingroup$
The floor of $sqrt{3+i}$ isn't well defined (at least, at present, without thinking about it and giving it a definition). For that matter, neither is $sqrt{3+i}$ (there are two of them). Thus your question as stated can't be answered without some clarification.
That said, let's think about how to define continued fraction expansions with entries in $Bbb{Z}[i]$ for a general complex number.
Let $a+bi$ be some complex number. What is the closest Gaussian integer to $a+bi$?
Well, let $n$ be the closest integer to $a$ and let $m$ be the closest integer to $b$.
Then $$|(a+bi)-(n+mi)|=(a-n)^2+(b-m)^2le sqrt{frac{1}{4} +frac{1}{4}} = frac{1}{sqrt{2}}<1.$$
Thus we can call this Gaussian integer (which may not be unique) a floor of $a+bi$. The floors of a complex number have the important property that $|z-newcommandfloor[1]{leftlfloor {#1}rightrfloor}floor{z}|<1$, so we can then do the usual continued fraction expansion, by recursively defining
$$z_0=z, quad a_i = floor{z_i},quadtext{and }z_{i+1}=frac{1}{z_i-a_i}.$$
Then we should have
$$z=a_0 + frac{1}{a_1+frac{1}{a_2+cdots}},$$
probably. There's some stuff to check here, with convergence and all that, but it should probably work the same as with the real numbers and the integers.
Note however that the coefficients aren't necessarily unique, and this continued fraction expansion won't necessarily be as nice as it is for the integers.
Apparently I've described the Hurwitz algorithm for complex continued fractions, described in more detail in the linked paper.
$endgroup$
add a comment |
$begingroup$
The floor of $sqrt{3+i}$ isn't well defined (at least, at present, without thinking about it and giving it a definition). For that matter, neither is $sqrt{3+i}$ (there are two of them). Thus your question as stated can't be answered without some clarification.
That said, let's think about how to define continued fraction expansions with entries in $Bbb{Z}[i]$ for a general complex number.
Let $a+bi$ be some complex number. What is the closest Gaussian integer to $a+bi$?
Well, let $n$ be the closest integer to $a$ and let $m$ be the closest integer to $b$.
Then $$|(a+bi)-(n+mi)|=(a-n)^2+(b-m)^2le sqrt{frac{1}{4} +frac{1}{4}} = frac{1}{sqrt{2}}<1.$$
Thus we can call this Gaussian integer (which may not be unique) a floor of $a+bi$. The floors of a complex number have the important property that $|z-newcommandfloor[1]{leftlfloor {#1}rightrfloor}floor{z}|<1$, so we can then do the usual continued fraction expansion, by recursively defining
$$z_0=z, quad a_i = floor{z_i},quadtext{and }z_{i+1}=frac{1}{z_i-a_i}.$$
Then we should have
$$z=a_0 + frac{1}{a_1+frac{1}{a_2+cdots}},$$
probably. There's some stuff to check here, with convergence and all that, but it should probably work the same as with the real numbers and the integers.
Note however that the coefficients aren't necessarily unique, and this continued fraction expansion won't necessarily be as nice as it is for the integers.
Apparently I've described the Hurwitz algorithm for complex continued fractions, described in more detail in the linked paper.
$endgroup$
The floor of $sqrt{3+i}$ isn't well defined (at least, at present, without thinking about it and giving it a definition). For that matter, neither is $sqrt{3+i}$ (there are two of them). Thus your question as stated can't be answered without some clarification.
That said, let's think about how to define continued fraction expansions with entries in $Bbb{Z}[i]$ for a general complex number.
Let $a+bi$ be some complex number. What is the closest Gaussian integer to $a+bi$?
Well, let $n$ be the closest integer to $a$ and let $m$ be the closest integer to $b$.
Then $$|(a+bi)-(n+mi)|=(a-n)^2+(b-m)^2le sqrt{frac{1}{4} +frac{1}{4}} = frac{1}{sqrt{2}}<1.$$
Thus we can call this Gaussian integer (which may not be unique) a floor of $a+bi$. The floors of a complex number have the important property that $|z-newcommandfloor[1]{leftlfloor {#1}rightrfloor}floor{z}|<1$, so we can then do the usual continued fraction expansion, by recursively defining
$$z_0=z, quad a_i = floor{z_i},quadtext{and }z_{i+1}=frac{1}{z_i-a_i}.$$
Then we should have
$$z=a_0 + frac{1}{a_1+frac{1}{a_2+cdots}},$$
probably. There's some stuff to check here, with convergence and all that, but it should probably work the same as with the real numbers and the integers.
Note however that the coefficients aren't necessarily unique, and this continued fraction expansion won't necessarily be as nice as it is for the integers.
Apparently I've described the Hurwitz algorithm for complex continued fractions, described in more detail in the linked paper.
edited Dec 17 '18 at 2:44
answered Dec 17 '18 at 1:49
jgonjgon
14.5k22042
14.5k22042
add a comment |
add a comment |
$begingroup$
Continued fraction are defined for $xinmathbb R_+$ and can be calculated via the Euclidean algorithm, i.e. integer division.
Complex numbers can not be compared to "less" and "greater", so the operation of integer division is not defined on $mathbb C.$ This possibility can be defined only for special subsets of $mathbb C.$
Therefore, in the Hurwitz decomposition algorithm, instead of integer division, rounding is used independently for real and imaginary parts.
Let us find the point $a(x,y)in mathbb Z_i,$ the square of which is the nearest to $3+i.$
Attempt of approximation using norm
$$N=|a^2(x,y)-(3+i)|$$
cannot guarantee N < 1 for the considered example.

More perspective looks preliminary square root extraction,
$$r(s,t) = sqrt{3+i},$$
$$s^2-t^2 + i(2st) = 3+i,quad s^2+t^2 = sqrt{10},$$
$$s^2=dfrac{sqrt{10}+3}2,quad t^2=dfrac{sqrt{10}+3}2,quad 2st=1,$$
with the solutions
$$r=pm(s+it),quad s=dfrac{sqrt{sqrt{40}+6}}2approx1.75532,quad
t = dfrac1{2s}=dfrac{sqrt{sqrt{40}-6}}2approx0.284849.$$
For the "positive" root Wolfram Alpha gives continued fraction
$$r=[2; {-2 - 2i, 4}]$$
(using the Hurwitz expansion).
How does it work?
$$a_0 = [Re r+0.5]+i[Im r+0.5] = 2,$$
$$r_1 = dfrac1{r-a_0} = dfrac{(r-a_0)^*}{|r-a_0|^2}= dfrac {s-2-i t}{(s-2)^2+t^2},$$
$$r_1 = dfrac{sqrt{sqrt{40}+6}-4}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})} - dfrac{sqrt{sqrt{40}-6}}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})}i approx -1.73523 - 2.02008 i,$$
$$r_1=dfrac1{sqrt{3+i}-2}=dfrac{sqrt{3+i}+2}{-1+i} = -dfrac{1+i}2(sqrt{3+i}+2)$$
$$a_1 = [Re r_1+0.5]+i[Im r_1+0.5] = -2-2i,$$
$$r_2 = dfrac1{r_1-a_1} = dfrac{(r_1-a_1)^*}{|r_1-a_1|^2}= dfrac {s+2-i(t+2)}{(s+2)^2+(t+2)^2},$$
$$r_2=-dfrac2{(1+i)(sqrt{3+i}-2]}= -2dfrac{sqrt{3+i}+2}{(i+1)(i-1)} = sqrt{3+i}+2approx3.75532+i0.284849$$
(see also Wolfram Alpha).
Easily to see that
$$a_2=a_0+2,$$
and that the denominator $r_2-a_2$ repeated.
$endgroup$
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
|
show 10 more comments
$begingroup$
Continued fraction are defined for $xinmathbb R_+$ and can be calculated via the Euclidean algorithm, i.e. integer division.
Complex numbers can not be compared to "less" and "greater", so the operation of integer division is not defined on $mathbb C.$ This possibility can be defined only for special subsets of $mathbb C.$
Therefore, in the Hurwitz decomposition algorithm, instead of integer division, rounding is used independently for real and imaginary parts.
Let us find the point $a(x,y)in mathbb Z_i,$ the square of which is the nearest to $3+i.$
Attempt of approximation using norm
$$N=|a^2(x,y)-(3+i)|$$
cannot guarantee N < 1 for the considered example.

More perspective looks preliminary square root extraction,
$$r(s,t) = sqrt{3+i},$$
$$s^2-t^2 + i(2st) = 3+i,quad s^2+t^2 = sqrt{10},$$
$$s^2=dfrac{sqrt{10}+3}2,quad t^2=dfrac{sqrt{10}+3}2,quad 2st=1,$$
with the solutions
$$r=pm(s+it),quad s=dfrac{sqrt{sqrt{40}+6}}2approx1.75532,quad
t = dfrac1{2s}=dfrac{sqrt{sqrt{40}-6}}2approx0.284849.$$
For the "positive" root Wolfram Alpha gives continued fraction
$$r=[2; {-2 - 2i, 4}]$$
(using the Hurwitz expansion).
How does it work?
$$a_0 = [Re r+0.5]+i[Im r+0.5] = 2,$$
$$r_1 = dfrac1{r-a_0} = dfrac{(r-a_0)^*}{|r-a_0|^2}= dfrac {s-2-i t}{(s-2)^2+t^2},$$
$$r_1 = dfrac{sqrt{sqrt{40}+6}-4}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})} - dfrac{sqrt{sqrt{40}-6}}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})}i approx -1.73523 - 2.02008 i,$$
$$r_1=dfrac1{sqrt{3+i}-2}=dfrac{sqrt{3+i}+2}{-1+i} = -dfrac{1+i}2(sqrt{3+i}+2)$$
$$a_1 = [Re r_1+0.5]+i[Im r_1+0.5] = -2-2i,$$
$$r_2 = dfrac1{r_1-a_1} = dfrac{(r_1-a_1)^*}{|r_1-a_1|^2}= dfrac {s+2-i(t+2)}{(s+2)^2+(t+2)^2},$$
$$r_2=-dfrac2{(1+i)(sqrt{3+i}-2]}= -2dfrac{sqrt{3+i}+2}{(i+1)(i-1)} = sqrt{3+i}+2approx3.75532+i0.284849$$
(see also Wolfram Alpha).
Easily to see that
$$a_2=a_0+2,$$
and that the denominator $r_2-a_2$ repeated.
$endgroup$
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
|
show 10 more comments
$begingroup$
Continued fraction are defined for $xinmathbb R_+$ and can be calculated via the Euclidean algorithm, i.e. integer division.
Complex numbers can not be compared to "less" and "greater", so the operation of integer division is not defined on $mathbb C.$ This possibility can be defined only for special subsets of $mathbb C.$
Therefore, in the Hurwitz decomposition algorithm, instead of integer division, rounding is used independently for real and imaginary parts.
Let us find the point $a(x,y)in mathbb Z_i,$ the square of which is the nearest to $3+i.$
Attempt of approximation using norm
$$N=|a^2(x,y)-(3+i)|$$
cannot guarantee N < 1 for the considered example.

More perspective looks preliminary square root extraction,
$$r(s,t) = sqrt{3+i},$$
$$s^2-t^2 + i(2st) = 3+i,quad s^2+t^2 = sqrt{10},$$
$$s^2=dfrac{sqrt{10}+3}2,quad t^2=dfrac{sqrt{10}+3}2,quad 2st=1,$$
with the solutions
$$r=pm(s+it),quad s=dfrac{sqrt{sqrt{40}+6}}2approx1.75532,quad
t = dfrac1{2s}=dfrac{sqrt{sqrt{40}-6}}2approx0.284849.$$
For the "positive" root Wolfram Alpha gives continued fraction
$$r=[2; {-2 - 2i, 4}]$$
(using the Hurwitz expansion).
How does it work?
$$a_0 = [Re r+0.5]+i[Im r+0.5] = 2,$$
$$r_1 = dfrac1{r-a_0} = dfrac{(r-a_0)^*}{|r-a_0|^2}= dfrac {s-2-i t}{(s-2)^2+t^2},$$
$$r_1 = dfrac{sqrt{sqrt{40}+6}-4}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})} - dfrac{sqrt{sqrt{40}-6}}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})}i approx -1.73523 - 2.02008 i,$$
$$r_1=dfrac1{sqrt{3+i}-2}=dfrac{sqrt{3+i}+2}{-1+i} = -dfrac{1+i}2(sqrt{3+i}+2)$$
$$a_1 = [Re r_1+0.5]+i[Im r_1+0.5] = -2-2i,$$
$$r_2 = dfrac1{r_1-a_1} = dfrac{(r_1-a_1)^*}{|r_1-a_1|^2}= dfrac {s+2-i(t+2)}{(s+2)^2+(t+2)^2},$$
$$r_2=-dfrac2{(1+i)(sqrt{3+i}-2]}= -2dfrac{sqrt{3+i}+2}{(i+1)(i-1)} = sqrt{3+i}+2approx3.75532+i0.284849$$
(see also Wolfram Alpha).
Easily to see that
$$a_2=a_0+2,$$
and that the denominator $r_2-a_2$ repeated.
$endgroup$
Continued fraction are defined for $xinmathbb R_+$ and can be calculated via the Euclidean algorithm, i.e. integer division.
Complex numbers can not be compared to "less" and "greater", so the operation of integer division is not defined on $mathbb C.$ This possibility can be defined only for special subsets of $mathbb C.$
Therefore, in the Hurwitz decomposition algorithm, instead of integer division, rounding is used independently for real and imaginary parts.
Let us find the point $a(x,y)in mathbb Z_i,$ the square of which is the nearest to $3+i.$
Attempt of approximation using norm
$$N=|a^2(x,y)-(3+i)|$$
cannot guarantee N < 1 for the considered example.

More perspective looks preliminary square root extraction,
$$r(s,t) = sqrt{3+i},$$
$$s^2-t^2 + i(2st) = 3+i,quad s^2+t^2 = sqrt{10},$$
$$s^2=dfrac{sqrt{10}+3}2,quad t^2=dfrac{sqrt{10}+3}2,quad 2st=1,$$
with the solutions
$$r=pm(s+it),quad s=dfrac{sqrt{sqrt{40}+6}}2approx1.75532,quad
t = dfrac1{2s}=dfrac{sqrt{sqrt{40}-6}}2approx0.284849.$$
For the "positive" root Wolfram Alpha gives continued fraction
$$r=[2; {-2 - 2i, 4}]$$
(using the Hurwitz expansion).
How does it work?
$$a_0 = [Re r+0.5]+i[Im r+0.5] = 2,$$
$$r_1 = dfrac1{r-a_0} = dfrac{(r-a_0)^*}{|r-a_0|^2}= dfrac {s-2-i t}{(s-2)^2+t^2},$$
$$r_1 = dfrac{sqrt{sqrt{40}+6}-4}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})} - dfrac{sqrt{sqrt{40}-6}}{2(4+sqrt{10}-2sqrt{sqrt{40}+6})}i approx -1.73523 - 2.02008 i,$$
$$r_1=dfrac1{sqrt{3+i}-2}=dfrac{sqrt{3+i}+2}{-1+i} = -dfrac{1+i}2(sqrt{3+i}+2)$$
$$a_1 = [Re r_1+0.5]+i[Im r_1+0.5] = -2-2i,$$
$$r_2 = dfrac1{r_1-a_1} = dfrac{(r_1-a_1)^*}{|r_1-a_1|^2}= dfrac {s+2-i(t+2)}{(s+2)^2+(t+2)^2},$$
$$r_2=-dfrac2{(1+i)(sqrt{3+i}-2]}= -2dfrac{sqrt{3+i}+2}{(i+1)(i-1)} = sqrt{3+i}+2approx3.75532+i0.284849$$
(see also Wolfram Alpha).
Easily to see that
$$a_2=a_0+2,$$
and that the denominator $r_2-a_2$ repeated.
edited Dec 23 '18 at 23:18
answered Dec 17 '18 at 1:28
Yuri NegometyanovYuri Negometyanov
11.6k1728
11.6k1728
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
|
show 10 more comments
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
1
1
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
This is wrong. Euclidean algorithm works just fine in $Bbb{Z}[i]$. You compare norms of elements rather than the elements themselves. (-1)
$endgroup$
– jgon
Dec 17 '18 at 1:31
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
And if you're just being unclear, you should be able to adapt that to divide a general complex number by an element of $Bbb{Z}[i]$.
$endgroup$
– jgon
Dec 17 '18 at 1:32
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
@jgon This doesn't mean $z_1 < z_2.$
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:36
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
Yes, the complex numbers aren't an ordered field, but I don't see how that prevents us from finding some analog of continued fraction expansion. Also on reflecting further, I'm not really sure what the Euclidean algorithm has to do with finding continued fraction expansions of irrational real numbers in the first place.
$endgroup$
– jgon
Dec 17 '18 at 1:39
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
$begingroup$
@jgon The OP definition does not provide convergency. I see only strange unproved ideas. Can you propose me some links?
$endgroup$
– Yuri Negometyanov
Dec 17 '18 at 1:46
|
show 10 more comments
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.
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%2f2764807%2ffind-the-continued-fraction-digits-of-sqrt3i-notin-mathbbqi%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
$begingroup$
Calculations really work. Wolfram Alpha link added.
$endgroup$
– Yuri Negometyanov
Dec 23 '18 at 23:20