Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Is the ping-pong lemma a difficult characterization of free groups? Or is it just me? Does someone have a nice intuition about its idea or should I carry on staring at the statement?

share|improve this question
5  
Clara Löh has a set of very nicely written lecture notes on geometric group theory where the ping pong lemma is explained in its easiest form (page 69ff). Pierre de la Harpe's Topics in Geometric group theory is also a place to look at for such questions. The ping pong lemma is called Table-Tennis lemma there and can be found with several applications on page 25ff. –  t.b. Aug 26 '12 at 20:41
2  
A very gentle, helpful (for me, at least) description is given in "Groups, Graphs and Trees" by Meier, beginning on Page 64. –  Derek Allums Aug 27 '12 at 13:49
1  
I second the recommendation of @unit3000-21; Meier's book is an excellent source for geometric group theory when you're starting out. But I must say Clara Löh's book is gorgeous! –  user641 Aug 27 '12 at 19:09

1 Answer 1

up vote 7 down vote accepted

I'm an outsider, so maybe what I'm saying is silly. I would just think about the Tits alternative application since that really gives all the intuition. To apply it---and we'll just look at the complex case---you should produce two matrices $A$ and $B$ that have the following properties. $A$ has a dominant eigenvalue $\lambda$ (i.e., the eigenspace of $A-\lambda I$ is one-dimensional and all other eigenvalues have modulus strictly less than $|\lambda|$ of $A$ have with corresponding eigenvector $v$ and $A^{-1}$ has a dominant eigenvalue $\mu$ with coresponding eigenvector $w$. Similarly, let's suppose that $B$ and $B^{-1}$ have these dominant eigenvectors with corresponding eigenvectors $v'$ and $w'$.

Then if we consider $v,w,v',w'$ as being points in projective space then the dominant eigenvalue hypotheses say that there are open disjoint neighbourhoods of $v,w,v',w$, say $U_v, U_w, U_{v'}, U_{w'}$ such that there is some $N$ such that for $n\ge N$ we have, $A^n$ maps each of these neighbourhoods into $U_v$, $A^{-n}$ maps all these neighbourhoods into $U_{w}$, $B^n$ maps each of these neighbourhoods into $U_{v'}$, and $B^{-n}$ maps all these neighbourhoods into $U_{w'}$.

Now I think of it as being like a finite-state machine with four states labelled $U_v, U_w, U_{v'}, U_{w'}$ and an alphabet $A^N, A^{-N}, B^N, B^{-N}$ with transitions as described before; e.g., if you are in state $U_w$ and you read $A^N$ then you transition to state $U_v$ (and we'll read words right-to-left).

Now you can see that the group generated by $A^N$ and $B^N$ is free since if words $W$ and $W'$ on $A^N, A^{-N}, B^N, B^{-N}$ are the same then when we let $W$ act on $U_v$ it will send it to $U_v$ if and only if the first letter of $W$ is $A^N$; to $U_w$ iff the first letter of $W$ is $A^{-N}$, etc. Thus we see that if $W=W'$ then the first letters of $W$ and $W'$ must be the same. Now we cancel and keep going. Well, maybe this isn't what you wanted, but I tried my best and maybe we're both better off because of this. Palin out.

share|improve this answer
    
What makes you call yourself an 'outsider'? –  Tara B Feb 18 '13 at 15:35
    
I just meant that I do not really work with groups, free groups, etc., although I do find the Tits alternative to be rather bewitching. –  Sarah Palin Feb 18 '13 at 15:47
    
Ah, I see. Sometimes it's perhaps easier to explain something that isn't quite in your field (but that you nevertheless understand), because you will have learnt it more recently, or had to think about it more to feel you understand it, or something like that. –  Tara B Feb 18 '13 at 15:52
4  
More of a maverick than an outsider, really. –  Pete L. Clark Feb 18 '13 at 16:38

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.