Journal of Automated Reasoning

, Volume 40, Issue 4, pp 271–292

A Mechanized Proof of the Basic Perturbation Lemma



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.


Homological algebra Isabelle Basic perturbation lemma 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media B.V. 2007

Authors and Affiliations

  1. 1.Dpto. de Matemáticas y ComputaciónUniversidad de La RiojaLogroñoSpain
  2. 2.Institut für InformatikUniversität InnsbruckInnsbruckAustria

Personalised recommendations