Search arXivSearch

arXiv · 1702.08642

Quantum mechanics in a metric sheaf: a model theoretic approach

Abstract

We study model-theoretical structures for prototypical physical systems. First, a summary of the model theory of sheaves, adapted to the metric case, is presented. In particular, we provide conditions for a generalization of the generic model theorem to metric sheaves. The essentials of the model theory of metric sheaves appeared in the form of Conference Proceedings. We provide a version of those results, for the sake of completeness, and then build metric sheaves for physical systems in the second part of the paper. Specifically, metric sheaves for quantum mechanical systems with pure point and continuous spectra are constructed. In the former case, every fiber is a finite projective Hilbert space determined by the family of invariant subspaces of a given operator with pure point spectrum, and we also consider unitary transformations in a finite-dimensional space. For an operator with continuous spectrum, every fiber is a two sorted structure of subsets of the Schwartz space of rapidly decreasing functions that includes imperfect representations of position and momentum states. The imperfection character is parametrically determined by the elements on the base space and refined in the generic model. Position and momentum operators find a simple representation in every fiber as well as their corresponding unitary operators. These results follow after recasting the algebraic properties of the integral transformations frequently invoked in the description of quantum mechanical systems with continuous spectra. Finally, we illustrate how this construction permits the calculation of the quantum mechanical propagator for a free particle.

Explore related subjects

Keep this discovery

BibTeXRIS

Maicol A. Ochoa, Andrés Villaveces. 2017-02-28. Quantum mechanics in a metric sheaf: a model theoretic approach. https://arxiv.org/abs/1702.08642

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO