From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/2794 Path: news.gmane.org!not-for-mail From: Peter Freyd Newsgroups: gmane.science.mathematics.categories Subject: Re: Preprint: A simple description of Thompson's group F Date: Thu, 1 Sep 2005 12:17:45 -0400 (EDT) Message-ID: <200509011617.j81GHj1q020427@saul.cis.upenn.edu> NNTP-Posting-Host: main.gmane.org X-Trace: ger.gmane.org 1241018910 5842 80.91.229.2 (29 Apr 2009 15:28:30 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 29 Apr 2009 15:28:30 +0000 (UTC) To: categories@mta.ca, tl@maths.gla.ac.uk Original-X-From: rrosebru@mta.ca Fri Sep 2 09:36:32 2005 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 02 Sep 2005 09:36:32 -0300 Original-Received: from Majordom by mailserv.mta.ca with local (Exim 4.52) id 1EBAZu-00018B-H5 for categories-list@mta.ca; Fri, 02 Sep 2005 09:23:30 -0300 Original-Sender: cat-dist@mta.ca Precedence: bulk X-Keywords: X-UID: 3 Original-Lines: 36 Xref: news.gmane.org gmane.science.mathematics.categories:2794 Archived-At: Marcelo and Tom write We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A. Tom has pointed out to me that the review of the old Freyd/Heller I posted give no hint of its relevance. Therefor this: F was defined (40 years ago) as the initial model for a group with an endomorphism that's conjugate to its square. More formally: consider the equational theory that adds to the theory of groups a constant, s, and a unary operator e, subject to two further equations: e(xy) = (ex)(ey) "e is a endomorphism" s(ex) = (e(ex))s "e is a conjugacy-idempotent" The initial algebra for this theory is the group F. (If one insists on removing the type-error in the last sentence, then try "the initial algebra for this theory when subjected to the forgetful functor back to groups is F.") If one defines a sequence of elements s_n = e^n(s) they clearly generate F (as a group) and it isn't hard to see that a complete set of relations for F (as a group) is the doubly-infinite family s_a s_b = s_{b+1} s_a one such equation for each a < b. (It took me ten years to find a proof that just two of these equations imply all the others.)