DOCSLIB.ORG

Conjugacy Classes and Group Representations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Conjugacy classes and group representations David Vogan Introduction Conjugacy classes and group Groups representations Conj classes Repn theory Symmetric groups David Vogan Groups of matrices Conclusion Department of Mathematics Massachusetts Institute of Technology John U. Free Seminar Eastern Nazarene College February 26, 2016 Conjugacy classes Outline and group representations David Vogan What’s representation theory about? Introduction Groups Abstract symmetry and groups Conj classes Repn theory Symmetric groups Conjugacy classes Groups of matrices Conclusion Representation theory Symmetric groups and partitions Matrices and eigenvalues Conclusion Conjugacy classes The talk in one slide and group representations David Vogan Introduction Three topics. Groups Conj classes 1. GROUPS: abstract way to think about symmetry. Repn theory 2. CONJUGACY CLASSES: organizing group elements. Symmetric groups 3. REPRESENTATIONS: linear algebra and group theory. Groups of matrices crude Representations of G ! conjugacy classes in G. Conclusion Better: relation is like duality for vector spaces. dim(reps), size(conj classes) ! noncommutativity. ?? dim(representation) ! (size)1=2(conjugacy class). Talk is about examples of all these things. Conjugacy classes Two cheers for linear algebra and group representations David Vogan My favorite mathematics is linear algebra. Introduction Complicated enough to describe interesting stuff. Groups Simple enough to calculate with. Conj classes Repn theory Linear map T : V ! V eigenvalues, eigenvectors. Symmetric groups First example: V = fns on R, S = chg vars x 7! −x. Groups of matrices Eigvals: ±1. Eigenspace for +1: even fns (like cos(x)). Conclusion Eigenspace for −1: odd functions (like sin(x)). Linear algebra says: to study sign changes in x, write fns using even and odd fns. d Second example: V = functions on R, T = dx . Eigenvals: λ 2 C. Eigenspace for λ: multiples of eλx . d Linear algebra says: to study dx , write functions using exponentials eλx . Conjugacy classes The third cheer for linear algebra and group representations David Vogan Introduction Best part about linear algebra is noncommutativity... Groups 7! − d Third example: V = fns on R, S = (x x), T = dx . Conj classes S and T don’t commute; can’t diagonalize both. Repn theory Symmetric groups Only common eigenvectors are constant fns. Groups of matrices Representation theory idea: look at smallest subspaces Conclusion preserved by both S and T. λx −λx W±λ = h e ; e i = hcosh(λx); sinh(λx)i. | {z } | {z } | {z } eigenfns of d=dt even odd These two bases of W±λ are good for different things. First for solving diff eqs, second for describing bridge cable. No one basis is good for everything. Conjugacy classes Six symmetries of a triangle and group representations Basic idea in mathematics is symmetry. David Vogan A symmetry of something is a way of rearranging it so that nothing you care about changes. Introduction Groups B C Conj classes J J Repn theory s J s J¨¨ ¨ Symmetric groups J ¨ J J ¨ ¨ J Groups of matrices A C A B Conclusion B C B s s s s J J J s J s J s J J J J J J J A C B A C A A A s s s s s s J J s J HH s J J HH J J HHJ C B B C s s s s Conjugacy classes Composing symmetries and group representations David Vogan What you can do with symmetries is compose them. Introduction Groups If g and h are symmetries, so is Conj classes Repn theory ◦ = g h def first do h, then do g Symmetric groups Groups of matrices 4 example: if r = rotate 240◦, r = rotate 120◦, 240 120 Conclusion ◦ ◦ r240 ◦ r120 = rotate (240 + 120 ) = do nothing = r0: ◦ Harder: if r240 = rotate 240 , sA = reflection fixing A, r240 ◦ sA = exchange B and C, then A ! B ! C ! A = (A ! B; B ! A; C ! C) = sC : Conjugacy classes Composition law for triangle symmetries and group representations David Vogan We saw that the triangle has six symmetries: Introduction Groups r0 r120 r240 rotations Conj classes sA sB sC reflections: Repn theory Symmetric groups Here is how you compose them. Groups of matrices Conclusion ◦ r0 r120 r240 sA sB sC r0 r0 r120 r240 sA sB sC r120 r120 r240 r0 sB sC sA r240 r240 r0 r120 sC sA sB sA sA sC sB r0 r240 r120 sB sB sA sC r120 r0 r240 sC sC sB sA r240 r120 r0 This is the multiplication table for triangle symmetries. Conjugacy classes Abstract groups and group representations David Vogan An abstract group is a multiplication table: a set G with a product ◦ taking g; h 2 G and giving g ◦ h 2 G. Introduction Product ◦ is required to have some properties (that are Groups automatic for composition of symmetries. ) Conj classes 1. ASSOCIATIVITY: g ◦ (h ◦ k)=( g ◦ h) ◦ k (g; h; k 2 G); Repn theory 2. there’s an IDENTITY e 2 G: e ◦ g = g (g 2 G); Symmetric groups 3. each g 2 G has INVERSE g−1 2 G, g−1 ◦ g = e. Groups of matrices Conclusion For symmetries, these properties are always true: 1. first doing( k then h), then doing g, is the same as first doing k, then doing( h then g); 2. doing g then doing nothing is the same as just doing g; 3. undoing a symmetry (putting things back where you found them) is also a symmetry. Here’s an example of a group with ◦ e s just two elements e and s. In fact e e s it’s the only example. s s e Conjugacy classes Approaching symmetry and group representations David Vogan Normal person’s approach to symmetry: Introduction 1. look at something interesting; Groups 2. find the symmetries. Conj classes This approach standard model in physics. Repn theory Explains everything that you can see without LIGO. Symmetric groups Groups of matrices Mathematician’s approach to symmetry: Conclusion 1. find all multiplication tables for abstract groups; 2. pick an interesting abstract group; 3. find something it’s the symmetry group of; 4. decide that something must be interesting. This approach Conway group (which has 8,315,553,613,086,720,000 elements) and Leech lattice (critical for packing 24-dimensional cannonballs). Anyway, I’m a mathematician. Conjugacy classes Which symmetries are really different? and group representations Here are some of the symmetries of a triangle: David Vogan B C B Introduction J J J sJ sJ ¨ sJ Groups J ¨¨J J ¨ Conj classes J ¨ J J A C A B C A Repn theory e = do nothing s = flip (B; C) s = flip (A; C) s s sA s sB s Symmetric groups sA and sB are “same thing” from different points of view. Groups of matrices Conclusion Can accomplish sB in three steps: (A; B; C) 1. flip (A; B) (apply sC ); (B; A; C) 2. flip (B; C) (apply sA ); (C; A; B) −1 3. unflip (A; B) (apply sC ). (C; B; A) −1 Summary: sB = sC sA sC . Defn. g; h conjugate if there’s k 2 G so h = k −1gk. Three conjugacy classes of symmetries of triangle: three reflections sA , sB , sC (exchange two vertices); two rotations r120, r240 (cyclically permute vertices); one trivial symmetry r0 (do nothing). Conjugacy classes Conjugacy classes and group representations David Vogan Introduction G any group; elements g and h in G are conjugate if Groups there’s k in G so h = k −1gk. Conj classes Repn theory Conjugacy class in G is an equivalence class. Symmetric groups G = disjoint union of conjugacy classes Groups of matrices Example: 4 symms = freflsg [ frotnsg [ fidentityg. Conclusion | {z } |{z} | {z } | {z } 6 elts 3 elts 2 elts 1 elt 6 = 3 + 2 + 1 is class eqn for triangle symms. G is abelian if gh = hg (g; h 2 G ). G is abelian ! each conjugacy class is one element. Size of conjugacy classes ! how non-abelian G is. Conjugacy classes Conjugacy classes in Sn and group representations David Vogan Sn =def all( n!) rearrangements of f1; 2;:::; ng. Introduction = Symmetries of (n − 1)-simplex: join n equidistant pts. Groups Conj classes S3 = 6 symms of triangle; S4 = 24 symms of reg tetrahedron. 1 2 3 4 5 Repn theory Typical rearrangement for n = 5: g = 3 5 4 1 2 . Symmetric groups What g does: (1 ! 3 ! 4 ! 1)(2 ! 5 ! 2). Groups of matrices Shorthand: g = (134)(25): cycle (134) and (25) Conclusion 1 2 3 4 5 This g is conjugate to h = (125)(34) = 2 5 4 3 1 . Theorem Any elt of Sn is a product of disjt cycles of P sizes p1 ≥ p2 ≥ · · · ≥ pr , pj = n. Two elts are conjugate ! have same cycle sizes. P Definition Partition of n is p1 ≥ p2 ≥ · · · ≥ pr , pj = n. Corollary Conj classes in Sn ! partitions of n. Conjugacy classes Gelfand program. and group representations David Vogan . for using groups to do other math. Introduction Groups Say G is a group of symmetries of X. Conj classes Repn theory Step 1: LINEARIZE. X V(X) vec space of fns on X. Symmetric groups Now G acts by linear maps. Groups of matrices Step 2: DIAGONALIZE. Decompose V(X) into minimal Conclusion G-invariant subspaces. Step 3: REPRESENTATION THEORY. Understand all ways that G can act by linear maps. Step 4: PRETENDING TO BE SMART. Use understanding of V(X) to answer questions about X. One hard step is3: how can G act by linear maps? Conjugacy classes Definition of representation and group representations David Vogan Introduction G group; representation of G is Groups 1. (complex) vector space V, and Conj classes 2. collection of linear maps fπ(g): V ! V j g 2 Gg Repn theory subject to π(g)π(h) = π(gh); π(e) = identity.
Recommended publications
  • Arithmetic Equivalence and Isospectrality

    Arithmetic Equivalence and Isospectrality

    ARITHMETIC EQUIVALENCE AND ISOSPECTRALITY ANDREW V.SUTHERLAND ABSTRACT. In these lecture notes we give an introduction to the theory of arithmetic equivalence, a notion originally introduced in a number theoretic setting to refer to number fields with the same zeta function. Gassmann established a direct relationship between arithmetic equivalence and a purely group theoretic notion of equivalence that has since been exploited in several other areas of mathematics, most notably in the spectral theory of Riemannian manifolds by Sunada. We will explicate these results and discuss some applications and generalizations. 1. AN INTRODUCTION TO ARITHMETIC EQUIVALENCE AND ISOSPECTRALITY Let K be a number field (a finite extension of Q), and let OK be its ring of integers (the integral closure of Z in K). The Dedekind zeta function of K is defined by the Dirichlet series X s Y s 1 ζK (s) := N(I)− = (1 N(p)− )− I OK p − ⊆ where the sum ranges over nonzero OK -ideals, the product ranges over nonzero prime ideals, and N(I) := [OK : I] is the absolute norm. For K = Q the Dedekind zeta function ζQ(s) is simply the : P s Riemann zeta function ζ(s) = n 1 n− . As with the Riemann zeta function, the Dirichlet series (and corresponding Euler product) defining≥ the Dedekind zeta function converges absolutely and uniformly to a nonzero holomorphic function on Re(s) > 1, and ζK (s) extends to a meromorphic function on C and satisfies a functional equation, as shown by Hecke [25]. The Dedekind zeta function encodes many features of the number field K: it has a simple pole at s = 1 whose residue is intimately related to several invariants of K, including its class number, and as with the Riemann zeta function, the zeros of ζK (s) are intimately related to the distribution of prime ideals in OK .
  • NOTES on FINITE GROUP REPRESENTATIONS in Fall 2020, I

    NOTES on FINITE GROUP REPRESENTATIONS in Fall 2020, I

    NOTES ON FINITE GROUP REPRESENTATIONS CHARLES REZK In Fall 2020, I taught an undergraduate course on abstract algebra. I chose to spend two weeks on the theory of complex representations of finite groups. I covered the basic concepts, leading to the classification of representations by characters. I also briefly addressed a few more advanced topics, notably induced representations and Frobenius divisibility. I'm making the lectures and these associated notes for this material publicly available. The material here is standard, and is mainly based on Steinberg, Representation theory of finite groups, Ch 2-4, whose notation I will mostly follow. I also used Serre, Linear representations of finite groups, Ch 1-3.1 1. Group representations Given a vector space V over a field F , we write GL(V ) for the group of bijective linear maps T : V ! V . n n When V = F we can write GLn(F ) = GL(F ), and identify the group with the group of invertible n × n matrices. A representation of a group G is a homomorphism of groups φ: G ! GL(V ) for some representation choice of vector space V . I'll usually write φg 2 GL(V ) for the value of φ on g 2 G. n When V = F , so we have a homomorphism φ: G ! GLn(F ), we call it a matrix representation. matrix representation The choice of field F matters. For now, we will look exclusively at the case of F = C, i.e., representations in complex vector spaces. Remark. Since R ⊆ C is a subfield, GLn(R) is a subgroup of GLn(C).
  • Class Numbers of Totally Real Number Fields

    Class Numbers of Totally Real Number Fields

    CLASS NUMBERS OF TOTALLY REAL NUMBER FIELDS BY JOHN C. MILLER A dissertation submitted to the Graduate School|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Mathematics Written under the direction of Henryk Iwaniec and approved by New Brunswick, New Jersey May, 2015 ABSTRACT OF THE DISSERTATION Class numbers of totally real number fields by John C. Miller Dissertation Director: Henryk Iwaniec The determination of the class number of totally real fields of large discriminant is known to be a difficult problem. The Minkowski bound is too large to be useful, and the root discriminant of the field can be too large to be treated by Odlyzko's discriminant bounds. This thesis describes a new approach. By finding nontrivial lower bounds for sums over prime ideals of the Hilbert class field, we establish upper bounds for class numbers of fields of larger discriminant. This analytic upper bound, together with algebraic arguments concerning the divisibility properties of class numbers, allows us to determine the class numbers of many number fields that have previously been untreatable by any known method. For example, we consider the cyclotomic fields and their real subfields. Surprisingly, the class numbers of cyclotomic fields have only been determined for fields of small conductor, e.g. for prime conductors up to 67, due to the problem of finding the class number of its maximal real subfield, a problem first considered by Kummer. Our results have significantly improved the situation. We also study the cyclotomic Zp-extensions of the rationals.
  • REPRESENTATION THEORY WEEK 7 1. Characters of GL Kand Sn A

    REPRESENTATION THEORY WEEK 7 1. Characters of GL Kand Sn A

    REPRESENTATION THEORY WEEK 7 1. Characters of GLk and Sn A character of an irreducible representation of GLk is a polynomial function con- stant on every conjugacy class. Since the set of diagonalizable matrices is dense in GLk, a character is defined by its values on the subgroup of diagonal matrices in GLk. Thus, one can consider a character as a polynomial function of x1,...,xk. Moreover, a character is a symmetric polynomial of x1,...,xk as the matrices diag (x1,...,xk) and diag xs(1),...,xs(k) are conjugate for any s ∈ Sk. For example, the character of the standard representation in E is equal to x1 + ⊗n n ··· + xk and the character of E is equal to (x1 + ··· + xk) . Let λ = (λ1,...,λk) be such that λ1 ≥ λ2 ≥ ···≥ λk ≥ 0. Let Dλ denote the λj determinant of the k × k-matrix whose i, j entry equals xi . It is clear that Dλ is a skew-symmetric polynomial of x1,...,xk. If ρ = (k − 1,..., 1, 0) then Dρ = i≤j (xi − xj) is the well known Vandermonde determinant. Let Q Dλ+ρ Sλ = . Dρ It is easy to see that Sλ is a symmetric polynomial of x1,...,xk. It is called a Schur λ1 λk polynomial. The leading monomial of Sλ is the x ...xk (if one orders monomials lexicographically) and therefore it is not hard to show that Sλ form a basis in the ring of symmetric polynomials of x1,...,xk. Theorem 1.1. The character of Wλ equals to Sλ. I do not include a proof of this Theorem since it uses beautiful but hard combina- toric.
  • Problem 1 Show That If Π Is an Irreducible Representation of a Compact Lie Group G Then Π∨ Is Also Irreducible

    Problem 1 Show That If Π Is an Irreducible Representation of a Compact Lie Group G Then Π∨ Is Also Irreducible

    Problem 1 Show that if π is an irreducible representation of a compact lie group G then π_ is also irreducible. Give an example of a G and π such that π =∼ π_, and another for which π π_. Is this true for general groups? R 2 Since G is a compact Lie group, we can apply Schur orthogonality to see that G jχπ_ (g)j dg = R 2 R 2 _ G jχπ(g)j dg = G jχπ(g)j dg = 1, so π is irreducible. For any G, the trivial representation π _ i i satisfies π ' π . For G the cyclic group of order 3 generated by g, the representation π : g 7! ζ3 _ i −i is not isomorphic to π : g 7! ζ3 . This is true for finite dimensional irreducible representations. This follows as if W ⊆ V a proper, non-zero G-invariant representation for a group G, then W ? = fφ 2 V ∗jφ(W ) = 0g is a proper, non-zero G-invariant subspace and applying this to V ∗ as V ∗∗ =∼ V we get V is irreducible if and only if V ∗ is irreducible. This is false for general representations and general groups. Take G = S1 to be the symmetric group on countably infinitely many letters, and let G act on a vector space V over C with basis e1; e2; ··· by sending σ : ei 7! eσ(i). Let W be the sub-representation given by the kernel of the map P P V ! C sending λiei 7! λi. Then W is irreducible because given any λ1e1 + ··· + λnen 2 V −1 where λn 6= 0, and we see that λn [(n n + 1) − 1] 2 C[G] sends this to en+1 − en, and elements like ∗ ∗ this span W .
  • Mathematics of the Rubik's Cube

    Mathematics of the Rubik's Cube

    Mathematics of the Rubik's cube Associate Professor W. D. Joyner Spring Semester, 1996{7 2 \By and large it is uniformly true that in mathematics that there is a time lapse between a mathematical discovery and the moment it becomes useful; and that this lapse can be anything from 30 to 100 years, in some cases even more; and that the whole system seems to function without any direction, without any reference to usefulness, and without any desire to do things which are useful." John von Neumann COLLECTED WORKS, VI, p. 489 For more mathematical quotes, see the first page of each chapter below, [M], [S] or the www page at http://math.furman.edu/~mwoodard/mquot. html 3 \There are some things which cannot be learned quickly, and time, which is all we have, must be paid heavily for their acquiring. They are the very simplest things, and because it takes a man's life to know them the little new that each man gets from life is very costly and the only heritage he has to leave." Ernest Hemingway (From A. E. Hotchner, PAPA HEMMINGWAY, Random House, NY, 1966) 4 Contents 0 Introduction 13 1 Logic and sets 15 1.1 Logic................................ 15 1.1.1 Expressing an everyday sentence symbolically..... 18 1.2 Sets................................ 19 2 Functions, matrices, relations and counting 23 2.1 Functions............................. 23 2.2 Functions on vectors....................... 28 2.2.1 History........................... 28 2.2.2 3 × 3 matrices....................... 29 2.2.3 Matrix multiplication, inverses.............. 30 2.2.4 Muliplication and inverses...............
  • Extending Real-Valued Characters of Finite General Linear and Unitary Groups on Elements Related to Regular Unipotents

    Extending Real-Valued Characters of Finite General Linear and Unitary Groups on Elements Related to Regular Unipotents

    EXTENDING REAL-VALUED CHARACTERS OF FINITE GENERAL LINEAR AND UNITARY GROUPS ON ELEMENTS RELATED TO REGULAR UNIPOTENTS ROD GOW AND C. RYAN VINROOT Abstract. Let GL(n; Fq)hτi and U(n; Fq2 )hτi denote the finite general linear and unitary groups extended by the transpose inverse automorphism, respec- tively, where q is a power of p. Let n be odd, and let χ be an irreducible character of either of these groups which is an extension of a real-valued char- acter of GL(n; Fq) or U(n; Fq2 ). Let yτ be an element of GL(n; Fq)hτi or 2 U(n; Fq2 )hτi such that (yτ) is regular unipotent in GL(n; Fq) or U(n; Fq2 ), respectively. We show that χ(yτ) = ±1 if χ(1) is prime to p and χ(yτ) = 0 oth- erwise. Several intermediate results on real conjugacy classes and real-valued characters of these groups are obtained along the way. 1. Introduction Let F be a field and let n be a positive integer. Let GL(n; F) denote the general linear group of degree n over F. In the special case that F is the finite field of order q, we denote the corresponding general linear group by GL(n; Fq). Let τ denote the involutory automorphism of GL(n; F) which maps an element g to its transpose inverse (g0)−1, where g0 denotes the transpose of g, and let GL(n; F)hτi denote the semidirect product of GL(n; F) by τ. Thus in GL(n; F)hτi, we have τ 2 = 1 and τgτ = (g0)−1 for g 2 GL(n; F).
  • Math 263A Notes: Algebraic Combinatorics and Symmetric Functions

    Math 263A Notes: Algebraic Combinatorics and Symmetric Functions

    MATH 263A NOTES: ALGEBRAIC COMBINATORICS AND SYMMETRIC FUNCTIONS AARON LANDESMAN CONTENTS 1. Introduction 4 2. 10/26/16 5 2.1. Logistics 5 2.2. Overview 5 2.3. Down to Math 5 2.4. Partitions 6 2.5. Partial Orders 7 2.6. Monomial Symmetric Functions 7 2.7. Elementary symmetric functions 8 2.8. Course Outline 8 3. 9/28/16 9 3.1. Elementary symmetric functions eλ 9 3.2. Homogeneous symmetric functions, hλ 10 3.3. Power sums pλ 12 4. 9/30/16 14 5. 10/3/16 20 5.1. Expected Number of Fixed Points 20 5.2. Random Matrix Groups 22 5.3. Schur Functions 23 6. 10/5/16 24 6.1. Review 24 6.2. Schur Basis 24 6.3. Hall Inner product 27 7. 10/7/16 29 7.1. Basic properties of the Cauchy product 29 7.2. Discussion of the Cauchy product and related formulas 30 8. 10/10/16 32 8.1. Finishing up last class 32 8.2. Skew-Schur Functions 33 8.3. Jacobi-Trudi 36 9. 10/12/16 37 1 2 AARON LANDESMAN 9.1. Eigenvalues of unitary matrices 37 9.2. Application 39 9.3. Strong Szego limit theorem 40 10. 10/14/16 41 10.1. Background on Tableau 43 10.2. KOSKA Numbers 44 11. 10/17/16 45 11.1. Relations of skew-Schur functions to other fields 45 11.2. Characters of the symmetric group 46 12. 10/19/16 49 13. 10/21/16 55 13.1.
  • Chapter 3: Transformations Groups, Orbits, and Spaces of Orbits

    Chapter 3: Transformations Groups, Orbits, and Spaces of Orbits

    Preprint typeset in JHEP style - HYPER VERSION Chapter 3: Transformations Groups, Orbits, And Spaces Of Orbits Gregory W. Moore Abstract: This chapter focuses on of group actions on spaces, group orbits, and spaces of orbits. Then we discuss mathematical symmetric objects of various kinds. May 3, 2019 -TOC- Contents 1. Introduction 2 2. Definitions and the stabilizer-orbit theorem 2 2.0.1 The stabilizer-orbit theorem 6 2.1 First examples 7 2.1.1 The Case Of 1 + 1 Dimensions 11 3. Action of a topological group on a topological space 14 3.1 Left and right group actions of G on itself 19 4. Spaces of orbits 20 4.1 Simple examples 21 4.2 Fundamental domains 22 4.3 Algebras and double cosets 28 4.4 Orbifolds 28 4.5 Examples of quotients which are not manifolds 29 4.6 When is the quotient of a manifold by an equivalence relation another man- ifold? 33 5. Isometry groups 34 6. Symmetries of regular objects 36 6.1 Symmetries of polygons in the plane 39 3 6.2 Symmetry groups of some regular solids in R 42 6.3 The symmetry group of a baseball 43 7. The symmetries of the platonic solids 44 7.1 The cube (\hexahedron") and octahedron 45 7.2 Tetrahedron 47 7.3 The icosahedron 48 7.4 No more regular polyhedra 50 7.5 Remarks on the platonic solids 50 7.5.1 Mathematics 51 7.5.2 History of Physics 51 7.5.3 Molecular physics 51 7.5.4 Condensed Matter Physics 52 7.5.5 Mathematical Physics 52 7.5.6 Biology 52 7.5.7 Human culture: Architecture, art, music and sports 53 7.6 Regular polytopes in higher dimensions 53 { 1 { 8.
  • Finiteness of $ Z $-Classes in Reductive Groups

    Finiteness of $ Z $-Classes in Reductive Groups

    FINITENESS OF z-CLASSES IN REDUCTIVE GROUPS SHRIPAD M. GARGE. AND ANUPAM SINGH. Abstract. Let k be a perfect field such that for every n there are only finitely many field extensions, up to isomorphism, of k of degree n. If G is a reductive algebraic group defined over k, whose characteristic is very good for G, then we prove that G(k) has only finitely many z-classes. For each perfect field k which does not have the above finiteness property we show that there exist groups G over k such that G(k) has infinitely many z-classes. 1. Introduction Let G be a group. A G-set is a non-empty set X admitting an action of the group G. Two G-sets X and Y are called G-isomorphic if there is a bijection φ : X → Y which commutes with the G-actions on X and Y . If the G-sets X and Y are transitive, say X = Gx and Y = Gy for some x ∈ X and y ∈ Y , then X and Y are G-isomorphic if and only if the stabilizers Gx and Gy of x and y, respectively, in G are conjugate as subgroups of G. One of the most important group actions is the conjugation action of a group G on itself. It partitions the group G into its conjugacy classes which are orbits under this action. However, from the point of view of G-action, it is more natural to partition the group G into sets consisting of conjugacy classes which are G- arXiv:2001.06359v1 [math.GR] 17 Jan 2020 isomorphic to each other.
  • GROUP REPRESENTATIONS and CHARACTER THEORY Contents 1

    GROUP REPRESENTATIONS and CHARACTER THEORY Contents 1

    GROUP REPRESENTATIONS AND CHARACTER THEORY DAVID KANG Abstract. In this paper, we provide an introduction to the representation theory of finite groups. We begin by defining representations, G-linear maps, and other essential concepts before moving quickly towards initial results on irreducibility and Schur's Lemma. We then consider characters, class func- tions, and show that the character of a representation uniquely determines it up to isomorphism. Orthogonality relations are introduced shortly afterwards. Finally, we construct the character tables for a few familiar groups. Contents 1. Introduction 1 2. Preliminaries 1 3. Group Representations 2 4. Maschke's Theorem and Complete Reducibility 4 5. Schur's Lemma and Decomposition 5 6. Character Theory 7 7. Character Tables for S4 and Z3 12 Acknowledgments 13 References 14 1. Introduction The primary motivation for the study of group representations is to simplify the study of groups. Representation theory offers a powerful approach to the study of groups because it reduces many group theoretic problems to basic linear algebra calculations. To this end, we assume that the reader is already quite familiar with linear algebra and has had some exposure to group theory. With this said, we begin with a preliminary section on group theory. 2. Preliminaries Definition 2.1. A group is a set G with a binary operation satisfying (1) 8 g; h; i 2 G; (gh)i = g(hi)(associativity) (2) 9 1 2 G such that 1g = g1 = g; 8g 2 G (identity) (3) 8 g 2 G; 9 g−1 such that gg−1 = g−1g = 1 (inverses) Definition 2.2.
  • Math 3230 Abstract Algebra I Sec 3.7: Conjugacy Classes

    Math 3230 Abstract Algebra I Sec 3.7: Conjugacy Classes

    Math 3230 Abstract Algebra I Sec 3.7: Conjugacy classes Slides created by M. Macauley, Clemson (Modified by E. Gunawan, UConn) http://egunawan.github.io/algebra Abstract Algebra I Sec 3.7 Conjugacy classes Abstract Algebra I 1 / 13 Conjugation Recall that for H ≤ G, the conjugate subgroup of H by a fixed g 2 G is gHg −1 = fghg −1 j h 2 Hg : Additionally, H is normal iff gHg −1 = H for all g 2 G. We can also fix the element we are conjugating. Given x 2 G, we may ask: \which elements can be written as gxg −1 for some g 2 G?" The set of all such elements in G is called the conjugacy class of x, denoted clG (x). Formally, this is the set −1 clG (x) = fgxg j g 2 Gg : Remarks −1 In any group, clG (e) = feg, because geg = e for any g 2 G. −1 If x and g commute, then gxg = x. Thus, when computing clG (x), we only need to check gxg −1 for those g 2 G that do not commute with x. Moreover, clG (x) = fxg iff x commutes with everything in G. (Why?) Sec 3.7 Conjugacy classes Abstract Algebra I 2 / 13 Conjugacy classes Proposition 1 Conjugacy is an equivalence relation. Proof Reflexive: x = exe−1. Symmetric: x = gyg −1 ) y = g −1xg. −1 −1 −1 Transitive: x = gyg and y = hzh ) x = (gh)z(gh) . Since conjugacy is an equivalence relation, it partitions the group G into equivalence classes (conjugacy classes). Let's compute the conjugacy classes in D4.