Proving $ord_p(ζ_p-1)=1/(p-1)$
After proving this, I was able to deduce an even more general result that $ord_p(ζ_p-1)=ord_p(ζ_p^2-1)=...=ord_p(ζ_p^{p-1}-1)$. Now, according to Lubin, $ord_p(ζ_p-1)$ should be $1/(p-1)$, but this isn't obvious to me so I need to prove it.
My thought was to multiply out the product $(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)$ and hope that I get something with p-order $1$ (since this would finish the proof), but I'm stuck.
I know that $ord_p(ζ_p^k)=0$ for any $k geq 0$. So if we multiply out the product, we get a sum with all of its terms having p-order $0$. I see from this that $ord_p[(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)] geq 0$.
abstract-algebra prime-numbers extension-field p-adic-number-theory roots-of-unity
add a comment |
After proving this, I was able to deduce an even more general result that $ord_p(ζ_p-1)=ord_p(ζ_p^2-1)=...=ord_p(ζ_p^{p-1}-1)$. Now, according to Lubin, $ord_p(ζ_p-1)$ should be $1/(p-1)$, but this isn't obvious to me so I need to prove it.
My thought was to multiply out the product $(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)$ and hope that I get something with p-order $1$ (since this would finish the proof), but I'm stuck.
I know that $ord_p(ζ_p^k)=0$ for any $k geq 0$. So if we multiply out the product, we get a sum with all of its terms having p-order $0$. I see from this that $ord_p[(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)] geq 0$.
abstract-algebra prime-numbers extension-field p-adic-number-theory roots-of-unity
3
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
1
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52
add a comment |
After proving this, I was able to deduce an even more general result that $ord_p(ζ_p-1)=ord_p(ζ_p^2-1)=...=ord_p(ζ_p^{p-1}-1)$. Now, according to Lubin, $ord_p(ζ_p-1)$ should be $1/(p-1)$, but this isn't obvious to me so I need to prove it.
My thought was to multiply out the product $(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)$ and hope that I get something with p-order $1$ (since this would finish the proof), but I'm stuck.
I know that $ord_p(ζ_p^k)=0$ for any $k geq 0$. So if we multiply out the product, we get a sum with all of its terms having p-order $0$. I see from this that $ord_p[(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)] geq 0$.
abstract-algebra prime-numbers extension-field p-adic-number-theory roots-of-unity
After proving this, I was able to deduce an even more general result that $ord_p(ζ_p-1)=ord_p(ζ_p^2-1)=...=ord_p(ζ_p^{p-1}-1)$. Now, according to Lubin, $ord_p(ζ_p-1)$ should be $1/(p-1)$, but this isn't obvious to me so I need to prove it.
My thought was to multiply out the product $(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)$ and hope that I get something with p-order $1$ (since this would finish the proof), but I'm stuck.
I know that $ord_p(ζ_p^k)=0$ for any $k geq 0$. So if we multiply out the product, we get a sum with all of its terms having p-order $0$. I see from this that $ord_p[(ζ_p-1)(ζ_p^2-1)...(ζ_p^{p-1}-1)] geq 0$.
abstract-algebra prime-numbers extension-field p-adic-number-theory roots-of-unity
abstract-algebra prime-numbers extension-field p-adic-number-theory roots-of-unity
asked Dec 7 at 22:13
Pascal's Wager
325115
325115
3
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
1
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52
add a comment |
3
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
1
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52
3
3
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
1
1
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52
add a comment |
1 Answer
1
active
oldest
votes
$|a|_p = p^{-v_p(a)}$
Since $zeta_p^p = 1$ then $|zeta_p|_p=1$
$sum_{m=0}^{p-1} x^m =frac{x^p-1}{x-1}=prod_{k=1}^{p-1} (x-zeta_p^k)$
$prod_{k=1}^{p-1} |1-zeta_p^k| = |sum_{m=0}^{p-1} 1^m|_p = p^{-1}$ so there is some $k$ such that $|1-zeta_p^k|_p <1$.
$1-zeta_p^{kn} =1- (1+ (1-zeta_p^k))^n =1-(1+n(1-zeta_p^k)+O((1-zeta_p^k)^2)$
whence (for $p nmid n$)
$|1-zeta_p^{kn}|_p = |n|_p |1-zeta_p^{k}|_p=|1-zeta_p^{k}|_p$ and $|1-zeta_p^{k}|_p^{p-1} = p^{-1}$
letting $kn equiv 1bmod p$ you get your result $|1-zeta_p|_p =p^{-1/(p-1)}$
Note this is also a proof that $sum_{m=0}^{p-1} x^m$ is irreducible since we need to multiply all the $1-zeta_p^k, k in 1 ldots p-1$ to obtain something of integer valuation
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%2f3030429%2fproving-ord-p%25ce%25b6-p-1-1-p-1%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
$|a|_p = p^{-v_p(a)}$
Since $zeta_p^p = 1$ then $|zeta_p|_p=1$
$sum_{m=0}^{p-1} x^m =frac{x^p-1}{x-1}=prod_{k=1}^{p-1} (x-zeta_p^k)$
$prod_{k=1}^{p-1} |1-zeta_p^k| = |sum_{m=0}^{p-1} 1^m|_p = p^{-1}$ so there is some $k$ such that $|1-zeta_p^k|_p <1$.
$1-zeta_p^{kn} =1- (1+ (1-zeta_p^k))^n =1-(1+n(1-zeta_p^k)+O((1-zeta_p^k)^2)$
whence (for $p nmid n$)
$|1-zeta_p^{kn}|_p = |n|_p |1-zeta_p^{k}|_p=|1-zeta_p^{k}|_p$ and $|1-zeta_p^{k}|_p^{p-1} = p^{-1}$
letting $kn equiv 1bmod p$ you get your result $|1-zeta_p|_p =p^{-1/(p-1)}$
Note this is also a proof that $sum_{m=0}^{p-1} x^m$ is irreducible since we need to multiply all the $1-zeta_p^k, k in 1 ldots p-1$ to obtain something of integer valuation
add a comment |
$|a|_p = p^{-v_p(a)}$
Since $zeta_p^p = 1$ then $|zeta_p|_p=1$
$sum_{m=0}^{p-1} x^m =frac{x^p-1}{x-1}=prod_{k=1}^{p-1} (x-zeta_p^k)$
$prod_{k=1}^{p-1} |1-zeta_p^k| = |sum_{m=0}^{p-1} 1^m|_p = p^{-1}$ so there is some $k$ such that $|1-zeta_p^k|_p <1$.
$1-zeta_p^{kn} =1- (1+ (1-zeta_p^k))^n =1-(1+n(1-zeta_p^k)+O((1-zeta_p^k)^2)$
whence (for $p nmid n$)
$|1-zeta_p^{kn}|_p = |n|_p |1-zeta_p^{k}|_p=|1-zeta_p^{k}|_p$ and $|1-zeta_p^{k}|_p^{p-1} = p^{-1}$
letting $kn equiv 1bmod p$ you get your result $|1-zeta_p|_p =p^{-1/(p-1)}$
Note this is also a proof that $sum_{m=0}^{p-1} x^m$ is irreducible since we need to multiply all the $1-zeta_p^k, k in 1 ldots p-1$ to obtain something of integer valuation
add a comment |
$|a|_p = p^{-v_p(a)}$
Since $zeta_p^p = 1$ then $|zeta_p|_p=1$
$sum_{m=0}^{p-1} x^m =frac{x^p-1}{x-1}=prod_{k=1}^{p-1} (x-zeta_p^k)$
$prod_{k=1}^{p-1} |1-zeta_p^k| = |sum_{m=0}^{p-1} 1^m|_p = p^{-1}$ so there is some $k$ such that $|1-zeta_p^k|_p <1$.
$1-zeta_p^{kn} =1- (1+ (1-zeta_p^k))^n =1-(1+n(1-zeta_p^k)+O((1-zeta_p^k)^2)$
whence (for $p nmid n$)
$|1-zeta_p^{kn}|_p = |n|_p |1-zeta_p^{k}|_p=|1-zeta_p^{k}|_p$ and $|1-zeta_p^{k}|_p^{p-1} = p^{-1}$
letting $kn equiv 1bmod p$ you get your result $|1-zeta_p|_p =p^{-1/(p-1)}$
Note this is also a proof that $sum_{m=0}^{p-1} x^m$ is irreducible since we need to multiply all the $1-zeta_p^k, k in 1 ldots p-1$ to obtain something of integer valuation
$|a|_p = p^{-v_p(a)}$
Since $zeta_p^p = 1$ then $|zeta_p|_p=1$
$sum_{m=0}^{p-1} x^m =frac{x^p-1}{x-1}=prod_{k=1}^{p-1} (x-zeta_p^k)$
$prod_{k=1}^{p-1} |1-zeta_p^k| = |sum_{m=0}^{p-1} 1^m|_p = p^{-1}$ so there is some $k$ such that $|1-zeta_p^k|_p <1$.
$1-zeta_p^{kn} =1- (1+ (1-zeta_p^k))^n =1-(1+n(1-zeta_p^k)+O((1-zeta_p^k)^2)$
whence (for $p nmid n$)
$|1-zeta_p^{kn}|_p = |n|_p |1-zeta_p^{k}|_p=|1-zeta_p^{k}|_p$ and $|1-zeta_p^{k}|_p^{p-1} = p^{-1}$
letting $kn equiv 1bmod p$ you get your result $|1-zeta_p|_p =p^{-1/(p-1)}$
Note this is also a proof that $sum_{m=0}^{p-1} x^m$ is irreducible since we need to multiply all the $1-zeta_p^k, k in 1 ldots p-1$ to obtain something of integer valuation
answered Dec 7 at 22:46
reuns
19.5k21046
19.5k21046
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3030429%2fproving-ord-p%25ce%25b6-p-1-1-p-1%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
3
You have the cyclotomic polynomial $$Phi_p(x)=x^{p-1}+x^{p-2}+cdots+x+1=prod_{k=1}^{p-1}(x-zeta_p^k).$$ What do you get when plug in $x=1$ into the above equation?
– Jyrki Lahtonen
Dec 7 at 22:19
1
And, I'm positive we have covered this already somewhere on the site. Too late an hour for me to spend time searching though.
– Jyrki Lahtonen
Dec 7 at 22:20
This is nothing but says $p$ is totally ramified at $(1-eta_{p^r})$ with ramification index $phi(p^r)$. And it should $p-1$ instead of $1/(p-1)$.
– user45765
Dec 7 at 22:32
@JyrkiLahtonen Wow, that's almost too good to be true! I think that answers my question.
– Pascal's Wager
Dec 7 at 22:52