Gleason's theorem is not constructively provable (Q2366249)

From MaRDI portal
Revision as of 18:10, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Gleason's theorem is not constructively provable
scientific article

    Statements

    Gleason's theorem is not constructively provable (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    Gleason's theorem characterizes the possible generalized probability measures \(\mu\) on the closed subspaces \(A\) of a Hilbert space \({\mathcal H}\) of dimension three or greater. They are given by the quantum mechanical pure and mixed states, that is, for any such \(\mu\), there exists a positive selfadjoint operator \(W\) of trace class such that \(\mu(A)= \text{Tr} (\text{WP}_ A)\), where \(\text{P}_ A\) is the projection operator of \({\mathcal H}\) onto \(A\). In addition to ruling out non-contextual hidden variables, the theorem is central in determining how probability can be introduced into quantum mechanics. This paper shows by reduction that even the weakest restriction of the theorem to the unit sphere of the real Hilbert space \(\mathbb{R}^ 3\) is not constructively provable in the sense of Brouwer or Bishop, i.e. by intuitionistic reasoning. The theorem is shown to reduce to the lesser halting problem. This partially answers an open problem posed by Douglas Bridges. It does not say whether any viable constructivist substitute for Gleason's theorem is possible.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    closed subspaces of a Hilbert space
    0 references
    generalized probability measures
    0 references
    quantum mechanical pure and mixed states
    0 references
    hidden variables
    0 references
    halting problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references