相关论文: Formalizing Hall's Marriage Theorem in Lean

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

We consider a set-valued mapping on a simple graph and ask for the existence of a disparate selection. The term disparate is defined in the paper and we present a sufficient and necessary condition for the existence of a disparate…

We present a generalization of the marriage problem underlying Hall's famous Marriage Theorem to what we call the Symmetric Marriage Problem, a problem that can be thought of as a special case of Maximal Weighted Bipartite Matching. We show…

We introduce a geometric generalization of Hall's marriage theorem. For any family $F = \{X_1, \dots, X_m\}$ of finite sets in $\mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_i\in X_i$ for every $1\leq i…

This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on…

Lie algebras are an important class of algebras which arise throughout mathematics and physics. We report on the formalisation of Lie algebras in Lean's Mathlib library. Although basic knowledge of Lie theory will benefit the reader, none…

This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…

We review known linear and matrix generalizations of Hall's classic ``marriage theorem'' and K\H{o}nig's theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth's theorem about…

In this work, we present two results: The first result is the formalization of Tutte's theorem in Lean, a key theorem concerning matchings in graph theory. As this formalization is ready to be integrated in Lean's mathlib, it provides a…

This article is about the formalization of synthetic differential geometry with the Lean proof assistant and the mathematical library mathlib. The main result we prove and formalize is a Taylor theorem for functions of several variables,…

Some mathematical theorems represent ideas that are discovered again and again in different forms. One such theorem is Hall's marriage theorem. This theorem is equivalent to several other theorems in combinatorics and optimization theory,…

We report on a formalization of the change of variables formula in integrals, in the mathlib library for Lean. Our version of this theorem is extremely general, and builds on developments in linear algebra, analysis, measure theory and…

This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

The continuous functional calculus is perhaps the most fundamental construction in the theory of operator algebras, especially $C^{*}$-algebras. Here we document our formalization of the continuous functional calculus in Lean, which…

We present ZFLean, a Lean 4 library for doing core mathematics inside a model of ZFC with the ergonomics expected of typed Mathlib developments. Building on Mathlib's ZFC model, we contribute a relational calculus for sets with rewriting…

The ongoing development of Lean 4's Mathlib has produced a macroscopic structural complexity that interweaves logical, mathematical, and infrastructural dependencies. We present a network analysis of this library, extracting its dependency…

We present the formalization of Doob's martingale convergence theorems in the mathlib library for the Lean theorem prover. These theorems give conditions under which (sub)martingales converge, almost everywhere or in $L^1$. In order to…

We consider families of finite sets that we call shellable and that have been characterized by Chang and by Hirst and Hughes as being the families of sets that admit unique solutions to Hall's marriage problem. In this paper, we introduce a…

Codifying mathematical theories in a proof assistant or computer algebra system is a challenging task, of which the most difficult part is, counterintuitively, structuring definitions. This results in a steep learning curve for new users…