Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$?How to prove that $x^4+x^3+x^2+3x+3 $ is irreducible over ring $mathbbZ$ of integers?Irreducible over the rationalsWhy can't Eisenstein Criterion be used for certain polynomials (to show that it's irreducible over $mathbbQ$)?Showing a polynomial is irreducible over $mathbbC[x,y]$How to prove a polynomial irreducible over $mathbbC$Why is $x^3+2x^2+x-9$ irreducible over $mathbbQ$?Is $x^6 + 3x^3 -2$ irreducible over $mathbb Q$?Show that $2x^5-4x^2-5$ is irreducible over $mathbbQ$Is $f(y) = 5 - 4y^2 + y^4$ irreducible over $mathbbQ(sqrt5)$?How to prove that $x^5-5$ is irreducible over $mathbb Q(sqrt 2, sqrt[3] 3) $
Aligning individual characters/glyphs like a monospace font
Why did the EU agree to delay the Brexit deadline?
Transformation of random variables and joint distributions
Flux received by a negative charge
Customize circled numbers
Should I install hardwood flooring or cabinets first?
Is it improper etiquette to ask your opponent what his/her rating is before the game?
If a character with the Alert feat rolls a crit fail on their Perception check, are they surprised?
Open a doc from terminal, but not by its name
Have I saved too much for retirement so far?
Proving a function is onto where f(x)=|x|.
Can I sign legal documents with a smiley face?
How can "mimic phobia" be cured or prevented?
Varistor? Purpose and principle
Why does Async/Await work properly when the loop is inside the async function and not the other way around?
Greatest common substring
Frequency of inspection at vegan restaurants
In Star Trek IV, why did the Bounty go back to a time when whales are already rare?
How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?
Melting point of aspirin, contradicting sources
Bob has never been a M before
Java - What do constructor type arguments mean when placed *before* the type?
Has Darkwing Duck ever met Scrooge McDuck?
Global amount of publications over time
Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$?
How to prove that $x^4+x^3+x^2+3x+3 $ is irreducible over ring $mathbbZ$ of integers?Irreducible over the rationalsWhy can't Eisenstein Criterion be used for certain polynomials (to show that it's irreducible over $mathbbQ$)?Showing a polynomial is irreducible over $mathbbC[x,y]$How to prove a polynomial irreducible over $mathbbC$Why is $x^3+2x^2+x-9$ irreducible over $mathbbQ$?Is $x^6 + 3x^3 -2$ irreducible over $mathbb Q$?Show that $2x^5-4x^2-5$ is irreducible over $mathbbQ$Is $f(y) = 5 - 4y^2 + y^4$ irreducible over $mathbbQ(sqrt5)$?How to prove that $x^5-5$ is irreducible over $mathbb Q(sqrt 2, sqrt[3] 3) $
$begingroup$
Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$ for $m in mathbbZ$, $m>0$?
Wolfram alpha says it is but gives no proof why. Eisenstein's criterion doesn't apply. I have no idea how to proceed. Can anyone help?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
add a comment |
$begingroup$
Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$ for $m in mathbbZ$, $m>0$?
Wolfram alpha says it is but gives no proof why. Eisenstein's criterion doesn't apply. I have no idea how to proceed. Can anyone help?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
1
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42
add a comment |
$begingroup$
Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$ for $m in mathbbZ$, $m>0$?
Wolfram alpha says it is but gives no proof why. Eisenstein's criterion doesn't apply. I have no idea how to proceed. Can anyone help?
abstract-algebra polynomials irreducible-polynomials
$endgroup$
Is $x^4+2x^2-8m^2x+1$ irreducible over $mathbbQ$ for $m in mathbbZ$, $m>0$?
Wolfram alpha says it is but gives no proof why. Eisenstein's criterion doesn't apply. I have no idea how to proceed. Can anyone help?
abstract-algebra polynomials irreducible-polynomials
abstract-algebra polynomials irreducible-polynomials
edited Sep 6 '15 at 15:16
user26857
39.4k124183
39.4k124183
asked Sep 6 '15 at 12:37
ShevakShevak
1155
1155
1
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42
add a comment |
1
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42
1
1
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Clearly there are no integer (hence no rational roots), so we need to only check for quadratic factors. So we need to only check for the form
$$x^4+2x^2-8m^2x+1=(x^2+axpm1)(x^2-axpm1)$$
which gives $2-a^2=2$ and $pm2a=-8m^2$ which is possible only when $a=m=0$.
$endgroup$
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
add a comment |
$begingroup$
Its irreducibility follows nicely from Perron's criterion when applied to reciprocal $g(x)=x^4f(1/x)=x^4-8m^2x^3+2x^2+1$:
Perron's criterion: Let $P(x) = x^n + a_n-1 x^n-1 + dots + a_0 in mathbbZ[x]$. If $|a_n-1| > 1 + |a_n-2| + dots + |a_0|$, then $P(x)$ is irreducible.
Since $8m^2> 1+2+1 = 4$ clearly holds for $m>0$, it follows $g(x)$ is irreducible, and particularly $f(x)$ is irreducible as well.
$endgroup$
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
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%2f1424100%2fis-x42x2-8m2x1-irreducible-over-mathbbq%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$
Clearly there are no integer (hence no rational roots), so we need to only check for quadratic factors. So we need to only check for the form
$$x^4+2x^2-8m^2x+1=(x^2+axpm1)(x^2-axpm1)$$
which gives $2-a^2=2$ and $pm2a=-8m^2$ which is possible only when $a=m=0$.
$endgroup$
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
add a comment |
$begingroup$
Clearly there are no integer (hence no rational roots), so we need to only check for quadratic factors. So we need to only check for the form
$$x^4+2x^2-8m^2x+1=(x^2+axpm1)(x^2-axpm1)$$
which gives $2-a^2=2$ and $pm2a=-8m^2$ which is possible only when $a=m=0$.
$endgroup$
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
add a comment |
$begingroup$
Clearly there are no integer (hence no rational roots), so we need to only check for quadratic factors. So we need to only check for the form
$$x^4+2x^2-8m^2x+1=(x^2+axpm1)(x^2-axpm1)$$
which gives $2-a^2=2$ and $pm2a=-8m^2$ which is possible only when $a=m=0$.
$endgroup$
Clearly there are no integer (hence no rational roots), so we need to only check for quadratic factors. So we need to only check for the form
$$x^4+2x^2-8m^2x+1=(x^2+axpm1)(x^2-axpm1)$$
which gives $2-a^2=2$ and $pm2a=-8m^2$ which is possible only when $a=m=0$.
answered Sep 6 '15 at 12:51
MacavityMacavity
35.7k52554
35.7k52554
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
add a comment |
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
$begingroup$
That works. I was struggling for a while trying to show that it has no rational roots. But from the rational root theorem $x=pm 1$ if x is a rational root of the above polynomial which leads to a contradiction.
$endgroup$
– Shevak
Sep 6 '15 at 13:46
add a comment |
$begingroup$
Its irreducibility follows nicely from Perron's criterion when applied to reciprocal $g(x)=x^4f(1/x)=x^4-8m^2x^3+2x^2+1$:
Perron's criterion: Let $P(x) = x^n + a_n-1 x^n-1 + dots + a_0 in mathbbZ[x]$. If $|a_n-1| > 1 + |a_n-2| + dots + |a_0|$, then $P(x)$ is irreducible.
Since $8m^2> 1+2+1 = 4$ clearly holds for $m>0$, it follows $g(x)$ is irreducible, and particularly $f(x)$ is irreducible as well.
$endgroup$
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
add a comment |
$begingroup$
Its irreducibility follows nicely from Perron's criterion when applied to reciprocal $g(x)=x^4f(1/x)=x^4-8m^2x^3+2x^2+1$:
Perron's criterion: Let $P(x) = x^n + a_n-1 x^n-1 + dots + a_0 in mathbbZ[x]$. If $|a_n-1| > 1 + |a_n-2| + dots + |a_0|$, then $P(x)$ is irreducible.
Since $8m^2> 1+2+1 = 4$ clearly holds for $m>0$, it follows $g(x)$ is irreducible, and particularly $f(x)$ is irreducible as well.
$endgroup$
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
add a comment |
$begingroup$
Its irreducibility follows nicely from Perron's criterion when applied to reciprocal $g(x)=x^4f(1/x)=x^4-8m^2x^3+2x^2+1$:
Perron's criterion: Let $P(x) = x^n + a_n-1 x^n-1 + dots + a_0 in mathbbZ[x]$. If $|a_n-1| > 1 + |a_n-2| + dots + |a_0|$, then $P(x)$ is irreducible.
Since $8m^2> 1+2+1 = 4$ clearly holds for $m>0$, it follows $g(x)$ is irreducible, and particularly $f(x)$ is irreducible as well.
$endgroup$
Its irreducibility follows nicely from Perron's criterion when applied to reciprocal $g(x)=x^4f(1/x)=x^4-8m^2x^3+2x^2+1$:
Perron's criterion: Let $P(x) = x^n + a_n-1 x^n-1 + dots + a_0 in mathbbZ[x]$. If $|a_n-1| > 1 + |a_n-2| + dots + |a_0|$, then $P(x)$ is irreducible.
Since $8m^2> 1+2+1 = 4$ clearly holds for $m>0$, it follows $g(x)$ is irreducible, and particularly $f(x)$ is irreducible as well.
answered Mar 16 at 10:53
SilSil
5,31221643
5,31221643
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
add a comment |
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
1
1
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
$begingroup$
One can find Perron's criterion at yufeizhao.com/olympiad/intpoly.pdf
$endgroup$
– egreg
Mar 16 at 11:33
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%2f1424100%2fis-x42x2-8m2x1-irreducible-over-mathbbq%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
$begingroup$
Have you tried reducing modulo a prime? There is a theorem along the following lines; if you reduce f modulo a prime and the degree doesn't change, then irreducibility modulo the prime implies irreducibility over $mathbbQ$. Reducing modulo 3 shows that it is irreducible if $mneq 1$
$endgroup$
– User0112358
Sep 6 '15 at 12:42