Related papers: On the Cotlar-Stein lemma

Fermat's Last Theorem (FLT) implies that the Frey curves do not exist. A proof of FLT independent of proved Taniyama-Shimura-Weil conjecture is presented.

The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using…

In this note, we prove that there is no number with the Lehmer property in the sequences of Jaconsthsl or Jacobsthal-Lucas numbers.

We give a proof of the hard Lefschetz theorem for orbifolds that does not involve intersection homology. This answers a question of Fulton. We use a foliated version of the hard Lefschetz theorem due to El Kacimi.

This technical report presents a direct proof of Theorem~1 in [1] and some consequences that also account for (20) in [1]. This direct proof exploits a state space change of basis which replaces the coupled difference equations (10) in [1]…

The aim of this paper is to give a proof of improving of Zalcman's lemma.

We give a new proof of Lucas' Theorem in elementary number theory.

An elementary proof of Bertrand's theorem is given by examining the radial orbit equation, without needing to solve complicated equations or integrals.

Upon re-examining Arnold's established lemma for explaining his famous limit problem, we have determined that while the lemma itself is correct, there is a defect in the original geometric proof. In this paper, we prove the correctness of…

We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ regular (tree) automata.

We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.

We describe two distinct simple, short and self contained proofs of the composition lemma.

Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the…

We give an intuitive combinatorial proof of Ky Fan's covering lemma based on the Borsuk-Ulam theorem. We then show how this approach can be generalized to Ky Fan's covering lemma for several linear orders.

We demonstrate that theories $\text{Z}^-$, $\text{ZF}^-$, $\text{ZFC}^-$ (minus means the absence of the Power Set axiom) and $\text{PA}_2$, $\text{PA}_2^-$ (minus means the absence of the Countable Choice schema) are equiconsistent to each…

We give a short geometric proof of the Kochen-Specker no-go theorem for non-contextual hidden variables models. Note added to this version: I understand from Jan-Aake Larsson that the construction we give here actually contains the original…

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes.…