Related papers: A Simple Proof of McNaughton Theorem

The issue and proof of Gurzadyan theorem are presented concisely, avoiding tedious and unnecessary calculations that would mask what is essential. The goal is to provide a good mathematical and physical understanding of the theorem, making…

A new simple proof of Stirling's formula via the partial fraction expansion for the tangent function is presented.

We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…

We provide a simple proof of Kamp's theorem.

This technical report presents a direct proof of Theorem~1 in [1] and some consequences that also account for (20) in [1]. This direct proof exploits a state space change of basis which replaces the coupled difference equations (10) in [1]…

We present a short proof of Jin's theorem which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. The given proof provides the explicit…

We present here a simple proof of Brown's diagonalizability theorem for certain elements of the algebra of a left regular band, including probability measures.

Approximations to the Kruskal-Katona theorem are stated and proven. These approximations are weaker than the theorem, but much easier to work with numerically.

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…

We present a short proof of the central limit theorem which is elementary in the sense that no knowledge of characteristic functions, linear operators, or other advanced results are needed. Our proof is based on Lindeberg's trick of…

In this note we shall give a new proof to a quadrature formulae due to Newton.

In this technical note we provide a simple proof of Nehari's theorem on the optimal approximation by $H_\infty$ functions, based on convex duality.

We give a one-sentence proof of McLaughlin and Rundell's inverse uniqueness theorem.

We give a simple proof of the Fourier Inversion Theorem, using the methods of nonstandard analysis.

The aim of this note is to provide an intrinsic proof of the Gauss--Bonnet theorem without invoking triangulations, which is achieved by exploiting complex structures.

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

We provide a simple and short proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints. The proof relies on an elementary linear algebra lemma and the local inverse theorem.

In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].

One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…

The paper presents a new proof of O'Cinneide's characterization theorem. It is much simpler than the original one and constructive in the sense that we not only show the existence of a phase type representation, but present a procedure…