Kronecker's Theorem - Anderson and Feil, Theorem 42.1

  • Context: Undergrad 
  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary

Discussion Overview

The discussion revolves around Kronecker's Theorem as presented in Anderson and Feil's "A First Course in Abstract Algebra," specifically focusing on the proof of Theorem 42.1. Participants are examining the properties of the function ##\psi## defined from a field ##F## into the quotient ring ##F[x]/

##, particularly its injectivity and surjectivity.

Discussion Character

  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant questions the surjectivity of ##\psi##, suggesting that a polynomial remainder from division may not correspond to an element of the form ##

    + a## where ##a \in F##.

  • Another participant argues that any element of ##F[x]/

    ## can be expressed as ##q +

    ##, thus supporting the surjectivity of ##\psi##.

  • Some participants clarify that ##\psi## is an embedding rather than a surjective map, indicating that it is a proper inclusion of ##F## into ##F[x]/

    ##.

  • There is a discussion about the terminology used for injective and surjective homomorphisms, with some participants expressing confusion over the use of "isomorphism" in the context of ##\psi##.
  • One participant acknowledges a misunderstanding regarding the domain of ##\psi##, realizing it is ##F## rather than ##F[x]##.

Areas of Agreement / Disagreement

Participants express differing views on the surjectivity of ##\psi##, with some asserting it is surjective and others maintaining it is not. The discussion on terminology also reveals a lack of consensus on the appropriate definitions and usage of terms like "isomorphism," "monomorphism," and "epimorphism."

Contextual Notes

Participants highlight potential ambiguities in the definitions and notations used in the text, particularly regarding the distinction between injective and surjective mappings.

Who May Find This Useful

This discussion may be useful for students and educators in abstract algebra, particularly those studying field extensions and the properties of homomorphisms.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
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
 

Attachments

  • Anderson and Feil - 1 - Theorem 42.1 ... PART 1  ... ....png
    Anderson and Feil - 1 - Theorem 42.1 ... PART 1 ... ....png
    50.5 KB · Views: 804
  • Anderson and Feil - 2 - Theorem 42.1 ... PART 2  ... ....png
    Anderson and Feil - 2 - Theorem 42.1 ... PART 2 ... ....png
    43.3 KB · Views: 872
Last edited:
Physics news on Phys.org
##\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##.
 
  • Like
Likes   Reactions: Math Amateur
Math Amateur said:
... can anyone help by demonstrating that ##\psi## is surjective ... and hence (given that Anderson and Feil have demonstrated it is injective) an isomorphism ...

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##.
 
  • Like
Likes   Reactions: WWGD, Math Amateur and fresh_42
##\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.
 
  • Like
Likes   Reactions: Math Amateur
andrewkirk said:
##\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##.
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
 
fresh_42 said:
##\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.
Thanks to fresh_42 and to Stephen for clarifying the matter ... I appreciate your help ...

Peter
 
Math Amateur said:
Hope my meaning is now clear ... let me know what you think ...
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.
 
  • Like
Likes   Reactions: Math Amateur
andrewkirk said:
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.
No problems Andrew ... you have helped me with many problems ...

Peter
 
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.
 
  • Like
Likes   Reactions: Math Amateur
  • #10
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.
 
  • Like
Likes   Reactions: Math Amateur
  • #11
andrewkirk said:
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.
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##.
 
  • Like
Likes   Reactions: Math Amateur

Similar threads

Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
8
Views
2K