DOCSLIB.ORG

F1.3YR1 ABSTRACT ALGEBRA Lecture Notes: Part 7 1 Finitely

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
F1.3YR1 ABSTRACT ALGEBRA Lecture Notes: Part 7 1 Finitely F1.3YR1 ABSTRACT ALGEBRA Lecture Notes: Part 7 1 Finitely Generated Abelian Groups If A is a ¯nitely generated abelian group, then we have seen that there is a natural n » n number n and a subgroup K of Z such that A = Z =K. Moreover, K is free abelian of rank m · n. A basis for K can be expressed as the set of rows of an m £ n matrix: such a matrix is known as a presentation matrix for A. Example. µ ¶ 300 040 3 is a presentation matrix for A = Z3 £ Z4 £ Z, since the subgroup K of Z generated by the rows of the matrix is K = f(3m; 4n; 0); m; n 2 Zg =3Z£4Z£0Z and so 3 Z Z £ Z £ Z Z Z Z » = = £ £ = Z3 £ Z4 £ Z: K 3Z £ 4Z £ 0Z 3Z 4Z 0Z » Of course, since Z3 £ Z4 = Z12, it follows that ¡ ¢ 12 0 » is another presentation for A = Z12 £ Z. Lemma 1 Let the m £ n matrix M be a presentation matrix for a ¯nitely generated abelian group A.Ifm=nthen A is ¯nite, of order j det(M)j, where M is any presentation matrix for A. Otherwise there exists a surjective homomorphism A ! Z. Proof. Since the rows of M represent a basis for K, they are linearly independent. Suppose ¯rst that m = n. Then the euclidean algorithm will transform M into a new presentation matrix M 0 which is upper triangular in the sense that the entries below the diagonal are all 0: mi;j = 0 for i>j. The elementary row operations used in the euclidean algorithm do not alter the fact that the rows are linearly independent. Moreover, the only e®ect they have on the 0 determinant is to mulitply it by 1 or ¡1, so j det(M)j = j det(M )j = j¹1 ¢¢¢¹nj, where 0 ¹1;:::;¹n are the diagonal entries in M . Let B be the cyclic subgroup of A generated by en =(0;:::;0;1). Then B has order 0 j¹nj in A, since (0;:::;0;¹n)=¹nen is one of the rows of the presentation matrix M . Moreover, A=B is generated by e1;:::;en¡1, and we can get a presentation matrix M" for A=B by removing the nth row and the nth column from M 0. By induction on n we can assume that A=B is ¯nite of order j¹1 ¢¢¢¹n¡1j, and it follows that A is ¯nite of order jA=Bj¢jBj=j¹1¢¢¢¹nj. n Now assume that m<n. For any vector v =(v1;:::;vn) 2 Z , we can de¯ne a n homomorphism Áv : Z ! Z by Áv(u)=u:v = u1v1 + ¢¢¢+unvn. Suppose that u:v =0 whenever u is one of the rows of the presentation matrix M for A. Then each row of n M belongs to Ker(Áv). Hence the subgroup K of Z generated by the rows of M is also n contained in Ker(Áv), and we may then de¯ne a homomorphism θv : A = Z =K ! Z by θv(u + K)=u:v = Áv(u). n n We have an n-paramter family Áv, v =(v1;:::;vn)2Z of homomorphisms Z ! Z, and a family of m linear equations u:v = 0 that determine which of the Áv give rise to homomorphisms θv : A ! Z. Since m<n, there is at least one nonzero solution to this family of simultaneous equations, and so at least one nonzero homomrohphism θv : A ! Z. Of course, the homomorphism θv is not necessarily surjective. However, since it is nonzero, its image Im(θv) has the form kZ for some k>0, so θ : A ! Z de¯ned by θ(u)=θv(u)=k is surjective. ¤ Example. Let µ ¶ 43 M = 52 be a presentation matrix for a ¯nitely generated abelian group A. Then det(M)= » 8¡5=¡7, so A has order 7, which is a prime number, and hence A = Z7. To see this isomorphism more directly, we can use row operations to put M into row echelon form, for example: µ ¶ µ ¶ µ ¶µ ¶ ¡ ¡ 43 ! 52 ! 1 1 !11 52 43 43 07 Then the subgroup K generated by the rows of M is also generated by the rows of the 2 new matrix, (1; ¡1) = e1 ¡ e2, and (0; 7) = 7e2. The group A = Z =K is generated by two elements, a1 = e1 + K and a2 = e2 + K. But the fact that e1 ¡ e2 2 K means that a1 ¡ a2 =0inA,iea1 =a2,soAis cyclic. The fact that 7e2 2 K means that 7a2 =0 in A,soAis cyclic of order dividing 7. On the other hand, the order of A must be greater than 1, since no Z-linear combination of the rows of M contains e2,soe2 2=K, » so a2 =0in6 A.ThusA=Z7, as promised by the Lemma. Example. Let µ ¶ 143 M = 052 be a presentation matrix for a ¯nitely generated abelian group A. Since M has fewer rows than columns, the Lemma tells us that there must be a surjective homomorphism f : A ! Z.NowA=Z3=K, where K is the subgroup generated by the rows of M, 2 and so A is generated by a1 = e1 + K, a2 = e2 + K and a3 = e3 + K. To ¯nd a homomorphism f, we need to de¯ne f(a1)=u1,f(a2)=u2 and f(a3)=u3, where u1;u2;u3 2Z are solutions of the simultaneous linear equations 1:u1 +4:u2 +3:u3 =0; 0:u1 +5:u2 +2:u3 =0: A nonzero solution to the second equation can be obtained by putting u2 = 2 and u3 = ¡5. We may than subsitute these values back into the ¯rst equation to get u1 =7. Lemma 2 Let A be an abelian group, and let θ : A ! Z be a surjective homomorphism. » Then A = Ker(θ) £ Z. Proof. Choose a 2 A such that θ(a)=12Z. De¯ne Á : Ker(θ) £ Z ! A by Á(x; n)=x+na. Then Á is a homomorphism, since Á((x1;n1)+(x2;n2)) = Á(x1 + x2;n1 +n2)=x1+x2+(n1 +n2)a =(x1+n1a)+(x2 +n2a)=Á(x1;n1)+Á(x2;n2): Moreover, if (x; n) 2 Ker(Á) then n = θ(na)=θ(x)+θ(na)=θ(x+na)=θ(Á(x; n)) = θ(0) = 0; and hence also x = Á(x; 0) = Á(x; n) = 0. Thus ker(Á)=f(0; 0)g and so Á is injective. Finally, if ® 2 A, let m = θ(®) 2 Z, and let y = ® ¡ ma. Then θ(y)=θ(®)¡ mθ(a)=m¡m=0,soy2Ker(θ). Moreover, Á(y; m)=y+ma = ®. Hence Á is also surjective. Thus Á is an isomorphism from Ker(θ) £ Z to A, as required. ¤ Corollary 1 Let A be a ¯nitely generated abelian group. Then there is a ¯nite subgroup » m A0 of A and an integer m ¸ 0 such that A = A0 £ Z . » n n Proof. We know that A = Z =K for some integer n ¸ 0 and some subgroup K ½ Z , where K is free abelian of rank r · n.Ifr=nthen we know from Lemma 1 that A is ¯nite, so we can take A0 = A. Otherwise we know { also from Lemma 1 { that there exists a surjective homomorphism f : A ! Z. Composing f with the surjective quotient map Zn ! A, we also get a surjective homomorphism Á : Zn ! Z. » n » By the last Lemma, A = Ker(f) £ Z, and similarly Z = Ker(Á) £ Z. Since we also know that Ker(Á) ½ Zn is free abelian of rank t · n, it follows that t = n ¡ 1. Also » » n¡1¡r Ker(f) = Ker(Á)=K. By induction on n¡r, we may assume that Ker(f) = A0 £Z » » n¡r for some ¯nite subgroup A0, and hence A = Ker(f) £ Z = A0 £ Z . ¤ 3 2 Finite Abelian Groups Corollary 1 reduces the classi¯cation of ¯nitely generated abelian groups to that of ¯nite abelian groups. The next step is to simplify further. We start with a result similar to the Chinese Remainder Theorem. Lemma 3 Let A be a ¯nite abelian group of order mn, where m; n are positive integers » which are coprime { in other words hcf(m; n)=1. Then A = mA £ nA. Proof. The map f : A ! mA £ nA de¯ned by f(a)=(ma; na) is a homomorphism, since f(a+b)=(m(a+b);n(a+b)) = (ma+mb; na+nb)=(ma; na)+(mb; nb)=f(a)+f(b): It is also injective, because hcf(m; n) = 1 means that m; n generate Z, which means that mp + nq = 1 for some integers p; q, and so if a 2 A with (ma; na)=(0;0) then a =(mp + nq)a = p(ma)+q(na)=0. Finally, if a 2 A then mna = 0 by Lagrange's Theorem, since jAj = mn.Ifp; q 2 Z with mp + nq = 1, then f(mpa)=(m2pa; mnpa)=(ma ¡ mnqa; mnpa)=(ma; 0). Similarly, if a0 2 A, then f(nqa0)=(0;na0). But then an arbitrary element of mA£nA has the form (ma; na0)=f(mpa + nqa0) for some a; a0 2 A, and so f is surjective. Hence f : A ! mA £ nA is an isomorphism. ¤ De¯nition. Let p be a prime number. A p-group is a ¯nite group whose order is a power of p. Lemma 4 A ¯nite abelian group A is a p-group if and only if the order of each element a 2 A is a power of p.
Load more

Recommended publications
  • On Abelian Subgroups of Finitely Generated Metabelian
    J. Group Theory 16 (2013), 695–705 DOI 10.1515/jgt-2013-0011 © de Gruyter 2013 On abelian subgroups of finitely generated metabelian groups Vahagn H. Mikaelian and Alexander Y. Olshanskii Communicated by John S. Wilson To Professor Gilbert Baumslag to his 80th birthday Abstract. In this note we introduce the class of H-groups (or Hall groups) related to the class of B-groups defined by P. Hall in the 1950s. Establishing some basic properties of Hall groups we use them to obtain results concerning embeddings of abelian groups. In particular, we give an explicit classification of all abelian groups that can occur as subgroups in finitely generated metabelian groups. Hall groups allow us to give a negative answer to G. Baumslag’s conjecture of 1990 on the cardinality of the set of isomorphism classes for abelian subgroups in finitely generated metabelian groups. 1 Introduction The subject of our note goes back to the paper of P. Hall [7], which established the properties of abelian normal subgroups in finitely generated metabelian and abelian-by-polycyclic groups. Let B be the class of all abelian groups B, where B is an abelian normal subgroup of some finitely generated group G with polycyclic quotient G=B. It is proved in [7, Lemmas 8 and 5.2] that B H, where the class H of countable abelian groups can be defined as follows (in the present paper, we will call the groups from H Hall groups). By definition, H H if 2 (1) H is a (finite or) countable abelian group, (2) H T K; where T is a bounded torsion group (i.e., the orders of all ele- D ˚ ments in T are bounded), K is torsion-free, (3) K has a free abelian subgroup F such that K=F is a torsion group with trivial p-subgroups for all primes except for the members of a finite set .K/.
    [Show full text]
  • Finitely Generated Groups Are Universal
    Finitely Generated Groups Are Universal Matthew Harrison-Trainor Meng-Che Ho December 1, 2017 Abstract Universality has been an important concept in computable structure theory. A class C of structures is universal if, informally, for any structure, of any kind, there is a structure in C with the same computability-theoretic properties as the given structure. Many classes such as graphs, groups, and fields are known to be universal. This paper is about the class of finitely generated groups. Because finitely generated structures are relatively simple, the class of finitely generated groups has no hope of being universal. We show that finitely generated groups are as universal as possible, given that they are finitely generated: for every finitely generated structure, there is a finitely generated group which has the same computability-theoretic properties. The same is not true for finitely generated fields. We apply the results of this investigation to quasi Scott sentences. 1 Introduction Whenever we have a structure with interesting computability-theoretic properties, it is natural to ask whether such examples can be found within particular classes. While one could try to adapt the proof within the new class, it is often simpler to try and code the original structure into a structure in the given class. It has long been known that for certain classes, such as graphs, this is always possible. Hirschfeldt, Khoussainov, Shore, and Slinko [HKSS02] proved that classes of graphs, partial orderings, lattices, integral domains, and 2-step nilpotent groups are \complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations".
    [Show full text]
  • Decomposing Some Finitely Generated Groups Into Free Products With
    Decomposing some finitely generated groups into free products with amalgamation 1 V.V. Benyash-Krivets Introduction . We shall say that a group G is a non-trivial free product with amalgamation if ¡ ¡ G = G1 A G2, where G1 = A = G2 (see [1]). Wall [2] has posed the following question: Which one-relator groups are non-trivial free products with amalgamation? £ Let G = ¢ g , . , g R = = R = 1 be a group with m generators and n 1 m | 1 · · · n relations such that def G = m n ¤ 2. It is proved in [4] that G is a non-trivial − free product with amalgamation. In particular, if G is a group with m ¤ 3 generators and one relation, then G is a non-trivial free product with amalgamation. A case of groups with two generators and one relation is more complicated. For example, the free −1 −1 £ abelian group G = ¢ a, b [a, b] = 1 of rank 2, where [a, b] = aba b , obviously, is | not a non-trivial free product with amalgamation. Other examples are given by groups −1 n £ Gn = ¢ a, b aba = b . For any n, the group Gn is solvable and using results from [3], | ¡ it is easy to show that for n = 1 the group G is not decomposable into a non-trivial − n free product with amalgamation. The following conjecture was stated in [4]. m £ ¤ Conjecture 1 Let G = ¢ a, b R (a, b) = 1 , m 2, be a group with two generators | and one relation with torsion. Then G is a non-trivial free product with amalgamation.
    [Show full text]
  • Lecture 4, Geometric and Asymptotic Group Theory
    Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Lecture 4, Geometric and asymptotic group theory Olga Kharlampovich NYC, Sep 16 1 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions The universal property of free groups allows one to describe arbitrary groups in terms of generators and relators. Let G be a group with a generating set S. By the universal property of free groups there exists a homomorphism ': F (S) ! G such that '(s) = s for s 2 S. It follows that ' is onto, so by the first isomorphism theorem G ' F (S)=ker('): In this event ker(') is viewed as the set of relators of G, and a group word w 2 ker(') is called a relator of G in generators S. If a subset R ⊂ ker(') generates ker(') as a normal subgroup of F (S) then it is termed a set of defining relations of G relative to S. 2 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions The pair hS j Ri is called a presentation of G, it determines G uniquely up to isomorphism. The presentation hS j Ri is finite if both sets S and R are finite. A group is finitely presented if it has at least one finite presentation. Presentations provide a universal method to describe groups. Example of finite presentations 1 G = hs1;:::; sn j [si ; sj ]; 81 ≤ i < j ≤ ni is the free abelian group of rank n.
    [Show full text]
  • Arxiv:1711.08410V2
    LATTICE ENVELOPES URI BADER, ALEX FURMAN, AND ROMAN SAUER Abstract. We introduce a class of countable groups by some abstract group- theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing ℓ2- Betti numbers that are not virtually a product of two infinite groups. Further, it includes acylindrically hyperbolic groups. For any group Γ in this class we determine the general structure of the possible lattice embeddings of Γ, i.e. of all compactly generated, locally compact groups that contain Γ as a lattice. This leads to a precise description of possible non-uniform lattice embeddings of groups in this class. Further applications include the determination of possi- ble lattice embeddings of fundamental groups of closed manifolds with pinched negative curvature. 1. Introduction 1.1. Motivation and background. Let G be a locally compact second countable group, hereafter denoted lcsc1. Such a group carries a left-invariant Radon measure unique up to scalar multiple, known as the Haar measure. A subgroup Γ < G is a lattice if it is discrete, and G/Γ carries a finite G-invariant measure; equivalently, if the Γ-action on G admits a Borel fundamental domain of finite Haar measure. If G/Γ is compact, one says that Γ is a uniform lattice, otherwise Γ is a non- uniform lattice. The inclusion Γ ֒→ G is called a lattice embedding. We shall also say that G is a lattice envelope of Γ. The classical examples of lattices come from geometry and arithmetic. Starting from a locally symmetric manifold M of finite volume, we obtain a lattice embedding π1(M) ֒→ Isom(M˜ ) of its fundamental group into the isometry group of its universal covering via the action by deck transformations.
    [Show full text]
  • Finitely Generated Subgroups of Lattices in Psl2 C
    FINITELY GENERATED SUBGROUPS OF LATTICES IN PSL2 C YAIR GLASNER, JUAN SOUTO, AND PETER STORM Abstract. Let Γ be a lattice in PSL2(C). The pro-normal topology on Γ is defined by taking all cosets of non-trivial normal subgroups as a basis. This topology is finer than the pro-finite topology, but it is not discrete. We prove that every finitely generated subgroup ∆ < Γ is closed in the pro-normal topology. As a corollary we deduce that if H is a maximal subgroup of a lattice in PSL2(C) then either H is finite index or H is not finitely generated. 1. Introduction In most infinite groups, it is virtually impossible to understand the lattice of all subgroups. Group theorists therefore focus their attention on special families of subgroups such as finite index subgroups, normal subgroups, or finitely generated subgroups. This paper will study the family of finitely generated subgroups of lattices in PSL2(C). Recall that lattices in PSL2(C) are the fundamental groups of finite volume hyperbolic 3-orbifolds. For these groups we establish a connection between finitely generated subgroups and normal subgroups. This connection is best expressed in the following topological terms. If a family of subgroups N is invariant under conjugation and satisfies the con- dition, (1) for all N1,N2 ∈ N ∃ N3 ∈ N such that N3 ≤ N1 ∩ N2 then one can define an invariant topology in which the given family of groups constitutes a basis of open neighborhoods for the identity element. The most famous example is the pro-finite topology, which is obtained by taking N to be the family of (normal) finite index subgroups.
    [Show full text]
  • Relative Subgroup Growth and Subgroup Distortion
    Relative Subgroup Growth and Subgroup Distortion Tara C. Davis, Alexander Yu. Olshanskii October 29, 2018 Abstract We study the relative growth of finitely generated subgroups in finitely generated groups, and the corresponding distortion function of the embed- dings. We explore which functions are equivalent to the relative growth functions and distortion functions of finitely generted subgroups. We also study the connections between these two asymptotic invariants of group embeddings. We give conditions under which a length function on a finitely generated group can be extended to a length function on a larger group. 1 Introduction and Background We will use the notation that for a group G with finite generating set X, and for an element g G, then g X represents the word length of ∈ | | the element g with respect to the generating set X. For this paper, N = 1, 2,..., . For r N we use the notation that BG(r) represents the ball { } ∈ in G centered at the identity with radius r. That is, BG(r) = g G : { ∈ g X r . | | ≤ } Definition 1.1. Let G be a group finitely generated by a set X with any subset H. The growth function of H in G is G g : N N : r # h H : h X r = #(BG(r) H). H → → { ∈ | | ≤ } ∩ arXiv:1212.5208v1 [math.GR] 20 Dec 2012 The growth functions of subsets and other functions of this type be- come asymptotic invariants independent of the choice of a finite set X if one takes them up to a certain equivalence (see the definitions of , , ∼ ∼ and in Section 3.) ≈ The growth of a subgroup H with respect to a finite set of generators of a bigger group G is called the relative growth of H in G and denoted by G G gH .
    [Show full text]
  • 2.4 Direct Products and Finitely Generated Abelian Groups
    2.4. DIRECT PRODUCTS AND FINITELY GENERATED ABELIAN GROUPS31 2.4 Direct Products and Finitely Generated Abelian Groups 2.4.1 Direct Products 4 Def 2.43. The Cartesian product of sets S1,S2, ··· ,Sn is the set of all ordered n-tuples (a1, ··· , an) where ai ∈ Si for i = 1, 2 ··· , n. n Y Si = S1 × S2 × · · · × Sn i=1 := {(a1, a2, ··· , an) | ai ∈ Si for i = 1, 2, ··· , n}. Caution: The notation (a1, a2, ··· , an) here has different meaning from the cycle notation in permutation groups. Thm 2.44. If G1,G2, ··· ,Gn are groups with the corresponding multiplica- Qn tions, then i=1 Gi is a group under the following multiplication: (a1, a2, ··· , an)(b1, b2, ··· , bn) := (a1b1, a2b2, ··· , anbn) Qn for (a1, a2, ··· , an) and (b1, b2, ··· , bn) in i=1 Gi. Proof. Qn 1. Closed: ai ∈ Gi, bi ∈ Gi ⇒ aibi ∈ Gi ⇒ (a1b1, ··· , anbn) ∈ i=1 Gi. 2. Associativity: By the associativity in each Gi. 3. Identity: Let ei be the identity in Gi. Then e := (e1, e2, ··· , en) is the identity of G. −1 −1 4. Inverse: The inverse of (a1, ··· , an) is (a1 , ··· , an ). Ex 2.45. R2, R3 are abelian groups. (Every finite dimensional real vector space is an abelian group that is iso- morphic to certain Rn.) Ex 2.46. Z2 = {(a, b) | a, b ∈ Z} is a subgroup of R2. Qn Qn (If Hi ≤ Gi for i = 1, ··· , n, then i=1 Hi ≤ i=1 Gi). 41st HW: 1, 2, 14, 34, 46 32 CHAPTER 2. PERMUTATIONS, COSETS, DIRECT PRODUCTS Ex 2.47.
    [Show full text]
  • Coarse Geometry and Finitely Generated Groups
    N.J.Towner Coarse geometry and finitely generated groups Bachelor thesis, July 2013 Supervisor: Dr. L.D.J. Taelman Mathematisch Instituut, Universiteit Leiden 2 Contents 0 Conventions 3 1 Introduction 4 2 Length spaces and geodesic spaces 7 3 Coarse geometry and group actions 22 4 Polycyclic groups 30 5 Growth functions of finitely generated groups 38 A Acknowledgements 49 References 50 0 CONVENTIONS 3 0 Conventions 1. We write N for the set of all integers greater than or equal to 0. 2. For sets A and B, A ⊂ B means that every element of A is also an element of B. 3. We use the words \map" and \function" synonymously, with their set-theoretic meaning. 4. For subsets A; B ⊂ R, a map f : A ! B is called increasing if for all x; y 2 A, x > y ) f(x) > f(y). 5. An edge of a graph is a set containing two distinct vertices of the graph. 6. For elements x, y of a group, the commutator [x; y] is defined as xyx−1y−1. 7. For metric spaces (X; dX ), (Y; dY ), we call a map f : X ! Y an 0 0 0 isometric embedding if for all x; x 2 X, dY (f(x); f(x )) = dX (x; x ). We call f an isometry if it is a surjective isometric embedding. 1 INTRODUCTION 4 1 Introduction The topology of a metric space cannot tell us much about its large-scale, long-range structure. Indeed, if we take a metric space (X; d) and for each x; y 2 X we let d0(x; y) = minfd(x; y); 1g then d0 is a metric on X equivalent to d.
    [Show full text]
  • FINITELY GENERATED COMMUTATIVE SEMIGROUPS by D
    FINITELY GENERATED COMMUTATIVE SEMIGROUPS by D. B. McALISTER and L. O'CARROLL (Received 17 January, 1969; revised 11 September, 1969) Since all the semigroups considered in this paper are commutative, we shall use the terms " semigroup " and " group " where we actually mean " commutative semigroup " and " commutative group ". Some basic results from the theory of semigroups are required and will be used without explicit mention; these results may be found in [1, § 4.3]. We shall denote the additive semigroups of integers, positive integers, negative integers, positive rationals by Z, Z+, Z", Q+ respectively. 1. Introduction. In his book The theory of finitely generated commutative semigroups, L. Redei has carried out a deep analysis of the congruences on finitely generated free semi- groups. As a consequence of this theory, one can, in principle, construct all finitely generated semigroups. However, Re"dei's theory does not give rise to a structure theorem for such semi- groups. In this paper we consider the problem of giving a description of finitely generated semigroups in the spirit of the so-called " Fundamental theorem of finitely generated groups " [3, Theorems 10.3, 10.4]. We shall state this result as Theorem 1.1 because it serves as a model for our results; taken with our results, it also shows where the analogy between groups and semigroups breaks down. THEOREM 1.1. Let G be a finitely generated group. (I) Gx Z" x Ffor some non-negative integer n and some finite group F. The integer n is unique and the group F is unique up to isomorphism.
    [Show full text]
  • Problems on the Geometry of Finitely Generated Solvable Groups
    Problems on the geometry of finitely generated solvable groups Benson Farb∗ and Lee Moshery February 28, 2000 Contents 1 Introduction 2 2 Dioubina’s examples 5 3 Nilpotent groups and Pansu’s Theorem 5 4 Abelian-by-cyclic groups: nonpolycyclic case 8 5 Abelian-by-cyclic groups: polycyclic case 11 6 Next steps 14 ∗Supported in part by NSF grant DMS 9704640 and by a Sloan Foundation fellowship. ySupported in part by NSF grant DMS 9504946. 1 1 Introduction Our story begins with a theorem of Gromov, proved in 1980. Theorem 1 (Gromov’s Polynomial Growth Theorem [Gr1]). Let G be any finitely generated group. If G has polynomial growth then G is virtu- ally nilpotent, i.e. G has a finite index nilpotent subgroup. Gromov’s theorem inspired the more general problem (see, e.g. [GH1, BW, Gr1, Gr2]) of understanding to what extent the asymptotic geometry of a finitely generated solvable group determines its algebraic structure. One way in which to pose this question precisely is via the notion of quasi- isometry. A (coarse) quasi-isometry between metric spaces is a map f : X Y ! such that, for some constants K; C; C0 > 0: 1. 1 d (x ; x ) C d (f(x ); f(x )) Kd (x ; x )+C for all x ; x K X 1 2 − ≤ Y 1 2 ≤ X 1 2 1 2 2 X. 2. The C0-neighborhood of f(X) is all of Y . X and Y are quasi-isometric if there exists a quasi-isometry X Y . Note ! that the quasi-isometry type of a metric space X does not depend on any bounded subset of X; hence the term “asymptotic”.
    [Show full text]
  • Lectures on Lattices
    LECTURES ON LATTICES TSACHIK GELANDER 1. Lecture 1, a brief overview on the theory of lattices Let G be a locally compact group equipped with a left Haar measure µ, i.e. a Borel regular measure which is finite on compact, positive on open and invariant under left multiplications | by Haar's theorem such µ exists and is unique up to normalization. The group G is called unimodular if µ is also right invariant, or equivalently if it is symmetric in the sense that µ(A) = µ(A−1) for every measurable set A. Note that G is compact iff µ(G) < 1. For example: • Compact groups, Nilpotent groups and Perfect groups are unimodular. • The group of affine transformations of the real line is not unimodular. A closed subgroup H ≤ G is said to be co-finite if the quotient space G=H admits a non-trivial finite G invariant measure. A lattice in G is a co-finite discrete subgroup. A discrete subgroup Γ ≤ G is a lattice iff it admits a finite measure fundamental domain, i.e. a measurable set Ω of finite measure which form a set of right cosets representatives for Γ in G. We shall denote Γ ≤L G to express that Γ is a lattice in G. Exercise 1. If G admits a lattice then it is unimodular. We shall say that a closed subgroup H ≤ G is uniform if it is cocompact, i.e. if G=H is compact. Exercise 2. A uniform discrete subgroup Γ ≤ G is a lattice. Note that if G = SL2(R) and H is the Boral subgroup of upper triangular matrices, then H is uniform but not co-finite.
    [Show full text]