**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Course# MATH-680: Monstrous moonshine

Summary

The monstrous moonshine is an unexpected connection between the Monster group and modular functions. In the course we will explain the statement of the conjecture and study the main ideas and concepts leading to its proof. Our final goal is to study Borcherd's proof of the Moonshine conjecture.

Moodle Page

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related MOOCs (32)

Lectures in this course (11)

Instructor

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 2)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Related courses (115)

Related concepts (399)

Maryna Viazovska

Maryna Viazovska did her bachelor studies at the Kyiv National Taras ShevchenkoUniversity and completed her MSc at the Technical University Kaiserslautern.She obtained her PhD in 2013 in Bonn.She was a postdoctoral researcher at the Institut des Hautes Etudes Scientifiquesand at the Humboldt University of Berlin, and in 2017 was a Minerva DistinguishedVisitor at Princeton University. She joined EPFL in 2017 as Tenure-Track AssistantProfessor and was promoted Full Professor in 2018.

Covers Borcherds' proof strategy, emphasizing the significance of simple roots and Weyl vectors.

Explores Monstrous Moonshine, focusing on the 1979 discovery and its mathematical connections.

Explores Borcherds' proof strategy for monstrous moonshine and Lie superalgebras.

Explores the Monster group, a sporadic simple group with a unique representation theory.

Explores the construction of the Fischer-Greiss monster group, emphasizing its key properties and the process involved.

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex

MATH-111(e): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

PHYS-431: Quantum field theory I

The goal of the course is to introduce relativistic quantum field theory as the conceptual and mathematical framework describing fundamental interactions.

Monstrous moonshine

In mathematics, monstrous moonshine, or moonshine theory, is the unexpected connection between the monster group M and modular functions, in particular, the j function. The initial numerical observation was made by John McKay in 1978, and the phrase was coined by John Conway and Simon P. Norton in 1979. The monstrous moonshine is now known to be underlain by a vertex operator algebra called the moonshine module (or monster vertex algebra) constructed by Igor Frenkel, James Lepowsky, and Arne Meurman in 1988, which has the monster group as its group of symmetries.

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Proof theory

Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.

Proof (truth)

A proof is sufficient evidence or a sufficient argument for the truth of a proposition. The concept applies in a variety of disciplines, with both the nature of the evidence or justification and the criteria for sufficiency being area-dependent. In the area of oral and written communication such as conversation, dialog, rhetoric, etc., a proof is a persuasive perlocutionary speech act, which demonstrates the truth of a proposition.

Proof by contradiction

In logic, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Although it is quite freely used in mathematical proofs, not every school of mathematical thought accepts this kind of nonconstructive proof as universally valid. More broadly, proof by contradiction is any form of argument that establishes a statement by arriving at a contradiction, even when the initial assumption is not the negation of the statement to be proved.