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.
Formalizes synthetic differential geometry in Lean.
problem Formalizing synthetic differential geometry in a proof assistant.
method Formalization of synthetic differential geometry with Lean and mathlib.
result Proves a Taylor theorem for functions of several variables.
Lean 4 library formalizes mathematical finance, verifying over 200 theorems.
problem Formal verification of complex financial mathematics.
method Lean 4 proof assistant, Mathlib, and BrownianMotion package.
result Formal verification yields certified unification of known results.
Lean 4 library formalizes mathematical finance, verifying over 200 theorems.
problem Formal verification of complex financial mathematics.
method Lean 4 proof assistant, Mathlib, BrownianMotion package, formal verification of over 200 theorems.
result Formal verification yields certified unification of known financial results.
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.
Formalizes the Fundamental Theorem of Asset Pricing in Lean 4.
problem Formalizing the Fundamental Theorem of Asset Pricing in a proof assistant.
method Formalization in Lean 4 over Mathlib, covering three market settings.
result Constructs the equivalent martingale measure explicitly and proves its properties.
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.
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.
Developed a machine-checked Itô calculus for Brownian motion.
problem Formal verification of Itô calculus for Brownian motion.
method Machine-checked formalization in Lean over Mathlib.
result First machine-checked constructions of the Itô integral and Itô's formula.
A machine-checked Itô calculus for Brownian motion on [0,T]
problem Developing an L2 Itô calculus for Brownian motion method Formalized in Lean 4 on top of Mathlib and the BrownianMotion package
result First machine-checked proof of Itô's formula and construction of Itô integral as martingale-valued process
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.
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.
Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…
We introduce trading fees into AMM models and analyze their impact on swap rates and profits.
problem The impact of trading fees on AMM models and users' trading strategies.
method We extend a foundational AMM model by introducing a trading fee parameter and analyze the model using economic and mathematical rigor.
result Trading fees affect the additivity of swap rates and can lead to greater profits from larger trades.
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of classifier. Though such a proof appears simple on paper, analytic and measure-theoret…
Report on formalizing differential geometry in Lean.
problem Formalizing differential geometry in a proof assistant.
method Lean's type theory approach to formalization.
result Surprising differences between formal and informal proofs.
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.
We provide a computer-assisted proof of the holomorphy of the quartic and the octic meromorphic differentials arising in the main Theorem 4.11 of our paper 'The Classification of Branched Willmore spheres in the 3-Sphere and the 4-Sphere' (arXiv:1706.01405), using the free mathematical software Sage.
Lean 4 formalizes Stokes' theorem for smooth singular cubes.
problem Formalizing Stokes' theorem for singular cubes in arbitrary dimensions.
method Using true differential-form pullback via Frechet derivative, bridging to mathlib4's extDeriv.
result d^2=0 for singular cubical chains, chain-level Stokes extended.
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.
Scores political leanings in Web3 betting markets.
problem Understanding political motivations in decentralized prediction markets.
method Constructing PBLS from Polymarket data, analyzing 15k addresses, 4k events, 8k markets.
result Validated PBLS through internal and external comparisons, revealing political and profit motives.
Researchers solved a number-theoretic hypothesis to determine the spin parity of k-differentials.
problem Determining the spin parity of k-differentials on Riemann surfaces of genus zero and one.
method Proved a number-theoretic hypothesis (Conjecture A.10) by reformulating it in terms of Jacobi symbols and reducing it to a combinatorial identity.
result The spin parity of k-differentials on Riemann surfaces of genus zero and one was completely determined.
LeanML reduces machine learning project waste by estimating best performance without training models.
problem Avoidable wastes in machine learning projects.
method Lean design pattern based on mutual information and performance metrics.
result Estimating best performance without training models is faster and cheaper.
The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture.…
A study ranks critical Lean Six Sigma tools for implementation in Portuguese companies.
problem Identifying the most important tools for successful Lean Six Sigma implementation in Portugal.
method An online survey with Portuguese consultants evaluated 37 tools based on frequency of use, difficulty, importance, and impact. A ranking was developed using a procedure to assess consultants' know-how.
result Honshin Kanri, VOC, VSM were identified as the most important tools for Lean Six Sigma implementation.
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. 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.
Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.
problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.
Learning preferences implicit in the choices humans make is a well studied problem in both economics and computer science. However, most work makes the assumption that humans are acting (noisily) optimally with respect to their preferences. Such approaches can fail when people are themselves learning about what they wa…
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.
This paper formalizes the h-principle and sphere eversion in differential topology.
problem Formalizing the h-principle and sphere eversion in differential topology.
method Lean formalization of the local h-principle for first-order partial differential relations, using convex integration.
result Reproves Smale's sphere eversion theorem and formalizes advanced mathematics.
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…
We prove two conjectures of C. Gordon. We show that the maximal number of exceptional Dehn surgeries on a 1-cusped hyperbolic 3-manifold is 10, and that the maximal intersection number between exceptional slopes is 8. The proof uses a combination of new geometric techniques and a rigorous computer-assisted calculation.
Framework evaluates AI proposals for drug discovery, finds no LLM advantage.
problem No principled framework exists for evaluating AI-guided scientific selection under budget constraints.
method Formally verified metric (BSDS/DQS) penalizes false discoveries and excessive abstention.
result LLMs provide no marginal value over existing classifiers in drug discovery.
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.
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.
The paper proves rigidity of surgeries on the figure-eight knot complement.
problem Infinitesimal projective rigidity of surgeries on the figure-eight knot complement.
method Computer-assisted proof and explicit representations of the knot complement.
result Proves infinitesimal projective rigidity for surgeries far from the ideal point.
Understanding the representational power of Restricted Boltzmann Machines (RBMs) with multiple layers is an ill-understood problem and is an area of active research. Motivated from the approach of \emph{Inherent Structure formalism} (Stillinger & Weber, 1982), extensively used in analysing Spin Glasses, we propose a no…
We prove the Goldman-Parker Conjecture: A complex hyperbolic ideal triangle group is directly embedded in PU(2,1) if and only if the product of its three standard generators is not elliptic. We also prove that such a group is indiscrete if the product of its three standard generators is elliptic. A novel feature of thi…
Tests validity of DML estimators without assumptions.
problem Validating DML estimators without making assumptions.
method Develops tests to falsify assumptions for DML estimators.
result Falsifies assumptions for DML estimators with non-trivial power.
Quantum-assisted VAE improves similarity search in high-dimensional datasets.
problem Finding fast and memory-efficient similarity search in high-dimensional data.
method Construct a space-efficient search index based on the latent space of a Quantum-assisted Variational Autoencoder (QVAE).
result Real-world speedups and memory-efficient scaling to half a billion data points.
Efficient verified double auctions improve matching speed and detect errors.
problem Improving the efficiency and reliability of double auctions in financial markets.
method Formally verified implementation using Coq proof assistant, reducing time complexity and improving error detection.
result Improved efficiency with O(nlogn) time complexity, reducing runtime from days to minutes. Researchers prove existence of a special Einstein metric on a 12-dimensional sphere.
problem Proving the existence of a non-round Einstein metric invariant under a specific group action.
method Numerical analysis techniques were used to produce an approximate Einstein metric, which was then perturbed into a true Einstein metric.
result A novel O(3)imesO(10)-invariant Einstein metric on S12 was successfully constructed. Let Γ be the fundamental group of a surface of finite type and Comm(Γ) be its abstract commensurator. Then Comm(Γ) contains the solvable Baumslag--Solitar groups ⟨a,b:aba−1=bn⟩ for any n>1. Moreover, the Baumslag--Solitar group ⟨a,b:ab2a−1=b3⟩ has an imag…
In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.
Detects (2,5) torus knot using Khovanov homology and Floer homology.
problem Detecting the (2,5) torus knot using Khovanov homology.
method Combines Floer homology, Khovanov homology, and surface homeomorphisms.
result Proves Khovanov homology detects the (2,5) torus knot.
New AI assistant for power grid operators simplifies complex decision-making.
problem Complexity and uncertainty in power grid operations.
method Unified human-machine interface and AI integration.
result Development of a new assistant framework for power grid operators.
The simplest non-collision solutions of the N-body problem are the "relative equilibria", in which each body follows a circular orbit around the centre of mass and the shape formed by the N bodies is constant. It is easy to see that the moment of inertia of such a solution is constant. In 1970, D. Saari conjectured tha…