请输入您要查询的字词:

 

单词 ProofOfCharacterizationOfPerfectFields
释义

proof of characterization of perfect fields


Proposition 1

The following are equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath:

  1. (a)

    Every algebraic extensionMathworldPlanetmath of K is separablePlanetmathPlanetmathPlanetmath.

  2. (b)

    Either charK=0 or charK=p and the Frobenius mapPlanetmathPlanetmath is surjectivePlanetmathPlanetmath.

Proof.Suppose (a) and not (b). Then we must have charK=p>0, and there must be aKwith no p-th root in K. Let L be a splitting fieldMathworldPlanetmath over K for the polynomialPlanetmathPlanetmath Xp-a,and let αL be a root of this polynomial.Then (X-α)p=Xp-αp=Xp-a, which has coefficients in K.This means that the minimum polynomial for α over K must be a divisor of(X-α)p and so must have repeated roots. This is not possible since L is separableover K.

Conversely, suppose (b) and not (a).Let α be an element which is algebraic over K but not separable.Then its minimum polynomial f must have a repeated root, and by replacing α by thisroot if necessary, we may assume that α is a repeated root of f.Now, f has coefficients in K and also has α as a root. Since it is of lowerdegree than f, this is not possible unless f=0,whence charK=p>0 and f has the form:

f=xpn+an-1xp(n-1)++a1xp+a0.

with ao0.By (b), we may choose elements biK, for 0in-1 such that bip=ai.Then we may write f as:

f=(xn+bn-1xn-1++b1x+b0)p.

Since f(α)=0 and since the Frobenius map xxp is injectivePlanetmathPlanetmath, we see that

αn+bn-1αn-1++b1α+b0=0

But then α is a root of the polynomial

xn+bn-1xn-1++b1x+b0

which has coefficients in K, is non-zero (since bo0), and has lower degree than f.This contradicts the choice of f as the minimum polynomial of α.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 17:08:19