Skip to main content

On Geometric Theorem Proving with Null Geometric Algebra

  • Chapter
Guide to Geometric Algebra in Practice

Abstract

The bottleneck in symbolic geometric computation is middle expression swell. Another embarrassing problem is geometric explanation of algebraic results, which is often impossible because the results are not invariant under coordinate transformations. In classical invariant-theoretical methods, the two difficulties are more or less alleviated but stay, while new difficulties arise.

In this chapter, we introduce a new framework for symbolic geometric computing based on conformal geometric algebra: the algebra for describing geometric configuration is null Grassmann–Cayley algebra, the algebra for advanced invariant manipulation is null bracket algebra, and the algebra underlying both algebras is null geometric algebra. When used in geometric computing, the new approach not only brings about amazing simplifications in algebraic manipulation, but can be used to extend and generalize existing theorems by removing some geometric constraints from the hypotheses.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    Editorial note: This characterization of CGA is more restrictive than elsewhere in this book, where (10.19) is employed.

References

  1. Chou, S.-C., Gao, X.-S., Zhang, J.-Z.: Machine Proofs in Geometry. World Scientific, Singapore (1994)

    Book  MATH  Google Scholar 

  2. Hestenes, D., Sobczyk, G.: Clifford Algebra to Geometric Calculus. Reidel, Dordrecht (1984)

    MATH  Google Scholar 

  3. Li, H.: Automated theorem proving in the homogeneous model with Clifford bracket algebra. In: Dorst, L., et al. (eds.) Applications of Geometric Algebra in Computer Science and Engineering, pp. 69–78. Birkhäuser, Boston (2002)

    Chapter  Google Scholar 

  4. Li, H.: Algebraic representation and elimination and expansion in automated geometric theorem proving. In: Winkler, F. (ed.) Automated Deduction in Geometry, pp. 106–123. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Li, H.: Automated geometric theorem proving, Clifford bracket algebra and Clifford expansions. In: Qian, T., et al. (eds.) Trends in Mathematics: Advances in Analysis and Geometry, pp. 345–363. Birkhäuser, Basel (2004)

    Chapter  Google Scholar 

  6. Li, H.: Clifford algebras and geometric computation. In: Chen, F., Wang, D. (eds.) Geometric Computation, pp. 221–247. World Scientific, Singapore (2004)

    Chapter  Google Scholar 

  7. Li, H.: Symbolic computation in the homogeneous geometric model with Clifford algebra. In: Gutierrez, J. (ed.) Proceedings of International Symposium on Symbolic and Algebraic Computation 2004, pp. 221–228. ACM Press, New York (2004)

    Chapter  Google Scholar 

  8. Li, H.: A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization. In: Brown, C.W. (ed.) Proc. ISSAC 2007, pp. 261–268. ACM Press, New York (2007)

    Chapter  Google Scholar 

  9. Li, H.: Invariant Algebras and Geometric Reasoning. World Scientific, Singapore (2008)

    Book  MATH  Google Scholar 

  10. Li, H., Huang, L.: Complex brackets balanced complex differences, and applications in symbolic geometric computing. In: Proc. ISSAC 2008, pp. 181–188. ACM Press, New York (2008)

    Chapter  Google Scholar 

  11. Li, H., Wu, Y.: Automated short proof generation in projective geometry with Cayley and Bracket algebras I. Incidence geometry. J. Symb. Comput. 36(5), 717–762 (2003)

    Article  MATH  Google Scholar 

  12. Li, H., Wu, Y.: Automated short proof generation in projective geometry with Cayley and Bracket algebras II. Conic geometry. J. Symb. Comput. 36(5), 763–809 (2003)

    Article  MATH  Google Scholar 

  13. Li, H., Hestenes, D., Rockwood, A.: Generalized homogeneous coordinates for computational geometry. In: Sommer, G. (ed.) Geometric Computing with Clifford Algebras, pp. 27–60. Springer, Heidelberg (2001)

    Google Scholar 

  14. Muir, T.: A Treatise on the Theory of Determinants. Macmillan & Co., London (1882)

    Google Scholar 

  15. Sommer, G. (ed.): Geometric Computing with Clifford Algebras. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  16. Sturmfels, B.: Algorithms in Invariant Theory. Springer, Wien (1993)

    MATH  Google Scholar 

  17. Sturmfels, B., White, N. (eds.): Invariant-Theoretic Algorithms in Geometry. Special Issue. J. Symb. Comput. 11 (5/6) (2002)

    Google Scholar 

    Google Scholar 

  18. White, N. (ed.): Invariant Methods in Discrete and Computational Geometry. Kluwer, Dordrecht (1994)

    Google Scholar 

  19. Wu, W.-T.: Mathematics Mechanization. Kluwer and Science Press, Beijing (2000)

    MATH  Google Scholar 

Download references

Acknowledgements

Both authors are supported partially by NSFC 10871195, NSFC 60821002/F02 and NKBRSF 2011CB302404.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongbo Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Li, H., Cao, Y. (2011). On Geometric Theorem Proving with Null Geometric Algebra. In: Dorst, L., Lasenby, J. (eds) Guide to Geometric Algebra in Practice. Springer, London. https://doi.org/10.1007/978-0-85729-811-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-811-9_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-810-2

  • Online ISBN: 978-0-85729-811-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics