Proof: (⇒) Assume n≠m, and generally n is of smaller cardinality than m. Let φ be the isomorphism from F1 to F2. For an arbitrary element x∈F2, we have x=φ(ak11...akrn)=φ(a1)k1...φ(ar)kr, so that F2 is generated by a number of elements of smaller than or equal cardinality to those of F1, a contradiction. (⇐) Let there be a bijection between the generators of F1 and the generators of F2, operating on the index by π. Define a mapping φ:F1→F2 by φ(ai)=bπ(i) and homomorphically extend it. For any two generators in F1, we have:φ(ai)x=φ(aj)y⇒bxπ(i)=byπ(j)⇒π(i)=π(j)⇒i=j⇒ai=ajNow observe: φ(ak11...akrr)=φ(aj11...ajss)⇒bk1π(1)...bkrπ(r)=bj1π(1)...bjrπ(s)⇒∀i[bkiπ(i)=bjiπ(i)]⇒∀i[φ(ai)ki=φ(ai)ji]⇒∀i[akii=ajii]⇒aπ(1)k1...akrπ(r)=aj11...ajssSo that φ is an injective homomorphism. Similarly, we can construct an injective homomorphism from F2 into F1, therefore providing an isomorphism. This argument did not assume the finiteness of rank, merely the equivalency of cardinality, so is therefore applicable to infinite groups as well. ◻
Warning: Invalid proof and erroneous extension of the Bernstein-Schroeder theorem.
No comments:
Post a Comment