Abstract

This work presents formal correctness proofs in Isabelle/HOL of algorithms to transform a matrix into Smith normal form, a canonical matrix form, in a general setting: the algorithms are written in an abstract form and parameterized by very few simple operations. We formally show their soundness provided the operations exist and satisfy some conditions, which always hold on Euclidean domains. We also provide a formal proof on some results about the generality of such algorithms as well as the uniqueness of the Smith normal form.
Since Isabelle/HOL does not feature dependent types, the development is carried out by switching conveniently between two different existing libraries by means of the lifting and transfer package and the use of local type definitions, a sound extension to HOL.

BibTeX

@article{JDRT22,
  author    = {Jose Divas{\'{o}}n and
               Ren{\'{e}} Thiemann},
  title     = {A Formalization of the Smith Normal Form in Higher-Order Logic},
  journal   = {J. Autom. Reason.},
  volume    = {online first},
  year      = {2022},
  doi       = {10.1007/s10817-022-09631-5},
}