This paper explores the role of contexts in convex sequential effect algebras (COSEAs), analyzing their structure, properties, and relation to quantum formalism, emphasizing how measurement contexts influence effects.
Contribution
It introduces the concept of contexts in COSEAs, examines their structural properties, and characterizes when COSEAs correspond to quantum effects on Hilbert spaces.
Findings
01
Analysis of direct sums and the center of COSEAs
02
Characterization of COSEAs isomorphic to quantum effects
03
Insights into how contexts influence effect measurements
Abstract
A convex sequential effect algebra (COSEA) is an algebraic system with three physically motivated operations, an orthogonal sum, a scalar product and a sequential product. The elements of a COSEA correspond to yes-no measurements and are called effects. In this work we stress the importance of contexts in a COSEA. A context is a finest sharp measurement and an effect will act differently according to the underlying context with which it is measured. Under a change of context, the possible values of an effect do not change but the way these values are obtained may be different. In this paper we discuss direct sums and the center of a COSEA. We also consider conditional probabilities and the spectra of effects. Finally, we characterize COSEA's that are isomorphic to COSEA's of positive operators on a complex Hilbert space. These result in the traditional quantum formalism. All of this…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A convex sequential effect algebra (COSEA) is an algebraic system with three physically motivated operations, an orthogonal sum, a scalar product and a sequential product. The elements of a COSEA correspond to yes-no measurements and are called effects. In this work we stress the importance of contexts in a COSEA. A context is a finest sharp measurement and an effect will act differently according to the underlying context with which it is measured. Under a change of context, the possible values of an effect do not change but the way these values are obtained may be different. In this paper we discuss direct sums and the center of a COSEA. We also consider conditional probabilities and the spectra of effects. Finally, we characterize COSEA’s that are isomorphic to COSEA’s of positive operators on a complex Hilbert space. These result in the traditional quantum formalism. All of this work depends heavily on the concept of a context.
1 Introduction
We present an axiomatic framework for quantum mechanics in which the basic entities and operations have physical significance. In this framework, the principle concepts are states and effects. The states represent initial preparations that describe the condition of the system, while the effects represent yes–no measurements that probe the system. The effects may be unsharp or fuzzy [5, 6, 9, 18]. A state applied to an effect produces the probability that the effect gives a yes value when the system is in that state. The resulting mathematical structure is called a convex sequential effect algebra (COSEA) E [10, 15, 11, 21, 22]. The three mathematical operations in E are an orthogonal sum a⊕b, a scalar product λa,λ∈[0,1]⊆R and a sequential product a∘b. These operations have physical interpretations that we now discuss.
Although this framework is much more general, we can employ the model of an optical bench to visualize what is happening here. A beam of particles (photons, electrons, etc.) is emitted from a source and propagates through a channel on the bench until the beam arrives at a detector at the end of the channel. The particles are initially prepared in a certain state and the effects describe various filters that can be placed in the channel. The beam travels through one or more filters which interact with the beam and can change its properties in certain ways. The detector may count particles or measure different characteristics of the beam. The sum a⊕b is performed by first splitting the beam into two equal parts, which are directed toward the two filters placed in parallel after which both beams are reunited before being collected at the detector. The scalar product λa corresponds to an attenuation of filter a by the factor λ. This can be accomplished by placing a gray filter with a certain darkness in front of filter a. The gray filter blocks some of the particles but does not otherwise disturb the beam. The sequential product a∘b is performed by placing the filters in series so that a is first and b is second. In this way, filter a can interfere with the operation of filter
b while b cannot interfere with the operation of a. We will find this useful for describing quantum interference.
In this work, an important role will be played by the context under which an effect is observed. A context is a finest sharp measurement and an effect will act differently according to the underlying context with which it is measured. For example, in the optical bench scenario, changing contexts may result from altering the detectors or varying the size, shape or location of the bench. Under a change of context, the possible values of an effect do not change but the way these values are obtained may be different. As far as contexts are concerned, there is a great difference between classical and quantum systems. We shall show that classical systems have exactly one context, while quantum systems have infinitely many.
In Section 2 we define the concepts of COSEA’s and contexts. Section 3 discusses direct sums and the center of a COSEA. Section 4 considers conditional probabilities and spectra of effects. Finally, Section 5 characterizes COSEA’s that are isomorphic to COSEA’s of positive operators on a complex Hilbert space. Of course, these result in the traditional quantum formalism. There is some overlap of this paper and the work in [21, 22]. However, our stress on contexts provides a different approach.
2 Convex Sequential Effect Algebras
Let E be the set of effects and S the set of states for a physical system. The connection between E and S is given by a probability functionF:E×S→[0,1]⊆R where F(a,s) is interpreted as the probability that effect a has a yes value when the system is in state s. An effect-state space is a triple (E,S,F) where E and S are nonempty sets and F:E×S→[0,1] satisfies:
(ES1)
There exist elements 0,1∈E such that F(0,s)=0, F(1,s)=1 for every s∈S.
(ES2)
If F(a,s)≤F(b,s) for every s∈S, then there exists a unique c∈E such that F(a,s)+F(c,s)=F(b,s) for all
s∈S.
(ES3)
If a∈E and λ∈[0,1], then there exists an element λa∈E such that
F(λa,s)=λF(a,s) for all s∈S.
The elements 0,1 in (ES1) correspond to the null effect that never occurs and the unit effect that always occurs, respectively. It is shown in
[10, 15] that if F(a,s)+F(b,s)≤1 for every s∈S, then there exists a unique c∈E such that
[TABLE]
for all s∈S. We then write a⊥b and define a⊕b=c. In this way, ⊕ is a partial binary operation on E.
The structure (E,0,1,⊕) is called an effect algebra and satisfies the following axioms:
(EA1)
If a⊥b, then b⊥a and b⊕a=a⊕b,
(EA2)
If a⊥b and (a⊕b)⊥c, then b⊥c, a⊥(b⊕c) and a⊕(b⊕c)=(a⊕b)⊕c,
(EA3)
For every a∈E there exists a unique a′∈E such that a⊥a′ and a⊕a′=1,
(EA4)
If a⊥1, then a=0.
We define a≤b if there is a c∈E such that a⊕c=b. The element c is unique and we write c=b⊖a. It can be shown that (E,0,1,≤) is a bounded poset and a⊥b if and only if a≤b′ [5, 6]. Moreover, a′′=a and a≤b implies b′≤a′ for all a,b∈E. If we incorporate the scalar product λa of (ES3) we obtain the following structure. An effect algebra E is
convex [10, 15, 11] if for every a∈E and λ∈[0,1]⊆R there exists an element λa∈E such that
(CO1)
If α,β∈[0,1] and a∈E, then α(βa)=(αβ)a.
(CO2)
If α,β∈[0,1] with α+β≤1 and a∈E, then αa⊥βb and
(α+β)a=αa⊕βa.
(CO3)
If a,b∈E with a⊥b and λ∈[0,1], then λa⊥λb and
λ(a⊕b)=λa⊕λb.
(CO4)
If a∈E, then 1a=a.
We call an effect algebra an EA and a convex effect algebra a COEA, for short. In E and F are EA’s, a map
ϕ:E→F is additive if a⊥b implies that ϕ(a)⊥ϕ(b) and
[TABLE]
An additive map ϕ that satisfies ϕ(1)=1 is called a morphism. A morphism ϕ:E→F for which
ϕ(a)⊥ϕ(b) implies a⊥b is a monomorphism and a surjective monomorphism is an isomorphism. If E and F are COEA’s, a morphism ϕ:E→F is affine if ϕ(λa)=λϕ(a) for all
λ∈[0,1], a∈E. If there exists an affine isomorphism ϕ:E→F we say that E and F are COEA isomorphic.
The simplest example of a COEA is the unit interval [0,1]⊆R with the usual addition (when a+b≤1) and scalar multiplication.
A state on an EA E is a morphism ω:E→[0,1]. Notice that in an effect-state space, the function
a↦F(a,s) is a state on E. We denote the set of states on E by Ω(E). We say that
S⊆Ω(E) is order-determining if ω(a)≤ω(b) for all ω∈S implies that a≤b. It is shown in [15] that every state on a COEA is affine. It is also shown in [15] that an effect-state space is equivalent to a COEA with an order-determining set of states.
We now introduce the sequential product a∘b on a COEA. Because of the series order for a∘b, a may interfere with the b measurement but b will never interfere with the a measurement. If a∘b=b∘a we write a∣b and say that a and bdo not interfere. We now present our general definition.
A convex sequential effect algebra (COSEA) [11] is an algebraic system
(E,0,1,⊕,∘) where(E,0,1,⊕) is a COEA and ∘:E×E→E is a binary operation satisfying:
(S1)
b↦a∘b is additive for all a∈E,
(S2)
1∘a=a for all a∈E,
(S3)
If a∘b=0, then a∣b,
(S4)
If a∣b, then a∣b′ and a∘(b∘c)=(a∘b)∘c for all c∈E,
(S5)
If c∣a and c∣b then c∣a∘b and c∣(a⊕b) whenever a⊥b,
(S6)
For all λ∈[0,1]⊆R, a,b∈E, we have that
[TABLE]
It is shown in [21] that if E satisfies an additional continuity property that makes E a σ-COSEA then (S6) is automatically satisfied.
In quantum mechanics, a∘b is useful for describing quantum interference. It is also needed for defining the important concept of conditional probability. An element a in a COSEA is sharp if the greatest lower bound a∧a′=0. Sharp effects are thought of as effects that are precise or unfuzzy. We denote the set of sharp effects in E by S(E).
Theorem 2.1**.**
[12]* The sequential product in a COSEA E has the following properties.
(i)a∘b≤a for all a,b∈E.
(ii) If a≤b, then c∘a≤c∘b for all c∈E.
(iii)a∈S(E) if and only if a∘a=a.
(iv) For a∈E, b∈S(E), a∘b=0 if and only if a⊥b.
(v) For a∈E, b∈S(E), a≤b if and only if a∘b=b∘a=a and b≤a if and and only if
a∘b=b∘a=b.*
For a COSEA E, we call a∈S(E)one-dimensional if a=0 and if b∈E with b≤a, then b=λa for some λ∈[0,1]. We denote the set of one–dimensional elements of E by S_1(E). It is shown in [11] that if a∈S_1(E) then there exists an a∈Ω(E) such that a(a)=1. A COSEA is state-unique if a is unique. Although it is not known whether an arbitrary COEA is state-unique, it is shown in [21, 22] that every COSEA is state-unique.
A finite context in a COEA E is a finite set {a_1,…,a_n}⊆S_1(E) such that
[TABLE]
It follows that a_i(a_j)=δ_ij. We denote the set of finite contexts in E by C(E). We interpret a finite context as a finest sharp measurement. We say that E is finite-dimensional if there does not exist an infinite sequence
a_i∈S_1(E) such that a_1⊕⋯⊕a_n is defined for all n. Thus, there are no infinite contexts. For simplicity, we assume that the COEA’s (and (COSEA’s) we consider in this paper are finite-dimensional. If E is state-unique and
a,b∈S_1(E), we call a(b) the transition probability from a to b. We say that E is symmetric if
a(b)=b(a) for all a,b∈S_1(E). It is shown in [21, 22] that every COSEA is symmetric.
Lemma 2.2**.**
If E is state-unique and symmetric, then all contexts in E have the same cardinality.
Proof.
Let A,B∈C(E) with A={a_1,…,a_n}, B={b_1,…,b_m}. Then
[TABLE]
We say that a COEA E is spectral if E is state-unique and for every b∈E there exists a context
A={a_1,…,a_n} such that
[TABLE]
λ_i∈[0,1], i=i,…,n. We denote the set of such b∈E corresponding to a fixed context A by E(A). It can be shown that every COSEA is spectral [22]. A subset F of a COEA E is a sub-COEA if 0,1∈F, a∈F implies a′λa∈F for all λ∈[0,1] and if a,b∈F with a⊥b, then
a⊕b∈F. A subset F of a COSEA E is a sub-COSEA if F is a sub-COEA and if a,b∈F implies a∘b∈F. It is clear that if E is a COEA (COSEA) then E(A) is a sub-COEA (sub-COSEA) for every a∈C(E).
We close this section with some examples of COEA’s and COSEA’s. The first example comes from the quantum formalism. Let H be a complex Hilbert space and let E(H) be the set of operators on H satisfying 0≤A≤I where we are using the usual operator order. For A,B∈E(H) we write A⊥B if A+B≤I and in this case we define A⊕B=A+B. For λ∈[0,1] and
A∈E(H), λA∈E(H) is the usual scalar multiplication for operators. It is easy to check that
(E(H),0,I,⊕) is a COEA which we call a Hilbertian COEA. The sharp elements of E(H) are the projections on H. For ϕ∈H with ϕ=0, we denote the projection onto the one-dimensional subspace generated by ϕ as P(ϕ). Of course, P(ϕ)=P(ψ) if and only ϕ=αψ for some α∈C, α=0. The elements of
S_1(E(H)) are precisely the P(ϕ), ϕ∈H, ϕ=0 and E(H) is finite-dimensional if and only if H
finite-dimensional. In this case, the contexts of E(H) correspond to the orthonormal bases of H so
C(E(H)) is infinite if dimH≥2. If A∈S_1(E(H)) with A=P(ϕ) where ∣∣ϕ∣∣=1,
then A is the unique state given by A(B)=⟨ϕ,Bϕ⟩ for all B∈E(H). Hence,
E(H) is state-unique. It follows from the spectral theorem that E(H) is state-unique. Moreover, if B=P(ψ),
∣∣ψ∣∣=1, then the transition probability becomes
[TABLE]
so E(H) is symmetric. If F is a sub-COEA of E(H) for some H, we call F a sub-Hilbertian COEA. An example of a sub-Hilbertian COEA is a von Neumann algebra of operators on H. These are also spectral and symmetric. For
A,B∈E(H) define the product A∘B=A1/2BA1/2 where A1/2 is the unique positive square root of A. It is shown in [12, 13] that with the product A∘B, E(H) becomes a COSEA. We also have that A∘B=B∘A if and only if AB=BA [14]; that is, A and B commute. We then call E(H) a Hilbertian COSEA, and any sub-COSEA of
E(H) is a sub-Hilbertian COSEA. As before, a von Neumann algebra on H is an example of a sub-Hilbertian COSEA.
Our next example comes from fuzzy probability theory [2, 8]. Let Ω,(A) be a measurable space in which singleton sets are measurable and let E(Ω,A) be the set of measurable functions on Ω with values in
[0,1]⊆R. If we define the operations ⊕,λf and f∘g=fg analogously as in the previous example,
E(Ω,A) becomes a COSEA. The elements of E(Ω,A) are called fuzzy events and we call
E(Ω,A) a classical COSEA. The elements of S(E(Ω,A)) are the characteristic functions (or equivalently, the sets in A) and S_1(E(Ω,A)) consists of the characteristic functions of the singleton sets (or equivalently, the elements of Ω). Notice that E(Ω,A) is finite-dimensional if and only if
Ω is finite and in this case there is only one context. Also, E(Ω,A) is symmetric and spectral. Conversely, it is shown in [11] that if a finite-dimensional COEA (COSEA) E has only one context, then E is isomorphic to classical COEA (COSEA). We have seen that a classical COEA contains only one context while a quantum (Hilbertian) COEA possesses an infinite number of different contexts. Is there anything between? That is, can a finite-dimensional spectral COEA E have a finite number, greater than one, of disjoint contexts [11]? The answer to this question is negative. In fact, if E has more than one context, then it has uncountably many [17].
3 Commutants
In this section, E will denote a finite-dimensional COSEA. For F⊆E, the commutant of F is defined as
[TABLE]
Notice that F′ is a sub-COSEA of E. If F⊆G⊆E then G′⊆F′. We also have that F⊆F′′, F′=F′′′, F′∩G′⊆(F∩G)′ and
(F∪G)′⊆F′∪G′ for all F,G⊆E. We say that F⊆E is commutative if a∘b=b∘a for all a,b∈F. Clearly, F is commutative if and only if F⊆F′. It is shown in [11] that E is commutative if and only if E has only one context and hence is isomorphic to a classical COSEA. We call E′ the center of E. Thus, E=E′ if and only if E is isomorphic to a classical COSEA and E′ is a commutative sub-COSEA of E. It is clear that
{λ1:λ∈[0,1]}⊆E′. We say that E is a factor if
E′={λ1:λ∈[0,1]}.
We now define the direct sumE=E_1⊕E_2 of two COSEA’s (E_1,0_1,1_1,⊕),
(E_2,0_2,1_2,⊕). We define (E,0,1,⊕) by
[TABLE]
with 0=(0_1,0_2), 1=(1_1,1_2). If a=(a_1,a_2), then a′=(a_′1,a_′2). If a=(a_1,a_2), b=(b_1,b_2) then a⊥b if
a_1⊥b_1, a_2⊥b_2 and
[TABLE]
For λ=[0,1] define λ(a_1,a_2)=(λa_1,λa_2) and we define
[TABLE]
It is easy to check that E is a COSEA. We have that (a_1,a_2)≤(b_1,b_2) if and only if a_1≤b_1, a_2≤b_2 and
[TABLE]
Clearly, (a_1,a_2)∈S(E) if and only if a_1∈S(E_1) and a_2∈S(E_2).
Lemma 3.1**.**
Let E=E_1⊕E_2.
(i)(a_1,a_2)∈S_1(E) if and only if a_1=0_1 and a_2∈S_1(E_2) or a_2=0_2 and
a_1∈S_1(E_1).
(ii)A∈C(E) if and only if
[TABLE]
where {a_1}∈C(E_1) and {b_j}∈C(E_2)
Proof.
(i) Necessity is clear. For sufficiency, suppose that (a_1,a_2)∈S_1(E) and a_1=0_1, a_2=0_2. Then
(a_1,0_2)≤(a_1,a_2) but for λ∈[0,1] we have that
[TABLE]
which is a contradiction. Hence, a_1=0_1 or a_2=0_2. Clearly, if a_1=0, then a_1∈S_1(E_1) and if a_2=0, then
a_2∈S_1(E_2).
(ii) This follows from (i).
∎
We shall need the following lemma to prove Theorem 3.3.
Lemma 3.2**.**
(i)* If a∣c and a∣(c⊕d) then a∣d.
(ii) If c≤b and a∣c, a∣b then a∣(b⊖c).
(iii) If c≤b then b⊖c=(c⊕b′)′.
(iv) If F is a sub-COSEA of E and b,c∈F with c≤b, then b⊖c∈F.*
Proof.
(i) Let b=c⊕d so that a∣c and a∣b. Now c⊕d⊕b′=1 so d=(c⊕b′)′. Since a∣b, a∣b′ and since a∣c we have that a∣c⊕b′. Hence, a∣d.
(ii) Since c≤b we have that b=c⊕(b⊖c). Since a∣c and a∣b, by (i) a∣(b⊖c).
(iii) This follows from (i).
(iv) Since b,c∈F we have that b′ and c⊕b′∈F. Hence, by (iii).
[TABLE]
Theorem 3.3**.**
A COSEA E is isomorphic to a direct sum of two COSEA’s if and only if there exists an a∈S(E)∩E′ with
a=0,1.
Proof.
If E is isomorphic to a direct sum of two COSEA’s, we can just as well assume that E=E_1⊕E_2. We then have that (1_1,0_2)∈S(E)∩E′ and (1_1,0_2)=(1_1,1_2)=1 and (1_1,0_2)=(0_1,0_2)=0. Conversely, suppose
a∈S(E)∩E′ with a=0,1. Let
[TABLE]
and define 0_1=a∘0=0 and 1_1=a∘1=a. For a∘b∈E_1 define
[TABLE]
Define a∘b_1⊥_1a∘b_2 if b_1⊥b_2 and in this case
[TABLE]
It is easy to check that (E_1,0_1,1_1,⊕_1) is an effect algebra. Letting λ(a∘b)=a∘(λb) makes
E_1 into a COSEA. Defining
[TABLE]
we see that a∘b∣_1a∘c. We now show that (E_1,0_1,1_1,⊕_1∘_1) is a COSEA. It is easy to verify that (S1) and (S2) hold. To verify (S3) suppose that (a∘b)∘_1(a∘c)=0. Then
[TABLE]
Hence, a∘b∣a∘c so a∘b∣_1a∘c. To verify (S4) suppose that a∘b∣_1a∘c. Then a∘b∣a∘c. Since a=a∘c⊕a∘c′ and a∘b∣a, a∘b∣a∘c it follows from Lemma 3.2(i) that a∘b∣a∘c′ so a∘b∣(a∘c)′. Moreover, for all d∈E we have
[TABLE]
The verification of (S5) and (S6) are straightforward. We conclude that E_1 is a COSEA. Now a′∈S(E) with a′=0,1 so letting E_1={a′∘b:b∈E} with similar definitions we have that (E_2,0_2,1_2,⊕_2,∘_2) is a COSEA. Every element of E has the unique representation b=a∘b⊕a′∘b, a∘b∈E_1,
a′∘b∈E_2. Defining the map J:E→E_1⊕E_2 by J(b)=(a∘b,a′∘b) it is straightforward to show that J is an isomorphism.
∎
Since E is spectral, every b∈E has a representation b=λ_1a_1⊕⋯⊕λ_aa_n for some
{a_i}∈C(E), λ_i∈[0,1]. We denote the set of effects that have such a representation relative to a context
A∈C(E) by E(A). It is clear that E(A) is a commutative sub-COSEA of E. In fact, if
b is as above and c=μa_1⊕⋯⊕μ_na_n, μ_1∈[0,1], then b⊥c if and only if λ_i+μ_i≤1, i=1,…,n and in this case
[TABLE]
In general, we have
[TABLE]
In the representation for b∈E, the λ_i need not be distinct but since the sum of sharp elements is sharp, we can write
[TABLE]
where c_i∈S(E), λ_′i=λ_′j, i=. The next result follows from Theorem 4.3 in [11].
Theorem 3.4**.**
Any b∈E has a unique representation (3.1) where λ_′i∈[0,1], λ_′i=λ_′j, i=j,
c_i∈S(E), c_1⊕⋯⊕c_m=1 and c_i∈{b}′′.
Theorem 3.5**.**
In a COSEA E, a∣b if and only if a,b∈E(A) for some A∈C(E).
Proof.
If a,b∈E(A), then clearly a∣b. Conversely, suppose that a∣b. By Theorem 3.4, we have
a=⊕λ_ia_i, b=⊕μ_ib_i, λ_i=λ_j, μ_i=μ_j, i=j, a_i,b_i∈S(E) and
⊕a_i=⊕b_i=1. Moreover, by Theorem 3.4, a_i∣b_j for all i,j. Then a_i∘b_j∈S(E) and
⊕a_i∘b_j=1. Letting e_k be the nonzero a_i∘b_j we have that e_k∈S(E) and ⊕e_k=1. Then
a_i=⊕{e_k:e_k≤a_i} and similarly for the b_i. Reordering the λ_i and μ_i if necessary we can write
a=⊕λ_ie_i, b=⊕μ_ie_i. Finally, we can construct a context A={c_k} such that e_i=⊕c_k_i for all
i. Then a=⊕λ_ic_i, b=⊕μ_ic_i so that a,b∈E(A).
∎
Lemma 3.6**.**
If a∈S_1(E), b∈S(E), then a∣b if and only if a∘b=0 or a≤b.
Proof.
If a∘b=0 or a≤b, then by Theorem 2.1, a∣b. If a∣b, then since a∘b≤a we have that a∘b=λa for some λ∈[0,1]. Since a∘b∈S(E), λ2a=λa so λ2=λ. Hence, λ=0 or
λ=1. If λ=0, then a∘b=0. If λ=1, then
[TABLE]
Theorem 3.7**.**
If a∈S_1(E), then
[TABLE]
Proof.
If b=λa⊕⨁λ_ia_i as in (3.2), then clearly b∣a. Conversely suppose b∣a. By
Theorem 3.4 we can write b=⊕μ_ic_i, c_i∈S(E), μ_i=μ_j, μ_i=0, c_i∘c_j=0, i=j. Also by Theorem 3.4 we have that a∣c_i for all i so by Lemma 3.6a∘c_i=0 or a≤c. If a∘c_i=0 for all i, then form a context {a,a_1,…,a_n} such that b=0a⊕⨁λ_ia_i. Otherwise, there is a j such that
a≤c_j and a∘c_i=0 for all i=j. We again form a context {a,a_1,…,a_n} such that
b=λa⊕⨁λ_ia_i.
∎
Theorem 3.8**.**
A COSEA E is a factor if and only if E is not isomorphic to the direct sum of two COSEA’s.
Proof.
Suppose E is a factor. If E is isomorphic to a direct sum of COSEA’s E_1,E_2, then by Theorem 3.3 there is an a∈S(E)∩E′ with a=0,1. But then a=λ1 for some λ∈(0,1). Since a2=a we have that
λ2=λ so λ=0 or λ=1 which is a contradiction. Conversely, suppose E is not a factor so that
E′={λ1:λ∈[0,1]}. Then there is a b∈E′ with b=λ1 for any λ∈[0,1]. By Theorem 3.4, there exists an a∈S(E)∩{b}′′ with a=0,1. Since {b}′=E we have that
a∈{b}′′=E′. By Theorem 3.3, E is isomorphic to the direct sum of two COSEA’s.
∎
For F⊆E, if a∈F∩S(E) with a=0, we say that a is minimal sharp in F if
b∈F∩S(E) and b≤a, then b=a.
Theorem 3.9**.**
F* is a commutative sub-COSEA of E if and only if there exist minimal sharp elements a_1,…,a_n in F such that a_1⊕⋯⊕a_n=1 and*
[TABLE]
Proof.
If F has the form (3.3), since a_i∣a_j, F⊆F′ and it is easy to show that F is a sub-COSEA. Conversely, suppose F is a commutative sub-COSEA of E. If b∈F∩S(E) with b=0 we show there exists a minimal sharp a in F such that a≤b. If b is minimal sharp in F we are finished. Otherwise, there exists an
a_1∈F∩S(E) with a_n=0 and a_1<b. If a_1 is minimal sharp in F we are finished. Otherwise, there exists an a_2∈F∩S(E) with a_2=0 and a_2<a_1<b. This process must end because if a_1>a_2>a_2>⋯ with, a_i∈F∩S(E), a_i=0, then letting b_i=a_i⊖a_i+1, i=1,2,…, we have b_i∈S(E) and b_i⊥b_j,
i=j. Since E is spectral, there exist c_i∈S_1(E) such that c_i≤b_i, i=1,2,…, but this contradicts the finite-dimensionality of E. We conclude that for b∈F∩S(E) with b=0, there is a minimal sharp a in F such that a≤b. Let a_1,a_2,…,a_n be the minimal sharp elements of F. Again, because of finite dimensionality there is a finite number of these. Moreover, we have a_1⊕⋯a_n=1. If d∈F, then Theorem 3.4 there exist
d_j∈F∩S(E) such that
[TABLE]
where λ_j∈[0,1] and d_1⊕⋯⊕d_m=1. By our previous work d_j=⊕a_i_j so that
d=μ_1a_1⊕⋯⊕μ_na_n, μ_i∈[0,1].
∎
Corollary 3.10**.**
There exist minimal sharp elements a_1,…,a_n in E′ such that a_1⊕⋯⊕a_n=1 and
[TABLE]
Lemma 3.11**.**
If a is a minimal sharp element of E′ and F={a∘b:b∈E}, then F is a COSEA with unit a and F is a factor.
Proof.
We have shown in the proof of Theorem 3.3 that F is a COSEA with unit a. To show that F is a factor, we must show that F′∩F={λa:λ∈[0,1]}. If a∘b∈F′∩F∩S(E), then
a∘b∣a∘c for all c∈E. We also have that (a∘b)∘(a′∘c)=0 so a∘b∣a′∘c for all c∈E. Since c=a∘c⊕a′∘c we have a∘b∣c so a∘b∈E′. Since a∘b≤a and a is minimal sharp in
E we conclude that if b=0 then a∘b=a. Hence, the only sharp elements of F′∩F are [math] and a. Since every c∈F′∩F has the form c=λ_1c_1⊕⋯⊕λ_nc_n, λ_i∈[0,1], c_i∈S(F) we have that c=λa, λ∈[0,1]. Therefore, F is a factor.
∎
We can extend the definition of direct sum to more than two summands. We define
[TABLE]
and of course, the placement of the parenthesis is immaterial. In a similar way, we define
E=E_1⊕E⊕⋯⊕E_n. For convenience, write (a_1,…,a_n)∈E as
a_1⊕⋯⊕a_n, a_i∈E_i, i=1,…,n. We then have a_i∘a_j=0, i=j, and 1_1⊕⋯⊕1_n=1. Also,
[TABLE]
Theorem 3.12**.**
Any finite-dimensional COSEA E is isomorphic to the direct sum of a finite number of factors.
Proof.
By Corollary 3.10 there exist minimal sharp elements a_1,…,a_n in E′ with a_1⊕⋯⊕a_n=1. By
Lemma 3.11, E_i={a_i∘b:b∈E} is a factor with unit a_i. Since every b∈E has the form
[TABLE]
it follows that E is isomorphic to E_1⊕⋯⊕E_n.
∎
We close this section with a result about the state space of the direct sum. If V is a real vector space and A_1,…,A_n⊆V we define the convex hull of a_1,…,A_n by
[TABLE]
Theorem 3.13**.**
Ω(E_1⊕⋯⊕E_n)=CH(Ω(E_1),…,Ω(E_n))**
Proof.
We shall show that Ω(E_1⊕E_2)=CH(Ω(E_1),Ω(E_2)) and the general result easily follows. If ω_1∈Ω(E_1), ω_2∈Ω(E_2), λ∈[0,1],
(a,b)∈E=E_1⊕E_2, define
[TABLE]
To show that ω∈Ω(E) we have that
[TABLE]
Hence, CH(Ω(E_1),Ω(E_2))⊆Ω(E_1⊕E_2). To show that
Ω(E_1⊕E_2)⊆CH(Ω(E_1),Ω(E_2)), let
ω∈Ω(E_1⊕E_2). If ω(1_1,0)=0 then for b∈E_2 define ω_2(b)=ω(0_1,b). Since
ω(0_1,1_2)=1, ω_2∈Ω(E_2) and we have that
[TABLE]
Similarly, if ω(0_1,1_2)=0, then letting ω_1(a)=ω(a,0_2) we have that ω(a,b)=ω_1(a). If
ω(1_1,0_2), ω(0_1,1_2)=0, define ω_1∈Ω(E_1), ω_2∈Ω(E_2) by
[TABLE]
Then ω(1_1,0_2)+ω(0_1,1_2)=ω(1)=1 and
[TABLE]
4 Conditioning and Spectra
As before E will denote a finite-dimensional COSEA and if a∈S_1(E) then a is the unique state on E such that
a(a)=1. If b∈E and ω∈Ω(E) with ω(b)=0 we define the conditional probability forωgivenb as ω(c∣b)=ω(b∘c)/ω(b) for every c∈E. Notice that ω(⋅∣b) is indeed a state on E.
Theorem 4.1**.**
Let a∈S_1(E).
(i)a is the unique state on E such that a∘b=a(b)a for all b∈E.
(ii)a is the unique state on E such that a(b)=a(a∘b) for all b∈E.
(iii) If ω∈Ω(E) with ω(a)=0, then ω(b∣a)=a(b) for all b∈E.
Proof.
(i) Since a∘b≤a, there exists λ_a(b)∈[0,1] such that a∘b=λ_a(b)a. Applying a to both sides gives
λ_a(b)=a(a∘b). It is clear that λ_a∈Ω(E) and λ_a(a)=1. Hence, λ_a=a so that
a∘b=a(b)a for all b∈E. If ω∈Ω(E) satisfies a∘b=ω(b)a for all b∈E, letting b=a gives
[TABLE]
Hence, ω(a)=1 so ω=a. Thus, a is unique.
(ii) By (i) we have that
[TABLE]
for all b∈E. If ω∈Ω(E) satisfies ω(b)=ω(a∘b) for all b∈E, letting b=1 gives
ω(a)=ω(1)=1 so that ω=a.
(iii) If ω(a)=0, applying (i) gives
[TABLE]
From Theorem 4.1(iii) we have that a(b)=ω(b∣a) for all ω∈Ω(E) with ω(a)=0. We conclude that a is the universal conditional probability given a.
Let Ω(E)=Ω(E)∪{0} where 0(b)=0 for all b∈E. For all a∈E we define the conditional probability mapγ_a:Ω(E)→Ω(E) by γ_a(0)=0 and for ω=0
[TABLE]
It is clear that γ_0(ω)=0 and γ_1(ω)=ω for all ω∈Ω(E). The next result summarizes properties of γ.
Lemma 4.2**.**
(i)* If a∈S_1(E), the a is the unique nonzero fixed point of γ_a; that is, γ_aω=ω,
ω=0 implies that ω=a.
(ii) If a⊥b, c∣a, c∣b then for all ω∈Ω(E) we have that*
[TABLE]
(iii)* If a∣b, then for all ω∈Ω(E) we have that*
[TABLE]
(iv)* For all ω∈Ω(E) and c∈E we have that*
[TABLE]
Proof.
Conditions (4.1)–(4.4) clearly hold if ω=0. We thus assume that ω∈Ω(E).
(i) We have from Theorem 4.1(ii) that
[TABLE]
Hence, γ_a(a)=a. Now if γ_aω=ω, then ω(a)=0 and for every b∈E we have that
[TABLE]
We conclude that ω(a)=1 so that ω=a.
(ii) If ω(a⊕b)=0, then ω(a)=ω(b)=0 so both sides of (4.1) are [math]. If ω(a⊕b)=0, then
(4.1) is equivalent to
[TABLE]
(iii) If ω(a′)=0, then the left side of (4.2) is [math] and the right side is ω(b)=ω(a∘b). But
b=b∘a⊕b∘a′ and since b∘a′=a′∘b≤a′ we have that ω(b∘a′)=0. Hence, ω(b)=ω(a∘b) so the right side is also [math]. If ω(a′)=0, then (4.2) is equivalent to
[TABLE]
(iv) If ω(a∘b)=0, then both sides of (4.3) are [math]. If ω(a∘b)=0, then (4.3) follows directly. Since b∘c≤b, we have that a∘(b∘c)≤a∘b. Thus, if ω(a∘b)=0 then both sides of (4.4) are [math]. If
ω(a∘b)=0, then
[TABLE]
If ω(a⊕b)=0, then (4.1) shows that on {a,b}′ we have that γ_a⊕b is a convex combination
[TABLE]
If ω(a′)=0, then (4.2) implies that on {a}′ we have that
We know that for a∈S_1(E) there exists a unique ω∈Ω(E) such that ω(a)=1. We now consider whether there are other effects with this property.
Theorem 4.3**.**
There exists a unique ω∈Ω(E) for which ω(a)=1 if and only if there is a context {a_i} such that
[TABLE]
where λ_i∈[0,1).
Proof.
If a has the form (4.5), then a_1(a)=1. If ω∈Ω(E) with ω(a)=1, then
[TABLE]
If ω(a_j)=0 for some j=2,…,n then
[TABLE]
which is a contradiction. Hence, ω(a_j)=0, j=2,…,n. We conclude that ω(a_1)=1 so ω=a_1 and a_1 is the unique state such that a_1(a)=1. Conversely, suppose there exists a unique ω∈Ω(E) such that ω(a)=1. Let a=⊕λ_ia_i for some {a_i}∈C(E), λ_i∈[0,1]. Since ω(a)=1 we have that
[TABLE]
If ω(a_j)=0 and λ_j<1, then
[TABLE]
which is a contradiction. Since ω(a_j)=0 for some j we have λ_j=1 for some j. We can assume that j=1 and write a in the form (4.5). We have that λ_i<1, i=2,…,n because if λ_i=1 then a_1(a)=a_i(a)=1 which contradicts the uniqueness of ω.
∎
Corollary 4.4**.**
If a∈S(E) , then there exists a unique ω∈Ω(E) such that ω(a)=1 if and only if a∈S_1(E).
We say that b∈E is dispersion-free relative to ω∈Ω(E) if ω(b2)=ω(b)2. Notice that if
b∈S(E), then ω(b2)=ω(b)2 if and only if ω(b)=0 or ω(b)=1. This terminology is due to the definition of dispersion as
[TABLE]
We say that b is constant almost everywhereω[a.e.(ω)] if b=λa⊕c, λ∈[0,1], where
a∈S(E), a∘c=0, ω(a)=1.
Theorem 4.5**.**
An effect b is dispersion-free relative to ω∈Ω(E) if and only if b is constant a.e.(ω).
Proof.
If b is constant a.e.(ω), then b=λa⊕c, a∈S(E), a∘c=0, ω(a)=1. Then a∣c and we have that b2=λ2a⊕c2. Since
[TABLE]
we have that 1=ω(a)≤ω(c′). Hence, ω(c′)=1 so that ω(c)=0. Since c2≤c and ω(c)=0 we conclude that ω(c2)=0. Hence,
[TABLE]
Conversely, suppose ω(b2)=ω(b)2. Let b=λ_1a_1⊕⋯⊕λ_na_n, λ_i∈[0,1],
{a_i}∈C(E). Define the random variable f(a_i)=λ_i with distribution ω(a_i). Then the expectation of f becomes
[TABLE]
Hence,
[TABLE]
Since (f−E_ω(f))2≥0, f=E_ω(f)a.e.(ω). Therefore,
[TABLE]
We can assume that
[TABLE]
and ω(a_m+1)=⋯=ω(a_n)=0. Letting a=a_1⊕⋯⊕a_n and
[TABLE]
we have that b=ω(b)a⊕c where a∈S(E), a∘c=0, ω(a)=1.
∎
It follows from the proof of Theorem 4.5 that if a is constant a.e.(ω) then the constant is ω(a).
We say that b∈E has eigeneffecta∈S_1(E) if b∣a. Notice that b∣a if and only if b∘a=a(b)a. We call a(b) the eigenvalue corresponding to eigeneffect a. The set of eigeneffects for b is the eigenspaceS_1(b) and the set of eigenvalues for b is the spectrumσ(b). Since E is spectral, every b∈E can be written as
b=λ_1a_1⊕⋯⊕λ_na_n, λ_i∈[0,1], {a_i}∈C(E). Since b∣a_i, it follows that
a_i∈S_1(b) and λ_i=a_i(b)∈σ(b), i=1,…,n. The different eigenvalues of b are unique but there may be various eigeneffects corresponding to the same eigenvalues. For example, if λ_1=λ_2, then a_1,a_2∈S_1(E) correspond to
λ_1. More generally, in this case if c∈S_1(E) and c≤a_1⊕a_2 then c corresponds to λ_1. It is also clear that if a,b∈S_1(b) correspond to different eigenvalues, then a∘b=0. Moreover, b∈S(E) if and only if
σ(b)⊆{0,1} and b∈S_1(E) if and only if 1∈σ(b) and S_1(b)={b}.
We define m(b)=min{λ:λ∈σ(b)} and M(b)=max{λ:λ∈σ(b)}. Of course,
0≤m(b)≤M(b)≤1. We define the numerical ranger(b)=[m(b),M(b)] and the norm∣∣b∣∣=M(b). It is clear that
σ(λb)=λσ(b), r(λb)=λr(b) and ∣∣λb∣∣=λ∣∣b∣∣ for all b∈E,
λ∈[0,1].
Lemma 4.6**.**
r(b)={ω(b):ω∈Ω(E)}**
Proof.
Let a_1,a_2∈S_1(b) with b∘a_1=m(b)a_1 and b∘a_2=M(b)a_2. For λ∈[0,1] we define ω_λ∈Ω(E) by ω_λ=λa_1+(1−λ)a_2. We then have
[TABLE]
Conversely, if b=λ_1a_1⊕⋯⊕λ_na_n, {a_i}∈C(E) then σ(b)={λ_i}.
If ω∈Ω(E), then ω(b)=∑λ_iω(a_i). Since ∑ω(a_i)=1 we have that
[TABLE]
Hence m(b)≤ω(b)≤M(b) and we conclude that
[TABLE]
Theorem 4.7**.**
(i)* ∣∣b∣∣=max{ω(b):ω∈Ω(E)}.
(ii) If b_1⊥b_2 then*
[TABLE]
(iii)* ∣∣b∣∣=0 if and only if b=0(iv) If a≤b then ∣∣a∣∣≤∣∣b∣∣ and for all a∈E, a≤∣∣a∣∣1.
(v)∣∣a∘b∣∣≤∣∣a∣∣∣∣b∣∣.*
Proof.
(i) follows from Lemma 4.6.
(ii) By (i) we have that
[TABLE]
(iii) We have that b=0 if and only if σ(b)={0} which is equivalent to ∣∣b∣∣=0.
(iv) If a≤b, then there exists a c∈E such that b=a⊕c. Hence, for all ω∈Ω(E) we have that
[TABLE]
It follows from (i) that ∣∣a∣∣≤∣∣b∣∣. Since a=λ_1a_1⊕⋯⊕λ_na_n, {a_i}∈C(E),
σ(a)={λ_i} we have that
[TABLE]
(v) By (iv) we have b≤∣∣b∣∣1 and hence, a∘b≤∣∣b∣∣a. Again by (iv) we conclude that
[TABLE]
5 Representation Theorems
Let E be a finite-dimensional spectral COSEA. For A={a_i}∈C(E) define the complex linear space
[TABLE]
For x,y∈H(A) with x=∑α_ia_i, y=∑β_1a_i define the inner product
⟨x,y⟩=∑α_iβ_i. Thus, H(A) is a complex Hilbert space that we call the state space for contextA. Of course, H(A) has orthonormal basis A={a_i:i=1,…,n} and dimH(A)=n.
The elements of A can be thought of as states in Ω(E) or as unit vectors in H(A) which again correspond to Hilbert space pure states. We now show that this dual role is consistent. For b∈E define the linear operator L_b on
H(A) by L_b=∑a_j(b)P(a_j). Notice that L_b is a positive operator, L_0=0, L_1=I, L_b′=I−L_b and if
b⊥c then L_b⊕c=L_b+L_c. We then have that
[TABLE]
so the dual roles are consistent. It is easy to see that L:E→E(H(A)) need not be injective or surjective and does not preserve sharpness. Moreover, all the L_b, b∈E, commute so they do not convey quantum interference. One can say that L gives a distorted partial view of E. The reason for this is that we are only employing a single context A. Each context gives a partial view and in order to obtain a total view, they must all be considered.
In order to consider several contexts together, we introduce a method to compare them. We say that E is comparable if for every
A,B∈C(E) there exists a unitary operator U_AB:H(A)→H(B) such that
[TABLE]
for all a∈A, b∈B and
[TABLE]
for all C∈C(E). Notice that if E is comparable, then any two contexts in E have the same cardinality.
We now justify why we assume that H(A) is a complex Hilbert space instead of a real space which may seem to be more natural. In many situations, there is an underlying symmetry group that we would like to represent on E. This is most accurately accomplished by employing a unitary representation of the group on H(A) for some A∈C(E). For a unitary representation, we need H(A) to be complex. Moreover, it is desirable for the representation to be context independent. This motivates requiring that
E is comparable because in this case the representations for different contexts are unitarily equivalent.
Lemma 5.1**.**
*If E is comparable, then
(i)U_AA=I,
(ii)U_AB=U_BA∗,
(iii)⟨U_ABa,U_CBc⟩2=a(c).*
Proof.
(i) Applying (5.2) gives U_AAU_AA=U_AA Multiplying by U_AA∗ gives U_AA=I.
(ii) By (5.2) we have that
[TABLE]
Hence, U_AB=U_BA∗.
(iii) Applying (5.1), (5.2) and (ii) gives
[TABLE]
For b∈E(B) with b=λ_1b_1⊕⋯⊕λ_nb_n, define b∈H(B) by
b=∑λ_iP(b_i). For comparable E define
U_BA:E(H(B))→E(H(A)) by
[TABLE]
We say that E is strongly comparable if E is comparable and if b_1⊥b_2 with b_1∈E(A),
b_2∈E(B), b_1⊕b_2∈E(C), then
[TABLE]
We see that (5.3) is a reasonable requirement which postulates that ⊕ is independent of its Hilbert space representation.
Theorem 5.2**.**
A finite-dimensional COEA E is isomorphic to a finite-dimensional Hilbertian sub-COEA if and only if E is spectral and strongly comparable.
Proof.
Suppose E is isomorphic to a Hilbertian sub-COEA F. For simplicity we can assume that E=F. It is clear that
F is state-unique. By the spectral theorem, if b∈F, then b=∑λ_ia_i where a_i∈S_1(E(H)) are polynomial functions of b. Hence, a_i∈F so E is spectral. To show that E is comparable, let A={a_i},
B={b_i} be contexts in E. Then {a_i}, {b_i} are orthonormal bases of H. Define
U_AB:H(A)→H(B) by
[TABLE]
and extend by linearity. It is clear that U_AB is unitary. Also, (5.1) holds because
[TABLE]
If C={c_i} is another context, we have that
[TABLE]
Hence, (5.2) holds so E is comparable. In this case, if a∈E then a=a and
U_AC=U_BC=I so clearly E is strongly comparable.
Conversely, suppose E is spectral and strongly comparable. Fix A∈C(E) and letJ:E→E(H(A)) be defined by
[TABLE]
where b∈E(B), B∈C(E). We first show that J(b) is well-defined. That is, we need to show J(b) is independent of the context B containing b. Suppose b∈E(B)∩E(C). Letting b_1=0, b_2=b, we have that b_1∈E(B), b_2∈E(B) and b_1⊕b_2=b∈E(C). By (5.3) we have that
[TABLE]
Therefore
[TABLE]
Hence, J(b) is well-defined. We now show that J is injective. Let b∈E(B) with
b=λ_1b_1⊕⋯⊕λ_nb_n, c∈E(C) with c=μ_1c_1⊕⋯⊕μ_nc_n and suppose that J(b)=J(c). Then U_BA(b)=U_CA(c) or equivalently
[TABLE]
This implies that
[TABLE]
which gives U_BCb=cU_BC. We conclude that
[TABLE]
Hence, U_BCb_i an eigeneffect of c with corresponding eigenvalue λ_i. But the eigenvalues of c are
μ_j with corresponding eigeneffects c_j. Therefore, λ_i=μ_j for some j and U_BCb_i=c_j. Since
[TABLE]
we have that b_i(c_j)=1. We conclude that b_j=c_i for all i so b=c. We now show that J(b_1⊕b_2)=J(b_1)⊕J(b_2). Suppose that b_1⊥b_2 with b_1∈E(B), b_2∈E(D), b_1⊕b_2∈E(C). By strong comparability we have that
[TABLE]
Hence,
[TABLE]
If λ∈[0,1], b∈E(B), then
[TABLE]
It is easy to check that the range of J is a sub-COEA of E(H(A)).
∎
We now consider representations of a finite-dimensional COSEA E. We first need some preliminary lemmas. We saw in
Theorem 3.4 that any a∈E with a=0 has a unique representation a=λ_1c_1⊕⋯⊕λ_nc_n,
λ_i=0, λ_i=λ_j, i=j, and c_i∈S(E). We denote by ⌈a⌉ the smallest sharp element that dominates a.
Lemma 5.3**.**
⌈a⌉* exists and ⌈a⌉=c_1⊕⋯⊕c_n.*
Proof.
Let c=c_1⊕⋯⊕c_n. Then c∈S(E) and a≤c. Suppose b∈S(E) and a≤b. Then a∘b=b∘a=a. Hence, b∣c_i and
[TABLE]
Now c_i∘b≤c_i and if c_i∘b<c_i we would contradict (5.4). Hence, c_i∘b=c_i so that
[TABLE]
It follows that c≤b so that c=⌈a⌉.
∎
We say that a∈E is pseudo-invertible if there exists a b∈E such that ⌈b⌉=⌈a⌉, ∣∣b∣∣=1 and
[TABLE]
for some λ∈[0,1]. We then call b a pseudo-inverse for a. (A slightly different definition as well as a version of the next lemma are given in [21].) We denote the smallest nonzero eigenvalue of a by λ(a).
Lemma 5.4**.**
If a=0, then a has a unique pseudo-inverse and λ=λ(a).
Proof.
If a=0, as before a has the unique representation a=λ_1c_1⊕⋯⊕λ_nc_n, λ_i=0,
λ_i=λ_j, i=j, c_i∈S(E). Letting
Moreover, ∣∣b∣∣=1, ⌈b⌉=⌈a⌉=c_1⊕⋯⊕c_n. For uniqueness, suppose ⌈d⌉=⌈a⌉, ∣∣d∣∣=1 and a∘d=d∘a=λ⌈a⌉. Then d=μ_1c_1⊕⋯⊕μ_nc_n and
[TABLE]
This implies that μ_1λ_i=λ for all i. Hence, μ_i=λ/λ_i. Since ∣∣d∣∣=1 we have M(d)=1 which implies that
[TABLE]
Therefore, λ(a)=λ and μ_i=λ(a)/λ_i so d=b.
∎
We denote the unique pseudo-inverse of a by a−1. If a=0, μ>0 and μa∈E, then it is easy to show that
(μa)−1=a−1. It follows that (a−1)−1=a/∣∣a∣∣ and ((a−1)−1)−1=a−1. We can interpret a−1 operationally as the effect that reverses a without interference but with a reduction of intensity by a factor λ(a). If ⌈a⌉=1, we say that a is invertible and a−1 is the inverse of a. We say that E is inverse-preserving if whenever a and b are invertible, then a∘b is as well and (a∘b)−1=a−1∘b−1. Notice that the order of a−1 and b−1 on the right is a bit unexpected but this is the correct order for a sequential product a∘b in which a is measured first. It is clear that a classical COSEA is inverse-preserving. That a Hilbertian sub-COSEA is also will be shown in Theorem 5.6.
Lemma 5.5**.**
(i)* a∈E is invertible if and only if a does not have a zero eigenvalue.
(ii) If a⊥b and a is invertible then a⊕b is invertible.*
Proof.
(i) If 0∈σ(a), then ⌈a⌉=1 so a is not invertible. If 0∈/σ(a), then ⌈a⌉=1 so a is invertible.
(ii) If a is invertible, the ⌈a⌉=1. Suppose a⊕b is not invertible. Then ⌈a⊕b⌉=1 so there exists a c∈S_1(E such that
[TABLE]
Hence, c∘a=0 which contradicts ⌈a⌉=1.
∎
When we consider a sub-Hilbertian COSEA F⊆E(H) we are assuming the standard sequential product
A∘B=A1/2BA1/2 on F.
Theorem 5.6**.**
A finite-dimensional COSEA E is isomorphic to a finite-dimensional sub-Hilbertian COSEA F⊆E(H) if and only if
E is strongly comparable and inverse-preserving.
Proof.
Suppose E is COSEA isomorphic to F⊆E(H). For simplicity, we can assume that E=F. We have shown in Theorem 5.2 that E is strongly comparable. To show that E is inverse-preserving, suppose that A,B∈E are invertible. It follows from Lemma 5.5(i)) that A and B are invertible in the usual operator sense. To avoid confusion, denote the usual operator inverse of A by A. We then have that
[TABLE]
Writing A−1 as we previously define it we have that
[TABLE]
Therefore, A−1=λ(A)A. Hence, λ(A)A∈E although A∈/E in general. Similarly, B−1=λ(B)B∈E and we can rewrite (5.5) as
[TABLE]
Hence, (A∘B)−1 exists and equals λ(A)λ(B)(A∘B)∧.
Conversely, suppose E is strongly comparable and inverse-preserving. We have previously observed that E is automatically spectral. Applying Theorem 5.2 there exists a COSEA isomorphism J from E onto a Hilbertian sub-COSEA F of
E(H). Define the product J(a)⋅J(b)=J(a∘b) on F. It is shown in [11] that F becomes a COSEA under this product. If a∈E is invertible, then J(a) is invertible with J(a)−1=J(a−1). Indeed, J(a−1)=1, J(a−1)∣J(a) and
[TABLE]
If E is inverse preserving, then ⋅ is also inverse preserving because if J(a) and J(b) are invertible, then a and b are invertible and
[TABLE]
We conclude that F⊆E(H) is an inverse preserving COSEA with sequence product. But F is also an inverse preserving COSEA under the standard sequential product ∘. It follows from Theorem 5.19 in [21] that
J(a)⋅J(b)=J(a)∘J(b). Hence, J:E→F is a COSEA isomorphism.
∎
6 Closing Comments
A natural question the reader may ask is: “What is the relationship between contexts as discussed here and the concept of contextuality considered in the literature [1, 19, 20]?” We shall devote a few sentences to this question and leave a more complete investigation to a future work. The notion of contextuality is based on an ontological model for a quantum system. Such a model is described by a measurable space
(Λ,Σ) where Λ is the set of pure states for the system. Preparation procedures, state transformations and measurements are defined by stochastic maps on Λ that satisfy certain conditions. One of the main assumptions is that these maps combine to reproduce the experimental statistics of the system in terms of conditional probabilities. We define preparation, transformation and measurement non-contextuality when these stochastic maps satisfy injectiveness properties. Our point is that the concept of contexts can be employed to construct such ontological models by defining the stochastic maps on contexts. Conversely, the stochastic maps for an ontological model will have their supports precisely on the contexts that we have defined in this paper.
Finally, we should mention that other approaches to the mathematical foundations of quantum mechanics have been recently explored. In particular, there have been recent efforts to provide a new foundation for the Hilbert space framework of quantum theory [3, 4, 16]. The main difference is that these works emphasize the role of composite systems and general transformations, while the COSEA formalism focuses on individual systems and on transformations induced by conditioning with sharp effects.
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Abramsky and A. Brandenburger, The sheaf-theoretic structure of non-locality and contextuality, New Journal of Physics , 13 , 113036 (2011), 10.1088/1367-2630/13/11/113036 and ar Xiv: quant-ph https://arxiv.org/abs/1102.0264 . · doi ↗
2[2] S. Bugajski, Fundamentals of fuzzy probability theory, Int. J. Theor. Phys. , 35 , 2229–2244 (1996), 10.1007/BF 02302443 . · doi ↗
3[3] G. Chiribella, G. M. D’Ariano and P. Perinotti, Informational derivation of quantum theory, Phys. Rev. A 84 (2011), 10.1103/Phys Rev A.84.012311 . · doi ↗
4[4] B. Coecke, A universe of processes and some of its guises, in H. Halvorson (Ed.), Deep Beauty: Understanding the Quantum World Through Mathematical Innovation , Cambridge University Press, 129–186, 2010, 10.1017/CBO 9780511976971.004 . · doi ↗
5[5] A. Dvurečenskij and S. Pulmannová, Difference posets, effects and quantum measurements, Int. J. Theor. Phys. , 33 , 819–850 (1994), 10.1007/BF 00672820 . · doi ↗
6[6] D. Foulis and M. K. Bennett, Effect algebras and unsharp quantum logics, Found. Phys. 24 1331–1352, (1994), 10.1007/BF 02283036 . · doi ↗
7[7] A. Gheondea and S. Gudder, Sequential product of quantum effects, Proc. Am. Math. Soc. 132 , 503–512, (2004), 10.1090/S 0002-9939-03-07063-1 . · doi ↗
8[8] S. Gudder, Fuzzy probability theory, Demonstratio Math. 31 , 235-254 (1998), 10.1515/dema-1998-0128 . · doi ↗