Related papers: Proofs by example
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free…
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…
The Hurwitz chain gives a sequence of pairs of Farey approximations to an irrational real number. Minkowski gave a criterion for a number to be algebraic by using a certain generalization of the Hurwitz chain. We apply Minkowski's…
We show how Cartesian method can be used in the proof of fundamental planimetric topics of the school course, such as introduction of trigonometric functions, equation of a line and similarity of triangles. This work also can be considered…
Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
This paper studies the change point problem for a general parametric, univariate or multivariate family of distributions. An information theoretic procedure is developed which is based on general divergence measures for testing the…
We prove a strong analogue of Liouville's Theorem in Diophantine approximation for points on arbitrary algebraic varieties. We use this theorem to prove a conjecture of the first author for cubic surfaces in $\P^3$.
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
General acceptance of a mathematical proposition $P$ as a theorem requires convincing evidence that a proof of $P$ exists. But what constitutes "convincing evidence?" I will argue that, given the types of evidence that are currently…
Wirsing's theorem on approximating algebraic numbers by algebraic numbers of bounded degree is a generalization of Roth's theorem in Diophantine approximation. We study variations of Wirsing's theorem where the inequality in the theorem is…
In this note, we study a certain class of trigonometric series which is important in many problems. An unproved statement in Zygmund's book [5] will be proved and generalized. Further discussions based on this problem will also be made…
We establish a Liouville type theorem for the fractional Lane-Emden system: \begin{eqnarray*} \left\{\begin{array}{l@{\quad }l} (-\Delta)^\alpha u=v^q&{\rm in}\,\,\R^N,\\ (-\Delta)^\alpha v=u^p&{\rm in}\,\,\R^N, \end{array} \right.…
In a series of articles published in the C.R. Paris more than a century ago, T. P\'epin announced a list of ``theorems'' concerning the solvability of diophantine equations of the type $ax^4 + by^4 = z^2$. In this article, we show how to…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
We describe a general method for verifying inequalities between real-valued expressions, especially the kinds of straightforward inferences that arise in interactive theorem proving. In contrast to approaches that aim to be complete with…