09.05.2013 Views

On the Derived Length of Lie Solvable Group Algebras

On the Derived Length of Lie Solvable Group Algebras

On the Derived Length of Lie Solvable Group Algebras

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.3 SUMMARIZED RESULT 37<br />

Indeed, according to <strong>the</strong> part (iii) <strong>of</strong> <strong>the</strong> <strong>the</strong>orem, if l = dl L (F G)<br />

<strong>the</strong>n s (1)<br />

l−2 < pn . From (3.8) it follows that (2l −1)/3 < pn . Hence<br />

l < log2(3pn /2 + 1/2) + 1, and <strong>the</strong>refore l ≤ ⌈log2(3pn /2 + 1/2)⌉.<br />

Since ⌈log2(3pn /2+1/2)⌉ = ⌈log2(3pn /2)⌉, <strong>the</strong> pro<strong>of</strong> is complete.<br />

(ii) Since <strong>the</strong> order <strong>of</strong> G/C divides <strong>the</strong> order <strong>of</strong> U(Zpn), which is<br />

equal to pn−1 (p−1), for primes p <strong>of</strong> <strong>the</strong> form 4k−1 <strong>the</strong> conditions<br />

ei<strong>the</strong>r (ii) <strong>of</strong> <strong>the</strong> <strong>the</strong>orem or (i) <strong>of</strong> this remark is satisfied, so we<br />

can easily have <strong>the</strong> derived length and <strong>the</strong> strong <strong>Lie</strong> derived<br />

length <strong>of</strong> F G.<br />

(iii) Recall that p is called Fermat prime, if p has <strong>the</strong> form 22s + 1 for<br />

some s ≥ 0. Let G be a non-nilpotent group with commutator<br />

subgroup <strong>of</strong> order p > 3, where p is a Fermat prime, and let<br />

char(F ) = p. Then<br />

dlL(F G) = dl L <br />

⌈log<br />

(F G) =<br />

2(2p)⌉ if G/C has order p − 1;<br />

⌈log2(3p/2)⌉ o<strong>the</strong>rwise.<br />

Indeed, let us write p in <strong>the</strong> form 2r + 1 (r > 1). If G/C has<br />

order p − 1 <strong>the</strong>n <strong>the</strong> statement follows directly from Lemma<br />

3.2.6. In <strong>the</strong> o<strong>the</strong>r case G/C has order 2m for some 0 < m < r.<br />

Since ⌈log2(3p/2)⌉ = r + 1, by part (ii) <strong>of</strong> <strong>the</strong> <strong>the</strong>orem it is<br />

enough to show that s (m)<br />

r ≥ p. Indeed, from <strong>the</strong> definition it<br />

follows that s (r−1)<br />

r−1 = 2r−1 . Fur<strong>the</strong>rmore, for m = r − 1 we have<br />

s (m)<br />

r = s (r−1)<br />

r = 2s (r−1)<br />

r−1 + 1 = 2r + 1 = p, and if m < r − 1 <strong>the</strong>n<br />

s (m)<br />

r−1 > s (r−1)<br />

r−1 , which implies s (m)<br />

r ≥ 2s (m)<br />

r−1 > 2s (r−1)<br />

r−1 = 2r = p − 1.<br />

The pro<strong>of</strong> is complete.<br />

Finally, we note that some parts <strong>of</strong> <strong>the</strong> <strong>the</strong>orem can also be proved<br />

using <strong>the</strong> Theorems A and B <strong>of</strong> [29]. Obviously, <strong>the</strong>se <strong>the</strong>orems <strong>of</strong><br />

A. Shalev are not enough to determine <strong>the</strong> derived length under conditions<br />

<strong>of</strong> our <strong>the</strong>orem. An example for such group algebra is <strong>the</strong><br />

following: let<br />

G = 〈a, b, c | a 2 = b 9 = c 19 = 1, b a = b, c a = c 18 , c b = c 7 〉

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!