Related papers: A New Proof of The Strong Subadditivity Theorem
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
The weak value approximation has been in use for thirty-five years, but it has not as of yet received a truly complete derivation, leaving its mathematical validity in a state of limbo. Herein, I fill this gap, deriving the weak value…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
Subatomic logic is a recent innovation in structural proof theory where atoms are no longer the smallest entity in a logical formula, but are instead treated as binary connectives. As a consequence, we can give a subatomic proof system for…
By stating the adiabatic theorem of quantum mechanics in a clear and rigorous way, we establish a necessary condition and a sufficient condition for its validity, where the latter is obtained employing our recently developed adiabatic…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…
We prove an adiabatic theorem for the evolution of spectral data under a weak additive perturbation in the context of a system without an intrinsic time scale. For continuous functions of the unperturbed Hamiltonian the convergence is in…
The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, sometimes under a complexity assumption.
We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…
A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.
The Lieb-Schultz-Mattis (LSM) theorem asserts that microscopic details of the system can impose non-trivial constraints on the system's low-energy properties. While traditionally applied to short-range interaction systems, where locality…
We introduce a new definition of a model for a formal mathematical system. The definition is based upon the substitution in the formal systems, which allows a purely algebraic approach to model theory. This is very suitable for applications…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
An MV-algebra (equivalently, a lattice-ordered Abelian group with a distinguished order unit) is strongly semisimple if all of its quotients modulo finitely generated congruences are semisimple. All MV-algebras satisfy a Chinese Reminder…
We investigate the distributions of quantum coherence characterized by superadditivity relations in multipartite quantum systems. General superadditivity inequalities based on the $\alpha$th ($\alpha\geqslant 1$) power of $l_1$ norm of…
In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often to be applied in areas such as mathematical economics or…
We investigate the Goldreich-Levin Theorem in the context of quantum information. This result is a reduction from the computational problem of inverting a one-way function to the problem of predicting a particular bit associated with that…
In \cite{Nam} Nam proved a Lieb--Thirring Inequality for the kinetic energy of a fermionic quantum system, with almost optimal (semi-classical) constant and a gradient correction term. We present a stronger version of this inequality, with…