counting homomorphisms to finite groups presented by
play

COUNTING HOMOMORPHISMS TO FINITE GROUPS: PRESENTED BY ALEXANDER I. - PDF document

COUNTING HOMOMORPHISMS TO FINITE GROUPS: PRESENTED BY ALEXANDER I. SUCIU TYPESET BY M. L. FRIES 1. Motivation The study of infinite groups is an exceedingly hard problem. Even if we restrict ourselves to the case of finitely generated groups,


  1. COUNTING HOMOMORPHISMS TO FINITE GROUPS: PRESENTED BY ALEXANDER I. SUCIU TYPESET BY M. L. FRIES 1. Motivation The study of infinite groups is an exceedingly hard problem. Even if we restrict ourselves to the case of finitely generated groups, the problem of showing two groups to be the same is very nontrivial. One of the many tools at our disposal is studying the quotient groups of a give group. It can even occur that the same group can appear as a quotient in many different ways. The invariants we will discuss involve counting the number of homomorphisms and epimorphisms from a given finitely generated group to a given quotient group. I would like to than Alex Suciu for his help in making these notes. 2. Introduction 2.1. Assumptions and Notation. Though out this document we will make the assumption that all groups are finitely generated. Given a f.g. group G we let | Hom ( G, Γ) | denote the number of homomorphisms from G to Γ. This is easily seen to be an invariant by the functorial properties of Hom . We also set δ Γ ( G ) = | Epi ( G, Γ) | / | Aut (Γ) | , the number of epimor- phism from G to Γ divided by the order of the automorphism group of Γ. Our main goal is to find formulas for these invariants of G . 2.2. Beginnings. Our first lemma will aid us in our goal of explicitly de- termining these invariants. Lemma 2.1. � | Hom ( G, Γ) | = | Epi ( G, H ) | . H ≤ Γ The proof of this lemma is seen in that the image of a homomorphism is a subgroup of the codomain, and thus will be omitted. We are now in a position to do a few examples. Example 2.1. G = Z Γ = Z k For this case we have | Hom ( Z , Z k ) | = k since the generator of Z can be mapped to any of the elements. The number of epimorphisms is a different case. For a homomorphism to be an epimor- phism we require that 1 get mapped to a generator. Thus the number of 1

  2. 2 TYPESET BY M. L. FRIES epimorphisms is the same as the number of generators of our target group so | Epi ( Z , Z k ) | = φ ( k ) . Example 2.2. We now consider the case of the free group of rank n , F n and Γ = Z p ( p - prime). To count the number of homomorphisms we simply need to say where each generator of F n should be sent. Since Z p is a group of order p we have p choices for each of n generators, whence | Hom ( F n , Z p ) | = p n . To count the number of epimorphisms we note that Z p is a simple abelian group, hence has no nontrivial subgroups, and our lemma says | Hom ( F n , Z p ) | = | Epi ( F n , Z p ) | + | Epi ( F n , { 0 } ) | , thus | Epi ( F n , Z p ) | = | Hom ( F n , Z p ) | − | Epi ( F n , { 0 } ) | = p n − 1 . This can be generalized to the case when Γ is a finite group of order | Γ | = γ . We then have | Hom ( F n , Γ) | = γ n and | Epi ( F n , Γ) | = φ Γ ( n ) = |{ ( α 1 , . . . , α n ) |� α 1 , . . . , α n � = Γ }| . We finish this section with a second lemma. Lemma 2.2. If Γ = Γ 1 × Γ 2 with ( | Γ 1 | , | Γ 2 | ) = 1 then | Hom ( G, Γ) | = | Hom ( G, Γ 1 ) | · | Hom ( G, Γ 2 ) | and | Epi ( G, Γ) | = | Epi ( G, Γ 1 ) | · | Epi ( G, Γ 2 ) | . Exercise 1. Prove this lemma. 3. M¨ obius Inversion A classical idea from number theory is that if we are given a function defined as the series of another function can we invert the formula. Namely our goal in this section is to find a formula for | Epi ( G, Γ) | in terms of | Hom ( G, Λ) | where Λ < Γ. We begin by considering the lattice of sub- groups of Γ ordered by inclusion. Example 3.1. Z 2 ⊕ Z 2 S 3 � � � � � � ��������� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Z 2 Z 2 Z 2 Z 3 Z 2 Z 2 Z 2 � ���������������� � � ���������� � � � � � � � � � � � � � � � � � � � � � � � 0 1

  3. COUNTING HOMOMORPHISMS TO FINITE GROUPS: PRESENTED BY ALEXANDER I. SUCIU 3 Definition 3.1. We define the M ¨ obius function to be the function  µ (Γ) = 1  µ : L (Γ) → Z with � µ (Λ) = 0 .  K ≤ Λ ≤ Γ Exercise 2. Show that for the group Z n the m¨ obius function for the group is exactly the m¨ obius function from number theory,  µ (1) = 1   if p 2 | n for some prime p µ ( n ) = µ ( n ) = 0  µ ( p 1 · p k ) = ( − 1) k for p 1 , . . . , p k distinct primes.  We now proceed to the main result due to Rota, Theorem 3.1. (Rota) � | Epi ( G, Γ) | = µ (Λ) | Hom ( G, Λ) | . Λ ≤ Γ 4. Finite Index Subgroups We begin by defining some invariants of a group. Definition 4.1. a k ( G ) = # { H ≤ G | [ G : H ] = k } These invariants were introduced and studied by Philip Hall. He proved the following recursion formula. Theorem 4.1. k − 1 a k ( G ) = | Hom ( G, S k ) | | Hom ( G, S k − l ) | � − a l ( G ) , ( k − 1)! ( k − l )! l =1 where S k is the symmetric group on k elements. These invariants contain a good amount of information about a group but the following “Hall Invariants” contain more information and give us a k ( G ). Definition 4.2. δ Γ ( G ) = | Epi ( G, Γ) | | Aut (Γ) | . We then find the following a 1 = 1 a 2 = δ Z 2 a 3 = δ Z 3 + 3 δ S 3 � δ Z 2 � a 4 = − + δ Z 4 + 4 δ Z 2 ⊕ Z 2 + 4 δ D 8 + 4 δ A 4 + 4 δ S 4 . 2 As an example to show that the invariants δ Γ contain more information than a k we consider the following.

  4. � � � � 4 TYPESET BY M. L. FRIES Example 4.1. Let M g be the orientable surface of genus g , and N g the non-orientable surface of genus g . We now consider the fundamental groups of these two classes of spaces π 1 ( M g ) = � x 1 , y 1 , . . . , x g , y g | [ x 1 , y 1 ] · · · [ x g , y g ] = 1 � π 1 ( N g ) = � x 1 , . . . , x g | x 2 1 · · · x 2 g = 1 � . We then have a k ( π 1 ( M g )) = a k ( π 1 ( N 2 g )) ∀ g ≥ 1 , k ≥ 1 but δ Z 3 ( π 1 ( M g )) = 3 2 g − 1 δ Z 3 ( π 1 ( N 2 g )) = 3 2 g − 1 − 1 . 2 2 This is due to the Z 2 factor in the abelianization of π 1 ( N g ) . 5. Cohomology 5.1. Setup. Let G be a group. We consider A as a Z G module, where Z G is the group ring of G . The action of G on A is defined by g · a = α ( g )( a ) where α : G → Aut ( A ). We are now in a position to build a cochain complex on A δ 0 δ 1 δ 2 δ k � C k · · · · · · C 0 C 1 C 2 � � � � Map ( G × k , A ) Map ( G, A ) Map ( G × G, A ) A The boundary maps are defined by δ 0 ( a )( x ) = x · a − a δ 1 ( f )( x, y ) = x · f ( y ) − f ( xy ) + f ( x ) . . . δ k ( f )( x 0 , . . . , x k ) = x 0 · f ( x 1 , . . . , x n ) − f ( x 0 x 1 , . . . , x n ) + f ( x 0 , x 1 x 2 , . . . , x n )+ · · · + ( − 1) k − 1 f ( x 0 , . . . , x k − 1 ) . Exercise 3. Show that this is a chain complex, i.e. δ k δ k − 1 = 0 . Once you have a chain complex the most natural thing to consider is the homology groups, α ( G, A ) = ker ( δ k ) /im ( δ k − 1 ) . H k α ( G, A ) = Z k α ( G, A ) /B k We want to find a practical method of computing these cohomology groups, the next section we will see that the group H 1 can be computed.

  5. COUNTING HOMOMORPHISMS TO FINITE GROUPS: PRESENTED BY ALEXANDER I. SUCIU 5 5.2. A Practical Approach to H 1 . Let G be a finitely presented group, G = � x 1 , . . . , x n | r 1 , . . . , r m � , alternatively we mean there is a short exact sequnce φ � � G � R � F n � 1 . 1 We now need to introduce the free derivatives. Definition 5.1. The F ree Derivatives on F n are defined to be the following: ∂ : F n → Z F n ∂x i satisfying 1) ∂x i = δ ij ∂x j 2) ∂uv = ∂u + u ∂v . ∂x j ∂x j ∂x j Now consider a free resolution of Z by Z G modules J G � Z G n d 1 � Z G m � Z G � Z � 0 . · · · We know two of the maps in this sequence,   x 1 − 1 � ∂r i x 2 − 1 � φ   d 1 = J G = .  .  . ∂x j   .   x n − 1 Now apply the functor Hom Z G ( − , A ) to obtain the cochain complex J α d α 1 � A n G � A m � · · · . A From this we find the first cohomology group H 1 α ( G, A ) = ker ( J α G ) /im ( d α 1 ) .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend