Implementing Geometric Algebra Products with Binary Trees - Archive ouverte HAL Access content directly
Journal Articles Advances in Applied Clifford Algebras Year : 2014

Implementing Geometric Algebra Products with Binary Trees

(1) , (2)
1
2
Laurent Fuchs
  • Function : Author
  • PersonId : 945829
SIC
Laurent Théry

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.
Not file

Dates and versions

hal-01095495 , version 1 (15-12-2014)

Identifiers

Cite

Laurent Fuchs, Laurent Théry. Implementing Geometric Algebra Products with Binary Trees. Advances in Applied Clifford Algebras, 2014, 24 (1), pp.22. ⟨10.1007/s00006-014-0447-3⟩. ⟨hal-01095495⟩
280 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More