Implementing Geometric Algebra Products with Binary Trees

Laurent Fuchs 1 Laurent Théry 2
Université de Poitiers, XLIM - XLIM
2 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : AbstractThis paper presents a formalization of geometric algebras within the proof assistant Coq. We aim not only at reasoning within a theorem prover about geometric algebras but also at getting a verified implementation. This means that we take special care of providing computable definitions for all the notions that are needed in geometric algebras. In order to be able to prove formally properties of our definitions using induction, the elements of the algebra are recursively represented with binary trees. This leads to an unusual but rather concise presentation of the operations of the algebras. In this paper, we illustrate this by concentrating our presentation on the blade factorization operation in the Grassmann algebra and the different products of Clifford algebra.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Laurent Thery <>
Submitted on : Monday, December 15, 2014 - 4:40:50 PM
Last modification on : Wednesday, September 12, 2018 - 1:16:40 AM


  • HAL Id : hal-01095495, version 1



Laurent Fuchs, Laurent Théry. Implementing Geometric Algebra Products with Binary Trees. Advances in Applied Clifford Algebras, Springer Verlag, 2014, 24 (1), pp.22. ⟨⟩. ⟨hal-01095495⟩



Record views