An elementary problem of proving congruences in a statement about absolute Galois group for $mathbb{F}_{p}.$












3












$begingroup$


I know little bit basic algebraic number theory but do not major in it.
This question might be trivial for the experts. I should be ashamed of my failure in proving it. If it is too easy, please devote me.



Let $p$ be a prime.
Question is the proof of the following statement:
For $nin mathbb{N}$. Let $a_{n}:=n'x_{n}$ where $n'$ and $v_{p}(n)$ is defined s.t. $n'p^{v_{p}(n)}=n$, $(n',p)=1$ and $x_{n}$ is defined s.t. $1=n'x_{n}+p^{v_{p}(n)}y_{n}$.
Then $a_{n}equiv a_{m} pmod m$ for $mmid n$ and $minmathbb{N}$ and for any integer $a$, there exists $l$ s.t. $a_{l}notequiv a pmod n$.



The author failed in dealing with the explicit expressions for $x_{n}$ and $y_{n}$ although there is an algorithm for that and he failed in working out another approach.



Background:
This is one of the steps in a proof from Neukirch's Algebraic Number Theory.
His aim is proving that, if $F$ is Frobenius element, then cyclic group $langle Frangle$ generated by $F$ is a subgroup of $operatorname{Gal}(overline{mathbb{F}_{p}}/mathbb{F}_{p}).$
If the statement in Question is valid, then $(F^{a_{i}})_{i}nsubseteq langle Frangle$.










share|cite|improve this question











$endgroup$

















    3












    $begingroup$


    I know little bit basic algebraic number theory but do not major in it.
    This question might be trivial for the experts. I should be ashamed of my failure in proving it. If it is too easy, please devote me.



    Let $p$ be a prime.
    Question is the proof of the following statement:
    For $nin mathbb{N}$. Let $a_{n}:=n'x_{n}$ where $n'$ and $v_{p}(n)$ is defined s.t. $n'p^{v_{p}(n)}=n$, $(n',p)=1$ and $x_{n}$ is defined s.t. $1=n'x_{n}+p^{v_{p}(n)}y_{n}$.
    Then $a_{n}equiv a_{m} pmod m$ for $mmid n$ and $minmathbb{N}$ and for any integer $a$, there exists $l$ s.t. $a_{l}notequiv a pmod n$.



    The author failed in dealing with the explicit expressions for $x_{n}$ and $y_{n}$ although there is an algorithm for that and he failed in working out another approach.



    Background:
    This is one of the steps in a proof from Neukirch's Algebraic Number Theory.
    His aim is proving that, if $F$ is Frobenius element, then cyclic group $langle Frangle$ generated by $F$ is a subgroup of $operatorname{Gal}(overline{mathbb{F}_{p}}/mathbb{F}_{p}).$
    If the statement in Question is valid, then $(F^{a_{i}})_{i}nsubseteq langle Frangle$.










    share|cite|improve this question











    $endgroup$















      3












      3








      3


      1



      $begingroup$


      I know little bit basic algebraic number theory but do not major in it.
      This question might be trivial for the experts. I should be ashamed of my failure in proving it. If it is too easy, please devote me.



      Let $p$ be a prime.
      Question is the proof of the following statement:
      For $nin mathbb{N}$. Let $a_{n}:=n'x_{n}$ where $n'$ and $v_{p}(n)$ is defined s.t. $n'p^{v_{p}(n)}=n$, $(n',p)=1$ and $x_{n}$ is defined s.t. $1=n'x_{n}+p^{v_{p}(n)}y_{n}$.
      Then $a_{n}equiv a_{m} pmod m$ for $mmid n$ and $minmathbb{N}$ and for any integer $a$, there exists $l$ s.t. $a_{l}notequiv a pmod n$.



      The author failed in dealing with the explicit expressions for $x_{n}$ and $y_{n}$ although there is an algorithm for that and he failed in working out another approach.



      Background:
      This is one of the steps in a proof from Neukirch's Algebraic Number Theory.
      His aim is proving that, if $F$ is Frobenius element, then cyclic group $langle Frangle$ generated by $F$ is a subgroup of $operatorname{Gal}(overline{mathbb{F}_{p}}/mathbb{F}_{p}).$
      If the statement in Question is valid, then $(F^{a_{i}})_{i}nsubseteq langle Frangle$.










      share|cite|improve this question











      $endgroup$




      I know little bit basic algebraic number theory but do not major in it.
      This question might be trivial for the experts. I should be ashamed of my failure in proving it. If it is too easy, please devote me.



      Let $p$ be a prime.
      Question is the proof of the following statement:
      For $nin mathbb{N}$. Let $a_{n}:=n'x_{n}$ where $n'$ and $v_{p}(n)$ is defined s.t. $n'p^{v_{p}(n)}=n$, $(n',p)=1$ and $x_{n}$ is defined s.t. $1=n'x_{n}+p^{v_{p}(n)}y_{n}$.
      Then $a_{n}equiv a_{m} pmod m$ for $mmid n$ and $minmathbb{N}$ and for any integer $a$, there exists $l$ s.t. $a_{l}notequiv a pmod n$.



      The author failed in dealing with the explicit expressions for $x_{n}$ and $y_{n}$ although there is an algorithm for that and he failed in working out another approach.



      Background:
      This is one of the steps in a proof from Neukirch's Algebraic Number Theory.
      His aim is proving that, if $F$ is Frobenius element, then cyclic group $langle Frangle$ generated by $F$ is a subgroup of $operatorname{Gal}(overline{mathbb{F}_{p}}/mathbb{F}_{p}).$
      If the statement in Question is valid, then $(F^{a_{i}})_{i}nsubseteq langle Frangle$.







      elementary-number-theory algebraic-number-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 13 '18 at 8:24







      user623904

















      asked Dec 7 '18 at 14:20









      user623904user623904

      234




      234






















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          As far as the proof is concerned, you do not really need explicit expressions for $ x_n, y_n $.



          For $ m = m' p^{v_p(m)} $ and $ n = n'p^{v_p(n)} $, if $ m | n $, then we have $ m' | n' $ and $ v_p(m) le v_p(n) $. Now, $$ a_n - a_m = n'x_n - m'x_m $$ and also $$ a_n - a_m = n'x_n - m'x_m = (1-p^{v_p(n)}y_n) - (1-p^{v_p(m)}y_m) = p^{v_p(m)}y_m - p^{v_p(n)}y_n $$ The first equation shows that $ m' | a_n - a_m $ and the second shows that $ p^{v_p(m)} | a_n - a_m $. Together, we get $ m | a_n - a_m $.



          Now suppose that $ a $ is an integer such that $ a equiv a_l pmod l $ for all $ l ge 1 $. Note that by the definitions, for all $ k ge 1 $ we have $ a_{p^k} equiv 1 pmod {p^k} $ and whenever $ q $ is a prime not equal to $ p $, $ a_{q^k} equiv 0 pmod {q^k} $ . Then setting $ l = p^k $ for $ k ge 1 $, we get that $ a equiv 1 pmod {p^k} $ for all $ k ge 1 $ which implies $ a = 1 $. But this is impossible as otherwise we'd have as $ a_q equiv 1 pmod q $ for $ q neq p $.



          The above might sound uninsightful at first but what is really happening is this: For a finite field $ F $, the absolute Galois group $ text{Gal} (overline{F} / F) $ is isomorphic to $ widehat{mathbb{Z}} $, the profinite completion of $ mathbb{Z} $ given by the inverse limit $ varprojlim mathbb{Z} / n mathbb{Z} $. This is isomorphic to the direct product $ prod_l mathbb{Z}_l $ of the rings of $ l $-adic integers and $ mathbb{Z} $ embeds inside this product diagonally (corresponding to the infinite cyclic group generated by the Frobenius in $ text{Gal} (overline{F} / F) $). In the above example, Neukirch is really choosing an element $ (c_l) in prod_l mathbb{Z}_l $ given by $ c_l = 1 $ when $ l = p $ and $ c_l = 0 $ otherwise, and hence such an element is not in the diagonally embedded $ mathbb{Z} $.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
            $endgroup$
            – user623904
            Dec 8 '18 at 6:05












          • $begingroup$
            Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
            $endgroup$
            – user623904
            Dec 8 '18 at 6:06










          • $begingroup$
            That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
            $endgroup$
            – hellHound
            Dec 8 '18 at 11:28













          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
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029941%2fan-elementary-problem-of-proving-congruences-in-a-statement-about-absolute-galoi%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









          3












          $begingroup$

          As far as the proof is concerned, you do not really need explicit expressions for $ x_n, y_n $.



          For $ m = m' p^{v_p(m)} $ and $ n = n'p^{v_p(n)} $, if $ m | n $, then we have $ m' | n' $ and $ v_p(m) le v_p(n) $. Now, $$ a_n - a_m = n'x_n - m'x_m $$ and also $$ a_n - a_m = n'x_n - m'x_m = (1-p^{v_p(n)}y_n) - (1-p^{v_p(m)}y_m) = p^{v_p(m)}y_m - p^{v_p(n)}y_n $$ The first equation shows that $ m' | a_n - a_m $ and the second shows that $ p^{v_p(m)} | a_n - a_m $. Together, we get $ m | a_n - a_m $.



          Now suppose that $ a $ is an integer such that $ a equiv a_l pmod l $ for all $ l ge 1 $. Note that by the definitions, for all $ k ge 1 $ we have $ a_{p^k} equiv 1 pmod {p^k} $ and whenever $ q $ is a prime not equal to $ p $, $ a_{q^k} equiv 0 pmod {q^k} $ . Then setting $ l = p^k $ for $ k ge 1 $, we get that $ a equiv 1 pmod {p^k} $ for all $ k ge 1 $ which implies $ a = 1 $. But this is impossible as otherwise we'd have as $ a_q equiv 1 pmod q $ for $ q neq p $.



          The above might sound uninsightful at first but what is really happening is this: For a finite field $ F $, the absolute Galois group $ text{Gal} (overline{F} / F) $ is isomorphic to $ widehat{mathbb{Z}} $, the profinite completion of $ mathbb{Z} $ given by the inverse limit $ varprojlim mathbb{Z} / n mathbb{Z} $. This is isomorphic to the direct product $ prod_l mathbb{Z}_l $ of the rings of $ l $-adic integers and $ mathbb{Z} $ embeds inside this product diagonally (corresponding to the infinite cyclic group generated by the Frobenius in $ text{Gal} (overline{F} / F) $). In the above example, Neukirch is really choosing an element $ (c_l) in prod_l mathbb{Z}_l $ given by $ c_l = 1 $ when $ l = p $ and $ c_l = 0 $ otherwise, and hence such an element is not in the diagonally embedded $ mathbb{Z} $.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
            $endgroup$
            – user623904
            Dec 8 '18 at 6:05












          • $begingroup$
            Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
            $endgroup$
            – user623904
            Dec 8 '18 at 6:06










          • $begingroup$
            That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
            $endgroup$
            – hellHound
            Dec 8 '18 at 11:28


















          3












          $begingroup$

          As far as the proof is concerned, you do not really need explicit expressions for $ x_n, y_n $.



          For $ m = m' p^{v_p(m)} $ and $ n = n'p^{v_p(n)} $, if $ m | n $, then we have $ m' | n' $ and $ v_p(m) le v_p(n) $. Now, $$ a_n - a_m = n'x_n - m'x_m $$ and also $$ a_n - a_m = n'x_n - m'x_m = (1-p^{v_p(n)}y_n) - (1-p^{v_p(m)}y_m) = p^{v_p(m)}y_m - p^{v_p(n)}y_n $$ The first equation shows that $ m' | a_n - a_m $ and the second shows that $ p^{v_p(m)} | a_n - a_m $. Together, we get $ m | a_n - a_m $.



          Now suppose that $ a $ is an integer such that $ a equiv a_l pmod l $ for all $ l ge 1 $. Note that by the definitions, for all $ k ge 1 $ we have $ a_{p^k} equiv 1 pmod {p^k} $ and whenever $ q $ is a prime not equal to $ p $, $ a_{q^k} equiv 0 pmod {q^k} $ . Then setting $ l = p^k $ for $ k ge 1 $, we get that $ a equiv 1 pmod {p^k} $ for all $ k ge 1 $ which implies $ a = 1 $. But this is impossible as otherwise we'd have as $ a_q equiv 1 pmod q $ for $ q neq p $.



          The above might sound uninsightful at first but what is really happening is this: For a finite field $ F $, the absolute Galois group $ text{Gal} (overline{F} / F) $ is isomorphic to $ widehat{mathbb{Z}} $, the profinite completion of $ mathbb{Z} $ given by the inverse limit $ varprojlim mathbb{Z} / n mathbb{Z} $. This is isomorphic to the direct product $ prod_l mathbb{Z}_l $ of the rings of $ l $-adic integers and $ mathbb{Z} $ embeds inside this product diagonally (corresponding to the infinite cyclic group generated by the Frobenius in $ text{Gal} (overline{F} / F) $). In the above example, Neukirch is really choosing an element $ (c_l) in prod_l mathbb{Z}_l $ given by $ c_l = 1 $ when $ l = p $ and $ c_l = 0 $ otherwise, and hence such an element is not in the diagonally embedded $ mathbb{Z} $.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
            $endgroup$
            – user623904
            Dec 8 '18 at 6:05












          • $begingroup$
            Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
            $endgroup$
            – user623904
            Dec 8 '18 at 6:06










          • $begingroup$
            That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
            $endgroup$
            – hellHound
            Dec 8 '18 at 11:28
















          3












          3








          3





          $begingroup$

          As far as the proof is concerned, you do not really need explicit expressions for $ x_n, y_n $.



          For $ m = m' p^{v_p(m)} $ and $ n = n'p^{v_p(n)} $, if $ m | n $, then we have $ m' | n' $ and $ v_p(m) le v_p(n) $. Now, $$ a_n - a_m = n'x_n - m'x_m $$ and also $$ a_n - a_m = n'x_n - m'x_m = (1-p^{v_p(n)}y_n) - (1-p^{v_p(m)}y_m) = p^{v_p(m)}y_m - p^{v_p(n)}y_n $$ The first equation shows that $ m' | a_n - a_m $ and the second shows that $ p^{v_p(m)} | a_n - a_m $. Together, we get $ m | a_n - a_m $.



          Now suppose that $ a $ is an integer such that $ a equiv a_l pmod l $ for all $ l ge 1 $. Note that by the definitions, for all $ k ge 1 $ we have $ a_{p^k} equiv 1 pmod {p^k} $ and whenever $ q $ is a prime not equal to $ p $, $ a_{q^k} equiv 0 pmod {q^k} $ . Then setting $ l = p^k $ for $ k ge 1 $, we get that $ a equiv 1 pmod {p^k} $ for all $ k ge 1 $ which implies $ a = 1 $. But this is impossible as otherwise we'd have as $ a_q equiv 1 pmod q $ for $ q neq p $.



          The above might sound uninsightful at first but what is really happening is this: For a finite field $ F $, the absolute Galois group $ text{Gal} (overline{F} / F) $ is isomorphic to $ widehat{mathbb{Z}} $, the profinite completion of $ mathbb{Z} $ given by the inverse limit $ varprojlim mathbb{Z} / n mathbb{Z} $. This is isomorphic to the direct product $ prod_l mathbb{Z}_l $ of the rings of $ l $-adic integers and $ mathbb{Z} $ embeds inside this product diagonally (corresponding to the infinite cyclic group generated by the Frobenius in $ text{Gal} (overline{F} / F) $). In the above example, Neukirch is really choosing an element $ (c_l) in prod_l mathbb{Z}_l $ given by $ c_l = 1 $ when $ l = p $ and $ c_l = 0 $ otherwise, and hence such an element is not in the diagonally embedded $ mathbb{Z} $.






          share|cite|improve this answer









          $endgroup$



          As far as the proof is concerned, you do not really need explicit expressions for $ x_n, y_n $.



          For $ m = m' p^{v_p(m)} $ and $ n = n'p^{v_p(n)} $, if $ m | n $, then we have $ m' | n' $ and $ v_p(m) le v_p(n) $. Now, $$ a_n - a_m = n'x_n - m'x_m $$ and also $$ a_n - a_m = n'x_n - m'x_m = (1-p^{v_p(n)}y_n) - (1-p^{v_p(m)}y_m) = p^{v_p(m)}y_m - p^{v_p(n)}y_n $$ The first equation shows that $ m' | a_n - a_m $ and the second shows that $ p^{v_p(m)} | a_n - a_m $. Together, we get $ m | a_n - a_m $.



          Now suppose that $ a $ is an integer such that $ a equiv a_l pmod l $ for all $ l ge 1 $. Note that by the definitions, for all $ k ge 1 $ we have $ a_{p^k} equiv 1 pmod {p^k} $ and whenever $ q $ is a prime not equal to $ p $, $ a_{q^k} equiv 0 pmod {q^k} $ . Then setting $ l = p^k $ for $ k ge 1 $, we get that $ a equiv 1 pmod {p^k} $ for all $ k ge 1 $ which implies $ a = 1 $. But this is impossible as otherwise we'd have as $ a_q equiv 1 pmod q $ for $ q neq p $.



          The above might sound uninsightful at first but what is really happening is this: For a finite field $ F $, the absolute Galois group $ text{Gal} (overline{F} / F) $ is isomorphic to $ widehat{mathbb{Z}} $, the profinite completion of $ mathbb{Z} $ given by the inverse limit $ varprojlim mathbb{Z} / n mathbb{Z} $. This is isomorphic to the direct product $ prod_l mathbb{Z}_l $ of the rings of $ l $-adic integers and $ mathbb{Z} $ embeds inside this product diagonally (corresponding to the infinite cyclic group generated by the Frobenius in $ text{Gal} (overline{F} / F) $). In the above example, Neukirch is really choosing an element $ (c_l) in prod_l mathbb{Z}_l $ given by $ c_l = 1 $ when $ l = p $ and $ c_l = 0 $ otherwise, and hence such an element is not in the diagonally embedded $ mathbb{Z} $.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 7 '18 at 22:58









          hellHoundhellHound

          49338




          49338












          • $begingroup$
            Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
            $endgroup$
            – user623904
            Dec 8 '18 at 6:05












          • $begingroup$
            Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
            $endgroup$
            – user623904
            Dec 8 '18 at 6:06










          • $begingroup$
            That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
            $endgroup$
            – hellHound
            Dec 8 '18 at 11:28




















          • $begingroup$
            Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
            $endgroup$
            – user623904
            Dec 8 '18 at 6:05












          • $begingroup$
            Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
            $endgroup$
            – user623904
            Dec 8 '18 at 6:06










          • $begingroup$
            That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
            $endgroup$
            – hellHound
            Dec 8 '18 at 11:28


















          $begingroup$
          Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
          $endgroup$
          – user623904
          Dec 8 '18 at 6:05






          $begingroup$
          Firstly I should really thank you for your answer for two questions above, by which I could recall important method learned in bachelor. Secondly, the second part is a beautiful insight which gives an answer for how does the element $(F^{a_{i}})$ of $hat{mathbb{Z}}$ constructed.
          $endgroup$
          – user623904
          Dec 8 '18 at 6:05














          $begingroup$
          Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
          $endgroup$
          – user623904
          Dec 8 '18 at 6:06




          $begingroup$
          Thirdly, I think Neukrich actually gave an answer to the following question where some people seems gave some nice talks : math.stackexchange.com/questions/256732/…
          $endgroup$
          – user623904
          Dec 8 '18 at 6:06












          $begingroup$
          That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
          $endgroup$
          – hellHound
          Dec 8 '18 at 11:28






          $begingroup$
          That's right, Neukirch constructed a sequence in $ widehat{mathbb{Z}} $ but not in $ mathbb{Z} $. Infact, $ mathbb{Z} $ is dense in $ widehat{mathbb{Z}} $, you can try to show this!
          $endgroup$
          – hellHound
          Dec 8 '18 at 11:28




















          draft saved

          draft discarded




















































          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.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029941%2fan-elementary-problem-of-proving-congruences-in-a-statement-about-absolute-galoi%23new-answer', 'question_page');
          }
          );

          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







          Popular posts from this blog

          Le Mesnil-Réaume

          Ida-Boy-Ed-Garten

          web3.py web3.isConnected() returns false always