Related papers: A New Proof of The Strong Subadditivity Theorem

We prove new, general versions of Bernstein-von Mises theorem for both well-specified and misspecified models when the log-likelihood is concave in the parameter and the prior distribution is log-concave. Unlike classical versions of…

The classical theorem of Erd\H os \& Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under…

We provide a necessary and sufficient condition for the validity of the following Landsberg-Thirring theorem: for a real-valued function on a convex set, any two of the properties of superadditivity, concavity and homogeneity implies the…

This is an invited contribution to the discussion on Professor Deborah Mayo's paper, "On the Birnbaum argument for the strong likelihood principle," to appear in Statistical Science. Mayo clearly demonstrates that statistical methods…

Low degree tests play an important role in classical complexity theory, serving as basic ingredients in foundational results such as $\mathsf{MIP} = \mathsf{NEXP}$ [BFL91] and the PCP theorem [AS98,ALM+98]. Over the last ten years, versions…

After reviewing Bertini's life story, a fascinating drama, we make a critical examination of the old statements and proofs of Bertini's two fundamental theorems, the theorem on variable singular points and the theorem on reducible linear…

We provide a simple proof of the Lieb-Robinson bound and use it to prove the existence of the dynamics for interactions with polynomial decay. We then use our results to demonstrate that there is an upper bound on the rate at which…

We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…

In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…

Let $\cF$ be a family of finite loops closed under subloops and factor loops. Then every loop in $\cF$ has the strong Lagrange property if and only if every simple loop in $\cF$ has the weak Lagrange property. We exhibit several such…

A new formulation of what may be called the "fundamental theorem of the theory of relativity" is presented and proved in (3+1)-space-time, based on the full classification of special transformations and the corresponding velocity addition…

The aim of this paper is to give a precise proof of the completeness of Lamb modes and associated modes. This proof is relatively simple and short but relies on two powerful mathematical theorems. The first one is a theorem on elliptic…

The present paper is devoted to provide conditions for the Levi--Malcev theorem to hold or not to hold (i.e. for two Levi subalgebras to be or not conjugate by an inner automorphism) in the context of finite-dimensional Leibniz algebras…

Demailly, Ein and Lazarsfeld \cite{DEL} proved the subadditivity theorem for multiplier ideals, which states the multiplier ideal of the product of ideals is contained in the product of the individual multiplier ideals, on non-singular…

Toda's Theorem is a fundamental result in computational complexity theory, whose proof relies on a reduction from a QBF problem with a constant number of quantifiers to a model counting problem. While this reduction, henceforth called…

We strengthen "The Free Will Theorem" [1] in several ways, by replacing the axiom FIN by a weaker axiom MIN, and also by allowing the particles' responses to depend on past half-spaces rather than on on past light cones. This change allows…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…

The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic…

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…