Character Tables of Some Selected Groups of Extension Type Using Fischer-Clifford Matrices

Total Page:16

File Type:pdf, Size:1020Kb

Character Tables of Some Selected Groups of Extension Type Using Fischer-Clifford Matrices Character Tables of Some Selected Groups of Extension Type Using Fischer-Clifford Matrices by R.L. Monaledi A thesis submitted in fulfilment of the requirements for the degree of M.Sc in the Department of Mathematics and Applied Mathematics, University of the Western Cape Supervisor: Prof. R. Fray Co-supervisor: Dr. A.L. Prins December 2015 Declaration I declare that Character Tables of Some Selected Groups of Extension Type Using Fischer- Clifford Matrices is my own work, that it has not been submitted before for any degree or assessment to any other university, and that all the sources that I have used or quoted have been indicated and acknowledged by means of complete references. ........................... R. L. Monaledi December 2015 ii Abstract The aim of this dissertation is to calculate character tables of group extensions. There are several well{developed methods for calculating the character tables of some selected group extensions. The method we study in this dissertation, is a standard application of Clifford theory, made efficient by the use of Fischer-Clifford matrices, as introduced by Fischer. We consider only extensions G of the normal subgroup N by the subgroup G with the property that every irreducible character of N can be extended to an irreducible character of its inertia group in G, if N is abelian. This is indeed the case if G is a split extension, by a well known theorem of Mackey. A brief outline of the classical theory of characters pertinent to this study, is followed by a discussion on the calculation of the conjugacy classes of extension groups by the method of coset analysis. The Clifford theory which provide the basis for the theory of Fischer- Clifford matrices is discussed in detail. Some of the properties of these Fischer-Clifford matrices which make their calculation much easier, are also given. We restrict ourselves to split extension groups G = N:G in which N is always an el- ementary abelian 2-group. In this thesis we are concerned with the construction of the character tables (by means of the technique of Fischer-Clifford matrices) of certain ex- + tension groups which are associated with the orthogonal group O10(2), the automorphism groups U6(2):2, U6(2):3 of the unitary group U6(2) and the smallest Fischer sporadic sim- iii 8 9 9 ple group F i22. These groups are of the type 2 :(U4(2):2), (2 :L3(4)):2, (2 :L3(4)):3 and 6 5 2 :(2 :S6). iv Acknowledgement I would like to bear witness to our Lord Jesus Christ, for being my ultimate frame of reference. I would like to thank Him for all the blessings He bestowed on me. I would like to express my gratitude to the following people for their invaluable support: • my supervisor, Prof R.L. Fray, for his patience and resolute support. It was an honour as well as an immense pleasure being his student. • my co-supervisor Dr A.L. Prins, for the constant encouragement, guidance and advice he gave me during my studies. His readiness to assist and passion for math- ematics has made a huge impact on me. I learnt a lot from working with him. • Pastor Okito, for all the spiritual food in due season and his family for the accom- modation they offered me during my time in Bellville and Kuilsriver. • all the lecturers in the mathematics department at Stellenbosch University, espe- cially those who have taught me at some point in my study career. • my special thanks go to my wife Mary and my children Morepi, Mary-ann and David for all the sacrifices they made and whose love, constant support and encouragement will always be the source of inspiration for me. Special thanks are also due to my family in Hammanskraal especially my mother Dorah who never spared the rod in bringing me up under difficult circumstances. v • very big thank you to my friend Maj L. Ncubukezi for supporting and encouraging me in my studies. • I gratefully acknowledge financial support from the Military Academy at Saldanha especially the transport section for ensuring the availability of transport between the Military Academy and Cape Town. vi Notation and conventions Throughout the thesis all groups will be assumed to be finite, unless otherwise stated. We will use the notation and terminology from the ATLAS [22] and [37]. N natural numbers Z integers Q rational numbers R real numbers C complex numbers G; N; G; H groups 1G the identity element of G. F a field F ∗ F − 0 H ≤ GH is a subgroup of G H E GH is a normal subgroup of G ∼ H = GH is isomorphic to G < x; y > the subgroup generated by x and y N·G an extension of N by G N:G a split extension of N by G o(g) order of g 2 G [g] a conjugacy class of G with representative g NG(H) the normalizer of the subgroup H in G Hg the right coset of H in G X; Y; Ω sets vii jΩj the cardinality of the set Ω Gθ stabilizer of θ in G IG(θ) inertia group of θ in G ng conjugation of n by g g1 s g2 g1 is conjugate to g2 # H the restriction of the character of G to the subgroup H ϕG the induction of the character ϕ of subgroup H to G CG(g) centralizer of g in G Irr(G) set of irreducible characters of G IG the identity character of G χ(G=H) the permutation character of G on H dim(V ) the dimension of a vector space V Sn the symmetric group on n symbols GF (q) the Galois field of q elements V (n; q) a vector space of dimension n over GF (q) Sp(2n; q) symplectic group of dimension 2n over GF (q) Un(q) unitary group viii Contents Declaration ii Abstract iii Acknowledgement v Notation and conventions vii 1 Introduction 1 2 Group Characters 6 2.1 Representations and Characters . 7 2.2 Normal Subgroups . 12 2.3 Restriction of Characters . 14 2.4 Induced Characters . 16 2.5 Permutation Characters . 19 ix 3 Conjugacy Classes of Group Extensions 27 3.1 Extensions of Groups . 27 3.2 Conjugacy classes of semi-direct products. 28 3.3 Conjugacy classes of group extensions (not necessarily split) . 30 4 Clifford Theory 37 4.1 Clifford’s Theorem . 38 5 The Fischer–Clifford matrices 50 5.1 Definitions and Preliminaries . 51 5.2 Properties of Fischer-Clifford matrices . 53 6 On a maximal subgroup of the automorphism group U6(2):2 of U6(2) 59 9 6.1 The group 2 :(L3(4):2) . 60 9 6.2 The conjugacy classes of G = 2 :(L3(4):2) . 64 9 6.3 The inertia groups of G = 2 :(L3(4):2) . 68 6.4 The fusion of H2, H3 and H4 into G ................... 69 9 6.5 The Fischer-Clifford Matrices of 2 :(L3(4):2) . 70 9 6.6 Character Table of 2 :(L3(4):2) . 74 9 6.7 The Fusion of 2 :(L3(4):2) into U6(2):2 . 80 x 7 On a maximal subgroup of the automorphism group U6(2):3 of U6(2) 85 9 7.1 The group 2 :(L3(4):3) . 86 9 7.2 The conjugacy classes of G = 2 :(L3(4):3) . 90 9 7.3 The inertia groups of G = 2 :(L3 (4):3) . 94 7.4 The fusion of H2, H3 and H4 into G ................... 95 9 7.5 The Fischer-Clifford Matrices of 2 :(L3(4):3) . 96 9 7.6 Character Table of 2 :(L3(4):3) . 96 9 7.7 The Fusion of 2 :(L3(4):3) into U6(2):3 . 102 8 + 8 The Fischer-Clifford matrices of 2 :(U4(2):2) as a subgroup of O10(2) 104 8 8.1 On the group 2 :(U4(2):2) and its conjugacy classes . 105 8 8.2 The Inertia groups of 2 :(U4(2):2) . 113 8.3 The Fischer-Clifford Matrices of 28:(U4(2):2) . 114 8 8.4 Character Table of 2 :(U4(2):2) . 116 8 8 8.5 The fusion of 2 :(U4(2):2) into 2 :Sp6(2) . 122 6 9 The Character Table of an inertia group of the maximal subgroup 2 :Sp6(2) of F i22 124 6 5 9.1 The group 2 :(2 :S6) .............................125 6 5 9.2 The conjugacy classes of 2 :(2 :S6) . 129 xi 6 5 9.3 The Inertia groups of 2 :(2 :S6) . 134 5 9.4 The Fusions of the Inertia Factor Groups into 2 :S6 . 135 6 5 9.5 The Fischer-Clifford Matrices of 2 :(2 :S6) . 136 6 5 9.6 Character Table of 2 :(2 :S6) . 138 6 5 6 9.7 The Fusion of 2 :(2 :S6) into 2 :SP6(2) . 165 Bibliography 170 Appendix A 176 Appendix B 180 xii Chapter 1 Introduction The Classification of the Finite Simple Groups (CFSG) emphasizes the importance of the finite simple groups in Group Theory. It is one of the most impressive achievements in the history of Mathematics. The reader is referred to [69] for more literature on the CFSG theorem. Classification of Finite Simple Groups states that each finite simple group is isomorphic to exactly one of the following • A cyclic group of prime order, • An Alternating group An of degree at least 5, • A group of Lie type, • One of twenty{six sporadic simple groups. Since the CFSG, more recent work in group theory has involved methods for the com- putation of character tables of finite groups, and in particular, the character tables of the maximal subgroups of the sporadic simple groups and their automorphism groups.
Recommended publications
  • 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).
    [Show full text]
  • Molecular Symmetry
    Molecular Symmetry Symmetry helps us understand molecular structure, some chemical properties, and characteristics of physical properties (spectroscopy) – used with group theory to predict vibrational spectra for the identification of molecular shape, and as a tool for understanding electronic structure and bonding. Symmetrical : implies the species possesses a number of indistinguishable configurations. 1 Group Theory : mathematical treatment of symmetry. symmetry operation – an operation performed on an object which leaves it in a configuration that is indistinguishable from, and superimposable on, the original configuration. symmetry elements – the points, lines, or planes to which a symmetry operation is carried out. Element Operation Symbol Identity Identity E Symmetry plane Reflection in the plane σ Inversion center Inversion of a point x,y,z to -x,-y,-z i Proper axis Rotation by (360/n)° Cn 1. Rotation by (360/n)° Improper axis S 2. Reflection in plane perpendicular to rotation axis n Proper axes of rotation (C n) Rotation with respect to a line (axis of rotation). •Cn is a rotation of (360/n)°. •C2 = 180° rotation, C 3 = 120° rotation, C 4 = 90° rotation, C 5 = 72° rotation, C 6 = 60° rotation… •Each rotation brings you to an indistinguishable state from the original. However, rotation by 90° about the same axis does not give back the identical molecule. XeF 4 is square planar. Therefore H 2O does NOT possess It has four different C 2 axes. a C 4 symmetry axis. A C 4 axis out of the page is called the principle axis because it has the largest n . By convention, the principle axis is in the z-direction 2 3 Reflection through a planes of symmetry (mirror plane) If reflection of all parts of a molecule through a plane produced an indistinguishable configuration, the symmetry element is called a mirror plane or plane of symmetry .
    [Show full text]
  • Symmetries on the Lattice
    Symmetries On The Lattice K.Demmouche January 8, 2006 Contents Background, character theory of finite groups The cubic group on the lattice Oh Representation of Oh on Wilson loops Double group 2O and spinor Construction of operator on the lattice MOTIVATION Spectrum of non-Abelian lattice gauge theories ? Create gauge invariant spin j states on the lattice Irreducible operators Monte Carlo calculations Extract masses from time slice correlations Character theory of point groups Groups, Axioms A set G = {a, b, c, . } A1 : Multiplication ◦ : G × G → G. A2 : Associativity a, b, c ∈ G ,(a ◦ b) ◦ c = a ◦ (b ◦ c). A3 : Identity e ∈ G , a ◦ e = e ◦ a = a for all a ∈ G. −1 −1 −1 A4 : Inverse, a ∈ G there exists a ∈ G , a ◦ a = a ◦ a = e. Groups with finite number of elements → the order of the group G : nG. The point group C3v The point group C3v (Symmetry group of molecule NH3) c ¡¡AA ¡ A ¡ A Z ¡ A Z¡ A Z O ¡ Z A ¡ Z A ¡ Z A Z ¡ Z A ¡ ZA a¡ ZA b G = {Ra(π),Rb(π),Rc(π),E(2π),R~n(2π/3),R~n(−2π/3)} noted G = {A, B, C, E, D, F } respectively. Structure of Groups Subgroups: Definition A subset H of a group G that is itself a group with the same multiplication operation as G is called a subgroup of G. Example: a subgroup of C3v is the subset E, D, F Classes: Definition An element g0 of a group G is said to be ”conjugate” to another element g of G if there exists an element h of G such that g0 = hgh−1 Example: on can check that B = DCD−1 Conjugacy Class Definition A class of a group G is a set of mutually conjugate elements of G.
    [Show full text]
  • Lie Algebras of Generalized Quaternion Groups 1 Introduction 2
    Lie Algebras of Generalized Quaternion Groups Samantha Clapp Advisor: Dr. Brandon Samples Abstract Every finite group has an associated Lie algebra. Its Lie algebra can be viewed as a subspace of the group algebra with certain bracket conditions imposed on the elements. If one calculates the character table for a finite group, the structure of its associated Lie algebra can be described. In this work, we consider the family of generalized quaternion groups and describe its associated Lie algebra structure completely. 1 Introduction The Lie algebra of a group is a useful tool because it is a vector space where linear algebra is available. It is interesting to consider the Lie algebra structure associated to a specific group or family of groups. A Lie algebra is simple if its dimension is at least two and it only has f0g and itself as ideals. Some examples of simple algebras are the classical Lie algebras: sl(n), sp(n) and o(n) as well as the five exceptional finite dimensional simple Lie algebras. A direct sum of simple lie algebras is called a semi-simple Lie algebra. Therefore, it is also interesting to consider if the Lie algebra structure associated with a particular group is simple or semi-simple. In fact, the Lie algebra structure of a finite group is well known and given by a theorem of Cohen and Taylor [1]. In this theorem, they specifically describe the Lie algebra structure using character theory. That is, the associated Lie algebra structure of a finite group can be described if one calculates the character table for the finite group.
    [Show full text]
  • 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.
    [Show full text]
  • Representation Theory
    M392C NOTES: REPRESENTATION THEORY ARUN DEBRAY MAY 14, 2017 These notes were taken in UT Austin's M392C (Representation Theory) class in Spring 2017, taught by Sam Gunningham. I live-TEXed them using vim, so there may be typos; please send questions, comments, complaints, and corrections to [email protected]. Thanks to Kartik Chitturi, Adrian Clough, Tom Gannon, Nathan Guermond, Sam Gunningham, Jay Hathaway, and Surya Raghavendran for correcting a few errors. Contents 1. Lie groups and smooth actions: 1/18/172 2. Representation theory of compact groups: 1/20/174 3. Operations on representations: 1/23/176 4. Complete reducibility: 1/25/178 5. Some examples: 1/27/17 10 6. Matrix coefficients and characters: 1/30/17 12 7. The Peter-Weyl theorem: 2/1/17 13 8. Character tables: 2/3/17 15 9. The character theory of SU(2): 2/6/17 17 10. Representation theory of Lie groups: 2/8/17 19 11. Lie algebras: 2/10/17 20 12. The adjoint representations: 2/13/17 22 13. Representations of Lie algebras: 2/15/17 24 14. The representation theory of sl2(C): 2/17/17 25 15. Solvable and nilpotent Lie algebras: 2/20/17 27 16. Semisimple Lie algebras: 2/22/17 29 17. Invariant bilinear forms on Lie algebras: 2/24/17 31 18. Classical Lie groups and Lie algebras: 2/27/17 32 19. Roots and root spaces: 3/1/17 34 20. Properties of roots: 3/3/17 36 21. Root systems: 3/6/17 37 22. Dynkin diagrams: 3/8/17 39 23.
    [Show full text]
  • Lecture Notes: Basic Group and Representation Theory
    Lecture notes: Basic group and representation theory Thomas Willwacher February 27, 2014 2 Contents 1 Introduction 5 1.1 Definitions . .6 1.2 Actions and the orbit-stabilizer Theorem . .8 1.3 Generators and relations . .9 1.4 Representations . 10 1.5 Basic properties of representations, irreducibility and complete reducibility . 11 1.6 Schur’s Lemmata . 12 2 Finite groups and finite dimensional representations 15 2.1 Character theory . 15 2.2 Algebras . 17 2.3 Existence and classification of irreducible representations . 18 2.4 How to determine the character table – Burnside’s algorithm . 20 2.5 Real and complex representations . 21 2.6 Induction, restriction and characters . 23 2.7 Exercises . 25 3 Representation theory of the symmetric groups 27 3.1 Notations . 27 3.2 Conjugacy classes . 28 3.3 Irreducible representations . 29 3.4 The Frobenius character formula . 31 3.5 The hook lengths formula . 34 3.6 Induction and restriction . 34 3.7 Schur-Weyl duality . 35 4 Lie groups, Lie algebras and their representations 37 4.1 Overview . 37 4.2 General definitions and facts about Lie algebras . 39 4.3 The theorems of Lie and Engel . 40 4.4 The Killing form and Cartan’s criteria . 41 4.5 Classification of complex simple Lie algebras . 43 4.6 Classification of real simple Lie algebras . 44 4.7 Generalities on representations of Lie algebras . 44 4.8 Representation theory of sl(2; C) ................................ 45 4.9 General structure theory of semi-simple Lie algebras . 48 4.10 Representation theory of complex semi-simple Lie algebras .
    [Show full text]
  • Character Theory of Finite Groups NZ Mathematics Research Institute Summer Workshop Day 1: Essentials
    1/29 Character Theory of Finite Groups NZ Mathematics Research Institute Summer Workshop Day 1: Essentials Don Taylor The University of Sydney Nelson, 7–13 January 2018 2/29 Origins Suppose that G is a finite group and for every element g G we have 2 an indeterminate xg . What are the factors of the group determinant ¡ ¢ det x 1 ? gh¡ g,h This was a question posed by Dedekind. Frobenius discovered character theory (in 1896) when he set out to answer it. Characters of abelian groups had been used in number theory but Frobenius developed the theory for nonabelian groups. 3/29 Representations Matrices Characters ² ² A linear representation of a group G is a homomorphism ½ : G GL(V ), where GL(V ) is the group of all invertible linear ! transformations of the vector space V , which we assume to have finite dimension over the field C of complex numbers. The dimension n of V is called the degree of ½. If (ei )1 i n is a basis of V , there are functions ai j : G C such that · · ! X ½(x)e j ai j (x)ei . Æ i The matrices A(x) ¡a (x)¢ define a homomorphism A : G GL(n,C) Æ i j ! from G to the group of all invertible n n matrices over C. £ The character of ½ is the function G C that maps x G to Tr(½(x)), ! 2 the trace of ½(x), namely the sum of the diagonal elements of A(x). 4/29 Early applications Frobenius first defined characters as solutions to certain equations.
    [Show full text]
  • Representations, Character Tables, and One Application of Symmetry Chapter 4
    Representations, Character Tables, and One Application of Symmetry Chapter 4 Friday, October 2, 2015 Matrices and Matrix Multiplication A matrix is an array of numbers, Aij column columns matrix row matrix -1 4 3 1 1234 rows -8 -1 7 2 2141 3 To multiply two matrices, add the products, element by element, of each row of the first matrix with each column in the second matrix: 12 12 (1×1)+(2×3) (1×2)+(2×4) 710 × 34 34 = (3×1)+(4×3) (3×2)+(4×4) = 15 22 100 1 1 0-10× 2 = -2 002 3 6 Transformation Matrices Each symmetry operation can be represented by a 3×3 matrix that shows how the operation transforms a set of x, y, and z coordinates y Let’s consider C2h {E, C2, i, σh}: x transformation matrix C2 x’ = -x -1 0 0 x’ -1 0 0 x -x y’ = -y 0-10 y’ ==0-10 y -y z’ = z 001 z’ 001 z z new transformation old new in terms coordinates ==matrix coordinates of old transformation i matrix x’ = -x -1 0 0 x’ -1 0 0 x -x y’ = -y 0-10 y’ ==0-10 y -y z’ = -z 00-1 z’ 00-1z -z Representations of Groups The set of four transformation matrices forms a matrix representation of the C2h point group. 100 -1 0 0 -1 0 0 100 E: 010 C2: 0-10 i: 0-10 σh: 010 001 001 00-1 00-1 These matrices combine in the same way as the operations, e.g., -1 0 0 -1 0 0 100 C2 × C2 = 0-10 0-10= 010= E 001001 001 The sum of the numbers along each matrix diagonal (the character) gives a shorthand version of the matrix representation, called Γ: C2h EC2 i σh Γ 3-1-31 Γ (gamma) is a reducible representation b/c it can be further simplified.
    [Show full text]
  • Lecture Notes
    i Applications of Group Theory to the Physics of Solids M. S. Dresselhaus 8.510J 6.734J SPRING 2002 ii Contents 1 Basic Mathematical Background 1 1.1 De¯nition of a Group . 1 1.2 Simple Example of a Group . 2 1.3 Basic De¯nitions . 4 1.4 Rearrangement Theorem . 6 1.5 Cosets . 6 1.6 Conjugation and Class . 8 1.6.1 Self-Conjugate Subgroups . 9 1.7 Factor Groups . 10 1.8 Selected Problems . 11 2 Representation Theory 15 2.1 Important De¯nitions . 15 2.2 Matrices . 17 2.3 Irreducible Representations . 18 2.4 The Unitarity of Representations . 20 2.5 Schur's Lemma (Part I) . 23 2.6 Schur's Lemma (Part 2) . 24 2.7 Wonderful Orthogonality Theorem . 27 2.8 Representations and Vector Spaces . 30 2.9 Suggested Problems . 31 3 Character of a Representation 33 3.1 De¯nition of Character . 33 3.2 Characters and Class . 34 3.3 Wonderful Orthogonality Theorem for Character . 36 3.4 Reducible Representations . 38 iii iv CONTENTS 3.5 The Number of Irreducible Representations . 40 3.6 Second Orthogonality Relation for Characters . 41 3.7 Regular Representation . 43 3.8 Setting up Character Tables . 47 3.9 Symmetry Notation . 51 3.10 Selected Problems . 73 4 Basis Functions 75 4.1 Symmetry Operations and Basis Functions . 75 4.2 Basis Functions for Irreducible Representations . 77 ^(¡n) 4.3 Projection Operators Pkl . 82 ^(¡n) 4.4 Derivation of Pk` . 83 4.5 Projection Operations on an Arbitrary Function . 84 4.6 Linear Combinations for 3 Equivalent Atoms .
    [Show full text]
  • The Q-Conjugacy Character Table of Dihedral Groups
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS { N. 39{2018 (89{96) 89 THE Q-CONJUGACY CHARACTER TABLE OF DIHEDRAL GROUPS H. Shabani A. R. Ashrafi E. Haghi Department of Pure Mathematics Faculty of Mathematical Sciences University of Kashan P.O. Box 87317-53153 Kashan I.R. Iran M. Ghorbani∗ Department of Pure Mathematics Faculty of Sciences Shahid Rajaee Teacher Training University P.O. Box 16785-136 Tehran I.R. Iran [email protected] Abstract. In a seminal paper published in 1998, Shinsaku Fujita introduced the concept of Q-conjugacy character table of a finite group. He applied this notion to solve some problems in combinatorial chemistry. In this paper, the Q-conjugacy character table of dihedral groups is computed in general. As a consequence, Q- ∼ ∼ conjugacy character table of molecules with point group symmetries D = C = Dih , ∼ ∼ ∼ ∼ ∼ ∼ ∼ ∼3 3v∼ 6 D = D = C = Dih , D = C = Dih , D = D = D = C = Dih , 4 ∼ 2d ∼ 4v ∼ 8 5 ∼5v 10 ∼3d ∼3h 6 ∼6v 12 D2 = C2v = Z2 × Z2 = Dih2, D4d = Dih16, D5d = D5h = Dih20, D6d = Dih24 are computed, where Z2 denotes a cyclic group of order 2 and Dihn is the dihedral group of even order n. Keywords: Q-conjugacy character table, dihedral group, conjugacy class. 1. Introduction A representation of a group G is a homomorphism from G into the group of invertible operators of a vector space V . In this case, we can interpret each element of G as an invertible linear transformation V −! V . If n = dimV and fix a basis for V then we can construct an isomorphism between the set of all \invertible linear transformation V −! V " and the set of all \invertible n × n matrices".
    [Show full text]
  • Irreducible Representations and Character Tables
    MIT OpenCourseWare http://ocw.mit.edu 5.04 Principles of Inorganic Chemistry II �� Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 5.04, Principles of Inorganic Chemistry II Prof. Daniel G. Nocera Lecture 3: Irreducible Representations and Character Tables Similarity transformations yield irreducible representations, Γi, which lead to the useful tool in group theory – the character table. The general strategy for determining Γi is as follows: A, B and C are matrix representations of symmetry operations of an arbitrary basis set (i.e., elements on which symmetry operations are performed). There is some similarity transform operator v such that A’ = v –1 ⋅ A ⋅ v B’ = v –1 ⋅ B ⋅ v C’ = v –1 ⋅ C ⋅ v where v uniquely produces block-diagonalized matrices, which are matrices possessing square arrays along the diagonal and zeros outside the blocks ⎡ A1 ⎤ ⎡B1 ⎤ ⎡C1 ⎤ ′ = ⎢ ⎥ ′ = ⎢ ⎥ ′ = ⎢ ⎥ A ⎢ A 2 ⎥ B ⎢ B2 ⎥ C ⎢ C 2 ⎥ ⎢ A ⎥ ⎢ B ⎥ ⎢ C ⎥ ⎣ 3 ⎦ ⎣ 3 ⎦ ⎣ 3 ⎦ Matrices A, B, and C are reducible. Sub-matrices Ai, Bi and Ci obey the same multiplication properties as A, B and C. If application of the similarity transform does not further block-diagonalize A’, B’ and C’, then the blocks are irreducible representations. The character is the sum of the diagonal elements of Γi. 2 As an example, let’s continue with our exemplary group: E, C3, C3 , σv, σv’, σv” by defining an arbitrary basis … a triangle v A v'' v' C B The basis set is described by the triangles vertices, points A, B and C.
    [Show full text]