Formalized Linear Algebra over Elementary Divisor Rings in Coq - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2016

Formalized Linear Algebra over Elementary Divisor Rings in Coq

Résumé

This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support essential operations of linear algebra, the classification theorem of finitely pre-sented modules over such rings and the uniqueness of the Smith normal form up to multiplication by units. We present formally verified algorithms comput-ing this normal form on a variety of coefficient structures including Euclidean domains and constructive principal ideal domains. We also study different ways to extend Bézout domains in order to be able to compute the Smith normal form of matrices. The extensions we consider are: adequacy (i.e. the existence of a gdco operation), Krull dimension ≤ 1 and well-founded strict divisibility.
Fichier principal
Vignette du fichier
main.author.pdf (226.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01081908 , version 1 (12-11-2014)

Licence

Paternité - Pas de modifications

Identifiants

Citer

Guillaume Cano, Cyril Cohen, Maxime Dénès, Anders Mörtberg, Vincent Siles. Formalized Linear Algebra over Elementary Divisor Rings in Coq. Logical Methods in Computer Science, 2016, ⟨10.2168/LMCS-12(2:7)2016⟩. ⟨hal-01081908⟩
408 Consultations
564 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More