Related papers: Lasry-Lions regularization and a Lemma of Ilmanen
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree…
We show how Lasry-Lions's result on regularization of functions defined on $\mathbb{R}^n$ or on Hilbert spaces by sup-inf convolutions with squares of distances can be extended to (finite or infinite dimensional) Riemannian manifolds $M$ of…
We provide a simple abstract formalism of integration by parts under which we obtain some regularization lemmas. These lemmas apply to any sequence of random variables $(F_n)$ which are smooth and non-degenerated in some sense and enable…
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.
The Representation Theorem of Lions (RTL) is a version of the Lax--Milgram Theorem where completeness of one of the spaces is not complete. In this paper, RTL is deduced from an operator-theoretical version on normed space. The main point…
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…
The aim of this paper is to give a proof of improving of Zalcman's lemma.
We motivate and prove a strong pumping lemma for regular tree languages. The new lemma can be seen as the natural correspondent of Ogden's lemma for context-free string languages.
We consider a non-Gaussian option pricing model, into which the underlying log-price is assumed to be driven by an $\alpha$-stable distribution. We remove the a priori divergence of the model by introducing a Mellin regularization for the…
A key ingredient in the Taylor-Wiles proof of Fermat last theorem is the classical Ihara's lemma which is used to rise the modularity property between some congruent galoisian representations. In their work on Sato-Tate,…
We present a simple derivation of the Lamb shift using effective field theory techniques and dimensional regularisation.
The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…
The Bailey lemma is a famous tool to prove Rogers-Ramanujan type identities. We use shifted versions of the Bailey lemma to derive $m$-versions of multisum Rogers-Ramanujan type identities. We also apply this method to the Well-Poised…
The many-normal-means problem is a classic example that motivates the development of many important inferential procedures in the history of statistics. In this short note, we consider a further special case of the problem, which involves…
We give a proof of Ilmanen's lemma, which asserts that between a locally semi-convex and a locally semi-concave function it is possible to find a C$^{1,1}$ function.
We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…
This paper presents an approach to lemma synthesis to support advanced inductive entailment procedures based on separation logic. We first propose a mechanism where lemmas are automatically proven and systematically applied. The lemmas may…
Mathematical theorem proving is an important testbed for large language models' deep and abstract reasoning capability. This paper focuses on improving LLMs' ability to write proofs in formal languages that permit automated proof…
This paper is concerned with the numerical analysis of the explicit Euler scheme for ordinary differential equations with non-Lipschitz vector fields. We prove the convergence of the Euler scheme to regular lagrangian flow (Diperna-Lions…