Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem
type: Item
instance of: scholarly article
title: Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem
zbMATH Open document ID: 0801.03040
DOI: 10.1007/BF01049303
author: Geoffrey Hellman
published in: Journal of Philosophical Logic
publication date: 1993-08-19T00:00:00Z
review text: One of the main ideas behind constructive mathematics is its algorithmic nature: if we can prove the existence (e.g., a solution to an equation) in constructive mathematics, then we automatically have an algorithm that generates the desired solution. In view of that, every time we want to compute something, it makes sense to reformulate the problem in terms of constructive mathematics. In the paper under review, this idea is applied to quantum mechanics. The two main notions of quantum mechanics are the notion of a state that describes a system, and the notion of an observable that describe measurements. In traditional mathematical formulation of quantum mechanics, states are represented as vectors in a Hilbert space \(L^ 2\), and observables are represented by operators from \(L^ 2\) to \(L^ 2\). For the majority of physical observables (including coordinates, momentum, energy, etc.) the corresponding operator is unbounded. Measurement of an observable \(A\) in a state \(s\) is described as follows: as an answer, we can get any eigenvalue \(\lambda_ i\) of \(A\) with the probability \(| (s,\psi_ i )|^ 2\), where \(\psi_ i\) is the corresponding eigenvector. Computing these probabilities is one of the main computational problems of quantum mechanics; therefore, it seems reasonable to apply constructive mathematics to this problem. If we can find the constructive proof of the spectral theorem, then we would be able to compute \(\psi_ i\), \(\lambda_ i\), and therefore, the desired probabilities. There is already a constructive functional analysis, so all the necessary definitions (of a constructive operator, etc.) are already in place. The author shows, however, that with these definitions, the spectral theorem is \textit{not} constructive, and so, there is no algorithm to compute the desired probability. The fact that physicists are able to compute these probabilities means that probably a different version of constructive mathematics is necessary to describe this s…
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 47S30
Mathematics Subject Classification ID: 81P05
zbMATH DE Number: 203331
zbMATH Keywords: constructive mathematics
zbMATH Keywords: quantum mechanics
zbMATH Keywords: spectral theorem
zbMATH Keywords: constructive functional analysis
zbMATH Keywords: unbounded operator
reviewed by: Vladik Kreinovich
MaRDI profile type: Publication
cites work: Q5573965
cites work: Constructive measure theory
cites work: Q4184832
cites work: Q3912579
cites work: Dummett's case for intuitionism
cites work: Q4133603
cites work: Q3245484
cites work: Q4692959
cites work: Gleason's theorem is not constructively provable
cites work: Q5551052
cites work: Q5562575
cites work: Q5343326
cites work: Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
cites work: The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
cites work: The Spectra of Subnormal Operators
cites work: Q4257375
cites work: Q3231492
cites work: Q4334625
description: scientific article; zbMATH DE number 203331