Related papers: A more reasonable proof of Cobham's theorem
Doob's theorem provides guarantees of consistent estimation and posterior consistency under very general conditions. Despite the limitation that it only guarantees consistency on a set with prior probability 1, for many models arising in…
We provide a new short proof for the Birman--Solomyak theorem for Hilbert--Schmidt operators and give an application to a Schr\"odinger--Poisson system.
We provide a new representation-independent formulation of Occam's razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based and VC-based versions of Occam's…
In this note we provide a quick proof of the Sklar's Theorem on the existence of copulas by using the generalized inverse functions as in the one dimensional case, but a little more sophisticated.
We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
We give a proof of Fermat's little theorem which does not use nor arithmetic(Euclidean algorithm) neither algebra (group theory), but it rather employs the field of the formal power series Q((x)). The note is an example of a mathematical…
We present a short and self-contained proof of the choosability version of Brooks' theorem.
We prove some new results related to Tanaka's formula.
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…
Parikh's theorem is a fundamental result of the formal language's theory. There had been published many proofs and many papers claimed to provide a simplified proof, but most of them are long and still complicated. We provide the proof that…
We proved a KAM theorem on existence of invariant tori in generalized Hamiltonian systems without action-angle variables. It is a generalization of the result of de la Llave et al. [Llave, 2005] that deals with canonical Hamiltonian system.
We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.
The aim of this paper is to present a very simple original, purely formal, proof of Quillen's adjunction theorem for derived functors, and of some more recent variations and generalizations of this theorem. This is obtained by proving an…
We prove the adiabatic theorem for quantum evolution without the traditional gap condition. All that this adiabatic theorem needs is a (piecewise) twice differentiable finite dimensional spectral projection. The result implies that the…
We prove explicit versions of the Kronecker-Weyl theorems, both in a discrete and a continuous settings, without any linear independence hypothesis. As an application, we propose an alternative approach to problems concerning asymptotic…
We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.
We give in the present work a new methodology that allows to give isoperimetric proofs, for Kneser's Theorem and Kemperman's structure Theory and most sophisticated results of this type. As an illustration we present a new proof of Kneser's…
John Horton Conway's Cosmological Theorem, about Audioactive sequences, for which no extant proof existed, is given a computer-generated proof, hopefully for good.