Proof: We claim that for any a1≢0modp, the coordinates of a are uniquely determined and satisfy the given criteria. We proceed by induction on the nth coordinate: The case holds true for n=1, so observe the n+1th coordinate. ap−1n+1≡1modpn+1 if and only if its associated polynomial representation (b0+b1p+...+bnpn)p−1≡1modpn+1 holds true, so this is equivalent to solving for bn since an=b0+b1p+...+bn−1pn−1 has been uniquely determined.(b0+b1p+...+bnpn)p−1≡1modpn+1⇔((b0+b1p+...+bn−1pn−1)+(bnpn))p−1≡1modpn+1⇔p−1∑k=0(p−1k)(b0+b1p+...+bn−1pn−1)k(bnpn)p−1−k≡1modpn+1⇔(b0+b1p+...+bn−1pn−1)p−1+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1Since (b0+b1p+...+bn−1pn−1)p−1≡1modpn has been uniquely determined, we have (b0+b1p+...+bn−1pn−1)p−1=1+vpn for some integer v.1+vpn+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1⇔1+vpn−bp−20bnpn≡1modpn+1⇔1+(v−ap−21bn)pn≡1modpn+1⇔v−ap−21bn≡0modp⇔bn≡a2−p1vmodp ◻
Sunday, May 5, 2013
(p-1)th Roots of the p-Adic Integers (7.6.11e)
Dummit and Foote Abstract Algebra, section 7.6, exercise 11e:
MathJax TeX Test Page
Show that if a1≢0modp, then there is an element a=(ai) in the inverse limit Zp satisfying ap−1j≡1modpj and μj1(aj)=a1 for all j. Deduce that Zp contains p−1 distinct (p−1)th roots of 1.
Proof: We claim that for any a1≢0modp, the coordinates of a are uniquely determined and satisfy the given criteria. We proceed by induction on the nth coordinate: The case holds true for n=1, so observe the n+1th coordinate. ap−1n+1≡1modpn+1 if and only if its associated polynomial representation (b0+b1p+...+bnpn)p−1≡1modpn+1 holds true, so this is equivalent to solving for bn since an=b0+b1p+...+bn−1pn−1 has been uniquely determined.(b0+b1p+...+bnpn)p−1≡1modpn+1⇔((b0+b1p+...+bn−1pn−1)+(bnpn))p−1≡1modpn+1⇔p−1∑k=0(p−1k)(b0+b1p+...+bn−1pn−1)k(bnpn)p−1−k≡1modpn+1⇔(b0+b1p+...+bn−1pn−1)p−1+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1Since (b0+b1p+...+bn−1pn−1)p−1≡1modpn has been uniquely determined, we have (b0+b1p+...+bn−1pn−1)p−1=1+vpn for some integer v.1+vpn+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1⇔1+vpn−bp−20bnpn≡1modpn+1⇔1+(v−ap−21bn)pn≡1modpn+1⇔v−ap−21bn≡0modp⇔bn≡a2−p1vmodp ◻
Proof: We claim that for any a1≢0modp, the coordinates of a are uniquely determined and satisfy the given criteria. We proceed by induction on the nth coordinate: The case holds true for n=1, so observe the n+1th coordinate. ap−1n+1≡1modpn+1 if and only if its associated polynomial representation (b0+b1p+...+bnpn)p−1≡1modpn+1 holds true, so this is equivalent to solving for bn since an=b0+b1p+...+bn−1pn−1 has been uniquely determined.(b0+b1p+...+bnpn)p−1≡1modpn+1⇔((b0+b1p+...+bn−1pn−1)+(bnpn))p−1≡1modpn+1⇔p−1∑k=0(p−1k)(b0+b1p+...+bn−1pn−1)k(bnpn)p−1−k≡1modpn+1⇔(b0+b1p+...+bn−1pn−1)p−1+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1Since (b0+b1p+...+bn−1pn−1)p−1≡1modpn has been uniquely determined, we have (b0+b1p+...+bn−1pn−1)p−1=1+vpn for some integer v.1+vpn+(p−1)(b0+b1p+...+bn−1pn−1)p−2(bnpn)≡1modpn+1⇔1+vpn−bp−20bnpn≡1modpn+1⇔1+(v−ap−21bn)pn≡1modpn+1⇔v−ap−21bn≡0modp⇔bn≡a2−p1vmodp ◻
Labels:
AADF
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment