Examples of ring where doesn't exist lcm and gcd
$begingroup$
My question is:
"Examples of ring that doesn't exist lcm and gcd of any elements"
The ring preferely has to be commutative and unitary or olny unitary( as matrix ring). I woul use these two theorems:
Theorem 1
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of a ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a least common multiple if and only if the ideal $cap (a_i)$ is principal.
Theorem 2
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of the ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a greatest common divisor $d$, expressible in the form
$$d=r_1a_1+r_2a_2+...+r_na_n quad (r_i in R)$$
if and only if the ideal $(a_1......a_n)$ is principal.
abstract-algebra ring-theory
$endgroup$
add a comment |
$begingroup$
My question is:
"Examples of ring that doesn't exist lcm and gcd of any elements"
The ring preferely has to be commutative and unitary or olny unitary( as matrix ring). I woul use these two theorems:
Theorem 1
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of a ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a least common multiple if and only if the ideal $cap (a_i)$ is principal.
Theorem 2
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of the ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a greatest common divisor $d$, expressible in the form
$$d=r_1a_1+r_2a_2+...+r_na_n quad (r_i in R)$$
if and only if the ideal $(a_1......a_n)$ is principal.
abstract-algebra ring-theory
$endgroup$
$begingroup$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12
add a comment |
$begingroup$
My question is:
"Examples of ring that doesn't exist lcm and gcd of any elements"
The ring preferely has to be commutative and unitary or olny unitary( as matrix ring). I woul use these two theorems:
Theorem 1
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of a ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a least common multiple if and only if the ideal $cap (a_i)$ is principal.
Theorem 2
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of the ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a greatest common divisor $d$, expressible in the form
$$d=r_1a_1+r_2a_2+...+r_na_n quad (r_i in R)$$
if and only if the ideal $(a_1......a_n)$ is principal.
abstract-algebra ring-theory
$endgroup$
My question is:
"Examples of ring that doesn't exist lcm and gcd of any elements"
The ring preferely has to be commutative and unitary or olny unitary( as matrix ring). I woul use these two theorems:
Theorem 1
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of a ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a least common multiple if and only if the ideal $cap (a_i)$ is principal.
Theorem 2
Let $a_1,a_2,a_3,......,a_n$ be nonzero elements of the ring $R$. Then $a_1,a_2,a_3,......,a_n$ have a greatest common divisor $d$, expressible in the form
$$d=r_1a_1+r_2a_2+...+r_na_n quad (r_i in R)$$
if and only if the ideal $(a_1......a_n)$ is principal.
abstract-algebra ring-theory
abstract-algebra ring-theory
asked Dec 7 '18 at 16:56
Domenico VuonoDomenico Vuono
2,3161523
2,3161523
$begingroup$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12
add a comment |
$begingroup$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12
$begingroup$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I found on the Web and, also on mathstack, several examples and I decided to write an answer.
Example of ring where the gcd of two elements doesn't exist:
Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square). Then in this paper D. Khurana has proved that:
Let $a$ be any rational integer such that $aequiv dquad (modquad 2)$ and let $a^2 + d = 2q$. Then the elements $2q$ and $(a+ isqrt{d})q$ do not have a $GCD$.
Two examples of ring where the lcm of two elements doesn’t exist:
I use the following theorem:
Let $D$ be a domain and $a,bin D$.
Then, $text{lcm}(a,b)$ exists if and only if for all $rin Dsetminus{0}$, $gcd(ra,rb)$ exists.
$1)$Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square); and a rational integer $a$ such that $aequiv d$ $(modquad 2)$, then $lcm(2,a+isqrt{d})$ doesn't exist. Indeed this follows from the previous theorem. Note that $GCD(2,a+isqrt{d})=1$.
$2)$ let $R$ be the subring of $Bbb Z[x]$ consisting of the polynomials $sum_i c_ix^i$ such that $c1$ is an even number. If we consider $p_1(x)=2$ and $p_2(x)=2x$, $lcm(p_1, p_2)$ doesn't exist.
$endgroup$
add a comment |
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%2f3030123%2fexamples-of-ring-where-doesnt-exist-lcm-and-gcd%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I found on the Web and, also on mathstack, several examples and I decided to write an answer.
Example of ring where the gcd of two elements doesn't exist:
Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square). Then in this paper D. Khurana has proved that:
Let $a$ be any rational integer such that $aequiv dquad (modquad 2)$ and let $a^2 + d = 2q$. Then the elements $2q$ and $(a+ isqrt{d})q$ do not have a $GCD$.
Two examples of ring where the lcm of two elements doesn’t exist:
I use the following theorem:
Let $D$ be a domain and $a,bin D$.
Then, $text{lcm}(a,b)$ exists if and only if for all $rin Dsetminus{0}$, $gcd(ra,rb)$ exists.
$1)$Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square); and a rational integer $a$ such that $aequiv d$ $(modquad 2)$, then $lcm(2,a+isqrt{d})$ doesn't exist. Indeed this follows from the previous theorem. Note that $GCD(2,a+isqrt{d})=1$.
$2)$ let $R$ be the subring of $Bbb Z[x]$ consisting of the polynomials $sum_i c_ix^i$ such that $c1$ is an even number. If we consider $p_1(x)=2$ and $p_2(x)=2x$, $lcm(p_1, p_2)$ doesn't exist.
$endgroup$
add a comment |
$begingroup$
I found on the Web and, also on mathstack, several examples and I decided to write an answer.
Example of ring where the gcd of two elements doesn't exist:
Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square). Then in this paper D. Khurana has proved that:
Let $a$ be any rational integer such that $aequiv dquad (modquad 2)$ and let $a^2 + d = 2q$. Then the elements $2q$ and $(a+ isqrt{d})q$ do not have a $GCD$.
Two examples of ring where the lcm of two elements doesn’t exist:
I use the following theorem:
Let $D$ be a domain and $a,bin D$.
Then, $text{lcm}(a,b)$ exists if and only if for all $rin Dsetminus{0}$, $gcd(ra,rb)$ exists.
$1)$Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square); and a rational integer $a$ such that $aequiv d$ $(modquad 2)$, then $lcm(2,a+isqrt{d})$ doesn't exist. Indeed this follows from the previous theorem. Note that $GCD(2,a+isqrt{d})=1$.
$2)$ let $R$ be the subring of $Bbb Z[x]$ consisting of the polynomials $sum_i c_ix^i$ such that $c1$ is an even number. If we consider $p_1(x)=2$ and $p_2(x)=2x$, $lcm(p_1, p_2)$ doesn't exist.
$endgroup$
add a comment |
$begingroup$
I found on the Web and, also on mathstack, several examples and I decided to write an answer.
Example of ring where the gcd of two elements doesn't exist:
Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square). Then in this paper D. Khurana has proved that:
Let $a$ be any rational integer such that $aequiv dquad (modquad 2)$ and let $a^2 + d = 2q$. Then the elements $2q$ and $(a+ isqrt{d})q$ do not have a $GCD$.
Two examples of ring where the lcm of two elements doesn’t exist:
I use the following theorem:
Let $D$ be a domain and $a,bin D$.
Then, $text{lcm}(a,b)$ exists if and only if for all $rin Dsetminus{0}$, $gcd(ra,rb)$ exists.
$1)$Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square); and a rational integer $a$ such that $aequiv d$ $(modquad 2)$, then $lcm(2,a+isqrt{d})$ doesn't exist. Indeed this follows from the previous theorem. Note that $GCD(2,a+isqrt{d})=1$.
$2)$ let $R$ be the subring of $Bbb Z[x]$ consisting of the polynomials $sum_i c_ix^i$ such that $c1$ is an even number. If we consider $p_1(x)=2$ and $p_2(x)=2x$, $lcm(p_1, p_2)$ doesn't exist.
$endgroup$
I found on the Web and, also on mathstack, several examples and I decided to write an answer.
Example of ring where the gcd of two elements doesn't exist:
Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square). Then in this paper D. Khurana has proved that:
Let $a$ be any rational integer such that $aequiv dquad (modquad 2)$ and let $a^2 + d = 2q$. Then the elements $2q$ and $(a+ isqrt{d})q$ do not have a $GCD$.
Two examples of ring where the lcm of two elements doesn’t exist:
I use the following theorem:
Let $D$ be a domain and $a,bin D$.
Then, $text{lcm}(a,b)$ exists if and only if for all $rin Dsetminus{0}$, $gcd(ra,rb)$ exists.
$1)$Consider the ring $Bbb Z[sqrt{-d}]={a+bisqrt{-d} : a,bin Bbb Z}$, $dge 3$ ($d$ free-square); and a rational integer $a$ such that $aequiv d$ $(modquad 2)$, then $lcm(2,a+isqrt{d})$ doesn't exist. Indeed this follows from the previous theorem. Note that $GCD(2,a+isqrt{d})=1$.
$2)$ let $R$ be the subring of $Bbb Z[x]$ consisting of the polynomials $sum_i c_ix^i$ such that $c1$ is an even number. If we consider $p_1(x)=2$ and $p_2(x)=2x$, $lcm(p_1, p_2)$ doesn't exist.
edited Dec 13 '18 at 14:49
answered Dec 12 '18 at 16:50
Domenico VuonoDomenico Vuono
2,3161523
2,3161523
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.
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%2f3030123%2fexamples-of-ring-where-doesnt-exist-lcm-and-gcd%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$
en.wikipedia.org/wiki/…
$endgroup$
– Paul K
Dec 7 '18 at 17:18
$begingroup$
Why down vote? .
$endgroup$
– Domenico Vuono
Dec 12 '18 at 20:12