Journal of Automated Reasoning

, Volume 40, Issue 4, pp 271–292

A Mechanized Proof of the Basic Perturbation Lemma

Authors

  • Jesús Aransay
    • Dpto. de Matemáticas y ComputaciónUniversidad de La Rioja
  • Clemens Ballarin
    • Institut für InformatikUniversität Innsbruck
    • Dpto. de Matemáticas y ComputaciónUniversidad de La Rioja
Article

DOI: 10.1007/s10817-007-9094-x

Cite this article as:
Aransay, J., Ballarin, C. & Rubio, J. J Autom Reasoning (2008) 40: 271. doi:10.1007/s10817-007-9094-x

Abstract

We present a complete mechanized proof of the result in homological algebra known as basic perturbation lemma. The proof has been carried out in the proof assistant Isabelle, more concretely, in the implementation of higher-order logic (HOL) available in the system. We report on the difficulties found when dealing with abstract algebra in HOL, and also on the ongoing stages of our project to give a certified version of some of the algorithms present in the Kenzo symbolic computation system.

Keywords

Homological algebraIsabelleBasic perturbation lemma
Download to read the full article text

Copyright information

© Springer Science+Business Media B.V. 2007