Symmetry and the Monster

Slides:



Advertisements
Similar presentations
Fermat’s Last Theorem Dr. S. Lawrence ©2005.
Advertisements

Subbie algebra April Square Roots of Negative Numbers? The most commonly occurring application problems that require people to take square roots.
CIE Centre A-level Pure Maths
5.1 Real Vector Spaces.
Mathematics of Cryptography Part II: Algebraic Structures
Cryptography and Network Security
Copyright © Cengage Learning. All rights reserved.
Part 2.4: Rules that Govern Symmetry 1. Define Group Theory The Rules for Groups Combination Tables Additional Rules/Definitions – Subgroups – Representations.
Symmetries in Nuclei, Tokyo, 2008 Scale invariance Object of which a detail when enlarged becomes (approximately) identical to the object itself. Condition.
Math 3121 Abstract Algebra I
Shuijing Crystal Li Rice University Mathematics Department 1 Rational Points on del Pezzo Surfaces of degree 1 and 2.
The Cubic formula Milan vs. Venice (Cardano and Tartaglia) 1500’s.
Department of Mathematics Start with a unit length Place units end-to-end to get any integer length, e.g. 3 units: Geometrical constructions OA = 1 OB.
CHAPTER 3 The Church-Turing Thesis
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
Evariste Galois ( ) 1827 developed interest for mathematics 1828 failed the entrance exam to the Ecole Polytechnique, but continues to work on.
Hilbert’s Problems By Sharjeel Khan.
Richard Fateman CS 282 Lecture 14b1 Gröbner Basis Reduction Lecture 14b.
APPLICATIONS OF DIFFERENTIATION 4. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.
Nathan Carter Senior Seminar Project Spring 2012.
Scott Vaughen, Professor of Mathematics
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Chapter 3 Greek Number Theory The Role of Number Theory Polygonal, Prime and Perfect Numbers The Euclidean Algorithm Pell’s Equation The Chord and Tangent.
Leech Lattices Elicia Williams April 24, Background Brief Definition Lattices –2-Dimensions –3-Dimensions –24-Dimensions –Higher Dimensions Applications.
Carl Friedrich Gauss (30 April 1777 – 23 February 1855.
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
Copyright © Cengage Learning. All rights reserved.
Math 409/409G History of Mathematics
FINITE FIELDS 7/30 陳柏誠.
Hadamard matrices and the hadamard conjecture
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Recursion, Complexity, and Searching and Sorting By Andrew Zeng.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
MATH 224 – Discrete Mathematics
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
Recursion, Complexity, and Sorting By Andrew Zeng.
PART 3 THINKING MATHEMATICALLY. 3.1 MATHEMATICS AS AN AXIOMATIC-DEDUCTIVE SYSTEM.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
F INITE S IMPLE G ROUPS Krista Lambroukos. W HAT IS A F INITE S IMPLE G ROUP ? Only normal subgroups are itself and the identity Building blocks Similar.
Chapter 11 The Number Theory Revival
Precalculus Complex Zeros V. J. Motto. Introduction We have already seen that an nth-degree polynomial can have at most n real zeros. In the complex number.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Computational Number Theory - traditional number theory Prime Numbers Factors Counting Factors D- functions.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
David Renardy.  Simple Group- A nontrivial group whose only normal subgroups are itself and the trivial subgroup.  Simple groups are thought to be classified.
Section 2.3 Properties of Solution Sets
Activity 2-15: Elliptic curves
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
2.3 Polynomial and Synthetic Division Why teach long division in grade school?
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Linear Thinking Chapter 9: Solving First Degree Equations.
8.1 8 Algorithms Foundations of Computer Science  Cengage Learning.
WEEK 5 Day 1. Three traveling salesman stop at a hotel for the night, they ask how much is a room. The manager says the room is $30. Each man puts a $10.
1 Rebels. 2 Evariste Galois and the Quintic Pierre Cuschieri Math 5400 Feb 12, 2007.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
◙ The Ishango Bone (dated – BC)
Algebra 2 Complex Numbers Lesson 4-8 Part 1. Goals Goal To identify, graph, and perform operations with complex numbers. Rubric Level 1 – Know the goals.
Modeling and Equation Solving
Chapter 7 Algebraic Structures
Lesson 12 – Polynomial Fcns - Working with Complex Numbers
The Number Theory Revival
Evariste Galois In mathematics, more specifically in abstract algebra, Galois theory, named after Évariste Galois, provides a connection between.
Division of Polynomials and Synthetic Division
3.3 Dividing Polynomials.
If a polynomial q(x) is divided by x – 4, the quotient is 2
Theory of Computation Turing Machines.
Introduction to linear Lie groups
Precalculus Essentials
Presentation transcript:

Symmetry and the Monster One of the greatest quests in mathematics

A little early history Equations of degree 2—meaning the highest power of x is x2: solved by the Babylonians in about 1800 BC Equations of degree 3: solved using a graphical method by Omar Khayyám in about 1100 AD Equations of degrees 3 and 4: solved by Italian mathematicians in the first half of the 1500s.

The quintic equation Equations of degree 5 were a problem. No one could come up with a formula. 1799 Paolo Ruffini 1824 Niels Hendrik Abel Early 1830s Évariste Galois

Galois’s Ideas If the equation is irreducible any solution is equivalent to any other. The solutions can be permuted among one another. Not all permutations are possible, but those that are form the Galois group of the equation.

x4 - 10x2 + 1 = 0 There are four solutions, a, b, c, d The negative of a solution is a solution, so we can set: a + b = 0, and c + d = 0. This restricts the possible permutations; if a goes to b then b goes to a, if a goes to c then b goes to d.

The Galois Group Galois investigated when the solutions to a given equation can be expressed in terms of roots, and when they can’t. The solutions can be deconstructed into roots precisely when the Galois group can be deconstructed into cyclic groups.

Atoms of Symmetry A group that cannot be deconstructed into simpler groups is called simple. For each prime number p the group of rotations of a regular p-gon is simple; it is a cyclic group. The structure of a non-cyclic simple group can be very complex.

Families of Simple Groups Galois discovered the first family of non-cyclic finite simple groups. Other families were discovered in the later nineteenth century. All these families were later seen as ‘groups of Lie type’, stemming from work of Sophus Lie.

Sophus Lie Lie wanted to do for differential equations what Galois had done for algebraic equations. He created the concept of continuous groups, now called Lie groups. ‘Simple’ Lie groups were classified into seven families, A to G, by Wilhelm Killing.

Finite groups of Lie type Finite versions of Lie groups are called groups of Lie type. Most of them were created by Leonard Dickson in 1901. In 1955 Claude Chevalley found a uniform method yielding all families A to G. Variations on Chevalley’s theme soon emerged, and by 1961 all finite groups of Lie type had been found.

The Feit-Thompson Theorem In 1963, Walter Feit and John Thompson proved the following big theorem: A non-cyclic finite simple group must contain an element of order 2. Elements of order 2 give rise to ‘cross-sections’, and Richard Brauer had shown that knowing one cross-section of a finite simple group gave a firm handle on the group itself.

The Classification By 1965 it looked as if a finite simple group must be a group of Lie type, or one of five exceptions discovered in the mid-nineteenth century. These five exceptions, the Mathieu groups—created by Émile Mathieu—are very exceptional. There is nothing else quite like them.

A Cat among the Pigeons In 1966, Zvonimir Janko in Australia produced a sixth exception. He discovered it via one of its cross-sections. This led Janko and others to search for more exceptions, and within ten years another twenty turned up.

The Exceptions Some were found using the cross-section method Some were found by studying groups of permutations Some were found using geometry

The Hall-Janko group J2 Janko found it using the cross-section method. Marshall Hall found it using permutation groups. Jacques Tits constructed it using geometry.

The Leech Lattice John Leech used the largest Mathieu group M24 to create a remarkable lattice in 24 dimensions. John Conway studied Leech’s lattice and turned up three new exceptions. Had he investigated it two years earlier, he would have found two more—the Leech Lattice contains half of the exceptional symmetry atoms.

Fischer’s Monsters Bernd Fischer in Germany discovered three intriguing and very large permutation groups, modelled on the three largest Mathieu groups. He then found a fourth one of a different type, and even larger, called the Baby Monster. Using this as a cross-section, he turned up something even bigger, called the Monster.

Computer Constructions When the exceptional groups were ‘discovered’, it was not always clear that they existed. Proving existence could be tricky, and computers were sometimes used. For example the Baby Monster was constructed on a computer. BUT the Monster was too large for computer methods.

Constructing the Monster Fischer, Livingstone and Thorne constructed the character table of the Monster, a 194-by-194 array of numbers. This showed the Monster could not live in fewer than 196,883 dimensions. 196,883 = 475971, the three largest primes dividing the size of the Monster. Later Robert Griess constructed the Monster by hand in 196,884 dimensions.

McKay’s Observation 196,883 + 1 = 196,884, the smallest non-trivial coefficient of the j-function. McKay wrote to Thompson who had further data on the Monster available. Thompson confirmed that other dimensions for the Monster seemed to be related to coefficients of the j-function.

Ogg’s Observation Shortly after evidence for the Monster was announced, Andrew Ogg attended a lecture in Paris. Jacques Tits wrote down the size of the Monster, as a product of prime numbers. Ogg noticed these were precisely the primes that appeared in connection with his own work on the j-function.

Moonshine The mysterious connections between the Monster and the j-function were dubbed Moonshine. John Conway and Simon Norton investigated them in detail, proved they were real, and made conjectures about a deeper connection. Their paper was called Monstrous Moonshine

Vertex Algebras and String Theory The Moonshine connections involved the Monster acting in finite dimensional spaces. Frenkel, Leopwski and Meurman combined these in an infinite dimensional space. Their space had a vertex algebra structure, which brought in the mathematics of string theory.

Conway-Norton Conjectures The conjectures by Conway and Norton were later proved by Richard Borcherds, who received a Fields Medal for his work,but as he points out, there are still mysteries to resolve For example the space of ‘j-functions’ associated with the Monster has dimension 163. Is this just a coincidence? e√163 = 262537412640768743.99999999999925... is very close to being a whole number.