Related papers: Chernoff's Inequality - A very elementary proof
We give a short proof of a strengthening of the Maximal Ergodic Theorem which also immediately yields the Pointwise Ergodic Theorem.
In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor…
There is a serious mistake in the proof.
We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…
Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the…
We use the definition of a fractional integral, recently proposed by Katugampola, to establish a generalization of the reverse Minkowski's inequality. We show two new theorems associated with this inequality, as well as state and show other…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
In this article we discuss a generalized Wirtinger inequality.
We present a new, elementary, dynamical proof of the prime number theorem.
We prove a $C^\infty$ version of the Nekhoroshev's estimate on the stability times of the actions in close to integrable Hamiltonian systems. The proof we give is a variant of the original Nekhoroshev's proof and it consists in first…
We give here a simple proof of weighted logarithmic Sobolev inequality, for example for Cauchy type measures, with optimal weight, sharpening results of Bobkov-Ledoux. Some consequences are also discussed.
We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.
We give a new proof of the compactness of minimizing sequences of the Sobolev inequalities in the critical case. Our approach relies on a simplified version of the concentration-compactness principle, which does not require any refinement…
In this paper, we give a simple counter example to the famous Hodge conjecture.
We prove the Erdos-Turan equidistribution inequality, using a construction due to Chebyshev, Markov, and Stieltjes. The method is applicable in a more general setting. As an example, we state another inequality that can be proved using this…
We present a somewhat different way of looking on Shannon entropy. This leads to an axiomatisation of Shannon entropy that is essentially equivalent to that of Fadeev. In particular we give a new proof of Fadeev theorem.
We give a generalization of the Shestakov-Umirbaev inequality which plays an important role in their solution of the tame generators conjecture.
We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.
We highlight overlap as one of the simplest inequalities in linear space that yields a number of useful results. One obtains the Cauchy-Schwarz inequality as a special case. More importantly, a variant of it is seen to work desirably in…
A lower bound for the Gaussian Q-function is presented in the form of a single exponential function with parametric order and weight. We prove the lower bound by introducing two functions, one related to the Q-function and the other…