# G = G 0 > G 1 > > G k = {e}

Save this PDF as:

Size: px
Start display at page:

Download "G = G 0 > G 1 > > G k = {e}"

## Transcription

1 Proposition A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same length. (That is to say, the least c such that γ c+1 (G) = {e}, is equal to the least c such that Z c (G) = G.) Proof. 1. Suppose that G has nilpotency class c. Then the lower central series is a central series for G of length c. Now by Proposition 48 we see that γc i+1(g) Z i (G) for all i (taking the different numbering convention for the lower central series into account). In particular, γ 1 (G) Z c (G). But γ 1 (G) = G, and so Z c (G) = G. Suppose conversely that Z k (G) = G for some G. Then the series {G i }, given by G i = Z k i (G) for 0 i k, is a central series for G. So G is nilpotent by Corollary In the proof of part 1 we have seen that if γ c+1 (G) = {e}, then Z c (G) = G. Suppose conversely that Z k (G) = G. Let {G i } be the central series defined in the proof of part 1. By Proposition 46 we have γ k+1 (G) G k = {e}. It follows that the lower central series and the upper central series have the same length. Warning. A group G of nilpotency class c may have a central series of length greater than c. For instance, if G is abelian, then it has class 1; but any chain of subgroups G = G 0 > G 1 > > G k = {e} constitutes a central series, and such a series can be arbitrarily long. Proposition 46 does tell us, however, that no central series can be of length shorter than c. Theorem 50 Every p-group is nilpotent. Proof. Let G be a p-group. For i N, suppose that Z i (G) < G. Since G is finite, there exists k such that Z k (G) = Z k+1 (G). Suppose that Z k (G) G. Then the quotient G/Z k (G) is a non-trivial p-group, and so by Proposition 21 it has a non-trivial centre. But it follows that Z k+1 (G) > Z k (G), and this is a contradiction. So we must have Z k (G) = G, and so G is nilpotent by Proposition Example. We have seen that D 2 a+1 is nilpotent, even though no other dihedral group is. Thus the only nilpotent dihedral groups are 2-groups. Proposition 51. Let G be nilpotent of class c. 1. Any subgroup H of G is nilpotent of class at most c. 2. If N G, then G/N is nilpotent of class at most c. 3. If H is nilpotent of class d then G H is nilpotent of class max(c,d). 32

2 Proof. 1. Let H G. It is easy to show inductively that γ i (H) γ i (G) for all i. So γ c+1 (H) = {e}. 2. Let θ : G G/N be the canonical map. It is easy to show inductively that θ(γ i (G)) = γ i (G/N) for all i N. So γ c+1 (G/N) = {e G/N }. 3. We note that [(g 1,h 1 ),(g 2,h 2 )] = ([g 1,g 2 ],[h 1,h 2 ]) for all g 1,g 2 G and h 1,h 2 H. So γ i (G H) = γ i (G) γ i (H) for all i, and the result follows. Example. Let G = a ϕ b, where a has order 12, b has order 2, and ϕ b (a) = a 7. We show that G is nilpotent. We note that a = a 3 a 4 (as an internal direct product), and that ϕ b (a 3 ) = a 3, while ϕ b (a 4 ) = a 4. It follows that a 4 is central in G, and hence that G = ( a 3 b ) a 4 = D 8 C 3. Now both D 8 and C 3 are nilpotent, and so G is nilpotent. Proposition 52. If G is a finite nilpotent group, and H is a proper subgroup of G, then N G (H) H. Proof. Let c be the nilpotency class of G. Since γ 1 (G) = G, and γ c+1 (G) = {e}, there exists j such that γ j (G) H, but γ j+1 (G) H. Since γ j (G) is normal in G we see that γ j (G)H is a subgroup of G. Now H/γ j+1 (G) is certainly normal in the abelian group γ j (G)/γ j+1 (G), and so H is normal in γ j (G)H. So we have H < γ j (G)H N G (H), hence the result. Example. Let G = D 16. Every subgroup H of rotations is normal in G, and so N G (H) = G. Let a be a rotation of order 8, and let b be a reflection. Then we see that b a 4,b a 2,b G, since each of the subgroups in the chain has index 2 in the next. Every subgroup of G is either a rotation subgroup, or else one of the subgroups in the chain above (for some reflection b), and so we see that every proper subgroup of G is normalized by a strictly larger subgroup. Lemma 53 (Frattini Argument). Let G be a finite group, and K a normal subgroup. Let P be a Sylow p-subgroup of K. Then G = KN G (P). Proof. Let g G. Then () g P K since K is normal, and so g P Syl p (K). Since any two Sylow p- subgroups of K are conjugate in K, we have g P = k P for some k K. But now it is clear that k 1g P = P, and g = k(k 1 g) KN G (P). 33

3 Corollary 54. Let G be a finite group, and let P be a Sylow p-subgroup of G. Then N G (N G (P)) = N G (P). Proof. Since N G (P) is a normal subgroup of N G (N G (P)), and since P Syl p (N G (P)), the Frattini Argument tells us that N G (N G (P)) = N G (P)N NG (N G (P))(P). But clearly N NG (N G (P))(P) N G (P), and the result follows. Theorem 55 Let G be a finite group, and let p 1,..., p k be the distinct prime divisors of G. Let P 1,...,P k be subgroups of G with P i Syl pi (G) for all i. The following statements are equivalent. 1. G is nilpotent. 2. P i G for all i. 3. G = P 1 P k. Proof. 1= 2Let G be nilpotent. Corollary 54 tells us that N G (P i ) = N G (N G (P i )). But Proposition 52 tells us that no proper subgroup of G is equal to its own normalizer. Hence N G (P i ) = G. 2= 3Suppose that P i G for all i. We argue by induction; let P( j) be the statement that P 1 P j = P 1 P j. Certainly P(1) is true. Suppose that P( j) true for a particular j < k. Let N = P 1...P j. Since N and NP j+1 are both normal in G, and since their orders are coprime, we have [N,P j+1 ] N P j+1 = {e}. So ng = gn for all n N and g P j+1, and so NP j+1 = N Pj+1. The statement P( j+1) follows inductively. This is sufficient to prove the implication, since G = P 1 P k. 3= 1Suppose that G = P 1 P k. Each subgroup P i is nilpotent by Theorem 50. Since G is the direct product of nilpotent groups, it follows from Proposition 51.3 that G is itself nilpotent. Corollary 56. Let G be a finite group, and let g,h G be elements with coprime orders. Then gh = hg. Proof. Let P 1,...,P k be the Sylow subgroups of G. By Theorem 55 there exists an isomorphism θg P 1 P k. Let θ(g) = (g 1,...,g k ) and θ(h) = (h 1,...,h k ). Since g and h have coprime orders, one of g i or h i must be the identity, for all i. Hence g and h commute. Remark. The converse to Corollary 56 is also true. Suppose that G has the property that any two elements with coprime order commute. Let P 1,...,P k be Sylow subgroups for the distinct prime divisors p 1,..., p k of G. Then clearly P i N G (P j ) for all i, j, since if i j then the elements of P i and P j commute. It follows that N G (P i ) = G for all i, and so the Sylow subgroups of G are all normal; hence G is nilpotent. Definition. Let G be a group. A subgroup M < G is maximal if M H G = H = M or H = G. We write M < max G to indicate that M is a maximal subgroup of G. 34

4 Remark. We note that if G is a finite group, then it is clear that every proper subgroup of G is contained in some maximal subgroup of G. This is not necessarily the case in an infinite group; indeed there exist infinite groups with no maximal subgroups, for instance (Q,+). Proposition 57. If G is a finite nilpotent group, and if M < max G, then M G, and G/M is prime. Proof. By Proposition 52 we see that N G (M) M. But certainly M N G (M) G, and so N G (N) = G. So M G. Since there are no proper subgroups of G strictly containing M, it follows from Proposition 2 that G/M has no proper, non-trivial subgroup. Hence G/M is cyclic of prime order. Proposition 58. Let G be a finite group. If every maximal subgroup of G is normal, then G is nilpotent. Proof. Suppose that every maximal subgroup of G is normal. Let P be a Sylow p-subgroup of G, and suppose that N G (P) G. Then N G (P) M for some maximal subgroup M. Now P Syl p (M), and M is normal in G by hypothesis. So the conditions of the Frattini argument are satisfied, and we have G = MN G (P). But this is a contradiction, since N G (P) M. So we must have N G (P) = G. Hence every Sylow subgroup of G is normal, and so G is nilpotent by Theorem 55. We summarize our main criteria for nilpotence in the following theorem. Theorem 59 Let G be a finite group. The following are all equivalent to the statement that G is nilpotent. 1. The lower central series for G terminates at {e}. 2. The upper central series for G terminates at G. 3. G has a central series. 4. Every Sylow subgroup of G is normal. 5. G is a direct product of p-groups. 6. Any two elements of G with coprime order commute. 7. Each proper subgroup of G is properly contained in its normalizer. 8. Every maximal subgroup of G is normal. The first three of these conditions apply also to infinite groups. 8 More on group actions Definition. Let G and H be isomorphic groups. Let G act on a set X, and H on a set Y. 1. We say that the actions of G and H are equivalent if there is an isomorphism θ : G H and a bijection α : X Y such that α(gx) = θ(g)α(x) for all g G and x X. 35

5 2. In the special case that G = H and θ is the identity map, we have α : X Y such that α(gx) = gα(x) for all g G and x X. Then we say that the actions on X and Y are equivalent actions of G, and that α is an equivalence of actions. We revisit the Orbit-Stabilizer Theorem in the light of this definition. Theorem 60. Orbit-Stabilizer Theorem Revisited Let G act transitively on a set X. Let x X, and let H be the stabilizer of x in G. Let Y be the set of left cosets of H in G. Then the action of G on Y by left translation, and the action of G on X, are equivalent actions of G. Proof. Recall that for k 1,k 2 G we have k 1 H = k 2 H k 1 x = k 2 x. So there is a well-defined map f : Y X given by f(kh) = kx for k G. The map f is bijective (this is the substance of the proof of Theorem 10.) Now for all g G we have g f(kh) = gkx = f(gkh), and so f is an equivalence of actions. The significance of Theorem 60 is that the study of transitive actions of G is reduced to the study of actions of G on the left cosets of its subgroups. Suppose that G is a group acting on a set Ω. For every k N, there is an action of G on Ω k given by g(x 1,...,x k ) = (gx 1,...,g xk ). Definition. Let G act on Ω, and let k Ω. We say that the action of G on Ω is k-transitive if for any two k-tuples x = (x 1,...,x k ) and y = (y 1,...,y k ) in Ω k, with the property that x i x j and y i y j when i j, there exists g G such that gx = y (so gx i = y i for 1 i k). Another way of phrasing the definition is that G is k-transitive on Ω if it acts transitively on the subset of Ω k consisting of k-tuples of distinct elements of Ω. Remark. If G acts k-transitively on Ω, then it is clear that it acts l-transitively on Ω for every l k. Examples. 1. S n acts n-transitively on Ω = {1,...,n}. For any n-tuple x = (x 1,...,x n ) of distinct elements of Ω we have {x 1,...,x n } = {1,...,n}, and so the map f x : i x i is in S n. Now if y is another n-tuple of distinct elements then f y f 1 x : x y. 2. A n acts only (n 2)-transitively on Ω = {1,...,n}. It is not (n 1)-transitive, since the tuples (1,3,...,n) and (2,3,...,n) lie in distinct orbits. Let x and y be (k 2)-tuple of distinct elements of Ω. Then there is an element g of S n such that gx = y. Now there exist two points i, j which are not in the tuple y, and since (i j)y = y we have (i j)gx = y. Since one of g or (i j)g lies in A n, we see that x and y lie in the same orbit of A n, as we claimed. 36

6 3. If n > 3 then D 2n is only 1-transitive on the vertices of a regular n-gon. There exist vertices u,v,w such that u is adjacent to v but not to w, and it is clear that there is no g D 2n such that g(u,v) = (u,w) since symmetries of an n-gon preserve adjacency of vertices. Remark. If G acts on Ω and H = Stab G (x) for x Ω, then H acts on Ω \ {x}. Proposition 61. Let G be transitive on Ω, let x Ω, and let H = Stab G (x). Let k N. Then G acts k- transitively on Ω if and only if H acts (k 1)-transitively on Ω \ {x}. Proof. Suppose G is k-transitive. Let y = (y 1,...,y k 1 ) and z = (z 1,...,z k 1 ) be (k 1)-tuples of distinct elements of Ω \ {x}. Then y = (y 1,...,y k 1,x) and z = (z 1,...,z k 1,x) are k-tuples of distinct elements of Ω, and so there exists h G such that hy = z. Now we see that hx = x, and so h H. It is also clear that hy = z. So we have shown that H is (k 1)-transitive on Ω \ {x}. Conversely, suppose that H is (k 1)-transitive on Ω \ {x}. Let y = (y 1,...,y k ) and z = (z 1,...,z k ) be distinct k-tuples of elements of Ω. Since G is transitive on Ω, there exist f,g G such that f y k = x and gz k = x. Now we see that u = ( f y 1,..., f y k 1 ) and v = (gz 1,...,gz k 1 ) are (k 1)-tuples of distinct elements of Ω \ {x}. So there exists h H such that hu = v. Now it is straightforward to check that h f y i = gz i for 1 i k, and so g 1 h f y = z. We have therefore shown that G is k-transitive on Ω. Definition. Recall that an equivalence relation on a set Ω may be regarded as a partition of the set Ω into disjoint subsets (the parts, or equivalence classes) whose union is Ω. (If x,y Ω, then x y if and only if x and y lie in the same part. 1. We say that an equivalence relation is trivial if it has only one part, or if all of its parts have size 1. (So either x y for all x,y, or else x y only if x = y.) 2. Suppose that G acts on Ω. We say that G preserves Ω if x y gx gy, for x,y Ω. It is clear that any group G acting on Ω preserves the trivial partitions. Definition. Let Ω > 1, and let G act transitively on Ω. 1. If is a non-trivial equivalence relation on Ω, such that G preserves, then we say the action of G is imprimitive, and that is a system of imprimitivity for G. The parts of are called blocks. 2. If there is no non-trivial equivalence relation on Ω which is preserved by G, then we say that the action of G is primitive. Examples. 1. Let g be the n-cycle (12... n) S n, and let g act on Ω = {1,...,n} in the natural way. The action is primitive if and only if n is prime. Otherwise n has some proper divisor d, and the equivalence relation on Ω given by i j i j mod d is a system of imprimitivity. 37

7 2. S n is primitive on Ω = {1,...,n} for n > 1. And A n is primitive on Ω for n > D 2n acts primitively on the vertices of an n-gon if and only if n is prime. If n = ab is a proper factorization of n, then we can inscribe b distinct a-gons inside the n-gon, and the vertices of the a-gons form the blocks of a system of imprimitivity. Proposition 62. Let B be a system of imprimitivity for the action of G on Ω. For a block B of B, define gb = {gx x B}. Then gb is a block of B, and the map B gb defines a transitive action of G on the set of blocks of B. Proof. If x gb and y Ω, then g 1 x B, and so g 1 x g 1 y g 1 y B. So we have x y y gb, and so gb is a block of B. It is easy to see that eb = B and that g(hb) = ghb for g,h G, and so the map B gb gives an action of G. And since G is transitive on Ω, it is clear that it is transitive on the blocks. Corollary 63. If B is a system of imprimitivity for the action of G on Ω, then all of the blocks of B have the same size. Proof. This is clear from the transitivity of G on the blocks; if B and C are blocks then C = gb for some g G. Corollary 64. If Ω = p, where p is prime, and if G acts transitively on Ω, then the action of G is primitive. Proof. Let be an equivalence relation preserved by G. It is clear from Corollary 63 that the size of each part divides Ω. But since p is prime, its only divisors are 1 and p. So must be trivial, and hence G is primitive. Remark. Corollary 64 establishes the claim, in the examples above, that the actions of C p and D 2p on p points are primitive. Proposition 65. If G is 2-transitive on Ω, then it is primitive. Proof. Let be any non-trivial equivalence relation on Ω. it has distinct parts B 1 and B 2, and the part B 1 comtains distinct points x and y. Let z B 2. Then since G acts 2-transitively, there exists g G such that g(x,y) = (x,z). So we have x y but gx gy. Hence G does not preserve, and so G is primitive. Remark. Primitivity is a strictly stronger condition than transitivity, since e.g. ( ) is transitive but not primitive on {1,2,3,4}. And 2-transitivity is strictly stronger than primitivity, since e.g. A 3 is primitive but not 2-transitive on {1,2,3}. Proposition 66. Let G act transitively on Ω. Let H be the stabilizer of a point x Ω. Then the action of G is primitive if and only if H < max G. 38

8 Proof. Suppose that B is a system of imprimitivity for G on Ω. Let B be the block of B which contains the point x. Let y be point in B distinct from x. Since G is transitive, there exists g G with gx = y. Since y gb, we have gb = B. Let L = Stab G (B), the stabilizer in the action of G on the blocks of B. It is clear that H L, and since g L \ H, we have H < L. But since there is more than one block of B, and G is transitive on blocks, we see that L < G. We have that H < L < G, and so H is not maximal in G. Conversely, suppose H is not maximal. Let L be a subgroup such that H < L < G. Recall from Theorem 60 that the action of G on Ω is equivalent to its action on left cosets of H. So we may suppose that Ω is this set of cosets. Now we define an equivalence relation on Ω by ah bh al = bl. This relation is well defined, since if ah = a H then al = a L, and it is clear that it is an equivalence relation; it is non-trivial, since H < L < G. Now for g G we have ah bh al = bl gal = gbl gah gbh, and so is a system of imprimitivity for G. So G is not primitive. Corollary 67. If G is nilpotent and G acts primitively on Ω, then Ω is prime. Proof. Let H be the stabilizer of x Ω. Then H < max G, and so G : H is prime, by Proposition 57. But Ω = G : H by Theorem 60. Remark. Let G and Ω be as in Corollary 67. We have that H G by Proposition 57, and it follows that H is the kernel of the action. So we have a homomorphism G/H Sym(Ω) = S p for some prime p. Now in S p there is no non-p-element which commutes with a p-cycle. But since G is nilpotent, any two elements of coprime order commute, and it follows that the image of G/H in S p is cyclic of order p. Proposition 68. Let G act faithfully and primitively on a finite set Ω, and let N be a non-trivial normal subgroup of G. Then N is transitive on Ω. Proof. Let M < max G be the stabilizer of x Ω, and let N G. Then M MN G, and so MN is equal either to M or to G. If MN = N then N M, and since N is normal we have N g M for every g G. But the conjugates of M are the point-stabilizers in G, and it follows that N is contained in the kernel of G. But G is faithful, and so we must have N = {e} in this case. We may therefore suppose that MN = G. Now the stabilizer of x in N is M N, and we have Orb N (x) = N M N = MN = G M M = Orb G(x). (Here we have used the Orbit-Stabilizer Theorem and the Third Isomorphism Theorem.) Since G is transitive, we have Orb N (x) = Ω, and so N is transitive. Proposition 69. Let G be a subgroup of S 7 of order 168. Then G is simple. 39

9 Proof. First note that since 7 divides 168, there is a 7-cycle in G, and so G is transitive on {1,...,7}. By Corollary 64 we see that G acts primitively. Suppose that N is a proper, non-trivial normal subgroup of G. Then N is transitive by Proposition 68, and so N is divisible by 7. So N contains a Sylow 7-subgroup of G, and since it is normal, it must contain all Sylow 7-subgroups of G. Let P be a Sylow 7-subgroup of G. We observe that S 7 contains 120 conjugates of P, and so the normalizer of P in S 7 has order 42. So G does not normalize P. The number n 7 (G) of Sylow 7-subgroups of G is therefore greater than 1; we have n 7 (G) 1 mod 7, and n 7 (G) divides 168, and so we must have n 7 (G) = 8. So the subgroup N has 8 Sylow 7-subgroups, and hence 8 divides N. Since 7 also divides N, we see that 56 divides N. It follows that N = 56, since 168 = Now N contains 48 elements of order 7, since each conjugate of P contains 6 such elements. It follows that N has only 8 elements whose order is not 7, and it is clear that these must form a normal Sylow 2- subgroup K. Now N acts transitively on 7 points, and so N is primitive by Corollary 64. So K is transitive by Proposition 68. So we have a subgroup of order 8 acting transitively on 7 points, and this is absurd since 7 does not divide 8. So we have a contradiction; no such subgroup N can exist, and so G is simple. We conclude the course by constructing a subgroup of S 7 of order 168. More precisely, we shall construct a group G with a faithful action on 7 points, which can therefore be identified with a subgroup of S 7. Let G = GL 3 (2), the set of invertible 3 3 matrices with entries from Z 2, under matrix multiplication. Since Z 2 is a field, the standard results of linear algebra apply. A 3 3 matrix is invertible if and only if it has non-zero determinant, which is the case if and only if its columns are linearly independent over Z 2. There is an action of G on the space Z 3 2 of column vectors, with basis e 1 = 0, e 2 = 1, e 3 = This space has size 2 3 = 8, and G acts transitively on the 7 non-zero vectors. Note that if Ae i = c i for i = 1,2,3, then the columns of A are c 1,c 2,c 3. It follows that the action of G is faithful, since the only element which fixes all three basis vectors is the identity. It remains to calculate G. We consider how we can construct an element A of G, column by column. There are clearly 7 possibilities for the first column c 1 of A, since any non-zero vector will do. The columns must be linearly independent, and so the second column c 2 cannot lie in the span of the first. This rules out the choices c 2 {0,c 1 }, and there are 6 remaining possibilities. Now we require the last column c 3 to lie outside the span of the first two; this span contains 4 vectors, and so there are 4 possible choices for c 3. So there are 7 6 = 168 possible choices for the matrix A, and so G = 168. Proposition 70. The group GL 3 (2) constructed above is simple. 40

10 Proof. We have shown that GL 3 (2) acts faithfully and transitively on 7 points. So it is isomorphic with a subgroup of S 7, of order 168, and so it is simple by Proposition 69. Remark. The group GL 3 (2) is one member of an infinite family of simple groups. Let GL d (p) be the general linear group, the group of invertible d d matrices over the field Z p. Define SL d (p) to be the special linear group, the subgroup consisting of matrices with determinant 1. The centre of SL d (p) is given by { } Z = Z(SL d (p)) = λi λ Z p,λ d = 1. The quotient group PSL d (p) = SL d (p)/z, the projective special linear group, is simple except when d = 2 and p = 2,3. It has a natural 2-transitive action on the lines of Z p d. The field Z p in this construction can be replaced with any other finite field. 41

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### CONSEQUENCES OF THE SYLOW THEOREMS

CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

GROUP ACTIONS KEITH CONRAD 1. Introduction The symmetric groups S n, alternating groups A n, and (for n 3) dihedral groups D n behave, by their very definition, as permutations on certain sets. The groups

### GROUP ACTIONS ON SETS WITH APPLICATIONS TO FINITE GROUPS

GROUP ACTIONS ON SETS WITH APPLICATIONS TO FINITE GROUPS NOTES OF LECTURES GIVEN AT THE UNIVERSITY OF MYSORE ON 29 JULY, 01 AUG, 02 AUG, 2012 K. N. RAGHAVAN Abstract. The notion of the action of a group

### CLASSIFYING FINITE SUBGROUPS OF SO 3

CLASSIFYING FINITE SUBGROUPS OF SO 3 HANNAH MARK Abstract. The goal of this paper is to prove that all finite subgroups of SO 3 are isomorphic to either a cyclic group, a dihedral group, or the rotational

### 13 Solutions for Section 6

13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution

### Notes on finite group theory. Peter J. Cameron

Notes on finite group theory Peter J. Cameron October 2013 2 Preface Group theory is a central part of modern mathematics. Its origins lie in geometry (where groups describe in a very detailed way the

### some algebra prelim solutions

some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no

### NOTES ON GROUP THEORY

NOTES ON GROUP THEORY Abstract. These are the notes prepared for the course MTH 751 to be offered to the PhD students at IIT Kanpur. Contents 1. Binary Structure 2 2. Group Structure 5 3. Group Actions

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 6 Commutators and the derived series. [x,y] = xyx 1 y 1.

6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition

### THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### D-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 5

D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 5 Dihedral groups, permutation groups, discrete subgroups of M 2, group actions 1. Write an explicit embedding of the dihedral group D n into the symmetric

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### ABSTRACT ALGEBRA. Romyar Sharifi

ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory

### 2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.

Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,

### 4. FIRST STEPS IN THE THEORY 4.1. A

4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We

### ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

### Some Basic Techniques of Group Theory

Chapter 5 Some Basic Techniques of Group Theory 5.1 Groups Acting on Sets In this chapter we are going to analyze and classify groups, and, if possible, break down complicated groups into simpler components.

### Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

### GROUPS WITH TWO EXTREME CHARACTER DEGREES AND THEIR NORMAL SUBGROUPS

GROUPS WITH TWO EXTREME CHARACTER DEGREES AND THEIR NORMAL SUBGROUPS GUSTAVO A. FERNÁNDEZ-ALCOBER AND ALEXANDER MORETÓ Abstract. We study the finite groups G for which the set cd(g) of irreducible complex

### F1.3YE2/F1.3YK3 ALGEBRA AND ANALYSIS. Part 2: ALGEBRA. RINGS AND FIELDS

F1.3YE2/F1.3YK3 ALGEBRA AND ANALYSIS Part 2: ALGEBRA. RINGS AND FIELDS LECTURE NOTES AND EXERCISES Contents 1 Revision of Group Theory 3 1.1 Introduction................................. 3 1.2 Binary Operations.............................

### Notes on Group Theory

Notes on Group Theory Mark Reeder March 7, 2014 Contents 1 Notation for sets and functions 4 2 Basic group theory 4 2.1 The definition of a group................................. 4 2.2 Group homomorphisms..................................

### Group Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway

Group Theory (MA343): Lecture Notes Semester I 2013-2014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013

### Group Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition

Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If

### Abstract Algebra Cheat Sheet

Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### Alexander Hulpke Department of Mathematics Colorado State University Fort Collins, CO, 80523, USA http://www.math.colostate.

Finding Subgroups Alexander Hulpke Department of Mathematics Colorado State University Fort Collins, CO, 80523, USA http://www.math.colostate.edu/~hulpke I A Popular Problem Given a finite (permutation,

### Lecture 5 Group actions

Lecture 5 Group actions From last time: 1. A subset H of a group G which is itself a group under the same operation is a subgroup of G. Two ways of identifying if H is a subgroup or not: (a) Check that

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

### EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### Introduction to finite fields

Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at

### COSETS AND LAGRANGE S THEOREM

COSETS AND LAGRANGE S THEOREM KEITH CONRAD 1. Introduction Pick an integer m 0. For a Z, the congruence class a mod m is the set of integers a + mk as k runs over Z. We can write this set as a + mz. This

### (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order

### Mathematics Course 111: Algebra I Part II: Groups

Mathematics Course 111: Algebra I Part II: Groups D. R. Wilkins Academic Year 1996-7 6 Groups A binary operation on a set G associates to elements x and y of G a third element x y of G. For example, addition

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### Appendix A. Appendix. A.1 Algebra. Fields and Rings

Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

### 3. Prime and maximal ideals. 3.1. Definitions and Examples.

COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B

### Integral Domains. As always in this course, a ring R is understood to be a commutative ring with unity.

Integral Domains As always in this course, a ring R is understood to be a commutative ring with unity. 1 First definitions and properties Definition 1.1. Let R be a ring. A divisor of zero or zero divisor

### Assignment 8: Selected Solutions

Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 21 Homomorphisms and Normal Subgroups

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 21 Homomorphisms and Normal Subgroups Recall that an isomorphism is a function θ : G H such that θ is one-to-one, onto

### FINITE GROUP THEORY. FOR COMBINATORISTS Volume one. Jin Ho Kwak. Department of Mathematics POSTECH Pohang, 790 784 Korea jinkwak@postech.ac.

FINITE GROUP THEORY FOR COMBINATORISTS Volume one Jin Ho Kwak Department of Mathematics POSTECH Pohang, 790 784 Korea jinkwak@postech.ac.kr Ming Yao Xu Department of Mathematics Peking University Beijing

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### (January 14, 2009) End k (V ) End k (V/W )

(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### ZORN S LEMMA AND SOME APPLICATIONS

ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### Complete graphs whose topological symmetry groups are polyhedral

Algebraic & Geometric Topology 11 (2011) 1405 1433 1405 Complete graphs whose topological symmetry groups are polyhedral ERICA FLAPAN BLAKE MELLOR RAMIN NAIMI We determine for which m the complete graph

### Group Theory. Chapter 1

Chapter 1 Group Theory Most lectures on group theory actually start with the definition of what is a group. It may be worth though spending a few lines to mention how mathematicians came up with such a

### Galois representations with open image

Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### Introduction to Modern Algebra

Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

### SMALL SKEW FIELDS CÉDRIC MILLIET

SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### ON FINITE GROUPS WITH THE SAME PRIME GRAPH AS THE PROJECTIVE GENERAL LINEAR GROUP PGL(2, 81)

Transactions on Algebra and its Applications 2 (2016), 43-49. ISSN: 6756-2423 ON FINITE GROUPS WITH THE SAME PRIME GRAPH AS THE PROJECTIVE GENERAL LINEAR GROUP PGL(2, 81) ALI MAHMOUDIFAR Abstract. Let

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where

### Galois Theory III. 3.1. Splitting fields.

Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where

### 7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### 9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.

### COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### ENUMERATION BY ALGEBRAIC COMBINATORICS. 1. Introduction

ENUMERATION BY ALGEBRAIC COMBINATORICS CAROLYN ATWOOD Abstract. Pólya s theorem can be used to enumerate objects under permutation groups. Using group theory, combinatorics, and many examples, Burnside

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### An Advanced Course in Linear Algebra. Jim L. Brown

An Advanced Course in Linear Algebra Jim L. Brown July 20, 2015 Contents 1 Introduction 3 2 Vector spaces 4 2.1 Getting started............................ 4 2.2 Bases and dimension.........................

### Proof. Right multiplication of a permutation by a transposition of neighbors either creates a new inversion or kills an existing one.

GROUPS AROUND US Pavel Etingof Introduction These are notes of a mini-course of group theory for high school students that I gave in the Summer of 2009. This mini-course covers the most basic parts of

### Algebra & Number Theory. A. Baker

Algebra & Number Theory [0/0/2009] A. Baker Department of Mathematics, University of Glasgow. E-mail address: a.baker@maths.gla.ac.uk URL: http://www.maths.gla.ac.uk/ ajb Contents Chapter. Basic Number

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

### Proof. The map. G n i. where d is the degree of D.

7. Divisors Definition 7.1. We say that a scheme X is regular in codimension one if every local ring of dimension one is regular, that is, the quotient m/m 2 is one dimensional, where m is the unique maximal