Is $x^4 + 2x^2 - x + 1$ irreducible in $mathbb Z_7[x]$?












2












$begingroup$


How would one do this?
I know since it doesn't have roots it can only be divisible by irreducible polynomials of degree 2.
How would I prove that it is or it isn't?
There are a lot of polynomials with this conditions.






polynomials finite-fields irreducible-polynomials







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
    $endgroup$
    – lulu
    Jan 2 at 22:12
















2












$begingroup$


How would one do this?
I know since it doesn't have roots it can only be divisible by irreducible polynomials of degree 2.
How would I prove that it is or it isn't?
There are a lot of polynomials with this conditions.






polynomials finite-fields irreducible-polynomials







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
    $endgroup$
    – lulu
    Jan 2 at 22:12














2












2








2





$begingroup$


How would one do this?
I know since it doesn't have roots it can only be divisible by irreducible polynomials of degree 2.
How would I prove that it is or it isn't?
There are a lot of polynomials with this conditions.






polynomials finite-fields irreducible-polynomials







share|cite|improve this question











$endgroup$




How would one do this?
I know since it doesn't have roots it can only be divisible by irreducible polynomials of degree 2.
How would I prove that it is or it isn't?
There are a lot of polynomials with this conditions.






polynomials finite-fields irreducible-polynomials




polynomials finite-fields irreducible-polynomials






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 2 at 22:18









A. Pongrácz

5,9631929




5,9631929










asked Jan 2 at 22:10









J. DionisioJ. Dionisio

9111




9111








  • 3




    $begingroup$
    Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
    $endgroup$
    – lulu
    Jan 2 at 22:12














  • 3




    $begingroup$
    Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
    $endgroup$
    – lulu
    Jan 2 at 22:12








3




3




$begingroup$
Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
$endgroup$
– lulu
Jan 2 at 22:12




$begingroup$
Just try to solve for the coefficients. if it factored, we'd have $p(x)=(x^2+ax+b)times (x^2+cx+d)$
$endgroup$
– lulu
Jan 2 at 22:12










2 Answers
2






active

oldest

votes


















5












$begingroup$

The product of all the monic, irreducible polynomials over $mathbb{F}_7$ wih degree $leq 2$ is given by $x^{49}-x$, so if we prove that $f(x)=(x^2+1)^2-x$ and $x^{48}-1$ are coprime over $mathbb{F}_7[x]$ we are done. Let us compute $x^{48}-1pmod{f(x)}$, for instance through the Brauer chain $x^4to x^8to x^{16}to x^{32}to x^{48}$.
$$ x^4 equiv -2x^2+x-1pmod{f(x)} $$
$$ x^8 equiv 3x^3-3x^2+2x-3pmod{f(x)} $$
$$ x^{16} equiv x^3+3x^2+2x-1pmod{f(x)} $$
$$ x^{32} equiv -x^3+2x^2+x-3pmod{f(x)} $$
$$ x^{48}-1 equiv -x^3-2x^2+x+2 pmod{f(x)}$$
give
$$gcd(x^{48}-1,x^4+2x^2-x+1)=gcd(x^3+2x^2-x-2,x^4+2x^2-x+1) $$
$$ = gcd(x^3+2x^2-x-2,-x-3) $$
but $x=4$ is not a root of $x^3+2x^2-x-2$ since $7nmid 90$ and we have finished.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
    $endgroup$
    – Bill Dubuque
    Jan 2 at 23:13












  • $begingroup$
    That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
    $endgroup$
    – Jyrki Lahtonen
    Jan 2 at 23:19





















3












$begingroup$

You can also try to factor it as a product of two polynomials of degree $2$. Such a factorization must have the form



begin{align}x^4 + 2x^2 - x + 1 & = (x^2+ax+b)(x^2-ax+b^{-1})\
& =x^4+(b+b^{-1}-a^2)x^2+(ab^{-1}-ab)x+1end{align}
Hence the relations
$$b+b^{-1}-a^2=2, ab^{-1}-ab=-1,$$
which can be easily seen to have no solution in $mathbb{Z}_7$.






share|cite|improve this answer









$endgroup$













    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%2f3060034%2fis-x4-2x2-x-1-irreducible-in-mathbb-z-7x%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









    5












    $begingroup$

    The product of all the monic, irreducible polynomials over $mathbb{F}_7$ wih degree $leq 2$ is given by $x^{49}-x$, so if we prove that $f(x)=(x^2+1)^2-x$ and $x^{48}-1$ are coprime over $mathbb{F}_7[x]$ we are done. Let us compute $x^{48}-1pmod{f(x)}$, for instance through the Brauer chain $x^4to x^8to x^{16}to x^{32}to x^{48}$.
    $$ x^4 equiv -2x^2+x-1pmod{f(x)} $$
    $$ x^8 equiv 3x^3-3x^2+2x-3pmod{f(x)} $$
    $$ x^{16} equiv x^3+3x^2+2x-1pmod{f(x)} $$
    $$ x^{32} equiv -x^3+2x^2+x-3pmod{f(x)} $$
    $$ x^{48}-1 equiv -x^3-2x^2+x+2 pmod{f(x)}$$
    give
    $$gcd(x^{48}-1,x^4+2x^2-x+1)=gcd(x^3+2x^2-x-2,x^4+2x^2-x+1) $$
    $$ = gcd(x^3+2x^2-x-2,-x-3) $$
    but $x=4$ is not a root of $x^3+2x^2-x-2$ since $7nmid 90$ and we have finished.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
      $endgroup$
      – Bill Dubuque
      Jan 2 at 23:13












    • $begingroup$
      That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
      $endgroup$
      – Jyrki Lahtonen
      Jan 2 at 23:19


















    5












    $begingroup$

    The product of all the monic, irreducible polynomials over $mathbb{F}_7$ wih degree $leq 2$ is given by $x^{49}-x$, so if we prove that $f(x)=(x^2+1)^2-x$ and $x^{48}-1$ are coprime over $mathbb{F}_7[x]$ we are done. Let us compute $x^{48}-1pmod{f(x)}$, for instance through the Brauer chain $x^4to x^8to x^{16}to x^{32}to x^{48}$.
    $$ x^4 equiv -2x^2+x-1pmod{f(x)} $$
    $$ x^8 equiv 3x^3-3x^2+2x-3pmod{f(x)} $$
    $$ x^{16} equiv x^3+3x^2+2x-1pmod{f(x)} $$
    $$ x^{32} equiv -x^3+2x^2+x-3pmod{f(x)} $$
    $$ x^{48}-1 equiv -x^3-2x^2+x+2 pmod{f(x)}$$
    give
    $$gcd(x^{48}-1,x^4+2x^2-x+1)=gcd(x^3+2x^2-x-2,x^4+2x^2-x+1) $$
    $$ = gcd(x^3+2x^2-x-2,-x-3) $$
    but $x=4$ is not a root of $x^3+2x^2-x-2$ since $7nmid 90$ and we have finished.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
      $endgroup$
      – Bill Dubuque
      Jan 2 at 23:13












    • $begingroup$
      That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
      $endgroup$
      – Jyrki Lahtonen
      Jan 2 at 23:19
















    5












    5








    5





    $begingroup$

    The product of all the monic, irreducible polynomials over $mathbb{F}_7$ wih degree $leq 2$ is given by $x^{49}-x$, so if we prove that $f(x)=(x^2+1)^2-x$ and $x^{48}-1$ are coprime over $mathbb{F}_7[x]$ we are done. Let us compute $x^{48}-1pmod{f(x)}$, for instance through the Brauer chain $x^4to x^8to x^{16}to x^{32}to x^{48}$.
    $$ x^4 equiv -2x^2+x-1pmod{f(x)} $$
    $$ x^8 equiv 3x^3-3x^2+2x-3pmod{f(x)} $$
    $$ x^{16} equiv x^3+3x^2+2x-1pmod{f(x)} $$
    $$ x^{32} equiv -x^3+2x^2+x-3pmod{f(x)} $$
    $$ x^{48}-1 equiv -x^3-2x^2+x+2 pmod{f(x)}$$
    give
    $$gcd(x^{48}-1,x^4+2x^2-x+1)=gcd(x^3+2x^2-x-2,x^4+2x^2-x+1) $$
    $$ = gcd(x^3+2x^2-x-2,-x-3) $$
    but $x=4$ is not a root of $x^3+2x^2-x-2$ since $7nmid 90$ and we have finished.






    share|cite|improve this answer









    $endgroup$



    The product of all the monic, irreducible polynomials over $mathbb{F}_7$ wih degree $leq 2$ is given by $x^{49}-x$, so if we prove that $f(x)=(x^2+1)^2-x$ and $x^{48}-1$ are coprime over $mathbb{F}_7[x]$ we are done. Let us compute $x^{48}-1pmod{f(x)}$, for instance through the Brauer chain $x^4to x^8to x^{16}to x^{32}to x^{48}$.
    $$ x^4 equiv -2x^2+x-1pmod{f(x)} $$
    $$ x^8 equiv 3x^3-3x^2+2x-3pmod{f(x)} $$
    $$ x^{16} equiv x^3+3x^2+2x-1pmod{f(x)} $$
    $$ x^{32} equiv -x^3+2x^2+x-3pmod{f(x)} $$
    $$ x^{48}-1 equiv -x^3-2x^2+x+2 pmod{f(x)}$$
    give
    $$gcd(x^{48}-1,x^4+2x^2-x+1)=gcd(x^3+2x^2-x-2,x^4+2x^2-x+1) $$
    $$ = gcd(x^3+2x^2-x-2,-x-3) $$
    but $x=4$ is not a root of $x^3+2x^2-x-2$ since $7nmid 90$ and we have finished.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Jan 2 at 22:39









    Jack D'AurizioJack D'Aurizio

    1




    1












    • $begingroup$
      See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
      $endgroup$
      – Bill Dubuque
      Jan 2 at 23:13












    • $begingroup$
      That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
      $endgroup$
      – Jyrki Lahtonen
      Jan 2 at 23:19




















    • $begingroup$
      See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
      $endgroup$
      – Bill Dubuque
      Jan 2 at 23:13












    • $begingroup$
      That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
      $endgroup$
      – Jyrki Lahtonen
      Jan 2 at 23:19


















    $begingroup$
    See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
    $endgroup$
    – Bill Dubuque
    Jan 2 at 23:13






    $begingroup$
    See this answer for a generalization - an efficient algorithm often used in practice (a polynomial analog of the Pocklington-Lehmer integer primality test)
    $endgroup$
    – Bill Dubuque
    Jan 2 at 23:13














    $begingroup$
    That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
    $endgroup$
    – Jyrki Lahtonen
    Jan 2 at 23:19






    $begingroup$
    That's it. I spent awhile looking for a trick answer, but didn't see any. An alternative way of organizing the calculation would be to first build a list of remainders of $x^0,x^7equiv-1+3x+3x^2+3x^3,x^{14}$ and $x^{21}$ modulo $f(x)$. Raising to seventh power modulo $f(x)$ is linear, so $$x^{49}equiv-1+3x^7+3x^{14}+3x^{21}pmod{f(x)}$$ et cetera. This may help with a higher degree polynomial. I'm afraid I don't have a good feel for the difference in complexity for I usually do this in characteristic two only :-)
    $endgroup$
    – Jyrki Lahtonen
    Jan 2 at 23:19













    3












    $begingroup$

    You can also try to factor it as a product of two polynomials of degree $2$. Such a factorization must have the form



    begin{align}x^4 + 2x^2 - x + 1 & = (x^2+ax+b)(x^2-ax+b^{-1})\
    & =x^4+(b+b^{-1}-a^2)x^2+(ab^{-1}-ab)x+1end{align}
    Hence the relations
    $$b+b^{-1}-a^2=2, ab^{-1}-ab=-1,$$
    which can be easily seen to have no solution in $mathbb{Z}_7$.






    share|cite|improve this answer









    $endgroup$


















      3












      $begingroup$

      You can also try to factor it as a product of two polynomials of degree $2$. Such a factorization must have the form



      begin{align}x^4 + 2x^2 - x + 1 & = (x^2+ax+b)(x^2-ax+b^{-1})\
      & =x^4+(b+b^{-1}-a^2)x^2+(ab^{-1}-ab)x+1end{align}
      Hence the relations
      $$b+b^{-1}-a^2=2, ab^{-1}-ab=-1,$$
      which can be easily seen to have no solution in $mathbb{Z}_7$.






      share|cite|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        You can also try to factor it as a product of two polynomials of degree $2$. Such a factorization must have the form



        begin{align}x^4 + 2x^2 - x + 1 & = (x^2+ax+b)(x^2-ax+b^{-1})\
        & =x^4+(b+b^{-1}-a^2)x^2+(ab^{-1}-ab)x+1end{align}
        Hence the relations
        $$b+b^{-1}-a^2=2, ab^{-1}-ab=-1,$$
        which can be easily seen to have no solution in $mathbb{Z}_7$.






        share|cite|improve this answer









        $endgroup$



        You can also try to factor it as a product of two polynomials of degree $2$. Such a factorization must have the form



        begin{align}x^4 + 2x^2 - x + 1 & = (x^2+ax+b)(x^2-ax+b^{-1})\
        & =x^4+(b+b^{-1}-a^2)x^2+(ab^{-1}-ab)x+1end{align}
        Hence the relations
        $$b+b^{-1}-a^2=2, ab^{-1}-ab=-1,$$
        which can be easily seen to have no solution in $mathbb{Z}_7$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 2 at 22:57









        moutheticsmouthetics

        50137




        50137






























            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%2f3060034%2fis-x4-2x2-x-1-irreducible-in-mathbb-z-7x%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

            Human spaceflight

            Image
            Human spaceflight From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Space traveler" redirects here. For other uses, see Space traveler (disambiguation). @media all and (max-width:720px){.mw-parser-output .tmulti>.thumbinner{width:100%!important;max-width:none!important}.mw-parser-output .tmulti .tsingle{float:none!important;max-width:none!important;width:100%!important;text-align:center}} Apollo 11 crewmember Buzz Aldrin on the Moon, 1969 International Space Station crewmember Tracy Caldwell Dyson views the Earth, 2010 Space Shuttle Discovery heads into space with a crew aboard, STS-121 in 2006 Inside a space suit on the Canadarm, 1993 Human spaceflight (also referred to as crewed spaceflight or manned spaceflight ) is space travel with a crew or passengers aboard the spacecraft. Spacecraft carrying people may be operated directly, by human crew, or it may be e...
            Read more

            Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

            Image
            0 1 What exactly does the error message beginning with E: mean? I assume it has to do with the file structure on Ubuntu-on-Windows, but what exactly? The following package was automatically installed and is no longer required: os-prober Use 'apt-get autoremove' to remove it. The following extra packages will be installed: libxslt1.1 The following NEW packages will be installed: libxslt1.1 xmlstarlet 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 435 kB of archives. After this operation, 1023 kB of additional disk space will be used. Get:1 http://archive.ubuntu.com/ubuntu/ trusty/main libxslt1.1 amd64 1.1.28-2build1 [145 kB] Get:2 http://archive.ubuntu.com/ubuntu/ trusty/universe xmlstarlet amd64 1.5.0-1 [290 kB] ...
            Read more

            張江高科駅

            Image
            張江高科駅 ちょうこうこうか Zhangjiang Hi-Tech Park 所在地 中国上海市浦東新区 所属事業者 上海地鉄運営有限公司（上海軌道交通・駅詳細） 上海浦東現代有軌交通有限公司（駅詳細） テンプレートを表示 張江高科駅 各種表記 繁体字： 張江高科站 簡体字： 张江高科站 拼音 ： Zhàngjiāng Gāokē Zhàn 発音： ヂャンジャン ガオクー ヂャン 英文： Zhangjiang Hi-Tech Park Station テンプレートを表示 張江高科駅 （ちょうこうこうか-えき）は中華人民共和国上海市浦東新区に位置する、上海軌道交通2号線の駅である。 なお、張江高科駅前にある張江軌道電車の 張江地鉄駅駅 についてもここで述べる。 目次 1 利用可能な鉄道路線 2 沿革 3 駅構造 3.1 上海軌道交通 3.2 張江軌道電車 4 駅周辺 5 隣の駅 6 注釈 7 関連項目 利用可能な鉄道路線 上海軌道交通 ■ 2号線 上海浦東現代有軌交通有限公司 ■ 張江軌道電車 沿革 高架駅時代の姿 2000年12月27日 - 2号線の駅が高架駅として開業。 2010年 1月1日 - 張江軌道電車の開業に伴い、張江地鉄駅駅（停留所）を設置。 2月13日 - 駅地下化に伴い高架駅の運用停止。 2月24日 - 10日間の閉鎖を経て地下新駅の開業。 2017年2月9日 - リニューアル工事を経て再開業。乗降客の増加に対応し、ホームへのエレベーター、エスカレーターを増設、券売機エリアを拡張した [1] 。 駅構造 上海軌道交通 上海軌道交通 張江高科駅 5号口 ちょうこうこうか Zhangjiang Hi-Tech Park ◄ 竜陽路 (2.60km) (1.61km) 金科路 ► 所在地 中国上海市浦東新区松涛路 祖冲之路 （中国語版） 北緯31度12分11秒 東経121度34分50秒  /  北緯31.2...
            Read more