$x^2 +y^2 + z^2$ is irreducible in $mathbb C [x,y,z]$Homogeneous polynomial in $k[X,Y,Z]$ can factor into...
Question about the proof of Second Isomorphism Theorem
If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?
Why did the EU agree to delay the Brexit deadline?
Is a bound state a stationary state?
Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?
Fear of getting stuck on one programming language / technology that is not used in my country
Multiplicative persistence
Should I stop contributing to retirement accounts?
Is there a single word describing earning money through any means?
How can "mimic phobia" be cured or prevented?
When a Cleric spontaneously casts a Cure Light Wounds spell, will a Pearl of Power recover the original spell or Cure Light Wounds?
Request info on 12/48v PSU
The screen of my macbook suddenly broken down how can I do to recover
Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?
What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?
Offered money to buy a house, seller is asking for more to cover gap between their listing and mortgage owed
Longest common substring in linear time
Non-trope happy ending?
How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?
Are the IPv6 address space and IPv4 address space completely disjoint?
Delivering sarcasm
Is there a working SACD iso player for Ubuntu?
Biological Blimps: Propulsion
Did arcade monitors have same pixel aspect ratio as TV sets?
$x^2 +y^2 + z^2$ is irreducible in $mathbb C [x,y,z]$
Homogeneous polynomial in $k[X,Y,Z]$ can factor into linear polynomials?$f(x)=x^2+y^2+1$ is irreducible in $mathbb{C}[x,y]$Is it possible to factor $x^3+y^3+z^3$Irreducibility of some multivariate polynomialsIrreducibility of a polynomial in $F[x,y]$.Irreducible factors of $X^p-1$ in $(mathbb{Z}/q mathbb{Z})[X]$Showing that $x^n -2$ is irreducible in $mathbb{Q}[X]$Irreducible polynomial in $mathbb{Z_2}$Proof that $a^{n}+b^{n}$ is irreducible over $mathbb Q$show it is irreducible over $mathbb{Q}(sqrt{2})$ and $mathbb{Q}(i)$Showing a degree 6 polynomial is irreducible over $mathbb{Z}_5$Irreducible monic polynomial in $mathbb{Q}[x]$$X^4-4X^2-1$ irreducible over $mathbb{Q}[X]$How to show that $4x^9 -9x^3 + 24x + 13 $ is irreducible over $mathbb{Q}$Showing $x^4+x^2+x+1$ irreducible over $mathbb{Z_3}$
$begingroup$
Is $x^2 +y^2 + z^2$ irreducible in $mathbb C [x,y,z]$?
As $(x^2+y^2+z^2)= (x+y+z)^2- 2(xy+yz+zx)$,
$$(x^2+y^2+z^2)=left(x+y+z+sqrt{2(xy+yz+zx)}right)left(x+y+z-sqrt{2(xy+yz+zx)}right).$$
But how to show that none of these factors belong to $mathbb C [x,y,z]$?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
add a comment |
$begingroup$
Is $x^2 +y^2 + z^2$ irreducible in $mathbb C [x,y,z]$?
As $(x^2+y^2+z^2)= (x+y+z)^2- 2(xy+yz+zx)$,
$$(x^2+y^2+z^2)=left(x+y+z+sqrt{2(xy+yz+zx)}right)left(x+y+z-sqrt{2(xy+yz+zx)}right).$$
But how to show that none of these factors belong to $mathbb C [x,y,z]$?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
add a comment |
$begingroup$
Is $x^2 +y^2 + z^2$ irreducible in $mathbb C [x,y,z]$?
As $(x^2+y^2+z^2)= (x+y+z)^2- 2(xy+yz+zx)$,
$$(x^2+y^2+z^2)=left(x+y+z+sqrt{2(xy+yz+zx)}right)left(x+y+z-sqrt{2(xy+yz+zx)}right).$$
But how to show that none of these factors belong to $mathbb C [x,y,z]$?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
Is $x^2 +y^2 + z^2$ irreducible in $mathbb C [x,y,z]$?
As $(x^2+y^2+z^2)= (x+y+z)^2- 2(xy+yz+zx)$,
$$(x^2+y^2+z^2)=left(x+y+z+sqrt{2(xy+yz+zx)}right)left(x+y+z-sqrt{2(xy+yz+zx)}right).$$
But how to show that none of these factors belong to $mathbb C [x,y,z]$?
abstract-algebra polynomials irreducible-polynomials
abstract-algebra polynomials irreducible-polynomials
edited Sep 8 '13 at 16:58
user26857
asked Sep 7 '13 at 17:45
GermainGermain
794820
794820
add a comment |
add a comment |
6 Answers
6
active
oldest
votes
$begingroup$
I don't quite see why you are interested in this particular square root, $sqrt{xy+yz+zx}$. In general, adjoining an element to a ring may or may not affect irreducibility of a given element. For example, $13$ is irreducible in $mathbb{Z}$ factors as $(3+2i)(3-2i)$ in $mathbb{Z}[i]$, remains irreducible in $mathbb{Z}[sqrt{-5}]$, factors as $(4+sqrt3)(4-sqrt3)$ in $mathbb{Z}[sqrt3]$, remains irreducible in $mathbb{Z}[sqrt7]$ et cetera.
Anyway, you can prove irreducibility of $x^2+y^2+z^2$ for example as follows.
$mathbb{C}[x,y,z]=mathbb{C}[u,v,z]$ with $u=x+iy$, $v=x-iy$. Your polynomial then looks like $x^2+y^2+z^2=uv+z^2$. If this were not irreducible, it would be a product of two linear polynomials. As this polynomial is homogeneous, so are the presumed factors. So we need to rule out the possibility
$$
uv+z^2=(au+bv+cz)(a'u+b'v+c'z)
$$
for some constants $a,b,c,a',b',c'$. As $aa'=0$ one of those constants is zero, w.l.o.g. $a'=0$, $aneq0$. Similarly from $bb'=0$ we see that one of those also needs to be zero. Clearly we must assume $b=0, b'neq0$. This leaves us
$$
uv+z^2=(au+cz)(b'v+c'z)
$$
with $a,c,b',c'$ all non-zero ($cc'=1$). This forces non-zero coefficients to terms $vz$ and $uz$, so no factorization is possible.
$endgroup$
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
add a comment |
$begingroup$
Also, this is part of a more general pattern, using Gauss' Lemma and Eisenstein criterion: for positive integers $ell,m,n$, $x^ell+y^m+z^n$ is irreducible over any field $k$ of characteristic not dividing the exponents. Prove this via Gauss/Eisenstein by first noting that $k[x,y,z]$, $k(z)[x,y]$, and such are UFDs. By Gauss, irreducibility in $k[z,y,z]$ is equivalent to that in $k(z)[x,y]$. By Eisenstein, the polynomial is irreducible in $k(z)[y][x]$ if $y^m+z^n$ has some prime factor in $k(z)[y]$ that does not occur twice. Since the char of the field does not divide the exponents, this is easily so. (For $m=n$ and $k$ alg closed it is easy to write down factors $y+z$, etc.)
$endgroup$
add a comment |
$begingroup$
There is a more geometrical way to prove that $x^2+y^2+z^2$ is irreducible in $mathbb{C}[x,y,z]$. Notice that, since the polynomial is homogeneous, the equation $x^2+y^2+z^2 = 0$ describes a curve $mathcal{C}$ in $mathbb{P}^2(mathbb{C})$.
If the polynomial is reducible, $mathcal{C}$ has two irreducible components (counted with multiplicity, i.e. $mathcal{C}$ is made of two possibly coincident straight lines). By Bézout's theorem, these components must intersect in at least one point, which must be a singular point of $mathcal{C}$. Then it suffices to check that $mathcal{C}$ has no singular points to conclude that the polynomial is irreducible, and this is trivial.
This argument can also be applied for the more general case of $x^n+y^n+z^n$ (which correspond to the so-called Fermat curves).
$endgroup$
add a comment |
$begingroup$
First notice that both $mathbb C[x,y,z]$ and $mathbb C[x,y]$ are UFDs since $mathbb C$ is a field.
Hence to see that $x^2+y^2+z^2$ is irreducible in $mathbb C[x,y,z]$ it suffices to show that the monic polynomial $x^2+y^2+z^2$ in the variable $z$ has no root in the ring $mathbb C[x,y]$. But this holds since $x^2+y^2=(x+iy)(x-iy)$ is the factorization into irreducible elements of $x^2+y^2$ in $mathbb C[x,y];$ the powers of the irreducible elements in this factorization are not even.
$endgroup$
add a comment |
$begingroup$
If your polynomial were reducible, it would be the product of two linear polynomials. Just check that it isn't.
$endgroup$
add a comment |
$begingroup$
Let, $i$ be a square root of $-1$ in $K$.Then we have, $x^2+y^2+z^2=(x+iy)(x-iy)+z^2$
Since $x+iy$ is irreducible in $K[x,y]$ and $x+iy$ does not divide $x-iy;$ irreducibly follows from the Eienstein's Citeria in $K[x,y,z]=K[x,y][z]$
$endgroup$
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
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%2f486668%2fx2-y2-z2-is-irreducible-in-mathbb-c-x-y-z%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
6 Answers
6
active
oldest
votes
6 Answers
6
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I don't quite see why you are interested in this particular square root, $sqrt{xy+yz+zx}$. In general, adjoining an element to a ring may or may not affect irreducibility of a given element. For example, $13$ is irreducible in $mathbb{Z}$ factors as $(3+2i)(3-2i)$ in $mathbb{Z}[i]$, remains irreducible in $mathbb{Z}[sqrt{-5}]$, factors as $(4+sqrt3)(4-sqrt3)$ in $mathbb{Z}[sqrt3]$, remains irreducible in $mathbb{Z}[sqrt7]$ et cetera.
Anyway, you can prove irreducibility of $x^2+y^2+z^2$ for example as follows.
$mathbb{C}[x,y,z]=mathbb{C}[u,v,z]$ with $u=x+iy$, $v=x-iy$. Your polynomial then looks like $x^2+y^2+z^2=uv+z^2$. If this were not irreducible, it would be a product of two linear polynomials. As this polynomial is homogeneous, so are the presumed factors. So we need to rule out the possibility
$$
uv+z^2=(au+bv+cz)(a'u+b'v+c'z)
$$
for some constants $a,b,c,a',b',c'$. As $aa'=0$ one of those constants is zero, w.l.o.g. $a'=0$, $aneq0$. Similarly from $bb'=0$ we see that one of those also needs to be zero. Clearly we must assume $b=0, b'neq0$. This leaves us
$$
uv+z^2=(au+cz)(b'v+c'z)
$$
with $a,c,b',c'$ all non-zero ($cc'=1$). This forces non-zero coefficients to terms $vz$ and $uz$, so no factorization is possible.
$endgroup$
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
add a comment |
$begingroup$
I don't quite see why you are interested in this particular square root, $sqrt{xy+yz+zx}$. In general, adjoining an element to a ring may or may not affect irreducibility of a given element. For example, $13$ is irreducible in $mathbb{Z}$ factors as $(3+2i)(3-2i)$ in $mathbb{Z}[i]$, remains irreducible in $mathbb{Z}[sqrt{-5}]$, factors as $(4+sqrt3)(4-sqrt3)$ in $mathbb{Z}[sqrt3]$, remains irreducible in $mathbb{Z}[sqrt7]$ et cetera.
Anyway, you can prove irreducibility of $x^2+y^2+z^2$ for example as follows.
$mathbb{C}[x,y,z]=mathbb{C}[u,v,z]$ with $u=x+iy$, $v=x-iy$. Your polynomial then looks like $x^2+y^2+z^2=uv+z^2$. If this were not irreducible, it would be a product of two linear polynomials. As this polynomial is homogeneous, so are the presumed factors. So we need to rule out the possibility
$$
uv+z^2=(au+bv+cz)(a'u+b'v+c'z)
$$
for some constants $a,b,c,a',b',c'$. As $aa'=0$ one of those constants is zero, w.l.o.g. $a'=0$, $aneq0$. Similarly from $bb'=0$ we see that one of those also needs to be zero. Clearly we must assume $b=0, b'neq0$. This leaves us
$$
uv+z^2=(au+cz)(b'v+c'z)
$$
with $a,c,b',c'$ all non-zero ($cc'=1$). This forces non-zero coefficients to terms $vz$ and $uz$, so no factorization is possible.
$endgroup$
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
add a comment |
$begingroup$
I don't quite see why you are interested in this particular square root, $sqrt{xy+yz+zx}$. In general, adjoining an element to a ring may or may not affect irreducibility of a given element. For example, $13$ is irreducible in $mathbb{Z}$ factors as $(3+2i)(3-2i)$ in $mathbb{Z}[i]$, remains irreducible in $mathbb{Z}[sqrt{-5}]$, factors as $(4+sqrt3)(4-sqrt3)$ in $mathbb{Z}[sqrt3]$, remains irreducible in $mathbb{Z}[sqrt7]$ et cetera.
Anyway, you can prove irreducibility of $x^2+y^2+z^2$ for example as follows.
$mathbb{C}[x,y,z]=mathbb{C}[u,v,z]$ with $u=x+iy$, $v=x-iy$. Your polynomial then looks like $x^2+y^2+z^2=uv+z^2$. If this were not irreducible, it would be a product of two linear polynomials. As this polynomial is homogeneous, so are the presumed factors. So we need to rule out the possibility
$$
uv+z^2=(au+bv+cz)(a'u+b'v+c'z)
$$
for some constants $a,b,c,a',b',c'$. As $aa'=0$ one of those constants is zero, w.l.o.g. $a'=0$, $aneq0$. Similarly from $bb'=0$ we see that one of those also needs to be zero. Clearly we must assume $b=0, b'neq0$. This leaves us
$$
uv+z^2=(au+cz)(b'v+c'z)
$$
with $a,c,b',c'$ all non-zero ($cc'=1$). This forces non-zero coefficients to terms $vz$ and $uz$, so no factorization is possible.
$endgroup$
I don't quite see why you are interested in this particular square root, $sqrt{xy+yz+zx}$. In general, adjoining an element to a ring may or may not affect irreducibility of a given element. For example, $13$ is irreducible in $mathbb{Z}$ factors as $(3+2i)(3-2i)$ in $mathbb{Z}[i]$, remains irreducible in $mathbb{Z}[sqrt{-5}]$, factors as $(4+sqrt3)(4-sqrt3)$ in $mathbb{Z}[sqrt3]$, remains irreducible in $mathbb{Z}[sqrt7]$ et cetera.
Anyway, you can prove irreducibility of $x^2+y^2+z^2$ for example as follows.
$mathbb{C}[x,y,z]=mathbb{C}[u,v,z]$ with $u=x+iy$, $v=x-iy$. Your polynomial then looks like $x^2+y^2+z^2=uv+z^2$. If this were not irreducible, it would be a product of two linear polynomials. As this polynomial is homogeneous, so are the presumed factors. So we need to rule out the possibility
$$
uv+z^2=(au+bv+cz)(a'u+b'v+c'z)
$$
for some constants $a,b,c,a',b',c'$. As $aa'=0$ one of those constants is zero, w.l.o.g. $a'=0$, $aneq0$. Similarly from $bb'=0$ we see that one of those also needs to be zero. Clearly we must assume $b=0, b'neq0$. This leaves us
$$
uv+z^2=(au+cz)(b'v+c'z)
$$
with $a,c,b',c'$ all non-zero ($cc'=1$). This forces non-zero coefficients to terms $vz$ and $uz$, so no factorization is possible.
answered Sep 7 '13 at 18:27
Jyrki LahtonenJyrki Lahtonen
110k13171386
110k13171386
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
add a comment |
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
$begingroup$
Now if suppose the polynomial be not homogeneous. As for example how to show $y-x^2$ is irreducible in $mathbb C[x,y]$?
$endgroup$
– Germain
Sep 8 '13 at 17:56
2
2
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
$begingroup$
Non-homogeneous polynomials may have non-homogeneous factors. But that example polynomial is linear in $y$, so one factor would have to be in $Bbb{C}[x]$...
$endgroup$
– Jyrki Lahtonen
Sep 8 '13 at 18:16
add a comment |
$begingroup$
Also, this is part of a more general pattern, using Gauss' Lemma and Eisenstein criterion: for positive integers $ell,m,n$, $x^ell+y^m+z^n$ is irreducible over any field $k$ of characteristic not dividing the exponents. Prove this via Gauss/Eisenstein by first noting that $k[x,y,z]$, $k(z)[x,y]$, and such are UFDs. By Gauss, irreducibility in $k[z,y,z]$ is equivalent to that in $k(z)[x,y]$. By Eisenstein, the polynomial is irreducible in $k(z)[y][x]$ if $y^m+z^n$ has some prime factor in $k(z)[y]$ that does not occur twice. Since the char of the field does not divide the exponents, this is easily so. (For $m=n$ and $k$ alg closed it is easy to write down factors $y+z$, etc.)
$endgroup$
add a comment |
$begingroup$
Also, this is part of a more general pattern, using Gauss' Lemma and Eisenstein criterion: for positive integers $ell,m,n$, $x^ell+y^m+z^n$ is irreducible over any field $k$ of characteristic not dividing the exponents. Prove this via Gauss/Eisenstein by first noting that $k[x,y,z]$, $k(z)[x,y]$, and such are UFDs. By Gauss, irreducibility in $k[z,y,z]$ is equivalent to that in $k(z)[x,y]$. By Eisenstein, the polynomial is irreducible in $k(z)[y][x]$ if $y^m+z^n$ has some prime factor in $k(z)[y]$ that does not occur twice. Since the char of the field does not divide the exponents, this is easily so. (For $m=n$ and $k$ alg closed it is easy to write down factors $y+z$, etc.)
$endgroup$
add a comment |
$begingroup$
Also, this is part of a more general pattern, using Gauss' Lemma and Eisenstein criterion: for positive integers $ell,m,n$, $x^ell+y^m+z^n$ is irreducible over any field $k$ of characteristic not dividing the exponents. Prove this via Gauss/Eisenstein by first noting that $k[x,y,z]$, $k(z)[x,y]$, and such are UFDs. By Gauss, irreducibility in $k[z,y,z]$ is equivalent to that in $k(z)[x,y]$. By Eisenstein, the polynomial is irreducible in $k(z)[y][x]$ if $y^m+z^n$ has some prime factor in $k(z)[y]$ that does not occur twice. Since the char of the field does not divide the exponents, this is easily so. (For $m=n$ and $k$ alg closed it is easy to write down factors $y+z$, etc.)
$endgroup$
Also, this is part of a more general pattern, using Gauss' Lemma and Eisenstein criterion: for positive integers $ell,m,n$, $x^ell+y^m+z^n$ is irreducible over any field $k$ of characteristic not dividing the exponents. Prove this via Gauss/Eisenstein by first noting that $k[x,y,z]$, $k(z)[x,y]$, and such are UFDs. By Gauss, irreducibility in $k[z,y,z]$ is equivalent to that in $k(z)[x,y]$. By Eisenstein, the polynomial is irreducible in $k(z)[y][x]$ if $y^m+z^n$ has some prime factor in $k(z)[y]$ that does not occur twice. Since the char of the field does not divide the exponents, this is easily so. (For $m=n$ and $k$ alg closed it is easy to write down factors $y+z$, etc.)
answered Sep 8 '13 at 13:28
paul garrettpaul garrett
32.1k362119
32.1k362119
add a comment |
add a comment |
$begingroup$
There is a more geometrical way to prove that $x^2+y^2+z^2$ is irreducible in $mathbb{C}[x,y,z]$. Notice that, since the polynomial is homogeneous, the equation $x^2+y^2+z^2 = 0$ describes a curve $mathcal{C}$ in $mathbb{P}^2(mathbb{C})$.
If the polynomial is reducible, $mathcal{C}$ has two irreducible components (counted with multiplicity, i.e. $mathcal{C}$ is made of two possibly coincident straight lines). By Bézout's theorem, these components must intersect in at least one point, which must be a singular point of $mathcal{C}$. Then it suffices to check that $mathcal{C}$ has no singular points to conclude that the polynomial is irreducible, and this is trivial.
This argument can also be applied for the more general case of $x^n+y^n+z^n$ (which correspond to the so-called Fermat curves).
$endgroup$
add a comment |
$begingroup$
There is a more geometrical way to prove that $x^2+y^2+z^2$ is irreducible in $mathbb{C}[x,y,z]$. Notice that, since the polynomial is homogeneous, the equation $x^2+y^2+z^2 = 0$ describes a curve $mathcal{C}$ in $mathbb{P}^2(mathbb{C})$.
If the polynomial is reducible, $mathcal{C}$ has two irreducible components (counted with multiplicity, i.e. $mathcal{C}$ is made of two possibly coincident straight lines). By Bézout's theorem, these components must intersect in at least one point, which must be a singular point of $mathcal{C}$. Then it suffices to check that $mathcal{C}$ has no singular points to conclude that the polynomial is irreducible, and this is trivial.
This argument can also be applied for the more general case of $x^n+y^n+z^n$ (which correspond to the so-called Fermat curves).
$endgroup$
add a comment |
$begingroup$
There is a more geometrical way to prove that $x^2+y^2+z^2$ is irreducible in $mathbb{C}[x,y,z]$. Notice that, since the polynomial is homogeneous, the equation $x^2+y^2+z^2 = 0$ describes a curve $mathcal{C}$ in $mathbb{P}^2(mathbb{C})$.
If the polynomial is reducible, $mathcal{C}$ has two irreducible components (counted with multiplicity, i.e. $mathcal{C}$ is made of two possibly coincident straight lines). By Bézout's theorem, these components must intersect in at least one point, which must be a singular point of $mathcal{C}$. Then it suffices to check that $mathcal{C}$ has no singular points to conclude that the polynomial is irreducible, and this is trivial.
This argument can also be applied for the more general case of $x^n+y^n+z^n$ (which correspond to the so-called Fermat curves).
$endgroup$
There is a more geometrical way to prove that $x^2+y^2+z^2$ is irreducible in $mathbb{C}[x,y,z]$. Notice that, since the polynomial is homogeneous, the equation $x^2+y^2+z^2 = 0$ describes a curve $mathcal{C}$ in $mathbb{P}^2(mathbb{C})$.
If the polynomial is reducible, $mathcal{C}$ has two irreducible components (counted with multiplicity, i.e. $mathcal{C}$ is made of two possibly coincident straight lines). By Bézout's theorem, these components must intersect in at least one point, which must be a singular point of $mathcal{C}$. Then it suffices to check that $mathcal{C}$ has no singular points to conclude that the polynomial is irreducible, and this is trivial.
This argument can also be applied for the more general case of $x^n+y^n+z^n$ (which correspond to the so-called Fermat curves).
edited Dec 27 '17 at 17:07
answered Sep 8 '13 at 14:18
Luca BressanLuca Bressan
3,95121037
3,95121037
add a comment |
add a comment |
$begingroup$
First notice that both $mathbb C[x,y,z]$ and $mathbb C[x,y]$ are UFDs since $mathbb C$ is a field.
Hence to see that $x^2+y^2+z^2$ is irreducible in $mathbb C[x,y,z]$ it suffices to show that the monic polynomial $x^2+y^2+z^2$ in the variable $z$ has no root in the ring $mathbb C[x,y]$. But this holds since $x^2+y^2=(x+iy)(x-iy)$ is the factorization into irreducible elements of $x^2+y^2$ in $mathbb C[x,y];$ the powers of the irreducible elements in this factorization are not even.
$endgroup$
add a comment |
$begingroup$
First notice that both $mathbb C[x,y,z]$ and $mathbb C[x,y]$ are UFDs since $mathbb C$ is a field.
Hence to see that $x^2+y^2+z^2$ is irreducible in $mathbb C[x,y,z]$ it suffices to show that the monic polynomial $x^2+y^2+z^2$ in the variable $z$ has no root in the ring $mathbb C[x,y]$. But this holds since $x^2+y^2=(x+iy)(x-iy)$ is the factorization into irreducible elements of $x^2+y^2$ in $mathbb C[x,y];$ the powers of the irreducible elements in this factorization are not even.
$endgroup$
add a comment |
$begingroup$
First notice that both $mathbb C[x,y,z]$ and $mathbb C[x,y]$ are UFDs since $mathbb C$ is a field.
Hence to see that $x^2+y^2+z^2$ is irreducible in $mathbb C[x,y,z]$ it suffices to show that the monic polynomial $x^2+y^2+z^2$ in the variable $z$ has no root in the ring $mathbb C[x,y]$. But this holds since $x^2+y^2=(x+iy)(x-iy)$ is the factorization into irreducible elements of $x^2+y^2$ in $mathbb C[x,y];$ the powers of the irreducible elements in this factorization are not even.
$endgroup$
First notice that both $mathbb C[x,y,z]$ and $mathbb C[x,y]$ are UFDs since $mathbb C$ is a field.
Hence to see that $x^2+y^2+z^2$ is irreducible in $mathbb C[x,y,z]$ it suffices to show that the monic polynomial $x^2+y^2+z^2$ in the variable $z$ has no root in the ring $mathbb C[x,y]$. But this holds since $x^2+y^2=(x+iy)(x-iy)$ is the factorization into irreducible elements of $x^2+y^2$ in $mathbb C[x,y];$ the powers of the irreducible elements in this factorization are not even.
edited Dec 21 '13 at 22:58
answered Sep 8 '13 at 3:34
Camilo Arosemena-SerratoCamilo Arosemena-Serrato
5,64111849
5,64111849
add a comment |
add a comment |
$begingroup$
If your polynomial were reducible, it would be the product of two linear polynomials. Just check that it isn't.
$endgroup$
add a comment |
$begingroup$
If your polynomial were reducible, it would be the product of two linear polynomials. Just check that it isn't.
$endgroup$
add a comment |
$begingroup$
If your polynomial were reducible, it would be the product of two linear polynomials. Just check that it isn't.
$endgroup$
If your polynomial were reducible, it would be the product of two linear polynomials. Just check that it isn't.
answered Sep 7 '13 at 17:54
Mariano Suárez-ÁlvarezMariano Suárez-Álvarez
112k7157290
112k7157290
add a comment |
add a comment |
$begingroup$
Let, $i$ be a square root of $-1$ in $K$.Then we have, $x^2+y^2+z^2=(x+iy)(x-iy)+z^2$
Since $x+iy$ is irreducible in $K[x,y]$ and $x+iy$ does not divide $x-iy;$ irreducibly follows from the Eienstein's Citeria in $K[x,y,z]=K[x,y][z]$
$endgroup$
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
add a comment |
$begingroup$
Let, $i$ be a square root of $-1$ in $K$.Then we have, $x^2+y^2+z^2=(x+iy)(x-iy)+z^2$
Since $x+iy$ is irreducible in $K[x,y]$ and $x+iy$ does not divide $x-iy;$ irreducibly follows from the Eienstein's Citeria in $K[x,y,z]=K[x,y][z]$
$endgroup$
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
add a comment |
$begingroup$
Let, $i$ be a square root of $-1$ in $K$.Then we have, $x^2+y^2+z^2=(x+iy)(x-iy)+z^2$
Since $x+iy$ is irreducible in $K[x,y]$ and $x+iy$ does not divide $x-iy;$ irreducibly follows from the Eienstein's Citeria in $K[x,y,z]=K[x,y][z]$
$endgroup$
Let, $i$ be a square root of $-1$ in $K$.Then we have, $x^2+y^2+z^2=(x+iy)(x-iy)+z^2$
Since $x+iy$ is irreducible in $K[x,y]$ and $x+iy$ does not divide $x-iy;$ irreducibly follows from the Eienstein's Citeria in $K[x,y,z]=K[x,y][z]$
edited Mar 14 at 4:25
YuiTo Cheng
2,1212837
2,1212837
answered Mar 14 at 0:29
Abdul HalimAbdul Halim
12
12
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
add a comment |
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
$begingroup$
Welcome to Mathematics Stack Exchange! Take the short tour to see how how to get the most from your time here. For typesetting equations please use MathJax.
$endgroup$
– dantopa
Mar 14 at 2:58
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%2f486668%2fx2-y2-z2-is-irreducible-in-mathbb-c-x-y-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