Related papers: On the Cotlar-Stein lemma

We give a probabilistic proof of the orbit-counting lemma.

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

In this paper, we state as a conjecture a vector-valued Hopf-Dunford-Schwartz lemma and give a partial answer to it. As an application of this powerful result, we prove some Fe fferman-Stein inequalities in the setting of Dunkl analysis…

We show that Thompson's $A\times B$-Lemma can be obtained as a consequence of the Brauer pair version of Brauer's Third Main Theorem.

We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general…

The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…

A selfcontained proof of the KAM theorem in the Thirring model is discussed.

Arguably the simplest variation of this style of proof as we avoid reducing to the cubic case entirely.

This note proposes a probabilistic language-free proof of the famous Croot-Laba-Sisask Lemma. In between, we do the same for the Khintchine and Marcinkiewicz-Zygmund inequalities and explicitate the implied constants.

On the basis of energy conservation law an without utilizing Linear Fracture Mechanics (LFM) postulates the equation of a real-structure material elastic-plastic fracture has been derived. With the help of this equation the force and energy…

We state and prove a Lemma in 1 variable Calculus, that justifies some arguments previously used to ilustrate non-uniqueness of some generalized physical quantities.

We prove a variation of Gronwall's lemma.

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 the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

Three central results in economic theory --- Brouwer's fixed-point theorem, Sperner's lemma, and the Knaster-Kuratowski-Mazurkiewicz (KKM) lemma --- are known to be equivalent. In almost all cases, elementary direct proofs of one of these…

We give a direct geometric proof of the quantum Monk's formula which relies only on classical Schubert calculus.

We offer a self-contained proof of Lenagan's Theorem which does not rely on Goldie's Theorem

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 an elementary proof of Brouwer's fixed-point theorem. The only mathematical prerequisite is a version of the Bolzano-Weierstrass theorem: a sequence in a compact subset of $n$-dimensional Euclidean space has a convergent subsequence…

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…