Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

I Kronecker's Theorem - Anderson and Feil, Theorem 42.1

  1. Apr 26, 2017 #1
    I am reading Anderson and Feil - A First Course in Abstract Algebra.

    I am currently focused on Ch. 42: Field Extensions and Kronecker's Theorem ...

    I need some help with an aspect of the proof of Theorem 42.1 ( Kronecker's Theorem) ...

    Theorem 42.1 and its proof read as follows:


    ?temp_hash=ebcd473c18ae2169a57386bf8da7542e.png
    ?temp_hash=ebcd473c18ae2169a57386bf8da7542e.png


    In the above text by Anderson and Feil we read the following:

    " ... ... We show that there is an isomorphism from ##F## into ##F[x] / <p>## by considering the function ##\psi \ : \ F \longrightarrow F[x] / <p>## defined by ##\psi (a) = <p> + a##, where ##a \in F##. ... ... "


    Te authors show that ##\psi## is one-to-one or injective but do not show that ##\psi## is onto or surjective ...

    My question is ... how do we know that ##\psi## is surjective ...

    ... for example if a polynomial in ##F[x]##, say ##f##, is degree 5, and ##p## is degree 3 then dividing ##f## by ##p## gives a polynomial remainder ##r## of degree 2 ... then ##r + <p>## will not be of the form ##<p> + a## where ##a \in F## ... ... and so it seems that ##\psi## is not surjective ... since the coset of ##f## is not of the form ##<p> + a## where ##a \in F## ...

    ... ???


    Obviously my thinking is somehow mistaken ...


    ... can anyone help by demonstrating that ##\psi## is surjective ... and hence (given that Anderson and Feil have demonstrated it is injective) an isomorphism ...


    Help will be appreciated ...

    Peter
     
    Last edited: Apr 26, 2017
  2. jcsd
  3. Apr 26, 2017 #2

    andrewkirk

    User Avatar
    Science Advisor
    Homework Helper
    Gold Member

    ##\psi## is onto because an arbitrary element of ##F[x]\ /\ \langle p\rangle## has the form ##q+\langle p\rangle## for some polynomial ##q## in ##F[x]##. We note that, by definition, ##\psi(q)=q+\langle p\rangle## so that ##q+\langle p\rangle\in Im\ \psi##.

    I don't quite see why you are dividing ##f## by ##p##. Are you mixing up the quotient sign ##/## with a division sign? In your example ##r+\langle p\rangle## is of the form ##a+\langle p\rangle## because we can use ##r## as ##a## since ##r\in F[x]##. Similarly, ##f+\langle p\rangle## is of the form ##a+
    \langle p\rangle## by setting ##a=f##.
     
  4. Apr 26, 2017 #3

    Stephen Tashi

    User Avatar
    Science Advisor

    As I read the text, ##\psi## is a isomorphism from ##F## into ##E = F[x]/<p>##, not onto ##E##. We don't want ##F## to be isomorphic to all of ##E## because ##E## is supposed to be an extension field of ##F## that contains an element not in ##F##.
     
  5. Apr 26, 2017 #4

    fresh_42

    Staff: Mentor

    ##\psi## is not surjective. ##F \hookrightarrow F[x]/\langle p(x) \rangle## is a proper embedding for otherwise ##p(x)## would have to be linear.
    The notation "##\psi## maps ##F## isomorphic into ##F[x]/\langle p(x) \rangle##" is a bit sloppy for "##\psi## maps ##F## isomorphic onto its image in ##F[x]/\langle p(x) \rangle##", i.e. is a monomorphism, an injective homomorphism.
     
  6. Apr 26, 2017 #5

    Thanks Andrew ...


    You write ...

    " ... ... I don't quite see why you are dividing ##f## by ##p##. ..."

    Well ... we have that ##f, p \in F[x]## with ##f## being of degree 5 and ##p## of degree 3 ...

    Suppose after polynomial division we have ##f = qp + r## ... then I'm assuming that the coset of ##f## in ##F[x]## is ##r + <p>## .. ... and ##r## may well be a degree 2 polynomial (depending on the division) and hence not equal to any ##a \in F## (that is a zero degree polynomial in F[x] ...)

    Hope my meaning is now clear ... let me know what you think ...

    I am now thinking that ##\psi## is not an isomorphism ... see Stephen's post ... I read the theorem rather carelessly ... :frown:

    Peter
     
  7. Apr 26, 2017 #6

    Thanks to fresh_42 and to Stephen for clarifying the matter ... I appreciate your help ...

    Peter
     
  8. Apr 26, 2017 #7

    andrewkirk

    User Avatar
    Science Advisor
    Homework Helper
    Gold Member

    Sorry. I misread the text as saying that the domain of ##\psi## was ##F[x]## when in fact it said it was ##F##.

    I really must get my eyes checked.
     
  9. Apr 27, 2017 #8

    No problems Andrew ... you have helped me with many problems ...

    Peter
     
  10. Apr 27, 2017 #9

    fresh_42

    Staff: Mentor

    By the way, this is the reason I like the (old fashioned) words "monomorphism" for injective homomorphisms and "epimorphism" for surjective homomorphisms. It reserves the word "isomorphism" for bijective homomorphisms and keeps the road clear.
     
  11. Apr 27, 2017 #10

    andrewkirk

    User Avatar
    Science Advisor
    Homework Helper
    Gold Member

    I wouldn't call that old-fashioned. If it is, I missed the update memo. To me, the use you describe is simply 'correct' and the way the authors have used the word 'isomorphism' is simply incorrect. The correct term was homomorphism. To convey injectivity one can say 'injective homomorphism' or 'monomorphism' or say that it is 'one-to-one'. But to call it an isomorphism is wrong.
     
  12. Apr 27, 2017 #11

    fresh_42

    Staff: Mentor

    Yes. The entire information with this - in your eyes wrong - notation is condensed in the words "into" and "onto". I think as well, that it is confusing if paired with otherwise reserved names. I called it sloppy, but that's a semantic discussion. But I find "one-to-one" not less confusing for injectivity, as it might be understood to hit all elements, as in the definition of sets with equal cardinality, a one-to-one correspondence so to say, which it is not if used for injectivity.

    Another helpful way to express the situation is by the usage of certain arrows:
    • ##\hookrightarrow## : canonical embedding (injective homomorphism)
    • ##\rightarrowtail## : monomorphism (injective homomorphism)
    • ##\twoheadrightarrow## : epimorphism (surjective homomorphism)
    • ##\cong## or an overlay, resp. a combination of the two previous ones for which I haven't found a LaTex command (like \twoheadrightarrowtail): isomorphism (bijective homomorphism)
    • ##\leftrightarrow## or ##\stackrel{1:1}{\leftrightarrow}## : bijective mapping (not necessarily a homomorphism)
    One advantage of this is, that a short exact sequence ##0 \rightarrow A \rightarrow B \rightarrow C \rightarrow 0## can be written really short as ##A \rightarrowtail B \twoheadrightarrow C##.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Kronecker's Theorem - Anderson and Feil, Theorem 42.1
  1. Is this a theorem? (Replies: 10)

  2. Wilson's Theorem (Replies: 1)

  3. Is this a theorem? (Replies: 8)

Loading...