Verifying the bridge between simplicial topology and algebra: the Eilenberg-Zilber algorithm
Laureano Lambán, Julio Rubio, Francisco J. Martín-Mateos, José–Luis Ruiz–Reina · Logic Journal of IGPL · 2013
The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying Eilenberg–Zilber theorem, using the ACL2 theorem prover. As our formalization is executable, we are able to compare the results of the certified programme with those of Kenzo on some universal examples. Since the results coincide, the reliability of Kenzo is reinforced. This is a new step in our long-term project towards certified programming for Algebraic Topology.