Skip to Main content Skip to Navigation
Conference papers

A Coq formal proof of the Lax–Milgram theorem

Abstract : The Finite Element Method is a widely-used method to solve numerical problems coming for instance from physics or biology. To obtain the highest confidence on the correction of numerical simulation programs implementing the Finite Element Method, one has to formalize the mathematical notions and results that allow to establish the sound-ness of the method. The Lax–Milgram theorem may be seen as one of those theoretical cornerstones: under some completeness and coercivity assumptions, it states existence and uniqueness of the solution to the weak formulation of some boundary value problems. This article presents the full formal proof of the Lax–Milgram theorem in Coq. It requires many results from linear algebra, geometry, functional analysis , and Hilbert spaces.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01391578
Contributor : Sylvie Boldo <>
Submitted on : Thursday, November 3, 2016 - 3:10:25 PM
Last modification on : Tuesday, April 21, 2020 - 1:12:32 AM
Document(s) archivé(s) le : Saturday, February 4, 2017 - 2:07:29 PM

File

article.pdf
Files produced by the author(s)

Identifiers

Citation

Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero. A Coq formal proof of the Lax–Milgram theorem. 6th ACM SIGPLAN Conference on Certified Programs and Proofs, Jan 2017, Paris, France. ⟨10.1145/3018610.3018625⟩. ⟨hal-01391578⟩

Share

Metrics

Record views

1670

Files downloads

1728