Skip to main content

Computing with the Universal Properties of the Clifford Algebra and the Even Subalgebra

  • Conference paper
  • First Online:
Advanced Computational Applications of Geometric Algebra (ICACGA 2022)

Abstract

Typically, Geometric Algebra (GA) is introduced via choosing an orthogonal basis, and defining how multiplication acts on this basis according to some simple rules. This works well computationally, but can obscure insight mathematically. In particular, operations defined in terms of coordinates on a multivector basis can be difficult to rigorously show to be “coordinate-free”, especially in large algebras. This paper explores the use of the “universal property” to ensure that operations are “coordinate-free” by construction. To build some insight for applying the universal property, we draw parallels to the process of writing recursive programs. We then demonstrate a novel result using this approach by deriving a universal property of the even subalgebra. Armed with this second universal property, we provide an explicit construction for a well-known equivalence between any Clifford algebra and its “one-up” even subalgebra. We conclude with some remarks about formalization of these ideas in a theorem prover.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In this paper, we will use “Clifford algebra” to refer to this object, and “geometric algebra” to refer to the field of study.

  2. 2.

    So-named in reference to the mathematician Haskell Curry.

  3. 3.

    Note we call this a definition as we are defining \({\text {lift}}^{+}\), which has computational content just like the recursor for lists did.

  4. 4.

    Although the definition in [4] needs the construction in Sect. 3.5 and therefore doesn’t work in characteristic 2.

  5. 5.

    for which [6] proves only existence.

  6. 6.

    Confusingly, [3] uses \(u\llcorner U\) as notation for \(u \rfloor U\), with the symbol flipped.

  7. 7.

    (45) also appears as a special case of [4, (1.41a)] with \(r=1\).

References

  1. Chevalley, C.C.: The Algebraic Theory of Spinors. Columbia University Press (1954). https://doi.org/10.7312/chev93056

  2. Dorst, L., Fontijne, D., Mann, S.: Geometric Algebra for Computer Science: an Object-Oriented Approach to Geometry. Morgan Kaufmann Series in Computer Graphics, Elsevier; Morgan Kaufmann, Amsterdam, San Francisco (2007). ISBN: 978-0-12-374942-0

    Google Scholar 

  3. Grinberg, D.: The Clifford algebra and the Chevalley map - a computational approach (summary version 1) (2016). http://mit.edu/~darij/www/algebra/chevalleys.pdf

  4. Hestenes, D., Sobczyk, G.: Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics. Fundamental Theories of Physics. Springer, Cham (1984). https://doi.org/10.1007/978-94-009-6292-7

  5. Lasenby, A., Lasenby, J., Wareham, R.: A covariant approach to geometry using geometric algebra. Technical report F-INFENG/TR-483, Department of Engineering, University of Cambridge (2004). https://api.semanticscholar.org/CorpusID:124816889

  6. Lawson, H., Michelsohn, M.: Spin Geometry (PMS-38). Princeton Mathematical Series, vol. 38. Princeton University Press (1989). https://books.google.co.uk/books?id=3d9JkN8w3X8C

  7. Lounesto, P.: Clifford Algebras and Spinors. London Mathematical Society Lecture Note Series, 2nd edn. Cambridge University Press, Cambridge (2001). https://doi.org/10.1017/CBO9780511526022

    Book  Google Scholar 

  8. de Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: The lean theorem prover (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 378–388. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21401-6_26

    Chapter  Google Scholar 

  9. Wieser, E., Song, U.: Formalizing geometric algebra in lean. Adv. Appl. Clifford Algebras 32(3), 28 (2022). https://doi.org/10.1007/s00006-021-01164-1

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank David Cohoe for illuminating the ideas behind (10) that led to the rest of this paper. The first author is funded by a scholarship from the Cambridge Trust.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eric Wieser .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wieser, E., Lasenby, J. (2024). Computing with the Universal Properties of the Clifford Algebra and the Even Subalgebra. In: Silva, D.W., Hitzer, E., Hildenbrand, D. (eds) Advanced Computational Applications of Geometric Algebra. ICACGA 2022. Lecture Notes in Computer Science, vol 13771. Springer, Cham. https://doi.org/10.1007/978-3-031-34031-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34031-4_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34030-7

  • Online ISBN: 978-3-031-34031-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics