MODERN ALGEBRA WITH APPLICATIONS Second Edition
WILLIAM J. GILBERT University of Waterloo Department of Pure Mathematics Waterloo, Ontario, Canada W. KEITH NICHOLSON University of Calgary Department of Mathematics and Statistics Calgary, Alberta, Canada
A JOHN WILEY & SONS, INC., PUBLICATION
MODERN ALGEBRA WITH APPLICATIONS
PURE AND APPLIED MATHEMATICS A Wiley-Interscience Series of Texts, Monograph, and Tracts Founded by RICHARD COURANT Editors: MYRON B. ALLEN III, DAVID A. COX, PETER LAX Editors Emeriti: PETER HILTON, HARRY HOCHSTADT, JOHN TOLAND A complete list of the titles in this series appears at the end of this volume.
MODERN ALGEBRA WITH APPLICATIONS Second Edition
WILLIAM J. GILBERT University of Waterloo Department of Pure Mathematics Waterloo, Ontario, Canada W. KEITH NICHOLSON University of Calgary Department of Mathematics and Statistics Calgary, Alberta, Canada
A JOHN WILEY & SONS, INC., PUBLICATION
Cover: Still image from the applet KaleidoHedron, Copyright 2000 by Greg Egan, from his website http://www.netspace.net.au/∼gregegan/. The pattern has the symmetry of the icosahedral group. Copyright 2004 by John Wiley & Sons, Inc. All rights reserved. Published by John Wiley & Sons, Inc., Hoboken, New Jersey. Published simultaneously in Canada. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400, fax 978-750-4470, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 111 River Street, Hoboken, NJ 07030, (201) 748-6011, fax (201) 748-6008, e-mail:
[email protected]. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages. For general information on our other products and services please contact our Customer Care Department within the U.S. at 877-762-2974, outside the U.S. at 317-572-3993 or fax 317-572-4002. Wiley also publishes its books in a variety of electronic formats. Some content that appears in print, however, may not be available in electronic format. Library of Congress Cataloging-in-Publication Data: Gilbert, William J., 1941– Modern algebra with applications / William J. Gilbert, W. Keith Nicholson.—2nd ed. p. cm.—(Pure and applied mathematics) Includes bibliographical references and index. ISBN 0-471-41451-4 (cloth) 1. Algebra, Abstract. I. Nicholson, W. Keith. II. Title. III. Pure and applied mathematics (John Wiley & Sons : Unnumbered) QA162.G53 2003 512—dc21 2003049734 Printed in the United States of America. 10 9 8 7 6 5 4 3 2 1
CONTENTS
Preface to the First Edition
ix
Preface to the Second Edition
xiii
List of Symbols 1
xv
Introduction
1
Classical Algebra, 1 Modern Algebra, 2 Binary Operations, 2 Algebraic Structures, 4 Extending Number Systems, 2
5
Boolean Algebras
7
Algebra of Sets, 7 Number of Elements in a Set, 11 Boolean Algebras, 13 Propositional Logic, 16 Switching Circuits, 19 Divisors, 21 Posets and Lattices, 23 Normal Forms and Simplification of Circuits, Transistor Gates, 36 Representation Theorem, 39 Exercises, 41 3
Groups Groups and Symmetries, Subgroups, 54
26
47 48
v
vi
CONTENTS
Cyclic Groups and Dihedral Groups, 56 Morphisms, 60 Permutation Groups, 63 Even and Odd Permutations, 67 Cayley’s Representation Theorem, 71 Exercises, 71 4
Quotient Groups
76
Equivalence Relations, 76 Cosets and Lagrange’s Theorem, 78 Normal Subgroups and Quotient Groups, Morphism Theorem, 86 Direct Products, 91 Groups of Low Order, 94 Action of a Group on a Set, 96 Exercises, 99 5
82
Symmetry Groups in Three Dimensions Translations and the Euclidean Group, 104 Matrix Groups, 107 Finite Groups in Two Dimensions, 109 Proper Rotations of Regular Solids, 111 Finite Rotation Groups in Three Dimensions, Crystallographic Groups, 120 Exercises, 121
6
116
P´olya–Burnside Method of Enumeration Burnside’s Theorem, 124 Necklace Problems, 126 Coloring Polyhedra, 128 Counting Switching Circuits, Exercises, 134
7
104
124
130
Monoids and Machines
137
Monoids and Semigroups, 137 Finite-State Machines, 142 Quotient Monoids and the Monoid of a Machine, 144 Exercises, 149 8
Rings and Fields Rings, 155 Integral Domains and Fields, 159 Subrings and Morphisms of Rings, 161
155
CONTENTS
vii
New Rings from Old, 164 Field of Fractions, 170 Convolution Fractions, 172 Exercises, 176 9
Polynomial and Euclidean Rings
180
Euclidean Rings, 180 Euclidean Algorithm, 184 Unique Factorization, 187 Factoring Real and Complex Polynomials, 190 Factoring Rational and Integral Polynomials, 192 Factoring Polynomials over Finite Fields, 195 Linear Congruences and the Chinese Remainder Theorem, 197 Exercises, 201 10
Quotient Rings
204
Ideals and Quotient Rings, 204 Computations in Quotient Rings, 207 Morphism Theorem, 209 Quotient Polynomial Rings That Are Fields, Exercises, 214 11
Field Extensions
210
218
Field Extensions, 218 Algebraic Numbers, 221 Galois Fields, 225 Primitive Elements, 228 Exercises, 232 12
Latin Squares
236
Latin Squares, 236 Orthogonal Latin Squares, 238 Finite Geometries, 242 Magic Squares, 245 Exercises, 249 13
Geometrical Constructions Constructible Numbers, 251 Duplicating a Cube, 256 Trisecting an Angle, 257 Squaring the Circle, 259 Constructing Regular Polygons,
251
259
viii
CONTENTS
Nonconstructible Number of Degree 4, 260 Exercises, 262 14
Error-Correcting Codes
264
The Coding Problem, 266 Simple Codes, 267 Polynomial Representation, 270 Matrix Representation, 276 Error Correcting and Decoding, 280 BCH Codes, 284 Exercises, 288 Appendix 1: Proofs
293
Appendix 2: Integers
296
Bibliography and References
306
Answers to Odd-Numbered Exercises
309
Index
323
PREFACE TO THE FIRST EDITION
Until recently the applications of modern algebra were mainly confined to other branches of mathematics. However, the importance of modern algebra and discrete structures to many areas of science and technology is now growing rapidly. It is being used extensively in computing science, physics, chemistry, and data communication as well as in new areas of mathematics such as combinatorics. We believe that the fundamentals of these applications can now be taught at the junior level. This book therefore constitutes a one-year course in modern algebra for those students who have been exposed to some linear algebra. It contains the essentials of a first course in modern algebra together with a wide variety of applications. Modern algebra is usually taught from the point of view of its intrinsic interest, and students are told that applications will appear in later courses. Many students lose interest when they do not see the relevance of the subject and often become skeptical of the perennial explanation that the material will be used later. However, we believe that by providing interesting and nontrivial applications as we proceed, the student will better appreciate and understand the subject. We cover all the group, ring, and field theory that is usually contained in a standard modern algebra course; the exact sections containing this material are indicated in the table of contents. We stop short of the Sylow theorems and Galois theory. These topics could only be touched on in a first course, and we feel that more time should be spent on them if they are to be appreciated. In Chapter 2 we discuss boolean algebras and their application to switching circuits. These provide a good example of algebraic structures whose elements are nonnumerical. However, many instructors may prefer to postpone or omit this chapter and start with the group theory in Chapters 3 and 4. Groups are viewed as describing symmetries in nature and in mathematics. In keeping with this view, the rotation groups of the regular solids are investigated in Chapter 5. This material provides a good starting point for students interested in applying group theory to physics and chemistry. Chapter 6 introduces the P´olya–Burnside method of enumerating equivalence classes of sets of symmetries and provides a very practical application of group theory to combinatorics. Monoids are becoming more ix
x
PREFACE TO THE FIRST EDITION
important algebraic structures today; these are discussed in Chapter 7 and are applied to finite-state machines. The ring and field theory is covered in Chapters 8–11. This theory is motivated by the desire to extend the familiar number systems to obtain the Galois fields and to discover the structure of various subfields of the real and complex numbers. Groups are used in Chapter 12 to construct latin squares, whereas Galois fields are used to construct orthogonal latin squares. These can be used to design statistical experiments. We also indicate the close relationship between orthogonal latin squares and finite geometries. In Chapter 13 field extensions are used to show that some famous geometrical constructions, such as the trisection of an angle and the squaring of the circle, are impossible to perform using only a straightedge and compass. Finally, Chapter 14 gives an introduction to coding theory using polynomial and matrix techniques. We do not give exhaustive treatments of any of the applications. We only go so far as to give the flavor without becoming too involved in technical complications.
1 Introduction 2 Boolean Algebras
8 Rings and Fields
3 Groups
7 Monoids and Machines
4 Quotient Groups
6 Pólya–Burnside Method of Enumeration
5 Symmetry Groups in Three Dimensions
9 Polynomial and Euclidean Rings
10 Quotient Rings
11 Field Extensions
12 Latin Squares
13 Geometrical Constructions
14 Error-Correcting Codes
Figure P.1.
Structure of the chapters.
PREFACE TO THE FIRST EDITION
xi
The interested reader may delve further into any topic by consulting the books in the bibliography. It is important to realize that the study of these applications is not the only reason for learning modern algebra. These examples illustrate the varied uses to which algebra has been put in the past, and it is extremely likely that many more different applications will be found in the future. One cannot understand mathematics without doing numerous examples. There are a total of over 600 exercises of varying difficulty, at the ends of chapters. Answers to the odd-numbered exercises are given at the back of the book. Figure P.1 illustrates the interdependence of the chapters. A solid line indicates a necessary prerequisite for the whole chapter, and a dashed line indicates a prerequisite for one section of the chapter. Since the book contains more than sufficient material for a two-term course, various sections or chapters may be omitted. The choice of topics will depend on the interests of the students and the instructor. However, to preserve the essence of the book, the instructor should be careful not to devote most of the course to the theory, but should leave sufficient time for the applications to be appreciated. I would like to thank all my students and colleagues at the University of ˇ Djokovi´c, Denis Higgs, and Keith Rowe, Waterloo, especially Harry Davis, D. Z. who offered helpful suggestions during the various stages of the manuscript. I am very grateful to Michael Boyle, Ian McGee, Juris Step´rans, and Jack Weiner for their help in preparing and proofreading the preliminary versions and the final draft. Finally, I would like to thank Sue Cooper, Annemarie DeBrusk, Lois Graham, and Denise Stack for their excellent typing of the different drafts, and Nadia Bahar for tracing all the figures. Waterloo, Ontario, Canada April 1976
WILLIAM J. GILBERT
PREFACE TO THE SECOND EDITION
In addition to improvements in exposition, the second edition contains the following new items: ž ž ž
ž ž ž ž ž ž ž ž
New shorter proof of the parity theorem using the action of the symmetric group on the discriminant polynomial New proof that linear isometries are linear, and more detail about their relation to orthogonal matrices Appendix on methods of proof for beginning students, including the definition of an implication, proof by contradiction, converses, and logical equivalence Appendix on basic number theory covering induction, greatest common divisors, least common multiples, and the prime factorization theorem New material on the order of an element and cyclic groups More detail about the lattice of divisors of an integer New historical notes on Fermat’s last theorem, the classification theorem for finite simple groups, finite affine planes, and more More detail on set theory and composition of functions 26 new exercises, 46 counting parts Updated symbols and notation Updated bibliography
February 2003
WILLIAM J. GILBERT W. KEITH NICHOLSON
xiii
LIST OF SYMBOLS
A An C C∗ Cn C[0, ∞) Dn Dn d(u, v) deg e eG E(n) F Fn Fixg FM(A) gcd(a, b) GF(n) GL(n, F ) H I Ik Imf Kerf lcm(a, b) L(Rn , Rn ) Mn (R) N NAND NOR O(n) Orb x
Algebraic numbers, 233 Alternating group on n elements, 70 Complex numbers, 4 Nonzero complex numbers, 48 Cyclic group of order n, 58 Continuous real valued functions on [0, ∞), 173 Dihedral group of order 2n, 58 Divisors of n, 22 Hamming distance between u and v, 269 Degree of a polynomial, 166 Identity element of a group or monoid, 48, 137 Identity element in the group G, 61 Euclidean group in n dimensions, 104 Field, 4, 160 Switching functions of n variables, 28 Set of elements fixed under the action of g, 125 Free monoid on A, 140 Greatest common divisor of a and b, 184, 299 Galois field of order n, 227 General linear group of dimension n over F , 107 Quaternions, 177 Identity matrix, 4 k × k identity matrix, 277 Image of f , 87 Kernel of f , 86 Least common multiple of a and b, 184, 303 Linear transformations from Rn to Rn , 163 n × n matrices with entries from R, 4, 166 Nonnegative integers, 55 NOT-AND, 28, 36 NOT-OR, 28, 36 Orthogonal group of dimension n, 105 Orbit of x, 97 xv
xvi
P P (X) Q Q∗ Q R R∗ R+ S(X) Sn SO(n) Stab x SU(n) T(n) U(n) Z Zn Z∗n δ(x)
∅ φ(n) * Ž
− ∧ ∨ ⊆ ⇒ ⇔ ∼ = ≡ mod n ≡ mod H |X| |G : H | R∗ a a −1 A ∩ ∪
LIST OF SYMBOLS
Positive integers, 3 Power set of X, 8 Rational numbers, 6 Nonzero rational numbers, 48 Quaternion group, 73 Real numbers, 2 Nonzero real numbers, 48 Positive real numbers, 5 Symmetric group of X, 50 Symmetric group on n elements, 63 Special orthogonal group of dimension n, 108 Stabilizer of x, 97 Special unitary group of dimension n, 108 Translations in n dimensions, 104 Unitary group of dimension n, 108 Integers, 5 Integers modulo n, 5, 78 Integers modulo n coprime to n, 102 Dirac delta function, or remainder in general division algorithm, 172, 181 Null sequence, 140 Empty set, 7 Euler φ-function, 102 General binary operation or concatenation, 2, 140 Convolution, 168, 173 Composition, 49 Symmetric difference, 9, 29 Difference, 9 Meet, 14 Join, 14 Inclusion, 7 Less than or equal, 23 Implies, 17, 293 If and only if, 18, 295 Isomorphic, 60, 172 Congruent modulo n, 77 Congruent modulo H , 79 Number of elements in X, 12, 56 Index of H in G, 80 Invertible elements in the ring R, 188 Complement of a in a boolean algebra, 14, 28 Inverse of a, 3, 48 Complement of the set A, 8 Intersection of sets, 8 Union of sets, 8
LIST OF SYMBOLS
∈ A–B ||v|| v·w VT (a) (a 1 a2 . . . an ) 1 2...n a 1a2 . . . an n r F (a) F (a1 , . . . , an ) (n, k)-code (X, ) (R, +, ·) (K, ∧, ∨, ) [x] [x]n R[x] R[[x]] R[x1 , . . . , xn ] [K : F ] XY RN ai G×H S×S S/E G/H R/I a|b l//m Ha aH I +r
Membership in a set, 7 Set difference, 9 Length of v in Rn , 105 Inner product in Rn , 105 Transpose of the matrix V , 104 End of a proof or example, 9 Ideal generated by a, 204 n-cycle, 64 Permutation, 63 Binomial coefficient n!/r!(n − r)!, 129 Smallest field containing F and a, 220 Smallest field containing F and a1 , . . . , an , 220 Code of length n with messages of length k, 266 Group or monoid, 5, 48, 137 Ring, 156 Boolean algebra, 14 Equivalence class containing x, 77 Congruence class modulo n containing x, 100 Polynomials in x with coefficients from R, 167 Formal power series in x with coefficients from R, 169 Polynomials in x1 , . . . , xn with coefficients from R, 168 Degree of K over F , 219 Set of functions from Y to X, 138 Sequences of elements from R, 168 Sequence whose ith term is ai , 168 Direct product of G and H , 91 Direct product of sets, 2 Quotient set, 77 Quotient group or set of right cosets, 83 Quotient ring, 206 a divides b, 21, 184, 299 l is parallel to m, 242 Right coset of H containing a, 79 Left coset of H containing a, 82 Coset of I containing r, 205
xvii
1 INTRODUCTION
Algebra can be defined as the manipulation of symbols. Its history falls into two distinct parts, with the dividing date being approximately 1800. The algebra done before the nineteenth century is called classical algebra, whereas most of that done later is called modern algebra or abstract algebra.
CLASSICAL ALGEBRA The technique of introducing a symbol, such as x, to represent an unknown number in solving problems was known to the ancient Greeks. This symbol could be manipulated just like the arithmetic symbols until a solution was obtained. Classical algebra can be characterized by the fact that each symbol always stood for a number. This number could be integral, real, or complex. However, in the seventeenth and eighteenth centuries, mathematicians were not quite sure whether the square root of −1 was a number. It was not until the nineteenth century and the beginning of modern algebra that a satisfactory explanation of the complex numbers was given. The main goal of classical algebra was to use algebraic manipulation to solve polynomial equations. Classical algebra succeeded in producing algorithms for solving all polynomial equations in one variable of degree at most four. However, it was shown by Niels Henrik Abel (1802–1829), by modern algebraic methods, that it was not always possible to solve a polynomial equation of degree five or higher in terms of nth roots. Classical algebra also developed methods for dealing with linear equations containing several variables, but little was known about the solution of nonlinear equations. Classical algebra provided a powerful tool for tackling many scientific problems, and it is still extremely important today. Perhaps the most useful mathematical tool in science, engineering, and the social sciences is the method of solution of a system of linear equations together with all its allied linear algebra.
Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 1
2
1 INTRODUCTION
MODERN ALGEBRA In the nineteenth century it was gradually realized that mathematical symbols did not necessarily have to stand for numbers; in fact, it was not necessary that they stand for anything at all! From this realization emerged what is now known as modern algebra or abstract algebra. For example, the symbols could be interpreted as symmetries of an object, as the position of a switch, as an instruction to a machine, or as a way to design a statistical experiment. The symbols could be manipulated using some of the usual rules for numbers. For example, the polynomial 3x 2 + 2x − 1 could be added to and multiplied by other polynomials without ever having to interpret the symbol x as a number. Modern algebra has two basic uses. The first is to describe patterns or symmetries that occur in nature and in mathematics. For example, it can describe the different crystal formations in which certain chemical substances are found and can be used to show the similarity between the logic of switching circuits and the algebra of subsets of a set. The second basic use of modern algebra is to extend the common number systems naturally to other useful systems.
BINARY OPERATIONS The symbols that are to be manipulated are elements of some set, and the manipulation is done by performing certain operations on elements of that set. Examples of such operations are addition and multiplication on the set of real numbers. As shown in Figure 1.1, we can visualize an operation as a “black box” with various inputs coming from a set S and one output, which combines the inputs in some specified way. If the black box has two inputs, the operation combines two elements of the set to form a third. Such an operation is called a binary operation. If there is only one input, the operation is called unary. An example of a unary operation is finding the reciprocal of a nonzero real number. If S is a set, the direct product S × S consists of all ordered pairs (a, b) with a, b ∈ S. Here the term ordered means that (a, b) = (a1 , b1 ) if and only if a = a1 and b = b1 . For example, if we denote the set of all real numbers by R, then R × R is the euclidean plane. Using this terminology, a binary operation, , on a set S is really just a particular function from S × S to S. We denote the image of the pair (a, b)
a
a∗b
c′
c
b Binary operation
Unary operation
Figure 1.1
BINARY OPERATIONS
3
under this function by a b. In other words, the binary operation assigns to any two elements a and b of S the element a b of S. We often refer to an operation as being closed to emphasize that each element a b belongs to the set S and not to a possibly larger set. Many symbols are used for binary operations; the most common are +, ·, −, Ž , ÷, ∪, ∩, ∧, and ∨. A unary operation on S is just a function from S to S. The image of c under a unary operation is usually denoted by a symbol such as c , c, c−1 , or (−c). Let P = {1, 2, 3, . . .} be the set of positive integers. Addition and multiplication are both binary operations on P, because, if x, y ∈ P, then x + y and x · y ∈ P. However, subtraction is not a binary operation on P because, for instance, 1 − 2 ∈ / P. Other natural binary operations on P are exponentiation and the greatest common divisor, since for any two positive integers x and y, x y and gcd(x, y) are well-defined elements of P. Addition, multiplication, and subtraction are all binary operations on R because x + y, x · y, and x − y are real numbers for every pair of real numbers x and y. The symbol − stands for a binary operation when used in an expression such as x − y, but it stands for the unary operation of taking the negative when used in the expression −x. Division is not a binary operation on R because division by zero is undefined. However, division is a binary operation on R − {0}, the set of nonzero real numbers. A binary operation on a finite set can often be presented conveniently by means of a table. For example, consider the set T = {a, b, c}, containing three elements. A binary operation on T is defined by Table 1.1. In this table, x y is the element in row x and column y. For example, b c = b and c b = a. One important binary operation is the composition of symmetries of a given figure or object. Consider a square lying in a plane. The set S of symmetries of this square is the set of mappings of the square to itself that preserve distances. Figure 1.2 illustrates the composition of two such symmetries to form a third symmetry. Most of the binary operations we use have one or more of the following special properties. Let be a binary operation on a set S. This operation is called associative if a (b c) = (a b) c for all a, b, c ∈ S. The operation is called commutative if a b = b a for all a, b ∈ S. The element e ∈ S is said to be an identity for if a e = e a = a for all a ∈ S. If is a binary operation on S that has an identity e, then b is called the inverse of a with respect to if a b = b a = e. We usually denote the
TABLE 1.1. Binary Operation on {a, b, c}
a
b
c
a b c
b c c
a a a
a b b
4
1 INTRODUCTION Square in its original position 2
1
3
4
Rotation through p/2
1
4
2
3
Flip about the vertical axis
4
1
3
2
Flip about a diagonal axis
Figure 1.2.
Composition of symmetries of a square.
inverse of a by a −1 ; however, if the operation is addition, the inverse is denoted by −a. If and Ž are two binary operations on S, then Ž is said to be distributive over if a Ž (b c) = (a Ž b) (a Ž c) and (b c) Ž a = (b Ž a) (c Ž a) for all a, b, c ∈ S. Addition and multiplication are both associative and commutative operations on the set R of real numbers. The identity for addition is 0, whereas the multiplicative identity is 1. Every real number, a, has an inverse under addition, namely, its negative, −a. Every nonzero real number a has a multiplicative inverse, a −1 . Furthermore, multiplication is distributive over addition because a · (b + c) = (a · b) + (a · c) and (b + c) · a = (b · a) + (c · a); however, addition is not distributive over multiplication because a + (b · c) = (a + b) · (a + c) in general. Denote the set of n × n real matrices by Mn (R). Matrix multiplication is an associative operation on Mn (R), but it is not commutative (unless n = 1). The matrix I , whose (i, j )th entry is 1 if i = j and 0 otherwise, is the multiplicative identity. Matrices with multiplicative inverses are called nonsingular. ALGEBRAIC STRUCTURES A set, together with one or more operations on the set, is called an algebraic structure. The set is called the underlying set of the structure. Modern algebra is the study of these structures; in later chapters, we examine various types of algebraic structures. For example, a field is an algebraic structure consisting of a set F together with two binary operations, usually denoted by + and ·, that satisfy certain conditions. We denote such a structure by (F, +, ·). In order to understand a particular structure, we usually begin by examining its substructures. The underlying set of a substructure is a subset of the underlying set of the structure, and the operations in both structures are the same. For example, the set of complex numbers, C, contains the set of real numbers, R, as a subset. The operations of addition and multiplication on C restrict to the same operations on R, and therefore (R, +, ·) is a substructure of (C, +, ·).
EXTENDING NUMBER SYSTEMS
5
Two algebraic structures of a particular type may be compared by means of structure-preserving functions called morphisms. This concept of morphism is one of the fundamental notions of modern algebra. We encounter it among every algebraic structure we consider. More precisely, let (S, ) and (T , Ž ) be two algebraic structures consisting of the sets S and T , together with the binary operations on S and Ž on T . Then a function f : S → T is said to be a morphism from (S, ) to (T , Ž ) if for every x, y ∈ S, f (x y) = f (x) Ž f (y). If the structures contain more than one operation, the morphism must preserve all these operations. Furthermore, if the structures have identities, these must be preserved, too. As an example of a morphism, consider the set of all integers, Z, under the operation of addition and the set of positive real numbers, R+ , under multiplication. The function f : Z → R+ defined by f (x) = ex is a morphism from (Z, +) to (R+ , ·). Multiplication of the exponentials ex and ey corresponds to addition of their exponents x and y. A vector space is an algebraic structure whose underlying set is a set of vectors. Its operations consist of the binary operation of addition and, for each scalar λ, a unary operation of multiplication by λ. A function f : S → T , between vector spaces, is a morphism if f (x + y) = f (x) + f (y) and f (λx) = λf (x) for all vectors x and y in the domain S and all scalars λ. Such a vector space morphism is usually called a linear transformation. A morphism preserves some, but not necessarily all, of the properties of the domain structure. However, if a morphism between two structures is a bijective function (that is, one-to-one and onto), it is called an isomorphism, and the structures are called isomorphic. Isomorphic structures have identical properties, and they are indistinguishable from an algebraic point of view. For example, two vector spaces of the same finite dimension over a field F are isomorphic. One important method of constructing new algebraic structures from old ones is by means of equivalence relations. If (S, ) is a structure consisting of the set S with the binary operation on it, the equivalence relation ∼ on S is said to be compatible with if, whenever a ∼ b and c ∼ d, it follows that a c ∼ b d. Such a compatible equivalence relation allows us to construct a new structure called the quotient structure, whose underlying set is the set of equivalence classes. For example, the quotient structure of the integers, (Z, +, ·), under the congruence relation modulo n, is the set of integers modulo n, (Zn , +, ·) (see Appendix 2).
EXTENDING NUMBER SYSTEMS In the words of Leopold Kronecker (1823–1891), “God created the natural numbers; everything else was man’s handiwork.” Starting with the set of natural
6
1 INTRODUCTION
numbers under addition and multiplication, we show how this can be extended to other algebraic systems that satisfy properties not held by the natural numbers. The integers (Z, +, ·) is the smallest system containing the natural numbers, in which addition has an identity (the zero) and every element has an inverse under addition (its negative). The integers have an identity under multiplication (the element 1), but 1 and −1 are the only elements with multiplicative inverses. A standard construction will produce the field of fractions of the integers, which is the rational number system (Q, +, ·), and we show that this is the smallest field containing (Z, +, ·). We can now divide by nonzero elements in Q and solve every linear equation of the form ax = b (a = 0). However, not all quadratic equations have solutions in Q; for example, x 2 − 2 = 0 has no rational solution. The next step is to extend the rationals to the real number system (R, +, ·). The construction of the real numbers requires the use of nonalgebraic concepts such as Dedekind cuts or Cauchy sequences, and we will not pursue this, being content to assume that they have been constructed. Even though many polynomial equations have real solutions, there are some, such as x 2 + 1 = 0, that do not. We show how to extend the real number system by adjoining a root of x 2 + 1 to obtain the complex number system (C, +, ·). The complex number system is really the end of the line, because Carl Friedrich Gauss (1777–1855), in his doctoral thesis, proved that any nonconstant polynomial with real or complex coefficients has a root in the complex numbers. This result is now known as the fundamental theorem of algebra. However, the classical number system can be generalized in a different way. We can look for fields that are not subfields of (C, +, ·). An example of such a field is the system of integers modulo a prime p, (Zp , +, ·). All the usual operations of addition, subtraction, multiplication, and division by nonzero elements can be performed in Zp . We show that these fields can be extended and that for each prime p and positive integer n, there is a field (GF(p n ), +, ·) with pn elements. These finite fields are called Galois fields after the French mathemati´ cian Evariste Galois. We use Galois fields in the construction of orthogonal latin squares and in coding theory.
2 BOOLEAN ALGEBRAS
A boolean algebra is a good example of a type of algebraic structure in which the symbols usually represent nonnumerical objects. This algebra is modeled after the algebra of subsets of a set under the binary operations of union and intersection and the unary operation of complementation. However, boolean algebra has important applications to switching circuits, where each symbol represents a particular electrical circuit or switch. The origin of boolean algebra dates back to 1847, when the English mathematician George Boole (1815–1864) published a slim volume entitled The Mathematical Analysis of Logic, which showed how algebraic symbols could be applied to logic. The manipulation of logical propositions by means of boolean algebra is now called the propositional calculus. At the end of this chapter, we show that any finite boolean algebra is equivalent to the algebra of subsets of a set; in other words, there is a boolean algebra isomorphism between the two algebras. ALGEBRA OF SETS In this section, we develop some properties of the basic operations on sets. A set is often referred to informally as a collection of objects called the elements of the set. This is not a proper definition—collection is just another word for set. What is clear is that there are sets, and there is a notion of being an element (or member) of a set. These fundamental ideas are the primitive concepts of set theory and are left undefined.∗ The fact that a is an element of a set X is denoted a ∈ X. If every element of X is also an element of Y , we write X ⊆ Y (equivalently, Y ⊇ X) and say that X is contained in Y , or that X is a subset of Y . If X and Y have the same elements, we say that X and Y are equal sets and write X = Y . Hence X = Y if and only if both X ⊆ Y and Y ⊆ X. The set with no elements is called the empty set and is denoted as Ø. ∗ Certain basic properties of sets must also be assumed (called the axioms of the theory), but it is not our intention to go into this here.
Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 7
8
2 BOOLEAN ALGEBRAS
Let X be any set. The set of all subsets of X is called the power set of X and is denoted by P (X). Hence P (X) = {A|A ⊆ X}. Thus if X = {a, b}, then P (X) = {Ø, {a}, {b}, X}. If X = {1, 2, 3}, then P (X) = {Ø, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, X}. If A and B are subsets of a set X, their intersection A ∩ B is defined to be the set of elements common to A and B, and their union A ∪ B is the set of elements in A or B (or both). More formally, A ∩ B = {x|x ∈ A and x ∈ B} and A ∪ B = {x|x ∈ A or x ∈ B}. The complement of A in X is A = {x|x ∈ X and x ∈ / A} and is the set of elements in X that are not in A. The shaded areas of the Venn diagrams in Figure 2.1 illustrate these operations. Union and intersection are both binary operations on the power set P (X), whereas complementation is a unary operation on P (X). For example, with X = {a, b}, the tables for the structures (P (X), ∩), (P (X), ∪) and (P (X), − ) are given in Table 2.1, where we write A for {a} and B for {b}. Proposition 2.1. The following are some of the more important relations involving the operations ∩, ∪, and − , holding for all A, B, C ∈ P (X). (i) A ∩ (B ∩ C) = (A ∩ B) ∩ C. (iii) A ∩ B = B ∩ A. (v) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C). (vii) A ∩ X = A. (ix) A ∩ A = Ø. (xi) A ∩ Ø = Ø. (xiii) A ∩ (A ∪ B) = A.
(ii) A ∪ (B ∪ C) = (A ∪ B) ∪ C. (iv) A ∪ B = B ∪ A. (vi) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). (viii) A ∪ Ø = A. (x) A ∪ A = X. (xii) A ∪ X = X. (xiv) A ∪ (A ∩ B) = A.
X
X A
B
A
A∩B
Figure 2.1.
X
B
A
A∪B
– A
Venn diagrams.
TABLE 2.1. Intersection, Union, and Complements in P ({a, b}) ∩
Ø
A
B
X
∪
Ø
A
B
X
Subset
Complement
Ø A B X
Ø Ø Ø Ø
Ø A Ø A
Ø Ø B B
Ø A B X
Ø A B X
Ø A B X
A A X X
B X B X
X X X X
Ø A B X
X B A Ø
ALGEBRA OF SETS
(xv) (xvii) (xix) (xxi)
9
A ∩ A = A. (A ∩ B) = A ∪ B. X = Ø. A = A.
(xvi) A ∪ A = A. (xviii) (A ∪ B) = A ∩ B. (xx) Ø = X.
Proof. We shall prove relations (v) and (x) and leave the proofs of the others to the reader. (v) A ∩ (B ∪ C) = {x|x ∈ A and x ∈ B ∪ C} = {x|x ∈ A and (x ∈ B or x ∈ C)} = {x|(x ∈ A and x ∈ B) or (x ∈ A and x ∈ C)} = {x|x ∈ A ∩ B or x ∈ A ∩ C} = (A ∩ B) ∪ (A ∩ C). The Venn diagrams in Figure 2.2 illustrate this result. (x) A ∪ A = {x|x ∈ A or x ∈ A} = {x|x ∈ A or (x ∈ X and x ∈ / A)} = {x|(x ∈ X and x ∈ A) or (x ∈ X and x ∈ / A)}, since A ⊆ X = {x|x ∈ X and (x ∈ A or x ∈ / A)} = {x|x ∈ X}, since it is always true that x ∈ A or x ∈ /A = X. Relations (i)–(iv), (vii), and (viii) show that ∩ and ∪ are associative and commutative operations on P (X) with identities X and Ø, respectively. The only element with an inverse under ∩ is its identity X, and the only element with an inverse under ∪ is its identity Ø. Note the duality between ∩ and ∪. If these operations are interchanged in any relation, the resulting relation is also true. Another operation on P (X) is the difference of two subsets. It is defined by A − B = {x|x ∈ A and x ∈ / B} = A ∩ B. Since this operation is neither associative nor commutative, we introduce another operation AB, called the symmetric difference, illustrated in Figure 2.3,
B
A
C
C A ∩ (B ∪ C )
Figure 2.2.
B
A
(A ∩ B ) ∪ (A ∩ C )
Venn diagrams illustrating a distributive law.
10
2 BOOLEAN ALGEBRAS X
X B
A
A
A−B
Figure 2.3.
B A∆B
Difference and symmetric difference of sets.
defined by AB = (A ∩ B) ∪ (A ∩ B) = (A ∪ B) − (A ∩ B) = (A − B) ∪ (B − A). The symmetric difference of A and B is the set of elements in A or B, but not in both. This is often referred to as the exclusive OR function of A and B. Example 2.2. Write down the table for the structure (P (X), ) when X = {a, b}. Solution. The table is given in Table 2.2, where we write A for {a} and B for {b}. Proposition 2.3. The operation is associative and commutative on P (X); it has an identity Ø, and each element is its own inverse. That is, the following relations hold for all A, B, C ∈ P (X): (i) A(BC) = (AB)C. (iii) AØ = A.
(ii) AB = BA. (iv) AA = Ø.
Three further properties of the symmetric difference are: (v) AX = A. (vii) A ∩ (BC) = (A ∩ B)(A ∩ C).
(vi) AA = X.
Proof. (ii) follows because the definition of AB is symmetric in A and B. To prove (i) observe first that Proposition 2.1 gives BC = (B ∩ C) ∪ (B ∩ C) = (B ∪ C) ∩ (B ∪ C) = (B ∩ B) ∪ (B ∩ C) ∪ (C ∩ B) ∪ (C ∩ C) = (B ∩ C) ∪ (B ∩ C). TABLE 2.2. Symmetric Difference in P ({a, b})
Ø
A
B
X
Ø A B X
Ø A B X
A Ø X B
B X Ø A
X B A Ø
NUMBER OF ELEMENTS IN A SET
A
11
B
A
B
C
C
A ∆ (B ∆ C ) = (A ∆ B ) ∆ C
A ∩ (B ∆ C ) = (A ∩ B ) ∆ (A ∩ C )
Figure 2.4.
A
Venn diagrams.
B
A
B
C
C
A ∪ (B ∆ C )
(A ∪ B ) ∆ (A ∪ C )
Figure 2.5.
Venn diagrams of unequal expressions.
Hence A(BC) = {A ∩ (BC)} ∪ {A ∩ (BC)} = {A ∩ [(B ∩ C) ∪ (B ∩ C)]} ∪ {A ∩ [(B ∩ C) ∪ (B ∩ C)]} = (A ∩ B ∩ C) ∪ (A ∩ B ∩ C) ∪ (A ∩ B ∩ C) ∪ (A ∩ B ∩ C)). This expression is symmetric in A, B, and C, so (ii) gives A(BC) = C(AB) = (AB)C. We leave the proof of the other parts to the reader. Parts (i) and (vii) are illustrated in Figure 2.4. Relation (vii) of Proposition 2.3 is a distributive law and states that ∩ is distributive over . It is natural to ask whether ∪ is distributive over . Example 2.4. Is it true that A ∪ (BC) = (A ∪ B)(A ∪ C) for all A, B, C ∈ P (X)? Solution. The Venn diagrams for each side of the equation are given in Figure 2.5. If the shaded areas are not the same, we will be able to find a counter example. We see from the diagrams that the result will be false if A is nonempty. If A = X and B = C = Ø, then A ∪ (BC) = A, whereas (A ∪ B)(A ∪ C) = Ø; thus union is not distributive over symmetric difference.
NUMBER OF ELEMENTS IN A SET If a set X contains two or three elements, we have seen that P (X) contains 22 or 23 elements, respectively. This suggests the following general result on the number of subsets of a finite set.
12
2 BOOLEAN ALGEBRAS
Theorem 2.5. If X is a finite set with n elements, then P (X) contains 2n elements. Proof. Each of the n elements of X is either in a given subset A or not in A. Hence, in choosing a subset of X, we have two choices for each element, and these choices are independent. Therefore, the number of choices is 2n , and this is the number of subsets of X. If n = 0, then X = Ø and P (X) = {Ø}, which contains one element. Denote the number of elements of a set X by |X|. If A and B are finite disjoint sets (that is, A ∩ B = Ø), then |A ∪ B| = |A| + |B|. Proposition 2.6. For any two finite sets A and B, |A ∪ B| = |A| + |B| − |A ∩ B|. Proof. We can express A ∪ B as the disjoint union of A and B − A; also, B can be expressed as the disjoint union of B − A and A ∩ B as shown in Figure 2.6. Hence |A ∪ B| = |A| + |B − A| and |B| = |B − A| + |A ∩ B|. It follows that |A ∪ B| = |A| + |B| − |A ∩ B|. Proposition 2.7. For any three finite sets A, B, and C, |A ∪ B ∪ C| = |A| + |B| + |C| − |A ∩ B| − |A ∩ C| − |B ∩ C| + |A ∩ B ∩ C|. Proof. Write A ∪ B ∪ C as (A ∪ B) ∪ C. Then, by Proposition 2.6, |A ∪ B ∪ C| = |A ∪ B| + |C| − |(A ∪ B) ∩ C| = |A| + |B| − |A ∩ B| + |C| − |(A ∩ C) ∪ (B ∩ C)| = |A| + |B| + |C| − |A ∩ B| − |A ∩ C| − |B ∩ C| + |(A ∩ C) ∩ (B ∩ C)|. The result follows because (A ∩ C) ∩ (B ∩ C) = A ∩ B ∩ C.
A
B−A
Figure 2.6
A∩B B−A
BOOLEAN ALGEBRAS
13 C
B 520
60
110 20
200
10 120
Figure 2.7.
W
Different classes of commuters.
Example 2.8. A survey of 1000 commuters reported that 850 sometimes used a car, 200 a bicycle, and 350 walked, whereas 130 used a car and a bicycle, 220 used a car and walked, 30 used a bicycle and walked, and 20 used all three. Are these figures consistent? Solution. Let C, B, and W be the sets of commuters who sometimes used a car, a bicycle, and walked, respectively. Then |C ∪ B ∪ W | = |C| + |B| + |W | − |C ∩ B| − |C ∩ W | − |B ∩ W | + |C ∩ B ∩ W | = 850 + 200 + 350 − 130 − 220 − 30 + 20 = 1040. Since this number is greater than 1000, the figures must be inconsistent. The breakdown of the reported figures into their various classes is illustrated in Figure 2.7. The sum of all these numbers is 1040. Example 2.9. If 47% of the people in a community voted in a local election and 75% voted in a federal election, what is the least percentage that voted in both? Solution. Let L and F be the sets of people who voted in the local and federal elections, respectively. If n is the total number of voters in the community, then |L| + |F | − |L ∩ F | = |L ∪ F | n. It follows that 47 75 22 |L ∩ F | |L| + |F | − n = + −1 n= n. 100 100 100 Hence at least 22% voted in both elections.
BOOLEAN ALGEBRAS We now give the definition of an abstract boolean algebra in terms of a set with two binary operations and one unary operation on it. We show that various algebraic structures, such as the algebra of sets, the logic of propositions, and
14
2 BOOLEAN ALGEBRAS
the algebra of switching circuits are all boolean algebras. It then follows that any general result derived from the axioms will hold in all our examples of boolean algebras. It should be noted that this axiom system is only one of many equivalent ways of defining a boolean algebra. Another common way is to define a boolean algebra as a lattice satisfying certain properties (see the section “Posets and Lattices”). A boolean algebra (K, ∧, ∨, ) is a set K together with two binary operations ∧ and ∨, and a unary operation on K satisfying the following axioms for all A, B, C ∈ K: (i) A ∧ (B ∧ C) = (A ∧ B) ∧ C. (iii) (v)
(vii) (viii) (ix)
(ii) A ∨ (B ∨ C) = (A ∨ B) ∨ C. (associative laws) A ∧ B = B ∧ A. (iv) A ∨ B = B ∨ A. (commutative laws) A ∧ (B ∨ C) (vi) A ∨ (B ∧ C) = (A ∧ B) ∨ (A ∧ C). = (A ∨ B) ∧ (A ∨ C). (distributive laws) There is a zero element 0 in K such that A ∨ 0 = A. There is a unit element 1 in K such that A ∧ 1 = A. A ∧ A = 0. (x) A ∨ A = 1.
We call the operations ∧ and ∨, meet and join, respectively. The element A is called the complement of A. The associative axioms (i) and (ii) are redundant in the system above because with a little effort they can be deduced from the other axioms. However, since associativity is such an important property, we keep these properties as axioms. It follows from Proposition 2.1 that (P (X), ∩, ∪, − ) is a boolean algebra with Ø as zero and X as unit. When X = Ø, this boolean algebra of subsets contains one element, and this is both the zero and unit. It can be proved (see Exercise 2.17) that if the zero and unit elements are the same, the boolean algebra must have only one element. We can define a two-element boolean algebra ({0, 1}, ∧, ∨, ) by means of Table 2.3. Proposition 2.10. If the binary operation on the set K has an identity e such that a e = e a = a for all a ∈ K, then this identity is unique.
TABLE 2.3. Two-Element Boolean Algebra A
B
A∧B
A∨B
A
A
0 0 1 1
0 1 0 1
0 0 0 1
0 1 1 1
0 1
1 0
BOOLEAN ALGEBRAS
15
Proof. Suppose that e and e are both identities. Then e = e e , since e is an identity, and e e = e since e is an identity. Hence e = e , so the identity must be unique. Corollary 2.11. The zero and unit elements in a boolean algebra are unique. Proof. This follows directly from the proposition above, because the zero and unit elements are the identities for the join and meet operations, respectively. Proposition 2.12. The complement of an element in a boolean algebra is unique; that is, for each A ∈ K there is only one element A ∈ K satisfying axioms (ix) and (x): A ∧ A = 0 and A ∨ A = 1. Proof. Suppose that B and C are both complements of A, so that A ∧ B = 0, A ∨ B = 1, A ∧ C = 0, and A ∨ C = 1. Then B = B ∨ 0 = B ∨ (A ∧ C) = (B ∨ A) ∧ (B ∨ C) = (A ∨ B) ∧ (B ∨ C) = 1 ∧ (B ∨ C) = B ∨ C. Similarly, C = C ∨ B and so B = B ∨ C = C ∨ B = C.
If we interchange ∧ and ∨ and interchange 0 and 1 in the system of axioms for a boolean algebra, we obtain the same system. Therefore, if any proposition is derivable from the axioms, so is the proposition obtained by interchanging ∧ and ∨ and interchanging 0 and 1. This is called the duality principle. For example, in the following proposition, there are four pairs of dual statements. If one member of each pair can be proved, the other will follow directly from the duality principle. If (K, ∧, ∨, ) is a boolean algebra with 0 as zero and 1 as unit, then (K, ∨, ∧, ) is also a boolean algebra with 1 as zero and 0 as unit. Proposition 2.13. If A, B, and C are elements of a boolean algebra (K, ∧, ∨, ), the following relations hold: (i) A ∧ 0 = 0. (iii) A ∧ (A ∨ B) = A. (v) A ∧ A = A. (vii) (A ∧ B) = A ∨ B . (ix) (A ) = A.
(ii) A ∨ 1 = 1. (iv) A ∨ (A ∧ B) = A. (absorption laws) (vi) A ∨ A = A. (idempotent laws) (viii) (A ∨ B) = A ∧ B . (De Morgan’s laws)
Proof. Note first that relations (ii), (iv), (vi), and (viii) are the duals of relations (i), (iii), (v), and (vii), so we prove the last four, and relation (ix). We use the axioms for a boolean algebra several times.
16
2 BOOLEAN ALGEBRAS
(i) A ∧ 0 = A ∧ (A ∧ A ) = (A ∧ A) ∧ A = A ∧ A = 0. (iii) A ∧ (A ∨ B) = (A ∨ 0) ∧ (A ∨ B) = A ∨ (0 ∧ B) = A ∨ 0 = A. (v) A = A ∧ 1 = A ∧ (A ∨ A ) = (A ∧ A) ∨ (A ∧ A ) = (A ∧ A) ∨ 0 = A ∧ A. Relations (vii) follows from Proposition 2.12 if we can show that A ∨ B is a complement of A ∧ B [then it is the complement (A ∧ B) ]. Now using part (i) of this proposition, (A ∧ B) ∧ (A ∨ B ) = [(A ∧ B) ∧ A ] ∨ [(A ∧ B) ∧ B ] = [(A ∧ A ) ∧ B] ∨ [A ∧ (B ∧ B )] = [0 ∧ B] ∨ [A ∧ 0] =0∨0 = 0. Similarly, part (ii) gives (A ∧ B) ∨ (A ∨ B ) = [A ∨ (A ∨ B )] ∧ [B ∨ (A ∨ B )] = [(A ∨ A ) ∨ B ] ∧ [(B ∨ B ) ∨ A ] = [1 ∨ B ] ∧ [1 ∨ A ] =1∧1 = 1. To prove relation (ix), by definition we have A ∧ A = 0 and A ∨ A = 1. Therefore, A is a complement of A , and since the complement is unique, A = (A ) .
PROPOSITIONAL LOGIC We now show briefly how boolean algebra can be applied to the logic of propositions. Consider two sentences “A” and “B”, which may either be true or false. For example, “A” could be “This apple is red,” and “B” could be “This pear is green.” We can combine these to form other sentences, such as “A and B,” which would be “This apple is red, and this pear is green.” We could also form the sentence “not A,” which would be “This apple is not red.” Let us now compare the truth or falsity of the derived sentences with the truth or falsity of the original ones. We illustrate the relationship by means of a diagram called a truth table. Table 2.4 shows the truth tables for the expressions “A and B,” “A or B,” and “not A.” In these tables, T stands for “true” and F stands for “false.” For
PROPOSITIONAL LOGIC
17
TABLE 2.4. Truth Tables A
B
A and B
A or B
A
Not A
F F T T
F T F T
F F F T
F T T T
F T
T F
example, if the statement “A” is true while “B” is false, the statement “A and B” will be false, and the statement “A or B” will be true. We can have two seemingly different sentences with the same meaning; for example, “This apple is not red or this pear is not green” has the same meaning as “It is not true that this apple is red and that this pear is green.” If two sentences, P and Q, have the same meaning, we say that P and Q are logically equivalent, and we write P = Q. The example above concerning apples and pears implies that (not A) or (not B) = not (A and B). This equation corresponds to De Morgan’s law in a boolean algebra. It appears that a set of sentences behaves like a boolean algebra. To be more precise, let us consider a set of sentences that are closed under the operations of “and,” “or,” and “not.” Let K be the set, each element of which consists of all the sentences that are logically equivalent to a particular sentence. Then it can be verified that (K, and, or, not) is indeed a boolean algebra. The zero element is called a contradiction, that is, a statement that is always false, such as “This apple is red and this apple is not red.” The unit element is called a tautology, that is, a statement that is always true, such as “This apple is red or this apple is not red.” This allows us to manipulate logical propositions using formulas derived from the axioms of a boolean algebra. An important method of combining two statements, A and B, in a sentence is by a conditional, such as “If A, then B,” or equivalently, “A implies B,” which we shall write as “A ⇒ B.” How does the truth or falsity of such a conditional depend on that of A and B? Consider the following sentences: 1. 2. 3. 4.
If If If If
x > 4, then x 2 > 16. x > 4, then x 2 = 2. 2 = 3, then 0.2 = 0.3. 2 = 3, then the moon is made of green cheese.
Clearly, if A is true, then B must also be true for the sentence “A ⇒ B” to be true. However, if A is not true, then the sentence “If A, then B” has no standard meaning in everyday language. Let us take “A ⇒ B” to mean that we cannot have A true and B not true. This implies that the truth value of the
18
2 BOOLEAN ALGEBRAS
TABLE 2.5. Truth tables for Conditional and Biconditional Statements A
B
A⇒B
A⇐B
A⇔B
F F T T
F T F T
T T F T
T F T T
T F F T
statement “A ⇒ B” is the same as that of “not (A and not B).” Let us write ∧, ∨, and for “and,” “or,” and “not,” respectively. Then “A ⇒ B” is equivalent to (A ∧ B ) = A ∨ B. Thus “A ⇒ B” is true if A is false or if B is true. Using this definition, statements 1, 3, and 4 are all true, whereas statement 2 is false. We can combine two conditional statements to form a biconditional statement of the form “A if and only if B” or “A ⇔ B.” This has the same truth value as “(A ⇒ B) and (B ⇒ A)” or, equivalently, (A ∧ B) ∨ (A ∧ B ). Another way of expressing this biconditional is to say that “A is a necessary and sufficient condition for B.” It is seen from Table 2.5 that the statement “A ⇔ B” is true if either A and B are both true or A and B are both false. Example 2.14. Apply this propositional calculus to determine whether a certain politician’s arguments are consistent. In one speech he states that if taxes are raised, the rate of inflation will drop if and only if the value of the dollar does not fall. On television, he says that if the rate of inflation decreases or the value of the dollar does not fall, taxes will not be raised. In a speech abroad, he states that either taxes must be raised or the value of the dollar will fall and the rate of inflation will decrease. His conclusion is that taxes will be raised, but the rate of inflation will decrease, and the value of the dollar will not fall. Solution. We write A to mean “Taxes will be raised,” B to mean “The rate of inflation will decrease,” C to mean “The value of the dollar will not fall.” The politician’s three statements can be written symbolically as (i) A ⇒ (B ⇔ C). (ii) (B ∨ C) ⇒ A . (iii) A ∨ (C ∧ B). His conclusion is (iv) A ∧ B ∧ C. The truth values of the first two statements are equivalent to those of the following:
SWITCHING CIRCUITS
19
TABLE 2.6. Truth Tables for the Politician’s Arguments A
B
C
(i)
(ii)
(iii)
(i) ∧ (ii) ∧ (iii)
(iv)
(i) ∧ (ii) ∧ (iii) ⇒ (iv)
F F F F T T T T
F F T T F F T T
F T F T F T F T
T T T T T F F T
T T T T T F F F
F F T F T T T T
F F T F T F F F
F F F F F F F T
T T F T F T T T
(i) A ∨ ((B ∧ C) ∨ (B ∧ C )). (ii) (B ∨ C) ∨ A . It follows from Table 2.6 that (i) ∧ (ii) ∧ (iii) ⇒ (iv) is not a tautology; that is, it is not always true. Therefore, the politician’s arguments are incorrect. They break down when A and C are false and B is true, and when B and C are false and A is true.
SWITCHING CIRCUITS In this section we use boolean algebra to analyze some simple switching circuits. A switch is a device with two states; state 1 is the “on” state, and state 0 the “off” state. An ordinary household light switch is such a device, but the theory holds equally well for more sophisticated electronic or magnetic two-state devices. We analyze circuits with two terminals: The circuit is said to be closed if current can pass between the terminals, and open if current cannot pass. We denote a switch A by the symbol in Figure 2.8. We assign the value 1 to A if the switch A is closed and the value 0 if it is open. We denote two switches by the same letter if they open and close simultaneously. If B is a switch that is always in the opposite position to A (that is, if B is open when A is closed, and B is closed when A is open), denote switch B by A . The two switches A and B in Figure 2.9 are said to be connected in series. If we connect this circuit to a power source and a light as in Figure 2.10, we see that the light will be on if and only if A and B are both switched on; we denote this series circuit by A ∧ B. Its effect is shown in Table 2.7. The switches A and B in Figure 2.11 are said to be in parallel, and this circuit is denoted by A ∨ B because the circuit is closed if either A or B is switched on.
A
A
Figure 2.8.
Switch A.
Figure 2.9.
B
Switches in series.
20
2 BOOLEAN ALGEBRAS
A
B A
Power source
Figure 2.10.
Light
B
Series circuit.
Figure 2.11.
Switches in parallel.
TABLE 2.7. Effect of the Series Circuit Switch A 0 0 1 1
(off) (off) (on) (on)
Switch B
Circuit A ∧ B
Light
0 (off) 1 (on) 0 (off) 1 (on)
0 (open) 0 (open) 0 (open) 1 (closed)
off off off on
A B′ B
Figure 2.12.
A′
Series-parallel circuit.
The reader should be aware that many books on switching theory use the notation + and · instead of ∨ and ∧, respectively. Series and parallel circuits can be combined to form circuits like the one in Figure 2.12. This circuit would be denoted by (A ∨ (B ∧ A )) ∧ B . Such circuits are called series-parallel switching circuits. In actual practice, the wiring diagram may not look at all like Figure 2.12, because we would want switches A and A together and B and B together. Figure 2.13 illustrates one particular form that the wiring diagram could take. Two circuits C1 and C2 involving the switches A, B, . . . are said to be equivalent if the positions of the switches A, B, . . ., which allow current to pass,
Switch A Switch B
Figure 2.13.
Wiring diagram of the circuit.
DIVISORS
21
B
A
B
A
C
A C A ∧ (B ∨ C )
=
Figure 2.14.
(A ∧ B ) ∨ (A ∧ C )
Distributive law.
are the same for both circuits. We write C1 = C2 to mean that the circuits are equivalent. It can be verified that all the axioms for a boolean algebra are valid when interpreted as series-parallel switching circuits. For example, Figure 2.14 illustrates a distributive law. The zero corresponds to a circuit that is always open, and the unit corresponds to a circuit that is always closed. The complement C of a circuit C is open whenever C is closed and closed when C is open.
DIVISORS As a last example, we are going to construct boolean algebras based on the divisibility relation on the set P of positive integers. Given two integers d and a in P, we write d|a (and call d a divisor of a) if a = qd for some q ∈ P. If p 2 in P, and the only divisors of p are 1 and p, then p is called a prime. Thus, the first few primes are 2, 3, 5, 7, 11, . . .. A fundamental fact about P is the prime factorization theorem: Every number a ∈ P is uniquely a product of primes.∗ For example, the prime factorizations of 110 and 12 are 110 = 2 · 5 · 11 and 12 = 22 · 3. If a = p1a1 p2a2 · · · prar is the prime factorization of a ∈ P where the pi are distinct primes, the divisors d of a can be described as follows: d|a
if and only if
d = p1d1 p2d2 · · · prdr
where 0 di ai for each i.
Hence the divisors of 12 = 22 31 in P are 1 = 20 30 , 2 = 21 30 , 4 = 22 30 , 3 = 20 31 , 6 = 21 31 , and 12 = 22 31 . Given a and b in P, let p1 , p2 , . . . , pr denote the distinct primes that are divisors of either a or b. Hence we can write a = p1a1 p2a2 · · · prar and b = p1b1 p2b2 · · · prbr , where ai 0 and bi 0 for each i. Then the greatest common divisor d = gcd(a, b) and the least common multiple m = lcm(a, b) of a and b are defined by d = p1min(a,b) p2min(a,b) · · · prmin(a,b) ∗
and m = p1max(a,b) p2max(a,b) · · · prmax(a,b) .
See Appendix 2 for a proof of the prime factorization theorem.
22
2 BOOLEAN ALGEBRAS
It follows that d is the unique integer in P that is a divisor of both a and b, and is a multiple of every such common divisor (hence the name). Similarly, m is the unique integer in P that is a multiple of both a and b, and is a divisor of every such common multiple. For example, gcd(2, 3) = 1 and gcd(12, 28) = 4, while lcm(2, 3) = 6 and lcm(12, 28) = 84. With this background, we can describe some new examples of boolean algebras. Given n ∈ P, let Dn = {d ∈ P|d divides n}. It is clear that gcd and lcm are commutative binary operations on Dn , and it is easy to verify that the zero is 1 and the unit is n. To prove the distributive laws, let a, b, and c be elements of Dn , and write a = p1a1 p2a2 · · · prar ,
b = p1b1 p2b2 · · · prbr ,
and c = p1c1 p2c2 · · · prcr ,
where p1 , p2 , . . . , pr are the distinct primes dividing at least one of a, b, and c, and where ai 0, bi 0, and ci 0 for each i. Then the first distributive law states that gcd(a, lcm(b, c)) = lcm(gcd(a, b), gcd(a, c)). If we write out the prime factorization of each side in terms of the primes pi , this holds if and only if for each i, the powers of pi are equal on both sides, that is, min(ai , max(bi , ci )) = max(min(ai , bi ), min(ai , ci )). To verify this, observe first that we may assume that bi ci (bi and ci can be interchanged without changing either side), and then check the three cases ai bi , bi ai ci , and ci ai separately. Hence the first distributive law holds; the other distributive law and the associative laws are verified similarly. Thus (Dn , gcd, lcm) satisfies all the axioms for a boolean algebra except for the existence of a complement. But complements need not exist in general: For example, 6 has no complement in D18 = {1, 2, 3, 6, 9, 18}. Indeed, if 6 has a complement 6 in D18 , then gcd(6, 6 ) = 1, so we must have 6 = 1. But then lcm(6, 6 ) = 6 and this is not the unit of D18 . Hence 6 has no complement, so D18 is not a boolean algebra. However, all is not lost. The problem in D18 is that the prime factorization 18 = 2 · 32 has a repeated prime factor. An integer n ∈ P is called square-free if it is a product of distinct primes with none repeated (for example, every prime is square-free, as are 6 = 2 · 3, 10 = 2 · 5, 30 = 2 · 3 · 5, etc.) If n is square-free, it is routine to verify that the complement of d ∈ Dn is d = n/d, and we have Example 2.15. If n ∈ P is square-free, then (Dn , gcd, lcm, ) is a boolean algebra where d = n/d for each d ∈ Dn . The interpretations of the various boolean algebra terms are given in Table 2.8.
POSETS AND LATTICES
23
TABLE 2.8. Dictionary of Boolean Algebra Terms Boolean Algebra ∧ ∨
0 1 =
P(X)
Switching Circuits
Propositional Logic
Dn
∩ ∪ − Ø X =
Series Parallel Opposite Open Closed Equivalent circuit
And Or Not Contradiction Tautology Logically equivalent
gcd lcm a = n/a 1 n =
POSETS AND LATTICES Boolean algebras were derived from the algebra of sets, and there is one important relation between sets that we have neglected to generalize to boolean algebras, namely, the inclusion relation. This relation can be defined in terms of the union operation by A ⊆ B if and only if A ∩ B = A. We can define a corresponding relation on any boolean algebra (K, ∧, ∨, ) using the meet operation: AB
if and only if
A ∧ B = A.
If the boolean algebra is the algebra of subsets of X, this relation is the usual inclusion relation. Proposition 2.16. A ∧ B = A if and only if A ∨ B = B. Hence either of the these conditions will define the relation . Proof. If A ∧ B = A, then it follows from the absorption law that A ∨ B = (A ∧ B) ∨ B = B. Similarly, if A ∨ B = B, it follows that A ∧ B = A. Proposition 2.17. If A, B, and C are elements of a boolean algebra, K, the following properties of the relation hold. (i) A A. (ii) If A B and B A, then A = B. (iii) If A B and B C, then A C.
(reflexivity) (antisymmetry) (transitivity)
Proof (i) A ∧ A = A is an idempotent law. (ii) If A ∧ B = A and B ∧ A = B, then A = A ∧ B = B ∧ A = B. (iii) If A ∧ B = A and B ∧ C = B, then A ∧ C = (A ∧ B) ∧ C = A ∧ (B ∧ C) = A ∧ B = A.
24
2 BOOLEAN ALGEBRAS
TABLE 2.9. Partial Order Relation in Various Boolean Algebras Boolean Algebra
Algebra of Subsets
A∧B =A AB A is less than or equal to B
A∩B =A A⊆B A is a subset of B
Series-Parallel Switching Circuits
Divisors of a Square-Free Integer
Propositional Logic
A∧B =A A⇒B If A is closed, then B is closed
(A and B) = A A⇒B A implies B
gcd(a, b) = a a|b a divides b
A relation satisfying the three properties in Proposition 2.17 is called a partial order relation, and a set with a partial order on it is called a partially ordered set or poset for short. The interpretation of the partial order in various boolean algebras is given in Table 2.9. A partial order on a finite set K can be displayed conveniently in a poset diagram in which the elements of K are represented by small circles. Lines are drawn connecting these elements so that there is a path from A to B that is always directed upward if and only if A B. Figure 2.15 illustrates the poset diagram of the boolean algebra of subsets (P ({a, b}, )∩, ∪, − ). Figure 2.16 illustrates the boolean algebra D110 = {1, 2, 5, 11, 10, 22, 55, 110} of positive divisors of 110 = 2 · 5 · 11. The partial order relation is divisibility, so that there is an upward path from a to b if and only if a divides b. The following proposition shows that has properties similar to those of the inclusion relation in sets. Proposition 2.18. If A, B, C are elements of a boolean algebra (K, ∧, ∨, ), then the following relations hold: (i) A ∧ B A. (ii) A A ∨ B. (iii) A C and B C implies that A ∨ B C.
110 10
22
55
2
5
11
{a, b} {a}
{b} f
Figure 2.15.
Poset diagram of P ({a, b}).
1
Figure 2.16.
Poset diagram of D110 .
POSETS AND LATTICES
25
(iv) A B if and only if A ∧ B = 0. (v) 0 A and A 1 for all A. Proof (i) (ii) (iii) (iv)
(A ∧ B) ∧ A = (A ∧ A) ∧ B = A ∧ B so A ∧ B A. A ∧ (A ∨ B) = A, so A A ∨ B. (A ∨ B) ∧ C = (A ∧ C) ∨ (B ∧ C) = A ∨ B. If A B, then A ∧ B = A and A ∧ B = A ∧ B ∧ B = A ∧ 0 = 0. On the other hand, if A ∧ B = 0, then A B because A = A ∧ 1 = A ∧ (B ∨ B ) = (A ∧ B) ∨ (A ∧ B ) = (A ∧ B) ∨ 0 = A ∧ B.
(v) 0 ∧ A = 0 and A ∧ 1 = A.
Not all posets are derived from boolean algebras. A boolean algebra is an extremely special kind of poset. We now determine conditions which ensure that a poset is indeed a boolean algebra. Given a partial order on a set K, we have to find two binary operations that correspond to the meet and join. An element d is said to be the greatest lower bound of the elements a and b in a partially ordered set if d a, d b, and x is another element, for which x a, x b, then x d. We denote the greatest lower bound of a and b by a ∧ b. Similarly, we can define the least upper bound and denote it by ∨. It follows from the antisymmetry of the partial order relation that each pair of elements a and b can have at most one greatest lower bound and at most one least upper bound. A lattice is a partially ordered set in which every two elements have a greatest lower bound and a least upper bound. Thus Dn is a lattice for every integer n ∈ P, so by the discussion preceding Example 2.15, D18 is a lattice that is not a boolean algebra (see Figure 2.17). We can now give an alternative definition of a boolean algebra in terms of a lattice: A boolean algebra is a lattice that has universal bounds (that is, elements 0 and 1 such that 0 a and a 1 for all elements a) and is distributive and complemented (that is, the distributive laws for ∧ and ∨ hold, and complements exist). It can be verified that this definition is equivalent to our original one. In Figure 2.18, the elements c and d have a least upper bound b but no greatest lower bound. We note in passing that the discussion preceding Example 2.15 shows that for each n ∈ P, the poset Dn is a lattice in which the distributive laws hold, but it is not a boolean algebra unless n is square-free. For further reading on lattices in applied algebra, consult, Davey and Priestley [16] or Lidl and Pilz [10].
26
2 BOOLEAN ALGEBRAS
18 6
9 3
2 1
Figure 2.17.
Lattice that is not a boolean algebra.
b
a
c
d e
Figure 2.18.
Poset that is not a lattice.
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS If we have a complicated switching circuit represented by a boolean expression, such as (A ∧ (B ∨ C ) ) ∨ ((B ∧ C ) ∨ A ), we would like to know if we can build a simpler circuit that would perform the same function. In other words, we would like to reduce this boolean expression to a simpler form. In actual practice, it is usually desirable to reduce the circuit to the one that is cheapest to build, and the form this takes will depend on the state of the technology at the time; however, for our purposes we take the simplest form to mean the one with the fewest switches. It is difficult to find the simplest form for circuits with many switches, and there is no one method that will lead to that form. However, we do have methods for determining whether two boolean expressions are equivalent. We can reduce the expressions to a certain normal form, and the expressions will be the same if and only if their normal forms are the same. We shall look at one such form, called the disjunctive normal form. In the boolean algebra of subsets of a set, every subset can be expressed as a union of singleton sets, and this union is unique to within the ordering of the terms. We shall obtain a corresponding result for arbitrary finite boolean algebras. The elements that play the role of singleton sets are called atoms. Here an atom in a boolean algebra (K, ∧, ∨, ) is a nonzero element B for which B ∧Y =B
or
B ∧ Y = 0 for each Y ∈ K.
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS
27
Thus B is an atom if Y B implies that Y = 0 or Y = B. This implies that the atoms are the elements immediately above the zero element in the poset diagram. In the case of the algebra of divisors of a square-free integer, the atoms are the primes, because the definition of b being prime is that y|b implies that y = 1 or y = b. We now give a more precise description of the algebra of switching circuits. The atoms of the algebra and the disjunctive normal form of an expression will become clear from this description. An n-variable switching circuit can be viewed as a black box containing n independent switches A1 , A2 , . . . , An , as shown in Figure 2.19, where each switch can be either on or off. The effect of such a circuit can be tested by trying all the 2n different combinations of the n switches and observing when the box allows current to pass. In this way, each circuit defines a function of n variables A1 , A2 , . . . , An : f : {0, 1}n → {0, 1}, which we call the switching function of the circuit. Two circuits give rise to the same switching function if and only if they are equivalent. For example, the circuit in Figure 2.20, corresponding to the expression (A ∨ B ) ∧ (C ∨ A ), gives rise to the switching function f : {0, 1}3 → {0, 1} given in Table 2.10.
A1
A2
•
•
An
•
n-Variable switching circuit.
Figure 2.19.
A
C
B′
Figure 2.20.
A′
Circuit (A ∨ B ) ∧ (C ∨ A ).
TABLE 2.10. Switching Function A
B
C
f = (A ∨ B ) ∧ (C ∨ A )
0 0 0 0 1 1 1 1
0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1
1 1 0 0 0 1 0 1
28
2 BOOLEAN ALGEBRAS
Denote the set of all n-variable switching functions from {0, 1}n to {0, 1} by Fn . Each of the 2n elements in the domain of such a function can be mapped to either of the two elements in the codomain. Therefore, the number of different n-variable switching functions, and hence the number of different circuits with n n switches, is 22 . Let f and g be the switching functions of two circuits of the n-variables A1 , A2 , . . . , An . When these circuits are connected in series or in parallel, they give rise to the switching functions f ∧ g or f ∨ g, respectively, where (f ∧ g)(A1 , . . . , An ) = f (A1 , . . . , An ) ∧ g(A1 , . . . , An ) and (f ∨ g)(A1 , . . . , An ) = f (A1 , . . . , An ) ∨ g(A1 , . . . , An ). The switching function of the opposite circuit to that defining f is f , where f (A1 , . . . , An ) = (f (A1 , . . . , An )) . Theorem 2.19. The set of n-variable switching functions forms a boolean algen bra (Fn , ∧, ∨, ) that contains 22 elements. Proof. It can be verified that (Fn , ∧, ∨, ) satisfies all the axioms of a boolean algebra. The zero element is the function whose image is always 0, and the unit element is the function whose image is always 1. The boolean algebra of switching functions of two variables contains 16 elements, which are displayed in Table 2.11. For example, f6 (A, B) = 0 if A = B, and 1 if A = B. This function is the exclusive OR function or a modulo 2 adder. It is also the symmetric difference function, where the symmetric difference of A and B in a boolean algebra is defined by AB = (A ∧ B ) ∨ (A ∧ B). The operations NAND and NOR stand for “not and” and “not or,” respectively; these are discussed further in the section “Transistor Gates.” As an example of the operations in the boolean algebra F2 , we calculate the meet and join of f10 and f7 , and the complement of f10 in Table 2.12. We see that f10 ∧ f7 = f2 , f10 ∨ f7 = f15 and f10 = f5 . These correspond to the relations B ∧ (A ∨ B) = A ∧ B , B ∨ (A ∨ B) = 1, and (B ) = B. In the boolean algebra Fn , f g if and only if f ∧ g = f , which happens if g(A1 , . . . , An ) = 1 whenever f (A1 , . . . , An ) = 1. The atoms of Fn are therefore the functions whose image contains precisely one nonzero element. Fn contains 2n atoms, and the expressions that realize these atoms are of the form Aα1 1 ∧ Aα2 2 ∧ · · · ∧ Aαnn , where each Aαi i = Ai or Ai .
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS
29
TABLE 2.11. Two-Variable Switching Functions A B
0 0
0 1
1 0
1 1
Expressions in A and B Representing the Function
f0 f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15
0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
0 A∧B A ∧ B or A ⇒ B A A ∧ B or A ⇐ B B AB or Exclusive OR(A, B) A∨B A ∧ B or NOR(A, B) AB or A ⇔ B B A ∨ B or A ⇐ B A A ∨ B or A ⇒ B A ∨ B or NAND(A, B) 1
TABLE 2.12. Some Operations in F 2 A
B
f10
f7
f10 ∧ f7
f10 ∨ f7
f10
0 0 1 1
0 1 0 1
1 0 1 0
0 1 1 1
0 0 1 0
1 1 1 1
0 1 0 1
The 16 elements of F2 are illustrated in Figure 2.21, and the four atoms are f1 , f2 , f4 , and f8 , which are defined in Table 2.11. To show that every element of a finite boolean algebra can be written as a join of atoms, we need three preliminary lemmas. Lemma 2.20. If A, B1 , . . . , Br are atoms in a boolean algebra, then A (B1 ∨ · · · ∨ Br ) if and only if A = Bi , for some i with 1 i r. Proof. If A (B1 ∨ · · · ∨ Br ), then A ∧ (B1 ∨ · · · ∨ Br ) = A; thus (A ∧ B1 ) ∨ · · · ∨ (A ∧ Br ) = A. Since each Bi is an atom, A ∧ Bi = Bi or 0. Not all the elements A ∧ Bi can be 0, for this would imply that A = 0. Hence there is some i, with 1 i r, for which A ∧ Bi = Bi . But A is also an atom, so A = A ∧ Bi = Bi . The implication the other way is straightforward Lemma 2.21. If Z is a nonzero element of a finite boolean algebra, there exists an atom B with B Z.
30
2 BOOLEAN ALGEBRAS f15
f7
f3
f11
f13
f5
f1
f9
f14
f6
f2
f10
f4
f12
f8
f0
Figure 2.21.
Poset diagram of the boolean algebra of two-variable switching functions.
Proof. If Z is an atom, take B = Z. If not, then it follows from the definition of atoms that there exists a nonzero element Z1 , different from Z, with Z1 Z. If Z1 is not an atom, we continue in this way to obtain a sequence of distinct nonzero elements · · · Z3 Z2 Z1 Z, which, because the algebra is finite, must terminate in an atom B. Lemma 2.22. If B1 , . . . , Bn are all the atoms of a finite boolean algebra, then Y = 0 if and only if Y ∧ Bi = 0 for all i such that 1 i n. Proof. Suppose that Y ∧ Bi = 0 for each i. If Y is nonzero, it follows from the previous lemma that there is an atom Bj with Bj Y . Hence Bj = Y ∧ Bj = 0, which is a contradiction, so Y = 0. The converse implication is trivial. Theorem 2.23. Disjunctive Normal Form. Each element X of a finite boolean algebra can be written as a join of atoms X = Bα ∨ Bβ ∨ · · · ∨ Bω . Moreover, this expression is unique up to the order of the atoms. Proof. Let Bα , Bβ , . . . , Bω be all the atoms less than or equal to X in the partial order. It follows from Proposition 2.18(iii) that the join Y = Bα ∨ Bβ ∨ · · · ∨ Bω X. We will show that X ∧ Y = 0, which, by Proposition 2.18(iv), is equivalent to X Y . We have X ∧ Y = X ∧ Bα ∧ · · · ∧ Bω . If B is an atom in the join Y , say B = Bα , it follows that X ∧ Y ∧ B = 0, since Bα ∧ Bα = 0. If B is an atom that is not in Y , then X ∧ Y ∧ B = 0 also,
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS
31
because X ∧ B = 0. Therefore, by Lemma 2.22, X ∧ Y = 0, which is equivalent to X Y . The antisymmetry of the partial order relation implies that X = Y . To show uniqueness, suppose that X can be written as the join of two sets of atoms X = Bα ∨ · · · ∨ Bω = Ba ∨ · · · ∨ Bz . Now Bα X; thus, by Lemma 2.20, Bα is equal to one of the atoms on the right-hand side, Ba , . . . , Bz . Repeating this argument, we see that the two sets of atoms are the same, except possibly for their order. In the boolean algebra of n-variable switching functions, the atoms are realized by expressions of the form Aα1 1 ∧ Aα2 2 ∧ · · · ∧ An αn , where the αi ’s are 0 or 1 and Ai αi = Ai , if αi = 1, whereas Ai αi = Ai , if αi = 0. The expression Aα1 1 ∧ Aα2 2 ∧ · · · ∧ An αn is included in the disjunctive normal form of the function f if and only if f (α1 , α2 , . . . , αn ) = 1. Hence there is one atom in the disjunctive normal form for each time the element 1 occurs in the image of the switching function. Example 2.24. Find the disjunctive normal form for the expression (B ∨ (A ∧ C)) ∧ ((A ∨ C) ∧ B) , and check the result by using the axioms to reduce the expression to that form. Solution. We see from the values of the switching function in Table 2.13 that the disjunctive normal form is (A ∧ B ∧ C ) ∨ (A ∧ B ∧ C). From the axioms, we have (B ∨ (A ∧ C)) ∧ ((A ∨ C) ∧ B) = (B ∨ (A ∧ C)) ∧ ((A ∧ C ) ∨ B ) = ((B ∨ (A ∧ C)) ∧ (A ∧ C ))∨ ((B ∨ (A ∧ C)) ∧ B ) = (B ∧ A ∧ C ) ∨ (A ∧ C ∧ A ∧ C )∨ (B ∧ B ) ∨ (A ∧ C ∧ B ) = (A ∧ B ∧ C ) ∨ 0 ∨ 0 ∨ (A ∧ B ∧ C) = (A ∧ B ∧ C ) ∨ (A ∧ B ∧ C). TABLE 2.13. Switching Function A
B
C
(B ∨ (A ∧ C)) ∧ ((A ∨ C) ∧ B)
0 0 0 0 1 1 1 1
0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1
0 0 1 0 0 1 0 0
32
2 BOOLEAN ALGEBRAS
TABLE 2.14. Switching Function A
B
(A ∨ B) ∧ B
(A ∨ B) ∧ (A ∧ B)
(A ∧ B) ∧ (A ∧ B )
0 0 1 1
0 1 0 1
0 0 1 0
0 1 1 0
0 0 1 0
Example 2.25. Determine whether any of the three expressions (A ∨ B) ∧ B , (A ∨ B) ∧ (A ∧ B) , and (A ∧ B) ∧ (A ∧ B ) equivalent. Solution. We see from Table 2.14 that (A ∨ B) ∧ B = (A ∧ B) ∧ (A ∧ B ) and that these are both equal to A ∧ B . The atoms in the boolean algebra F2 are realized by the expressions A ∧ B , A ∧ B, A ∧ B , and A ∧ B. These atoms partition the Venn diagram in Figure 2.22 into four disjoint regions. The disjunctive normal form for any boolean expression involving the variables A and B can be calculated by shading the region of the Venn diagram corresponding to the expression and then taking the join of the atoms in the shaded region. Figure 2.23 illustrates the eight regions of the corresponding Venn diagram for three variables. A
B
A ∧ B ′ A ∧ B A′ ∧ B
A′ ∧ B ′
Figure 2.22.
Venn diagram for F2 .
A
B A ∧ B′ ∧ C ′
A ∧ B ∧ C′
A′ ∧ B ∧ C ′
A∧B∧C A ∧ B′ ∧ C
A′ ∧ B ∧ C
A′ ∧ B ′ ∧ C A′ ∧ B ′ ∧ C ′
Figure 2.23.
Venn diagram for F3 .
C
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS
33
By looking at the shaded region of a Venn diagram corresponding to a boolean expression, it is often possible to see how to simplify the expression. Furthermore, the disjunctive normal form provides a method of proving hypotheses derived from these Venn diagrams. However, Venn diagrams become too complicated and impractical for functions of more than four variables. For other general methods of simplifying circuits, consult a book on boolean algebras such as Mendelson [21]. Example 2.26. Find the disjunctive normal form and simplify the circuit in Figure 2.24. Solution. This circuit is represented by the boolean expression f = A ∨ ((B ∨ C) ∧ (A ∨ B ∨ C)). The boolean function f : {0, 1}3 → {0, 1} that this expression defines is given in Table 2.15. It follows that the disjunctive normal form is (A ∧ B ∧ C) ∨ (A ∧ B ∧ C) ∨ (A ∧ B ∧ C ) ∨ (A ∧ B ∧ C) ∨ (A ∧ B ∧ C ) ∨ (A ∧ B ∧ C), which is certainly not simpler than the original. However, by looking at the Venn diagram in Figure 2.25, we see that this expression is equivalent to just A ∨ C; thus a simpler equivalent circuit is given in Figure 2.25. A A B′
B C
C
Figure 2.24.
Series-parallel circuit.
TABLE 2.15. Switching Function A
B
C
f
0 0 0 0 1 1 1 1
0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1
0 1 0 1 1 1 1 1
34
2 BOOLEAN ALGEBRAS A
B A C
C
Figure 2.25.
Venn diagram and simplified circuit.
In building a computer, one of the most important pieces of equipment needed is a circuit that will add two numbers in binary form. Consider the problem of adding the numbers 15 and 5. Their binary forms are 1111 and 101, respectively. The binary and decimal additions are shown below. In general, if we add the number . . . a2 a1 a0 to . . . b2 b1 b0 , we have to carry the digits . . . c2 c1 to obtain the sum . . . s2 s1 s0 . 1111 101 1111 ← carry digits →
15 5 1
. . . a2 a1 a0 . . . b2 b1 b0 . . . c2 c1
10100
20
. . . s2 s1 s0
binary addition
decimal addition
Let us first design a circuit to add a0 and b0 to obtain s0 and the carry digit c1 . This is called a half adder. The digits s0 and c1 are functions of a0 and b0 which are given by Table 2.16. For example, in binary arithmetic, 1 + 1 = 10, which means that if a0 = 1 and b0 = 1, s0 = 0, and we have to carry c1 = 1. We see from Table 2.16 that c1 = a0 ∧ b0 and s0 = (a0 ∧ b0 ) ∨ (a0 ∧ b0 ). These circuits are shown in Figure 2.26. TABLE 2.16. Switching Functions for the Half Adder a0
b0
c1
s0
0 0 1 1
0 1 0 1
0 0 0 1
0 1 1 0
a ′0
b0
a0
b ′0
a0
b0
Figure 2.26.
Circuits for the half adder.
s0
c1
NORMAL FORMS AND SIMPLIFICATION OF CIRCUITS
35
TABLE 2.17. Switching Functions for a Full Adder ai
bi
ci
ci+1
si
0 0 0 0 1 1 1 1
0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1
0 0 0 1 0 1 1 1
0 1 1 0 1 0 0 1
ai
bi ci + 1 shaded ci
ai
bi si shaded ci
Figure 2.27.
a ′i
ai
Venn diagrams for a full adder.
b ′i
ci
bi
c ′i
b ′i
c ′i
bi
ci
si
bi ai bi
Figure 2.28.
ci ci
ci + 1
Circuits for a full adder.
A circuit that adds ai , bi , and the carry digit, ci , to obtain si , with ci+1 to carry, is called a full adder. The functions ci+1 and si are defined by Table 2.17, and their Venn diagrams are given in Figure 2.27. Notice that si = ai bi ci . Suitable expressions for a full adder are as follows. The corresponding circuits are shown in Figure 2.28.
36
2 BOOLEAN ALGEBRAS
si = (ai ∧ bi ∧ ci ) ∨ (ai ∧ bi ∧ ci ) ∨ (ai ∧ bi ∧ ci ) ∨ (ai ∧ bi ∧ ci ) = (ai ∧ ((bi ∧ ci ) ∨ (bi ∧ ci ))) ∨ (ai ∧ ((bi ∧ ci ) ∨ (bi ∧ ci ))). ci+1 = (ai ∧ bi ) ∨ (ai ∧ ci ) ∨ (bi ∧ ci ) = (ai ∧ (bi ∨ ci )) ∨ (bi ∧ ci ). Using one half adder and (n − 1) full adders, we can design a circuit that will add two numbers that in binary form have n or fewer digits (that is, numbers less than 2n ).
TRANSISTOR GATES The switches we have been dealing with so far have been simple two-state devices. Transistor technology, however, allows us to construct basic switches with multiple inputs. These are called transistor gates. Transistor gates can be used to implement the logical operations AND, OR, NOT, and modulo 2 addition (that is, exclusive OR). Gates for the composite operations NOT-AND and NOT-OR are also easily built from transistors; these are called NAND and NOR gates, respectively. Figure 2.29 illustrates the symbols and outputs for these gates when there are two inputs. However, any number of inputs is possible. Note that the inversion operation is indicated by a small circle. Transistor gates can be combined in series and in parallel to form more complex circuits. Any circuit with n inputs and one output defines an n-variable switching function. The set of all such n-variable functions again forms the boolean algebra (Fn , ∧, ∨, ). It follows from the disjunctive normal form that any boolean function can be constructed from AND, OR, and NOT gates. What is not so obvious is that any boolean function can be constructed solely from NOR gates (or solely from NAND gates). This is of interest because with certain types of transistors, it is easier to build NOR gates (and NAND gates) than it is to build the basic operations. Figure 2.30 illustrates how two-input NOR gates can be used to construct two-input AND and OR gates as well as a NOT gate.
a b a b
a
AND
a∧b
a b
NAND
(a ∧ b)′ = a ′ ∨ b ′
OR
a∨b
a b
NOR
(a ∨ b)′ = a ′ ∧ b ′
NOT
a′
Exclusive OR(a, b) = (a ∧ b ′) ∨ (a ′ ∧ b)
a b
Figure 2.29.
Transistor gates.
TRANSISTOR GATES
37
a
NOR
a′
a
NOR
a′
b
NOR
b′
a b
NOR
Figure 2.30.
NOR a′ ∧ b′
NOR
a∨b
(a ′ ∨ b ′)′ = a ∧ b
Basic operations constructed from NOR gates.
ci
NOR NOR
ai bi
NOR
NOR
NOR
NOR
NOR
si
NOR NOR
Figure 2.31.
cj +1
Full adder using NOR gates.
Example 2.27. Verify that the circuit in Figure 2.31 is indeed a full adder. Solution. We analyze this circuit by breaking it up into component parts as illustrated in Figure 2.32. Consider the subcircuit consisting of four NOR gates in Figure 2.32 with inputs a and b and outputs l and m. If u and v are the intermediate functions as shown in the figure, then m = NOR(a, b) = a ∧ b u = NOR(a, a ∧ b ) = a ∧ (a ∧ b ) = a ∧ (a ∨ b) = (a ∧ a) ∨ (a ∧ b) = 0 ∨ (a ∧ b) = a ∧ b,
TRANSISTOR GATES
NOR
a
u
NOR
ci NOR
b NOR
si
l ai
v
Figure 2.32.
m
li bi
mi
Component parts of the full adder.
NOR
ci +1
38
2 BOOLEAN ALGEBRAS
and v = a ∧ b , similarly. Therefore, l = NOR(u, v) = (a ∧ b) ∧ (a ∧ b ) = (a ∨ b ) ∧ (a ∨ b) = (a ∧ a ) ∨ (a ∧ b) ∨ (b ∧ a ) ∨ (b ∧ b) = 0 ∨ (a ∧ b) ∨ (b ∧ a ) ∨ 0 = (a ∧ b) ∨ (a ∧ b ) = ab . The entire circuit can now be constructed from two of these identical subcircuits together with one NOR gate, as shown in Figure 2.32. The switching functions for the subcircuit and the full adder are calculated in Table 2.18. We have ci+1 = NOR(mi , NOR(ci , li )), while si = ci li . We see from Table 2.18 that the circuits do perform the addition of ai , bi , and ci correctly. TABLE 2.18. Switching Functions for the NOR Circuit a b
l
m
ai bi ci li mi NOR(ci , li ) ci+1 si
0 0 1 1
1 0 0 1
1 0 0 0
0 0 0 0 1 1 1 1
0 1 0 1
0 0 1 1 0 0 1 1
0 1 0 1 0 1 0 1
1 1 0 0 0 0 1 1
1 1 0 0 0 0 0 0
0 0 1 0 1 0 0 0
0 0 0 1 0 1 1 1
0 1 1 0 1 0 0 1
Figure 2.33. Photomicrograph of the IBM POWER4 chip containing 174 million transistors. (Courtesy of the IBM Journal of Research and Development.)
REPRESENTATION THEOREM
39
Instead of using many individual transistors, circuits are now made on a single semiconductor “chip,” such as the one in Figure 2.33. This chip may contain millions of gates and several layers of semiconductor. Simplification of a circuit may not mean the reduction of the circuit to the smallest number of gates. It could mean simplification to standard modules, or the reduction of the numbers of layers in the chip. In the design of high-speed computers, it is important to reduce the time a circuit will take to perform a given set of operations.
REPRESENTATION THEOREM A boolean algebra is a generalization of the notion of the algebra of sets. However, we now show that every finite boolean algebra is in fact essentially the same as the algebra of subsets of some finite set. To be more precise about what we mean by algebras being essentially the same, we introduce the notion of morphism and isomorphism of boolean algebras. A morphism between two boolean algebras is a function between their elements that preserves the two binary operations and the unary operation. More precisely, if (K, ∧, ∨, ) and (L, ∩, ∪, − ) are two boolean algebras, the function f : K → L is called a boolean algebra morphism if the following conditions hold for all A, B ∈ K: (i) f (A ∧ B) = f (A) ∩ f (B). (ii) f (A ∨ B) = f (A) ∪ f (B). (iii) f (A ) = f (A). A boolean algebra isomorphism is a bijective boolean algebra morphism. Isomorphic boolean algebras have identical properties. For example, their poset diagrams are the same, except for the labeling of the elements. Furthermore, the atoms of one algebra must correspond to the atoms in the isomorphic algebra. If we wish to find an isomorphism between any boolean algebra, K, and an algebra of sets, the atoms of K must correspond to the singleton elements of the algebra of sets. This suggests that we try to define an isomorphism from K to the algebra P (A) of subsets of the set A of atoms of K. The following theorem shows that if K is finite, we can set up such an isomorphism. Theorem 2.28. Representation Theorem for Finite Boolean Algebras. Let A be the set of atoms of the finite boolean algebra (K, ∧, ∨, ). Then there is a boolean algebra isomorphism between (K, ∧, ∨, ) and the algebra of subsets (P (A), ∩, ∪, − ). Proof. We already have a natural correspondence between the atoms of K and the atoms of P (A). We use the disjunctive normal form (Theorem 2.23) to extend this correspondence to all the elements of K.
40
2 BOOLEAN ALGEBRAS
By the disjunctive normal form, any element of K can be written as a join of atoms of K, say Bα ∨ · · · ∨ Bω . Define the function f : K → P (A) by f (Bα ∨ · · · ∨ Bω ) = {Bα } ∪ · · · ∪ {Bω }. The uniqueness of the normal form implies that each element of K has a unique image in P (A) and that f is a bijection. We still have to show that f is a morphism of boolean algebras. If X and Y are two elements of K, the atoms in the normal forms of X ∨ Y and X ∧ Y are, respectively, the atoms in the forms of X or Y and the atoms common to the forms of X and Y . Therefore, f (X ∨ Y ) = f (X) ∪ f (Y ), and f (X ∧ Y ) = f (X) ∩ f (Y ). An atom B is in the normal form for X if and only if B X , which, by Proposition 2.18(iv), happens if and only if B ∧ X = 0. Therefore, the atoms in X are all the atoms that are not in X and f (X ) = f (X). This proves that f is a boolean algebra isomorphism. COROLLARY 2.29. If (K, ∧, ∨, ) is a finite boolean algebra, then K has 2n elements, where n is the number of atoms in K. Proof. This follows from Theorem 2.5.
Consider the representation theorem (Theorem 2.28) applied to the boolean algebra D110 , which consists of the divisors of 110. The atoms of this algebra are the prime divisors 2, 5, and 11. Theorem 2.28 defines a boolean algebra isomorphism to the algebra of subsets of {2, 5, 11}. This isomorphism, f , maps a number onto the subset consisting of its prime divisors; for example, f (11) = {11} and f (10) = {2, 5}. Example 2.30. Do the divisors of 12 form a boolean algebra under gcd and lcm? Solution. The set of divisors of 12 is {1, 2, 3, 4, 6, 12}. Since the number of elements is not a power of 2, it cannot form a boolean algebra. Example 2.31. Do the divisors of 24 form a boolean algebra under gcd and lcm? Solution. There are 8 = 23 divisors of 24, namely 1, 2, 3, 4, 6, 8, 12, and 24. However, the poset diagram in Figure 2.34 shows that 2 and 3 are the only atoms. Hence, by Corollary 2.29, it cannot be a boolean algebra because it does not have 22 = 4 elements. An infinite boolean algebra is not necessarily isomorphic to the algebra of all subsets of a set, but is isomorphic to the algebra of some subsets of a set. This result is known as Stone’s representation theorem, and a proof can be found in Mendelson [21, Sec. 5.7].
EXERCISES
41
24 12
8
6
4
3
2 1
Figure 2.34.
Poset diagram of the divisors of 24.
EXERCISES If A, B, and C are subsets of a set X, under what conditions do the equalities in Exercises 2.1 to 2.6 hold? 2.1. 2.2. 2.3. 2.4. 2.5. 2.6. 2.7. 2.8. 2.9. 2.10.
2.11.
2.12. 2.13. 2.14.
2.15.
A ∪ B = AB(A ∩ B). A ∩ (B ∪ C) = (A ∩ B) ∪ C. A − (B ∪ C) = (A − B) ∪ (A − C). A(B ∩ C) = (AB) ∩ (AC). A(B ∪ C) = (AB) ∪ (AC). A ∪ (B ∩ A) = A. Prove the remaining parts of Proposition 2.1. Prove the remaining parts of Proposition 2.3. Prove Theorem 2.5 by induction on n. That is, if X is a finite set with n elements, prove that P (X) contains 2n elements. Prove or give a counterexample to the following statements. (a) P (X) ∩ P (Y ) = P (X ∩ Y ). (b) P (X) ∪ P (Y ) = P (X ∪ Y ). (Cantor’s theorem) Prove that there is no surjective (onto) function from X to P (X) for any finite or infinite set X. This shows that P (X) always contains more elements than X. [Hint: If f : X → P (X), consider {x ∈ X|x ∈ / f (x)}.] Write down the table for (P (X), −), under the difference operation, when X = {a, b}. If A, B, C, and D are finite sets, find an expression for |A ∪ B ∪ C ∪ D| in terms of the number of elements in their intersections. Of the Chelsea pensioners who returned from a war, at least 70% had lost an eye, 75% an ear, 80% an arm, and 85% a leg. What percentage, at least must have lost all four? (From Lewis Carroll, A Tangled Tale.) One hundred students were questioned about their study habits. Seventy said they sometimes studied during the day, 55 said they sometimes studied during the night, and 45 said they sometimes studied during the weekend.
42
2 BOOLEAN ALGEBRAS
Also, 36 studied during the day and night, 24 during the day and at weekends, 17 during the night and at weekends, and 3 during the day, night, and weekends. How many did not study at all? 2.16. Prove that the associative laws in defined in the section “Boolean Algebras” follow from the other axioms of a boolean algebra. 2.17. If the zero element is the same as the unit element in a boolean algebra, prove that the algebra has only one element. Is this algebra isomorphic to the algebra of subsets of some set? 2.18. Draw the poset diagram for F1 , the boolean algebra of switching functions of one variable. If A, B, and C are elements of a boolean algebra (K, ∧, ∨, ) and is the related partial order, prove the assertions in Exercises 2.19 to 2.24 from the axioms and Propositions 2.13, 2.17, and 2.18. 0 = 1. A ∧ (A ∨ B) = A ∧ B. (A ∧ B) ∨ (B ∧ C) ∨ (C ∧ A) = (A ∨ B) ∧ (B ∨ C) ∧ (C ∨ A). A B ∧ C implies that A B and A C. (A ∧ B ) ∨ C = (B ∧ C) ∨ (B ∧ (A ∨ C)). A B if and only if B A . Write down the truth tables for the following propositions. Which of these propositions are equivalent? (a) A ⇒ B. (b) B ⇒ A . (c) (A ∧ B) ⇔ B. (d) (A ∨ B) ⇔ A. 2.26. Is the proposition [(A ⇒ B) ∧ (B ⇔ C) ] equivalent to [B ∨ (A ∧ C)] or [(C ⇒ B) ∨ (B ⇒ (A ∧ C))]? 2.27. Which of the following are tautologies, and which are contradictions? (a) (A ∧ B) ⇔ (A ⇒ B ). (b) A ⇒ (B ⇒ A). (c) (A ∧ B ) ⇔ (A ⇒ B) . (d) (A ⇒ B) ⇒ ((B ⇒ C) ⇒ (A ⇒ C)). 2.28. Harry broke the window if and only if he ran away and John was lying. John said that either Harry broke the window or Harry did not run away. If Harry ran away, then he did not break the window. What conclusions can you come to? 2.19. 2.20. 2.21. 2.22. 2.23. 2.24. 2.25.
Draw circuits to realize the expressions in Exercises 2.29 and 2.30. 2.29. (A ∧ (B ∨ C ∨ D)) ∨ B . 2.30. (A ∧ B ∧ C ) ∨ (A ∧ B ∧ C) ∨ (A ∧ B ∧ C). 2.31. Simplify the following expression and then draw a circuit for it. ((A ∧ B) ∨ C ) ∧ (B ∨ (C ∧ A )) ∨ (A ∧ B ∧ C ).
EXERCISES
43
Give a boolean expression for each of the circuits in Exercises 2.32 to 2.36, find their disjunctive normal forms, and then try to simplify the circuits. 2.32.
2.33.
A
A
A A′
2.34.
2.35.
2.36.
B A
B
B′
C
C
A′
A′
C′
A
A′
B′
B
B
A′
A
A′ B′ C
B C B
C′
A′
A′
2.37. By looking at all the possible paths through the bridge circuit in Figure 2.35, show that it corresponds to the boolean expression (A ∧ D) ∨ (B ∧ E) ∨ (A ∧ C ∧ E) ∨ (B ∧ C ∧ D).
A
D C
B
E
Figure 2.35
2.38. Find a series-parallel circuit that is equivalent to the bridge circuit in Figure 2.36 and simplify your circuit.
A
B C
B
C
A′
Figure 2.36
2.39. A hall light is controlled by two switches, one upstairs and one downstairs. Design a circuit so that the light can be switched on or off from the upstairs or the downstairs.
44
2 BOOLEAN ALGEBRAS
2.40. A large room has three separate entrances, and there is a light switch by each entrance. Design a circuit that will allow the lights to be turned on or off by throwing any one switch. 2.41. A voting machine for three people contains three YES–NO switches and allows current to pass if and only if there is a majority of YES votes. Design and simplify such a machine. 2.42. Design and simplify a voting machine for five people. 2.43. Design a circuit for a light that is controlled by two independent switches A and B and a master switch C. C must always be able to turn the light on. When C is off, the light should be able to be turned on and off using A or B. 2.44. A committee consists of a chairman A, and three other members, B, C, and D. If B, C, and D, are not unanimous in their voting, the chairman decides the vote. Design a voting machine for this committee and simplify it as much as possible. 2.45. Verify that the Venn diagram in Figure 2.37 illustrates the 16 atoms for a boolean expression in four variables. Then use the diagram to simplify the circuit in Figure 2.37.
C
D
A
A
B′
C
A′
A
B
D
A′
B
Figure 2.37
2.46. Design four series-parallel circuits to multiply two numbers in binary form that have at most two digits each. 2.47. Design a circuit that will turn an orange light on if exactly one of the four switches A, B, C, and D is on and a green light when all four are on. 2.48. Five switches are set to correspond to a number in binary form that has at most five digits. Design and simplify a circuit that will switch a light on if and only if the binary number is a perfect square. 2.49. In Chapter 11 we construct a finite field F = {0, 1, α, β} whose multiplication table is given in Table 2.19. Writing 00 for 0, 01 for 1, 10 for α, and 11 for β, design and simplify circuits to perform this multiplication. 2.50. A swimming pool has four relay switches that open when the water temperature is above the maximum allowable, when the water temperature is below the minimum, when the water level is too high, and when the level
EXERCISES
45
TABLE 2.19. Multiplication in a Four-Element Field ·
0
1
α
β
0 1 α β
0 0 0 0
0 1 α β
0 α β 1
0 β 1 α
is too low. These relays are used to control the valves that add cold water, that let water out, and that heat the water in the pool. Design and simplify a circuit that will perform the following tasks. If the temperature is correct but the level too high, it is to let water out. If the temperature is correct but the level too low, it is to let in cold water and heat the water. If the pool is too warm, add cold water and, if the level is also too high, let water out at the same time. If the pool is too cold but the level correct, heat the water; if the level is too low, heat the water and add cold water, and, if the level is too high, just let out the water. 2.51. In a dual fashion to the disjunctive normal form, every boolean expression in n-variables can be written in its conjunctive normal form. What are the conjunctive normal forms for AB and A ∧ B ? Draw poset diagrams for the sets given in Exercises 2.52 to 2.57 with divisibility as the partial order and determine whether the systems are lattices or boolean algebras. {1, 2, 3, 4, 5, 6}. 2.53. {2, 4, 6, 12}. D54 2.55. {1, 2, 4, 8}. D42 2.57. {1, 2, 3, 5, 6, 10, 30, 60}. Prove that (Dn , |) is a poset for each n 2, and prove the distributive laws. Let n = p1 p2 · · · pr , where the pi are distinct primes. Describe the atoms in the boolean algebra (Dn , gcd, lcm, ). 2.60. Prove that an element A = 0 in a boolean algebra is an atom if and only if for each B in the algebra, either A B or A B . 2.61. Suppose that A and B are elements of a boolean algebra. If an element X in the algebra exists such that A ∧ X = B ∧ X and A ∨ X = B ∨ X, show that A = B. [Hint: A = A ∧ (A ∨ X).] 2.62. Let K = {x ∈ R|0 x 1} and let x ∧ y and x ∨ y be the smaller and larger of x and y, respectively. Show that it is not possible to define a complement on K so that (K, ∧, ∨, ) is a boolean algebra. However, if we define x = 1 − x, which of the properties defined in the section “Boolean Algebras” and in Proposition 2.13 remain true? This is the kind of algebraic model that would be required to deal with transistor switching gates under transient conditions. The voltage or current varies continuously between the levels 0 and 1, while an AND gate performs the operation x ∧ y, an OR gate performs x ∨ y, and a NOT gate produces x .
2.52. 2.54. 2.56. 2.58. 2.59.
46
2 BOOLEAN ALGEBRAS
2.63. If f is a boolean algebra morphism from K to L, prove that f (0K ) = 0L and f (1K ) = 1L , where 0K , 0L , 1K , and 1L are the respective zero and unit elements. 2.64. Write down the tables for the NOR and NAND operations on the set P ({a, b, c}). 2.65. Can every switching circuit be built out of AND and NOT gates? 2.66. (a) Design a half adder using five NOR gates. (b) Design a half adder using five NAND gates. 2.67. Analyze the effect of the circuit in Figure 2.38. a NAND
b
d
NOR
c
Figure 2.38
2.68. Design a NOR circuit that will produce a parity check symbol for four binary input digits; that is, the circuit must produce a 0 if the inputs contain an even number of 1’s, and it must produce 1 otherwise. 2.69. One of the basic types of components of a digital computer is a flip-flop. This is a device that can be in one of two states (corresponding to outputs 0 and 1) and it will remain in a particular state Q until an input changes the state to the next state Q∗ . One important use of a flip-flop is to store a binary digit. An RS flip-flop is a circuit with two inputs, R and S, and one output, Q, corresponding to the state of the flip-flop. An input R = 1 resets the next state Q∗ to 0, and an input S = 1 sets the next state to 1. If both R and S are 0, the next state is the same as the previous state Q. It is assumed that R and S cannot both be 1 simultaneously. Verify that the NOR circuit in Figure 2.39 is indeed an RS flip-flop. To eliminate spurious effects due to the time it takes a transistor to operate, this circuit should be controlled by a “clock.” The output Q should be read only when the clock “ticks,” whereas the inputs are free to change between ticks. S
NOR
NOR
R
Figure 2.39.
Q
RS flip-flop.
2.70. A JK flip-flop is similar to an RS flip-flop except that both inputs are allowed to be 1 simultaneously, and in this case the state Q changes to its opposite state. Design a JK flip-flop using NOR and NAND gates.
3 GROUPS
Symmetries and permutations in nature and in mathematics can be described conveniently by an algebraic object called a group. In Chapter 5, we use group theory to determine all the symmetries that can occur in two- or three-dimensional space. This can be used, for example, to classify all the forms that chemical crystals can take. If we have a large class of objects, some of which are equivalent under permutations or symmetries, we show, in Chapter 6, how groups can be used to count the nonequivalent objects. For example, we count the number of different switching functions of n variables if we allow permutations of the inputs. Historically, the basic ideas of group theory arose with the investigation of permutations of finite sets in the theory of equations. One of the aims of mathematicians at the beginning of the nineteenth century was to find methods for solving polynomial equations of degree 5 and higher. Algorithms, involving the elementary arithmetical operations and the extraction of roots, were already known for solving all polynomial equations of degree less than 5; the formulas for solving quadratic equations had been known since Babylonian times, and cubic and quartic equations had been solved by various Italian mathematicians in the sixteenth century. However, in 1829, using the rudiments of group theory, the Norwegian Niels Abel (1802–1829) showed that some equations of the fifth degree could not be solved by any such algorithm. Just before he was mortally ´ wounded in a duel, at the age of 20, the brilliant mathematician Evariste Galois (1811–1832) developed an entire theory that connected the solvability of an equation with the permutation group of its roots. This theory, now called Galois theory, is beyond the scope of this book, but interested students should look at Stewart [35] after reading Chapter 11. It was not until the 1880s that the abstract definition of a group that we use today began to emerge. However, Cayley’s theorem, proved at the end of this chapter, shows that every abstract group can be considered as a group of permutations. It was soon discovered that this concept of a group was so universal that it cropped up in many different branches of mathematics and science. Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 47
48
3 GROUPS
GROUPS AND SYMMETRIES A group (G, ·) is a set G together with a binary operation · satisfying the following axioms. (i) G is closed under the operation ·; that is, a · b ∈ G for all a, b ∈ G. (ii) The operation · is associative; that is, (a · b) · c = a · (b · c) for all a, b, c ∈ G. (iii) There is an identity element e ∈ G such that e · a = a · e = a for all a ∈ G. (iv) Each element a ∈ G has an inverse element a −1 ∈ G such that a −1 · a = a · a −1 = e. The closure axiom is already implied by the definition of a binary operation; however, it is included because it is often overlooked otherwise. If the operation is commutative, that is, if a · b = b · a for all a, b ∈ G, the group is called commutative or abelian, in honor of the mathematician Niels Abel. Let G be the set of complex numbers {1, −1, i, −i} and let · be the standard multiplication of complex numbers. Then (G, ·) is an abelian group. The product of any two of these elements is an element of G; thus G is closed under the operation. Multiplication is associative and commutative in G because multiplication of complex numbers is always associative and commutative. The identity element is 1, and the inverse of each element a is the element 1/a. Hence 1−1 = 1, (−1)−1 = −1, i −1 = −i, and (−i)−1 = i. The multiplication of any two elements of G can be represented by Table 3.1. The set of all rational numbers, Q, forms an abelian group (Q, +) under addition. The identity is 0, and the inverse of each element is its negative. Similarly, (Z, +), (R, +), and (C, +) are all abelian groups under addition. If Q∗ , R∗ , and C∗ denote the set of nonzero rational, real, and complex numbers, respectively, (Q∗ , ·), (R∗ , ·), and (C∗ , ·) are all abelian groups under multiplication. For any set X, (P (X), ) is an abelian group. The group axioms follow from Proposition 2.3; the empty set, Ø, is the identity, and each element is its own inverse. TABLE 3.1. Group {1, −1, i , −i } ·
1
−1
i
−i
1 −1 i −i
1 −1 i −i
−1 1 −i i
i −i −1 1
−i i 1 −1
GROUPS AND SYMMETRIES
49
Every group must have at least one element, namely, its identity, e. A group with only this one element is called trivial. A trivial group takes the form ({e}, ·), where e · e = e. Many important groups consist of functions. Given functions f : X → Y and g: Y → Z, their composite g Ž f : X → Z is defined by (g Ž f )(x) = g(f (x))
for all x ∈ X.
Composition is associative; that is, if h: Z → W , then h Ž (g Ž f ) = (h Ž g) Ž f . Indeed, (h Ž (g Ž f ))(x) = h(g(f (x))) = ((h Ž g) Ž f )(x) for all x ∈ X, as is readily verified. In particular, if X is a set, then Ž is an associative binary operation on the set of all functions f : X → X. Moreover, this operation has an identity: The identity function 1X : X → X is defined by 1X (x) = x
for all x ∈ X.
Then 1X Ž f = f = f Ž 1X for all f : X → X. Hence, we say that a function f : X → X is an inverse of f : X → X if f Ž f = 1X
and f Ž f = 1X ;
equivalently if f (f (x)) = x and f (f (x)) = x for all x ∈ X. This inverse is unique when it exists. For if f is another inverse of f , then f = f Ž 1X = f Ž (f Ž f ) = (f Ž f ) Ž f = 1X Ž f = f . When it exists (see Theorem 3.3) the inverse of f is denoted f −1 . Example 3.1. A translation of the plane R2 in the direction of the vector (a, b) is a function f : R2 → R2 defined by f (x, y) = (x + a, y + b). The composition of this translation with a translation g in the direction of (c, d) is the function f Ž g: R2 → R2 , where f Ž g(x, y) = f (g(x, y)) = f (x + c, y + d) = (x + c + a, y + d + b). This is a translation in the direction of (c + a, d + b). It can easily be verified that the set of all translations in R2 forms an abelian group, (T(2), Ž ), under composition. The identity is the identity transformation 1R2 : R2 → R2 , and the inverse of the translation in the direction (a, b) is the translation in the opposite direction (−a, −b). A function f : X → Y is called injective or one-to-one if f (x1 ) = f (x2 ) implies that x1 = x2 . In other words, an injective function never takes two different points to the same point. The function f : X → Y is called surjective or
50
3 GROUPS
onto if for any y ∈ Y , there exists x ∈ X with y = f (x), that is, if the image f (X) is the whole set Y . A bijective function or one-to-one correspondence is a function that is both injective and surjective. A permutation or symmetry of a set X is a bijection from X to itself. Lemma 3.2. If f : X → Y and g: Y → Z are two functions, then: (i) If f and g are injective, g Ž f is injective. (ii) If f and g are surjective, g Ž f is surjective. (iii) If f and g are bijective, g Ž f is bijective. Proof. (i) Suppose that (g Ž f )(x1 ) = (g Ž f )(x2 ). Then g(f (x1 )) = g(f (x2 )) so, since g is injective, f (x1 ) = f (x2 ). Since f is also injective, x1 = x2 , proving that g Ž f is injective. (ii) Let z ∈ Z. Since g is surjective, there exists y ∈ Y with g(y) = z, and since f is also surjective, there exists x ∈ X with f (x) = y. Hence (g Ž f )(x) = g(f (x)) = g(y) = z, so g Ž f is surjective. (iii) This follows from parts (i) and (ii). The following theorem gives a necessary and sufficient condition for a function to have an inverse. Theorem 3.3. Inversion Theorem. The function f : X → Y has an inverse if and only if f is bijective. Proof. Suppose that h: Y → X is an inverse of f . The function f is injective because if f (x1 ) = f (x2 ), it follows that (h Ž f )(x1 ) = (h Ž f )(x2 ), and so x1 = x2 . The function f is surjective because if y is any element of Y and x = h(y), it follows that f (x) = f (h(y)) = y. Therefore, f is bijective. Conversely, suppose that f is bijective. We define the function h: Y → X as follows. For any y ∈ Y , there exists x ∈ X with y = f (x). Since f is injective, there is only one such element x. Define h(y) = x. This function h is an inverse to f because f (h(y)) = f (x) = y, and h(f (x)) = h(y) = x. Theorem 3.4. If S(X) is the set of bijections from any set X to itself, then (S(X), Ž ) is a group under composition. This group is called the symmetric group or permutation group of X. Proof. It follows from Lemma 3.1 that the composition of two bijections is a bijection; thus S(X) is closed under composition. The composition of functions is always associative, and the identity of S(X) is the identity function 1X : X → X. The inversion theorem (Theorem 3.3) proves that any bijective function f ∈ S(X) has an inverse f −1 ∈ S(X). Therefore, (S(X), Ž ) satisfies all the axioms for a group.
GROUPS AND SYMMETRIES
51
TABLE 3.2. Symmetry Group of {a, b} Ž
1X f
1X 1X f
f f 1X
For example, if X = {a, b} is a two-element set, the only bijections from X to itself are the identity 1X and the symmetry f : X → X, defined by f (a) = b, f (b) = a, that interchanges the two elements. The use of the term symmetry to describe the bijection f agrees with one of our everyday uses of the word. In the phrase “the boolean expression (a ∧ b) ∨ (a ∧ b ) is symmetrical in a and b” we mean that the expression is unchanged when we interchange a and b. The symmetric group of X, S(X) = {1X , f } and its group table is given in Table 3.2. The composition f Ž f interchanges the two elements a and b twice; thus it is the identity. Since the composition of functions is not generally commutative, S(X) is not usually an abelian group. Consider the elements f and g in the permutation group of {1, 2, 3}, where f (1) = 2, f (2) = 3, f (3) = 1 and g(1) = 1, g(2) = 3, g(3) = 2. Then f Ž g(1) = 2, f Ž g(2) = 1, f Ž g(3) = 3, while g Ž f (1) = 3, g Ž f (2) = 2, g Ž f (3) = 1; hence f Ž g = g Ž f , and S({1, 2, 3}) is not abelian. A nonsingular linear transformation of the plane is a bijective function of the form f : R2 → R2 , where f (x, y) = (a11 x + a12 y, a21 x + a22 y) with the determinant a11 a22 − a12 a21 = 0. It can be verified that the composition of two such linear transformations is again of the same type. The set of all nonsingular linear transformations, L, forms a non-abelian group (L, Ž ). Besides talking about the symmetries of a distinct set of elements, we often refer, in everyday language, to a geometric object or figure as being symmetrical. We now make this notion more mathematically precise. If F is a figure in the plane or in space, a symmetry of the figure F or isometry of F is a bijection f : F → F which preserves distances; that is, for all points p, q ∈ F , the distance from f (p) to f (q) must be the same as the distance from p to q. One can visualize this operation by imagining F to be a solid object that can be picked up and turned in some manner so that it assumes a configuration identical to the one it had in its original position. For example, the design on the left of Figure 3.1 has two symmetries: the identity and a half turn about a vertical axis, called an axis of symmetry. The design in the center of Figure 3.1
Figure 3.1.
Symmetrical designs.
52
3 GROUPS
has three symmetries: the identity and rotations of one-third and two-thirds of a revolution about its center. However, both the one-third rotation and interchanging two vertices are symmetries of the equilateral triangle on the right in Figure 3.1, but there is a subtle difference: The rotation can be performed as a physical motion within the plane of the triangle (and so is called a proper symmetry or a proper rotation), while the reflection can only be accomplished as a physical motion by moving the triangle outside its plane (an improper symmetry or an improper rotation). The set of all symmetries of a geometric figure forms a group under composition because the composition and inverse of two distance-preserving functions is distance preserving. Example 3.5. Write down the table for the group of symmetries of a rectangle with unequal sides. Solution. Label the corners of the rectangle 1, 2, 3, and 4 as in Figure 3.2. Any symmetry of the rectangle will send corner points to corner points and so will permute the corners among themselves. Denote the (improper) symmetry obtained by reflecting the rectangle in the horizontal axis through the center, by a; then a(1) = 4, a(2) = 3, a(3) = 2, and a(4) = 1. This symmetry can also be considered as a rotation of the rectangle through half a revolution about this horizontal axis. There is a similar symmetry, b, about the vertical axis through the center. A third (proper) symmetry, c, is obtained by rotating the rectangle in its plane through half a revolution about its center. Finally, the identity map, e, is a symmetry. These are the only symmetries because it can be verified that any other bijection between the corners will not preserve distances. The group of symmetries of the rectangle is ({e, a, b, c}, Ž ), and its table, as shown in Table 3.3, can be calculated as follows. The symmetries a, b, and c are all half turns, so a Ž a, b Ž b, and c Ž c are full turns and are therefore equal to the identity. The function a Ž b acts on the corner points by a Ž b(1) = a(b(1)) = a(2) = 3, a Ž b(2) = 4, a Ž b(3) = 1, and a Ž b(4) = 2. Therefore, a Ž b = c. The other products can be calculated similarly. This group of symmetries of a rectangle is sometimes called the Klein 4group, after the German geometer Felix Klein (1849–1925). We have seen that the group operation can be denoted by various symbols, the most common being multiplication, composition, and addition. It is conventional b 1
2
a
c
4
Figure 3.2.
3
Symmetries of a rectangle.
GROUPS AND SYMMETRIES
53
TABLE 3.3. Symmetry Group of a Rectangle Ž
e
a
b
c
e a b c
e a b c
a e c b
b c e a
c b a e
to use addition only for abelian groups. Furthermore, the identity under addition is usually denoted by 0 and the inverse of a by −a. Hence expressions of the form a · b−1 and a n = a · · · a, in multiplicative notation, would be written as a − b and na = a + · · · + a, respectively, in additive notation. In propositions and theorems concerning groups in general, it is conventional to use multiplicative notation and also to omit the dot in writing a product; therefore, a · b is just written as ab. Whenever the operation in a group is clearly understood, we denote the group just by its underlying set. Therefore, the groups (Z, +), (Q, +), (R, +), and (C, +) are usually denoted just by Z, Q, R, and C, respectively. This should cause no confusion because Z, Q, R, and C are not groups under multiplication (since the element 0 has no multiplicative inverse). The symmetric group of X is denoted just by S(X), the operation of composition being understood. Moreover, if we refer to a group G without explicitly defining the group or the operation, it can be assumed that the operation in G is multiplication. We now prove two propositions that will enable us to manipulate the elements of a group more easily. Recall from Proposition 2.10 that the identity of any binary operation is unique. We first show that the inverse of any element of a group is unique. Proposition 3.6. Let be an associative binary operation on a set S that has identity e. Then, if an element a has an inverse, this inverse is unique. Proof. Suppose that b and c are both inverses of a; thus a b = b a = e, and a c = c a = e. Now, since e is the identity and is associative, b = b e = b (a c) = (b a) c = e c = c.
Hence the inverse of a is unique.
Note that if ab = e in a group G with identity e, then a −1 = b and b−1 = a. Indeed, b has an inverse b−1 in G, so b−1 = eb−1 = (ab)b−1 = ae = a. Similarly, a −1 = b. Proposition 3.7. If a, b, and c are elements of a group G, then (i) (a −1 )−1 = a. (ii) (ab)−1 = b−1 a −1 . (iii) ab = ac or ba = ca implies that b = c.
(cancellation law)
54
3 GROUPS
Proof. (i) The inverse of a −1 is an element b such that a −1 b = ba −1 = e. But a is such an element, and by Proposition 3.6 we know that the inverse is unique. Hence (a −1 )−1 = a. (ii) Using associativity, we have (ab)(b−1 a −1 ) = a((bb−1 )a −1 ) = a(ea −1 ) = aa −1 = e. Hence b−1 a −1 is the unique inverse of ab. (iii) Suppose that ab = ac. Then a −1 (ab) = a −1 (ac), so (a −1 a)b = (a −1 a)c. That is, eb = ec and b = c. Similarly, ba = ca implies that b = c. Notice in part (ii) that the order of multiplication is reversed. This should be familiar from the particular case of the group of invertible n × n matrices under multiplication. A more everyday example is the operation of putting on socks and shoes. To reverse the procedure, the shoes are taken off first and then the socks. If a is an element in any group G, we write a 1 = a, a 2 = aa, a 3 = aaa, and so on, just as for numbers. Hence, if k 1, we define a k to be the product of a with itself k times. Similarly, we define a −k = (a −1 )k for k 1. Finally, we set a 0 to be the identity, again as for numbers. Thus we have defined a k for every k ∈ Z, and it is a routine verification that the laws of exponents hold: a k a m = a k+m ,
(a k )m = a k+m
for all a ∈ G and all k, m ∈ Z.
Moreover: If ab = ba in G, then (ab)k = a k bk
for all k ∈ Z. 0 −1 and However, this need not hold if ab = ba: For example, if a = 1 0 1 −1 in the group of invertible 2 × 2 matrices, then (ab)2 = a 2 b2 . b= 1 0
SUBGROUPS It often happens that some subset of a group will also form a group under the same operation. Such a group is called a subgroup. For example, (R, +) is a subgroup of (C, +), and the group of translations of R2 in Example 3.1 is a subgroup of the group of all isometries of R2 . If (G, ·) is a group and H is a nonempty subset of G, then (H, ·) is called a subgroup of (G, ·) if the following conditions hold: (i) a · b ∈ H for all a, b ∈ H . (closure) (ii) a −1 ∈ H for all a ∈ H . (existence of inverses)
SUBGROUPS
55
Proposition 3.8. If H is a subgroup of (G, ·), then (H, ·) is also a group. Proof. If H is a subgroup of (G, ·), we show that (H, ·) satisfies all the group axioms. The definition above implies that H is closed under the operation; that is, · is a binary operation on H . If a, b, c ∈ H , then (a · b) · c = a · (b · c) in (G, ·) and hence also in (H, ·). Since H is nonempty, it contains at least one element, say h. Now h−1 ∈ H and h · h−1 , which is the identity, is in H . The definition of subgroup implies that (H, ·) contains inverses. Therefore, (H, ·) satisfies all the axioms of a group. Conditions (i) and (ii) are equivalent to the single condition: (iii) a · b−1 ∈ H for all a, b ∈ H . However, when H is finite, the following result shows that it is sufficient just to check condition (i). Proposition 3.9. If H is a nonempty finite subset of a group G and ab ∈ H for all a, b ∈ H , then H is a subgroup of G. Proof. We have to show that for each element a ∈ H , its inverse is also in H . All the elements, a, a 2 = aa, a 3 = aaa, . . . belong to H so, since H is finite, these cannot all be distinct. Therefore, a i = a j for some 1 i < j . By Proposition 3.7(iii), we can cancel a i from each side to obtain e = a j −1 , where j − i > 0. Therefore, e ∈ H and this equation can be written as e = a(a j −i−1 ) = (a j −i−1 )a. Hence a −1 = a j −i−1 , which belongs to H , since j − i − 1 0. In the group ({1, −1, i, −i}, ·), the subset {1, −1} forms a subgroup because this subset is closed under multiplication. In the group of translations of the plane (Example 3.1), the set of translations in the horizontal direction forms a subgroup because compositions and inverses of horizontal translations are still horizontal translations. The group Z is a subgroup of Q, Q is a subgroup of R, and R is a subgroup of C. (Remember that addition is the operation in all these groups.) However, the set N = {0, 1, 2, . . .} of nonnegative integers is a subset of Z but not a subgroup, because the inverse of 1, namely, −1, is not in N. This example shows that Proposition 3.9 is false if we drop the condition that H be finite. The relation of being a subgroup is transitive. In fact, for any group G, the inclusion relation between the subgroups of G is a partial order relation. Example 3.10. Draw the poset diagram of the subgroups of the group of symmetries of a rectangle. Solution. By looking at the table of this group in Table 3.3, we see that Ž is a binary operation on {e, a}; thus {e, a} is a subgroup. Also, {e, b} and {e, c} are subgroups. If a subgroup contains a and b, it must contain a Ž b = c, so it is the
56
3 GROUPS {e, a, b, c} {e, a}
{e, b}
{e, c}
{e}
Figure 3.3.
Subgroups of the group of symmetries of a rectangle.
whole group. Similarly, subgroups containing a and c or b and c must be the whole group. The poset diagram of subgroups is given in Figure 3.3.
CYCLIC GROUPS AND DIHEDRAL GROUPS The number of elements in a group G is written |G| and is called the order of the group. G is called a finite group if |G| is finite, and G is called an infinite group otherwise. An important class of groups consists of those for which every element can be written as a power (positive or negative) of some fixed element. More precisely, a group (G, ·) is called cyclic if there exists an element g ∈ G such that G = {g n |n ∈ Z}. The element g is called a generator of the cyclic group. Every cyclic group is abelian because g r · g s = g r+s = g s · g r . The group ({1, −1, i, −i}, ·) is a cyclic group of order 4 generated by i because i 0 = 1, i 1 = i, i 2 = −1, i 3 = −i, i 4 = 1, i 5 = i, and so on. Hence the group can be written as ({1, i, i 2 , i 3 }, ·). In additive notation, the group (G, +) is cyclic if G = {ng|n ∈ Z} for some g ∈ G. The group (Z, +) is an infinite cyclic group with generator 1 (or −1). The order of an element g in a group (G, ·) is the least positive integer r such that g r = e. If no such r exists, the order of the element is said to be infinite. Note the difference between the order of an element and the order of a group. We are going to find connections between these two orders and later prove Lagrange’s theorem, which implies that in a finite group, the order of every element divides the order of the group. For example, in ({1, −1, i, −i}, ·), the identity 1 has order 1, −1 has order 2 because (−1)2 = 1, whereas i and −i both have order 4. The group has order 4. Let Q∗ = Q − {0} be the set of nonzero rational numbers. Then (Q∗ , ·) is a group under multiplication. The order of the identity element 1 is 1, and the order of −1 is 2. The order of every other element is infinite, because the only solutions to q r = 1 with q ∈ Q∗ , r 1 are q = ±1. The group has infinite order. However, it is not cyclic, because there is no rational number r such that every nonzero rational can be written as r n for some n ∈ Z. The next two results show how the division algorithm for integers (see Appendix 2) is used in group theory. Proposition 3.11. Let a be an element of order r in a group G. Then for k ∈ Z, g k = e if and only if r divides k.
CYCLIC GROUPS AND DIHEDRAL GROUPS
57
Proof. If k = rm, m ∈ Z, then a k = (a r )m = em = e. Conversely, if a k = e, write k = qr + s, where q and s are in Z and 0 s < r. Then a s = a k−qr = a k (a r )−q = e · e−q = e. Since 0 s < r and r is the smallest positive integer such that a r = e, it follows that s = 0. But then k = qr, as required. Proposition 3.12. Every subgroup of a cyclic group is cyclic. Proof. Suppose that G is cyclic with generator g and that H ⊆ G is a subgroup. If H = {e}, it is cyclic with generator e. Otherwise, let g k ∈ H with k = 0. Since g −k = (g k )−1 is in H , we have g m ∈ H for some m > 0, and we choose m to be the smallest such positive integer. Write h = g m ; we claim that h generates H . Certainly, hk ∈ H for every k ∈ Z because h ∈ H ; we must show that every element a in H is a power of h. Since a ∈ G we have a = g s , s ∈ Z. By the division algorithm, write s = qm + r, where 0 r < m. Then a r = g s−qm = g s (g m )−q = a · h−q ∈ H , so r = 0 by the choice of m. Hence a = g s = g qm = (g m )q = hq , as we wanted. For any element g in a group (G, ·) we can look at all the powers of this element, namely, {g r |r ∈ Z}. This may not be the whole group, but it will be a subgroup. Proposition 3.13. If g is any element of order k in a group (G, ·), then H = {g r |r ∈ Z} is a subgroup of order k in (G, ·). This is called the cyclic subgroup generated by g. Proof. We first check that H is a subgroup of (G, ·). This follows from the fact that g r · g s = g r+s ∈ H and (g r )−1 = g −r ∈ H for all r, s ∈ Z. If the order of the element g is infinite, we show that the elements g r are all distinct. Suppose that g r = g s , where r > s. Then g r−s = e with r − s > 0, which contradicts the fact that g has infinite order. In this case, |H | is infinite. If the order of the element g is k, which is finite, we show that H = {g 0 = e, g 1 , g 2 , . . . , g k−1 }. Suppose that g r = g s , where 0 s < r k − 1. Multiply both sides by g −s so that g r−s = e with 0 < r − s < k. This contradicts the fact that k is the order of g. Hence the elements g 0 , g 1 , g 2 , . . . , g k−1 are all distinct. For any other element, g t , we can write t = qk + r, where 0 r < k by the division algorithm. Hence g t = g qk+r = (g k )q (g r ) = (eq )(g r ) = g r . Hence H = {g 0 , g 1 , g 2 , . . . , g k−1 } and |H | = k.
For example, in (Z, +), the subgroup generated by 3 is {. . . , −3, 0, 3, 6, 9, . . .}, an infinite subgroup that we write as 3Z = {3r|r ∈ Z}. Theorem 3.14. If the finite group G is of order n and has an element g of order n, then G is a cyclic group generated by g.
58
3 GROUPS
Proof. From the previous proposition we know that H , the subgroup of G generated by g, has order n. Therefore, H is a subset of the finite set G with the same number of elements. Hence G = H and G is a cyclic group generated by g. Example 3.15. Show that the Klein 4-group of symmetries of a rectangle, described in Example 3.5, is not cyclic. Solution. In the Klein 4-group, the identity has order 1, whereas all the other elements have order 2. As it has no element of order 4, it cannot be cyclic. All the elements of the Klein 4-group can be written in terms of a and b. We therefore say that this group can be generated by the two elements a and b. Example 3.16. Show that the group of proper rotations of a regular n-gon in the plane is a cyclic group of order n generated by a rotation of 2π/n radians. This group is denoted by Cn . Solution. This is the group of those symmetries of the regular n-gon that can be performed in the plane, that is, without turning the n-gon over. Label the vertices 1 through n as in Figure 3.4. Under any symmetry, the center must be fixed, and the vertex 1 can be taken to any of the n vertices. The image of 1 determines the rotation; hence the group is of order n. Let g be the counterclockwise rotation of the n-gon through 2π/n. Then g has order n, and by Theorem 3.14, the group is cyclic of order n. Hence Cn = {e, g, g 2 , . . . , g n−1 }. Let us now consider the group of all symmetries (both proper and improper rotations) of the regular n-gon. We call this group the dihedral group and denote it by Dn . Example 3.17. Show that the dihedral group, Dn , is of order 2n and is not cyclic. Solution. Label the vertices 1 to n in a counterclockwise direction around the n-gon. Let g be a counterclockwise rotation through 2π/n, and let h be the improper rotation of the n-gon about an axis through the center and vertex 1, as indicated in Figure 3.5. The element g generates the group Cn , which is a cyclic subgroup of Dn . The element h has order 2 and generates a subgroup {e, h}.
3
3
g2
2
2
g
g
h
1
1
n
n
n−1
Figure 3.4.
Elements of Cn .
n−1
Figure 3.5.
Elements of Dn .
CYCLIC GROUPS AND DIHEDRAL GROUPS
59
Any symmetry will fix the origin and is determined by the image of two adjacent vertices, say 1 and 2. The vertex 1 can be taken to any of the n vertices, and then 2 must be taken to one of the two vertices adjacent to the image of 1. Hence Dn has order 2n. If the image of 1 is r + 1, the image of 2 must be r + 2 or r. If the image of 2 is r + 2, the symmetry is g r . If the image of 2 is r, the symmetry is g r h. Figure 3.6 shows that the symmetries g r h and hg −r have the same effect and therefore imply the relation g r h = hg −r = hg n−r . Hence the dihedral group is Dn = {e, g, g 2 , . . . , g n−1 , h, gh, g 2 h, . . . , g n−1 h}. Note that if n 3, then gh = hg; thus Dn is a noncommutative group. Therefore, this group cannot be cyclic. D2 can be defined as the symmetries of the figure in Figure 3.7. Hence D2 = {e, g, h, gh}, and each nonidentity element has order 2. Example 3.18. Draw the group table for C4 and D4 . Solution. D4 is the group of symmetries of the square, and its table, which is calculated using the relation g r h = hg 4−r , is given in Table 3.4. For example, (g 2 h)(gh) = g 2 (hg)h = g 2 (g 3 h)h = g 5 h2 = g. Since C4 is a subgroup of D4 , the table for C4 appears inside the dashed lines in the top left corner. Note that the order of each of the elements h, gh, g 2 h, and g 3 h in D4 is 2. In general, the element g r h in Dn is a reflection in the line through the center 2
g −r
1
n−r n−r+1
n h
n−r+2 h
r+1
2
gr
1
r
r+2
n
Figure 3.6.
2
Relation g r h = hg −r in Dn .
g
Figure 3.7.
1
Symmetries of a 2-gon.
h
60
3 GROUPS
TABLE 3.4. Group D4 •
e g g2 g3 h gh g2h g3h
e
g
g2
g3
h
gh
g2h
g 3h
e g g2 g3 h gh g2h g3h
g g2 g3 e g 3h h gh g 2h
g2 g3 e g g 2h g 3h h gh
g3 e g g2 gh g 2h g 3h h
h gh g2h g3h e g g2 g3
gh g2h g 3h h g3 e g g2
g2h g 3h h gh g2 g3 e g
g 3h h gh g2h g g2 g3 e
of the n-gon bisecting the angle between vertices 1 and r + 1. Therefore, g r h always has order 2. MORPHISMS Recall that a morphism between two algebraic structures is a function that preserves their operations. For instance, in Example 3.5, each element of the group K of symmetries of the rectangle induces a permutation of the vertices 1, 2, 3, 4. This defines a function f : K → S({1, 2, 3, 4}) with the property that the composition of two symmetries of the rectangle corresponds to the composition of permutations of the set {1, 2, 3, 4}. Since this function preserves the operations, it is a morphism of groups. Two groups are isomorphic if their structures are essentially the same. For example, the group tables of the cyclic group C4 and ({1, −1, i, −i}, ·) would be identical if we replaced a rotation through nπ/2 by i n . We would therefore say that (C4 , Ž ) and ({1, −1, i, −1}, ·) are isomorphic. If (G, ·) and (H, ·) are two groups, the function f : G → H is called a group morphism if f (a · b) = f (a) · f (b) for all a, b ∈ G. If the groups have different operations, say they are (G, ·) and (H, ), the condition would be written as f (a · b) = f (a) f (b). We often use the notation f : (G, ·) → (H, ) for such a morphism. Many authors use homomorphism instead of morphism but we prefer the simpler terminology. A group isomorphism is a bijective group morphism. If there is an isomorphism between the groups (G, ·) and (H, ), we say that (G, ·) and (H, ) are isomorphic and write (G, ·) ∼ = (H, ). If G and H are any two groups, the trivial function that maps every element of G to the identity of H is always a morphism. If i: Z → Q is the inclusion map, i is a group morphism from (Z, +) to (Q, +). In fact, if H is a subgroup of G, the inclusion map H → G is always a group morphism.
MORPHISMS
61
Let f : Z → {1, −1} be the function defined by f (n) = 1 if n is even, and f (n) = −1 if n is odd. Then it can be verified that f (m + n) = f (m) · f (n) for any m, n ∈ Z, so this defines a group morphism f : (Z, +) → ({1, −1}, ·). Let GL(2, R) be the set of 2 × 2 invertible real matrices. The one-to-one correspondence between the set, L, of invertible linear transformations of the plane and the 2 × 2 coefficient matrices is an isomorphism between the groups (L, Ž ) and (GL(2, R), ·). Isomorphic groups share exactly the same properties, and we sometimes identify the groups via the isomorphism and give them the same name. If f : G → H is an isomorphism between finite groups, the group table of H is the same as that of G, when each element g ∈ G is replaced by f (g) ∈ H . Besides preserving the operations of a group, the following result shows that morphisms also preserve the identity and inverses. Proposition 3.19. Let f : G → H be a group morphism, and let eG and eH be the identities of G and H , respectively. Then (i) f (eG ) = eH . (ii) f (a −1 ) = f (a)−1 for all a ∈ G. Proof. (i) Since f is a morphism, f (eG )f (eG ) = f (eG · eG ) = f (eG ) = f (eG )eH . Hence (i) follows by cancellation in H (Proposition 3.7). (ii) f (a) · f (a −1 ) = f (a · a −1 ) = f (eG ) = eH by (i). Hence f (a −1 ) is the unique inverse of f (a); that is f (a −1 ) = f (a)−1 . Theorem 3.20. Cyclic groups of the same order are isomorphic. Proof. Let G = {g r |r ∈ Z} and H = {hr |r ∈ Z} be cyclic groups. If G and H are infinite, then g has infinite order, so for r, s ∈ Z, g r = g s if and only if r = s (see Proposition 3.13). Hence the function f : G → H defined by f (g r ) = hr , r ∈ Z, is a bijection, and f (g r g s ) = f (g r+s ) = hr+s = hr hs = f (g r )f (g s ) for all r, s ∈ Z, so f is a group isomorphism. If |G| = n = |H |, then G = {e, g, g 2 , . . . , g n−1 }, where these powers of g are all distinct (see the proof of Proposition 3.13). Similarly, H = {e, h, h2 , . . . , hn−1 }. Then the function f : G → H defined by f (g r ) = hr , is again a bijection. To see that it is a morphism, suppose that 0 r, s n − 1, and let r + s = kn + l, where 0 l n − 1. Then f (g r · g s ) = f (g r+s ) = f (g kn+l ) = f ((g n )k · g l ) = f (ek · g l ) = f (g l ) = hl and f (g r ) · f (g s ) = hr · hs = hr+s = hkn+l = (hn )k · hl = ek · hl = hl , so f is an isomorphism.
62
3 GROUPS
Hence every cyclic group is isomorphic to either (Z, +) or (Cn , ·) for some n. In the next chapter, we see that another important class of cyclic groups consists of the integers modulo n, (Zn , +). Of course, the theorem above implies that (Zn , +) ∼ = (Cn , ·). Any morphism, f : G → H , from a cyclic group G to any group H is determined just by the image of a generator. If g generates G and f (g) = h, it follows from the definition of a morphism that f (g r ) = f (g)r = hr for all r ∈ Z. Proposition 3.21. Corresponding elements under a group isomorphism have the same order. Proof. Let f : G → H be an isomorphism, and let f (g) = h. Suppose that g and h have orders m and n, respectively, where m is finite. Then hm = f (g)m = f (g m ) = f (e) = e. So n is also finite, and n m, since n is the least positive integer with the property hn = e. On the other hand, if n is finite then f (g n ) = f (g)n = hn = e = f (e). Since f is bijective, g n = e, and hence m is finite and m n. Therefore, either m and n are both finite and m = n, or m and n are both infinite. Example 3.22. Is D2 isomorphic to C4 or the Klein 4-group of symmetries of a rectangle? Solution. Compare the orders of the elements given in Table 3.5. By Proposition 3.21 we see that D2 cannot be isomorphic to C4 but could possibly be isomorphic to the Klein 4-group. In the Klein 4-group we can write c = a Ž b and we can obtain a bijection, f , from D2 to the Klein 4-group, by defining f (g) = a and f (h) = b. Table 3.6 for the two groups show that this is an isomorphism. TABLE 3.5 D2 Element e g h gh
C4
Klein 4-Group
Order
Element
Order
Element
Order
1 2 2 2
e g g2 g3
1 4 2 4
e a b c
1 2 2 2
TABLE 3.6. Isomorphic Groups · e g h gh
Group D2 e g h e g h g e gh h gh e gh h g
gh gh h g e
Ž
e a b c
Klein e e a b c
4-Group a b a b e c c e b a
c c b a e
PERMUTATION GROUPS
63
PERMUTATION GROUPS A permutation of n elements is a bijective function from the set of the n elements to itself. The permutation groups of two sets, with the same number of elements, are isomorphic. We denote the permutation group of X = {1, 2, 3, . . . , n} by (Sn , Ž ) and call it the symmetric group on n elements. Hence Sn ∼ = S(Y ) for any n element set Y . Proposition 3.23. |Sn | = n! Proof. The order of Sn is the number of bijections from {1, 2, . . . , n} to itself. There are n possible choices for the image of 1 under a bijection. Once the image of 1 has been chosen, there are n − 1 choices for the image of 2. Then there are n − 2 choices for the image of 3. Continuing in this way, we see that |Sn | = n(n − 1)(n − 2) · · · 2 · 1 = n! If π: {1, 2, . . . , n} → {1, 2, . . . , n} is a permutation, we denote it by 1 2 ··· n . π(1) π(2) · · · π(n) For example, the permutation of {1, 2, 3} that interchanges 1 and 3 is written 1 2 3 . We think of this as 3 2 1 1 2 3 ↓ ↓ ↓. 3 2 1
1 2 1 2 , which has two elements and , We can write S2 = 2 1 1 2 1 2 3 1 2 3 1 2 3 , , S3 = , 2 3 1 3 1 2 1 2 3
1 2 3 1 2 3 1 2 3 , , , 3 2 1 2 1 3 1 3 2 which is of order 3! = 6. If π, ρ ∈ Sn are two permutations, their product π Ž ρ is the permutation obtained by applying ρ first and then π. This agrees with our notion of composition of functions because (π Ž ρ)(x) = π(ρ(x)). (However, the reader should be aware that some authors use the opposite convention in which π is applied first and then ρ.) 1 2 3 1 2 3 are two elements of and ρ = Example 3.24. If π = 3 2 1 3 1 2 Ž Ž S3 , calculate π ρ and ρ π.
64
3 GROUPS
1 2 3 Ž 1 2 3 . To calculate this, we start at 3 1 2 3 2 1 the right and trace the image of each element under the composition.
Solution. π Ž ρ =
1 2
3 ↓ 3 1 2
1 2 ° ↓ 3 2
3 = 1
1 2 ↓ 2
3
Under ρ, 1 is mapped to 3, and under π, 3 is mapped to 2; thus under π Ž ρ, 1 is mapped to 2. Tracing the images of 2 and 3, we see that 1 2 3 1 2 3 Ž 1 2 3 Ž . = π ρ= 2 1 3 3 1 2 3 2 1 In a similar way we can show that 1 2 1 2 3 1 2 3 Ž ρ Žπ = = 1 3 3 2 1 3 1 2
3 2
.
Note that π Ž ρ = ρ Ž π and so S3 is not commutative. 1 2 3 has the effect of moving the elements The permutation π = 3 1 2 around in a cycle. This is called a cycle of length 3, and we write this as 1 3 2 . We think of this as (1 → 3 → 2 ) . The permutation π could also be written as 3 2 1 or 2 1 3 in cycle notation. In general, if a1 , a2 , . . . , ar are distinct elements of {1, 2, 3, . . . , n}, the permutation π ∈ Sn , defined by π(a1 ) = a2 ,
π(a2 ) = a3 , . . . , π(ar−1 ) = ar ,
π(ar ) = a1
and π(x) = x if x ∈ / {a1 , a2 , . . . , ar }, is called a cycle of length r or an r-cycle. We denote it by (a1 a2 · · · ar ). Note that the value of n does not appear in the cycle notation. 1 2 3 4 = 1 3 4 2 , is a 4-cycle in S4 , For example, 3 1 4 2 1 2 3 4 5 6 = 1 3 4 2 is a 4-cycle in S6 , and whereas 3 1 4 2 5 6 1 2 3 4 5 6 = 2 5 4 , is a 3-cycle in S6 . 1 5 3 2 4 6 Proposition 3.25. An r-cycle in Sn has order r. Proof. If π = (a1 a2 · · · ar ) is an r-cycle in Sn , then π(a1 ) = a2 , π 2 (a1 ) = a3 , π 3 (a1 ) = a4 , . . . and π r (a1 ) = a1 . Similarly, π r (ai ) = ai for i = 1, 2, . . . , r.
PERMUTATION GROUPS
65
Since π r fixes all the other elements, it is the identity permutation. But none of the permutations π, π 2 , . . . , π r−1 equal the identity permutation because they all move the element a1 . Hence the order of π is r. 1 3 4 2 1 3 Example 3.26. Write down π = , ρ = , and σ = Ž Ž Ž 3 4 as permutations in S4 . Calculate π ρ σ . 1 2 Solution.
4 2 =
1 3
1 2
Ž
3 4 =
1 3
2 3 4 1 4 2
1 2
2 3 4 1 4 3
,
1 3 =
1 2 3 3 2 1
4 4
,
.
We can either calculate a product of cycles from the permutation representation or we can use the cycle representation directly. Let us calculate π Ž ρ Ž σ from their cycles. Remember that a cycle in S4 is a bijection from {1, 2, 3, 4} to itself, and a product of cycles is a composition of functions. In calculating such a composition, we begin at the right and work our way left. Consider the effect of π Ž ρ Ž σ on each of the elements 1, 2, 3, and 4. π Žρ Žσ = 1 3 4 2 Ž 1 3 Ž 1 2 Ž 3 4 1 ←−−−−−−−
2
←−
2 ←−
1 ←− 1
4 ←−−−−−−−
3
←−
1 ←−
2 ←− 2
2 ←−−−−−−−
4
←−
4 ←−
4 ←− 3
3 ←−−−−−−−
1
←−
3 ←−
3 ←− 4
3 4 1 2 For example, 2 is left unchanged by ; then 2 is sent to 1 under , 1 is sent to 3 under 1 3 , and finally, 3 is sent to 4 under 1 3 4 2 . Ž Ž Hence π Ž ρ Ž σ sends 2 to 4. The permutation π ρ σ also sends 4 to 3, 3 to 2, Ž Ž and fixes 1. Therefore, π ρ σ = 2 4 3 . Permutations that are not cycles can be split up into two or more cycles as follows. If π is a permutation in Sn and a ∈ {1, 2, 3, . . . , n}, the orbit of a under π consists of the distinct elements a, π(a), π 2 (a), π 3 (a), . . .. We can split a permutation up into its different orbits, to a cycle. and each orbit will give rise 1 2 3 4 5 6 7 8 ∈ S8 . Here Consider the permutation π = 3 2 8 1 5 7 6 4 π(1) = 3, π 2 (1) = π(3) = 8, π 3 (1) = 4, and π 4 (1) = 1; thus the orbit of 1 is {1, 3, 8, 4}. This is also the orbit of 3, 4, and 8. This orbit gives rise to the cycle 1 3 8 4 . Since π leaves 2 and 5 fixed, their orbits are {2} and {5}. The orbit of 6 and 7 is {6, 7}, which gives rise to the 2-cycle 6 7 . We can picture the orbits and their corresponding cycles as in Figure 3.8.
66
3 GROUPS 1 4
3 8
Figure 3.8.
2
5
6 7
Disjoint cycle decomposition.
It can be verified that π = 1 3 8 4 Ž (2) Ž (5) Ž 6 7 . Since no number is in two different cycles, these cycles are called disjoint. If a permutation is written as a product of disjoint cycles, it does not matter in which order we write the cycles. We could write π = (5) Ž 6 7 Ž (2) Ž 1 3 8 4 . When writing down of cycles, we often omit the 1-cycles and write a product π = 1 3 8 4 Ž 6 7 . The identity permutation is usually just written as (1). Proposition 3.27. Every permutation can be written as a product of disjoint cycles. Proof. Let π be a permutation and let γ1 , . . . , γk be the cycles obtained as described above from the orbits of π. Let a1 be any number in the domain of π, and let π(a1 ) = a2 . If γi is the cycle containing a1 , we can write γi = (a1 a2 · · · ar ); the other cycles will not contain any of the elements a1 , a2 , . . . , ar and hence will leave them all fixed. Therefore, the product γ1 Ž γ2 Ž · · · Ž γk will map a1 to a2 , because the only cycle to move a1 or a2 is γi . Hence π = γ1 Ž γ2 Ž · · · Ž γk , because they both have the same effect on all the numbers in the domain of π. Corollary 3.28. The order of a permutation is the least common multiple of the lengths of its disjoint cycles. Proof. If π is written in terms of disjoint cycles as γ1 Ž γ2 Ž · · · Ž γk , the order of the cycles can be changed because they are disjoint. Therefore, for any integer m, γ m = γ1m Ž γ2m Ž · · · Ž γkm . Because the cycles are disjoint, this is the identity if and only if γim is the identity for each i. The least such integer is the least common multiple of the orders of the cycles. Example 3.29. Find the order of the permutation 1 2 3 4 5 6 7 8 . π= 3 5 8 7 1 4 6 2 Solution. We can write this permutation in terms of disjoint cycles as π= 1 3 8 2 5 Ž 4 7 6 . Hence the order of π is lcm (5, 3) = 15. Of course, we could calculate π 2 , π 3 , π 4 , . . . until we obtained the identity, but this would take much longer.
EVEN AND ODD PERMUTATIONS 1
2
1
3
1 2 3 = (1) = e 123
2
1
3
2
1 2 3 = (1 2 3) = g 231
1
2
67
1
3
1 2 3 = (2 3) = h 132
Figure 3.9.
2
3
1 2 3 = (1 3 2) = g 2 312 1
3
2
1 2 3 = (1 2) = gh 213
3
1 2 3 = (1 3) = g 2h 321
Symmetries of an equilateral triangle.
TABLE 3.7. Group S3 Ž
(1)
(123)
(132)
(23)
(12)
(13)
(1) (123) (132) (23) (12) (13)
(1) (123) (132) (23) (12) (13)
(123) (132) (1) (13) (23) (12)
(132) (1) (123) (12) (13) (23)
(23) (12) (13) (1) (123) (132)
(12) (13) (23) (132) (1) (123)
(13) (23) (12) (123) (132) (1)
Example 3.30. Show that D3 is isomorphic to S3 and write out the table for the latter group. Solution. D3 is the group of symmetries of an equilateral triangle, and any symmetry induces a permutation of the vertices. This defines a function f : D3 → S3 . If σ, τ ∈ D3 , then f (σ Ž τ ) is the induced permutation on the vertices, which is the same as f (σ ) Ž f (τ ). Hence f is a morphism. Figure 3.9 illustrates the six elements of D3 and their corresponding permutations. We shade the underside of the triangle and mark the corner near vertex 1 to illustrate how the triangle moves. To visualize this, imagine a triangular jigsaw puzzle piece and consider all possible ways of fitting this piece into a triangular hole. Any proper rotation will leave the white side uppermost, whereas an improper rotation will leave the shaded side uppermost. The six permutations are all distinct; thus f is a bijection and an isomorphism between D3 and S3 . The group table for S3 is given in Table 3.7. EVEN AND ODD PERMUTATIONS We are going to show that every permutation can be given a parity, even or odd. The definition derives from an action of each permutation σ in Sn on a
68
3 GROUPS
polynomial f (x1 , x2 , . . . , xn ) in n variables by permuting the variables: σf (x1 , x2 , . . . , xn ) = f (xσ 1 , xσ 2 , . . . , xσ n ). For example, if σ = 1 2 3 in S4 and f (x1 , x2 , x3 , x4 ) = 2x1 x4 − 3x22 + x2 x33 , then σf = 2x2 x4 − 3x32 + x3 x13 . Our use of this action involves a particular polynomial D = D(x1 , x2 , . . . , xn ) called the discriminant, defined to be the product of all terms (xi − xj ), where i < j . More formally,
D= (xi − xj ). 0i<j n
For example, if n = 3, then D = (x1 − x2 )(x1 − x3 )(x2 − x3 ). Given a permutation σ ∈ Sn , we have
(xσ i − xσj ). σD = 0i<j n
Thus if n = 3 and σ = (12) ∈ S3 , then σ D = (x2 − x1 )(x2 − x3 )(x1 − x3 ) = −D. In fact, σ D = ±D for every σ ∈ Sn , and we say that σ is even if σ D = D
and
σ is odd if σ D = −D.
We are going to determine an easy method for deciding which is the case. A 2cycle is called a transposition, and surprisingly, much of the discussion centers around determining the parity of these transpositions. We are going to show that every transposition is odd. Let D denote the discriminant in n variables x1 , x2 , . . . , xn , and define Dk/m = the product of all terms in D involving xk , except (xk − xm ) Dk,m = the product of all terms in D involving neither xk nor xm . For example, if n = 5, we have D2/4 = (x1 − x2 )(x2 − x3 )(x2 − x5 ) D4/2 = (x1 − x4 )(x3 − x4 )(x4 − x5 ) D2,4 = (x1 − x3 )(x1 − x5 )(x3 − x5 ). Then D factors as follows: D = (xk − xm )Dk/m Dm/k Dk,m . Now fix a transposition τ = (k m) in Sn , where k < m. Since τ interchanges k and m, we see that τ Dk/m = uDm/k
where u = 1 or u = −1.
EVEN AND ODD PERMUTATIONS
69
Since τ 2 is the identity permutation, we have Dk/m = τ 2 Dk/m = τ (τ Dk/m ) = τ (uDm/k ) = u(τ Dm/k ). Because u2 = 1, it follows that τ Dm/k = uDk/m . Since τ Dk,m = Dk,m , applying τ to D gives τ D = τ (xk − xm ) · τ Dk/m · τ Dm/k · τ Dk,m = (xm − xk ) · uDm/k · uDk/m · Dk,m = −D because u2 = 1. Hence τ is odd, and we have proved: Proposition 3.31. Every transposition is odd. With this we can determine the parity of an arbitrary permutation σ in Sn . The idea is to factor σ as a product of transpositions, and we begin with the cycles. The proof of the next result is a straightforward verification. Proposition 3.32. Every r-cycle is a product of r − 1 transpositions (not necessarily disjoint); in fact,
a1
a2
· · · ar = a1
a2
Ž
a2
a3
Ž
···
Ž
ar−1
ar .
Since every permutation σ is a product of disjoint cycles by Proposition 3.27, it follows that σ is a product of transpositions. This gives us the desired parity test. Theorem 3.33. Parity Theorem. Every permutation σ ∈ Sn is a product of transpositions. Moreover, if σ is a product of m transpositions in any way at all, the parity of σ equals the parity of m. That is, σ is even if m is even, and σ is odd if m is odd. Proof. Write σ = τ1 τ2 · · · τm , where the τi are transpositions. If D is the discriminant in n variables, then τi D = −D for each i by Proposition 3.31. Hence the effect of σ = τ1 τ2 · · · τm on D is to change the sign m times. Thus σ D = (−1)m D, and the result follows. The following result is now a consequence of Proposition 3.32. Corollary 3.34. An n-cycle is an even permutation if n is odd and an odd permutation if n is even.
70
3 GROUPS
Example 3.35. Write the permutation π=
1 2 3 4 1 8
4 5 6 2 7 3
7 8 6 5
as a product of disjoint cycles and determine its order and parity. Solution. As disjoint cycles π = 1 4 2 Ž 3 8 5 7 6 . Hence the order of π is lcm (3, 5) = 15. The parity of the 3-cycle 1 4 2 is even, and the parity of the 5-cycle 3 8 5 7 6 is even; therefore, the parity of π is (even ) Ž (even ) = even. Denote the set of even permutations on n elements by An . It follows from Theorem 3.33 that An is a subgroup of Sn , called the alternating group on n elements. For example, A4 =
(1),
(1 2) Ž (3 4), (1 3) Ž (2 4), (1 4) Ž (2 3),
(1 2 3), (1 3 2),
(1 2 4), (1 4 2),
(1 3 4), (1 4 3),
(2 3 4), , (2 4 3),
a group of 12 elements. In fact, we have Theorem 3.36. |An | = 12 n! for every n 2. Proof. Let On denote the set of odd permutations in Sn , so that Sn = An ∪ On and An ∩ On = Ø. Hence n! = |Sn | = |An | + |On |, so it suffices to show that |An | = |On |. We do this by finding a bijection f : An → On . To this end, write τ = 1 2 and define f by f (σ ) = τ Ž σ for all σ in An (τ Ž σ is odd because σ is even and τ is odd). Then f is injective because f (σ ) = f (σ1 ) implies that τ Ž σ = τ Ž σ1 , so σ = σ1 by cancellation in Sn . To see that f is surjective, let λ ∈ On . Then τ Ž λ ∈ An and f (τ Ž λ) = τ Ž (τ Ž λ) = λ because τ Ž τ = ε. Thus f is surjective, as required. Proposition 3.37. Every even permutation can be written as a product of 3-cycles (not necessarily disjoint). Proof. By Theorem 3.33, an even permutation can be written as a product of an even number of transpositions. We show that any product of two transpositions is a product of 3-cycles. If these two transpositions are identical, their product is the identity. If the two transpositions have one element in common, say (ab) and (bc), their product (ab) Ž (bc) = (abc), a 3-cycle. If the two transpositions have no elements in common, say (ab) and (cd ), we can write their product as (ab) Ž (cd) = (ab) Ž (bc) Ž (bc) Ž (cd) = (abc) Ž (bcd), a product of two 3-cycles.
EXERCISES
71
Theorem 3.33 and Proposition 3.37 show, respectively, that Sn is generated by the 2-cycles and An is generated by the 3-cycles. CAYLEY’S REPRESENTATION THEOREM At the beginning of the nineteenth century, groups appeared only in a very concrete form, such as symmetry groups or permutation groups. Arthur Cayley (1821–1895) was the first mathematician to deal with groups abstractly in terms of axioms, but he showed that any abstract group can be considered as a subgroup of a symmetric group. Hence, in some sense, if you know all about symmetry groups and permutation groups, you know all about group theory. This result is analogous to Stone’s representation theorem for boolean algebras, which proves that any abstract boolean algebra can be considered as an algebra of subsets of a set. Theorem 3.38. Cayley’s Theorem. Every group (G, ·) is isomorphic to a subgroup of its symmetric group (S(G), Ž ). Proof. For each element g ∈ G, define πg : G → G by πg (x) = g · x. We show that πg is a bijection. It is surjective because, for any y ∈ G, πg (g −1 · y) = g · (g −1 · y) = y. It is injective because πg (x) = πg (y) implies that g · x = g · y, and so, by Proposition 3.7, x = y. Hence πg ∈ S(G). Let H = {πg ∈ S(G)|g ∈ G}. We show that (H, Ž ) is a subgroup of (S(G), Ž ) isomorphic to (G, ·). In fact, we show that the function ψ: G → H by ψ(g) = πg is a group isomorphism. This is clearly surjective. It is also injective because ψ(g) = ψ(h) implies that πg = πh , and πg (e) = πh (e) implies that g = h. It remains to show that ψ preserves the group operation. If g, h ∈ G, πg·h (x) = (g · h)(x) = g · (h · x) = πg (h · x) = (πg Ž πh )(x) and πg·h = πg Ž πh . Also, πh−1 Ž πh = πh−1 ·h = πe ; thus (πh )−1 = πh−1 ∈ H . Hence H is a subgroup of S(G), and ψ(g · h) = ψ(g) Ž ψ(h). Corollary 3.39. If G is a finite group of order n, then G is isomorphic to a subgroup of Sn . Proof. This follows because S(G) is isomorphic to Sn .
This is not of very much practical value, however, because Sn has order n!, which is much larger than the order of G, in general.
EXERCISES Construct tables for the groups designated in Exercises 3.1 to 3.4. 3.1. C5 . 3.3. (P (X), ), where X = {a, b, c}.
3.2 D4 . 3.4 A4 .
72
3 GROUPS
For Exercises 3.5 to 3.16, state which are groups and which are abelian groups. Give reasons for your answers. 3.5. (Mn (R), +). 3.6. ({1, 2, 3, 4, 6, 12}, gcd). √ 3.7. ({a + b 2|a, b ∈ Q}, +). 3.8. ({a/b ∈ Q|a, b ∈ Z, b odd}, +). 3.10. ({z ∈ C||z| = 1}, ·). 3.9. ({z ∈ C||z| = 1}, +). −1 0 1 0 −1 0 1 0 ,· . , , , 3.11. 0 −1 0 −1 0 1 0 1 3.12. (Mn (R) − {0}, ·), where 0 is the n × n zero matrix. 3.13. ({1, ζ, ζ 2 , ζ 3 , . . . , ζ n−1 }, ·), where ζ is a complex nth root of 1. 3.14. ({e, a}, ), where e e = e and e a = a e = a a = a. 3.15. (R∗ , ∼), where R∗ = R − {0} and x ∼ y is xy if x > 0, and x/y if x < 0. 3.16. (Z, ), where m n is m + n if m is even, and m − n if m is odd. 3.17. Prove that in any group (G, ·), (a1 · · · an )−1 = an−1 · · · a1−1 . 3.18. If k is an integer (positive or negative), prove that (a −1 ba)k = a −1 bk a in any group (G, ·). 3.19. If G is a group in which a 2 = e, the identity for all a ∈ G, show that G is abelian. 3.20. Prove that G is abelian if and only if (ab)2 = a 2 b2 for all a, b ∈ G. 3.21. If a is not the identity in a group and a 4 b = ba 5 , prove that ab = ba. 3.22. Prove that the order of the element g −1 is the same as the order of g. 3.23. Prove that the order of the element ab is the same as the order of ba. 3.24. Prove that every image of a cyclic group is cyclic. 3.25. The gaussian integers comprise the set of complex numbers Z[i] = {a + ib|a, b ∈ Z}. Is the group (Z[i], +) a cyclic group? For Exercises 3.26 to 3.33, describe the symmetry groups of the figures. 3.26.
3.27.
3.28.
3.29.
3.30.
3.31.
3.32.
3.33.
For Exercises 3.34 and 3.35, describe the symmetry groups of the frieze patterns. These patterns are repeated indefinitely in both directions. 3.34.
3.35.
3.36. Prove that the relation of being a subgroup is a partial order on the set of subgroups of a group G. 3.37. Draw the poset diagram of the subgroups of C6 . 3.38. Draw the poset diagram of the subgroups of S3 .
EXERCISES
73
3.39. If H and K are subgroups of a group G, prove that H ∩ K is also a subgroup of G. Is H ∪ K necessarily a subgroup of G? 3.40. If f : G → H and g: H → K are group morphisms, show that g Ž f : G → K is also a group morphism. 3.41. Find all the group morphisms from (Z, +) to (Q, +). 3.42. Show that the set {f1 , f2 , f3 , f4 , f5 , f6 } of functions R − {0, 1} → R − {0, 1} under composition is isomorphic to S3 , where f1 (x) = x,
f2 (x) = 1 − x, f5 (x) =
3.43. 3.44. 3.45. 3.46. 3.47.
3.48.
3.49.
3.50. 3.51. 3.52. 3.53. 3.54.
1 , 1−x
1 1 , f4 (x) = 1 − , x x x f6 (x) = . x−1 f3 (x) =
Is (Z, +) isomorphic to (Q∗ , ·), where Q∗ = Q − {0}? Give reasons. Is (R, +) isomorphic to (R+ , ·), where R+ = {x ∈ R|x > 0}? Give reasons. Find the orders of all the elements in A4 . Is A4 ∼ = D6 ? Give reasons. Draw the table and find the order of all the elements in the group ({±1, ±i, ±j, ±k}, ·), where i 2 = j 2 = k 2 = −1, ij = k = −j i, j k = i = −kj , and ki = j = −ik. This is called the quaternion group Q oforder 8. 0 1 0 1 and Let G be the group generated by the matrices 1 0 −1 0 under matrix multiplication. Show that G is a non-abelian group of order 8. Is it isomorphic to D4 or the quaternion group Q? 0 1 Show that Dk is isomorphic to the group generated by 1 0 ζ 0 and under matrix multiplication, where ζ = exp(2πi/k), a 0 ζ −1 complex kth root of unity. Construct the table for the group generated by g and h, where g and h satisfy the relations g 3 = h2 = e and gh = hg 2 . Prove that a group of even order always has at least one element of order 2. Find a subgroup of S7 of order 10. Find a subgroup of S5 of order 3. Find a subgroup of A4 isomorphic to the Klein 4-group.
Multiply out the permutations in Exercises 3.55 to 3.58. 1 2 3 4 Ž 1 2 3 4 . 3.55. 2 4 3 1 4 3 2 1 3 1 2 3 4 5 6 3.56. . 4 5 2 6 3 1 3.57. 1 2 3 4 5 Ž 2 3 4 . 3.58. 3 6 2 Ž 1 5 Ž 4 2 .
74
3 GROUPS
For Exercises 3.59 to 3.62, write the permutations as a product of disjoint cycles. Find the order of each permutation and state whether the permutation is even or odd. 1 2 3 4 5 6 7 1 2 3 4 5 6 . . 3.60. 3.59. 2 4 6 1 5 7 3 6 1 2 3 4 5 1 2 3 4 5 6 . 3.61. 5 6 4 3 2 1 1 2 3 4 5 6 7 8 9 . 3.62. 8 9 4 2 7 3 5 1 6 Find the permutations for Exercises 3.63 to 3.66. −1 −1 1 2 3 4 5 1 2 3 4 5 6 3.63. . 3.64. . 5 1 2 3 4 2 1 6 5 3 4 −2 −1 . 3.66. 1 2 4 6 5 7 . 3.65. 1 2 3 For each polynomial in Exercises 3.67 to 3.69, find the permutations of the subscripts that leave the value of the polynomial unchanged. These will form subgroups of S4 , called the symmetry groups of the polynomials. 3.67. (x1 + x2 )(x3 + x4 ). 3.68. (x1 − x2 )(x3 − x4 ). 2 2 3.69. (x1 − x2 ) + (x2 − x3 ) + (x3 − x4 )2 + (x4 − x1 )2 . 3.70. Describe the group of proper rotations of the tetrahedron with vertices (0, 0, 0), (1, 0, 0), (0, 1, 0), and (0, 0, 1) in R3 . 3.71. Write G = {1, −1}, a multiplicative subgroup of R+ , and define 1 if σ is even . Prove that f is an onto f : Sn → G by f (σ ) = −1 if σ is odd group morphism. 3.72. If g and h are elements in a group G, show that g and h−1 gh have the same order. 3.73. What is the number of generators of the cyclic group Cn ? 3.74. Express (123) Ž (456) as the power of a single cycle in S6 . Can you generalize this result? 3.75. A is the permutation perfect interlacing shuffle of a deck of 2n cards 1 2 3 ··· n n + 1 n + 2 ··· 2n . What is the least 2 4 6 · · · 2n 1 3 · · · 2n − 1 number of perfect shuffles that have to be performed on a deck of 52 cards before the cards are back in their original position? If there were 50 cards, what would be the least number? 3.76. The center of a group G is the set Z(G) = {x ∈ G|xg = gx for all g ∈ G}. Show that Z(G) is an abelian subgroup of G. 3.77. Find the center of D3 . 3.78. Find the center of D4 . 3.79. Prove that Sn is generated by the elements (12), (23), (34), . . . , (n − 1 n).
EXERCISES
75
3.80. Prove that Sn is generated by the elements (123 · · · n) and (12). 3.81. Prove that An is generated by the set {(12r)|r = 3, 4, . . . , n}. 3.82. The well-known 15-puzzle consists of a shallow box filled with 16 small squares in a 4 × 4 array. The bottom right corner square is removed, and the other squares are labeled as in Figure 3.10. By sliding the squares around (without lifting them up), show that the set of possible permutations that can be obtained with the bottom right square blank is precisely A15 . (There is no known easy proof that all elements in A15 must occur.)
1 5 9 13
2 6 10 14
3 4 7 8 11 12 15
Initial position
4 5 12 13
3 6 11 14
2 1 7 8 10 9 15
(1)
Figure 3.10.
10 11 12 13
9 2 3 14
8 7 1 6 4 5 15
(2)
8 14 11 3 12 2 15 9 6 4 13 1 7 10 5 (3)
The 15-puzzle.
3.83. Which of the positions of the 15-puzzle shown in Figure 3.10 can be achieved? 3.84. An automorphism of a group G is an isomorphism from G to itself. Prove that the set of all automorphisms of G forms a group under composition. 3.85. Find the automorphism group of the Klein 4-group. 3.86. Find the automorphism group of C3 . 3.87. Find the automorphism group of C4 . 3.88. Find the automorphism group of S3 . 3.89. A word on {x, y} is a finite string of the symbols x, x −1 , y, y −1 , where x and x −1 cannot be adjacent and y and y −1 cannot be adjacent; for example, xxy −1 x and x −1 x −1 yxy are words. Let F be the set of such words together with the empty word, which is denoted by 1. The operation of concatenation places one word after another. Show that F is a group under concatenation, where any strings of the form xx −1 , x −1 x, yy −1 , y −1 y are deleted in a concatenated word. F is called the free group on two generators. Is F abelian? What is the inverse of x −1 x −1 yxy?
4 QUOTIENT GROUPS
Certain techniques are fundamental to the study of algebra. One such technique is the construction of the quotient set of an algebraic object by means of an equivalence relation on the underlying set. For example, if the object is the group of integers (Z, +), the congruence relation modulo n on Z will define the quotient group of integers modulo n. This quotient construction can be applied to numerous algebraic structures, including groups, boolean algebras, and vector spaces. In this chapter we introduce the concept of an equivalence relation and go on to apply this to groups. We obtain Lagrange’s theorem, which states that the order of a subgroup divides the order of the group, and we also obtain the morphism theorem for groups. We study the implications of these two theorems and classify the groups of low order.
EQUIVALENCE RELATIONS Relations are one of the basic building blocks of mathematics (as well as of the rest of the world). A relation R from a set S to a set T is a subset of S × T . We say that a is related to b under R if the pair (a, b) belongs to the subset, and we write this as aRb. If (a, b) does not belong to the subset, we say that a is not related to b, and write aRb. This definition even covers many relations in everyday life, such as “is the father of,” “is richer than,” and “goes to the same school as” as well as mathematical relations such as “is equal to,” “is a member of,” and “is similar to.” A relation R from Sto T has the property that for any elements a in S, and b in T , either aRb or aRb. Any function f : S → T gives rise to a relation R from S to T by taking aRb to mean f (a) = b. The subset R of S × T is the graph of the function. However, relations are much more general than functions. One element can be related to many elements or to no elements at all. Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 76
EQUIVALENCE RELATIONS
77
A relation from a set S to itself is called a relation on S. Any partial order on a set, such as “” on the real numbers, or “is a subset of” on a power set P (X), is a relation on that set. “Equals” is a relation on any set S and is defined by the subset {(a, a)|a ∈ S} of S × S. An equivalence relation is a relation that has the most important properties of the “equals” relation. A relation E on a set S is called an equivalence relation if the following conditions hold. (i) aEa for all a ∈ S. (ii) If aEb, then bEa. (iii) If aEb and bEc, then aEc.
(reflexive condition) (symmetric condition) (transitive condition)
If E is an equivalence relation on S and a ∈ S, then [a] = {x ∈ S|xEa} is called the equivalence class containing a. The set of all equivalence classes is called the quotient set of S by E and is denoted by S/E. Hence S/E = {[a]|a ∈ S}. Proposition 4.1. If E is an equivalence relation on a set S, then (i) If aEb, then [a] = [b]. (ii) If aEb, then [a] ∩ [b] = Ø. (iii) S is the disjoint union of all the distinct equivalence classes. Proof. (i) If aEb, let x be any element of [a]. Then xEa and so xEb by transitivity. Hence x ∈ [b] and [a] ⊆ [b]. The symmetry of E implies that bEa, and an argument similar to the above shows that [b] ⊆ [a]. This proves that [a] = [b]. (ii) Suppose that aEb. If there was an element x ∈ [a] ∩ [b], then xEa, xEb, so aEb by symmetry and transitivity. Hence [a] ∩ [b] = Ø. (iii) Parts (i) and (ii) show that two equivalence classes are either the same or disjoint. The reflexivity of E implies that each element a ∈ S is in the equivalence class [a]. Hence S is the disjoint union of all the equivalence classes. A collection of nonempty subsets is said to partition a set S if the union of the subsets is S and any two subsets are disjoint. The previous proposition shows that any equivalence relation partitions the set into its equivalence classes. Each element of the set belongs to one and only one equivalence class. It can also be shown that every partition of a set gives rise to an equivalence relation whose classes are precisely the subsets in the partition. Example 4.2. Let n be a fixed positive integer and a and b any two integers. We say that a is congruent to b modulo n if n divides a − b. We denote this by a ≡ b mod n.
78
4 QUOTIENT GROUPS
Show that this congruence relation modulo n is an equivalence relation on Z. The set of equivalence classes is called the set of integers modulo n and is denoted by Zn . Solution. Write “n|m” for “n divides m,” which means that there is some integer k such that m = nk. Hence a ≡ b mod n if and only if n|(a − b). (i) For all a ∈ Z, n|(a − a), so a ≡ a mod n and the relation is reflexive. (ii) If a ≡ b mod n, then n|(a − b), so n| − (a − b). Hence n|(b − a) and b ≡ a mod n. (iii) If a ≡ b mod n and b ≡ c mod n, then n|(a − b) and n|(b − c), so n|(a − b) + (b − c). Therefore, n|(a − c) and a ≡ c mod n. Hence congruence modulo n is an equivalence relation on Z.
In the congruence relation modulo 3, we have the following equivalence classes: [0] = {. . . , −3, 0, 3, 6, 9, . . .} [1] = {. . . , −2, 1, 4, 7, 10, . . .} [2] = {. . . , −1, 2, 5, 8, 11, . . .} [3] = {. . . , 0, 3, 6, 9, 12, . . .} = [0] Any equivalence class must be one of [0], [1], or [2], so Z3 = {[0], [1], [2]}. In general, Zn = {[0], [1], [2], . . . , [n − 1]}, since any integer is congruent modulo n to its remainder when divided by n. One set of equivalence classes that is introduced in elementary school is the set of rational numbers. Students soon become used to the fact that 12 and 36 represent the same rational number. We need to use the concept of equivalence class to define a rational number precisely. Define the relation E on Z × Z∗ (where Z∗ = Z − {0}) by (a, b) E (c, d) if and only if ad = bc. This is an equivalence relation on Z × Z∗ , and the equivalence classes are called rational numbers. We denote the equivalence class [(a, b)] by ab . Therefore, since (1, 2) E(3, 6), it follows that 12 = 36 . Two series-parallel circuits involving the switches A1 , A2 , . . . , An are said to be equivalent if they both are open or both are closed for any position of the n n switches. This is an equivalence relation, and the equivalence classes are the 22 distinct types of circuits controlled by n switches. Any permutation π on a set S induces an equivalence relation, ∼, on S where a ∼ b if and only if b = π r (a), for some r ∈ Z. The equivalence classes are the orbits of π. In the decomposition of the permutation π into disjoint cycles, the elements in each cycle constitute one orbit. COSETS AND LAGRANGE’S THEOREM The congruence relation modulo n on Z can be defined by a ≡ b mod n if and only if a − b ∈ nZ, where nZ is the subgroup of Z consisting of all multiples
COSETS AND LAGRANGE’S THEOREM
79
of n. We now generalize this notion and define congruence in any group modulo one of its subgroups. We are interested in the equivalence classes, which we call cosets. Let (G, ·) be a group with subgroup H . For a, b ∈ G, we say that a is congruent to b modulo H , and write a ≡ b mod H if and only if ab−1 ∈ H . Proposition 4.3. The relation a ≡ b mod H is an equivalence relation on G. The equivalence class containing a can be written in the form H a = {ha|h ∈ H }, and it is called a right coset of H in G. The element a is called a representative of the coset Ha. Proof. (i) For all a ∈ G, aa −1 = e ∈ H ; thus the relation is reflexive. (ii) If a ≡ b mod H , then ab−1 ∈ H ; thus ba −1 = (ab−1 )−1 ∈ H . Hence b ≡ a mod H , and the relation is symmetric. (iii) If a ≡ b and b ≡ c mod H , then ab−1 and bc−1 ∈ H . Hence ac1 = (ab−1 )(bc−1 ) ∈ H and a ≡ c mod H . The relation is transitive. Hence ≡ is an equivalence relation. The equivalence class containing a is {x ∈ G|x ≡ a mod H } = {x ∈ G|xa −1 = h ∈ H } = {x ∈ G|x = ha, where h ∈ H } = {ha|h ∈ H }, which we denote by Ha.
Example 4.4. Find the right cosets of A3 in S3 . Solution. One coset is the subgroup itself A3 = {(1), (123), (132)}. Take any element not in the subgroup, say (12). Then another coset is A3 (12) = {(12), (123) Ž (12), (132) Ž (12)} = {(12), (13), (23)}. Since the right cosets form a partition of S3 and the two cosets above contain all the elements of S3 , it follows that these are the only two cosets. In fact, A3 = A3 (123) = A3 (132) and A3 (12) = A3 (13) = A3 (23). Example 4.5. Find the right cosets of H = {e, g 4 , g 8 } in C12 = {e, g, g 2 , . . . , g 11 }. Solution. H itself is one coset. Another is Hg = {g, g 5 , g 9 }. These two cosets have not exhausted all the elements of C12 , so pick an element, say g 2 , which is not in H or Hg. A third coset is Hg 2 = {g 2 , g 6 , g 10 } and a fourth is Hg 3 = {g 3 , g 7 , g 11 }. Since C12 = H ∪ Hg ∪ Hg 2 ∪ Hg 3 , these are all the cosets. As the examples above suggest, every coset contains the same number of elements. We use this result to prove the famous theorem of Joseph Lagrange (1736–1813).
80
4 QUOTIENT GROUPS
Lemma 4.6. There is a bijection between any two right cosets of H in G. Proof. Let Ha be a right coset of H in G. We produce a bijection between Ha and H , from which it follows that there is a bijection between any two right cosets. Define ψ: H → H a by ψ(h) = ha. Then ψ is clearly surjective. Now suppose that ψ(h1 ) = ψ(h2 ), so that h1 a = h2 a. Multiplying each side by a −1 on the right, we obtain h1 = h2 . Hence ψ is a bijection. Theorem 4.7. Lagrange’s Theorem. If G is a finite group and H is a subgroup of G, then |H | divides |G|. Proof. The right cosets of H in G form a partition of G, so G can be written as a disjoint union G = H a1 ∪ H a2 ∪ · · · ∪ H ak for a finite set of elements a1 , a2 , . . . , ak ∈ G. By Lemma 4.6, the number of elements in each coset is |H |. Hence, counting all the elements in the disjoint union above, we see that |G| = k|H |. Therefore, |H | divides |G|. If H is a subgroup of G, the number of distinct right cosets of H in G is called the index of H in G and is written |G : H |. The following is a direct consequence of the proof of Lagrange’s theorem. Corollary 4.8. If G is a finite group with subgroup H , then |G : H | = |G|/|H |. Corollary 4.9. If a is an element of a finite group G, then the order of a divides the order of G. Proof. Let H = {a r |r ∈ Z} be the cyclic subgroup generated by a. By Proposition 3.13, the order of the subgroup H is the same as the order of the element a. Hence, by Lagrange’s theorem, the order of a divides the order of G. Corollary 4.10. If a is an element of the finite group G, then a |G| = e. Proof. If m is the order of a, then |G| = mk for some integer k. Hence a |G| = a = (a m )k = ek = e. mk
Corollary 4.11. If G is a group of prime order, then G is cyclic. Proof. Let |G| = p, a prime number. By Corollary 4.9, every element has order 1 or p. But the only element of order 1 is the identity. Therefore, all the
COSETS AND LAGRANGE’S THEOREM
81
other elements have order p, and there is at least one because |G| 2. Hence by Theorem 3.14, G is a cyclic group. The converse of Lagrange’s theorem is false, as the following example shows. That is, if k is a divisor of the order of G, it does not necessarily follow that G has a subgroup of order k. Example 4.12. A4 is a group of order 12 having no subgroup of order 6. Solution. A4 contains one identity element, eight 3-cycles of the form (abc), and three pairs of transpositions of the form (ab) Ž (cd), where a, b, c, and d are distinct elements of {1, 2, 3, 4}. If a subgroup contains a 3-cycle (abc), it must also contain its inverse (acb). If a subgroup of order 6 exists, it must contain the identity and a product of two transpositions, because the odd number of nonidentity elements cannot be made up of 3-cycles and their inverses. A subgroup of order 6 must also contain at least two 3-cycles because A4 only contains four elements that are not 3-cycles. Without loss of generality, suppose that a subgroup of order 6 contains the elements (abc) and (ab) Ž (cd). Then it must also contain the elements (abc)−1 = (acb), (abc) Ž (ab) Ž (cd) = (acd), (ab) Ž (cd) Ž (abc) = (bdc), and (acd)−1 = (adc), which, together with the identity, gives more than six elements. Hence A4 contains no subgroup of order 6. The next proposition strengthens Lagrange’s theorem in the case of finite cyclic groups. The following lemma, of interest in its own right, will be needed. Lemma 4.13. Let g be an element of order n in a group, and let m 1. (i) If gcd(n, m) = d, then g m has order n/d. (ii) In particular, if m divides n, then g m has order n/m. Proof. (i). We have (g m )n/d = (g n )m/d = em/d = e. If (g m )k = e, we must n show that divides k. We have g mk = e, so n divides mk by Proposition 3.11. d m n m n divides k. But and are relatively prime by Theorem 11, Hence d d d d n Appendix 2, so divides k (by the same theorem). d (ii). If m divides n, then gcd(n, m) = m, so (i) implies (ii). Proposition 4.14. If G is a cyclic group of order n, and if k divides n, then G has exactly one subgroup H of order k. In fact, if g generates G, then H is generated by g n/k . Proof. Let H denote the subgroup generated by g n/k . Then |H | = k because n . Now let K be any subgroup of g n/k has order k by Lemma 4.13 with m = k
82
4 QUOTIENT GROUPS
G of order k. By Proposition 3.12, K is generated by g m for some m ∈ Z. Then g m has order |K| = k by Proposition 3.13. But if d = gcd(m, n), then g m also has order n/d by Lemma 4.13. Thus k = n/d, so d = n/k. Write d = xm + yn, x, y ∈ Z (by Theorem 8, Appendix 2). Then g n/k = g d = (g m )x (g n )y = (g m )x ∈ K. Since g n/k generates H , it follows that H ⊆ K, so H = K because |H | = |K|.
NORMAL SUBGROUPS AND QUOTIENT GROUPS Let G be a group with subgroup H . The right cosets of H in G are equivalence classes under the relation a ≡ b mod H , defined by ab−1 ∈ H . We can also define the relation L on G so that aLb if and only if b−1 a ∈ H . This relation, L, is an equivalence relation, and the equivalence class containing a is the left coset aH = {ah|h ∈ H }. As the following example shows, the left coset of an element does not necessarily equal the right coset. Example 4.15. Find the left and right cosets of H = A3 and K = {(1), (12)} in S3 . Solution. We calculated the right cosets of H = A3 in Example 4.4. Right Cosets H = {(1), (123), (132)} H (12) = {(12), (13), (23)}
Left Cosets H = {(1), (123), (132)} (12)H = {(12), (23), (13)}
In this case, the left and right cosets of H are the same. However, the left and right cosets of K are not all the same. Right Cosets K = {(1), (12)} K(13) = {(13), (132)} K(23) = {(23), (123)}
Left Cosets K = {(1), (12)} (13)K = {(13), (123)} (23)K = {(23), (132)}
Since a ≡ b mod H is an equivalence relation for any subgroup H of a group G and the quotient set is the set of right cosets {H a|a ∈ G}, it is natural to ask whether this quotient set is also a group with a multiplication induced by the multiplication in G. We show that this is the case if and only if the right cosets of H equal the left cosets. A subgroup H of a group G is called a normal subgroup of G if g −1 hg ∈ H for all g ∈ G and h ∈ H . Proposition 4.16. Hg = gH , for all g ∈ G, if and only if H is a normal subgroup of G.
NORMAL SUBGROUPS AND QUOTIENT GROUPS
83
Proof. Suppose that Hg = gH . Then, for any element h ∈ H, hg ∈ Hg = gH . Hence hg = gh1 for some h1 ∈ H and g −1 hg = g −1 gh1 = h1 ∈ H . Therefore, H is a normal subgroup. Conversely, if H is normal, let hg ∈ Hg and g −1 hg = h1 ∈ H . Then hg = gh1 ∈ gH and Hg ⊆ gH . Also, ghg −1 = (g −1 )−1 hg −1 = h2 ∈ H , since H is normal, so gh = h2 g ∈ Hg. Hence, gH ⊆ Hg, and so Hg = gH . Therefore, A3 is a normal subgroup of S3 by Example 4.13, whereas {(1), (12)} is not. Proposition 4.17. Any subgroup of an abelian group is normal. Proof. If H is a subgroup of an abelian group, G, then g −1 hg = hg −1 g = h ∈ H for all g ∈ G, h ∈ H . Hence H is normal. If N is a normal subgroup of a group G, the left cosets of N in G are the same as the right cosets of N in G, so there will be no ambiguity in just talking about the cosets of N in G. Theorem 4.18. If N is a normal subgroup of (G, ·), the set of cosets G/N = {Ng|g ∈ G} forms a group (G/N , ·), where the operation is defined by (Ng1 ) · (Ng2 ) = N (g1 · g2 ). This group is called the quotient group or factor group of G by N . Proof. The operation of multiplying two cosets, Ng1 and Ng2 , is defined in terms of particular elements, g1 and g2 , of the cosets. For this operation to make sense, we have to verify that, if we choose different elements, h1 and h2 , in the same cosets, the product coset N (h1 · h2 ) is the same as N (g1 · g2 ). In other words, we have to show that multiplication of cosets is well defined. Since h1 is in the same coset as g1 , we have h1 ≡ g1 mod N . Similarly, h2 ≡ g2 mod N . We show that N h1 h2 = Ng1 g2 . We have h1 g1−1 = n1 ∈ N and h2 g2−1 = n2 ∈ N , so h1 h2 (g1 g2 )−1 = h1 h2 g2−1 g1−1 = n1 g1 n2 g2 g2−1 g1−1 = n1 g1 n2 g1−1 . Now N is a normal subgroup, so g1 n2 g1−1 ∈ N and n1 g1 n2 g1−1 ∈ N . Hence h1 h2 ≡ g1 g2 mod N and N h1 h2 = Ng1 g2 . Therefore, the operation is well defined. The operation is associative because (Ng1 · Ng2 ) · Ng3 = N (g1 g2 ) · Ng3 = N (g1 g2 )g3 and also Ng1 · (Ng2 · Ng3 ) = Ng1 · N (g2 g3 ) = Ng1 (g2 g3 ) = N (g1 g2 )g3 . Since Ng · N e = Nge = Ng and N e · Ng = Ng, the identity is N e = N . The inverse of Ng is Ng −1 because Ng · Ng −1 = N (g · g −1 ) = N e = N and also Ng −1 · Ng = N . Hence (G/N, ·) is a group. The order of G/N is the number of cosets of N in G. Hence |G/N | = |G : N| = |G|/|N |.
84
4 QUOTIENT GROUPS
TABLE 4.1. Quotient Group S3 /A3 Ž
H H (12)
H
H (12)
H H (12)
H (12) H
We have seen in Example 4.15 that A3 is a normal subgroup of S3 ; therefore, S3 /A3 is a quotient group. If H = A3 , the elements of this group are the cosets H and H (12), and its multiplication table is given in Table 4.1. Example 4.19. (Zn , +) is the quotient group of (Z, +) by the subgroup nZ = {nz|z ∈ Z}. Solution. Since (Z, +) is abelian, every subgroup is normal. The set nZ can be verified to be a subgroup, and the relationship a ≡ b mod nZ is equivalent to a − b ∈ nZ and to n|a − b. Hence a ≡ b mod nZ is the same relation as a ≡ b mod n. Therefore, Zn is the quotient group Z/nZ, where the operation on congruence classes is defined by [a] + [b] = [a + b]. (Zn , +) is a cyclic group with 1 as a generator, and therefore, by Theorem 3.25, is isomorphic to Cn . The group (Z5 , +) is shown in Table 4.2. When there is no confusion, we write the elements of Zn as 0, 1, 2, 3, . . . , n − 1 instead of [0], [1], [2], [3], . . . , [n − 1]. Proposition 4.20. If H is a subgroup of index 2 in G, so that |G : H | = 2, then H is a normal subgroup of G, and G/H is cyclic group of order 2. Proof. Since |G : H | = 2, there are only two right cosets of H in G. One must be H and the other can be written as Hg, where g is any element of G that is not in H . To show that H is a normal subgroup of G, we need to show that g −1 hg ∈ H for all g ∈ G and h ∈ H . If g is an element of H , it is clear that / H. g −1 hg ∈ H for all h ∈ H . If g is not an element of H , suppose that g −1 hg ∈ In this case, g −1 hg must be an element of the other right coset Hg, and we can write g −1 hg = h1 g, for some h1 ∈ H . It follows that g = hh−1 1 ∈ H , which contradicts the fact that g ∈ / H . Hence g −1 hg ∈ H for all g ∈ G and h ∈ H ; in other words, H is normal in G. TABLE 4.2. Group (Z5 , +) + [0] [1] [2] [3] [4]
[0] [0] [1] [2] [3] [4]
[1] [1] [2] [3] [4] [0]
[2] [2] [3] [4] [0] [1]
[3] [3] [4] [0] [1] [2]
[4] [4] [0] [1] [2] [3]
NORMAL SUBGROUPS AND QUOTIENT GROUPS
85
Theorem 4.21. If G is a finite abelian group and the prime p divides the order of G, then G contains an element of order p and hence a subgroup of order p. Proof. We prove this result by induction on the order of G. For a particular prime p, suppose that all abelian groups of order less than k, whose order is divisible by p, contain an element of order p. The result is vacuously true for groups of order 1. Now suppose that G is a group of order k. If p divides k, choose any nonidentity element g ∈ G. Let t be the order of the element g. Case 1. If p divides t, say t = pr, then g r is an element of order p. This follows because g r is not the identity, but (g r )p = g t = e, and p is a prime. Case 2. On the other hand, if p does not divide t, let K be the subgroup generated by g. Since G is abelian, K is normal, and the quotient group G/K has order |G|/t, which is divisible by p. Therefore, by the induction hypothesis, G/K has an element of order p, say Kh. If u is the order of h in G, then hu = e and (Kh)u = Khu = K. Since Kh has order p in G/K, u is a multiple of p, and we are back to case 1. The result now follows from the principle of mathematical induction.
This result is a partial converse to Lagrange’s theorem. It is a special case of some important results, in more advanced group theory, known as the Sylow theorems. These theorems give information on the subgroups of prime power order, and they can be found in books such as Herstein [9], Hall [30], or Nicholson [11]. Example 4.22. Show that A5 has no proper normal subgroups. Solution. It follows from Corollary 3.34 that A5 contains three types of nonidentity elements: 3-cycles, 5-cycles, and pairs of disjoint transpositions. Suppose that N is a normal subgroup of A5 that contains more than one element. Case 1. Suppose that N contains the 3-cycle (abc). From the definition of normal subgroup, g −1 Ž (abc) Ž g ∈ N for all g ∈ A5 . If we take g = (ab) Ž (cd), we obtain (ab) Ž (cd) Ž (abc) Ž (ab) Ž (cd) = (adb) ∈ N and also (adb)−1 = (abd) ∈ N . In a similar way, we can show that N contains every 3-cycle. Therefore, by Proposition 3.37, N must be the entire alternating group. Case 2. Suppose that N contains the 5-cycle (abcde). Then and (abc)−1 Ž (abcde) Ž (abc) = (acb) Ž (abcde) Ž (abc) = (abdec) ∈ N (abcde) Ž (abdec)−1 = (abcde) Ž (acedb) = (adc) ∈ N. We are now back to case 1, and hence N = A5 .
86
4 QUOTIENT GROUPS
Case 3. Suppose that N contains the pair of disjoint transpositions (ab) Ž (cd). Then, if e is the element of {1, 2, 3, 4, 5} not appearing in these transpositions, we have (abe)−1 Ž (ab) Ž (cd) Ž (abe) = (aeb) Ž (ab) Ž (cd) Ž (abe) = (ae) Ž (cd) ∈ N. Also, (ab) Ž (cd) Ž (ae) Ž (cd) = (aeb) ∈ N , and again we are back to case 1. We have shown that any normal subgroup of A5 containing more than one element must be A5 itself. A group without any proper normal subgroups is called a simple group. The term simple must be understood in the technical sense that it cannot be broken down, because it cannot have any nontrivial quotient groups. This is analogous to a prime number, which has no nontrivial quotients. Apart from the cyclic groups of prime order, which have no proper subgroups of any kind, simple groups are comparatively rare. The group A5 is of great interest to mathematicians because it is used in Galois theory to show that there is an equation of the fifth degree that cannot be solved by any algebraic formula. It can be shown that every alternating group An , n 5, is simple. The cyclic groups Cp , p a prime, are another infinite series of simple groups (the abelian ones), and other series have been known for decades. But it was not until 1981 that the finite simple groups were completely classified. This was the culmination of more than 30 years of effort by hundreds of mathematicians, yielding thousands of pages of published work, and was one of the great achievements of twentieth-century mathematics. One spectacular landmark came in 1963, when J. G. Thompson and W. Feit verified a long-standing conjecture of W. Burnside (1852–1927) that every finite, non-abelian, simple group has even order (the proof is more than 250 pages long!). The main difficulty in the classification was the existence of sporadic finite simple groups, not belonging to any of the known families. The largest of these, known as the monster, has order approximately 2 × 1053 . The complete classification encompasses several infinite families and exactly 26 sporadic groups. MORPHISM THEOREM The morphism theorem is a basic result of group theory that describes the relationship between morphisms, normal subgroups, and quotient groups. There is an analogous result for most algebraic systems, including rings and vector spaces. If f : G → H is a group morphism, the kernel of f , denoted by Kerf , is defined to be the set of elements of G that are mapped by f to the identity of H . That is, Kerf = {g ∈ G|f (g) = eH }. Proposition 4.23. Let f : G → H be a group morphism. Then: (i) Kerf is a normal subgroup of G. (ii) f is injective if and only if Kerf = {eG }.
MORPHISM THEOREM
87
Proof. (i) We first show that Kerf is a subgroup of G. Let a, b ∈ Kerf so that f (a) = f (b) = eH . Then f (ab) = f (a)f (b) = eH eH = eH , and
−1 f (a −1 ) = f (a)−1 = eH = eH ,
so
so
ab ∈ Kerf a −1 ∈ Kerf.
Therefore, Kerf is a subgroup of G. If a ∈ Kerf and g ∈ G, then f (g −1 ag) = f (g −1 )f (a)f (g) = f (g)−1 eH f (g) = f (g)−1 f (g) = eH . Hence g −1 ag ∈ Kerf , and Kerf is a normal subgroup of G. (ii) If f is injective, only one element maps to the identity of H. Hence Kerf = {eG }. Conversely, if Kerf = {eG }, suppose that f (g1 ) = f (g2 ). Then f (g1 g2−1 ) = f (g1 )f (g2 )−1 = eH so g1 g2−1 ∈ Kerf = {eG }. Hence g1 = g2 , and f is injective. Proposition 4.24. For any group morphism f : G → H , the image of f , Imf = {f (g)|g ∈ G}, is a subgroup of H (although not necessarily normal). Proof. Let f (g1 ), f (g2 ) ∈ Imf . Then eH = f (eG ) ∈ Imf, f (g1 )f (g2 ) = f (g1 g2 ) ∈ Imf , and f (g1 )−1 = f (g1−1 ) ∈ Imf . Hence Imf is a subgroup of H . Theorem 4.25. Morphism Theorem for Groups. Let K be the kernel of the group morphism f : G → H . Then G/K is isomorphic to the image of f , and the isomorphism ψ: G/K → Imf is defined by ψ(Kg) = f (g). This result is also known as the first isomorphism theorem; the second and third isomorphism theorems are given in Exercises 4.43 and 4.44. Proof. The function ψ is defined on a coset by using one particular element in the coset, so we have to check that ψ is well defined; that is, it does not matter which element we use. If Kg = Kg , then g ≡ g mod K so g g −1 = k ∈ K = Kerf . Hence g = kg and so f (g ) = f (kg) = f (k)f (g) = eH f (g) = f (g). Thus ψ is well defined on cosets. The function ψ is a morphism because ψ(Kg1 Kg2 ) = ψ(Kg1 g2 ) = f (g1 g2 ) = f (g1 )f (g2 ) = ψ(Kg1 )ψ(Kg2 ). If ψ(Kg) = eH , then f (g) = eH and g ∈ K. Hence the only element in the kernel of ψ is the identity coset K, and ψ is injective. Finally, Im ψ = Imf ,
88
4 QUOTIENT GROUPS
by the definition of ψ. Therefore, ψ is the required isomorphism between G/K and Imf . Conversely, note that if K is any normal subgroup of G, the map g → Kg is a morphism from G to G/K, whose kernel is precisely K. By taking f to be the identity morphism from G to itself, the morphism theorem implies that G/{e} ∼ = G. The function f : Z → Zn , defined by f (x) = [x], has nZ as its kernel, and therefore the morphism theorem yields the fact that Z/nZ ∼ = Zn . If a and b are generators of the cyclic groups C12 = a and C6 = b, respectively, consider the function f : C12 → C6 given by f (a r ) = b2r . This is well defined. In fact, if a r = a r1 , then 12 divides r − r1 by Proposition 3.11, so certainly b2r = b2r1 . It is easily verified that f is morphism, and the kernel is K = {e, a 3 , a 6 , a 9 } because if a r is in K, then b2r = 0, so 6 divides 2r, whence 3 divides r. Thus C12 /K ∼ = C6 , and this isomorphism is obtained by mapping the coset Ka r to b2r . The alternating group An is of index 2 in the symmetric group Sn (by Theorem 3.36) and so is a normal subgroup by Proposition 4.20. It is instructive to obtain this same conclusion from the morphism theorem. If σ is a permutation in Sn , recall that σ is called even or odd according as σ D = D or σ D = −D, where D is the discriminant in n variables (see the discussion leading to Theorem 3.33). Consider the multiplicative group {1, −1}, and define a 1 if σ D = D function f : Sn → {1, −1} by f (σ ) = . Then f is a surjec−1 if σ D = −D tive morphism (verify) and the kernel is the group An of even permutations. Since |Sn | = n!, the morphism theorem and Corollary 4.8 give the following result (and reprove Theorem 3.36). Proposition 4.26. An is a normal subgroup of Sn , Sn /An ∼ = C2 , and |An | = 12 n!. Example 4.27. Show that the quotient group R/Z, of real numbers modulo 1 is isomorphic to the circle group W = {eiθ ∈ C|θ ∈ R}. Solution. The set W consists of points on the circle of complex numbers of unit modulus, and forms a group under multiplication. Define the function f : R → W by f (x) = e2πix . This is a morphism from (R, +) to (W, ·) because f (x + y) = e2πi(x+y) = e2πix · e2πiy = f (x) · f (y). This function can be visualized in Figure 4.1 as wrapping the real line around and around the circle. The morphism f is clearly surjective, and its kernel is {x ∈ R|e2πix = 1} = Z. Therefore, the morphism theorem implies that R/Z ∼ = W . The quotient space R/Z is the set of equivalence classes of R under the relation defined by x ≡ y mod Z if and only if the real numbers x and y differ by an integer. This quotient space is called the group of real numbers modulo 1.
MORPHISM THEOREM
89 i −1
−2
−1
0
1
2
3
f
W 1
−i
Figure 4.1.
Morphism f : R → W .
Proposition 4.28. If G and H are finite groups whose orders are relatively prime, there is only one morphism from G to H , the trivial one. Proof. Let K be the kernel of a morphism f from G to H . Then G/K ∼ = Imf , a subgroup of H . Now |G/K| = |G|/|K|, which is a divisor of |G|. But by Lagrange’s theorem, |Imf | is a divisor of |H |. Since |G| and |H | are relatively prime, we must have |G/K| = |Imf | = 1. Therefore K = G, so f : G → H is the trivial morphism defined by f (g) = eH for all g ∈ G. Example 4.29. Find all the subgroups and quotient groups of D4 , the symmetry group of a square, and draw the poset diagram of its subgroups. Solution. Any symmetry of the square induces a permutation of its vertices. Thus, as in Example 3.30, this defines a group morphism f : D4 → S4 . However, unlike the case of the symmetries of an equilateral triangle, this is not an isomorphism because |D4 | = 8, whereas |S4 | = 24. The kernel of f consists of symmetries fixing the vertices and so consists of the identity only. Therefore, by the morphism theorem, D4 is isomorphic to the image of f in S4 . We equate an element of D4 with its image in S4 . All the elements of D4 are shown in Figure 4.2. The corner by the vertex 1 is blocked in, and the reverse side of the square is shaded to illustrate the effect of the symmetries. The order of each symmetry is given in Table 4.3. 1
4
2
1
3
4
(1) = e
1
4 (24) = h
2
1
2
1
3
4 3 (13)°(24) = g 2
4
1
(1234) = g
2
1
2
1
3
4 3 (12) ° (34) = gh
4
Figure 4.2.
2
3 (13) = g 2h
Symmetries of the square.
2
3 (1432) = g 3
2
4 3 (14) ° (23) = g 3h
90
4 QUOTIENT GROUPS
TABLE 4.3. Orders of the Symmetries of a Square Elements of D4
e
g
g2
g3
h
gh
g2 h
g3 h
Order of Element
1
4
2
4
2
2
2
2
D4 K1 =
e, g 2,h, g 2h
e, g 2
e, g 2h
e, h
e, g 2, gh, g 3h = K 2
C4 =L
e, gh
e, g 3h
e Figure 4.3.
Poset diagram of subgroups of D4 .
The cyclic subgroups generated by the elements are {e}, C4 = {e, g, g 2 , g 3 }, {e, g 2 }, {e, h}, {e, gh}, {e, g 2 h}, and {e, g 3 h}. By Lagrange’s theorem, any proper subgroup must have order 2 or 4. Since any group of order 2 is cyclic, the only proper subgroups that are not cyclic are of order 4 and contain elements of order 1 and 2. There are two such subgroups, K1 = {e, g 2 , h, g 2 h} and K2 = {e, g 2 , gh, g 3 h}. All the subgroups are illustrated in Figure 4.3. To find all the quotient groups, we must determine which subgroups are normal. The trivial group {e} and the whole group D4 are normal subgroups. Since C4 , K1 , and K2 have index 2 in D4 , they are normal by Proposition 4.20, and their quotient groups are cyclic of order 2. Subgroup H
Left Coset gH
Right Coset Hg
{e, h} {e, g 2 h} {e, gh} {e, g 3 h}
{g, gh} {g, g 3 h} {g, g 2 h} {g, h}
{g, hg} = {g, g 3 h} {g, g 2 hg} = {g, gh} {g, ghg} = {g, h} {g, g 3 hg} = {g, g 2 h}
For each of the subgroups above, the left and right cosets containing g are different; therefore, none of the subgroups are normal. Left Cosets of L
Right Cosets of L
L = {e, g } gL = {g, g 3 } hL = {h, hg 2 } = {h, g 2 h} ghL = {gh, ghg 2 } = {gh, g 3 h}
L = {e, g 2 } Lg = {g, g 3 } Lh = {h, g 2 h} Lgh = {gh, g 3 h}
2
The table above shows that L = {e, g 2 } is a normal subgroup. The multiplication table for D4 /L given in Table 4.4 shows that it is isomorphic to the Klein 4-group.
DIRECT PRODUCTS
91
TABLE 4.4. Group D4 /L · L Lh Lg Lgh
L
Lh
Lg
Lgh
L Lh Lg Lgh
Lh L Lgh Lg
Lg Lgh L Lh
Lgh Lg Lh L
DIRECT PRODUCTS Given two sets, S and T , we can form their Cartesian product, S × T = {(s, t)|s ∈ S, t ∈ T }, whose elements are ordered pairs. For example, the product of the real line, R, with itself is the plane, R × R = R2 . We now show how to define the product of any two groups; the underlying set of the product is the Cartesian product of the underlying sets of the original groups. Proposition 4.30. If (G, Ž ) and (H , ) are two groups, then (G × H, ·) is a group under the operation · defined by (g1 , h1 ) · (g2 , h2 ) = (g1 Ž g2 , h1 h2 ). The group (G × H, ·) is called the direct product of the groups (G, Ž ) and (H , ). Proof. All the group axioms follow from the axioms for (G, Ž ) and (H , ). The identity of G × H is (eG , eH ), and the inverse of (g, h) is (g −1 , h−1 ). This construction can be iterated any finite number of times to obtain the direct product of n groups. Sometimes the direct product of two groups G and H is called the direct sum and is denoted by G ⊕ H . (The direct sum of a finite number of groups is the same as the direct product. It is possible to define a direct sum and direct product of an infinite number of groups; these are different. An element of the direct product is obtained by taking one element from each group, while an element of the direct sum is obtained by taking one element from each group, but with only a finite number different from the identity.) Example 4.31. Write down the table for the direct product of C2 with itself. Solution. Let C2 = {e, g}, so that C2 × C2 = {(e, e), (e, g), (g, e), (g, g)}. Its table is given in Table 4.5. We see that this group C2 × C2 is isomorphic to the Klein 4-group of symmetries of a rectangle. Theorem 4.32. If gcd(m, n) = 1, then Cmn ∼ = Cm × Cn .
92
4 QUOTIENT GROUPS
TABLE 4.5. Group C2 × C2 · (e, e) (e, g) (g, e) (g, g)
(e, e) (e, e) (e, g) (g, e) (g, g)
(e, g) (e, g) (e, e) (g, g) (g, e)
(g, e) (g, e) (g, g) (e, e) (e, g)
(g, g) (g, g) (g, e) (e, g) (e, e)
Proof. Let g, h, and k be the generators of Cmn , Cm , and Cn , respectively. Define f : Cmn → Cm × Cn by f (g r ) = (hr , k r ) for r ∈ Z. This is well defined for all integers r because if g r = g r , then r − r is a multiple of mn, so r − r is a multiple of m and of n. Hence hr = hr and k r = k r . Now f is a group morphism because f (g r · g s ) = f (g r+s ) = (hr+s , k r+s ) = (hr · hs , k r · k s ) = (hr , k r ) · (hs , k s ) = f (g r ) · f (g s ). If g r ∈ Kerf , then hr = e and k r = e. Therefore, r is divisible by m and n, and since gcd(m, n) = 1, r is divisible by mn. Hence Kerf = {e}, and the image of f is isomorphic to Cmn . However, |Cmn | = mn and |Cm × Cn | = |Cm | · |Cn | = mn; hence Imf = Cm × Cn , and f is an isomorphism. The following is an easy consequence of this result. Corollary 4.33. Let n = p1α1 p2α2 . . . prαr where p1 , p2 , . . . , pr are distinct primes. Then Cn ∼ = Cp1α1 × Cp2α2 × · · · × Cprαr . If m and n are not coprime, then Cmn is never isomorphic to Cm × Cn . For example, C2 × C2 is not isomorphic to C4 because the direct product contains no element of order 4. In general, the order of the element (h, k) in H × K is the least common multiple of the orders of h and k, because (h, k)r = (hr , k r ) = (e, e) if and only if hr = e and k r = e. Hence, if gcd(m, n) > 1, the order of (h, k) in Cm × Cn is always less than mn. Direct products can be used to classify all finite abelian groups. It can be shown that any finite abelian group is isomorphic to a direct product of cyclic groups. For example, see Nicholson [11] or Baumslag and Chandler [25]. The results above can be used to sort out those products of cyclic groups that are isomorphic to each other. For example, there are three nonisomorphic abelian groups with 24 elements, namely, C8 × C3 ∼ = C24 C2 × C4 × C3 ∼ = C6 × C4 ∼ = C2 × C12 ∼ C2 × C2 × C6 . C2 × C2 × C2 × C3 =
DIRECT PRODUCTS
93
Theorem 4.34. If (G, ·) is a finite group for which every element g ∈ G satisfies g 2 = e, then |G| = 2n for some n 0, and G is isomorphic to the n-fold direct product C2n = C2 × C2 × · · · × C2 . Proof. Every element in G has order 1 or 2, and the identity is the only element of order 1. Therefore, every element of G is its own inverse. The group G is abelian because for any g, h ∈ G, gh = (gh)−1 = h−1 g −1 = hg. Choose the elements a1 , a2 , . . . , an ∈ G so that ai = e and ai cannot be written as a product of powers of a1 , . . . , ai−1 . Furthermore, choose n maximal, so that every element can be written in terms of the elements ai . If C2 is generated by g, we show that the function f : C2n → G, defined by f (g r1 , g r2 , . . . , g rn ) = a1r1 a2r2 . . . anrn is an isomorphism. It is well defined for all integers ri , because if g ri = g qi , then q airi = ai i . Now f ((g r1 , . . . , g rn ) · (g s1 , . . . , g sn )) = f (g r1 +s1 , . . . , g rn +sn ) = a1r1 +s1 . . . anrn +sn = a1r1 . . . anrn .a1s1 . . . ansn
because G is abelian
= f (g , . . . , g ) · f (g , . . . , g sn ). r1
rn
s1
Hence f is a group morphism. Let (g r1 , . . . , g rn ) ∈ Kerf . Suppose that ri is the last odd exponent, so that ri−1 ri+1 , ri+2 , . . . , rn are all even. Then a1r1... ai−1 ai = e and i−1 ai = ai−1 = a1r1... ai−1 ,
r
which is a contradiction. Therefore, all the exponents are even, and f is injective. The choice of the elements ai guarantees that f is surjective. Hence f is the required isomorphism. Example 4.35. Describe all the group morphisms from C10 to C2 × C5 . Which of these are isomorphisms? Solution. Since C10 is a cyclic group, generated by g, for example, a morphism from C10 is determined by the image of g. Let h and k be generators of C2 and C5 , respectively, and consider the function fr,s : C10 → C2 × C5 which maps g to the element (hr , k s ) ∈ C2 × C5 . Then, if fr,s is a morphism, fr,s (g n ) = (hrn , k sn ) for 0 n9. However, this would also be true for all integers n, because if g n = g m , then 10|n − m. Hence 2|n − m and 5|n − m and hrn = hrm and k sn = k sm . We now verify that fr,s is a morphism for any r and s. We have fr,s (g a g b ) = fr,s (g a+b ) = (h(a+b)r , k (a+b)s ) = (har , k as )(hbr , k bs ) = fr,s (g a )fr,s (g b ).
94
4 QUOTIENT GROUPS
Therefore, there are ten morphisms, fr,s , from C10 to C2 × C5 corresponding to the ten elements (hr , k s ) of C2 × C5 . Now Kerfr,s = {g n |(hrn , k sn ) = (e, e)} = {g n |rn ≡ 0 mod 2 and sn ≡ 0 mod 5}. Hence Kerfr,s = {e} if (r, s) = (1, 1), (1, 2), (1, 3), or (1, 4), while Kerf0,0 = C10 , Kerf1,0 = {e, g 2 , g 4 , g 6 , g 8 }, and Kerf0,s = {e, g 5 }, if s = 1, 2, 3, or 4. If Kerfr,s contains more than one element, fr,s is not an injection and cannot be an isomorphism. By the morphism theorem, |C10 |/|Kerfr,s | = |Imfr,s |, and if Kerfr,s = {e}, then | Im fr,s | = 10, so fr,s is surjective also. Therefore, the isomorphisms are f1,1 , f1,2 , f1,3 , and f1,4 . GROUPS OF LOW ORDER We find all possible isomorphism classes of groups with eight or fewer elements. Lemma 4.36. Suppose that a and b are elements of coprime orders r and s, respectively, in an abelian group. Then ab has order rs. Proof. Let A and B denote the subgroups generated by a and b, respectively. Since ab = ba, we have (ab)rs = a rs brs = (a r )s (bs )r = es er = e. Suppose that (ab)k = e; we must show that rs divides k. Observe that a k = b−k ∈ A ∩ B. Since A ∩ B is a subgroup of both A and B, its order divides |A| = r and |B| = s by Lagrange’s theorem. Since r and s are coprime, this implies that |A ∩ B| = 1. It follows that a k = e and b−k = e, so r divides k and s divides k. Hence rs divides k by Theorem 11, Appendix 2 (again because r and s are coprime), as required. With this we can describe the groups of order eight or less. Order 1. Every trivial group is isomorphic to {e}. Order 2. By Corollary 4.11, every group of order 2 is cyclic. Order 3. By Corollary 4.11, every group of order 3 is cyclic. Order 4. Each element has order 1, 2, or 4. Case (i). If there is an element of order 4, the group is cyclic. Case (ii). If not, every element has order 1 or 2 and, by Theorem 4.34, the group is isomorphic to C2 × C2 . Order 5. By Corollary 4.11, every group of order 5 is cyclic. Order 6. Each element has order 1, 2, 3, or 6. Case (i). If there is an element of order 6, the group is cyclic.
GROUPS OF LOW ORDER
95
Case (ii). If not, the elements have orders 1, 2, or 3. By Theorem 4.34, all the elements in a group of order 6 cannot have orders 1 and 2. Hence there is an element, say a, of order 3. The subgroup H = {e, a, a 2 } has index 2, and if b ∈ / H , the underlying set of the group is then H ∪ H b = {e, a, a 2 , b, ab, a 2 b}. By Proposition 4.20, H is normal, and the quotient group of H is cyclic of order 2. Hence br ∈ H br = (H b)r =
H Hb
if r is even . if r is odd
Therefore, b has even order. It cannot be 6, so it must be 2. As H is normal, bab−1 ∈ H . We cannot have bab−1 = e, because a = e. If bab−1 = a, then ba = ab, and we can prove that the entire group is abelian. This cannot happen because by Lemma 4.36, ab would have order 6. Therefore, bab−1 = a 2 , and the group is generated by a and b with relations a 3 = b2 = e and ba = a 2 b. This group is isomorphic to D3 and S3 . Order 7. Every group of order 7 is cyclic. Order 8. Each element has order 1, 2, 4, or 8. Case (i). If there is an element of order 8, the group is cyclic. Case (ii). If all elements have order 1 or 2, the group is isomorphic to C2 × C2 × C2 by Theorem 4.34. Case (iii). Otherwise, there is an element of order 4, say a. The subgroup H = {e, a, a 2 , a 3 } is of index 2 and therefore normal. If b ∈ / H , the underlying set of the group is H ∪ H b = {e, a, a 2 , a 3 , b, ab, a 2 b, a 3 b}. Now b2 ∈ H , but b2 cannot have order 4; otherwise, b would have order 8. Therefore, b2 = e or a 2 . As H is normal, bab−1 ∈ H and has the same order as a because (bab−1 )k = ba k b−1 . Case (iiia). If bab−1 = a, then ba = ab, and the whole group can be proved to be abelian. If b2 = e, each element can be written uniquely in the form a r bs , where 0 r 3 and 0 s 1. Hence the group is isomorphic to C4 × C2 by mapping a r bs to (a r , bs ). If b2 = a 2 , let c = ab, so that c2 = a 2 b2 = a 4 = e. Each element of the group can now be written uniquely in the form a r cs , where 0 r 3, 0 s 1, and the group is still isomorphic to C4 × C2 . Case (iiib). If bab−1 = a 3 and b2 = e, the group is generated by a and b with the relations a 4 = b2 = e, ba = a 3 b. This is isomorphic to the dihedral group D4 . Case (iiic). If bab−1 = a 3 and b2 = a 2 , then the group is isomorphic to the quaternion group Q, described in Exercise 3.47. The isomorphism maps a r bs to i r j s . Any group with eight or fewer elements is isomorphic to exactly one group in Table 4.6.
96
4 QUOTIENT GROUPS
TABLE 4.6. Groups of Low Order Order Abelian groups
1 {e}
2 C2
3 C3
4 C4 C2 × C2
5 C5
6 C6
S3
Non-abelian groups
7 C7
8 C8 C4 × C2 C2 × C2 × C 2 D4 Q
ACTION OF A GROUP ON A SET The concept of a group acting on a set X is a slight generalization of the group of symmetries of X. It is equivalent to considering a subgroup of S(X). This concept is useful for determining the order of the symmetry groups of solids in three dimensions, and it is indispensable in Chapter 6, when we look at the P´olya–Burnside method of enumerating sets with symmetries. The group (G, ·) acts on the set X if there is a function ψ: G × X → X such that when we write g(x) for ψ(g, x), we have: (i) (g1 g2 )(x) = g1 (g2 (x)) for all g1 , g2 ∈ G, x ∈ X. (ii) e(x) = x if e is the identity of G and x ∈ X. Proposition 4.37. If g is an element of a group G acting on the set X, then the function g: X → X, which maps x to g(x), is a bijection. This defines a morphism χ: G → S(X) from G to the group of symmetries of X. Proof. The function g: X → X is injective because if g(x) = g(y), then g −1 g(x) = g −1 g(y), and e(x) = e(y) or x = y. It is surjective because if z ∈ X, g(g −1 (z)) = gg −1 (z) = e(z) = z. Hence g is bijective, and g can be considered as an element of S(X), the group of symmetries of X. The function χ: G → S(X), which takes the element g ∈ G to the bijection g: X → X, is a group morphism because χ(g1 g2 ) is the function from X to X defined by χ(g1 g2 )(x) = (g1 g2 )(x) = (g1 (g2 (x)) = χ(g1 ) Ž χ(g2 )(x); thus χ(g1 g2 ) = χ(g1 ) Ž χ(g2 ). If Kerχ = {e}, then χ is injective, and the group G is said to act faithfully on the set X. G acts faithfully on X if the only element of G, which fixes every
ACTION OF A GROUP ON A SET
97 g
2
1 3
2 3
5
6
h 6 4
Figure 4.4.
4
1
7
5
C2 acting on a hexagon.
Figure 4.5.
8
C3 acting on a cube.
element of X, is the identity e ∈ G. In this case, we identify G with Imχ and regard G as a subgroup of S(X). For example, consider the cyclic group of order 2, C2 = {e, h}, acting on the regular hexagon in Figure 4.4, where h reflects the hexagon about the line joining vertex 3 to vertex 6. Then C2 acts faithfully and can be identified with the subgroup {(1), (15) Ž (24)} of D6 . The cyclic group C3 = {e, g, g 2 } acts faithfully on the cube in Figure 4.5, where g rotates the cube through one-third of a revolution about a line joining two opposite vertices. This group action can be considered as the subgroup {(1), (163) Ž (457), (136) Ž (475)} of the symmetry group of the cube. Proposition 4.38. If G acts on a set X and x ∈ X, then Stab x = {g ∈ G|g(x) = x} is a subgroup of G, called the stabilizer of x. It is the set of elements of G that fix x. Proof. Stab x is a subgroup because (i) If g1 , g2 ∈ Stab x, then (g1 g2 )(x) = g1 (g2 (x)) = g1 (x) = x, so g1 g2 ∈ Stab x. (ii) If g ∈ Stab x, then g −1 (x) = x, so g −1 ∈ Stab x. The set of all images of an element x ∈ X under the action of a group G is called the orbit of x under G and is denoted by Orb x = {g(x)|g ∈ G}. The orbit of x is the equivalence class of x under the equivalence relation on X in which x is equivalent to y if and only if y = g(x) for some g ∈ G. If π is a permutation in Sn , the subgroup generated by π acts on the set {1, 2, . . . , n}, and this definition of orbit agrees with our previous one. A graphic illustration of orbits can be obtained by looking at the group of matrices
cos θ − sin θ θ ∈R SO(2) = sin θ cos θ
98
4 QUOTIENT GROUPS
under matrix multiplication. This group is called the special orthogonal group and is isomorphic to the circle group W . SO(2) acts on R2 as follows. The matrix M ∈ SO(2) takes the vector x ∈ R2 to the vector Mx. The orbit of any element x ∈ R2 is the circle through x with center at the origin. Since the origin is the only fixed point for any of the nonidentity transformations, the stabilizer of the origin is the whole group, whereas the stabilizer of any other element is the subgroup consisting of the identity matrix only. The orbits of the cyclic group C2 acting on the hexagon in Figure 4.4 are {1, 5}, {2, 4}, {3}, and {6}. There is an important connection between the number of elements in the orbit of a point x and the stabilizer of that point. Lemma 4.39. If G acts on X, then for each x ∈ X |G: Stab x| = |Orb x|. Proof. Let H = Stab x and define the function ξ : G/H → Orb x by ξ(Hg) = g −1 (x). This is well defined on cosets because if Hg = H k, then k = hg for some h ∈ H , so k −1 (x) = (hg)−1 (x) = g −1 h−1 (x) = g −1 (x), since h−1 ∈ H = Stab x. The function ξ is surjective by the definition of the orbit of x. It is also injective, because ξ(Hg1 ) = ξ(Hg2 ) implies that g1−1 (x) = g2−1 (x), so g2 g1−1 (x) = x and g2 g1−1 ∈ Stab x = H . Therefore, ξ is a bijection, and the result follows. Note that ξ is not a morphism. G/Stab x is just a set of cosets because Stab x is not necessarily normal. Furthermore, we have placed no group structure on Orb x. Theorem 4.40. If the finite group G acts on a set X, then for each x ∈ X, |G| = |Stab x||Orb x|. Proof. This follows from Lemma 4.39 and Corollary 4.8.
Example 4.41. Find the number of proper rotations of a cube. Solution. Let G be the group of proper rotations of a cube; that is, rotations that can be carried out in three dimensions. The stabilizer of the vertex 1 in Figure 4.6 is Stab 1 = {(1), (245) Ž (386), (254) Ž (368)}. The orbit of 1 is the set of all the vertices, because there is an element of G that will take 1 to any other vertex. Therefore, by Theorem 4.40, |G| = |Stab 1| |Orb 1| = 3 · 8 = 24.
ACTION OF A GROUP ON A SET
2
99
1 3
6
4 5
7 Figure 4.6.
8 Cube.
Figure 4.7.
Reflection in a plane.
The full symmetry group of the cube would include improper rotations such as the reflection in the plane as shown in Figure 4.7. This induces the permutation (24) Ž (68) on the vertices, and it cannot be obtained by physically rotating the cube in three dimensions. Under this group Stab 1 = {(1), (245) Ž (368), (254) Ž (386), (24) Ž (68), (25) Ž (38), (45) Ž (36)}, so the order of the full symmetry group of the cube is |Stab 1||Orb 1| = 6.8 = 48. Therefore, there are 24 proper and 24 improper rotations of the cube. The article by Shapiro [32] contains many applications, mainly to group theory, of the actions of a group on a set. We conclude by mentioning the action of the symmetric group Sn on the set of polynomials in n variables x1 , x2 , . . . , xn . A permutation σ ∈ Sn acts on a polynomial f = f (x1 , x2 , . . . , xn ) by permuting the variables: σ (f ) = f (xσ 1 , xσ 2 , . . . , xσ n ). This was the action we used in Chapter 3 to define the parity of a permutation and prove the parity theorem. It has historical interest as well. It is the context in which Lagrange proved Lagrange’s theorem—in essence, what he actually did is prove Theorem 4.40 for this action. Moreover, this is the group action that launched Galois theory, about which we say more in Chapter 11.
100
4 QUOTIENT GROUPS
EXERCISES In Exercises 4.1 to 4.4, which of the relations are equivalence relations? Describe the equivalence classes of those relations which are equivalence relations. 4.1. The relation ∼ on P × P defined by (a, b) ∼ (c, d) if and only if a + d = b + c. 4.2. The relation T on the set of continuous functions from R to R, where fTg if and only if f (3) = g(3). 4.3. The inclusion relation on the power set P (X). 4.4. The relation C on a group G, where aCb if and only if ab = ba. 4.5. Find the left and right cosets of H = {(1), (12), (34), (12) Ž (34)} in S4 . 4.6. Let H be the subgroup of A4 that fixes 1. Find the left and right cosets of H in A4 . Is H normal? Describe the left cosets in terms of their effect on the element 1. Can you find a similar description for the right cosets? In Exercises 4.7 to 4.12, verify that each of the functions is well defined. Determine which are group morphisms, and find the kernels and images of all the morphisms. The element of Zn containing x is denoted by [x]n . 4.7. 4.8. 4.9. 4.10. 4.11. 4.12. 4.13. 4.14. 4.15. 4.16. 4.17.
4.18. 4.19. 4.20. 4.21. 4.22.
f : Z12 → Z12 , where f ([x]12 ) = [x + 1]12 . f : C12 → C12 , where f (g) = g 3 . f : Z → Z2 × Z4 , where f (x) = ([x]2 , [x]4 ). f : Z8 → Z2 , where, f ([x]8 ) = [x]2 . f : C2 × C3 → C3 , where f (hr , k s ) = (12)r Ž (123)s . f : Sn → Sn+1 , where f (π) is the permutation on {1, 2, . . . , n + 1} defined by f (π)(i) = π(i) if i n, and f (π)(n + 1) = n + 1. If H is a subgroup of an abelian group G, prove that the quotient group G/H is abelian. If H is a subgroup of G, show that g −1 Hg = {g −1 hg|h ∈ H } is a subgroup for each g ∈ G. Prove that the subgroup H is normal in G if and only if g −1 Hg = H for all g ∈ G. If H is the only subgroup of a given order in a group G, prove that H is normal in G. Let H be any subgroup of a group G. Prove that there is a one-to-one correspondence between the set of left cosets of H in G and the set of right cosets of H in G. Is the cyclic subgroup {(1), (123), (132)} normal in S4 ? Is the cyclic subgroup {(1), (123), (132)} normal in A4 ? Is {(1), (1234), (13) Ž (24), (1432), (13), (24), (14) Ž (23), (12) Ž (34)} normal in S4 ? Find all the group morphisms from C3 to C4 . Find all the group morphisms from Z to Z4 .
EXERCISES
101
4.23. Find all the group morphisms from C6 to C6 . 4.24. Find all the group morphisms from Z to D4 . In Exercises 4.25 to 4.29, which of the pairs of groups are isomorphic? Give reasons. 4.25. C60 and C10 × C6 . 4.26. (P {a, b, c}, ) and C2 × C2 × C2 . 4.27. Dn and Cn × C2 . 4.28. D6 and A4 . √ √ 4.29. Z4 × Z2 and ({±1, ±i, ±(1 + i)/ 2, ±(1 − i)/ 2}, ·). 4.30. If G × H is cyclic, prove that G and H are cyclic. 4.31. If π is an r-cycle in Sn , prove that ρ −1 Ž π Ž ρ is also an r-cycle for each ρ ∈ Sn . 4.32. Find four different subgroups of S4 that are isomorphic to S3 . 4.33. Find all the isomorphism classes of groups of order 10. 4.34. Find all the ten subgroups of A4 and draw the poset diagram under inclusion. Which of the subgroups are normal? 4.35. For any groups G and H , prove that (G × H )/G ∼ = H and (G × H )/H ∼ = G, where G = {(g, e) ∈ G × H |g ∈ G} and H = {(e, h) ∈ G × H |h ∈ H }. 4.36. Show that Q/Z is an infinite group but that every element has finite order. 4.37. If G is a subgroup of Sn and G contains an odd permutation, prove that G contains a normal subgroup of index 2. 4.38. In any group (G, ·) the element a −1 b−1 ab is called the commutator of a and b. Let G be the subset of G consisting of all finite products of commutators. Show that G is a normal subgroup of G. This is called the commutator subgroup. Also prove that G/G is abelian. 4.39. Let C∗ be the group of nonzero complex numbers under multiplication and let W be the multiplicative group of complex numbers of unit modulus. Describe C∗ /W . 4.40. Show that K = {(1), (12) Ž (34), (13) Ž (24), (14) Ž (23)} is a subgroup of S4 isomorphic to the Klein 4-group. Prove that K is normal and that S4 /K ∼ = S3 . 4.41. If K is the group given in Exercise 4.40, prove that K is normal in A4 and that A4 /K ∼ = C3 . This shows that A4 is not a simple group. 4.42. The cross-ratio of the four distinct real numbers x1 , x2 , x3 , x4 in that order is the ratio λ = (x2 − x4 )(x3 − x1 )/(x2 − x1 )(x3 − x4 ). Find the subgroup K of S4 , of all those permutations of the four numbers that preserve the value of the cross-ratio. Show that if λ is the cross-ratio of four numbers taken in a certain order, the cross-ratio of these numbers in any other order must belong to the set
1 1 1 λ λ, 1 − λ, , 1 − , , . λ λ 1−λ λ−1
102
4 QUOTIENT GROUPS
Furthermore, show that all permutations in the same coset of K in S4 give rise to the same cross-ratio. In other words, prove that the quotient group S4 /K is isomorphic to the group of functions given in Exercise 3.42. The cross-ratio is very useful in projective geometry because it is preserved under projective transformations. 4.43. (Second Isomorphism Theorem) Let N be a normal subgroup of G, and let H be any subgroup of G. Show that H N = {hn|h ∈ H, n ∈ N } is a subgroup of G and that H ∩ N is a normal subgroup of H . Also prove that H /(H ∩ N ) ∼ = H N/N. 4.44. (Third isomorphism theorem) Let M and N be normal subgroups of G, and N be a normal subgroup of M. Show that φ: G/N → G/M is a well-defined morphism if φ(Ng) = Mg, and prove that (G/N )/(M/N ) ∼ = G/M. 4.45. If a finite group contains no nontrivial subgroups, prove that it is either trivial or cyclic of prime order. 4.46. If d is a divisor of the order of a finite cyclic group G, prove that G contains a subgroup of order d. 4.47. If G is a finite abelian group and p is a prime such that g p = e, for all g ∈ G, prove that G is isomorphic to Znp , for some integer n. 4.48. What is the symmetry group of a rectangular box with sides of length 2, 3, and 4 cm? 4.49. Let
a b ∈ M2 (Zp )|ad − bc = 1 in Zp . Gp = c d
4.50.
4.51. 4.52.
4.53.
If p is prime, show that (Gp , ·) is a group of order p(p 2 − 1), and find a group isomorphic to G2 . Show that (R∗ , ·) acts on Rn+1 by scalar multiplication. What are the orbits under this action? The set of orbits, excluding the origin, form the n-dimensional real projective space. Let G be a group of order n, and let gcd(n, m) = 1. Show that every element h in G has an mth root; that is, h = g m for some g ∈ G. Let G denote the commutator subgroup of a group G (see Exercise 4.38). If K is a subgroup of G, show that G ⊆ H if and only if K is normal in G and G/K is abelian. Call a group G metabelian if it has a normal subgroup K such that both K and G/K are abelian. (a) Show that every subgroup and factor group of a metabelian group is metabelian. (Exercises 4.43 and 4.44 are useful.) (b) Show that G is metabelian if and only if the commutator group G is abelian (see Exercise 4.38).
EXERCISES
103
4.54. Recall (Exercise 3.76) that the center Z(G) of a group G is defined by Z(G) = {z ∈ G|zg = gz for all g ∈ G}. Let K ⊆ Z(G) be a subgroup. (a) Show that K is normal in G. (b) If G/K is cyclic, show that G is abelian. For Exercises 4.55 to 4.61, let Zm ∗ = {[x] ∈ Zm |gcd(x, m) = 1 }. The number of elements in this set is denoted by φ(m) and is called the Euler φ-function. For example, φ(4 ) = 2 , φ(6 ) = 2 , and φ(8 ) = 4 . 4.55. 4.56. 4.57. 4.58. 4.59. 4.60. 4.61. 4.62. 4.63.
4.64.
Show that φ(p r ) = p r − p r−1 if p is a prime. Show that φ(mn) = φ(m)φ(n) if gcd(m, n) = 1. Prove that (Zm ∗ , ·) is an abelian group. Write out the multiplication table for (Z8 ∗ , ·). Prove that (Z6 ∗ , ·) and (Z17 ∗ , ·) are cyclic and find generators. Find groups in Table 4.6 that are isomorphic to (Z8 ∗ , ·), (Z9 ∗ , ·), (Z10 ∗ , ·), and (Z15 ∗ , ·) and describe the isomorphisms. Prove that if gcd(a, m) = 1, then a φ(m) ≡ 1 mod m. [This result was known to Leonhard Euler (1707–1783).] Prove that if p is a prime, then for any integer a, a p ≡ a modp. [This result was known to Pierre de Fermat (1601–1665).] If G is a group of order 35 acting on a set with 13 elements, show that G must have a fixed point, that is, a point x ∈ S such that g(x) = x for all g ∈ G. If G is a group of order p r acting on a set with m elements, show that G has a fixed point if p does not divide m.
5 SYMMETRY GROUPS IN THREE DIMENSIONS
In this chapter we determine the symmetry groups that can be realized in twoand three-dimensional space. We rely heavily on geometric intuition, not only to simplify arguments but also to give geometric flavor to the group theory. Because we live in a three-dimensional world, these symmetry groups play a crucial role in the application of modern algebra to physics and chemistry. We first show how the group of isometries of Rn can be broken down into translations and orthogonal transformations fixing the origin. Since the orthogonal transformations can be represented as a group of matrices, we look at the properties of matrix groups. We then use these matrix groups to determine all the finite rotation groups in two and three dimensions, and we find polyhedra that realize these symmetry groups.
TRANSLATIONS AND THE EUCLIDEAN GROUP Euclidean geometry in n dimensions is concerned with those properties that are preserved under isometries (rigid motions) of euclidean n-space, that is, bijections α: Rn → Rn that preserve distance. The group of all isometries of Rn is called the euclidean group in n dimensions and is denoted E(n). Given w ∈ Rn , the map Rn → Rn with v → v + w is called translation by w, and we begin by showing that the group T (n) of all translations is a normal subgroup of E(n), and that the factor group is isomorphic to the group of all orthogonal n × n matrices (that is, matrices A such that A−1 = AT , the transpose of A—reflection of A in its main diagonal). Recall that a function λ: Rn → Rn is called a linear transformation if λ(av + bw) = aλ(v) + bλ(w) for all a, b ∈ R and all (column) vectors v, w ∈ Rn . Let {e1 , e2 , . . . , en } denote the standard basis of Rn , that is, the columns of the Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 104
TRANSLATIONS AND THE EUCLIDEAN GROUP
105
n × n identity matrix. Then the action of λ is matrix multiplication λ(v) = Av for all v in Rn , where the matrix A is given in terms of its columns by A = [λ(e1 )λ(e2 ) · · · λ(en )] and is called the standard matrix of α. Moreover, the correspondence λ ↔ A is a bijection that preserves addition, multiplication, and the identity. So we may (and sometimes shall) identify λ with the matrix A. If v √ and w are vectors in Rn , let vžw = vT w denote their inner product. Then ||v|| = vžv is the length of v, and ||v − w|| is the distance between v and w. Thus a function α: Rn → Rn is an isometry if ||α(v) − α(w)|| = ||v − w||
for all v, w ∈ Rn .
(∗ )
Since ||v − w||2 = ||v||2 + 2(vžw) + ||w||2 for any v, w ∈ Rn , it follows from (∗ ) that every isometry α preserves inner products in the sense that (∗∗ )
α(v)žα(w) = vžw for all v, w ∈ Rn .
Lemma 5.1. If α: Rn → Rn is an isometry such that α(0) = 0, then α is linear. Proof. It follows from (∗∗ ) that {α(e1 ), α(e2 ), . . . , α(en )} is an orthonormal basis of Rn . If a ∈ R and v ∈ Rn , then (∗∗ ) implies that [α(av) − aα(v)]žα(ei ) = (av)žei − a(vžei ) = 0
for each i.
Hence α(av) = aα(v), and α(v + w) = α(v) + α(w) follows in the same way for all v, w ∈ Rn . Hence the isometries of Rn that fix the origin are precisely the linear isometries. An n × n matrix A is called orthogonal if it is invertible and A−1 = AT , equivalently if the columns of A are an orthonormal basis of Rn . These matrices form a subgroup of the group of all invertible matrices, called the orthogonal group and denoted O(n). Proposition 5.2. Let λ: Rn → Rn be a linear transformation with standard matrix A. (i) λ is an isometry if and only if A is an orthogonal matrix. (ii) The group of linear isometries of Rn is isomorphic to O(n). Proof. If A is orthogonal, then for all v, w ∈ Rn , ||λ(v) − λ(w)||2 = A(v − w)žA(v − w) = (v − w)T AT A(v − w) = ||v − w||2 and it follows that λ is an isometry. Conversely, if λ is an isometry and {e1 , e2 , . . . , en } is the standard basis of Rn , then (∗∗ ) gives ei žej = λ(ei )žλ(ej ) = Aei žAej = eTi (AT A)ej = the (i, j )-entry of A
106
5
SYMMETRY GROUPS IN THREE DIMENSIONS
for all i and j . It follows that AT A = I , so A is orthogonal, proving (i). But then the correspondence λ ↔ A between the linear transformation λ and its standard matrix A induces a group isomorphism between the (linear) isometries fixing the origin and the orthogonal matrices. This proves (ii). Given a vector w ∈ Rn , define τw : Rn → Rn by τw (v) = v − w for all v ∈ Rn . Thus τw is the unique translation that carries w to 0. Because for all w, w ∈ Rn ,
τw Ž τw = τw+w
the correspondence w ↔ τw is a group isomorphism (Rn , +) ∼ = T (n). In particular, T (n) is an abelian group. Theorem 5.3. For each n 1, T (n) is an abelian normal subgroup of E(n) and E(n)/T (n) ∼ = O(n). In fact, the map E(n) → O(n) given by α → the standard matrix of τα(0) Ž α is a surjective group morphism E(n) → O(n) with kernel T (n). Proof. Write G(n) for the group of all linear isometries of Rn . Observe that if α ∈ E(n), then τα(0) Ž α is linear (it is an isometry that fixes 0), so we have a map φ: E(n) → G(n)
given by
φ(α) = τα(0) Ž α
for all α ∈ E(n).
By Proposition 5.2 it suffices to show that φ is a surjective group morphism with kernel T (n). To see that φ is a group morphism, observe first that α Ž τw = τα(w) Ž α
for all w ∈ Rn .
(∗∗∗ )
[Indeed, (α Ž τw )(v) = α(v − w) = α(v) − α(w) = (τα(w) Ž α)(v) for all v.] Hence, given α and β in E(n), we have φ(α) Ž φ(β) = τα(0) Ž α Ž τβ(0) Ž β = τα(0) Ž (α Ž τβ(0) Ž α −1 ) Ž (α Ž β), so it suffices to show that τα(0) Ž (α Ž τβ(0) Ž α −1 ) = τ(α Ž β)(0) . But this follows because α Ž τβ(0) Ž α −1 is a translation by (∗∗∗ ), so τα(0) Ž (α Ž τβ(0) Ž α −1 ) is the unique translation that carries (α Ž β)(0) to 0. Hence φ is a group morphism. Moreover, φ is surjective because φ(λ) = λ for every λ ∈ G(n), and Ker(φ) = T (n) because φ(α) = 1Rn if and only if α(v) = v + α(0) for all v ∈ Rn , that is, if and only if α = τ−α(0) . If α ∈ E(n) and α(0) = w, the proof of Theorem 5.3 shows that τw Ž α ∈ G(n). Hence every isometry α of Rn is the composition of a linear isometry τw−1 Ž α followed by a translation τw .
MATRIX GROUPS
107
Proposition 5.4. Every finite subgroup of isometries of n-dimensional space fixes at least one point. Proof. Let G be a finite subgroup of isometries, and let x be any point of n-dimensional space. The orbit of x consists of a finite number of points that are permuted among themselves by any element of G. Since all the elements of G are rigid motions, the centroid of Orb x must always be sent to itself. Therefore, the centroid is a fixed point under G. If the fixed point of any finite subgroup G of isometries is taken as the origin, then G is a subgroup of O(n), and all its elements can be written as orthogonal matrices. We now look at the structure of groups whose elements can be written as matrices. MATRIX GROUPS In physical sciences and in mathematical theory, we frequently encounter multiplicative group structures whose elements are n × n complex matrices. Such a group is called a matrix group if its identity element is the n × n identity matrix I . To investigate these groups, we have at our disposal, and shall freely apply, the machinery of linear algebra. For example, if cos(2πk/m) − sin(2πk/m) Ak = , sin(2πk/m) cos(2πk/m) then ({A0 , A1 , . . . , Am−1 }, ·) is a real matrix group of order m isomorphic to Cm . The matrix Ak represents a counterclockwise rotation of the plane about the origin through an angle (2πk/m). The matrices 0 1 i 0 −i 0 −1 0 1 0 , , , , , −1 0 0 −i 0 i 0 −1 0 1 0 i 0 −i 0 −1 , and , i 0 −i 0 1 0 form a group under matrix multiplication. This is a complex matrix group of order 8 that is, in fact, isomorphic to the quaternion group Q of Exercise 3.47. Since the identity of any matrix group is the identity matrix I and every element of a matrix group must have an inverse, every element must be a nonsingular matrix. All the nonsingular n × n matrices over a field F form a group (GL(n, F ), ·) called the general linear group of dimension n over F . Any matrix group over the field F must be a subgroup of GL(n, F ). Proposition 5.5. The determinant of any element of a finite matrix group must be an integral root of unity.
108
5
SYMMETRY GROUPS IN THREE DIMENSIONS
Proof. Let A be an element of a matrix group of order m. Then, by Corollary 4.10, Am = I . Hence (detA)m = detAm = detI = 1. Hence, if G is a real matrix group, the determinant of any element of G is either +1 or −1. If G is a complex matrix group, the determinant of any element is of the form e2πik/m . The orthogonal group O(n) is a real matrix group, and therefore any element must have determinant +1 or −1. The determinant function det: O(n) → {1, −1} is a group morphism from (O(n), ·) to ({1, −1}, ·). The kernel, consisting of orthogonal matrices with determinant +1, is called the special orthogonal group of dimension n and is denoted by SO(n) = {A ∈ O(n)|detA = +1}. This is a normal subgroup of O(n) of index 2. The elements of SO(n) are called proper rotations, whereas the elements in the other coset of O(n) by SO(n), consisting of orthogonal matrices with determinant −1, are called improper rotations. An n × n complex matrix A is called unitary if it is invertible and A−1 is the conjugate transpose of A. Thus the real unitary matrices are precisely the orthogonal matrices. Indeed, if x, y = xT y denotes the inner product in Cn , the matrix A is unitary if and only if it preserves inner products in Cn (that is, Ax, Ay = x, y for all x, y ∈ Cn ), if and only if the columns of A are orthonormal. The unitary group of dimension n, U(n), consists of all n × n complex unitary matrices under multiplication. The special unitary group, SU(n), is the subgroup of U(n) consisting of those matrices with determinant +1. The group SU(3) received some publicity in 1964 when the Brookhaven National Laboratory discovered the fundamental particle called the omega-minus baryon. The existence and properties of this particle had been predicted by a theory that used SU(3) as a symmetry group of elementary particles. Proposition 5.6. If λ ∈ C is an eigenvalue of any unitary matrix, then |λ| = 1. Proof. Let λ be an eigenvalue and x a corresponding nonzero eigenvector of the unitary matrix A. Then Ax = λx, and since A preserves distances, ||x|| = ||Ax|| = ||λx|| = |λ|||x||. Since x is nonzero, it follows that |λ| = 1. The group {Ak |k = 0, 1, . . . , m − 1} of rotations of the plane is a subgroup of SO(2), and the eigenvalues that occur are e±(2πik/m) . The matrix group isomorphic to the quaternion group Q is a subgroup of SU(2), and the eigenvalues that occur are ±1 and ±i.
FINITE GROUPS IN TWO DIMENSIONS
109
Cayley’s theorem (Theorem 3.38) showed that any group could be represented by a group of permutations. Another way to represent groups is by means of matrices. A matrix representation of a group G is a group morphism φ: G → GL(n, F ). This is equivalent to an action of G on an n-dimensional vector space over the field F , by means of linear transformations. The representation is called faithful if the kernel of φ is the identity. In this case, φ is injective and G is isomorphic to Imφ, a subgroup of the general linear group. Matrix representations provide powerful tools for studying groups because they lend themselves readily to calculation. As a result, most physical applications of group theory use representations. It is possible to prove that any representation of a finite group over the real or complex field may be changed by a similarity transformation into a representation that uses only orthogonal or unitary matrices, respectively. Therefore, a real or complex faithful representation allows us to view a group as a subgroup of O(n) or U(n), respectively. FINITE GROUPS IN TWO DIMENSIONS We determine all the finite subgroups of rotations (proper and improper) of the plane R2 . That is, we find all the finite matrix subgroups of SO(2) and O(2). This was essentially done by Leonardo da Vinci when he determined the possible symmetries of a central building with chapels attached. See Field and Golubitsky [29], where they construct interesting symmetric patterns in the plane using chaotic maps. Proposition 5.7 (i) The set of proper rotations in two dimensions is
cos θ − sin θ θ ∈R . SO(2) = sin θ cos θ (ii) The set of improper rotations in two dimensions is
cos θ sin θ θ ∈R . sin θ − cos θ (iii) The eigenvalues of the proper rotation
cos θ sin θ
− sin θ cos θ
are e±iθ and
those of any improper rotation are ±1. 0 p 1 p q = and A = ∈ SO(2), so that A Proof. (i) Let A = 1 r 0 r s q . Since A preserves distances, p 2 + r 2 = 1, and q 2 + s 2 = 1; thus there s
110
5
SYMMETRY GROUPS IN THREE DIMENSIONS
exists angles θ and φ such that p = cos θ, r = sin θ, q = sin φ, and s = cos φ. Therefore, detA = ps − qr = cos θ cos φ − sin θ sin φ = cos(θ + φ). If A isproper, detA = 1, so θ + φ = 2nπ. Hence φ = 2nπ − θ , and A is of the cos θ − sin θ . Conversely, if A is of this form, then AAT = I and form sin θ cos θ A ∈ O(2). Since detA = +1, A is a proper rotation, and A ∈ SO(2). 1 0 2 , so the coset of improper rota(ii) One improper rotation in R is 0 −1 tions is
cos θ sin θ 1 0 θ ∈ = SO(2) R . sin θ − cos θ 0 −1 (iii) If λ is an eigenvalue of
cos θ sin θ
− sin θ cos θ
,
then det
(cos θ ) − λ − sin θ sin θ (cos θ ) − λ
= 0.
Therefore, λ2 − 2λ cos θ + 1 = 0 and λ = cos θ ± i sin θ = e±iθ . cos θ sin θ , then If λ is an eigenvalue of the improper rotation sin θ − cos θ (cos θ ) − λ sin θ = 0. Hence λ2 − 1 = 0 and λ = ±1. det sin θ −(cos θ ) − λ cos θ sin θ always has an eigenvalue 1 The improper rotation B = sin θ − cos θ and hence leaves an axis through the origin invariant because, for any corresponding eigenvector x, Bx = x. It can be verified that this axis of eigenvectors, corresponding to the eigenvalue 1, is a line through the origin making an angle θ/2 with the first coordinate axis. The matrix B corresponds to a reflection of the plane about this axis. Hence we see that an improper rotation is a reflection about a line through the origin, and conversely, it is easy to see that a reflection about a line through the origin is an improper rotation. Theorem 5.8. If G is a finite subgroup of SO(2), then G is cyclic, and so is isomorphic to Cn for some n ∈ P. Proof. By Proposition 5.6, every element A ∈ G ⊂ SO(2) is a counterclockwise rotation through an angle θ (A), where 0 θ (A) < 2π. Since G is finite, we can choose an element B ∈ G so that θ (B) is the smallest positive angle. For any A ∈ G, there exists an integer r 0 such that rθ (B) θ (A) < (r + 1)θ (B). Since θ (AB −r ) = θ (A) − rθ (B), it follows that 0 θ (AB −r ) < θ (B). Therefore, θ (AB −r ) = 0, AB −r = I , and A = B r .
PROPER ROTATIONS OF REGULAR SOLIDS
111
Hence G = {I, B, B 2 , . . . , B r , . . . , B n−1 }, and G is a finite cyclic group that must be isomorphic to Cn for some integer n. Theorem 5.9. If G is a finite subgroup of O(2), then G is isomorphic to either Cn or Dn for some n ∈ P. Proof. The kernel of the morphism det: G → {1, −1} is a normal subgroup, H , of index 1 or 2 consisting of the proper rotations in G. By the previous theorem, H is a cyclic group of order n, generated by B, for example. If G contains no improper rotations, then G = H ∼ = Cn . If G does contain an improper rotation A, then G = H ∪ H A = {I, B, B 2 , . . . , B n−1 , A, BA, B 2 A, . . . , B n−1 A}. Since A and B k A are reflections, A = A−1 and B k A = (B k A)−1 = A−1 B −k = AB n−k . These relations completely determine the multiplication in G, and it is now clear that G is isomorphic to the dihedral group Dn by an isomorphism that takes B to a rotation through 2π/n and A to a reflection. Theorem 5.9 shows that the only possible types of finite symmetries, fixing one point, of any geometric figure in the plane are the cyclic and dihedral groups. Examples of such symmetries abound in nature; the symmetry group of a snowflake is usually D6 , and many flowers have five petals with symmetry group C5 . We have found all the possible finite symmetries in the plane that fix one point. However, there are figures in the plane that have infinite symmetry groups that fix one point; one example is the circular disk. The group of proper symmetries of this disk is the group SO(2), whereas the group of all symmetries is the whole of O(2). PROPER ROTATIONS OF REGULAR SOLIDS One class of symmetries that we know occurs in three dimensions is the class of symmetry groups of the regular solids: the tetrahedron, cube, octahedron, dodecahedron, and icosahedron. In this section, we determine the proper rotation groups of these solids. These will all be subgroups of SO(3). We restrict our consideration to proper rotations because these are the only ones that can be physically performed on models in three dimensions; to physically perform an improper symmetry on a solid, we would require four dimensions! Theorem 5.10. Every element A ∈ SO(3) has a fixed axis, and A is a rotation about that axis. Proof. Let λ1 , λ2 , and λ3 be the eigenvalues of A. These are the roots of the cubic characteristic polynomial with real coefficients. Hence, at least one eigenvalue is real and if a second one is complex, the third is its complex conjugate.
112
5
SYMMETRY GROUPS IN THREE DIMENSIONS
By Proposition 5.6, |λ1 | = |λ2 | = |λ3 | = 1. Since detA = λ1 λ2 λ3 = 1, we can relabel the eigenvalues, if necessary, so that one of the following cases occurs: (i) λ1 = λ2 = λ3 = 1. (ii) λ1 = 1, λ2 = λ3 = −1. (iii) λ1 = 1, λ2 = λ3 = eiθ (where θ = nπ). In all cases there is an eigenvalue equal to 1. If x is a corresponding eigenvector, then Ax = x, and A fixes the axis along the vector x. We can change the coordinate axes so that A can be written in one of the following three forms: 1 0 0 1 0 0 1 0 0 0 (iii) 0 cos θ − sin θ . (i) 0 1 0 (ii) 0 −1 0 sin θ cos θ 0 0 −1 0 0 1 The first matrix is the identity, the second is a rotation through π, and the third is a rotation through θ about the fixed axis. A regular solid is a polyhedron in which all faces are congruent regular polygons and all vertices are incident with the same number of faces. There are five such solids, and they are illustrated in Figure 5.1; their structure is given in Table 5.1. The reader interested in making models of these polyhedra should consult Cundy and Rollett [28]. Given any polyhedron, we can construct its dual polyhedron in the following way. The vertices of the dual are the centers of the faces of the original polyhedron. Two centers are joined by an edge if the corresponding faces meet in
Tetrahedron
Cube
Octahedron
Figure 5.1.
Dodecahedron
Icosahedron
Regular solids.
TABLE 5.1. Regular Solids Polyhedron Tetrahedron Cube Octahedron Dodecahedron Icosahedron
Number of Number of Number of Vertices Edges Faces 4 8 6 20 12
6 12 12 30 30
4 6 8 12 20
Faces
Number of Faces at Each Vertex
Triangles Squares Triangles Pentagons Triangles
3 3 4 3 5
PROPER ROTATIONS OF REGULAR SOLIDS
113
an edge. The dual of a regular tetrahedron is another regular tetrahedron. The dual of a cube is an octahedron, and the dual of an octahedron is a cube. The dodecahedron and icosahedron are also duals of each other. Any symmetry of a polyhedron will induce a symmetry on its dual and vice versa. Hence dual polyhedra will have the same rotation group. Theorem 5.11. The group of proper rotations of a regular tetrahedron is isomorphic to A4 . Proof. Label the vertices of the tetrahedron 1, 2, 3, and 4. Then any rotation of the tetrahedron will permute these vertices. So if G is the rotation group of the tetrahedron, we have a group morphism f : G → S4 whose kernel contains only the identity element. Hence, by the morphism theorem, G is isomorphic to Imf . We can use Theorem 4.40 to count the number of elements of G. The stabilizer of the vertex 1 is the set of elements fixing 1 and is {(1), (234), (243)}. The vertex 1 can be taken to any of the four vertices under G, so the orbit of 1 is the set of four vertices. Hence |G| = |Stab 1| |Orb 1| = 3.4 = 12. There are two types of nontrivial elements in G that are illustrated in Figures 5.2 and 5.3. There are rotations of order 3 about axes, each of which joins a vertex to the center of the opposite face. These rotations perform an even permutation of the vertices because each fixes one vertex and permutes the other three cyclically. There are also rotations of order 2 about axes, each of which joins the midpoints of a pair of opposite edges. (Two edges in a tetrahedron are said to be opposite if they do not meet.) The corresponding permutations interchange two pairs of vertices and, being products of two transpositions, are even. Hence Imf consists of 12 permutations, all of which are even, and Imf = A4 . The alternating group A4 is sometimes called the tetrahedral group. There are many different ways of counting the number of elements of the rotation group G of the tetrahedron. One other way is as follows. Consider the tetrahedron sitting on a table, and shade in an equilateral triangle on the table where the bottom face rests, as in Figure 5.4. Any symmetry in G can be performed by picking up the tetrahedron, turning it, and replacing it on the table so that one face of the tetrahedron lies on top of the shaded equilateral triangle. Any of the four faces of the tetrahedron can be placed on the table, and each face can be placed on top of the shaded triangle in three different ways.
2
2 4
4 1
1
Figure 5.2.
3
3
Element (2 3 4).
Figure 5.3.
Element (1 2) Ž (3 4).
114
5
SYMMETRY GROUPS IN THREE DIMENSIONS
Figure 5.4
Hence |G| = 4 · 3 = 12. This really corresponds to applying Theorem 4.40 to the stabilizer and orbit of a face of the tetrahedron. Theorem 5.12. The group of proper rotations of a regular octahedron and cube is isomorphic to S4 . Proof. The regular octahedron is dual to the cube, so it has the same rotation group. There are four diagonals in a cube that join opposite vertices. Label these diagonals 1, 2, 3, and 4 as in Figure 5.5. Any rotation of the cube will permute these diagonals, and this defines a group morphism f : G → S4 , where G is the rotation group of the cube. The stabilizer of any vertex of the cube is a cyclic group of order 3 that permutes the three adjacent vertices. The orbit of any vertex is the set of eight vertices. Hence, by Theorem 4.40, |G| = 3 · 8 = 24. Consider the rotation of order 2 about the line joining A to A in Figure 5.5. The corresponding permutation is the transposition (12). Similarly, any other transposition is in Imf . Therefore, by Proposition 3.35, Imf = S4 . By the morphism theorem, G/Kerf ∼ = S4 and |G|/|Kerf | = |S4 |. Since |G| = |S4 | = 24, it follows that |Kerf | = 1, and f is an isomorphism. The symmetric group S4 is sometimes called the octahedral group. Theorem 5.13. The group of proper rotations of a regular dodecahedron and a regular icosahedron is isomorphic to A5 . Proof. A regular dodecahedron is dual to the icosahedron, so it has the same rotation group.
2
1
A
4
3 3
4 1
Figure 5.5.
A′
2
Diagonals of the cube.
PROPER ROTATIONS OF REGULAR SOLIDS
115
There are 30 edges of an icosahedron, and there are 15 lines through the center joining the midpoints of opposite edges. (The reflection of each edge in the center of the icosahedron is a parallel edge, called the opposite edge.) Given any one of these 15 lines, there are exactly two others that are perpendicular both to the first line and to each other. We call three such mutually perpendicular lines a triad. The 15 lines fall into five sets of triads. Label these triads 1, 2, 3, 4, and 5. Figure 5.6 shows the top half of an icosahedron, where we have labeled the endpoints of each triad. (The existence of mutually perpendicular triads and the labeling of the diagram can best be seen by actually handling a model of the icosahedron.) A rotation of the icosahedron permutes the five triads among themselves, and this defines a group morphism f : G → S5 , where G is the rotation group of the icosahedron. The stabilizer of any vertex of the icosahedron is a group of order 5 that cyclically permutes the five adjacent vertices. The orbit of any vertex is the set of all 12 vertices. Hence, by Theorem 4.40, |G| = 5 · 12 = 60. There are three types of nontrivial elements in G. There are rotations of order 5 about axes through a vertex. The rotations about the vertex A in Figure 5.6 correspond to multiples of the cyclic permutation (12345), all of which are even. There are rotations of order 3 about axes through the center of a face. The rotations about an axis through the point B, in Figure 5.6, are multiples of (142) and are therefore even permutations. Finally, there are rotations of order 2 about the 15 lines joining midpoints of opposite edges. The permutation corresponding to a rotation about an axis through C, in Figure 5.6, is (23) Ž (45), which is even. Every 3-cycle occurs in the image of f so, by Proposition 3.37, Imf = A5 . Since G and A5 both have 60 elements, the morphism theorem implies that G is isomorphic to A5 . The alternating group A5 is sometimes called the icosahedral group.
3
1 4
5
C 1
3
2
A 4 5
5 4
2 3
2 3
1
Figure 5.6.
5
4 B
2
1
Ends of the triads of the icosahedron.
116
5
SYMMETRY GROUPS IN THREE DIMENSIONS
FINITE ROTATION GROUPS IN THREE DIMENSIONS We now proceed to show that the only finite proper rotation groups in three dimensions are the three symmetry groups of the regular solids, A4 , S4 , and A5 together with the cyclic and dihedral groups, Cn and Dn . The unit sphere S 2 = {x ∈ R3 ||x|| = 1} is mapped to itself by every element of O(3). Every rotation group fixing the origin is determined by its action on the unit sphere S 2 . By Theorem 5.10, every nonidentity element A ∈ SO(3) leaves precisely two antipodal points on S 2 fixed. That is, there exists x ∈ S 2 such that A(x) = x and A(−x) = −x. The points x and −x are called the poles of A. Let P be the set of poles of the nonidentity elements of a finite subgroup G of SO(3). Proposition 5.14. G acts on the set, P , of poles of its nonidentity elements. Proof. We show that G permutes the poles among themselves. Let A, B, be nonidentity elements of G, and let x be a pole of A. Then (BAB −1 )B(x) = BA(x) = B(x), so that B(x) is a pole of BAB −1 . Therefore, the image of any pole is another pole, and G acts on the set of poles. We classify the rotation groups by considering the number of elements in the stabilizers and orbits of the poles. Recall that the stabilizer of a pole x, Stab x = {A ∈ G|A(x) = x}, is a subgroup of G, and that the orbit of x, Orb x = {B(x)|B ∈ G}, is a subset of the set P of poles. In Table 5.2 we look at the stabilizers and orbits of the poles of the rotation groups we have already discussed. TABLE 5.2. Poles of the Finite Rotation Groups Group G = Cn |G | = n Symmetries of n -agonal cone Looking down on the pole, x |Stab x| = |Orb x| =
n 1
Group G = S4 |G | = 24 Symmetries of cube
Dn 2n n -agonal cylinder
n 1
2 n
or octahedron
A4 12 tetrahedron
n 2
2 n
2 6
A5 60 dodecahedron
3 4
or icosahedron
Looking down on the pole, x
|Stab x| |Orb x|
= =
or
or
or
or
or
or
2 12
3 8
4 6
2 30
3 20
5 12
3 4
FINITE ROTATION GROUPS IN THREE DIMENSIONS
117 x
x
x
Rotation:
2p 4p or 3 3
p
Looking down on the pole x:
x
Order of the rotation:
2
p or p 2
x
x 3
Figure 5.7.
4 or 2
Rotations of the cube.
We take Cn to be the rotation group of a regular n-agonal cone whose base is a regular n-gon. (The sloping edges of the cone must not be equal to the base edges if n = 3.) Dn is the rotation group of a regular n-agonal cylinder whose base is a regular n-gon. (The vertical edges must not be equal to the base edges if n = 4.) Each stabilizer group, Stab x, is a cyclic subgroup of rotations of the solid about the axis through x. The orbit of x, Orb x, is the set of poles of the same type as x. As a check on the number of elements in the stabilizers and orbits, we have |G| = |Stab x||Orb x| for each pole x. For example, the cube has three types of poles and four types of nontrivial elements in its rotation group; these are illustrated in Figure 5.7. Theorem 5.15. Any finite subgroup of SO(3) is isomorphic to one of Cn (n 1), Dn (n 2), A4 , S4 or A5 . Proof. Let G be a finite subgroup of SO(3). Choose a set of poles x1 , . . . , xr , one from each orbit. Let pi = |Stab xi | and qi = |Orb xi |, so that pi qi = n = |G|. Each nonidentity element of G has two poles; thus the total number of poles, counting repetitions, is 2(n − 1). The pole xi occurs as a pole of a nonidentity element pi − 1 times. There are qi poles of the same type as xi . Therefore, the total number of poles, counting repetitions, is 2(n − 1) =
r i=1
so
qi (pi − 1) =
r
(n − qi ),
i=1
r 2 1 2− = 1− . n pi i=1
(∗)
118
5
SYMMETRY GROUPS IN THREE DIMENSIONS
2 < 2. Since xi is a pole of n some nonidentity element, Stab xi contains a nonidentity element, and pi 2. 1 1 Therefore, 1 − < 1. It follows from (*) that the number of orbits, r, must 2 pi be 2 or 3. If there are just two orbits, it follows that If G is not the trivial group, n 2 and 1 2 −
2−
2 1 1 +1− =1− n p1 p2
n n + = q1 + q2 . Hence q1 = q2 = 1, and p1 = p2 = n. This means p1 p2 that x1 = x2 , and there is just one axis of rotation. Therefore, G is isomorphic to the cyclic group Cn . If there are three orbits, it follows that and 2 =
2−
2 1 1 1 +1− +1− =1− n p1 p2 p3
1+
1 2 1 1 = + + . n p1 p2 p3
(**)
Suppose that p1 p2 p3 . If p1 3, we would have 1 1 1 1 1 1 + + + + = 1, p1 p2 p3 3 3 3 n 2 which is a contradiction, since > 0. Hence p1 = 2 and q1 = . n 2 1 1 1 2 1 1 2 1 Now 1 + = + + , so + = + . If p2 4, we would n 2 p2 p3 2 n p2 p3 1 2 1 1 1 1 have + + = , which is a contradiction, since > 0. Hence p2 p2 p3 4 4 2 n is 2 or 3. The only possibilities are the following. n n n Case (i). p1 = 2, p2 = 2, p3 = , n is even and n 4, q1 = , q2 = , and 2 2 2 q3 = 2. Case (ii). p1 = 2, p2 = 3, p3 = 3, n = 12, q1 = 6, q2 = 4, and q3 = 4. Case (iii). p1 = 2, p2 = 3, p3 = 4, n = 24, q1 = 12, q2 = 8, and q3 = 6. Case (iv). p1 = 2, p2 = 3, p3 = 5, n = 60, q1 = 30, q2 = 20, and q3 = 12. If p2 = 2 and p3 6, 2 > 0. n
1 1 1 1 1 + + = , which contradicts (**), since p2 p3 3 6 2
FINITE ROTATION GROUPS IN THREE DIMENSIONS
119
Case (i). Let H = Stab x3 . This is a group of rotations about one axis, and it is a cyclic group of order n/2. Any other element A that is not in H is of order 2 and is a half turn. Therefore, G = H ∪ H A, and G is isomorphic to Dn/2 of order n. Case (ii). Let y1 , y2 , y3 , and y4 be the four poles in Orb x2 . Now p2 = |Stab yi | = 3; thus Stab y1 permutes y2 , y3 , and y4 as in Figure 5.8. Therefore, ||y2 − y1 || = ||y3 − y1 || = ||y4 − y1 ||. We have similar results for Stab y2 and Stab y3 . Hence y1 , y2 , y3 , and y4 are the vertices of a regular tetrahedron, and G is a subgroup of the symmetries of this tetrahedron. Since |G| = 12, G must be the whole rotation group, A4 . Case (iii). Let y1 , y2 , . . . , y6 be the six poles in Orb x3 . Since p3 = 4, a rotation in Stab yi must fix two of the poles and rotate the other four cyclically. Hence y1 , y2 , . . . , y6 must lie at the vertices of a regular octahedron. Again, since |G| = 24, G must be the whole rotation group, S4 , of this octahedron. Case (iv). Let y1 , y2 , . . . , y12 be the 12 poles in Orb x3 . Any element of order 5 in G must permute these poles and hence must fix two poles and permute the others, as in Figure 5.9, in two disjoint 5-cycles, say 2 3 4 5 6 Ž 7 8 9 10 11 , where we denote the pole yi by i. The points y2 , y3 , y4 , y5 , and y6 form a regular pentagon and their distances from y1 are all equal. Using similar results for rotations of order 5 about the other poles, we see that the poles are the vertices of an icosahedron, and the group G is the proper rotation group, A5 , of this icosahedron. Throughout this section we have considered only proper rotations. However, if we allow improper rotations as well, it can be shown that a finite subgroup
y2
y1
y3
y4
Stab y1
Figure 5.8
8
2 7
3 6
9 11
12 10
4 5
Figure 5.9
1
Stab y1
120
5
SYMMETRY GROUPS IN THREE DIMENSIONS
of O(3) is isomorphic to one of the groups in Theorem 5.15 or contains one of these groups as a normal subgroup of index 2. See Coxeter [27, Sec. 15.5] for a more complete description of these improper rotation groups. CRYSTALLOGRAPHIC GROUPS This classification of finite symmetries in R3 has important applications in crystallography. Many chemical substances form crystals and their structures take the forms of crystalline lattices. A crystal lattice is always finite, but in order to study its symmetries, we create a mathematical model by extending this crystal lattice to infinity. We define an ideal crystalline lattice to be an infinite set of points in R3 of the form n1 a1 + n2 a2 + n3 a3 , where a1 , a2 , and a3 form a basis of R3 and n1 , n2 , n3 ∈ Z. Common salt forms a cubic crystalline lattice in which a1 , a2 , and a3 are orthogonal vectors of the same length. Figure 5.10 illustrates a crystalline lattice. This use of the term lattice is not the same as that in Chapter 2, where a lattice referred to a special kind of partially ordered set. To avoid confusion, we always use the term crystalline lattice here. A subgroup of O(3) that leaves a crystalline lattice invariant is called a crystallographic point group. This is a finite subgroup of O(3) because there are only a finite number of crystalline lattice points that can be the images of a1 , a2 , and a3 when the origin is fixed. However, not all finite subgroups of O(3) are crystallographic point groups. Suppose that A ∈ SO (3) leaves a crystalline lattice L invariant. Then, by Theorem 5.10, A is a rotation through an angle θ , and the trace of A is 1 + 2 cos θ . If we choose a basis for R3 consisting of the vectors a1 , a2 , a3 of the crystalline lattice L, the matrix representing A will have integer entries. The trace is invariant under change of basis, so the trace of A must be an integer. Hence 2 cos θ
a3
a2
a1 Figure 5.10.
Crystalline lattice.
EXERCISES
121
must be integral, and θ must be either kπ/2 or kπ/3, where k ∈ Z. It follows that every element of a crystallographic point group in SO(3) can only contain elements of order 1, 2, 3, 4, or 6. It can be shown that every crystallographic point group in SO(3) is isomorphic to one of C1 , C2 , C3 , C4 , C6 , D2 , D3 , D4 , D6 , A4 , or S4 . If we allow reflections, the only other such groups in O(3) must contain one of these groups as a normal subgroup of index 2. Every one of these groups occurs in nature as the point group of at least one chemical crystal. See Coxeter [27, Sec. 15.6] or Lomont [31, Chap. 4, Sec. 4].
EXERCISES Find the group of proper rotations and the group of all rotations of the figures in Exercises 5.1 to 5.7. 5.1. 5.2. 5.3. 5.4.
5.5.
5.6.
5.7.
5.8. Let G be the subgroup of O(2) isomorphic to Dn . Find two matrices A and B so that any element of G can be written as a product of A’s and B’s. 5.9. What is the group of proper rotations of a rectangular box of length 3 cm, depth 2 cm, and height 2 cm? Find the proper rotation group of the 13 Archimedean solids in Exercises 5.10 to 5.22. All the faces of these solids are regular polygons and all the vertices are similar. (See Cundy and Rollet [28] for methods on how to construct these solids.) 5.10.
5.11.
5.12.
5.13.
5.14.
5.15.
5.16.
5.17.
5.18.
5.19.
122
5
5.20.
SYMMETRY GROUPS IN THREE DIMENSIONS
5.21.
5.22.
5.23. It is possible to inscribe five cubes in a regular dodecahedron. One such cube is shown in Figure 5.11. Use these cubes to show that the rotation group of the dodecahedron is A5 .
Figure 5.11.
Cube inside a dodecahedron.
5.24. What is the proper symmetry group of a cube in which three faces, coming together at one vertex, are painted green and the other faces are red? 5.25. Find the group of all rotations (both proper and improper) of a regular tetrahedron. 5.26. Let G be the full symmetry group of the cube. Define f : G → S4 as in Theorem 5.12. Find the kernel of f and the order of G. 5.27. Let the vertices of a tetrahedron be (1, 1, 1), (−1, −1, 1), (−1, 1, −1), and (1, −1, −1). Find matrices in SO(3) of orders 2 and 3 that leave the tetrahedron invariant. 5.28. Let the vertices of a cube be (±1, ±1, ±1). Find matrices in SO(3) of orders 2, 3, and 4 that leave the cube invariant. Find the symmetry groups of the chemical molecules in Exercises 5.29 to 5.31. (Assume that all of the C-C bonds are equivalent.) 5.29.
H H
C
C
C
C
C H
5.30.
H C H
Benzene
H
CH3 H
C
C
C
C
C H
5.31.
CH3 C H
Xylene
H
H NO2
NO2 C
C
C
C
C H
C
CH3
NO2
Trinitrotoluene (TNT)
EXERCISES
123
Find matrices in SO(3) that preserve the crystalline lattices described in Exercises 5.32 to 5.34, and find their crystallographic point groups. The points of the crystalline lattice are n1 a1 + n2 a2 + n3 a3 , where ni ∈ Z and the basis vectors ai are given below. 5.32. 5.33. 5.34. 5.35.
a1 = (1, 1, 0), a2 = (−1, 1, 0), a3 = (0, 1, 1). a1 = (1, 0, 0), a2 = (0, 1, 0), a3 = (0, 0, 2). √ √ a1 = (1, 0, 0), a2 = (0, −3 3, 3), a3 = (0, 3 3, 3). Let G(n) denote the group of linear isometries of Rn . (a) Show that E(n) = T (n)G(n) = G(n)T (n), where the product of subgroups is as defined in Exercise 4.43. (b) Show that T (n) ∩ G(n) = {1Rn }. (c) Use parts (a) and (b) to prove that E(n)/T (n) ∼ = G(n).
6 ´ POLYA–BURNSIDE METHOD OF ENUMERATION
This chapter provides an introduction to the P´olya–Burnside method of counting the number of orbits of a set under the action of a symmetry group. If a group G acts on a set X and we know the number of elements of X, this method will enable us to count the number of different types of elements of X under the action of G. For example, how many different chemical compounds can be obtained by attaching a CH3 or H radical to each carbon atom in the benzene ring of Figure 6.3? There are 26 different ways of attaching a CH3 or H radical on paper, but these do not all give rise to different compounds because many are equivalent under a symmetry. There are six different ways of attaching one CH3 radical and five H radicals, but they all give rise to the same compound. The dihedral group D6 acts on the 26 ways of attaching the radicals, and the number of different compounds is the number of orbits under the action of D6 , that is, the number of formulas that cannot be obtained from each other by any rotation or reflection. We have seen that the number of different switching circuits that can be n obtained with n switches is 22 . This number grows very quickly as n becomes large. Table 2.11 gives the 16 switching functions of two variables; when n = 3, there are 256 different circuits, and when n = 4, there are 65,536 different circuits. However, many of these circuits are equivalent if we change the labels of n the switches. That is, the symmetric group, Sn , acts on the 22 different circuits by permuting the labels of the switches. The number of nonequivalent circuits is the number of orbits under the action of Sn . BURNSIDE’S THEOREM Let G be a finite group that acts on a finite set X. The following theorem describes the number of orbits in terms of the number of elements left fixed Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc. 124
BURNSIDE’S THEOREM
125
by each element of G. It was first proved by W. Burnside in 1911 and was called Burnside’s lemma; it was not until 1937 that its applicability to many combinatorial problems was discovered by G. P´olya. Theorem 6.1. Burnside’s Theorem. Let G be a finite group that acts on the elements of a finite set X. For each g ∈ G, let Fix g = {x ∈ X|g(x) = x}, the set of elements of X left fixed by g. If N is the number of orbits of X under G, then 1 N= | Fix g|. |G| g∈G Proof. We count the set S = {(x, g) ∈ X × G|g(x) = x} in two different ways. Consider Table 6.1, whose columns are indexed by the elements of X and whose rows are indexed by the elements of G. Put a value of 1 in the (x, g) position if g(x) = x; otherwise, let the entry be 0. The sum of the entries in row g is the number |Fix g| of elements left fixed by g. The sum of the entries in column x is |Stab x|, the number of elements of G that fix x. We can count the number of elements of S either by totaling the row sums or by totaling the column sums. Hence |Fix g| = |Stab x|. |S| = g∈G
x∈X
Choose a set of representatives, x1 , x2 , . . . , xN , one from each orbit of X under G. If x is in the same orbit as xi , then Orb x = Orb xi , and by Theorem 4.40, |Stab x| = |Stab xi |. Hence g∈G
|Fix g| =
N ·
N
|Stab x| =
i=1 x∈Orb xi
|Orb xi ||Stab xi | = N · |G|
i=1
by Theorem 4.40. The theorem now follows. TABLE 6.1. Elements of S Correspond to the 1’s in This Table Elements of X x
Elements of G
g
. . .1
Column → Sums
0
1
1
.. . 1 1 0 .. .
0. . .
|Stab x|
Row Sums ↓
|Fix g|
126
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
NECKLACE PROBLEMS Example 6.2. Three black and six white beads are strung onto a circular wire. This necklace can be rotated in its plane, and turned over. How many different types of necklaces can be made assuming that beads of the same color are indistinguishable? Solution. Position the three black and six white beads at the vertices of a regular 9-gon. If the 9-gon is fixed, there are 9 · 8 · 7/3! = 84 different ways of doing this. Two such arrangements are equivalent if there is an element of the symmetry group of the regular 9-gon, D9 , which takes one arrangement into the other. The group D9 permutes the different arrangements, and the number of nonequivalent arrangements is the number, N , of orbits under D9 . We can now use the Burnside theorem to find N . Table 6.2 lists all the different types of elements of D9 and the number of fixed points for each type. For example, consider the reflection g ∈ D9 about the line joining vertex 2 to the center of the circle, which is illustrated in Figure 6.1. Then the arrangements that are fixed under g occur when the black beads are at vertices 1 2 3, 9 2 4, 8 2 5, or 7 2 6. Hence |Fix g| = 4. There are nine reflections about a line, one through each vertex. Therefore, the total number of fixed points contributed by these types of elements is 9 · 4 = 36. A rotation of order 3 in D9 will fix an arrangement if the black beads are at vertices 1 4 7, 2 5 8, or 3 6 9; hence there are three arrangements that are fixed. If an arrangement is fixed under a rotation of order 9, all the beads must be the same color; hence |Fix g| = 0 if g has order 9. Table 6.2 shows that the sum of all the numbers of 1 126 fixed points is 126. By Theorem 6.1, N = = 7, and |Fix g| = |D9 | g∈D9 18 there are seven different types of necklaces. In this example, it is easy to determine all the seven types. They are illustrated in Figure 6.2.
TABLE 6.2. Action of D9 on the Necklaces Type of Element, g ∈ D9 Identity Reflection about a line Rotation through 2π/3 or 4π/3 Other rotations
Order of g
Number, s, of Such Elements
|Fix g|
s · |Fix g|
1 2 3 9
1 9 2 6
84 4 3 0
84 36 6 0
= 126
NECKLACE PROBLEMS
127 1
9
2 3
8 7
4 5
6
g
Figure 6.1.
D9 acting on the necklace.
Figure 6.2.
Seven types of necklaces.
5
6 C
––––––– 4 g
C
C
C C
3
Figure 6.3.
1 ––––
C 2
Benzene ring.
TABLE 6.3. Action of D6 on the Compounds Type of Element, g ∈ D6 Identity Reflection in a line through opposite vertices [e.g., (26) Ž (35) Ž (1) Ž (4)] Reflection in a line through midpoints of opposite sides [e.g., (56) Ž (14) Ž (23)] Rotation through ±π/3 [e.g., (123456)] Rotation through ±2π/3 [e.g., (135) Ž (246)] Rotation through π, (14) Ž (25) Ž (36)
Order of g
Number, s, of Such Elements
|Fix g|
s · |Fix g|
1 2
1 3
26 24
64 48
2
3
23
24
6
2
2
4
3
2
22
8
2
1
23
8
|D6 | = 12
= 156
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
128
Example 6.3. Find the number of different chemical compounds that can be obtained by attaching CH3 or H radicals to a benzene ring. Solution. The carbon atoms are placed at the six vertices of a regular hexagon, and there are 26 ways of attaching CH3 or H radicals. The dihedral group D6 acts on these 26 ways, and we wish to find the number of orbits. Consider a reflection, g, about a line through opposite vertices. The order of g is 2, and there are three such reflections, through the three opposite pairs of vertices. |Fix g| can be determined by looking at Figure 6.3. If a configuration is fixed by g, the radical in place 2 must be the same as the radical in place 6, and also the radicals in places 3 and 5 must be equal. Hence the radicals in places 1, 2, 3, and 4 can be chosen arbitrarily, and this can be done in 24 ways. The number of configurations left fixed by each element of D6 is given in Table 6.3. To check that we have not omitted any elements, we add the column containing the numbers of elements, and this should equal the order of the group D6 . It follows from the Burnside theorem that the number of orbits is 156/|D6 | = 156/12 = 13. Hence there are 13 different types of molecules obtainable. COLORING POLYHEDRA Example 6.4. How many ways is it possible to color the vertices of a cube if n colors are available? Solution. If the cube is fixed, the eight vertices can each be colored in n ways, giving a total of n8 colorings. The rotation group of the cube, S4 , permutes these colorings among themselves, and the number of orbits is the number of distinct colorings taking the rotations into account. We can calculate the number of orbits using the Burnside theorem. There are five types of elements in the rotation group of the cube. We take an element g of each type and determine the vertices that must have the same color in order that the coloring be invariant under g. Figure 6.4 illustrates the different types of rotations; vertices that have to have the same color are shaded in the same way. Table 6.4 gives the number of fixed colorings, with column totals. By the Burnside theorem, the number of orbits and hence the number of colorings is 1 1 |Fix g| = 24 (n8 + 17n4 + 6n2 ). |S4 | g∈S 4
p 2p/3
g1
g2 Figure 6.4.
g3
p/2
Types of rotations of the cube.
g4
p
COLORING POLYHEDRA
129
TABLE 6.4. Colorings of the Vertices of the Cube Type of Element, gi (Figure 6.4) Identity g1 g2 g3 g4
Order of gi
Number, s, of Such Elements
Number, r, of Choices of Colors
|Fix gi | Which Is nr
s · |Fix gi |
1 2 3 4 2
1 6·1=6 4·2=8 3·2=6 3·1=3
8 4 4 2 4
n8 n4 n4 n2 n4
n8 6n4 8n4 6n2 3n4
|S4 | = 24
n8 + 17n4 + 6n2
This shows, incidentally, that n8 + 17n4 + 6n2 is divisible by 24 for all n ∈ P. Example 6.5. In how many ways is it possible to color a regular dodecahedron so that five of its faces are black and the other seven are white? Solution. The number of ways† of choosing five faces of a fixed dodecahedron 12 · 11 · 10 · 9 · 8 12 = to be colored black is = 792. 5 5! The different types of elements in the rotation group, A5 , of the dodecahedron are shown in Figure 6.5. The numbers of elements of a given type, in Table 6.5, are calculated as follows. An element of order 3 is a rotation about an axis through opposite vertices. Since there are 20 vertices, there are ten such axes. There are two nonidentity rotations of order 3 about each axis; thus the total number of elements of order 3 is 10 · 2 = 20. The elements of orders 2 and 5 can be counted in a similar way. If g2 ∈ A5 is of order 3, we can calculate |Fix g2 | as follows. The element g2 does not fix any face and permutes the faces in disjoint 3-cycles. Now five black faces cannot be permuted by disjoint 3-cycles without fixing two faces, so |Fix g2 | = 0. Similarly, |Fix g1 | = 0 if g1 is a 2-cycle. If g3 is of order 5, then g3 is a rotation about an axis through the centers of two opposite faces, and these two faces are fixed. The other ten faces are permuted in two disjoint 5-cycles; either of these 5-cycles can be black; thus |Fix g3 | = 2. It follows from Table 6.5 and from the Burnside theorem that the number of different colorings is 840/60 = 14. Any face coloring of the dodecahedron corresponds to a vertex coloring of its dual, the icosahedron. †
A set of n elements has
coefficient.
n! n n is the binomial subsets of k n elements where = k k k!(n − k)!
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
130
g1
g2
Figure 6.5.
g3
Types of rotations of a dodecahedron.
TABLE 6.5. Colorings of the Dodecahedron Type of Element, gi (Figure 6.5)
Order of gi
Number, s, of Such Elements
|Fix gi |
s · |Fix gi |
1 2 3 5
1 15 10 · 2 = 20 6 · 4 = 24
792 0 0 2
792 0 0 48
Identity g1 g2 g3
|A5 | = 60
= 840
COUNTING SWITCHING CIRCUITS The Burnside theorem can still be applied when the sets to be enumerated do not have any geometric symmetry. In this case, the symmetry group is usually the full permutation group Sn . Consider the different switching circuits obtained by using three switches. We can think of these as black boxes with three binary inputs x1 , x2 , and x3 and one binary output f (x1 , x2 , x3 ), as in Figure 6.6. Two circuits, f and g, are called equivalent if there is a permutation π of the variables so that f (x1 , x2 , x3 ) = g(xπ1 , xπ2 , xπ3 ). Equivalent circuits can be obtained from each other by just permuting the wires outside the black boxes, as in Figure 6.7.
x1 x2
f (x 1, x 2, x 3)
f
x3
Figure 6.6.
Switching circuit.
x1 f
x2
f (x 2, x 3, x 1)
x3
Figure 6.7.
Permutation of the inputs.
COUNTING SWITCHING CIRCUITS
131
Example 6.6. Find the number of switching circuits using three switches that are not equivalent under permutations of the inputs. Solution. There are eight possible inputs using three binary variables and hence there are 28 = 256 circuits to consider. The symmetric group S3 acts on these 256 circuits, and we wish to find the number of different equivalence classes, that is, the number of orbits. Table 6.6 lists the number of circuits left fixed by the different types of elements in S3 . For example, if the switching function f (x1 , x2 , x3 ) is fixed by the transposition (12) of the input variables, then f (0, 1, 0) = f (1, 0, 0) and f (0, 1, 1) = f (1, 0, 1). The values of f for the inputs (0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 1, 0), and (1, 1, 1) can be chosen arbitrarily in 26 ways. By Burnside’s theorem and Table 6.6, the number of nonequivalent circuits is 480/|S3 | = 480/6 = 80. However, this number can be reduced further if we allow permutations and complementation of the three variables. In a circuit consisting of two-state switches, the variable xi can be complemented by simply reversing each of the switches controlled by xi . The resulting circuit is just as simple and the cost is the same as the original one. In transistor networks, we can just permute the input wires and add NOT gates as in Figure 6.8. The eight input values of a three-variable switching circuit can be considered as the vertices of a three-dimensional cube, as shown in Figure 6.9. The six faces of this cube are defined by the equations x1 = 0, x1 = 1, x2 = 0, x2 = 1, x3 = 0, x3 = 1. The group that permutes and complements the variables takes each face to another face and takes opposite faces to opposite faces. Hence the group is the complete symmetry group, G, of the cube. There is a morphism ψ: G → {1, −1}, TABLE 6.6. Action of S3 on the Inputs of the Switches Type of Element, g ∈ S3 Identity Transposition 3-Cycle
Number, s, of Such Elements
|Fix g|
s · |Fix g|
1 3 2
28 26 24
28 = 256 3 · 26 = 192 2 · 24 = 32
|S3 | = 6
x1
NOT
x2 x3
NOT
480
f
Figure 6.8.
f (x 2, x 1′, x 3′ )
Permutation and complementation of inputs.
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
132
111
011
101 010
001
110
100
000
Figure 6.9.
Cube of input values.
which sends proper rotations to 1 and improper rotations to −1; the kernel of ψ is the group of proper rotations of the cube which, by the morphism theorem, must be a normal subgroup of index 2. Therefore, the order of G is 2 · 24 = 48. Example 6.7. Find the number of switching circuits involving three switches that are nonequivalent under permutation and complementation of the variables. Solution. Each boolean function in three variables defines a coloring of the vertices of the cube of input values. A vertex is colored black if the function is 1 for the corresponding input value. It is colored white if the function takes the value 0 at that input value. We can represent the complete symmetry group, G, of the cube by means of permutations of the vertices labeled 0, 1, 2, 3, 4, 5, 6, 7 in Figure 6.10. Since the group of proper rotations of the cube is a normal subgroup of index 2 in G, every element of G can be written as a proper rotation π or as π Ž ρ, where ρ is the reflection of the cube in its center. There are 28 different switching functions of three variables, and Table 6.7 describes the number of circuits that are fixed by the action of each element of the group G on the eight inputs. For example, consider the element g = (01) Ž (67) Ž (34) Ž (25). If a switching function f is fixed under the action of g, then the images of the input values corresponding to the vertices 0 and 1 must be the same; that is, f (0, 0, 0) = f (0, 0, 1). Similarly, the images of the input values corresponding to the vertices 6 and 7 are the same, and f (1, 1, 0) = f (1, 1, 1). 7 3
6 5 2
1
4 0
Figure 6.10.
Labeling of the cube.
COUNTING SWITCHING CIRCUITS
133
TABLE 6.7. Symmetries of a Cube Acting on the Three-Variable Switching Functions Type of Element, g, in the Symmetry Group of the Cube
Number, s, of Order of g Such Elements |Fix g| s · |Fix g|
Proper rotations Identity Rotation about a line joining midpoints of opposite edges [e.g., (01) Ž (67) Ž (34) Ž (25)] Rotation about a line joining opposite vertices [e.g., (124) Ž (365) Ž (0) Ž (7)] Rotation about a line joining centers of opposite faces [e.g., (0264) Ž (1375)] Rotation about a line joining centers of opposite faces [e.g., (06) Ž (24) Ž (17) Ž (35)]
1 2
1 6
28 24
256 96
3
8
24
128
4
6
22
24
2
3
24
48
2
1
24
16
2
6
26
384
6
8
22
32
4
6
22
24
2
3
24
48
Improper rotations Reflection in the center [ρ = (07) Ž (16) Ž (25) Ž (34)] Reflection in a diagonal plane [e.g., (01) Ž (67) Ž (34) Ž (25) Ž ρ = (06) Ž (17) Ž (2) Ž (3) Ž (4) Ž (5)] Reflection and rotation [e.g., (124) Ž (365) Ž ρ = (07) Ž (154623)] Reflection and rotation [e.g., (0264) Ž (1375) Ž ρ = (0563) Ž (1472)] Reflection in a central plane [e.g., (06) Ž (24) Ž (17) Ž (35) Ž ρ = (01) Ž (23) Ž (45) Ž (67)]
|G| = 48
1056
Also, f (0, 1, 1) = f (1, 0, 0) and f (0, 1, 0) = f (1, 0, 1). Hence the values of f (0, 0, 0), f (1, 1, 0), f (0, 1, 1), and f (0, 1, 0) can be chosen arbitrarily in 24 ways, and |Fix g| = 24 . In general, if the function f is fixed under g, the images of the input values, corresponding to the vertices in any one cycle of g, must be the same. Hence |Fix g| is 2r , where r is the number of disjoint cycles in the permutation representation of g. It follows from Table 6.7 and the Burnside theorem that the number of nonequivalent circuits is 1056/|G| = 1056/48 = 22.
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
134
TABLE 6.8. Number of Types of Switching Functions Number of Switches, n
1
2
3
4
Number of boolean n functions, 22 Nonequivalent functions under permutations of inputs Nonequivalent functions under permutation and complementation of inputs Nonequivalent functions under permutation and complementation of inputs and outputs
4
16
256
65,536
4,294,967,296
4
12
80
3,984
37,333,248
3
6
22
402
1,228,158
2
4
14
222
616,126
5
We can reduce this number slightly more by complementing the function as well as the variables; this corresponds to adding a NOT gate to the output. The group acting is now a combination of a cyclic group of order 2 with the complete symmetry groups of the cube. The numbers of nonequivalent circuits for five or fewer switches given in Table 6.8 can be computed as in Example 6.7. In 1951, the Harvard Computing Laboratory laboriously calculated all the nonequivalent circuits using four switches and the best way to design each of them. It was not until later that it was realized that the P´olya theory could be applied to this problem. In many examples, it is quite difficult to calculate |Fix g| for every element g of the group G. P´olya’s most important contribution to this theory of enumeration was to show how |Fix g| can be calculated, using what are called cycle index polynomials. This saves much individual calculation, and the results on nonequivalent boolean functions in Table 6.8 can easily be calculated. However, it is still a valuable exercise to tackle a few enumeration problems without using cycle index polynomials, since this gives a better understanding of the P´olya theory. For example, we see in Tables 6.3, 6.4, and 6.7 that |Fix g| is always of the form nr , where r is the number of disjoint cycles in g. Further information on the P´olya theory can be obtained from Biggs [15], Lidl and Pilz [10], or Stone [22].
EXERCISES
135
EXERCISES Find the number of different types of circular necklaces that could be made from the sets of beads described in Exercises 6.1 to 6.4, assuming that all the beads are used on one necklace. 6.1. 6.2. 6.3. 6.4. 6.5. 6.6.
6.7.
6.8.
6.9. 6.10. 6.11. 6.12.
Three black and three white beads. Four black, three white, and one red bead. Seven black and five white beads. Five black, six white, and three red beads. How many different circular necklaces containing ten beads can be made using beads of at most two colors? Five neutral members and two members from each of two warring factions are to be seated around a circular armistice table. In how many nonequivalent ways, under the action of D9 , can they be seated if no two members of opposing factions sit next to each other? How many different chemical compounds can be made by attaching H, CH3 , C2 H5 , or Cl radicals to the four bonds of a carbon atom? The radicals lie at the vertices of a regular tetrahedron, and the group is the tetrahedral group A4 . How many different chemical compounds can be made by attaching H, CH3 , or OH radicals to each of the carbon atoms in the benzene ring of Figure 6.3? (Assume that all of the C–C bonds in the ring are equivalent.) How many ways can the vertices of a cube be colored using, at most, three colors? How many ways can the vertices of a regular tetrahedron be colored using, at most, n colors? How many different tetrahedra can be made from n types of resistors when each edge contains one resistor? How many ways can the faces of a regular dodecahedron be colored using, at most, n colors?
Find the number of different colorings of the faces of the solids described in Exercises 6.13 to 6.16. 6.13. 6.14. 6.15. 6.16.
A regular tetrahedron with two white faces and two black faces. A cube with two white, one black, and three red faces. A regular icosahedron with four black faces and 16 white faces. A regular dodecahedron with five black faces, two white faces, and five green faces. 6.17. How many ways can the faces of a cube be colored with six different colors, if all the faces are to be a different color? 6.18. (a) Find the number of binary relations, on a set with four elements, that are not equivalent under permutations of the four elements.
´ 6 POLYA–BURNSIDE METHOD OF ENUMERATION
136
x1 x2 x3
Output
Input plug
Switching device
Figure 6.11
6.19.
6.20. 6.21. 6.22.
Figure 6.12
(b) Find the number of equivalence relations, on a set with four elements, that are not equivalent under permutations of the four elements. How many different patchwork quilts, four patches long and three patches wide, can be made from five red and seven blue squares, assuming that the quilts cannot be turned over? If the quilts in Exercise 6.19 could be turned over, how many different patterns are possible? Find the number of ways of distributing three blue balls, two red balls, and four green balls into three pi