Related papers: Formalising perfectoid spaces
Chemical theory can be made more rigorous using the Lean theorem prover, an interactive theorem prover for complex mathematics. We formalize the Langmuir and BET theories of adsorption, making each scientific premise clear and every step of…
While large language models (LLMs) have shown progress in mathematical reasoning, they still face challenges in formalizing theorems that arise from instantiating abstract structures in concrete settings. With the goal of auto-formalizing…
In their 2022 lecture notes on condensed sets, Clausen and Scholze mentioned in a remark that the important subclass of quasiseparated condensed sets is equivalent to the category of so-called compactological spaces defined by Waelbroeck in…
Automated proof assistants are a technology pre-empting mistakes in mathematics. In our practice we have seen that reasoning about planar diagrams is difficult to both humans and computers. One example that has led to wrong statements in…
Formal mathematics is mathematics done within the framework of a formal logic. It offers major benefits to mathematicians as well as to computing professionals, engineers, and scientists who use mathematics in their work. The standard…
Church's simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated…
Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistants or interactive provers, provide an interactive environment for the creation of formal…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
Consider the topologically enriched category of compact smooth manifolds (possibly with corners), with morphisms given by codimension zero smooth embeddings. Now formally identify any object X with its thickening X x [-1,1]. We prove that…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
There has been a long-standing question about whether being perfectoid for an algebra is local in the analytic topology. We provide affirmative answers for the algebras (e.g., over $\overline{\mathbb{Z}_p}$) whose spectra are inverse limits…
We introduce singular homology for non-Archimedean analytic spaces using a cosimplicial perfectoid space as a Galois representation. We define an integration along a cycle, which gives a pairing with the singular homology and the space of…
In a previous work, "pure data" is proposed as an axiomatic foundation for mathematics and computing, based on "finite sequence" as the foundational concept rather than based on logic or type. Within this framework, objects with…
Formal reasoning and automated theorem proving constitute a challenging subfield of machine learning, in which machines are tasked with proving mathematical theorems using formal languages like Lean. A formal verification system can check…
We introduce and study graded perfectoid rings as graded analogues of Scholze's (integral) perfectoid rings. We establish a categorical equivalence between graded perfectoid rings and graded perfect prisms, extending the Bhatt-Scholze's…
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL…
The ever-growing complexity of mathematical proofs makes their manual verification by mathematicians very cognitively demanding. Autoformalization seeks to address this by translating proofs written in natural language into a formal…
We survey some old and new results concerning the classification of complete metric spaces up to isometry, a theme initiated by Gromov, Vershik and others. All theorems concerning separable spaces appeared in various papers in the last…
On the one hand, ordered completion is a fundamental technique in equational theorem proving that is employed by automated tools. On the other hand, their complexity makes such tools inherently error prone. As a remedy to this situation we…
We present the proof assistant homotopy.io for working with finitely-presented semistrict higher categories. The tool runs in the browser with a point-and-click interface, allowing direct manipulation of proof objects via a graphical…