A Mechanized Proof of the Basic Perturbation Lemma
Jesús Aransay, Clemens Ballarin, and Julio RubioJournal of Automated Reasoning 40(4), pp. 271 – 292, 2008.
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.
BibTeX
@article{-JAR08,
author = "Jes\'{u}s Aransay and Clemens Ballarin and Julio Rubio",
title = "A Mechanized Proof of the Basic Perturbation Lemma",
journal = "Journal of Automated Reasoning",
volume = 40,
number = 4,
year = 2008,
pages = "271--292"
}