Related papers: A Direct Proof of the Theorem on Formal Functions
In this work the implicit function theorem is used for searching local symbolic resolution of differential equations. General results of existence for first order equations are proven and some examples, one relative to cavitation in a…
A new proof of the optical theorem at all orders is presented. Although the theorem is a well-known result in Quantum Field Theory, our proof is interesting because it is particularly simple. Indeed, the theorem is a direct consequence of…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational…
Mathematical theorem proving is an important testbed for large language models' deep and abstract reasoning capability. This paper focuses on improving LLMs' ability to write proofs in formal languages that permit automated proof…
In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
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…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.
In this paper, we have proved four theorems on the degree of approximation of continuous functions by matrix means of their Fourier series which is expressed in terms of the modulus of continuity and a non-negative mediate function.
In this short note, we will explain that the good moduli space morphisms behave as if they are proper when we consider sheaf operations, though they are not separated. For example, the decomposition theorem and the base change theorem hold…
We develop a general theory of extensions of flat functors along geometric morphisms of toposes, and apply it to the study of the class of theories whose classifying topos is equivalent to a presheaf topos. As a result, we obtain a…
A description of a ring of functions on the base of a universal formal deformation for several moduli problems is given. The answer is given in terms of a homology group of a certain dg Lie algebra canonically (up to an essentially unique…
We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…
We give a self-contained exposition of the proof of faithfully flat descent for projectivity of modules. This fills a gap in the proof given in the literature.
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
Let $X$ be an $F$-finite smooth scheme of essentially finite type over a perfect field. This article proves the existence of $b$-functions for locally finitely generated unit $F$-modules when equipped with their induced…
Mathematics formalisation is the task of writing mathematics (i.e., definitions, theorem statements, proofs) in natural language, as found in books and papers, into a formal language that can then be checked for correctness by a program. It…