Haag as a How-To Theorem

• URL: http://arxiv.org/abs/2305.05824v1
• Date: Wed, 10 May 2023 00:48:14 GMT
• Title: Haag as a How-To Theorem
• Authors: David Freeborn and Marian Gilton and Chris Mitsch
• Abstract summary: Haag's theorem rigorously demonstrates there is a logical problem with the interaction picture. The significance of the theorem for the use of the IP in QFT has been the subject of long-running debate. We argue for an alternative and opposite perspective on Haag's theorem, rejecting the worry' framing in favor of emphasizing the no-go theorem's implications for model development.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Haag's theorem is a classic no-go theorem. It rigorously demonstrates there is a logical problem with the interaction picture (IP), one of the most widely used modeling tools in quantum field theory (QFT). The significance of the theorem for the use of the IP in QFT has been the subject of long-running debate, focused around how ``worried'' we should be. In this paper, we argue for an alternative and opposite perspective on Haag's theorem, rejecting the `worry' framing in favor of emphasizing the no-go theorem's implications for model development.

Related papers

• Another quantum version of Sanov theorem [53.64687146666141]
  We study how to extend Sanov theorem to the quantum setting. We propose another quantum version of Sanov theorem by considering the quantum analog of the empirical distribution.
  arXiv  Detail & Related papers  (2024-07-26T07:46:30Z)
• Proving Theorems Recursively [80.42431358105482]
  We propose POETRY, which proves theorems in a level-by-level manner. Unlike previous step-by-step methods, POETRY searches for a sketch of the proof at each level. We observe a substantial increase in the maximum proof length found by POETRY, from 10 to 26.
  arXiv  Detail & Related papers  (2024-05-23T10:35:08Z)
• Machine Learning of the Prime Distribution [49.84018914962972]
  We provide a theoretical argument explaining the experimental observations of Yang-Hui He about the learnability of primes. We also posit that the ErdHos-Kac law would very unlikely be discovered by current machine learning techniques.
  arXiv  Detail & Related papers  (2024-03-19T09:47:54Z)
• Extended Wigner's friend paradoxes do not require nonlocal correlations [0.0]
  We show that such correlations are not necessary for having extended Wigner's friend paradoxes, by constructing a no-go theorem utilizing a proof of the failure of noncontextuality. The argument hinges on a novel metaphysical assumption that is a natural extension of a key assumption going into the Frauchiger and Renner's no-go theorem.
  arXiv  Detail & Related papers  (2023-10-10T19:55:33Z)
• Connecting classical finite exchangeability to quantum theory [69.62715388742298]
  Exchangeability is a fundamental concept in probability theory and statistics. We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• TheoremQA: A Theorem-driven Question Answering dataset [100.39878559382694]
  GPT-4's capabilities to solve these problems are unparalleled, achieving an accuracy of 51% with Program-of-Thoughts Prompting. TheoremQA is curated by domain experts containing 800 high-quality questions covering 350 theorems.
  arXiv  Detail & Related papers  (2023-05-21T17:51:35Z)
• On the Categoricity of Quantum Mechanics [0.0]
  The paper offers an argument against an intuitive reading of the Stone-von Neumann theorem as a categoricity result. It argues that, against what is usually taken to be the case, this theorem does not entail any model-theoretical difference between the theories that validate it and those that don't.
  arXiv  Detail & Related papers  (2023-04-20T06:19:13Z)
• Limit theorems for Quantum Trajectories [0.0]
  We prove Law of Large Numbers (LLN), Functional Central Limit Theorem, Law of Iterated Logarithm and Moderate Deviation Principle. Proof of the LLN is based on Birkhoff's ergodic theorem and an analysis of harmonic functions. The other theorems are proved using martingale approximation of empirical sums.
  arXiv  Detail & Related papers  (2023-02-13T08:57:57Z)
• Revisiting Born's rule through Uhlhorn's and Gleason's theorems [0.0]
  We present an argument to obtain (or rather infer) Born's rule, based on a simple set of axioms named "Contexts, Systems and Modalities" Here we show that an essential one among these hypotheses - the need of unitary transforms to relate different contexts - can be removed and is better seen as a necessary consequence of Uhlhorn's theorem.
  arXiv  Detail & Related papers  (2021-11-21T07:54:45Z)
• On Haag's theorem and renormalization ambiguities [0.2538209532048866]
  We discuss the interplay between Haag's theorem and renormalization. We argue that a non-perturbative and non-ambiguous renormalization cannot be built if there is any reference to the interaction picture with free fields.
  arXiv  Detail & Related papers  (2020-11-17T19:06:00Z)
• Learning to Prove Theorems by Learning to Generate Theorems [71.46963489866596]
  We learn a neural generator that automatically synthesizes theorems and proofs for the purpose of training a theorem prover. Experiments on real-world tasks demonstrate that synthetic data from our approach improves the theorem prover.
  arXiv  Detail & Related papers  (2020-02-17T16:06:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.