Finite Groups Representation Theory with Coq

Representation theory is a branch of algebra that allows the study of groups through linear applications, i.e. matrices. Thus problems in abstract groups can be reduced to problems on matrices. Representation theory is the basis of character theory. In this paper we present a formalization of finite groups representation theory in the Coq system that includes a formalization of Maschke's theorem on reducible finite group algebra.

[1]  M. Liebeck,et al.  Representations and Characters of Groups , 1995 .

[2]  Ioana Pasca,et al.  Canonical Big Operators , 2008, TPHOLs.

[3]  Jeremy Avigad,et al.  A formally verified proof of the prime number theorem , 2005, TOCL.

[4]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[5]  Herman Geuvers,et al.  A Constructive Algebraic Hierarchy in Coq , 2002, J. Symb. Comput..

[6]  Richard J. Boulton,et al.  Theorem Proving in Higher Order Logics , 2003, Lecture Notes in Computer Science.

[7]  Stephen Wolfram,et al.  The Mathematica Book , 1996 .

[8]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[9]  Robert Pollack,et al.  Dependently Typed Records for Representing Mathematical Structure , 2000, TPHOLs.

[10]  Gilles Barthe,et al.  Setoids in type theory , 2003, Journal of Functional Programming.

[11]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[12]  D. Passman,et al.  Character Theory of Finite Groups , 2010 .

[13]  Stephen S. Gelbart,et al.  An elementary introduction to the Langlands program , 1984 .

[14]  I. M. Isaacs.  The π-character theory of solvable groups , 1994 .

[15]  Enrico Tassi,et al.  A Small Scale Reflection Extension for the Coq system , 2008 .

[16]  Enrico Tassi,et al.  A Modular Formalisation of Finite Group Theory , 2007, TPHOLs.