groups representation theory and curves
play

Groups, Representation Theory, and Curves Adam Wood Department of - PowerPoint PPT Presentation

Groups, Representation Theory, and Curves Adam Wood Department of Mathematics University of Iowa MAA MathFest Great Talks for a General Audience August 3, 2019 Outline Introduction to (Modular) Representation Theory Representation Theory of


  1. Groups, Representation Theory, and Curves Adam Wood Department of Mathematics University of Iowa MAA MathFest Great Talks for a General Audience August 3, 2019

  2. Outline Introduction to (Modular) Representation Theory Representation Theory of Cyclic Groups Curves and Group Actions Space of Holomorphic Polydifferentials

  3. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8

  4. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 1

  5. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 2

  6. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 3

  7. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 4

  8. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 5

  9. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 6

  10. Groups 12 11 1 10 2 9 3 8 4 7 5 6 8 + 6 = 2 mod 12

  11. Groups 12 11 1 10 2 9 3 8 4 7 5 6 2 + 0 = 2

  12. Groups 12 11 1 10 2 9 3 8 4 7 5 6 2

  13. Groups 12 11 1 10 2 9 3 8 4 7 5 6 2 − 1

  14. Groups 12 11 1 10 2 9 3 8 4 7 5 6 2 − 2

  15. Groups 12 11 1 10 2 9 3 8 4 7 5 6 2 − 2 = 0

  16. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . }

  17. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } 4 + 3 = 7

  18. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } 4 + 3 = 7 4 + 0 = 4

  19. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } 4 + 3 = 7 4 + 0 = 4 4 + ( − 4) = 0

  20. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } Z is a set with operation + 4 + 3 = 7 4 + 0 = 4 4 + ( − 4) = 0

  21. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } Z is a set with operation + 4 + 3 = 7 Closure 4 + 0 = 4 4 + ( − 4) = 0

  22. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } Z is a set with operation + 4 + 3 = 7 Closure 4 + 0 = 4 Identity 4 + ( − 4) = 0

  23. Groups Z = { . . . , − 2 , − 1 , 0 , 1 , 2 , . . . } Z is a set with operation + 4 + 3 = 7 Closure 4 + 0 = 4 Identity 4 + ( − 4) = 0 Inverse

  24. Definition of a Group Definition A group is a set G with an operation · so that ◮ g · h ∈ G for all g , h ∈ G (closure) ◮ ( a · b ) · c = a · ( b · c ) for all a , b , c ∈ G (associativity) ◮ There is an identity e ∈ G satisfying e · g = g for all g ∈ G (identity) ◮ For every g ∈ G , there is an inverse element, g − 1 , so that g · g − 1 = e = g − 1 · g (inverse)

  25. Examples ◮ ( R − { 0 } , · )

  26. Examples ◮ ( R − { 0 } , · ) ◮ ( Z , +)

  27. Examples ◮ ( R − { 0 } , · ) ◮ ( Z , +) ◮ Z / 3 Z = { 0 , 1 , 2 } , addition modulo 3, 2 + 2 = 1

  28. Examples ◮ ( R − { 0 } , · ) ◮ ( Z , +) ◮ Z / 3 Z = { 0 , 1 , 2 } , addition modulo 3, 2 + 2 = 1 ◮ ( Z , · ) is NOT a group

  29. A Representation of a Group Definition Let G be a finite group and let k be a field. A representation of G is a group homomorphism ρ : G → GL ( V ) , where V is a vector space over k . For g ∈ G , we think of ρ ( g ) as an n × n matrix, where n is the dimension of V over k .

  30. Example: Symmetric Group Let G = S 3 . The permutation matrix ( a ij ) associated to σ ∈ S 3 satisfies � 1 if σ ( i ) = j a ij = 0 otherwise .

  31. Example: Symmetric Group Let G = S 3 . The permutation matrix ( a ij ) associated to σ ∈ S 3 satisfies � 1 if σ ( i ) = j a ij = 0 otherwise . For example, the permutation matrix associated to (1 2) is   0 1 0  . 1 0 0  0 0 1

  32. Example: Symmetric Group Let G = S 3 . The permutation matrix ( a ij ) associated to σ ∈ S 3 satisfies � 1 if σ ( i ) = j a ij = 0 otherwise . For example, the permutation matrix associated to (1 2) is   0 1 0  . 1 0 0  0 0 1 Let M σ denote the permutation matrix associated to σ . Then, ρ ( σ ) = M σ defines a representation of G called the permutation representation of G .

  33. Example: Dihedral Group Consider G = D 8 = � r , s | r 4 = 1 = s 2 , srs = r − 1 � .

  34. Example: Dihedral Group Consider G = D 8 = � r , s | r 4 = 1 = s 2 , srs = r − 1 � . � 0 � rotation by − 1 r 90 ◦ 1 0 � − 1 � reflection 0 s about y -axis 0 1

  35. Example: Dihedral Group Consider G = D 8 = � r , s | r 4 = 1 = s 2 , srs = r − 1 � . � 0 � rotation by − 1 r 90 ◦ 1 0 � − 1 � reflection 0 s about y -axis 0 1

  36. Example: Dihedral Group Consider G = D 8 = � r , s | r 4 = 1 = s 2 , srs = r − 1 � . � 0 � rotation by − 1 r 90 ◦ 1 0 � − 1 � reflection 0 s about y -axis 0 1

  37. Example: Dihedral Group Consider G = D 8 = � r , s | r 4 = 1 = s 2 , srs = r − 1 � . � 0 � rotation by − 1 r 90 ◦ 1 0 � − 1 � reflection 0 s about y -axis 0 1 � 0 � � − 1 � − 1 0 ρ : G → M 2 ( C ) defined by ρ ( r ) = and ρ ( s ) = 1 0 0 1 defines a representation of G .

  38. Subrepresentations and Direct Sums Definition (Direct Sum) � V � 0 V ⊕ W = 0 W

  39. Subrepresentations and Direct Sums Definition (Direct Sum) � V � 0 V ⊕ W = 0 W V and W are subrepresentations of the direct sum of V and W

  40. Subrepresentations and Direct Sums Definition (Direct Sum) � V � 0 V ⊕ W = 0 W V and W are subrepresentations of the direct sum of V and W BUT, there are more subrepresentations

  41. Irreducible and Indecomposable Representations Definition A representation V of G is called simple or irreducible if the only subrepresentations of V are 0 and V .

  42. Irreducible and Indecomposable Representations Definition A representation V of G is called simple or irreducible if the only subrepresentations of V are 0 and V . Definition A representation V is called indecomposable if whenever V = U ⊕ W is a direct sum decomposition of V , either U or W is zero.

  43. Irreducible and Indecomposable Representations Definition A representation V of G is called simple or irreducible if the only subrepresentations of V are 0 and V . Definition A representation V is called indecomposable if whenever V = U ⊕ W is a direct sum decomposition of V , either U or W is zero. Note that simple = ⇒ indecomposable but

  44. Irreducible and Indecomposable Representations Definition A representation V of G is called simple or irreducible if the only subrepresentations of V are 0 and V . Definition A representation V is called indecomposable if whenever V = U ⊕ W is a direct sum decomposition of V , either U or W is zero. Note that simple = ⇒ indecomposable but indecomposable � = ⇒ simple .

  45. Characteristic of a Field Z / p Z = { 0 , 1 , . . . , p − 1 } Two types of fields: Characteristic zero Prime characteristic Think of: C , Q F p

  46. Characteristic of a Field F p = { 0 , 1 , . . . , p − 1 }

  47. Characteristic of a Field F p = { 0 , 1 , . . . , p − 1 } Two types of fields: ◦ Characteristic zero ◦ Prime characteristic

  48. Characteristic of a Field F p = { 0 , 1 , . . . , p − 1 } Two types of fields: ◦ Characteristic zero ◦ Prime characteristic Think of: ◦ C , Q ◦ F p

  49. Modular Representation Theory Study of representations of G over k , field of prime characteristic

  50. Modular Representation Theory Study of representations of G over k , field of prime characteristic Every representation can be written as a direct sum of indecomposable representations.

  51. Modular Representation Theory Study of representations of G over k , field of prime characteristic Every representation can be written as a direct sum of indecomposable representations. Understand the indecomposable representations

  52. Representations of Cyclic p -groups ◮ G cyclic of order p n

  53. Representations of Cyclic p -groups ◮ G cyclic of order p n ◮ The representation theory is “nice”

  54. Representations of Cyclic p -groups ◮ G cyclic of order p n ◮ The representation theory is “nice” ◮ Finitely many indecomposable representations, know how to describe them

  55. Representations of Cyclic p -groups ◮ G cyclic of order p n ◮ The representation theory is “nice” ◮ Finitely many indecomposable representations, know how to describe them ◮ Can be extended to other groups

  56. Example: Cyclic Group Consider G = Z / 3 Z = { 0 , 1 , 2 } , σ = 1, char( k ) = 3

  57. Example: Cyclic Group Consider G = Z / 3 Z = { 0 , 1 , 2 } , σ = 1, char( k ) = 3 Indecomposable Representations   1 1 0 � 1 � 1 σ �→ (1) σ �→ σ �→ 0 1 1   0 1 0 0 1 Trivial Dimension 2 Dimension 3 Representation Representation Representation

  58. Visualization of Representations of the Cyclic Group Let G be a cyclic group of order p n and let k be a field of characteristic p . Brauer Tree: ◦ • p n − 1 Quiver: • α α p n = 0

  59. Curves and Group Actions Goal: Define a representation of a group using geometry

  60. Curves and Group Actions Goal: Define a representation of a group using geometry ◮ Define an algebraic curve

  61. Curves and Group Actions Goal: Define a representation of a group using geometry ◮ Define an algebraic curve ◮ Group actions on curves

  62. Curves and Group Actions Goal: Define a representation of a group using geometry ◮ Define an algebraic curve ◮ Group actions on curves ◮ Define a representation using geometry

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