Next Article in Journal
Revisions of the Phenomenological and Statistical Statements of the Second Law of Thermodynamics
Next Article in Special Issue
Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions
Previous Article in Journal
Computing Entropy for Long-Chain Alkanes Using Linear Regression: Application to Hydroisomerization
Previous Article in Special Issue
Statistical Testing of Random Number Generators and Their Improvement Using Randomness Extraction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Problem of Existence of Joint Distribution on Quantum Logic †

by
Oľga Nánásiová
*,‡,
Karla Čipková
and
Michal Zákopčan
Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Ilkovičova 3, 841 04 Bratislava, Slovakia
*
Author to whom correspondence should be addressed.
Dedicated to Prof. Jaroslaw Pykacz (deceased in 2021).
These authors contributed equally to this work.
Entropy 2024, 26(12), 1121; https://doi.org/10.3390/e26121121
Submission received: 31 October 2024 / Revised: 30 November 2024 / Accepted: 19 December 2024 / Published: 21 December 2024
(This article belongs to the Special Issue Quantum Probability and Randomness V)

Abstract

:
This paper deals with the topics of modeling joint distributions on a generalized probability space. An algebraic structure known as quantum logic is taken as the basic model. There is a brief summary of some earlier published findings concerning a function s-map, which is a mathematical tool suitable for constructing virtual joint probabilities of even non-compatible propositions. The paper completes conclusions published in 2020 and extends the results for three or more random variables if the marginal distributions are known. The existence of a ( n + 1 ) -variate joint distribution is shown in special cases when the quantum logic consists of at most n blocks of Boolean algebras.

1. Introduction

One of the goals of modeling on orthomodular lattices, especially on quantum logics, is to study how to simulate probability so that it preserves the properties of the normed measure known from Boolean algebras. The problem was originally formulated in [1]. Later, it was discussed in many publications from a mathematical (e.g., [2,3,4,5,6,7,8]), physical (e.g., [9,10,11,12,13,14,15]), or philosophical/economical/social science point of view (e.g., [16,17,18,19]). One can find a wide overview of works within this topic up to the year 1992 in [20].
To measure probability for logical connectives of propositions in Boolean algebras, one can use the classical probability measure, also known as state. However, such modeling in orthomodular lattices, which are non-distributive generalizations of Boolean algebras, leads to difficulties (see, e.g., [21]). These difficulties are associated with a need to measure probabilities for logical connectives of propositions, which are not compatible. Quantum logic allows for the modeling of situations with non-compatible events, i.e., events that are not simultaneously measurable/observable. Methods of quantum logic appear in many domains of application, such as in economic models, data processing, and quantum mechanics (see, e.g., [1,13,14,15,18,22,23,24,25,26,27]). There is not enough space here to list all of the publications devoted to the wide scope of quantum logic applications.
Building a generalized probability theory requires introducing the concept of conditional probability (see, e.g., [28,29,30]) and defining the notion of a joint distribution (see, e.g., [31,32,33,34,35]) having the same properties as these notions have in classical probability space. In order to build such a theory including incompatible random variables, there is a need to introduce the concept of conditional probability for non-compatible random events and to follow the mentioned properties of notions.
The calculus for non-compatible observables can be found in [36]. In our paper, we follow the definition of conditional state (conditional probability) introduced in [37] and especially the function named s-map [38] derived from it. The notation “s” in s-map signifies a map for simultaneous measurements. This notion was studied in numerous papers (for all see e.g., [39,40]) and we find it a very useful mathematical tool suitable for constructing virtual joint probabilities of a pair of non-compatible propositions in quantum logic. Using an s-map p, the probability of the conjunction of propositions is modeled as a value that p takes on a pair of these propositions. Afterward, the value p ( a , b ) , with a and b non-compatible propositions, could be understood as the truth-value of the ‘counterfactual conjunction’ of propositions, i.e., ‘what would the probability of simultaneous verification of propositions a and b be if we were able to perform it’. In general, the value of p ( a , b ) depends on the order of non-compatible propositions, i.e., if p is not a commutative s-map there are non-compatible propositions for which p ( a , b ) p ( b , a ) .
The present paper deals with the topics of n-variable additive mappings on quantum logic. There is a straightforward continuity to [39,41], and it is an extension of results published in [42]. The topic itself was discussed with Prof. Jaroslaw Pykacz (deceased in 2021) over his last stay at the Slovak University of Technology in Bratislava.
This paper deals with the existence of joint distribution for three or more random variables in case we know their marginal distributions (similar problems were studied, e.g., in [43,44,45,46]). The paper completes the conclusions of [42] for three random variables in a special case when a quantum logic consists of two blocks of Boolean algebras. Analogous reasoning is then extended to n + 1 random variables for a quantum logic consisting of at most n blocks of Boolean algebras.
The paper is organized as follows: Section 2 recalls some basic notions and their properties. In Section 3, one can find the use of the s-map properties in an example of trivariate s-map and its bivariate marginal maps. Section 4 is devoted to the derivation of conditions for the existence of trivariate extension of bivariate s-maps, ( n + 1 ) -variate extension of n-variate s-maps, respectively.

2. Preliminaries

In this section, we recall fundamental notions of orthomodular lattice, orthogonality, compatibility, probability measure, quantum logic, s-maps, observables and joint distributions, n-variate s-maps, and their properties. For more details see [3,5,37,38,39,40,47,48].

2.1. Quantum Logic

Definition 1. 
Let L be a nonempty set endowed with a partial ordering ≤. Let there exist the greatest element ( 1 L ) and the smallest element ( 0 L ). Let there be defined the (lattice) operations supreme ( ) , infimum ( ) and a map : L L with the following properties:
(i) 
( a ) = a (in what follows instead of ( a ) we write a );
(ii) 
if a b then b a ;
(iii) 
a a = 1 L ;
(iv) 
if a b then b = a ( a b ) (orthomodular law).
Then ( L , 0 L , 1 L , , , ) is called the orthomodular lattice (briefly OML).
Definition 2. 
Two elements a , b from OML L are called:
(i) 
orthogonal if and only if a b (in what follows we write a b );
(ii) 
compatible (we write a b ) if and only if there exist pairwise orthogonal elements a 1 , b 1 , c L with
a = a 1 c   a n d   b = b 1 c .
The elements a 1 , b 1 , c L are unambiguously determined and satisfy [3]
a 1 = a b , b 1 = a b , c = a b .
Instead of the previous definition (Definition 2) of compatibility of the elements from L, it is common to use a shorter version of it, which says the elements a , b L are compatible if a = ( a b ) ( a b ) .
If a L is compatible to b L , then b is also compatible to a. Moreover, a a , a a , a 1 L and a 0 L . If a b then a b and if c d , then c d . The compatibility relation does not have a transitive property, i.e., if a b and b c , no one can automatically conclude that a c .
If L is a Boolean algebra, then two arbitrary elements from L are compatible. Furthermore each OML is a union of Boolean subalgebras with non-empty intersections while the maximal Boolean subalgebra is referred to as a block. For any element a L there exists at least one block containing a.
Definition 3. 
A probability measure (alternatively called a state on L) is a mapping m : L [ 0 , 1 ] satisfying
(i) 
m ( 1 L ) = 1 ;
(ii) 
if a b then m ( a b ) = m ( a ) + m ( b ) .
There are three types of OMLs according to the number of states: OMLs with no state, OMLs with exactly one state, and OMLs with an uncountable number of states (see, e.g., [49]). An OML, which is of the last type, is usually called a quantum logic (abbr. QL). From the algebraic point of view, a QL L is an orthomodular lattice such that for every orthogonal element a , b L , we have a b L and a b L .
Not every OML can be used for modeling uncertainty, or for modeling generalized probability theory. We consider a QL as a type of OML suitable for such modeling. Throughout present paper L is assumed to be a quantum logic.

2.2. S-Maps

Among several possible approaches to the problem of joint distribution (a measure of virtual conjunction), there is one applying the notion of s-map, introduced by Nánásiová in [38].
Definition 4. 
A map p : L × L [ 0 , 1 ] is called a map for simultaneous measurements (abbr. s-map) if the following conditions are satisfied:
(s1) 
p ( 1 L , 1 L ) = 1 ;
(s2) 
if a b then p ( a , b ) = 0 ;
(s3) 
if a b then for any c L :
p ( a b , c ) = p ( a , c ) + p ( b , c ) ,
p ( c , a b ) = p ( c , a ) + p ( c , b ) .
This definition is the immediate consequence of the definition of conditional state on quantum logic (see in [37]).
Here we mention three properties of s-maps proved in [38] which will play an important role in our further considerations:
(N1)
The map m p : L [ 0 , 1 ] with m p ( a ) = p ( a , a ) = p ( 1 L , a ) = p ( a , 1 L ) is a state on L. Such a state is referred to as a state generated by p.
(N2)
If a b then p ( a , b ) = m p ( a b ) = p ( b , a ) .
(N3)
p ( a , b ) = 1 m p ( a ) m p ( b ) + p ( a , b ) for arbitrary elements a , b L .
The property (N2) shows that the value p ( a , b ) of compatible propositions ( a b ) corresponds to the value that a state m p generated by p assigns to the meet a b , representing a conjunction of a and b. On the other hand, s-maps can be seen as providing probabilities of ‘virtual’ conjunctions of propositions, even non-compatible ones.
There exist OMLs admitting no states as Greechie showed in [21]. Of course, no s-map can be defined on such OMLs. On the contrary, there exist a lot of s-maps on OMLs with unital sets of states (Propositions 1.1 and 2.2 of [38]).

2.3. n-Variate S-Maps and Their Properties

At first we remind the crucial definition of an n-variate s-map (see in [40]).
Definition 5 
([40]). Let L be an OML. The map p n : L n [ 0 , 1 ] conforming to the conditions:
(s1’) 
p n ( 1 L , , 1 L ) = 1 ;
(s2’)  
if a i a j for some i , j { 1 , , n } , then p n ( a 1 , , a n ) = 0 ;
(s3’) 
if b i c i for some i { 1 , , n } , then
p n ( a 1 , , b i c i , , a n ) = p n ( a 1 , , b i , , a n ) + p n ( a 1 , , c i , , a n ) ;
is referred to as an n-variate s-map on L .
Let us remark that the s-map defined in the previous text is a bivariate s-map in the definition just mentioned ( n = 2 ).
Remark 1 
([40]). Let L be a Boolean algebra and m p : L [ 0 , 1 ] be mapping defined by m p ( a ) = p n ( a , , a ) , then m p is an additive measure induced by the s-map p n satisfying
p n ( a 1 , a 2 , , a n ) = m p ( a 1 a 2 a n ) .
In general, an s-map is not invariant with respect to permutations of elements, therefore
p n ( a 1 , a 2 , , a n ) = p n ( π ( a 1 , a 2 , , a n ) ) ,
where π ( a 1 , , a n ) denotes a permutation of ( a 1 , , a n ) , does not hold in general. We recommend the reader to see [40].
In case p n ( a 1 , a 2 , , a n ) p n ( π ( a 1 , a 2 , , a n ) ) , mapping p n may be referred to as a contextual s-map since the probability value for elements a 1 , a 2 , , a n depends on the order of input variables.
Proposition 1 
([40]). Let p n be an n-variate s-map on a QL L and let ( a 1 , , a n ) L n . Then
(a) 
a map m p : L [ 0 , 1 ] satisfying m p ( a ) : = p n ( a , , a ) , a L , is a state on L, it means
p n ( a , , a ) = p n ( π ( a , , 1 L ) ) = p n ( π ( a , , 1 L , 1 L ) ) = p n ( π ( a , 1 L , , 1 L ) ) ,
where π is any permutation;
(b) 
for any ( a 1 , , a n ) L n p n ( a 1 , , a n ) m p ( a i ) for each i { 1 , 2 , , n } ;
(c) 
if a i a j for some i j , i , j { 1 , , n } then
p n ( a 1 , , a n ) = p n ( a 1 , , a i 1 , a i a j , a i + 1 , , a j 1 , a j a i , a j + 1 , , a n ) = p n ( π ( a 1 , , a n ) )
for arbitrary permutation π,
(d) 
if a i = 1 L for some i { 1 , , n } then
p n ( a 1 , , a n ) = p n ( a 1 , , a i 1 , a j , a i + 1 , , a n )
for each j { 1 , , n } .
Definition 6 
([40]). Let p n : L n [ 0 , 1 ] be an n-variate s-map. Let k < n , k N . The map p k : L k [ 0 , 1 ] satisfying
p k ( a 1 , a 2 , , a k ) = p n ( a 1 , a 2 , , a k , 1 L , , 1 L )
for any a i L , i = 1 , 2 , , k is referred to as a marginal s-map, and the original n-variate s-map p n is called an extension of p k .
The fact that 1 L a for any a L and the assertion of Proposition 1 imply that each marginal s-map is invariant with respect to (abbreviation w.r.t.) permutations. In the sequel, we will study only n-variate s-maps which are invariant w.r.t. permutations, i.e.,
p n ( a 1 , , a n ) = p n ( π ( a 1 , , a n ) )
for any permutation π and any ( a 1 , , a n ) L n . Bivariate s-map invariant w.r.t. permutations will be called commutative.
Remark 2. 
If a b and c L then
p 3 ( a , b , c ) = p 3 ( ( a b ) ( a b ) , b , c ) = p 3 ( ( a b ) , b , c ) + p 3 ( ( a b ) , b , c ) 0 = = p 3 ( a b , b , c ) = p 3 ( a b , b a , c ) = p 3 ( a b , 1 L , c ) = = p 3 ( a b , c c , c ) = p 3 ( a b , c , c ) + p 3 ( a b , c , c ) 0 = = p 3 ( π ( a b , 1 L , c ) ) = p 3 ( π ( a b , c , c ) ) .
That means p 3 ( a b , x , c ) is invariant w. r. t. order of input variables for any x { a b , a , b , c , 1 L } .

2.4. Observables and Joint Distributions

From a mathematical point of view, the definition of the concept of an observable depends on the basic structure that one uses for modeling uncertainty.
We will call an observable a homomorphism x from Borel subsets of real line B ( R ) to a quantum logic L such that x ( ) = 0 , x ( R ) = 1 , x ( E c ) = ( x ( E ) ) and x ( E F ) = x ( E ) x ( F ) for any E , F B ( R ) (see e.g., [3,50]). We denote R ( x ) the range of observable x, namely R ( x ) = { x ( E ) : E B ( R ) } .
The observables x, y are called compatible ( x y ) or simultaneously measurable, if for arbitrary E , F B ( R ) we have x ( E ) y ( F ) . The observables x, y are compatible if and only if a b for any a R ( x ) and any b R ( y ) . In the case where we consider two simultaneously measurable observables, all propositions from the ranges of observables could be then interpreted in the way of classical (Boolean) logic.
The problem of introducing some calculus for non-compatible observables has been studied since Birkhoff and von Neumann [1].
In order to introduce a similar calculus for non-compatible observables as in the classical theory of probability, a concept similar to a joint distribution is needed. To meet several approaches to this problem we recommend the reader to see, e.g., [3,5,40,50,51,52,53,54,55,56,57,58]. In order to define the notion of a joint distribution, we will follow the concept of an s-map.
Let x, y be observables on L and p be an s-map. Then the function
F x , y ( t , s ) = p ( x ( , t ) , y ( , s ) )
is the joint distribution for observables x , y (e.g., [36]). If x y , then
F x , y ( t , s ) = p ( x ( , t ) , y ( , s ) ) = m p ( x ( , t ) y ( , s ) )
for any t , s R . Since m p is a probability measure, the function F x , y ( · , · ) is the joint distribution for random variables generated with observables x and y.
The definition of a joint distribution could be extended for three (or more) observables x, y, z in a natural manner:
F x , y , z ( t , s , u ) = p ( x ( , t ) , y ( , s ) , z ( , u ) ) .

3. Bivariate s -Map Extension

Following the conditions from Definition 6 if p is a bivariate commutative s-map on L then the trivariate extension of p is an s-map p 3 : L 3 [ 0 , 1 ] satisfying
p ( a , b ) = p 3 ( a , b , 1 L ) .
There is a straightforward way to find a function that satisfies this condition. One can choose, e.g., p 3 ( a , b , c ) = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } . However, such a function would not necessarily be an s-map because of violating some conditions following from Definition 5. The following example illustrates such a situation.
Example 1. 
Let L be a horizontal sum of three 4-element Boolean algebras { 0 L , u , u , 1 L } , where u { a , b , c } . Consider a bivariate commutative s-map p. Since
p ( u , u ) = p ( u , 1 L ) = p ( u , v v ) = p ( u , v ) + p ( u , v )
for some v { a , b , c , 1 L } , Table 1 defines the following s-map:
We show it is impossible to extend the bivariate map p to a trivariate s-map p 3 . To construct such map, one has to choose p 3 ( x , y , z ) in such way that
0 p 3 ( x , y , z ) min { p ( x , y ) , p ( x , z ) , p ( y , z ) }
for any mutually distinct x , y , z { a , a , b , b , c , c } . In addition, the sum of all p 3 ( x , y , z ) chosen this way has to be equal to 1.
Denote:
Q 1 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.1 , 0.1 , 0 } = 0 , Q 2 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.1 , 0 , 0.2 } = 0 , Q 3 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0 , 0.1 , 0.4 } = 0 , Q 4 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0 , 0 , 0.4 } = 0 , Q 5 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.1 , 0.3 , 0 } = 0 , Q 6 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.1 , 0.6 , 0.2 } = 0.1 , Q 7 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.8 , 0.3 , 0.4 } = 0.3 , Q 8 = min { p ( a , b ) , p ( a , c ) , p ( b , c ) } = min { 0.8 , 0.6 , 0.4 } = 0.4 ,
then
i = 1 8 Q i = 0.8 < 1 .
We can conclude there is no trivariate extension p 3 of the bivariate s-map p.
Remark 3. 
Let p : L 2 [ 0 , 1 ] be a bivariate s-map on L. Then the function d p : L 2 [ 0 , 1 ] such that
d p ( a , b ) = p ( a , b ) + p ( a , b ) = m p ( a ) + m p ( b ) 2 p ( a , b )
can be interpreted as a measure of distance for a , b L . This function has been studied, e.g., in [39,41,47].
Generally there exist a , b L and an s-map p such that d p ( a , b ) d p ( b , a ) . Moreover, there is no guarantee for this mapping to be a pseudo-metric, i.e., the triangle inequality
d p ( a , b ) d p ( a , c ) + d p ( c , b )
can be infringed.
Under the assumption of B being a Boolean algebra, a mapping d p is pseudo-metric, namely for arbitrary a , b , c B the triangle inequality (1) is fulfilled. Furthermore, d p ( a , b ) = d p ( b , a ) .
Proposition 2 
([39], Proposition 3). Let L be a quantum logic in which
L = { a 1 , a 1 , a 2 , a 2 , a 3 , a 3 , 0 L , 1 L }
is a horizontal sum of three 4-element Boolean algebras { a i , a i , 0 L , 1 L } , i = 1 , 2 , 3 . Let p be a commutative bivariate s-map on L and let d p be the d-map induced by p. The s-map p is a marginal one if and only if d p satisfies the triangle inequality on L.
Proposition 3 
([42], Proposition 3). Let p be a commutative bivariate s-map on a quantum logic L. Then a trivariate s-map, which is an extension of p exists if and only if d p satisfies the triangle inequality on L.

4. Existence of Trivariate Extensions of Bivariate s-Maps

This section is devoted to the study of conditions for the existence of extensions of a bivariate s-map p to trivariate s-maps p 3 . Proposition 4 extends the conclusions of Proposition 3 and Proposition 2, respectively.
Proposition 4. 
Let a QL L consist of two blocks B 1 , B 2 ( L = B 1 B 2 and { 0 L , 1 L } B 1 B 2 ), where B i is a Boolean algebra, i = 1 , 2 . Then any commutative bivariate s-map p can be extended to a trivariate s-map p 3 .
Proof of Proposition 4. 
Let L = B 1 B 2 , where B 1 , B 2 are Boolean algebras and { 0 L , 1 L } B 1 B 2 . By means of p (a given bivariate commutative s-map), we intend to define a mapping g : L 3 [ 0 , 1 ] . As there are two blocks and three variables of g, we expect it to be invariant with respect to any permutation π and any triple ( x 1 , x 2 , x 3 ) L 3 , i.e.,
g ( π ( x 1 , x 2 , x 3 ) ) = g ( x 1 , x 2 , x 3 )
since at least two of x 1 , x 2 , x 3 are compatible (see Proposition 1c).
Furthermore, we expect g to be an extension of p : L 2 [ 0 , 1 ] , therefore (without loss of generality let x 1 x 2 ) we have
g ( x 1 , x 2 , x 3 ) = g ( x 1 x 2 , x 1 x 2 , x 3 ) = g ( 1 L , x 1 x 2 , x 3 ) .
In this manner, we naturally come to a unique way how to define g : L 3 [ 0 , 1 ] :
g ( x 1 , x 2 , x 3 ) = p ( x i x j , x k )
where i , j , k { 1 , 2 , 3 } , i , j , k are pairwise distinct and x i x j .
The correctness of the definition of mapping g follows directly from Proposition 1c and Remark 2.
It is easy to see that mapping g defined in this way is permutation-free, which means that g ( π ( x 1 , x 2 , x 3 ) ) = g ( x 1 , x 2 , x 3 ) for all ( x 1 , x 2 , x 3 ) L 3 and for arbitrary permutation π of elements x 1 , x 2 , x 3 L .
In addition, mapping g is really an extension of p since:
g ( 1 L , x 2 , x 3 ) = p ( 1 L x 2 , x 3 ) = p ( x 2 , x 3 ) .
Having g defined, let us verify conditions (s1’) – (s3’) of Definition 5. To further simplify our reasoning we can, without loss of generality, suppose that
x 1 B 1 , x 1 x 2 :
(s1’)
g ( 1 L , 1 L , 1 L ) = p ( 1 L 1 L , 1 L ) = 1 ,
(s2.1’)
if x 1 x 2 , then
g ( x 1 , x 2 , x 3 ) = p ( x 1 x 2 , x 3 ) = p ( 0 L , x 3 ) = 0 ,
(s2.2’)
if x 1 x 3 , then x 1 x 2 x 3 and thus
g ( x 1 , x 2 , x 3 ) = p ( x 1 x 2 , x 3 ) = 0 ,
(s2.3’)
if x 2 x 3 , then likewise the previous case x 1 x 2 x 3 and
g ( x 1 , x 2 , x 3 ) = p ( x 1 x 2 , x 3 ) = 0 ,
(s3’)
It remains to show additivity of g in each coordinate. Let x ˙ 1 , x ¨ 1 L be such that x 1 = x ˙ 1 x ¨ 1 , x ˙ 1 x ¨ 1 . It is clear that both x ˙ 1 and x ¨ 1 are compatible with x 1 . Thus x ˙ 1 , x ¨ 1 B 1 as well.
First, let us compute g ( x 1 , x 2 , x 3 ) = g ( x ˙ 1 x ¨ 1 , x 2 , x 3 ) .
If x 2 x 3 , we obtain
g ( x ˙ 1 x ¨ 1 , x 2 , x 3 ) = p ( x 2 x 3 , x ˙ 1 x ¨ 1 ) = = p ( x 2 x 3 , x ˙ 1 ) + p ( x 2 x 3 , x ¨ 1 ) = = g ( x ˙ 1 , x 2 , x 3 ) + g ( x ¨ 1 , x 2 , x 3 ) .
If x 2 x 3 , then x 1 is compatible with at least one of x 2 , x 3 . Without loss of generality let x 1 x 2 . Furthermore, since x ˙ 1 , x ¨ 1 , x 2 B 1 , we obtain
g ( x ˙ 1 x ¨ 1 , x 2 , x 3 ) = p ( ( x ˙ 1 x ¨ 1 ) x 2 , x 3 ) = = p ( ( x ˙ 1 x 2 ) ( x ¨ 1 x 2 ) , x 3 ) .
Realizing that ( x ˙ 1 x 2 ) ( x ¨ 1 x 2 ) we conclude
g ( x ˙ 1 x ¨ 1 , x 2 , x 3 ) = p ( x ˙ 1 x 2 , x 3 ) + p ( x ¨ 1 x 2 , x 3 ) = = g ( x ˙ 1 , x 2 , x 3 ) + g ( x ¨ 1 , x 2 , x 3 ) .
The mapping g is trivariate s-map on L. □
Corollary 1. 
Let L be a quantum logic and x , y be observables on L. If x y , then for any observable z and s-map p, there exists the joint distribution p x , y , z 3 if we know marginal distributions.
Corollary 2. 
Let a QL L consists of n blocks B 1 , , B n ( L = i = 1 n B i and { 0 L , 1 L } i = 1 n B i ), where B i is a Boolean algebra, i = 1 , , n . Then any n-variate s-map p n satisfying
p n ( x 1 , , x n ) = p n ( π ( x 1 , , x n ) )
for any ( x 1 , , x n ) L n and arbitrary permutation π : L n L n of ( x 1 , , x n ) , can be extended to a ( n + 1 ) -variate s-map.
Proof of Corollary 2. 
With n blocks and n + 1 elements x , x 1 , , x n , there must exist at least one x i of x 1 , , x n such that x x i .
Then, similarly to the previous Proposition, we set
g ( x , x 1 , , x n ) = p n ( x x i , x 1 , , x i 1 , x i + 1 , , x n ) .
The mapping g is ( n + 1 ) -variate s-map on L. □

5. Conclusions

We have shown that under the assumption a quantum logic L consists of two blocks of Boolean algebras, then any commutative bivariate s-map can be extended to a trivariate s-map p 3 , which is designed in a specific way following the structure of the map g in the proof of Proposition 4. It follows, if x , y are compatible observables on L, then for any observable z and arbitrary s-map p, the joint distribution p x , y , z 3 exists in cases where the marginal distributions are known.
Analogous reasoning as in Proposition 4 can then be extended to n + 1 random variables for a quantum logic consisting of at most n blocks of Boolean algebras. One can notice that if the number of blocks in a quantum logic L is less than the number of variables in the s-map, some properties in the extension of s-map, like being permutation free, are preserved, i.e., these characterizations carried by s-maps and valid within a Boolean algebra can be partially transferred to a larger generalization like a quantum logic.
Unlike the paper [42], in which authors have shown that necessary and sufficient conditions for the existence of trivariate extension p 3 of a commutative bivariate s-map p are in compliance with triangle inequalities for the function d p generated by p, the results obtained in this paper refer to the maximal number of blocks in a quantum logic L guaranteeing the existence of p 3 . If the assumptions of Proposition 4 are fulfilled, there exists the trivariate extension p 3 of s-map p, and the compliance with triangle inequalities by d p follows directly.
In addition, Corollary 2 provides another criterion to obtain positive information about the existence of multivariate extension of any permutation-free s-map p, even in a case when triangle inequalities for the function d p (as the sufficient conditions for extending trivariate s-map to quadrivariate s-map) fail to hold (see [42]).
The last statement does not indicate that to consider the existence of extension by verifying triangle inequalities is completely wrong. It only claims that this verification is intended for trivariate extension of a bivariate s-map rather than for quadrivariate extension of a trivariate s-map. The problem of finding the necessary and sufficient conditions for the existence of a quadrivariate extension of a trivariate s-map has not been settled and requires further investigations.

Author Contributions

The authors, O.N., K.Č. and M.Z., equally investigated and contributed to the present work. As the paper has the theoretical character, the definition of individual roles within the work is next to impossible. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

Special thanks from all authors go to the Institute of Computer Science and Mathematics of the Faculty of Electrical Engineering and Information Technology of Slovak University of Technology in Bratislava for providing administrative and technical background during the period of editing the paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Birkhoff, G.; von Neumann, J. The Logic of Quantum Mechanics. Ann. Math. 1936, 37, 823–843. [Google Scholar] [CrossRef]
  2. Varadarajan, V.S. Geometry of Quantum Theory; Springer: New York, NY, USA, 1968. [Google Scholar]
  3. Pták, P.; Pulmannová, S. Orthomodular Structures as Quantum Logics; Springer: Dordrecht, The Netherlands, 1991. [Google Scholar]
  4. Guz, W. On the lattice structure of quantum logics. Ann. l’I. H. P. Phys. Théorique 1978, 28, 1–7. [Google Scholar]
  5. Dvurečenskij, A.; Pulmannová, S. New Trends in Quantum Structures; Springer: Dordrecht, The Netherlands, 2000. [Google Scholar]
  6. Pavičić, M.; Megill, N.D. Is quantum, logic a logic? In Handbook of Quantum Logic and Quantum Structures, 1st ed.; Engesser, K., Gabbay, D.M., Lehmann, D., Eds.; Elsevier: Amsterdam, The Netherlands, 2009; pp. 23–47. [Google Scholar]
  7. Holik, F. On the Connection Between Quantum Probability and Geometry. Quanta 2021, 10, 1–14. [Google Scholar] [CrossRef]
  8. Hamhalter, J. Quantum Measure Theory; Science & Business Media: New York, NY, USA, 2013. [Google Scholar]
  9. Plotnitsky, A. Reality Without Realism: Matter, Thought, and Technology in Quantum Physics; Springer: Cham, Switzerland, 2021. [Google Scholar]
  10. Gudder, S.P. Quantum Probability; Academic Press: San Diego, CA, USA, 1988. [Google Scholar]
  11. Beltrametti, E.G.; Cassinelli, G. The Logic of Quantum Mechanics (Encyclopedia of Mathematics and Its Applications—Vol 15); Cambridge University Press: New York, NY, USA, 2010; Addison-Wesley: Reading, MA, USA, 1981. [Google Scholar]
  12. Pitowsky, I. Quantum Probability—Quantum Logic; Lecture Notes in Physics; Springer: Berlin/Heidelberg, Germany, 1989; Volume 321. [Google Scholar]
  13. Khrennikov, A. EPR-Bohm Experiment and Bell’s Inequality: Quantum Physics Meets Probability Theory. Theor. Math. Physic 2008, 157, 86–99. [Google Scholar] [CrossRef]
  14. Sergioli, G.; Bosyk, G.M.; Santucci, E.; Giuntini, R. A Quantum-inspired Version of the Classification Problem. Int. J. Theor. Phys. 2017, 56, 3880–3888. [Google Scholar] [CrossRef]
  15. Garola, C. An Epistemic Interpretation of Quantum Probability via Contextuality. Found. Sci. 2020, 25, 105–120. [Google Scholar] [CrossRef]
  16. Jammer, M. The Philosophy of Quantum Mechanics; Wiley-Interscience: New York, NY, USA, 1974. [Google Scholar]
  17. Haven, E.; Khrennikov, A.J. Quantum Social Science; Cambridge University Press: New York, NY, USA, 2013. [Google Scholar]
  18. Sozzo, S. Conjunction and Negation of Natural Concepts: A Quantum-theoretic Modeling. J. Math. Psychol. 2015, 66, 83–102. [Google Scholar] [CrossRef]
  19. Svozil, K. Quantum, Probability, Logic: The Work and Influence of Itamar Pitowsky. In Jerusalem Studies in Philosophy and History of Science (JSPS); Hemmo, M., Shenker, O., Eds.; Springer International Publishing: Cham, Switzerland, 2020; pp. 521–544. [Google Scholar]
  20. Pavičić, M. Bibliography on quantum logics and related structures. Int. J. Theor. Phys. 1992, 31, 373–461. [Google Scholar]
  21. Greechie, R.J. Orthomodular Lattices Admitting No States. J. Comb. Theory 1971, 10, 119–132. [Google Scholar] [CrossRef]
  22. Holik, F.; Fortin, S.; Bosyk, G.; Plastino, A. On the Interpretation of Probabilities in Generalized Probabilistic Models. In Quantum Interaction; De Barros, J., Coecke, B., Pothos, E., Eds.; QI 2016. Lecture Notes in Computer Science; Springer: Cham, Switzerland, 2017; Volume 10106. [Google Scholar]
  23. Frąckiewicz, P. Remarks on quantum duopoly schemes. Quantum Inf. Process. 2016, 15, 121–136. [Google Scholar] [CrossRef]
  24. Frąckiewicz, P.; Szopa, M.; Makowski, M.; Piotrowski, E. Nash Equilibria of Quantum Games in the Special Two-Parameter Strategy Space. Appl. Sci. 2022, 12, 11530. [Google Scholar] [CrossRef]
  25. Garola, C. Kolmogorovian versus Non-Kolmogorovian Probabilities in Contextual Theories. Entropy 2021, 23, 121. [Google Scholar] [CrossRef] [PubMed]
  26. Khrennikov, A. Two Faced Janus of Quantum Nonlocality. Entropy 2020, 22, 303. [Google Scholar] [CrossRef] [PubMed]
  27. Shukla, A.; Khare, M.; Pandey, P. Kolmogorov–Sinai type logical entropy for generalized simultaneous measurements. Rep. Math. Phys. 2021, 88, 21–40. [Google Scholar] [CrossRef]
  28. Beltrametti, E.G.; Cassinelli, G.; Lahti, P.J. Unitary measurements of discrete quantities in quantum mechanics. J. Math. Phys. 1990, 31, 91–98. [Google Scholar] [CrossRef]
  29. Cassinelli, G.; Zanghí, N. Conditional probabilities in quantum mechanics. Nuovo Cim. 1984, B 79, 141–154. [Google Scholar] [CrossRef]
  30. Basieva, I.; Khrennikov, A. Conditional Probability Framework for Entanglement and its Decoupling from Tensor Product Structure. J. Phys. A Math. Theor. 2022, 55, 395302. [Google Scholar] [CrossRef]
  31. Beltrametti, E.G.; Maczynski, M.J. On a characterization of classical and nonclassical probabilities. J. Math. Phys. 1991, 32, 1280–1286. [Google Scholar] [CrossRef]
  32. Beltrametti, E.G.; Maczynski, M.J. On Bell-type inequalities. Found. Phys. 1994, 24, 1153–1159. [Google Scholar] [CrossRef]
  33. Pulmannová, S.; Dvurečenskij, A. Quantum logics, vector-valued measures and representations. Ann. de l’I. H. P. Phys. Théorique 1990, 5, 83–95. [Google Scholar]
  34. Pulmannová, S. Joint distributions of observables on quantum logics. Int. J. Theor. Phys. 1978, 17, 665–675. [Google Scholar] [CrossRef]
  35. Pykacz, J.; Fra̧ckiewicz, P. The Problem of Conjunction and Disjunction in Quantum Logics. Int. J. Theor. Phys. 2017, 56, 3963–3970. [Google Scholar] [CrossRef]
  36. Kalina, M.; Nánásiová, O. Calculus for Non-Compatible Observables, Construction Through Conditional States. Int. J. Theor. Phys. 2014, 54, 506–518. [Google Scholar]
  37. Nánásiová, O. Principle Conditioning. Int. J. Theor. Phys. 2004, 43, 1383–1395. [Google Scholar] [CrossRef]
  38. Nánásiová, O. Map for Simultaneous Measurements for a Quantum Logic. Int. J. Theor. Phys. 2003, 42, 1889–1903. [Google Scholar] [CrossRef]
  39. Nánásiová, O.; Valášková, Ĺ. Marginality and Triangle Inequality. Int. J. Theor. Phys. 2010, 49, 3199–3208. [Google Scholar] [CrossRef]
  40. Nánásiová, O.; Khrennikov, A. Compatibility and Marginality. Int. J. Theor. Phys. 2007, 46, 1083–1095. [Google Scholar] [CrossRef]
  41. Pykacz, J.; Valášková, Ĺ.; Nánásiová, O. Bell-Type Inequalities for Bivariate Maps on Orthomodular Lattices. Found. Sci. 2015, 45, 900–913. [Google Scholar] [CrossRef]
  42. Nánásiová, O.; Pykacz, J.; Valášková, Ĺ.; Čipková, K. On Extension of Joint Distribution Functions on Quantum Logics. Int. J. Theor. Phys. 2020, 59, 274–291. [Google Scholar] [CrossRef]
  43. Vlach, M. Conditions for the Existence of Solutions of the Three-dimensional Planar Transportation Problem. Discret. Appl. Math. 1986, 13, 61–78. [Google Scholar] [CrossRef]
  44. Malvestuto, F.M. Existence of Extensions and Product Extensions for Discrete Probability Distributions. Discret. Math. 1988, 69, 61–77. [Google Scholar] [CrossRef]
  45. Sklar, A. Fonctions de Répartition à n Dimensions et Leurs Marges. Publ. L’Institut Stat. L’Université De Paris 1959, 8, 229–231. [Google Scholar]
  46. Sklar, A. Random Variables, Distribution Functions, and Copulas—A Personal Look Backward and Forward (in Distributions with Fixed Marginals and Related Topics). Inst. Math. Stat. 1996, 28, 1–14. [Google Scholar]
  47. Nánásiová, O.; Valášková, Ĺ. Maps on a Quantum Logic. Soft Comput. 2010, 14, 1047–1052. [Google Scholar] [CrossRef]
  48. Kalmbach, G. Orthomodular Lattices; Academic Press: London, UK; New York, NY, USA, 1983. [Google Scholar]
  49. Pavičić, M. Exhaustive Generation of Orthomodular Lattices with Exactly One Nonquantum State. Rep. Math. Phys. 2009, 64, 417–428. [Google Scholar] [CrossRef]
  50. Gudder, S. Joint Distributions of Observables. J. Math. Mech. 1968, 18, 325–335. [Google Scholar] [CrossRef]
  51. Dvurečenskij, A.; Pulmannová, S. On joint distribution of observables. Math. Slovaca 1982, 32, 155–166. [Google Scholar]
  52. Dvurečenskij, A.; Pulmannová, S. Connection Between Joint Distribution and Compatibility. Rep. Math. Phys. 1984, 19, 349–359. [Google Scholar] [CrossRef]
  53. Czkwianianc, E. Joint distributions and compatibility of observables in quantum logics. Math. Slovaca 1988, 38, 361–366. [Google Scholar]
  54. Dvurečenskij, A.; Pulmannová, S. On the sum of observables in a logic. Math. Slovaca 1980, 30, 393–399. [Google Scholar]
  55. Gudder, S.P. Uniqueness and existence properties of bounded observables. Pac. J. Math. 1966, 19, 81–83. [Google Scholar] [CrossRef]
  56. Gudder, S.P. Stochastic Methods in Quantum Mechanics; Elsevier North Holland, Inc.: New York, NY, USA, 1979. [Google Scholar]
  57. Urbanik, K. Joint probability distributions of observables in quantum mechanics. Stud. Math. 1961, 21, 117–133. [Google Scholar] [CrossRef]
  58. Urbanik, K. Joint distributions and commutability of observables. Demonstr. Math. 1985, 1, 31–41. [Google Scholar] [CrossRef]
Table 1. The values of p. For any u , v L : p ( u , v ) = p ( v , u ) .
Table 1. The values of p. For any u , v L : p ( u , v ) = p ( v , u ) .
pa a b b c c
a 0.1 0 0.1 0 0.1 0
a 0.9 0.1 0.8 0.3 0.6
b 0.2 00 0.2
b 0.8 0.4 0.4
c 0.4 0
c 0.6
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Nánásiová, O.; Čipková, K.; Zákopčan, M. Problem of Existence of Joint Distribution on Quantum Logic. Entropy 2024, 26, 1121. https://doi.org/10.3390/e26121121

AMA Style

Nánásiová O, Čipková K, Zákopčan M. Problem of Existence of Joint Distribution on Quantum Logic. Entropy. 2024; 26(12):1121. https://doi.org/10.3390/e26121121

Chicago/Turabian Style

Nánásiová, Oľga, Karla Čipková, and Michal Zákopčan. 2024. "Problem of Existence of Joint Distribution on Quantum Logic" Entropy 26, no. 12: 1121. https://doi.org/10.3390/e26121121

APA Style

Nánásiová, O., Čipková, K., & Zákopčan, M. (2024). Problem of Existence of Joint Distribution on Quantum Logic. Entropy, 26(12), 1121. https://doi.org/10.3390/e26121121

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop