Mechanized Reasoning in Homological Algebra

  1. Aransay, J. 1
  1. 1 Universidad de La Rioja

    Universidad de La Rioja

    Logroño, España

    GRID grid.119021.a

AI Communications

ISSN: 0921-7126

Year of publication: 2008

Volume: 21

Issue: 4

Pages: 265-267

Type: Article

Export: RIS
DOI: 10.3233/AIC-2008-0427 SCOPUS: 2-s2.0-58149504107 WoS: 000262452100005
bar_chart See metrics


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. © 2008 - IOS Press and the authors. All rights reserved.