Canonical Big Operators

In this paper, we present an approach to describe uniformly iterated “big” operations, like Pn i=0 f(i) or maxi∈I f(i) and to provide lemmas that encapsulate all the commonly used reasoning steps on these constructs. We show that these iterated operations can be handled generically using the syntactic notation and canonical structure facilities provided by the Coq system. We then show how these canonical big operations played a crucial enabling role in the study of various parts of linear algebra and multi-dimensional real analysis, as illustrated by the formal proofs of the properties of determinants, of the Cayley-Hamilton theorem and of Kantorovitch’s theorem.

• Type: Conference
• Year: 2008
• Where: TPHOL
• Authors: Yves Bertot, Georges Gonthier, Sidi Ould Biha, Ioana Pasca
• Keywords: Artificial Intelligence, Canonical Big Operations, Canonical Structure Facilities, Iterated Operations, TPHOL 2008