The Lax-Milgram Theorem. A detailed proof to be formalized in Coq

نویسندگان

  • François Clément
  • Vincent Martin
چکیده

To guarantee the correction of numerical simulation programs implementing the fi-nite element method, it is necessary to formalize the mathematical notions and results that allowto establish the soundness of the method. The Lax-Milgram theorem is one of those theoreticalcornerstones: under some completeness and coercivity assumptions, it states existence and unique-ness of the solution to the weak formulation of boundary value problems. The purpose of thisdocument is to provide the formal proof community with a very detailed pen-and-paper proof ofthe Lax-Milgram theorem.Key-words: Lax-Milgram theorem, finite element method, detailed mathematical proof, formalproof in real analysis This research was partly supported by GT ELFIC from Labex DigiCosme Paris-Saclay. ∗ Équipe Serena. [email protected].† LMAC, UTC, BP 20529, FR-60205 Compiègne, France. [email protected] Le théorème de Lax-Milgram.Une preuve détaillée en vue d’une formalisation en Coq Résumé : Pour garantir la correction de programmes de simulation numérique implémentant laméthode des éléments finis, il est nécessaire de formaliser les notions et résultats mathématiquesqui permettent d’établir la justesse de la méthode. Le théorème de Lax-Milgram est l’un de cesfondements théoriques : sous des hypothèses de complétude et de coercivité, il énonce l’existence etl’unicité de la solution de problèmes aux limites posés sous forme faible. L’objetif de ce documentest de fournir à la communauté preuve formelle une preuve papier très détaillée du théorème deLax-Milgram.Mots-clés : théorème de Lax-Milgram, méthode des éléments finis, preuve mathématiquedétaillée, preuve formelle en analyse réelle A detailed proof of the Lax-Milgram Theorem to be formalized in Coq3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps

This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assisted by the Coq system. Fundamental properties are proven by structural or noetherian induction: Genus Theorem, Euler’s Formula, constructive planarity criteria. A notion of ring of faces is inductively defined and a ...

متن کامل

A Machine-Checked Proof of the Odd Order Theorem

This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by Coq. To support the formalization, we developed a comprehensive set of reusable libraries o...

متن کامل

An introduction to small scale reflection in Coq

Small-scale reflection is a formal proof methodology based on the pervasive use of computation with symbolic representations. Symbolic representations are usually hidden in traditional computational reflection (e.g., as used in the Coq[The10] ring, or romega): they are generated on-the-fly by some heuristic algorithm and directly fed to some decision or simplification procedure whose output is ...

متن کامل

Certifying Code Generation Runs with Coq: A Tool Description

In this tool description paper we present a certifying code generation phase. Our code generation phase takes intermediate language programs and translates them into MIPS assembler code. Each time our code generation is invoked a proof script is emitted. This proof script is used as a certificate to guarantee the correctness of the code generation run. It is checked in the Coq theorem prover. O...

متن کامل

Essential Incompleteness of Arithmetic Verified by Coq

A constructive proof of the Gödel-Rosser incompleteness theorem [9] has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive functions is given, and all primitive recursive functions are proved to be representable in a weak axiom system. Formulas and proofs are encoded as natural n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1607.03618  شماره 

صفحات  -

تاریخ انتشار 2016