Mechanized reasoning in Homological Algebra

Authors:
Jesús Aransay
Affiliations:
Departamento de Matemáticas y Computación Universidad de La Rioja, Edificio Luis Vives c/Luis de Ulloa, Logroño E26004, Spain. E-mail: jesus-maria.aransay@unirioja.es
Venue:
AI Communications
Year:
2008

Citing 5
Cited 0

Mechanized reasoning in homological algebra

Mechanized reasoning in homological algebra
A Mechanized Proof of the Basic Perturbation Lemma

Journal of Automated Reasoning
Generating certified code from formal proofs: a case study in homological algebra

Formal Aspects of Computing
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Extracting computer algebra programs from statements

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we face the problem of obtaining a certified version of a crucial algorithm in Homological Algebra, known as Perturbation Lemma. This lemma is intensively used in the software system Kenzo, devoted to symbolic computation in Homological Algebra. To this end we use the proof assistant Isabelle. Our motivations are to increase the knowledge in the algorithmic nature of this mathematical result and to test different possibilities offered by Isabelle to formally prove theorems in Homological Algebra. A detailed mathematical proof of the Perturbation Lemma, a methodology to obtain certified software in Homological Algebra, a suitable infrastructure to formalize the proof, a complete Isabelle formal proof, and a discussion on the constructiveness of the mathematical results introduced are presented.