DOCSLIB.ORG

Group Actions Of

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Group Actions Of 8 Actions Group 8 L Definitions 8 Examples how our has Up to study of largely groups been about the groups themselves understanding e How elements G have order K g many of What are the subgroups of G What are the quotients of G Is G cyclic Abelian etc Now we will turn our attention to how studying a can describe the group G symmetries of other X we see how sets Essentially will a elements can permute the of X group course we don't want G to Of permute the elements of X arbitrarily we somehow want the structure G of in this reflected permutation For instance how would like the you ee to elements identity G permute the of X If our definition is at all reasonable it should leave everything unchanged be It would also reasonable to expect that for EG X the g gz permuting by should be the same as product g.ge and then here permuting by gz by g we read left like functions right to Definition Let G be a and X be group a set An action of G on X is a map s h the Gx X X wi following properties L x u e for all XEX 2 x gigs X for all g g c G g gz and all see X to We write GTX indicate that G is on X acting 1 on Ex The group G Sn acts the set X 142,3 n'T in the natural way For TE Sm and ie X a i Oci We'll that this is an action verify by L f z checking properties L e i e i i ie V for all X 2 Given a te Sn and EE X P T.i 8 Tci r Tc i rot i roc E V R acts on Ex2 The group G Gln the I set X R by matrix vector multiplication c For A Glen and XER A x Ax have We that 1 I x Ix all ne V for X 2 Given A Be Glen and KEIR A B x A Bx CAB x AB x V Ex3 The G D acts on the group set 3,4 which we can think 4 11,2 of as the set vertices a of of square 1 2 4 3 Here we have that Z z 1 1 v 3 3 4 4 So V 2 1 We could also think of X as the set of the edges of square 1 4 23 In this case I 1 V 2 7 4 2 3 43 So V 2 4 and I L Ex 4 A G acts on itself left group by multiplication Given a be a b ab G an exercise is an As prove that this action Ex 5 A G acts on itself group by t Given a be G a b aba conjugation To see that this is an action note that e a 1 eae a for all AEG 2 a b a Cbgb g 1 t a a Cbgb ab ab ab g g Thus this is indeed an action It will sometimes be to view an helpful action GTX in a different way Suppose that G is a on group acting a set X For G consider ge fixed the map X X 4g x I se g We can show that is a on Hg bijection Indeed see X we have X given that t.se a 4g g g g x gg e ze R so is To see that 4g surjective 4g u is let X Then injective ye Igcse a Ugly g g y i a g g y g g a g g g g y e se e Y se y so is Thus is 4g injective belongs to bijective Consequently 4g the set X is S f X f bijective Exercise For set X the set any as defined above is a under Sx group Lcs composition Moreover X n the if E Sx Sn with this in mind consider once again the action G on X of Define E G Six l 4g g This OI is a between In map groups it is a homomorphism fact group Indeed let c We claim that g g G o Ecg ga Ecg Ilga That is we claim that Ygga Vg Uga a But of course for EX a x Yg g gigs x g gz g Ygate se as 04g 4g 4g g we so Thus have 4g g Vge Yg 01g Eg That is I is g Iga a homomorphism Moral action GTX Every gives rise to a homomorphism G Sx i s g 4g where X X 4g se I goose this is to one knowing fact enough prove the coolest results in the course of Theorem 8 I Cayley's Theorem G is isomorphic to a of Every group group In G he permutations particular if is a then G isomorphic to subgroup of Sh Proof Let G act on itself by left consider homomorphism multiplication and the Of G described above Sq Let the First Isomorphism Theorem By im G I E E Koot Sq is What turd If geker I then 01g is the of Thus 4g identity Sg a a for all AEG a 4g g ga cancellation e so Ker Ie By g o is to a G isomorphic subgroup of Sq Krag 8.2 Orbits 8 Stabilizers Given a action GAX and group see an element G there are a few natural one can ask questions E Where in X can u be sent ii elements fine u which of G Thus we make the definitions following a Definition Let Gnu X be group action Given see X define i the orbit se be the of to set On lg.se gee ii the stabilizer n to be the set of stab G a se Ige g Note that the orbit On is a subset of X while the stabilizer Staba is a subset G In of fact Proposition 8.2 is an action If GTX then for any see X Stab E G Proof Exercise Is a X No On subgroup of In X is not even a general group e C't Ex The group G feio Oer acts on the set X c by multiplication O e For 2 k e Z e'Oz The orbit ZEC is of Oz Z Oz e Oz OER WE E w Z 0 Note that stab eio eio 0 G 0 z and 2 to Stabz e ei0z 42 for usual action Ex Consider the of Sin on on X 11,2 in I Nci ie we can send Given X in to any any c r Thus X ij Oi X g using Stab Oci i By definition lot Sn I Sn t n Note that Oi n Stabi t Ex Let be the all G group of rotations cube of the We will consider the action of G on the cube's vertices edges and faces g L X vertices of the cube Given vertex VE X we can move V to other vertex a rotation using any Or 8 The rotations that leave only V unchanged e are and the rotations about the line V and through its vertex opposite i Stab 3 z edges the cube X of Given E E X we can move E edge to other a rotation edge using any i OE 12 The rotations that leave E only unchanged are e and rotation the about the line and through E its opposite edge E or a Stabe 2 3 faces the cube X of Given Fe X we can move face to other face a rotation any using i Of 6 The only rotations that leave F unchanged are e and the rotations about the line F and its through opposite face F u i Stab 4 Notice that in all cases Staba On 24 It turns out that this value represents the order the G in of group and fact this occurs for every action GAX Theorem 8.3 Orbit Stabilizer Let GAX be For see a group action every X G Stab On In particular if G then G Stab On Proof Define 4 G stab On by 41g Staba g se We claim that 4 is bijective hence G Staba On First we have that for all g gre G g Stabs ga Staba gig C Stabs gig se se g se gz K 41g Uga Thus 4 is well defined 8 injective Moreover given ye On we can write y g x for some gear Then 4 gstaba g x y so 9 is surjective i 4 is bijective as claimed The final claim for finite groups follows from Lagrange's Theorem agama The Orbit Stabilizer Theorem can reveal lots about a group action GAX or about the group G itself Ex What are the possible group actions of G 25 on X 142,33 Well a we have given any X that 25 Staba On so 5 Staba On Hence On L or 5 But since On E3 it must be that On L for all n That is see g a r for all GE 25 and all X The only action is the trivial action Ex How does many rotational symmetries a soccer ball have all such Let G be the group of symmetries and let G act on the set X of all black pentagonal faces of the soccer ball Fix any face FEX This face can be rotated to other such so any face OF 12 Moreover the only rotations that leave F unchanged are the 5 rotations about the axis through F 2 5 Consequently Stab By the Orbit Stabilizer Theorem G Stab OF 5 12 GO Further Applications Burnside's Lemma We will now see how actions can be group to used solve some neat counting problems Ex 1 How different can we make many ways 2 2 chess board black and white a using squares Here are some examples etc wi em I 2 3 4 5 Hold on some of these boards are really the same For instance 2 can be rotated to 3 So We should consider two boards to be the same if one can be rotated into the other That is our be restated as problem may follows If G is the group of rotations of a is 16 square and X the set of all 24 2 2 chess boards how orbits does many the action GAX have Burnside's Lemma us a to count gives way these orbits efficiently First We'll need the following proposition Let be a Proposition 8.4 GAX group action The orbits of the action partition X That is a X On b if x yell then Ose Oy or Oan Oy 0 Proof Assignment 5 Lemma 8.5 Burnside Let G be a finite on a set X If N group acting finite is the number of orbits then N Fixlg g g where for geG Fix g IneX goose se Proof Let n be the number of pairs a c such that se se g Gx X g First note that for a fixed geG the number such is so of pairs gin Fix g n I Fix g gEG Also note that for fixed a X the number of such pairs g n is staba so n stab G l Go I k f sec On But we have so for any rye Or Oy On I t t t 1 yeon Oy On On On On times So I N number of orbits reX On We conclude that I Fixg n G N gea So as claimed N Fix g gaza g g a We can now attempt to solve our chess board problem We wish to determine the number of orbits of all boards under the group G of rotations of a square By Burnside we must find FixLg for all rotations gear Note that G e Rao Riso 12270 g e Rao Riso 12220 2 22 2 Fix g 24 Thus the number of distinct boards orbits is N Fix Ig Egfr g L 16 2 4 2 6 4 Boat atheroma How necklaces Ex many 6 bead can be and 3 made using 3 black beads white beads Solution We can choose the location of 3 beads Es 20 the black in ways and the beads must be white remaining So let X be the set of these 20 possible necklaces and let G D6 be the a We symmetry group of hexagon consider 2 necklaces in X to be the same to the same orbit if they belong under the action Gnr X What are the symmetries in G Rotations V C R R2 Rs R Rs F Fy Fr Flips Fsf Fl Fz Fz Fy E5 Foo F6 We now Fix each compute g for gEG g e R R R R Rs F Fa F F Fo Foo 20 O 2 O 2 O O O O I 22 22 Fix g By Burnside's Lemma the number of orbits i.e the number of necklaces is Zoot 2 2 22 2722 1g Fix g plz g L 36 3 12 They are 1 can one label the Ex How many ways sides a G sided die the of using each of the numbers 1 G exactly once Solution There are 6 ways to put the numbers on but
Load more

Recommended publications
  • GROUP ACTIONS 1. Introduction the Groups Sn, An, and (For N ≥ 3)
    GROUP ACTIONS KEITH CONRAD 1. Introduction The groups Sn, An, and (for n ≥ 3) Dn behave, by their definitions, as permutations on certain sets. The groups Sn and An both permute the set f1; 2; : : : ; ng and Dn can be considered as a group of permutations of a regular n-gon, or even just of its n vertices, since rigid motions of the vertices determine where the rest of the n-gon goes. If we label the vertices of the n-gon in a definite manner by the numbers from 1 to n then we can view Dn as a subgroup of Sn. For instance, the labeling of the square below lets us regard the 90 degree counterclockwise rotation r in D4 as (1234) and the reflection s across the horizontal line bisecting the square as (24). The rest of the elements of D4, as permutations of the vertices, are in the table below the square. 2 3 1 4 1 r r2 r3 s rs r2s r3s (1) (1234) (13)(24) (1432) (24) (12)(34) (13) (14)(23) If we label the vertices in a different way (e.g., swap the labels 1 and 2), we turn the elements of D4 into a different subgroup of S4. More abstractly, if we are given a set X (not necessarily the set of vertices of a square), then the set Sym(X) of all permutations of X is a group under composition, and the subgroup Alt(X) of even permutations of X is a group under composition. If we list the elements of X in a definite order, say as X = fx1; : : : ; xng, then we can think about Sym(X) as Sn and Alt(X) as An, but a listing in a different order leads to different identifications 1 of Sym(X) with Sn and Alt(X) with An.
    [Show full text]
  • Group Properties and Group Isomorphism
    GROUP PROPERTIES AND GROUP ISOMORPHISM Evelyn. M. Manalo Mathematics Honors Thesis University of California, San Diego May 25, 2001 Faculty Mentor: Professor John Wavrik Department of Mathematics GROUP PROPERTIES AND GROUP ISOMORPHISM I n t r o d u c t i o n T H E I M P O R T A N C E O F G R O U P T H E O R Y is relevant to every branch of Mathematics where symmetry is studied. Every symmetrical object is associated with a group. It is in this association why groups arise in many different areas like in Quantum Mechanics, in Crystallography, in Biology, and even in Computer Science. There is no such easy definition of symmetry among mathematical objects without leading its way to the theory of groups. In this paper we present the first stages of constructing a systematic method for classifying groups of small orders. Classifying groups usually arise when trying to distinguish the number of non-isomorphic groups of order n. This paper arose from an attempt to find a formula or an algorithm for classifying groups given invariants that can be readily determined without any other known assumptions about the group. This formula is very useful if we want to know if two groups are isomorphic. Mathematical objects are considered to be essentially the same, from the point of view of their algebraic properties, when they are isomorphic. When two groups Γ and Γ’ have exactly the same group-theoretic structure then we say that Γ is isomorphic to Γ’ or vice versa.
    [Show full text]
  • Mathematics for Humanists
    Mathematics for Humanists Mathematics for Humanists Herbert Gintis xxxxxxxxx xxxxxxxxxx Press xxxxxxxxx and xxxxxx Copyright c 2021 by ... Published by ... All Rights Reserved Library of Congress Cataloging-in-Publication Data Gintis, Herbert Mathematics for Humanists/ Herbert Gintis p. cm. Includes bibliographical references and index. ISBN ...(hardcover: alk. paper) HB... xxxxxxxxxx British Library Cataloging-in-Publication Data is available The publisher would like to acknowledge the author of this volume for providing the camera-ready copy from which this book was printed This book has been composed in Times and Mathtime by the author Printed on acid-free paper. Printed in the United States of America 10987654321 This book is dedicated to my mathematics teachers: Pincus Shub, Walter Gottschalk, Abram Besikovitch, and Oskar Zariski Contents Preface xii 1 ReadingMath 1 1.1 Reading Math 1 2 The LanguageofLogic 2 2.1 TheLanguageofLogic 2 2.2 FormalPropositionalLogic 4 2.3 Truth Tables 5 2.4 ExercisesinPropositionalLogic 7 2.5 Predicate Logic 8 2.6 ProvingPropositionsinPredicateLogic 9 2.7 ThePerilsofLogic 10 3 Sets 11 3.1 Set Theory 11 3.2 PropertiesandPredicates 12 3.3 OperationsonSets 14 3.4 Russell’s Paradox 15 3.5 Ordered Pairs 17 3.6 MathematicalInduction 18 3.7 SetProducts 19 3.8 RelationsandFunctions 20 3.9 PropertiesofRelations 21 3.10 Injections,Surjections,andBijections 22 3.11 CountingandCardinality 23 3.12 The Cantor-Bernstein Theorem 24 3.13 InequalityinCardinalNumbers 25 3.14 Power Sets 26 3.15 TheFoundationsofMathematics
    [Show full text]
  • 18.704 Supplementary Notes March 23, 2005 the Subgroup Ω For
    18.704 Supplementary Notes March 23, 2005 The subgroup Ω for orthogonal groups In the case of the linear group, it is shown in the text that P SL(n; F ) (that is, the group SL(n) of determinant one matrices, divided by its center) is usually a simple group. In the case of symplectic group, P Sp(2n; F ) (the group of symplectic matrices divided by its center) is usually a simple group. In the case of the orthog- onal group (as Yelena will explain on March 28), what turns out to be simple is not P SO(V ) (the orthogonal group of V divided by its center). Instead there is a mysterious subgroup Ω(V ) of SO(V ), and what is usually simple is P Ω(V ). The purpose of these notes is first to explain why this complication arises, and then to give the general definition of Ω(V ) (along with some of its basic properties). So why should the complication arise? There are some hints of it already in the case of the linear group. We made a lot of use of GL(n; F ), the group of all invertible n × n matrices with entries in F . The most obvious normal subgroup of GL(n; F ) is its center, the group F × of (non-zero) scalar matrices. Dividing by the center gives (1) P GL(n; F ) = GL(n; F )=F ×; the projective general linear group. We saw that this group acts faithfully on the projective space Pn−1(F ), and generally it's a great group to work with.
    [Show full text]
  • Infinite Iteration of Matrix Semigroups II. Structure Theorem for Arbitrary Semigroups up to Aperiodic Morphism
    JOURNAL OF ALGEBRA 100, 25-137 (1986) Infinite Iteration of Matrix Semigroups II. Structure Theorem for Arbitrary Semigroups up to Aperiodic Morphism JOHN RHODES Deparrmenr of Mathematics, Universily of Califiwnia, Berkeley, California 94720 Communicated by G. B. Pwston Received March 17, 1984 The global theory qf semigroups (finite or infinite) consists of the following: Given a semigroup T, find semigroups S and X and a surmorphism 0 so that: where (a. I ) X is an easily globally computed (EGC) semigroups; (a.2) S is a special subsemigroup of X; (a.3) 0 is a fine surmorphism. Of course we must precisely define these three notions; see below and also the Introduction of Part I, [Part I]. The most famous example of (a) is the following: Let the semigroup T be generated by the subset A (written T= (A )), and let A + be the free semigroup over A; then we have (where 0 is defined by (a,,..., a,)8= a,. .. a,.) Here intuitively A + is “easily globally computed” because concatenation of two strings is a trans- parent multiplication and A + < A + i s surely special. However, here 0 need not be “line’‘-the unsolvability of the word problem for semigroups is one way to state this; we shall formulate it differently later (in fact, using the 25 0021-8693/86 $3.00 CopyrIght t-8 1986 by Academic Press, Inc. All rights of reproductmn m any form reserved. 26 JOHN RHODES definitions given below, 8: A + + T will be called “line” iff T is an idem- potent-free semigroup). In this paper “special” will be taken to mean “equal;” so (a) becomes: Given a semigroup T, find a semigroup X and a surmorphism 8 such that (b) T++‘X, where (b.1) X is easily globally computed (EGC), (b.2) 6, is a line surmorphism.
    [Show full text]
  • Categoricity of Semigroups
    This is a repository copy of $\aleph_0$-categoricity of semigroups. White Rose Research Online URL for this paper: https://eprints.whiterose.ac.uk/141353/ Version: Published Version Article: Gould, Victoria Ann Rosalind orcid.org/0000-0001-8753-693X and Quinn-Gregson, Thomas David (2019) $\aleph_0$-categoricity of semigroups. Semigroup forum. pp. 260- 292. ISSN 1432-2137 Reuse This article is distributed under the terms of the Creative Commons Attribution (CC BY) licence. This licence allows you to distribute, remix, tweak, and build upon the work, even commercially, as long as you credit the authors for the original work. More information and the full terms of the licence here: https://creativecommons.org/licenses/ Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ Semigroup Forum https://doi.org/10.1007/s00233-019-10002-7 RESEARCH ARTICLE ℵ0-categoricity of semigroups Victoria Gould1 · Thomas Quinn-Gregson2 Received: 19 February 2018 / Accepted: 14 January 2019 © The Author(s) 2019 Abstract In this paper we initiate the study of ℵ0-categorical semigroups, where a countable semigroup S is ℵ0-categorical if, for any natural number n, the action of its group n of automorphisms Aut(S) on S has only finitely many orbits. We show that ℵ0- categoricity transfers to certain important substructures such as maximal subgroups and principal factors. We examine the relationship between ℵ0-categoricity and a number of semigroup and monoid constructions, namely Brandt semigroups, direct sums, 0-direct unions, semidirect products and P-semigroups.
    [Show full text]
  • Volumes of Orthogonal Groups and Unitary Groups Are Very Useful in Physics and Mathematics [3, 4]
    Volumes of Orthogonal Groups and Unitary Groups ∗ Lin Zhang Institute of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China Abstract The matrix integral has many applications in diverse fields. This review article begins by presenting detailed key background knowledge about matrix integral. Then the volumes of orthogonal groups and unitary groups are computed, respectively. As a unification, we present Mcdonald’s volume formula for a compact Lie group. With this volume formula, one can easily derives the volumes of orthogonal groups and unitary groups. Applications are also presented as well. Specifically, The volume of the set of mixed quantum states is computed by using the volume of unitary group. The volume of a metric ball in unitary group is also computed as well. There are no new results in this article, but only detailed and elementary proofs of existing results. The purpose of the article is pedagogical, and to collect in one place many, if not all, of the quantum information applications of the volumes of orthogonal and unitary groups. arXiv:1509.00537v5 [math-ph] 3 Nov 2017 ∗ E-mail: [email protected]; [email protected] 1 Contents 1 Introduction 3 2 Volumes of orthogonal groups 5 2.1 Preliminary ..................................... ..... 5 2.2 Thecomputationofvolumes . ....... 17 3 Volumes of unitary groups 28 3.1 Preliminary ..................................... ..... 28 3.2 Thecomputationofvolumes . ....... 44 4 The volume of a compact Lie group 55 5 Applications 73 5.1 Hilbert-Schmidt volume of the set of mixed quantum states.............. 73 5.2 Areaoftheboundaryofthesetofmixedstates . ........... 77 5.3 Volumeofametricballinunitarygroup . .......... 79 6 Appendix I: Volumes of a sphere and a ball 85 7 Appendix II: Some useful facts 89 7.1 Matrices with simple eigenvalues form open dense sets of fullmeasure .
    [Show full text]
  • 1 Introduction 2 Burnside's Lemma
    POLYA'S´ COUNTING THEORY Mollee Huisinga May 9, 2012 1 Introduction In combinatorics, there are very few formulas that apply comprehensively to all cases of a given problem. P´olya's Counting Theory is a spectacular tool that allows us to count the number of distinct items given a certain number of colors or other characteristics. Basic questions we might ask are, \How many distinct squares can be made with blue or yellow vertices?" or \How many necklaces with n beads can we create with clear and solid beads?" We will count two objects as 'the same' if they can be rotated or flipped to produce the same configuration. While these questions may seem uncomplicated, there is a lot of mathematical machinery behind them. Thus, in addition to counting all possible positions for each weight, we must be sure to not recount the configuration again if it is actually the same as another. We can use Burnside's Lemma to enumerate the number of distinct objects. However, sometimes we will also want to know more information about the characteristics of these distinct objects. P´olya's Counting Theory is uniquely useful because it will act as a picture function - actually producing a polynomial that demonstrates what the different configurations are, and how many of each exist. As such, it has numerous applications. Some that will be explored here include chemical isomer enumeration, graph theory and music theory. This paper will first work through proving and understanding P´olya's theory, and then move towards surveying applications. Throughout the paper we will work heavily with examples to illuminate the simplicity of the theorem beyond its notation.
    [Show full text]
  • Introduction to Groups, Rings and Fields
    Introduction to Groups, Rings and Fields HT and TT 2011 H. A. Priestley 0. Familiar algebraic systems: review and a look ahead. GRF is an ALGEBRA course, and specifically a course about algebraic structures. This introduc- tory section revisits ideas met in the early part of Analysis I and in Linear Algebra I, to set the scene and provide motivation. 0.1 Familiar number systems Consider the traditional number systems N = 0, 1, 2,... the natural numbers { } Z = m n m, n N the integers { − | ∈ } Q = m/n m, n Z, n = 0 the rational numbers { | ∈ } R the real numbers C the complex numbers for which we have N Z Q R C. ⊂ ⊂ ⊂ ⊂ These come equipped with the familiar arithmetic operations of sum and product. The real numbers: Analysis I built on the real numbers. Right at the start of that course you were given a set of assumptions about R, falling under three headings: (1) Algebraic properties (laws of arithmetic), (2) order properties, (3) Completeness Axiom; summarised as saying the real numbers form a complete ordered field. (1) The algebraic properties of R You were told in Analysis I: Addition: for each pair of real numbers a and b there exists a unique real number a + b such that + is a commutative and associative operation; • there exists in R a zero, 0, for addition: a +0=0+ a = a for all a R; • ∈ for each a R there exists an additive inverse a R such that a+( a)=( a)+a = 0. • ∈ − ∈ − − Multiplication: for each pair of real numbers a and b there exists a unique real number a b such that · is a commutative and associative operation; • · there exists in R an identity, 1, for multiplication: a 1 = 1 a = a for all a R; • · · ∈ for each a R with a = 0 there exists an additive inverse a−1 R such that a a−1 = • a−1 a = 1.∈ ∈ · · Addition and multiplication together: forall a,b,c R, we have the distributive law a (b + c)= a b + a c.
    [Show full text]
  • Polya Enumeration Theorem
    Polya Enumeration Theorem Sebastian Zhu, Vincent Fan MIT PRIMES December 7th, 2018 Sebastian Zhu, Vincent Fan (MIT PRIMES) Polya Enumeration Thorem December 7th, 2018 1 / 14 Usually a · b is written simply as ab. In particular they can be functions under function composition group in which every element equals power of a single element is called a cylic group Ex. Z is a group under normal addition. The identity is 0 and the inverse of a is −a. Group is cyclic with generator 1 Groups Definition (Group) A group is a set G together with a binary operation · such that the following axioms hold: a · b 2 G for all a; b 2 G (closure) a · (b · c) = (a · b) · c for all a; b; c 2 G (associativity) 9e 2 G such that for all a 2 G, a · e = e · a = a (identity) for each a 2 G, 9a−1 2 G such that a · a−1 = a−1 · a = e (inverse) Sebastian Zhu, Vincent Fan (MIT PRIMES) Polya Enumeration Thorem December 7th, 2018 2 / 14 In particular they can be functions under function composition group in which every element equals power of a single element is called a cylic group Ex. Z is a group under normal addition. The identity is 0 and the inverse of a is −a. Group is cyclic with generator 1 Groups Definition (Group) A group is a set G together with a binary operation · such that the following axioms hold: a · b 2 G for all a; b 2 G (closure) a · (b · c) = (a · b) · c for all a; b; c 2 G (associativity) 9e 2 G such that for all a 2 G, a · e = e · a = a (identity) for each a 2 G, 9a−1 2 G such that a · a−1 = a−1 · a = e (inverse) Usually a · b is written simply as ab.
    [Show full text]
  • From Loop Groups to 2-Groups
    From Loop Groups To 2-Groups John C. Baez Joint work with: Aaron Lauda Alissa Crans Danny Stevenson & Urs Schreiber 1 G f 3+ f 1 D 2 More details at: http://math.ucr.edu/home/baez/2group/ 1 Higher Gauge Theory Ordinary gauge theory describes how point particles trans- form as we move them along 1-dimensional paths. It is natural to assign a group element to each path: g • & • since composition of paths then corresponds to multipli- cation: g g0 • & • & • while reversing the direction of a path corresponds to taking inverses: g−1 • x • and the associative law makes this composite unambigu- ous: g g0 g00 • & • & • & • In short: the topology dictates the algebra! 2 Higher gauge theory describes the parallel transport not only of point particles, but also 1-dimensional strings. For this we must categorify the notion of a group! A `2-group' has objects: g • & • and also morphisms: g & • f 8 • 8 g0 We can multiply objects: g g0 • & • & • multiply morphisms: g1 g2 & & • f1 8 • f2 8 • 8 8 0 0 g1 g2 and also compose morphisms: g 0 f g / • B• f 0 g00 Various laws should hold.... In fact, we can make this precise and categorify the whole theory of Lie groups, Lie algebras, bundles, connections and curvature. But for now, let's just look at 2-groups and Lie 2-algebras. 3 2-Groups A group is a monoid where every element has an inverse. Let's categorify this! A 2-group is a monoidal category where every object x has a `weak inverse': x ⊗ y ∼= y ⊗ x ∼= I and every morphism f has an inverse: fg = gf = 1: A homomorphism between 2-groups is a monoidal func- tors.
    [Show full text]
  • Chapter I: Groups 1 Semigroups and Monoids
    Chapter I: Groups 1 Semigroups and Monoids 1.1 Definition Let S be a set. (a) A binary operation on S is a map b : S × S ! S. Usually, b(x; y) is abbreviated by xy, x · y, x ∗ y, x • y, x ◦ y, x + y, etc. (b) Let (x; y) 7! x ∗ y be a binary operation on S. (i) ∗ is called associative, if (x ∗ y) ∗ z = x ∗ (y ∗ z) for all x; y; z 2 S. (ii) ∗ is called commutative, if x ∗ y = y ∗ x for all x; y 2 S. (iii) An element e 2 S is called a left (resp. right) identity, if e ∗ x = x (resp. x ∗ e = x) for all x 2 S. It is called an identity element if it is a left and right identity. (c) The set S together with a binary operation ∗ is called a semigroup if ∗ is associative. A semigroup (S; ∗) is called a monoid if it has an identity element. 1.2 Examples (a) Addition (resp. multiplication) on N0 = f0; 1; 2;:::g is a binary operation which is associative and commutative. The element 0 (resp. 1) is an identity element. Hence (N0; +) and (N0; ·) are commutative monoids. N := f1; 2;:::g together with addition is a commutative semigroup, but not a monoid. (N; ·) is a commutative monoid. (b) Let X be a set and denote by P(X) the set of its subsets (its power set). Then, (P(X); [) and (P(X); \) are commutative monoids with respective identities ; and X. (c) x∗y := (x+y)=2 defines a binary operation on Q which is commutative but not associative.
    [Show full text]