Related papers: Formalising perfectoid spaces
Interactive theorem provers (ITPs) are powerful tools for the formal verification of mathematical proofs down to the axiom level. However, their lack of a natural language interface remains a significant limitation. Recent advancements in…
Mathematical software systems are becoming more and more important in pure and applied mathematics in order to deal with the complexity and scalability issues inherent in mathematics. In the last decades we have seen a cambric explosion of…
In this paper we develop a formalism for working with twisted realizations of vertex and conformal algebras. As an example, we study realizations of conformal algebras by twisted formal power series. The main application of our technique is…
In his foundational study of $p$-adic Hodge theory, Faltings introduced the method of almost \'etale extensions to establish fundamental comparison results of various $p$-adic cohomology theories. Scholze introduced the tilting operations…
Chain-of-Thought (CoT) prompting has become the de facto method to elicit reasoning capabilities from large language models (LLMs). However, to mitigate hallucinations in CoT that are notoriously difficult to detect, current methods such as…
Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research. A mitigation is using LLMs to generate formal proofs in languages like Lean. We perform the…
We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…
Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive…
A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into…
A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…
The concept of a $ C $*-algebra-valued metric space was introduced in 2014. It is a generalization of a metric space by replacing the set of real numbers by a $ C $*-algebra. In this paper, we show that $ C $*-algebra-valued metric spaces…
Despite the vast body of research literature proposing algorithms with formal guarantees, the amount of verifiable code in today's systems remains minimal. This discrepancy stems from the inherent difficulty of verifying code, particularly…
Based on topological Rudin's Lemma, we investigate two new kinds of sets - Rudin sets and well-filtered determined sets in $T_0$ topological spaces. Using such sets, we formulate and prove some new characterizations for well-filtered spaces…
We formalize the multi-graded Proj construction in Lean4, illustrating mechanized mathematics and formalization.
An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory…
We introduce a new theorem prover for classical higher-order logic named auto2. The prover is designed to make use of human-specified heuristics when searching for proofs. The core algorithm is a best-first search through the space of…
An exploration into the uses of the Fourier transform in the areas of algebraic and arithmetic geometry. In particular this treats the topics of Banach-Colmez spaces, for which an introduction to the theory of perfectoid spaces is given.…
Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a…
The notion of soft sets is introduced as a general mathematical tool for dealing with uncertainty. In this paper, we consider the concepts of soft compactness, countably soft compactness and obtain some results. We study some soft…
Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed higher-order syntax together with its formalization in the Coq proof…