Formalizing Geometric Algebra in Lean
Autor: | Wieser, E, Song, U |
---|---|
Přispěvatelé: | Wieser, Eric [0000-0003-0412-4978], Song, U [0000-0003-3994-4466], Apollo - University of Cambridge Repository, Wieser, E [0000-0003-0412-4978] |
Rok vydání: | 2022 |
Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science T.C. ICCA 12 Hefei August 3-7 2020 Applied Mathematics mathlib Geometric Algebra 15A66 (Primary) 68V20 (Secondary) Secondary 68V20 Article Logic in Computer Science (cs.LO) Clifford Algebra Universal property Lean Primary 15A66 |
Popis: | This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our ideas, we include a brief introduction to the Lean language targeted at a reader with no prior experience with Lean or theorem provers in general. We formalize the multivectors as the quotient of the tensor algebra by a suitable relation, which provides the ring structure automatically, then go on to establish the universal property of the Clifford algebra. We show that this is quite different to the approach taken by existing formalizations of Geometric algebra in other theorem provers; most notably, our approach does not require a choice of basis. We go on to show how operations and structure such as involutions, versors, and the $\mathbb{Z}_2$-grading can be defined using the universal property alone, and how to recover an induction principle from the universal property suitable for proving statements about these definitions. We outline the steps needed to formalize the wedge product and $\mathbb{N}$-grading, and some of the gaps in mathlib that currently make this challenging. Comment: 26 pages. This is the version accepted for publication on 2021-07-22, after peer review, in "Advances in Applied Clifford Algebras". This is not the Version of Record and does not reflect post-acceptance improvements, or corrections by the journal. Note that the web version of this article provided by the journal has typesetting issues not present here or in the journal's PDF |
Databáze: | OpenAIRE |
Externí odkaz: |