Abstract
AbstractThis 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.
Funder
Ministerio de Ciencia e Innovación
Austrian Science Fund
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference54 articles.
1. Adelsberger, S., Hetzl, S., Pollak, F.: The Cayley–Hamilton Theorem. Archive of Formal Proofs (2014) (formal proof development). http://afp.sf.net/entries/Cayley_Hamilton.shtml
2. Aransay, J., Divasón, J.: Formalisation in higher-order logic and code generation to functional languages of the Gauss–Jordan algorithm. J. Funct. Program. (2015). https://doi.org/10.1017/S0956796815000155
3. Aransay, J., Divasón, J.: Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL. Form. Asp. Comput. 28(6), 1005–1026 (2016)
4. Aransay, J., Divasón, J.: A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem. J. Autom. Reason. 58(4), 509–535 (2017)
5. Archive of Formal Proofs. http://isa-afp.org/
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献