Automated theorem prover proves non-orderability of groups.
problem Proving non-orderability of groups.
method Generic automated theorem prover with tools like positive cones, torsions, generalised torsions, and cofinal elements.
result Demonstrated automated proof of non-orderability of groups.
Study improves understanding of why agentic theorem provers succeed.
problem Understanding which components of agentic theorem provers improve proof success.
method Statistical provability theory and finite-horizon reachability MDP model.
result Bounds provability gap and explains components' effectiveness.
We consider the task of automated theorem proving, a key AI task. Deep learning has shown promise for training theorem provers, but there are limited human-written theorems and proofs available for supervised learning. To address this limitation, we propose to learn a neural generator that automatically synthesizes the…
New model shows hierarchical proof structure helps theorem provers.
problem How to efficiently learn proofs from teacher traces.
method Model proof search as MDP, analyze imitation learning from traces.
result Hierarchical proof structure leads to more efficient learning.
The problem-solving in automated theorem proving (ATP) can be interpreted as a search problem where the prover constructs a proof tree step by step. In this paper, we propose a deep reinforcement learning algorithm for proof search in intuitionistic propositional logic. The most significant challenge in the application…
In this paper, we demonstrate how to do automated theorem proving in the presence of a large knowledge base of potential premises without learning from human proofs. We suggest an exploration mechanism that mixes in additional premises selected by a tf-idf (term frequency-inverse document frequency) based lookup in a d…
LeanDojo removes barriers to theorem proving with open-source tools and data.
problem Difficulty in reproducing and building on existing theorem proving methods.
method Introduces LeanDojo, an open-source Lean playground with toolkits, data, models, and benchmarks.
result ReProver, an LLM-based prover augmented with retrieval, outperforms non-retrieval baselines and GPT-4.
GPT-f uses language models to find new proofs in formal math.
problem Generating original mathematical terms for automated theorem proving.
method Transformer-based language model for automated theorem proving and proof assistant.
result GPT-f contributed new proofs to the Metamath library.
Scalable verifier for recurrent neural networks using polyhedral abstractions.
problem Certifying the correctness of recurrent neural networks.
method Combining sampling, optimization, and Fermat's theorem for polyhedral abstractions; gradient descent for refinement.
result Successfully verified challenging recurrent models in various domains.
Formalizes vNM utility theorem using Lean 4, proving existence and uniqueness.
problem Formalizing and proving the von Neumann-Morgenstern utility theorem.
method Implement classical axioms in Lean 4, formalizing preference relations over lotteries.
result Machine-verified proofs of existence and uniqueness of utility representations.
Transformed geometry into algebra to prove Pick's theorem efficiently.
problem Translating geometric Pick's theorem into formal algebraic proof.
method Formalized geometric Pick's theorem into algebraic proof using Lean.
result Efficient formal proof of Pick's theorem.
Benchmark for math reasoning models from human proofs.
problem Measuring and accelerating machine learning models in high-level mathematical reasoning.
method Built a non-synthetic dataset from theorem prover proofs, defined a task for model to fill in missing propositions, used hierarchical transformer to improve performance.
result Neural models can capture non-trivial mathematical reasoning, hierarchical transformer outperforms baseline.
This paper autoformalizes Euclidean geometry using LLMs and theorem provers.
problem Challenges in formalizing Euclidean geometry due to reliance on diagrams.
method Combines neuro-symbolic framework, SMT solvers, and LLMs to fill in diagrammatic gaps.
result Demonstrates the capability and limitations of LLMs on autoformalizing geometry problems.
Protocol assesses better model among two opaque models with minimal interaction.
problem Learning from two provers, one honest, the other potentially deceptive.
method Formulated and implemented a protocol for assessing better models among two opaque models.
result Protocol achieves near-optimal performance with minimal interaction and query access.
In this article, we introduce rack invariants of oriented Legendrian knots in the 3-dimensional Euclidean space endowed with the standard contact structure, which we call Legendrian racks. These invariants form a generalization of the quandle invariants of knots. These rack invariants do not result in a complete invari…
Paper formalizes multi-dimensional FSD using geometric methods.
problem Complex measure theory and calculus barriers to formalization in proof assistants.
method Geometric framework for first-order stochastic dominance in N dimensions.
result Geometric approach bypasses complex integration theory for direct comparison of survival probabilities.
Lean Copilot uses LLMs to assist theorem proving in Lean, improving efficiency and automation.
problem Challenges in using existing neural theorem provers to prove novel theorems autonomously.
method Introduces Lean Copilot, a framework for integrating LLMs into Lean's theorem proving process.
result Lean Copilot automates 74.2% of proof steps on average, significantly improving over existing methods.
In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant. Interactive theorem provers such as Coq enable users to construct machine-checkable proofs in a step-by-step manner. Hence, they provide an opportuni…
Formalizes integral curves on Banach manifolds in Lean.
problem Existence and uniqueness of integral curves on Banach manifolds.
method Formalized differential equations on Banach spaces, then generalized to Banach manifolds.
result Established theorems for integral curves on Banach manifolds.
This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significa…
Formal methods verify continuous auctions at exchanges.
problem Ensuring fairness and correctness in continuous auctions.
method Formal specification, design, and verification of continuous double auctions.
result A verified algorithm satisfies natural properties of auctions.
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result (i.e. that a knot is the unknot), whilst simultaneously using a model finder to try …
This paper formalizes Q-learning and linear TD convergence using Lean 4.
problem Formalizing convergence properties of Q-learning and linear TD learning. method Formal verification using Lean 4 theorem prover and Mathlib library.
result Formalized almost sure convergence of Q-learning and linear TD learning. We introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade. These days, all big exchanges use computer algorithms that implement double sided auctions to match buy and sell requests and these algorithms must abide by certain regulator…
Neural symbolic processing aims to combine the generalization of logical learning approaches and the performance of neural networks. The Neural Theorem Proving (NTP) model by Rocktaschel et al (2017) learns embeddings for concepts and performs logical unification. While NTP is promising and effective in predicting fact…
Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.
problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.
Formally verifies fairness and uniformity in financial market trades.
problem Ensuring fairness and uniformity in automated trading systems.
method Formal definition and verification in Coq proof assistant.
result Properties of double-sided auction mechanisms verified.
Neuro-symbolic system tackles conversational AI's need for natural, broad-ranging dialogue.
problem Understanding unstated presumptions in conversational AI commands.
method Neuro-symbolic theorem prover for multi-hop reasoning.
result Extracts multi-hop reasoning chains from natural language commands.
This research simplifies verification of machine learning systems using reparameterization.
problem Reduce or eliminate serious bugs in machine learning systems.
method Use proof assistants to construct machine-checked proofs of correctness, leveraging reparameterization to handle probabilistic claims.
result Demonstrates broad applicability of reparameterization to verify different types of machine learning systems.
Classical clients can verify quantum learning tasks efficiently.
problem Making quantum learning accessible to classical clients.
method Developed a framework for classical verification of quantum learning.
result Quantum learning tasks can be efficiently verified by classical verifiers.
Global inverse function theorem proved easily using Riemannian geometry.
problem Global inverse function theorem in Riemannian geometry.
method Hopf--Rinow theorem in Riemannian geometry.
result Hadamard's global inverse function theorem is proven easily.
A new comparison theorem for geometric spaces.
problem Geometric space comparison theorems.
method Relative form of Toponogov comparison theorem.
result New geometric space comparison theorem established.
Paper develops formulas and theorems in Hermitian geometry.
problem None explicitly stated in the abstract.
method Develops second variational formulas and index forms in Hermitian geometry.
result Establishes results analogous to classical theorems in Riemannian geometry.
The paper proves three circles theorems and Liouville type theorems for subharmonic and holomorphic functions.
problem Establishing theorems for subharmonic and holomorphic functions on specific geometric structures.
method Using subharmonic and holomorphic functions on Riemannian manifolds and gradient shrinking Ricci solitons.
result Proves Liouville type theorems as applications of the established theorems.
Revises a theorem by Thurston, finding a counter-example and a weaker version.
problem The bounded image theorem in Haken manifolds.
method Providing a counter-example and a weaker version of the second statement of Thurston's theorem.
result A counter-example and a weaker version of the second statement of Thurston's theorem are presented.
Proofs for Moon's theorem and its generalization.
problem Proving Moon's theorem and its generalization.
method Proofs based on key lemmas.
result Generalization of the four-vertex theorem.
Analyzes Saito vanishing theorem using L2 methods.
problem Proving the Saito vanishing theorem.
method Uses L2-methods to prove the theorem. result Analytic proof of the Saito vanishing theorem.
Investigates proving geometric theorems over complex and real numbers using tilings.
problem Proving incidence theorems over C and R using the master theorem.
method Formalizes tiling proofs and introduces a hierarchy of theorems based on topological spaces.
result Identifies which theorems can or cannot be proved over C and R.
Extends symplectic reduction and theorem to Lie algebroids.
problem Symplectic reduction and theorem for Lie algebroids.
method Extends Marsden-Weinstein reduction and Darboux-Moser-Weinstein theorems.
result Obtained coisotropic embedding theorem for symplectic Lie algebroids.
Paper generalizes complex Brunn-Minkowski theory and proves new extension theorems.
problem Complex Brunn-Minkowski theory and extension theorems.
method Hilbert bundle approach to complex Brunn-Minkowski theory.
result Generalizes Guan's sharp strong openness theorem and sharp Ohsawa-Takegoshi extension theorem.
Proves Thurston's bounded image theorem for Haken manifolds.
problem Proving Thurston's bounded image theorem for Haken manifolds.
method Using recent developments in Kleinian group theory.
result A proof of Thurston's original bounded image theorem.
Method upgrades limit theorems to mixing limit theorems for dynamical systems.
problem Improving limit theorems for dynamical systems.
method General method for upgrading limit theorems to mixing limit theorems.
result Mixing limit theorems for specific subbundles of the Kontsevich-Zorich cocycle.
Formulates Index III lemma and Rauch III theorem with applications.
problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.
In LM, we proved a family version of the famous Witten rigidity theorems and several family vanishing theorems for elliptic genera. In this paper, we gerenalize our theorems LM in two directions. First we establish a family rigidity theorem for the Dirac operator on loop space twisted by general positive energy loop gr…
The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.
problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.
Proves two theorems on odd-dimensional manifolds with boundary.
problem Proving theorems on manifolds with boundaries.
method Proof of theorems using mathematical techniques.
result Proved the general Kastler-Kalau-Walze and Dabrowski-Sitarz-Zalecki type theorems.
Sharp convergence theorem for sphere submanifolds proved.
problem Sphere submanifolds in spheres.
method Proved a sharp convergence theorem.
result New differentiable sphere theorem for submanifolds in spheres.
INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.
problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.