Some Applications of Diophantine Geometry and Model Theory to Group Theory

Some Applications of Diophantine Geometry and Model Theory to Group Theory

Some applications of diophantine geometry and model theory to group theory. Emmanuel Breuillard Universit´eParis-Sud, Orsay, France Ol´eron,June 6th, 2011 Emmanuel Breuillard Diophantine geometry and group theory 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. 2 Diophantine Geometry on character varieties and a height gap theorem. 3 A uniform Tits alternative. 4 Diameter of finite simple groups. 5 Effective versions of Hrushovski's theorems on approximate groups. Plan of the talk: Emmanuel Breuillard Diophantine geometry and group theory 2 Diophantine Geometry on character varieties and a height gap theorem. 3 A uniform Tits alternative. 4 Diameter of finite simple groups. 5 Effective versions of Hrushovski's theorems on approximate groups. Plan of the talk: 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. Emmanuel Breuillard Diophantine geometry and group theory 3 A uniform Tits alternative. 4 Diameter of finite simple groups. 5 Effective versions of Hrushovski's theorems on approximate groups. Plan of the talk: 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. 2 Diophantine Geometry on character varieties and a height gap theorem. Emmanuel Breuillard Diophantine geometry and group theory 4 Diameter of finite simple groups. 5 Effective versions of Hrushovski's theorems on approximate groups. Plan of the talk: 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. 2 Diophantine Geometry on character varieties and a height gap theorem. 3 A uniform Tits alternative. Emmanuel Breuillard Diophantine geometry and group theory 5 Effective versions of Hrushovski's theorems on approximate groups. Plan of the talk: 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. 2 Diophantine Geometry on character varieties and a height gap theorem. 3 A uniform Tits alternative. 4 Diameter of finite simple groups. Emmanuel Breuillard Diophantine geometry and group theory Plan of the talk: 1 Effective Burnside-Schur theorems and the compactness theorem of first order logic. 2 Diophantine Geometry on character varieties and a height gap theorem. 3 A uniform Tits alternative. 4 Diameter of finite simple groups. 5 Effective versions of Hrushovski's theorems on approximate groups. Emmanuel Breuillard Diophantine geometry and group theory ±1 ±1 For a symmetric set of generators S = f1; s1 ; :::; sr g of a group G = hSi, we denote by Sk := S · ::: · S the \ball of radius k" in the Cayley graph of G generated by S. Conjecture (Effective restricted Burnside; Olshanskii) Given r; n, does there exists k(r; n) 2 N such that there are only finitely many r-generated finite groups G = hSi such that all elements in Sk have order dividing n ? Remark (Olshanskii). The conjecture would solve a celebrated open problem of Gromov, i.e. show the existence of a non-residually finite Gromov hyperbolic group. Effective Burnside-Schur Theorem (Restricted Burnside Problem; Kostrikin, Zelmanov) Given natural integers r; n, there are only finitely many r-generated finite groups all of whose elements have order dividing n. Emmanuel Breuillard Diophantine geometry and group theory Conjecture (Effective restricted Burnside; Olshanskii) Given r; n, does there exists k(r; n) 2 N such that there are only finitely many r-generated finite groups G = hSi such that all elements in Sk have order dividing n ? Remark (Olshanskii). The conjecture would solve a celebrated open problem of Gromov, i.e. show the existence of a non-residually finite Gromov hyperbolic group. Effective Burnside-Schur Theorem (Restricted Burnside Problem; Kostrikin, Zelmanov) Given natural integers r; n, there are only finitely many r-generated finite groups all of whose elements have order dividing n. ±1 ±1 For a symmetric set of generators S = f1; s1 ; :::; sr g of a group G = hSi, we denote by Sk := S · ::: · S the \ball of radius k" in the Cayley graph of G generated by S. Emmanuel Breuillard Diophantine geometry and group theory Remark (Olshanskii). The conjecture would solve a celebrated open problem of Gromov, i.e. show the existence of a non-residually finite Gromov hyperbolic group. Effective Burnside-Schur Theorem (Restricted Burnside Problem; Kostrikin, Zelmanov) Given natural integers r; n, there are only finitely many r-generated finite groups all of whose elements have order dividing n. ±1 ±1 For a symmetric set of generators S = f1; s1 ; :::; sr g of a group G = hSi, we denote by Sk := S · ::: · S the \ball of radius k" in the Cayley graph of G generated by S. Conjecture (Effective restricted Burnside; Olshanskii) Given r; n, does there exists k(r; n) 2 N such that there are only finitely many r-generated finite groups G = hSi such that all elements in Sk have order dividing n ? Emmanuel Breuillard Diophantine geometry and group theory Effective Burnside-Schur Theorem (Restricted Burnside Problem; Kostrikin, Zelmanov) Given natural integers r; n, there are only finitely many r-generated finite groups all of whose elements have order dividing n. ±1 ±1 For a symmetric set of generators S = f1; s1 ; :::; sr g of a group G = hSi, we denote by Sk := S · ::: · S the \ball of radius k" in the Cayley graph of G generated by S. Conjecture (Effective restricted Burnside; Olshanskii) Given r; n, does there exists k(r; n) 2 N such that there are only finitely many r-generated finite groups G = hSi such that all elements in Sk have order dividing n ? Remark (Olshanskii). The conjecture would solve a celebrated open problem of Gromov, i.e. show the existence of a non-residually finite Gromov hyperbolic group. Emmanuel Breuillard Diophantine geometry and group theory Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed). That is: given r; n; d, there exists k(r; n; d) 2 N such that there are only finitely many r-generated finite groups G = hSi admitting an k embedding in GLd (over some field) such that all elements in S have order dividing n. Effective Burnside-Schur Theorem (Burnside 1904, Schur 1914) Let K be a field and S ⊂ GLd (K) a finite symmetric set. If every element of the subgroup hSi has finite order, then hSi is finite. Emmanuel Breuillard Diophantine geometry and group theory Effective Burnside-Schur Theorem (Burnside 1904, Schur 1914) Let K be a field and S ⊂ GLd (K) a finite symmetric set. If every element of the subgroup hSi has finite order, then hSi is finite. Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed). That is: given r; n; d, there exists k(r; n; d) 2 N such that there are only finitely many r-generated finite groups G = hSi admitting an k embedding in GLd (over some field) such that all elements in S have order dividing n. Emmanuel Breuillard Diophantine geometry and group theory Equivalent way to see it: use ultraproducts as follows. If conclusion fails, one can find a sequence of fields fK g , a sequence of k k>0 k symmetric sets Sk of size r, such that every element in Sk has order dividing n, and yet jhSk ij ! +1. Then consider the ultraproduct Q Q U hSk i ⊂ U GLd (Kk ) = GLd (K), where Y K = Kk : U Effective Burnside-Schur Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed). That is: given r; n; d, there exists k(r; n; d) 2 N such that there are only finitely many r-generated finite groups G = hSi admitting an k embedding in GLd (over some field) such that all elements in S have order dividing n. Proof. Arguing by contradiction, this follows easily from the Compactness Theorem and the Burnside-Schur theorem. Emmanuel Breuillard Diophantine geometry and group theory If conclusion fails, one can find a sequence of fields fK g , a sequence of k k>0 k symmetric sets Sk of size r, such that every element in Sk has order dividing n, and yet jhSk ij ! +1. Then consider the ultraproduct Q Q U hSk i ⊂ U GLd (Kk ) = GLd (K), where Y K = Kk : U Effective Burnside-Schur Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed). That is: given r; n; d, there exists k(r; n; d) 2 N such that there are only finitely many r-generated finite groups G = hSi admitting an k embedding in GLd (over some field) such that all elements in S have order dividing n. Proof. Arguing by contradiction, this follows easily from the Compactness Theorem and the Burnside-Schur theorem. Equivalent way to see it: use ultraproducts as follows. Emmanuel Breuillard Diophantine geometry and group theory Then consider the ultraproduct Q Q U hSk i ⊂ U GLd (Kk ) = GLd (K), where Y K = Kk : U Effective Burnside-Schur Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed). That is: given r; n; d, there exists k(r; n; d) 2 N such that there are only finitely many r-generated finite groups G = hSi admitting an k embedding in GLd (over some field) such that all elements in S have order dividing n. Proof. Arguing by contradiction, this follows easily from the Compactness Theorem and the Burnside-Schur theorem. Equivalent way to see it: use ultraproducts as follows. If conclusion fails, one can find a sequence of fields fK g , a sequence of k k>0 k symmetric sets Sk of size r, such that every element in Sk has order dividing n, and yet jhSk ij ! +1. Emmanuel Breuillard Diophantine geometry and group theory Effective Burnside-Schur Corollary (1st effective version) Olshanski's conjecture holds for subgroups of GLd (d fixed).

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    100 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us