Related papers: On the Cotlar-Stein lemma

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

We give a proof of Fermat's little theorem which does not use nor arithmetic(Euclidean algorithm) neither algebra (group theory), but it rather employs the field of the formal power series Q((x)). The note is an example of a mathematical…

We give a proof of Pythagoras' theorem which does not use neither squares nor similarity of triangles.

I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed…

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).

In the paper different kinds of proof of a given statement are discussed. Detailed descriptions of direct and indirect methods of proof are given. Logical models illustrate the essence of specific types of indirect proofs. Direct proofs of…

The direct part of Stein's lemma in quantum hypothesis testing is revisited based on a key operator inequality between a density operator and its pinching. The operator inequality is used to show a simple proof of the direct part of Stein's…

We give a counting based proof of the Graham Pollak Theorem

We provide a permutation-invariant version of the Koml\'os' theorem for non-negative random variables. The proof is quite elementary in the sense that it did not use the Axiom of Choice, and was based on a recent result in [3].

In this note, we give a simple, counting based proof of Fisher's Inequality that does not use any tools from linear algebra.

The aim of this paper is to prove Cotlar's ergodic theorem modeled on the set of primes.

We present a new and direct proof of Grothendieck's generic freeness lemma in its general form. Unlike the previously published proofs, it does not proceed in a series of reduction steps and is fully constructive, not using the axiom of…

We present a calculus, called the scheme-calculus, that permits to express natural deduction proofs in various theories. Unlike $\lambda$-calculus, the syntax of this calculus sticks closely to the syntax of proofs, in particular, no names…

We use Beltrami's theorem as an excuse to present some arguments from parabolic differential geometry without any of the parabolic machinery.

We provide proofs for the fact that certain orders have no descending chains and no antichains.

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

We prove a wall crossing formula of Donaldson-Thomas type invariants without Chern-Simons functionals.

We provide an elementary proof of a bicategorical pasting theorem that does not rely on Power's 2-categorical pasting theorem, the bicategorical coherence theorem, or the local characterization of a biequivalence.

The strong no loop conjecture states that a simple module of finite projective dimension over an artin algebra has no non-zero self-extension. The main result of this paper establishes this well known conjecture for finite dimensional…