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

Friday, March 29, 2013

Heisenberg Group Over Prime Fields (5.5.25)

MathJax TeX Test Page Dummit and Foote Abstract Algebra, section 5.5, exercise 25:

Prove that H(F2)D8 and for p an odd prime prove that H(Fp) is of exponent p and isomorphic to the first nonabelian group presented in example 7: x,a,b | xp=ap=bp=1, ab=ba, xa=abx, xb=bx

Proof: One can easily check that the groups generated by (110011001) and (100011001) are of orders 4 and 2 and have trivial intersection and thus generate H(F2) of order 8, and indeed the generators fulfill the qualities of r and s in the presentation of H(F2).

We can see (111010001) and (101011001) don't commute in any Heisenberg group over a prime field, so that by previous investigations of groups of order p3 the center of H(Fp) is of order p. Now, Z=(101010001) is of order p and is clearly within (and thus completely comprises) the center. Prove using induction that (111010001)n=(1nn010001) and that (101011001)n=(10n01n001) for all nZ+, and let A=(111010001) and B=(101011001) be subgroups of order p. Due to the normality of Z we can tell AZ is a group, and due to its index it is normal in H(Fp). Now, BAZ=1 and BAZ=H(Fp) so that H(Fp)=AZφB for some homomorphism φ:BAut(AZ). Since Z=Z(H(Fp)), we know that the exponent of AZ is p, so that AZZp×Zp and thus |Aut(AZ)|=p(p1)2(p+1), and in particular the Sylow p-subgroups of Aut(AZ) are of order p and already established to be conjugate, so that by exercise 6 there is only one unique nonabelian construction of AZφB, which must be H(Fp). Mapping the generator of B to the element of GL2(Fp)Aut(AZ) described in the example, we obtain the presentation mentioned (with the generator of B in place of x, and the generator of Z in place of b, and the generator of A in place of a).

As for the exponent, under their notation we can see bZ(G), leading to (xn1an2bn3)p=(xn1an2)p. Migrating the a terms to the left of the block using the quality xa=abx and then migrating the b terms similarly since b is in the center, we obtain (xn1an2)p=apn2bmxpn1, where m is determined by the process. Note that we migrate the first an2 term through 1 block of xn2's to obtain n1n2 resultant b's, and we migrate the second an2 term through 2 blocks of xn2's to obtain 2n1n2 resultant b's, and so forth. Counting up all of these, we obtain n1n2+2n1n2+...+pn1n2=n1n2(1+2+...+p)=n1n2p(p+1)2 resultant b's after the whole process, which is divisible by p - the order of b - when p is an odd prime.

No comments:

Post a Comment