Related papers: A simple proof of Renner's exponential de Finetti …
In 1931 de Finetti proved what is known as his Dutch Book Theorem. This result implies that the finite additivity {\it axiom} for the probability of the disjunction of two incompatible events becomes a {\it consequence} of de Finetti's…
We show that an elementary proof of Fermat's Last Theorem (FLT) exists. Our paper also extends the scope of FLT from integers to all rational numbers.
A very simple but useful almost sure convergence theorem of probability is given.
We revisit the quantum de Finetti theorem. We state and prove a couple of variants thereof. In parallel, we introduce an operator version of the Martin boundary on quantum groups and prove generalizations of Biane's theoresm. Our proof of…
We prove a version of ergodic theorem for an action of an amenable group, where a F{\o} lner sequence needs not to be tempered. Instead, it is assumed that a function satisfies certain mixing condition.
In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…
Weinstein's[2] brilliant short proof of de Branges'[1] theorem can be made yet much shorter(modulo routine calculations), completely elementary (modulo L\"owner theory), self contained(no need for the esoteric Legendre polynomials' addition…
After defining a notion of $\epsilon$-density, we provide for any real algebraic number $\alpha$ an estimate of the smallest $\epsilon$ such that for each $m>1$ the set of vectors of the form $(t,t\alpha,...,t\alpha^{m-1})$ for $t\in\R$ is…
In this paper we prove transference inequalities for regular and uniform Diophantine exponents in the weighted setting. Our results generalize the corresponding inequalities that exist in the `non-weighted' case.
We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.
A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…
We generalize the { ${\rm M}$-estimator} put forward by Catoni in his seminal paper [C12] to the case in which samples can have finite $\alpha$-th moment with $\alpha \in (1,2)$ rather than finite variance, our approach is by slightly…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
We establish nontrivial bounds for general bilinear forms with a given periodic function, which are thought of as an analogue of van der Corput differencing for exponential sums. The proof employs Poisson summation, Cauchy-Schwarz, and the…
We give an elementary and constructive proof for a theorem of de Smit et Lenstra. Note: In version 1, was missing the proof that "completely secant" implies "1-secant"
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.
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
We give a simple proof of the Emch closing theorem by introducing a new invariant measure on the circle. Special cases of that measures are well-known and have been used in the literature to prove Poncelet's and Zigzag theorems. Some…
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…