S.O.S. Mathematics CyberBoard Forum Index S.O.S. Mathematics CyberBoard
 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister   ProfileProfile   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Question about perfect fields

 
Post new topic   Reply to topic    S.O.S. Mathematics CyberBoard Forum Index -> Other Topics in Advanced Mathematics
View previous topic :: View next topic  
Author Message
caki
Senior Member


Joined: 29 Oct 2004
Posts: 73

PostPosted: Tue, 17 Oct 2006 18:46:10 UTC    Post subject: Question about perfect fields Reply with quote

Good afternoon,

How would I approach the following problem?

"Show that a field F of characteristic p (p a prime number) is perfect if and only if for every we can find a such that .

In Herstein's "Topics in Algebra", I am given the following definitions:

Separable element: An element a in an extension K of F is called separable over F if it satisfies a polynomial over F having no multiple roots.

Separable extension: An extension K of F is called separable over F if all its elements are separable over F.

Perfect field: A field F is called perfect if all finite extensions of F are separable.

Thanks very much,
caki
Back to top
View user's profile Send private message
caki
Senior Member


Joined: 29 Oct 2004
Posts: 73

PostPosted: Tue, 17 Oct 2006 20:59:37 UTC    Post subject: Update Reply with quote

Little update on my progress here.

Suppose that for every a in F there exists a b also in F such that but that F is not perfect. Thus, some finite extension K of F is not separable, or some element in K satisfies a polynomial over F having multiple roots. Hence, a satisfies some irreducible polynomial say f(x) over F having multiple roots in some splitting field. Now, there is a theorem in Herstein that says: If f(x) in F[x] is irreducible with char F = p>0 and f(x) has multiple roots then f(x) = g(x^p) where coeffs of g(x) are also in F.

Say . By our original hypothesis

I want to prove that which would contradict the fact that f(x) = g(x^p) is irreducible over F.

Well, I tried multiplying some test polynomials and it DOES work except it is extremely ugly. (remember char F = p is what helps me)

So, how would I solve that more elegantly?

Thanks,
caki
Back to top
View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    S.O.S. Mathematics CyberBoard Forum Index -> Other Topics in Advanced Mathematics All times are UTC
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum


Contact Us | S.O.S. Mathematics Homepage
Privacy Statement | Search the "old" CyberBoard

users online during the last hour
Powered by phpBB © 2001, 2005-2010 phpBB Group.
Installation and all modifications: H. Knaust
Copyright © 1999-2010 MathMedics, LLC. All rights reserved.
Math Medics, LLC. - P.O. Box 12395 - El Paso TX 79913 - USA