Related papers: Formalizing Hall's Marriage Theorem in Lean
In a recent paper, new theorems linking apparently unrelated mathematical objects (event structures from concurrency theory and full graphs arising in computational biology) were discovered by cross-site data mining on huge databases, and…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…
In a previous work, by extending the classical Quillen construction to the non-simply connected case, we have built a pair of adjoint functors, 'model' and 'realization', between the categories of simplicial sets and complete differential…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
A family of general Master theorems for analytic integration over the real (or imaginary) axis with various reciprocal hyperbolic (trig) kernels ($\sinh and/or \cosh$) with varying arguments is developed. Several examples involving…
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
This paper is devoted to the theory of $GL_n({\mathbb Z})$-conjugacy classes of regular integer $n\times n$ matrices. Such a matrix is $GL_n({\mathbb Q})$-conjugate to the companion matrix of its characteristic polynomial. But the set of…
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
An integer linear system (ILS) is a linear system with integer constraints. The solution graph of an ILS is defined as an undirected graph defined on the set of feasible solutions to the ILS. A pair of feasible solutions is connected by an…
Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…
Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…
We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather…
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 soundness of the method. The…
Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…
Why bother with fully rigorous proofs when one can very quickly get semi-rigorous ones? Yes, yes, we know how to get a "rigorous" proof of the result stated in the title of this article. One way is the boring, human one, citing some heavy…
In this article we describe the formalisation of the Bruhat-Tits tree - an important tool in modern number theory - in the Lean Theorem Prover. Motivated by the goal of connecting to ongoing research, we apply our formalisation to verify a…
A theory graph is a network of axiomatic theories connected with meaning-preserving mappings called theory morphisms. Theory graphs are well suited for organizing large bodies of mathematical knowledge. Traditional and formal proofs do not…
Both the original Temperley-Lieb algebras $\mathsf{TL}_{n}$ and their dilute counterparts $\mathsf{dTL}_{n}$ form families of filtered algebras: $\mathsf{TL}_{n}\subset \mathsf{TL}_{n+1}$ and $\mathsf{dTL}_{n}\subset\mathsf{dTL}_{n+1}$, for…