Formalizing Chemical Theory using the Lean Theorem Prover

10/21/2022
by   Maxwell P. Bobbin, et al.
0

Chemical theory can be made more rigorous using the Lean theorem prover, an interactive theorem prover for complex mathematics. We formalize the Langmuir and BET theories of adsorption, making each scientific premise clear and every step of the derivations explicit. Lean's math library, mathlib, provides formally verified theorems for infinite geometries series, which are central to BET theory. While writing these proofs, Lean prompts us to include mathematical constraints that were not originally reported. We also illustrate how Lean flexibly enables the reuse of proofs that build on more complex theories through the use of functions, definitions, and structures. Finally, we construct scientific frameworks for interoperable proofs, by creating structures for classical thermodynamics and kinematics, using them to formalize gas law relationships like Boyle's Law and equations of motion underlying Newtonian mechanics, respectively. This approach can be extended to other fields, enabling the formalization of rich and complex theories in science and engineering.

READ FULL TEXT

page 3

page 9

research
03/16/2021

The Agda Universal Algebra Library, Part 2: Structure

The Agda Universal Algebra Library (UALib) is a library of types and pro...
research
01/25/2021

The Agda Universal Algebra Library and Birkhoff's Theorem in Dependent Type Theory

The Agda Universal Algebra Library (UALib) is a library of types and pro...
research
03/09/2021

The Agda Universal Algebra Library, Part 1: Foundation

The Agda Universal Algebra Library (UALib) is a library of types and pro...
research
07/23/2021

Formalizing Galois Theory

We describe a project to formalize Galois theory using the Lean theorem ...
research
05/06/2010

On Building a Knowledge Base for Stability Theory

A lot of mathematical knowledge has been formalized and stored in reposi...
research
01/01/2021

Formalizing Hall's Marriage Theorem in Lean

We formalize Hall's Marriage Theorem in the Lean theorem prover for incl...
research
12/22/2021

Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, on...

Please sign up or login with your details

Forgot password? Click here to reset