Sporadic and Related groups Lecture 15 Introduction to Fusion.

Slides:



Advertisements
Similar presentations
Binary Operations Let S be any given set. A binary operation  on S is a correspondence that associates with each ordered pair (a, b) of elements of S.
Advertisements

Copyright © Cengage Learning. All rights reserved.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
Classification of Groups of Order 24
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Partially Ordered Sets (POSets)
The Integers and Division
FINITE FIELDS 7/30 陳柏誠.
Tell me what you can about a group of order n Mike Krebs, Cal State LA This talk will (soon) be available by following the link for “Research and Talks”
Information Security and Management 4. Finite Fields 8
CompSci 102 Spring 2012 Prof. Rodger January 11, 2012.
Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.
Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Great Theoretical Ideas in Computer Science for Some.
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas In Computer Science Anupam GuptaCS Fall 2006 Lecture 15Oct 17, 2006Carnegie Mellon University Algebraic Structures: Groups,
Math 3121 Abstract Algebra I
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Math 3121 Abstract Algebra I Lecture 14 Sections
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Computing with Laminated Integral Lattices. Richard Parker Aachen Sept
Sporadic and Related groups Lecture 16 The Monster.
Sporadic and Related groups Lecture 14 – Presentations.
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
INFINITE SEQUENCES AND SERIES In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series and.
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Math 3121 Abstract Algebra I
The NP class. NP-completeness
Chapter 2 Sets and Functions.
Unit-III Algebraic Structures
Reliability and Validity
CS480 Cryptography and Information Security
CSE15 Discrete Mathematics 02/08/17
Great Theoretical Ideas in Computer Science
represents the Empty set, or the set that contains nothing
Advanced Algorithms Analysis and Design
Pancakes With A Problem!
Great Theoretical Ideas In Computer Science
Chapter 2 Sets and Functions.
Mathematical Induction II
Quick reviews / corrections
Math 3121 Abstract Algebra I
B.Sc. III Year Mr. Shrimangale G.W.
Gray Code Can you find an ordering of all the n-bit strings in such a way that two consecutive n-bit strings differed by only one bit? This is called the.
Number Theory and Modular Arithmetic
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
刘振 上海交通大学 计算机科学与工程系 电信群楼3-509
Great Theoretical Ideas in Computer Science
Copyright © Cengage Learning. All rights reserved.
Great Theoretical Ideas in Computer Science
Fourier Analysis Lecture-8 Additional chapters of mathematics
Discrete Mathematics and its Applications
Algebraic Structures: Group Theory
Copyright © Zeph Grunschlag,
Chapter 8: Estimating with Confidence
Foundations of Discrete Mathematics
2. From Groups to Surfaces
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
DETERMINANT MATH 80 - Linear Algebra.
          .
SMALL 4-QUASINORMAL SUBGROUPS
Presentation transcript:

Sporadic and Related groups Lecture 15 Introduction to Fusion.

Atlas notations for groups Given any finite group, a minimal normal subgroup must be characteristically simple – (fixed by all automorphisms) – which is the direct product of isomorphic simple groups. We denote the direct product of n copies of a group G by G n.

Abelian characteristically simple groups. The direct product of cyclic groups of order p. We denote this by p n, denoting the direct product of n cyclic groups of order p. Examples 3 5, 7 3,

Non-abelian characteristically simple groups These are denoted by their name, and in this work it is quite rare that there is more than one of them. Examples M 11, L 3 (7), U 5 (2), HS, Co 2, M

Then we use a normal series If A and B are groups, then A.B is any group with normal subgroup A and quotient group B. So we can have groups like or 2 11.M 24 If A, B and C are groups, then we can use the notation A.B.C. This is “associative” since such a group has both a normal subgroup A with quotient B.C and a normal subgroup A.B with quotient C.

Sometimes we want a bit more detail So we say p 1+n is an extraspecial group, with centre of order (precisely) p, quotient group p n. In the case of odd p, it is always the case that all elements have order p. This is more specific than p.p n since not all groups of this form are extraspecial.

Other groups S 3 is really 3.2 but S 3 gives more structure information. Similarly S 4 is but I prefer S 4. S n we might call A n.2 but surely S n is a better name. If a group is the direct product, I prefer to say so. Hence (S 3 x M 24 ) is a perfectly good group.

Definition. Given any finite group G, H is a local subgroup of G for the prime p if it is the normalizer in G of a non- trivial p-group. Some local subgroups are contained in others, of course, and as often we are only interested in the maximal local subgroups, we might as well take only the normalizers of elementary abelian subgroups.

One idea in the classification Since a simple group does not have any non-trivial normal subgroups, the smallest unknown simple group (if there is one) has all its proper subgroups known, and in particular the composition factors of the local subgroups must be known. Usually it is the prime 2 that we are interested in.

What happens in L n (2) A good example of the sort of thing that happens is obtained by looking at the 2-local subgroups of L n (2) – the set of all n x n matrices over the field of 2 elements. A Sylow-2 subgroup can be taken as the upper- triangular matrices.

Sylow-2 subgroup of L 8 (2) 1 * * * * * * * 0 1 * * * * * * * * * * * * * * * * * * * * *

A 2 7 normalizer 1 * * * * * * * 0 X X X X X X X

A 2 12 normalizer Z Z * * * * * * 0 0 Y Y Y Y Y Y

Their joint normalizer 1 * * * * * * * 0 1 * * * * * * 0 0 Y Y Y Y Y Y

If you didn't know about L 8 (2) You could construct the groups 2 7 L 7 (2) and 2 12 (S 3 xL 6 (2)) and then be amazed that the subgroup 2 13 (2xL 6 (2)) in the two groups were isomorphic. They need to be for L 8 (2) to exist! The idea of local analysis is to find all the cases where this sort of thing happens

Of course you need to find the group Given the fusion system for L 8 (2), we would need to know that the only group that contained it was indeed L 8 (2), and a fair chunk of the size of the classification is proving a whole series of identifications of this sort.

Just for the record... The Sylow-2 subgroup of L 5 (2) – a group of order 2 10 – is also the Sylow-2 subgroup of M 24 and the Held sporadic group. Nevertheless the fusion systems in these three cases are totally different. Moral... there are not many p-groups where lots of subgroups have lots of automorphisms. If you find one, you've got to make good use of it!

Glauberman's Z* theorem Another “just for the record” statement. In any finite group G, if an involution is not conjugate to any involution that commutes with it, then it is in the centre of G modulo the greatest normal odd-order (solvable) group. In particular, in a simple group, every involution must commute with a conjugate.

Application – 2.A 8 Suppose we ask – is there a simple group G with an involution centralizer which is the double cover of A 8 ? 2.A 8 has only two classes of involution – the centre and the double cover of (12)(34)(56)(78), since (12)(34) squares, in the double cover, to the central element so has order 4. Hence, by Z*, the central involution must be conjugate in G to all the others.

2A 8 continued. In 2A 8 the other involutions are all conjugate, and centralize 2 4 L 2 (7). Hence the normalizer of the 2 4 in G must be transitive on the 15 involutions and the stabilizer of one is 2 4 L 2 (7). Hence it must have order =2520 and it is not too hard to see that this must be A 7.

Typical local problem Involution centralizer 2.A normalizer 2 4 A 7 The two 2 4 L 3 (2) subgroups are isomorphic. Yes, there is a group like that. The McLaughlin group

Another example The extra-special group has automorphism group 2 8.O 8 (2).2. By the way, there is no subgroup O 8 (2) in there. It is not a split extension. Since both 2 8 and O 8 (2) have double covers, there are actually several different groups O 8 (2), but I am talking about a particular one of them.

In this O 8 (2) We can take the central 2, and an elementary abelian 2 4 from the 2 1+8, and a 2 6 A 8 from the O 8 (2) and we get (perhaps rather surprisingly) an elementary abelian 2 11 with 2 4 A 8 on top [where the 2 4 is the rest of the ]. Of course :) this is also a subgroup of the split extension 2 11.M 24 so we can ask whether they fit together.

And they do. In Co 1 Involution centralizer O 8 (2) 2 11 normalizer 2 11.M [2 4 ].2 6.A 8 = 2 11.[2 4 ].A 8 These two groups actually are isomorphic! And this occurs only in the Conway group Co 1

What about the monster Co 1 is the involution centralizer If we take an M 24 -involution in the 2 24 we get a group M 24 and the fact that half of this ( M 24 ) has automorphisms permuting the three central involutions is the amazing fact (S 3 x M 24 ) is a 2 2 normaliser in the monster, so it is not so amazing, I suppose.

Fusion The idea of fusion is to take a p-subgroup P of some group G, and ask, for every pair of subgroups of P, whether they are conjugate (or “fuse”) in G. Usually we take a Sylow-p subgroup of G, as this is the maximal case and there are extra results (basically Sylow's theorems) to help us.

Well... not quite Actually the idea of fusion is to do this the other way round. Take a p-group P and ask, for every pair of isomorphisms between pairs of subgroups of P, whether the is an element of G which effects precisely that isomorphism (as a map) by conjugation.

Alperin's Theorem A fundamental result says that fusion is locally generated. That means that if you take all the isomorphisms that you get looking at the normalizers of elementary abelian groups, and then compose them (A->B and B- >C gives a map A->C) you get all the things that conjugation can do to p-groups.

Alperin's theorem is fairly elementary Given a Sylow subgroup P of a group G, and a conjugacy class of p-subgroups Q in G, Sylow's theorems tell us that a Sylow subgroup of the normalizer N G (Q) is in a Sylow p subgroup of G, and as all are conjugate, that a conjugate is actually in P. Hence there is a conjugate of Q such P contains a Sylow subgroup of the normalizer of Q.

The real game, then Given a p-group P and a normal subgroup Q (we might as well shrink P if necessary so that Q is normal), what can the normalizer of Q be with Sylow subgroup P? Of course if there is a normal p' subgroup (often called the “core”), this will make no difference so we might as well quotient that out. With that proviso, there can only be finitely many answers.

Another statement of Alperin's theorem If you know the answer to all these local questions, you know precisely which isomorphisms between subgroups of P are effected by conjugation in G.

What are the axioms of fusion? There are quite a few conditions that need to be satisfied by a fusion system on a p-group P before it has any chance of being the fusion system of some group G. But the fact remains that all these necessary conditions are not sufficient – the are some interesting fusion systems that look fine but do not come from a group. Nevertheless it is one way of classifying.

Chris Parker's (no relation) fusion patterns on p 1+2 If you take P as the group p 1+2, for large p the only interesting fusion pattern is the one that occurs in L 3 (p), but for small p there are others. The idea is that you want a group p 1+2.X which fixes a subgroup of order p 2 that can be extended to larger groups in two ways, one suitable for normalizing the p 2 and the other for normalizing the p 1+2.

His 13-local characterization of the Monster If you take P as the group , there is an exceptional fusion pattern where the normalizer is (3x4S 4 ) and the 13 2 normalizer is 4.L 2 (13).2. Chris proves (using classification) that this fusion pattern only occurs in the monster, and dreams that perhaps there might be a direct proof.

All this was done by hand. I would very much like to see a computer-automated way of doing this sort of fusion analysis. It is very error-prone. Actually Chris Parker is pretty keen on that too.

Of course we'd like to handle the monster So we would need to be able to handle the Sylow-2 subgroup of the monster – a group of order And then we'd need to be able to hold automorphisms of subgroups of this. I just do not know how to do that, although I also feel that it should be possible.