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

We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

Fixed an algebraic scheme $Y$. We suggest a definition for the conjugate of an algebraic scheme $X$ over $Y$ in an evident manner; then $X$ is said to be Galois closed over $Y$ if $X$ has a unique conjugate over $Y$. Now let $X$ and $Y$…

This book deals with the theory of generalized algebraic transformations, which is elaborated with the aim to provide a relatively simple theoretical tool that enables an exact treatment of diverse more complex lattice-statistical models.…

The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple,…

We define an almost periodic extension of the Wiener algebras in the quaternionic setting and prove a Wiener-Levy type theorem for it, as well as extending the theorem to the matrix-valued case. We prove a Wiener-Hopf factorization theorem…

We have formalised Szemer\'edi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions, two major results in extremal graph theory and additive combinatorics, using the proof assistant Isabelle/HOL. For the latter formalisation, we…

The Lean mathematical library mathlib features extensive use of the typeclass pattern for organising mathematical structures, based on Lean's mechanism of instance parameters. Related mechanisms for typeclasses are available in other…

We prove a sharp version of Hal\'asz's theorem on sums $\sum_{n \leq x} f(n)$ of multiplicative functions $f$ with $|f(n)|\le 1$. Our proof avoids the "average of averages" and "integration over $\alpha$" manoeuvres that are present in many…

Scientific claim verification against tables typically requires predicting whether a claim is supported or refuted given a table. However, we argue that predicting the final label alone is insufficient: it reveals little about the model's…

An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…

Large language models (LLMs) often struggle with complex logical reasoning due to logical inconsistencies and the inherent difficulty of such reasoning. We use Lean, a theorem proving framework, to address these challenges. By formalizing…

A famous theorem of Dixmier-Malliavin asserts that every smooth, compactly-supported function on a Lie group can be expressed as a finite sum in which each term is the convolution, with respect to Haar measure, of two such functions. We…

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization…

Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…

We generalise gauge theory on a graph so that the gauge group becomes a finite-dimensional ribbon Hopf algebra, the graph becomes a ribbon graph, and gauge-theoretic concepts such as connections, gauge transformations and observables are…

The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such…

Large-scale formalization projects in Lean rely on blueprints: structured dependency graphs linking informal mathematical exposition to formal declarations. While blueprints are central to human collaboration, existing tooling treats the…

We prove a linear and a nonlinear generalization of the Lax-Milgram theorem. In particular we give sufficient conditions for a real-valued function defined on the product of a reflexive Banach space and a normed space to represent all…

The goal of the present paper is to push forward the frontiers of computations on Farrell-Tate cohomology for arithmetic groups. The conjugacy classification of cyclic subgroups is reduced to the classification of modules of group rings…