A problem on existence of a zero of a polynomial in a finite field
$begingroup$
Let $f(x)$ be a polynomial in $mathbb Z[X]$ such that degree of $f(x)$ is positive. I want to prove that for infinitely many $p$, $f(x)$ has a zero in $mathbb{Z}/pmathbb{mathbb Z}$.
I got a hint that Taylor's theorem is to be used. But I could not understand it properly. Any help is appreciated.
polynomials ring-theory commutative-algebra
$endgroup$
add a comment |
$begingroup$
Let $f(x)$ be a polynomial in $mathbb Z[X]$ such that degree of $f(x)$ is positive. I want to prove that for infinitely many $p$, $f(x)$ has a zero in $mathbb{Z}/pmathbb{mathbb Z}$.
I got a hint that Taylor's theorem is to be used. But I could not understand it properly. Any help is appreciated.
polynomials ring-theory commutative-algebra
$endgroup$
add a comment |
$begingroup$
Let $f(x)$ be a polynomial in $mathbb Z[X]$ such that degree of $f(x)$ is positive. I want to prove that for infinitely many $p$, $f(x)$ has a zero in $mathbb{Z}/pmathbb{mathbb Z}$.
I got a hint that Taylor's theorem is to be used. But I could not understand it properly. Any help is appreciated.
polynomials ring-theory commutative-algebra
$endgroup$
Let $f(x)$ be a polynomial in $mathbb Z[X]$ such that degree of $f(x)$ is positive. I want to prove that for infinitely many $p$, $f(x)$ has a zero in $mathbb{Z}/pmathbb{mathbb Z}$.
I got a hint that Taylor's theorem is to be used. But I could not understand it properly. Any help is appreciated.
polynomials ring-theory commutative-algebra
polynomials ring-theory commutative-algebra
asked Feb 10 at 14:09
AnupamAnupam
2,5191825
2,5191825
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your question can be answered with Proposition V.2.8. in the book Integer-valued polynomials by P.-J. Cahen and J.-L. Chabert. The authors state it in a different way to characterize the non-maximal prime ideals of the ring $text{Int}(mathbb{Z}) = {f in mathbb{Q}[x] mid f(mathbb{Z}) subseteq mathbb{Z} }$. But we can use the same proof to formulate it like this:
Let $q in mathbb{Q}[x]$ be irreducible. Then for infinitely many prime numbers $p in mathbb{Z}$ it holds that $q$ has a root modulo $p$.
Proof:
Let $q in mathbb{Q}[x]$ be irreducible and $d in mathbb{Z} setminus (0)$ such that $dq in mathbb{Z}[x]$. Since $qmathbb{Q}[x] = dqmathbb{Q}[x]$, we may assume that $q in mathbb{Z}[x]$. We show that for infinitely many primes $p in mathbb{Z}$ there is an $a in mathbb{Z}$ such that $p |_mathbb{Z} q(a)$.
For $q = x$ this is clear, so let $q = a_0 + a_1x + ... + a_dx^d$ with $a_0 neq 0$. Assume to the contrary that the set $mathcal{D} := { p in mathbb{Z} mid p in mathbb{P} land exists a in mathbb{Z}: q(a) in pmathbb{Z} }$ is finite, and let $y := prod_{p in mathcal{D}} p$.
$mathcal{D}$ is non-empty, since $q$ is non-constant and therefore unbounded, hence $y notin {1,-1}$. Therefore we have for non-negative integers $m neq n$ that $y^m neq y^n$. Hence there exists an integer $k > 0$ such that $q(a_0y^k) neq pm a_0$. (Otherwise $q$ would take one of the values $pm a_0$ infinitely many times and therefore would be constant.) For such $k$, it holds that $q(a_0y^k) = a_0(1 + y^kb)$ for some $b in mathbb{Z}$ and $1 + y^kb$ is no unit, since $q(a_0y^k) = a_0(1 + y^kb) neq pm a_0$. Therefore there exists a prime $p in mathbb{Z}$ such that $1 + y^kb in pmathbb{Z}$ and hence $q(a_0y^k) in pmathbb{Z}$, which implies that $p in mathcal{D}$.
But for all $p' in mathcal{D}$ it holds that $y in p'mathbb{Z}$ and hence $y^kb in p'mathbb{Z}$. Therefore $1 + y^kb notin p'mathcal{P}$ which implies $p' neq p$. So $p notin mathcal{D}$, which is a contradiction.
$endgroup$
add a comment |
$begingroup$
I don't see how to use Taylor's theorem here, but here is an alternative solution: $f$ has a zero in $mathbb{Z}/pmathbb{Z}$ if and only of $p$ is a factor of $f(n)$ for some integer $n$. So it remains to show that there are infinitely many prime factors of outputs of $f$.
There are several ways to do this; Qiaochu Yuan discusses 2 here: https://qchu.wordpress.com/2009/09/02/some-remarks-on-the-infinitude-of-primes/
(I'm making this community wiki since Qiaochu Yuan did most of the work here)
$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%2f3107469%2fa-problem-on-existence-of-a-zero-of-a-polynomial-in-a-finite-field%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$
Your question can be answered with Proposition V.2.8. in the book Integer-valued polynomials by P.-J. Cahen and J.-L. Chabert. The authors state it in a different way to characterize the non-maximal prime ideals of the ring $text{Int}(mathbb{Z}) = {f in mathbb{Q}[x] mid f(mathbb{Z}) subseteq mathbb{Z} }$. But we can use the same proof to formulate it like this:
Let $q in mathbb{Q}[x]$ be irreducible. Then for infinitely many prime numbers $p in mathbb{Z}$ it holds that $q$ has a root modulo $p$.
Proof:
Let $q in mathbb{Q}[x]$ be irreducible and $d in mathbb{Z} setminus (0)$ such that $dq in mathbb{Z}[x]$. Since $qmathbb{Q}[x] = dqmathbb{Q}[x]$, we may assume that $q in mathbb{Z}[x]$. We show that for infinitely many primes $p in mathbb{Z}$ there is an $a in mathbb{Z}$ such that $p |_mathbb{Z} q(a)$.
For $q = x$ this is clear, so let $q = a_0 + a_1x + ... + a_dx^d$ with $a_0 neq 0$. Assume to the contrary that the set $mathcal{D} := { p in mathbb{Z} mid p in mathbb{P} land exists a in mathbb{Z}: q(a) in pmathbb{Z} }$ is finite, and let $y := prod_{p in mathcal{D}} p$.
$mathcal{D}$ is non-empty, since $q$ is non-constant and therefore unbounded, hence $y notin {1,-1}$. Therefore we have for non-negative integers $m neq n$ that $y^m neq y^n$. Hence there exists an integer $k > 0$ such that $q(a_0y^k) neq pm a_0$. (Otherwise $q$ would take one of the values $pm a_0$ infinitely many times and therefore would be constant.) For such $k$, it holds that $q(a_0y^k) = a_0(1 + y^kb)$ for some $b in mathbb{Z}$ and $1 + y^kb$ is no unit, since $q(a_0y^k) = a_0(1 + y^kb) neq pm a_0$. Therefore there exists a prime $p in mathbb{Z}$ such that $1 + y^kb in pmathbb{Z}$ and hence $q(a_0y^k) in pmathbb{Z}$, which implies that $p in mathcal{D}$.
But for all $p' in mathcal{D}$ it holds that $y in p'mathbb{Z}$ and hence $y^kb in p'mathbb{Z}$. Therefore $1 + y^kb notin p'mathcal{P}$ which implies $p' neq p$. So $p notin mathcal{D}$, which is a contradiction.
$endgroup$
add a comment |
$begingroup$
Your question can be answered with Proposition V.2.8. in the book Integer-valued polynomials by P.-J. Cahen and J.-L. Chabert. The authors state it in a different way to characterize the non-maximal prime ideals of the ring $text{Int}(mathbb{Z}) = {f in mathbb{Q}[x] mid f(mathbb{Z}) subseteq mathbb{Z} }$. But we can use the same proof to formulate it like this:
Let $q in mathbb{Q}[x]$ be irreducible. Then for infinitely many prime numbers $p in mathbb{Z}$ it holds that $q$ has a root modulo $p$.
Proof:
Let $q in mathbb{Q}[x]$ be irreducible and $d in mathbb{Z} setminus (0)$ such that $dq in mathbb{Z}[x]$. Since $qmathbb{Q}[x] = dqmathbb{Q}[x]$, we may assume that $q in mathbb{Z}[x]$. We show that for infinitely many primes $p in mathbb{Z}$ there is an $a in mathbb{Z}$ such that $p |_mathbb{Z} q(a)$.
For $q = x$ this is clear, so let $q = a_0 + a_1x + ... + a_dx^d$ with $a_0 neq 0$. Assume to the contrary that the set $mathcal{D} := { p in mathbb{Z} mid p in mathbb{P} land exists a in mathbb{Z}: q(a) in pmathbb{Z} }$ is finite, and let $y := prod_{p in mathcal{D}} p$.
$mathcal{D}$ is non-empty, since $q$ is non-constant and therefore unbounded, hence $y notin {1,-1}$. Therefore we have for non-negative integers $m neq n$ that $y^m neq y^n$. Hence there exists an integer $k > 0$ such that $q(a_0y^k) neq pm a_0$. (Otherwise $q$ would take one of the values $pm a_0$ infinitely many times and therefore would be constant.) For such $k$, it holds that $q(a_0y^k) = a_0(1 + y^kb)$ for some $b in mathbb{Z}$ and $1 + y^kb$ is no unit, since $q(a_0y^k) = a_0(1 + y^kb) neq pm a_0$. Therefore there exists a prime $p in mathbb{Z}$ such that $1 + y^kb in pmathbb{Z}$ and hence $q(a_0y^k) in pmathbb{Z}$, which implies that $p in mathcal{D}$.
But for all $p' in mathcal{D}$ it holds that $y in p'mathbb{Z}$ and hence $y^kb in p'mathbb{Z}$. Therefore $1 + y^kb notin p'mathcal{P}$ which implies $p' neq p$. So $p notin mathcal{D}$, which is a contradiction.
$endgroup$
add a comment |
$begingroup$
Your question can be answered with Proposition V.2.8. in the book Integer-valued polynomials by P.-J. Cahen and J.-L. Chabert. The authors state it in a different way to characterize the non-maximal prime ideals of the ring $text{Int}(mathbb{Z}) = {f in mathbb{Q}[x] mid f(mathbb{Z}) subseteq mathbb{Z} }$. But we can use the same proof to formulate it like this:
Let $q in mathbb{Q}[x]$ be irreducible. Then for infinitely many prime numbers $p in mathbb{Z}$ it holds that $q$ has a root modulo $p$.
Proof:
Let $q in mathbb{Q}[x]$ be irreducible and $d in mathbb{Z} setminus (0)$ such that $dq in mathbb{Z}[x]$. Since $qmathbb{Q}[x] = dqmathbb{Q}[x]$, we may assume that $q in mathbb{Z}[x]$. We show that for infinitely many primes $p in mathbb{Z}$ there is an $a in mathbb{Z}$ such that $p |_mathbb{Z} q(a)$.
For $q = x$ this is clear, so let $q = a_0 + a_1x + ... + a_dx^d$ with $a_0 neq 0$. Assume to the contrary that the set $mathcal{D} := { p in mathbb{Z} mid p in mathbb{P} land exists a in mathbb{Z}: q(a) in pmathbb{Z} }$ is finite, and let $y := prod_{p in mathcal{D}} p$.
$mathcal{D}$ is non-empty, since $q$ is non-constant and therefore unbounded, hence $y notin {1,-1}$. Therefore we have for non-negative integers $m neq n$ that $y^m neq y^n$. Hence there exists an integer $k > 0$ such that $q(a_0y^k) neq pm a_0$. (Otherwise $q$ would take one of the values $pm a_0$ infinitely many times and therefore would be constant.) For such $k$, it holds that $q(a_0y^k) = a_0(1 + y^kb)$ for some $b in mathbb{Z}$ and $1 + y^kb$ is no unit, since $q(a_0y^k) = a_0(1 + y^kb) neq pm a_0$. Therefore there exists a prime $p in mathbb{Z}$ such that $1 + y^kb in pmathbb{Z}$ and hence $q(a_0y^k) in pmathbb{Z}$, which implies that $p in mathcal{D}$.
But for all $p' in mathcal{D}$ it holds that $y in p'mathbb{Z}$ and hence $y^kb in p'mathbb{Z}$. Therefore $1 + y^kb notin p'mathcal{P}$ which implies $p' neq p$. So $p notin mathcal{D}$, which is a contradiction.
$endgroup$
Your question can be answered with Proposition V.2.8. in the book Integer-valued polynomials by P.-J. Cahen and J.-L. Chabert. The authors state it in a different way to characterize the non-maximal prime ideals of the ring $text{Int}(mathbb{Z}) = {f in mathbb{Q}[x] mid f(mathbb{Z}) subseteq mathbb{Z} }$. But we can use the same proof to formulate it like this:
Let $q in mathbb{Q}[x]$ be irreducible. Then for infinitely many prime numbers $p in mathbb{Z}$ it holds that $q$ has a root modulo $p$.
Proof:
Let $q in mathbb{Q}[x]$ be irreducible and $d in mathbb{Z} setminus (0)$ such that $dq in mathbb{Z}[x]$. Since $qmathbb{Q}[x] = dqmathbb{Q}[x]$, we may assume that $q in mathbb{Z}[x]$. We show that for infinitely many primes $p in mathbb{Z}$ there is an $a in mathbb{Z}$ such that $p |_mathbb{Z} q(a)$.
For $q = x$ this is clear, so let $q = a_0 + a_1x + ... + a_dx^d$ with $a_0 neq 0$. Assume to the contrary that the set $mathcal{D} := { p in mathbb{Z} mid p in mathbb{P} land exists a in mathbb{Z}: q(a) in pmathbb{Z} }$ is finite, and let $y := prod_{p in mathcal{D}} p$.
$mathcal{D}$ is non-empty, since $q$ is non-constant and therefore unbounded, hence $y notin {1,-1}$. Therefore we have for non-negative integers $m neq n$ that $y^m neq y^n$. Hence there exists an integer $k > 0$ such that $q(a_0y^k) neq pm a_0$. (Otherwise $q$ would take one of the values $pm a_0$ infinitely many times and therefore would be constant.) For such $k$, it holds that $q(a_0y^k) = a_0(1 + y^kb)$ for some $b in mathbb{Z}$ and $1 + y^kb$ is no unit, since $q(a_0y^k) = a_0(1 + y^kb) neq pm a_0$. Therefore there exists a prime $p in mathbb{Z}$ such that $1 + y^kb in pmathbb{Z}$ and hence $q(a_0y^k) in pmathbb{Z}$, which implies that $p in mathcal{D}$.
But for all $p' in mathcal{D}$ it holds that $y in p'mathbb{Z}$ and hence $y^kb in p'mathbb{Z}$. Therefore $1 + y^kb notin p'mathcal{P}$ which implies $p' neq p$. So $p notin mathcal{D}$, which is a contradiction.
answered Feb 10 at 15:06
Daniel W.Daniel W.
413
413
add a comment |
add a comment |
$begingroup$
I don't see how to use Taylor's theorem here, but here is an alternative solution: $f$ has a zero in $mathbb{Z}/pmathbb{Z}$ if and only of $p$ is a factor of $f(n)$ for some integer $n$. So it remains to show that there are infinitely many prime factors of outputs of $f$.
There are several ways to do this; Qiaochu Yuan discusses 2 here: https://qchu.wordpress.com/2009/09/02/some-remarks-on-the-infinitude-of-primes/
(I'm making this community wiki since Qiaochu Yuan did most of the work here)
$endgroup$
add a comment |
$begingroup$
I don't see how to use Taylor's theorem here, but here is an alternative solution: $f$ has a zero in $mathbb{Z}/pmathbb{Z}$ if and only of $p$ is a factor of $f(n)$ for some integer $n$. So it remains to show that there are infinitely many prime factors of outputs of $f$.
There are several ways to do this; Qiaochu Yuan discusses 2 here: https://qchu.wordpress.com/2009/09/02/some-remarks-on-the-infinitude-of-primes/
(I'm making this community wiki since Qiaochu Yuan did most of the work here)
$endgroup$
add a comment |
$begingroup$
I don't see how to use Taylor's theorem here, but here is an alternative solution: $f$ has a zero in $mathbb{Z}/pmathbb{Z}$ if and only of $p$ is a factor of $f(n)$ for some integer $n$. So it remains to show that there are infinitely many prime factors of outputs of $f$.
There are several ways to do this; Qiaochu Yuan discusses 2 here: https://qchu.wordpress.com/2009/09/02/some-remarks-on-the-infinitude-of-primes/
(I'm making this community wiki since Qiaochu Yuan did most of the work here)
$endgroup$
I don't see how to use Taylor's theorem here, but here is an alternative solution: $f$ has a zero in $mathbb{Z}/pmathbb{Z}$ if and only of $p$ is a factor of $f(n)$ for some integer $n$. So it remains to show that there are infinitely many prime factors of outputs of $f$.
There are several ways to do this; Qiaochu Yuan discusses 2 here: https://qchu.wordpress.com/2009/09/02/some-remarks-on-the-infinitude-of-primes/
(I'm making this community wiki since Qiaochu Yuan did most of the work here)
answered Feb 10 at 15:07
community wiki
alphacapture
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%2f3107469%2fa-problem-on-existence-of-a-zero-of-a-polynomial-in-a-finite-field%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