English
Related papers

Related papers: A New Proof of The Strong Subadditivity Theorem

200 papers

Let $G$ be a finite group, $N$ a normal subgroup of $G$, and $k$ a field of characteristic $p>0$. In this paper, we formulate the brick version of Clifford's theorem under suitable assumptions and prove it by using the theory of wide…

Representation Theory · Mathematics 2023-12-13 Yuta Kozakai , Arashi Sakai

In 1989, Elliott Lieb published a Physical Review Letter proving two theorems about the Hubbard model. This paper used the concept of spin-reflection positivity to prove that the ground state of the attractive Hubbard model was always a…

Mathematical Physics · Physics 2022-02-07 Janes K. Freericks

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…

Dynamical Systems · Mathematics 2023-06-22 Krzysztof Frączek , Adam Kanigowski , Mariusz Lemańczyk

The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…

Quantum Physics · Physics 2021-10-04 Nikolai Il`in , Anastasia Aristova , Oleg Lychkovskiy

The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…

Logic · Mathematics 2011-10-18 Alexander Shen

In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…

Logic · Mathematics 2015-10-27 Pedro Sánchez Terraf

We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…

Logic · Mathematics 2015-10-01 Jeffrey Bergfalk

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

Computational Complexity · Computer Science 2019-06-18 Victor Lagerkvist , Gustav Nordh

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

We show that an elementary proof of Fermat's Last Theorem (FLT) exists. Our paper also extends the scope of FLT from integers to all rational numbers.

General Mathematics · Mathematics 2020-10-09 Yuri Arenberg

We prove the adiabatic theorem for quantum evolution without the traditional gap condition. All that this adiabatic theorem needs is a (piecewise) twice differentiable finite dimensional spectral projection. The result implies that the…

Mathematical Physics · Physics 2009-10-31 J. E. Avron , A. Elgart

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruno Gauthier

Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's…

Quantum Physics · Physics 2015-12-31 Nilanjana Datta , Tony Dorlas , Richard Jozsa , Fabio Benatti

In this paper, we intend to revisit Theorem 2 of [3] formulating it in a way that, weakening the hypotheses and, at the same time, highlighting the richer conclusion allowed by the proof, it can potentially be applicable to a broader range…

Functional Analysis · Mathematics 2013-10-30 Biagio Ricceri

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…

Logic · Mathematics 2011-06-24 Joel David Hamkins , Justin Palumbo

We introduce the notion of reduced relative quantum entropy and prove that it is convex. This result is then used to give a simplified proof of a theorem of Lieb and Seiringer.

Quantum Physics · Physics 2024-08-09 Frank Hansen

We establish the validity of a strong unique continuation property for weakly coupled elliptic systems, including competitive ones. Our proof exploits the system structure and uses Carleman estimates. We apply this result to obtain some…

Analysis of PDEs · Mathematics 2024-10-29 Mónica Clapp , Víctor Hernández-Santamaría , Alberto Saldaña

In a recent work [3], the authors established new results about general linear Mahler systems in several variables from the perspective of transcendental number theory, such as a multivariate extension of Nishioka's theorem. Working with…

Number Theory · Mathematics 2022-10-27 Boris Adamczewski , Colin Faverjon

In this paper, we call strongly modular those reducible semi-simple odd mod $l$ Galois representations for which the conclusion of the strongest form of Serre's original modularity conjecture holds. Under the assumption that the Serre…

Number Theory · Mathematics 2016-05-26 Nicolas Billerey , Ricardo Menares

In this article, for the first time in the context of TOP trap, the necessary and sufficient conditions for the adiabatic evolution of weak field seeking states have been quantitatively examined. It has been well accepted since decades that…

Quantum Physics · Physics 2017-11-10 Nirupam Dutta , Anirban Dey , Prasanta K. Panigrahi