Related papers: A really simple elementary proof of the uniform bo…

We compute the "norm" of irreducible uniformly bounded representations of SL2R. We show that the Kunze-Stein version of the uniformly bounded representations has minimal norm in the similarity class of uniformly bounded representations.

Every beginning real analysis student learns the classic Heine-Borel theorem, that the interval [0,1] is compact. In this article, we present a proof of this result that doesn't involve the standard techniques such as constructing a…

The'broken windows only theorem' is the main theorem of the third paper among a series of the paper in which Thurston proved his uniformisation theorem for Haken manifolds. In this chapter, we show that the second statement of this theorem…

The main result of the paper is the construction of explicit uniformly bounded basis in the spaces of complex homogenous polynomials on the unit ball of $C^3$, extending an earlier result of the author in the $C^2$ case

We give a short proof of the most general version of the Nullstellensatz without using the Axiom of Choice.

We prove Landen's transformation by a direct elementary transformation of infinite series

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

We prove the Aharoni Berger Conjecture

A classical proof of Pisier's construction of a polynomially bounded operator not similar to a contraction is given.

The aim of this article is to give a new proof of Cohen-Gabber theorem in the equal characteristic $p>0$ case.

A simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete…

An elementary proof is given to show that a parametrised algebraic curve in the plane may be traced out, in the sense of A. B. Kempe, by a finite pinned linkage. Additionally it is shown that any parametrised continuous curve \gamma: [0,1]…

I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…

The shortest known proof of the law of quadratic reciprocity (without supplements) is presented.

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)