Related papers: Formalizing Hall's Marriage Theorem in Lean

We report on our formalization of matrix-interpretation in Isabelle/HOL. Matrices are required to certify termination proofs and we wish to utilize them for complexity proofs, too. For the latter aim, only basic methods have already been…

We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…

We present Lean Finder, a semantic search engine for Lean and mathlib that understands and aligns with the intents of mathematicians. Progress in formal theorem proving is often hindered by the difficulty of locating relevant theorems and…

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

We introduce framed versions of the $L$-moves and prove a one move theorem for the extension of the Markov theorem for framed braids. We further introduce framed versions of the Hilden and Pure Hilden groups, we give presentations and we…

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory…

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

This work presents a formalized proof of modal completeness for G\"odel-L\"ob provability logic (GL) in the HOL Light theorem prover. We describe the code we developed, and discuss some details of our implementation, focusing on our choices…

Distribution theory is a cornerstone of the theory of partial differential equations. We report on the progress of formalizing the theory of tempered distributions in the interactive proof assistant Lean, which is the first formalization in…

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a weak groupoid structure for equality,…

We prove a factorizable version of the Feigin-Frenkel theorem on the center of the completed enveloping algebra of the affine Kac-Moody algebra attached to a simple Lie algebra at the critical level. On any smooth curve C we consider a…

The On-Line Encyclopedia of Integer Sequences (OEIS) is a web-accessible database cataloging interesting integer sequences and associated theorems. With more than 12,000 citations, the OEIS is one of the most highly cited resources in all…

Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…

In the recent paper arXiv:1807.02721, B. Lawrence and A. Venkatesh develop a method of proving finiteness theorems in arithmetic geometry by studying the geometry of families over a base variety. Their results include a new proof of both…

In this paper we introduce the notion of existentially closed Leibniz algebras. Then we use HNN-extensions of Leibniz algebras in order to prove an embedding theorem.

We prove a Liv\v{s}ic-type theorem for H\"older continuous and matrix-valued cocycles over non-uniformly hyperbolic systems. More precisely, we prove that whenever $(f,\mu)$ is a non-uniformly hyperbolic system and $A:M \to GL(d,\mathbb{R})…