Loading [MathJax]/jax/output/HTML-CSS/jax.js

Saturday, November 9, 2013

Reductions in Finite Fields (14.3.6-7,11)

Dummit and Foote Abstract Algebra, section 14.3, exercises 6-7, 11:

MathJax TeX Test Page 6. Suppose K=Q(θ)=Q(D1,D2) with D1,D2Z and that θ=a+bD1+cD2+dD1D2 for integers a, b, c, d. Prove mθ(x) is reducible modulo every prime p. In particular show the polynomial x410x2+1 is irreducible over Z[x] but reducible modulo every prime.
7. Prove that one of 2, 3, or 6 is a square in Fp. Concludex611x4+36x236=(x22)(x23)(x26)has a root modulo p for every prime p but has no root in Z.
11. Prove that xpnx+1 is irreducible over Fp only when n=1 or n=p=2.

Proof: (6) Lemma 1: Let f(x),gi(x)Z[x] be irreducible with finite indexing set I. If θQ(α1,...) for some roots gi(αi)=0 and the coefficients of θ are given in integers, then if Φ is reduction modulo p and βi is a root of Φ(gi(x)) we have θ (the corresponding integers having been reduced mod p, and αi replaced with βi) is a root of Φ(f). Proof: Φ is an additive homomorphism Z(αi)Fp(βi) by its construction on a basis, and further it is multiplicative between two basis elements Φ(αi)Φ(αj)=Φ(αiαj). Thus it is a ring homomorphism and we see Φ(f)(θ)=Φ(f(θ))=Φ(0)=0. 

Now, since a biquadratic extension of Fp would entail only the four automorphisms negating D1 and D2, none of which having order 4 and thus none representing Frobenius σp, we must have Fp(D1,D2) is contained in Fp2 and now mθ(x) of degree 4 cannot be irreducible mod p. With some work we find ±2±3 are the solutions to the irreducible x410x2+1 and generate Q(2,3). Hence m2+3(x)=x410x2+1 generates only a second degree extension of Fp and is not irreducible.

(7) Lemma 2: One of a,b,abFpn is a square in Fpn. Proof: Since _2 is a multiplicative endomorphism of F×pn and for each square α2 we have only two possible elements in the fiber by x2α2=(xα)(x+α), we must have [F×pn : img _2]2. Now if a, b are not squares then a,b1 in F×pn/img _2. Hence ab=1, i.e. ab is a square. 

Thus we have proved either 2, 3, or 6 is a square in Fp and thus the polynomial above has a root in Fp.

(11) We note that if α is a root, then so is α+a for any aFpn. Thus FpnFp(α) as else the latter would contain all the roots of xpnx+1 and then a nontrivial extension would yet more roots, a contradiction. Now we observe any automorphism of Gal(Fp(α)/Fpn) must be defined by αα+a for some aFpn and since these automorphisms fix Fpn they all have order p. Since a Galois group of degree k is always cyclic over Fp with generator σp and hence always cyclic over Fpn, so [Fp(α) : Fpn]=p.

Thus we must have pn=pn. We write n=pk for some k0. If k>1 then we notice k+1=pk and since p2 implies k+1<2kpk when k=2 and inductively (k+1)+1<2k+12k+(2k+12k)=2k+1pk+1 we must have k=0 (and n=1) or k=1 (in which case n=p and p2=pn and n=p=2). We have previously verified xpx+1 is irreducible (γ implies γ+1 a root, thus all roots are in the same extension, thus there is the same degree d among k irreducibles implying kd=p and d=1, but there are no roots in Fp) and one may check x4x+1F2[x] has no roots and is not the square of the only irreducible quadratic (x2+x+1)2=x4+x2+1. 

No comments:

Post a Comment