Related papers: An Elementary Proof of a Minimax Theorem

The aim of this note is to prove that almost-minimizers of the perimeter are Reifenberg flat, for a very weak notion of minimality. The main observation is that smallness of the excess at some scale implies smallness of the excess at all…

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

This paper presents a novel direct elementary proof for Fermat's Last Theorem. We use algebra, modular math, and binomial series to develop inherent mathematical relationships hidden within Fermat's Last Theorem. With these derived…

We give a simple proof of the existence of a minimizer for the Sobolev inequality. Our proof is based on a representation formula via a cut-off fundamental solution.

A short and almost elementary proof of the Boros-F\"uredi-B\'ar\'any-Pach-Gromov theorem on the multiplicity of covering by simplices in $\mathbb R^d$ is given.

This paper establishes three minimax theorems for possibly nonconvex functions on Euclidean spaces or on infinite-dimensional Hilbert spaces. The theorems also guarantee the existence of saddle points. As a by-product, a complete solution…

We give an elementary, self-contained and quick proof of Belyi's theorem. As a by-product of our proof we obtain an explicit bound for the degree of the defining number field of a Belyi surface.

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

In this paper we give sufficient conditions guaranteeing the validity of the well-known minimax theorem for the lower Snell envelope with respect to a family of absolutely continuous probability measures. Such minimax results play an…

We introduce a notion of a weak elementary fibration and prove that it does exist in certain interesting cases. Our notion is a modification of the M. Artin's notion of an elementary fibration.

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

Standard proofs of Lusin's theorem, using simple functions, are sometimes quite elaborate. Here, we give a one-sentence proof of Lusin's theorem. We do not believe our approach, by way of inverse images, is new. However, this particular…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…

I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.

Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.

We give a short proof of Stein's universal multiplier theorem, purely by probabilistic methods, thus avoiding any use of harmonic analysis techniques (complex interpolation or transference methods).