Proof: Let Mp denote ⟨ xp | x∈P ⟩. If M is trivial, the case holds, so assume M≠1.
Lemma 1: Gn char G for any finitely generated group G and n∈Z. Proof: x∈Gn⇔x=yn1...ynr⇔φ(x)=φ(yn1...ynr)=φ(y1)n...φ(yr)n⇔φ(x)∈Gn ◻
Since any characteristic subgroup of M is concomitantly normal in G, we must not have any proper nontrivial characteristic subgroups of M. Assume M′=M; since subgroups of a solvable group are solvable by Proposition 10(1), and yet the derived chain of M terminates before reaching the identity, we have a contradiction. So assume M′=1, and now M is abelian.
Suppose Mp=1 for some prime p. Then all the generators of Mp are trivial, which is to say xp=1 for all x∈M and now M is elementary abelian. So assume that Mp=M for any prime p. Inductively prove that Mn=M for all n∈Z+, an absurd conclusion for M|M|=M. The case is clear when n=1, so proceed to the inductive step. The case is assumed true for prime n, so we have prime q dividing n≠q. We have (Mn/q)q=M by induction, revealing that for any element of the abelian M we have a representation of the form (mn/q1,1...mn/q1,r1)q(mn/q2,1...mn/q2,r2)q...(mn/qs,1...mn/qs,rs)q=mn1,1...mn1,r1mn2,1...mn2,r2...mns,1...mns,rs∈Mn. ◻
No comments:
Post a Comment