a geometric approach to the conjugacy problem for
play

A geometric approach to the conjugacy problem for semisimple Lie - PowerPoint PPT Presentation

A geometric approach to the conjugacy problem for semisimple Lie groups Andrew Sale Vanderbilt University January 11, 2015 Andrew Sale A geometric approach to the conjugacy problem Conjugacy Length Function G group with length function || :


  1. A geometric approach to the conjugacy problem for semisimple Lie groups Andrew Sale Vanderbilt University January 11, 2015 Andrew Sale A geometric approach to the conjugacy problem

  2. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Andrew Sale A geometric approach to the conjugacy problem

  3. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Definition (Conjugacy length function) CLF G : [0 , ∞ ) → [0 , ∞ ) minimal function satisfying: Andrew Sale A geometric approach to the conjugacy problem

  4. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Definition (Conjugacy length function) CLF G : [0 , ∞ ) → [0 , ∞ ) minimal function satisfying: For x ≥ 0 , u, v ∈ G such that | u | + | v | ≤ x , then Andrew Sale A geometric approach to the conjugacy problem

  5. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Definition (Conjugacy length function) CLF G : [0 , ∞ ) → [0 , ∞ ) minimal function satisfying: For x ≥ 0 , u, v ∈ G such that | u | + | v | ≤ x , then ∃ g ∈ G such that (i) gug − 1 = v and u is conjugate to v ⇐ ⇒ Andrew Sale A geometric approach to the conjugacy problem

  6. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Definition (Conjugacy length function) CLF G : [0 , ∞ ) → [0 , ∞ ) minimal function satisfying: For x ≥ 0 , u, v ∈ G such that | u | + | v | ≤ x , then ∃ g ∈ G such that (i) gug − 1 = v and u is conjugate to v ⇐ ⇒ (ii) | g | ≤ CLF G ( x ) . Andrew Sale A geometric approach to the conjugacy problem

  7. Conjugacy Length Function G group with length function |·| : G → [0 , ∞ ) (e.g. word length if finitely generated). Definition (Conjugacy length function) CLF G : [0 , ∞ ) → [0 , ∞ ) minimal function satisfying: For x ≥ 0 , u, v ∈ G such that | u | + | v | ≤ x , then ∃ g ∈ G such that (i) gug − 1 = v and u is conjugate to v ⇐ ⇒ (ii) | g | ≤ CLF G ( x ) . Lemma Γ finitely generated with solvable WP, |·| word length. Then: Conjugacy problem is solvable ⇐ ⇒ CLF Γ is recursive. Andrew Sale A geometric approach to the conjugacy problem

  8. Example: free groups F free group, finite generating set X . e.g. u = aabbbaba − 1 u, v reduced words on X ∪ X − 1 . v = babababba − 1 b − 1 Andrew Sale A geometric approach to the conjugacy problem

  9. Example: free groups F free group, finite generating set X . e.g. u = aabbbaba − 1 u, v reduced words on X ∪ X − 1 . v = babababba − 1 b − 1 Algorithm to solve conjugacy problem Andrew Sale A geometric approach to the conjugacy problem

  10. Example: free groups F free group, finite generating set X . e.g. u = aabbbaba − 1 u, v reduced words on X ∪ X − 1 . v = babababba − 1 b − 1 Algorithm to solve conjugacy problem (i) u ′ = a − 1 ua = ab 3 ab (i) Cyclically reduce u, v to u ′ , v ′ , v ′ = ( ba ) − 1 vba = babab 2 Andrew Sale A geometric approach to the conjugacy problem

  11. Example: free groups F free group, finite generating set X . u = aabbbaba − 1 e.g. u, v reduced words on X ∪ X − 1 . v = babababba − 1 b − 1 Algorithm to solve conjugacy problem (i) u ′ = a − 1 ua = ab 3 ab (i) Cyclically reduce u, v to u ′ , v ′ , v ′ = ( ba ) − 1 vba = babab 2 (ii) Cyclically conjugate u ′ to v ′ . (ii) v ′ = babu ′ ( bab ) − 1 Andrew Sale A geometric approach to the conjugacy problem

  12. Example: free groups F free group, finite generating set X . u = aabbbaba − 1 e.g. u, v reduced words on X ∪ X − 1 . v = babababba − 1 b − 1 Algorithm to solve conjugacy problem (i) u ′ = a − 1 ua = ab 3 ab (i) Cyclically reduce u, v to u ′ , v ′ , v ′ = ( ba ) − 1 vba = babab 2 (ii) Cyclically conjugate u ′ to v ′ . (ii) v ′ = babu ′ ( bab ) − 1 The conjugator will be a product g = bababa − 1 of subwords of u and v . Hence v = gug − 1 CLF F ( x ) ≤ x. Andrew Sale A geometric approach to the conjugacy problem

  13. State of the art Known results include: Class of groups CLF( x ) Hyperbolic groups linear Bridson–Haefliger CAT(0) and biautomatic groups � exp( x ) Bridson–Haefliger RAAGs & special subgroups linear Crisp–Godelle–Wiest 2-Step Nilpotent quadratic Ji–Ogle–Ramsey � x 2 π 1 ( M ) where M prime 3 –manifold Behrstock–Drut ¸u, S � x 3 Free solvable groups S Plus: wreath products (S), group extensions (S), relatively hyperbolic groups (Ji–Ogle–Ramsey, Z. O’Conner, Bumagin). Andrew Sale A geometric approach to the conjugacy problem

  14. State of the art, continued Mapping class groups S connected, oriented surface of genus g and p punctures. Mod( S ) = Homeo + ( S ) / ∼ Andrew Sale A geometric approach to the conjugacy problem

  15. State of the art, continued Mapping class groups S connected, oriented surface of genus g and p punctures. Mod( S ) = Homeo + ( S ) / ∼ Theorem (Masur-Minsky ’00; Behrstock-Drut ¸u ’11; J. Tao ’13) CLF Mod( S ) ( x ) � x. Andrew Sale A geometric approach to the conjugacy problem

  16. State of the art, continued Mapping class groups S connected, oriented surface of genus g and p punctures. Mod( S ) = Homeo + ( S ) / ∼ Theorem (Masur-Minsky ’00; Behrstock-Drut ¸u ’11; J. Tao ’13) CLF Mod( S ) ( x ) � x. Question: What about for arithmetic groups? Or Out( F n ) ? Andrew Sale A geometric approach to the conjugacy problem

  17. Semisimple Lie groups G real semisimple Lie group, finite centre and no compact factors. d G left-invariant Riemannian metric. X = G/K associated symmetric space. Γ < G non-uniform lattice. e.g. SL n ( Z ) < SL n ( R ) and X = SL n ( R ) / SO( n ) . Andrew Sale A geometric approach to the conjugacy problem

  18. Semisimple Lie groups G real semisimple Lie group, finite centre and no compact factors. d G left-invariant Riemannian metric. X = G/K associated symmetric space. Γ < G non-uniform lattice. e.g. SL n ( Z ) < SL n ( R ) and X = SL n ( R ) / SO( n ) . Jordan decomposition: Each g ∈ G has unique decomposition as g = su where: s is semisimple (translates along an axis in X ); u is unipotent (fixes a point in the boundary of X ), and s, u commute. Andrew Sale A geometric approach to the conjugacy problem

  19. Complete Jordan decomposition Complete Jordan decomposition: Each g ∈ G has unique decomposition as g = kau where: k is elliptic a is real hyperbolic u is unipotent and k, a, u commute. Andrew Sale A geometric approach to the conjugacy problem

  20. Complete Jordan decomposition Complete Jordan decomposition: Each g ∈ G has unique decomposition as g = kau where: k is elliptic (fixes a point of X — a rotation); a is real hyperbolic u is unipotent and k, a, u commute. Andrew Sale A geometric approach to the conjugacy problem

  21. Complete Jordan decomposition Complete Jordan decomposition: Each g ∈ G has unique decomposition as g = kau where: k is elliptic (fixes a point of X — a rotation); a is real hyperbolic (translates along an axis, and all parallel axes ); u is unipotent and k, a, u commute. Andrew Sale A geometric approach to the conjugacy problem

  22. Complete Jordan decomposition Complete Jordan decomposition: Each g ∈ G has unique decomposition as g = kau where: k is elliptic (fixes a point of X — a rotation); a is real hyperbolic (translates along an axis, and all parallel axes ); u is unipotent (fixes a point in the boundary of X ), and k, a, u commute. Andrew Sale A geometric approach to the conjugacy problem

  23. Complete Jordan decomposition Complete Jordan decomposition: Each g ∈ G has unique decomposition as g = kau where: k is elliptic (fixes a point of X — a rotation); a is real hyperbolic (translates along an axis, and all parallel axes ); u is unipotent (fixes a point in the boundary of X ), and k, a, u commute. Andrew Sale A geometric approach to the conjugacy problem

  24. Conjugacy of real hyperbolic elements Slope Let a ∈ G be real hyperbolic. The slope of a tells you the location of translated geodesics in Weyl chambers. (It lies in ∂X/G ). Andrew Sale A geometric approach to the conjugacy problem

  25. Conjugacy of real hyperbolic elements Slope Let a ∈ G be real hyperbolic. The slope of a tells you the location of translated geodesics in Weyl chambers. (It lies in ∂X/G ). Theorem (S ’14) Fix slope ξ . Then there exists d ξ , ℓ ξ > 0 such that for a, b ∈ G real hyperbolic of slope ξ and such that | a | , | b | > d ξ Note: | a | = d G (1 , g ) Andrew Sale A geometric approach to the conjugacy problem

  26. Conjugacy of real hyperbolic elements Slope Let a ∈ G be real hyperbolic. The slope of a tells you the location of translated geodesics in Weyl chambers. (It lies in ∂X/G ). Theorem (S ’14) Fix slope ξ . Then there exists d ξ , ℓ ξ > 0 such that for a, b ∈ G real hyperbolic of slope ξ and such that | a | , | b | > d ξ a is conjugate to b ⇐ ⇒ ∃ g ∈ G such that (i) ga = bg and (ii) | g | ≤ ℓ ξ ( | a | + | b | ) . Note: | a | = d G (1 , g ) Andrew Sale A geometric approach to the conjugacy problem

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