Skip to Main content Skip to Navigation
Conference papers

Point-Free, Set-Free Concrete Linear Algebra

Abstract : We show how a simple variant of Gaussian elimination can be used to model abstract linear algebra directly, using matrices only to represent all categories of objects, with operations such as subspace intersection and sum. We can even provide effective support for direct sums and subalgebras. We have formalized this work in Coq, and used it to develop all of the group representation theory required for the proof of the Odd Order Theorem, including results such as the Jacobson Density Theorem, Clifford's Theorem, the Jordan-Holder Theorem for modules, the Wedderburn Structure Theorem for semisimple rings (the basis for character theory).
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Georges Gonthier Connect in order to contact the contributor
Submitted on : Friday, March 29, 2013 - 3:03:50 PM
Last modification on : Friday, February 4, 2022 - 3:09:29 AM
Long-term archiving on: : Sunday, June 30, 2013 - 4:00:42 AM


Files produced by the author(s)




Georges Gonthier. Point-Free, Set-Free Concrete Linear Algebra. Interactive Theorem Proving - ITP 2011, Radboud University of Nijmegen, Aug 2011, Berg en Dal, Netherlands. pp.103-118, ⟨10.1007/978-3-642-22863-6_10⟩. ⟨hal-00805966⟩



Record views


Files downloads