11institutetext: Department SBAI, University of Rome “La Sapienza”, Rome, Italy
11email: [email protected]
22institutetext: Department of Mathematics and Computer Science,
University of Palermo, Italy
22email: [email protected]
Conjunction of Conditional Events and T-norms
Angelo Gilio
Both authors contributed equally to the article and are listed alphabetically.Retired11
Giuseppe Sanfilippo
⋆
22
Abstract
We study the relationship between a notion of conjunction among conditional events, introduced in recent papers, and the notion of Frank t-norm. By examining different cases, in the setting of coherence, we show each time that the conjunction coincides with a suitable Frank t-norm. In particular, the conjunction may coincide with the Product t-norm, the Minimum t-norm, and Lukasiewicz t-norm.
We show by a counterexample, that the prevision assessments obtained by Lukasiewicz t-norm may be not coherent. Then, we give some conditions of coherence when using Lukasiewicz t-norm.
Keywords:
Coherence, Conditional Event, Conjunction, Frank t-norm.
1 Introduction
In this paper we use the coherence-based approach to probability of de Finetti ([1, 2, 7, 9, 10, 13, 14, 16, 17, 18, 22, 25]). We use a notion of conjunction which, differently from other authors, is defined as a suitable conditional random quantity with values in the unit interval (see, e.g. [20, 21, 23, 24, 36]).
We study the relationship between our notion of conjunction and the notion of Frank t-norm. For some aspects which relate probability and Frank t-norm see, e.g., [5, 6, 8, 11, 15, 34]. We show that, under the hypothesis of logical independence, if the prevision assessments involved with the conjunction (A∣H)∧(B∣K)
of two conditional events are coherent, then the prevision of the conjunction coincides, for a suitable λ∈[0,+∞], with the Frank t-norm Tλ(x,y), where x=P(A∣H),y=P(B∣K). Moreover, (A∣H)∧(B∣K)=Tλ(A∣H,B∣K). Then, we consider the case A=B, by determining the set of all coherent assessment (x,y,z) on {A∣H,A∣K,(A∣H)∧(A∣K)}. We show that, under coherence, it holds that (A∣H)∧(A∣K)=Tλ(A∣H,A∣K), where λ∈[0,1]. We also study the particular case where A=B and HK=∅. Then, we consider conjunctions of three conditional events and we show that to make prevision assignments by means of the Product t-norm, or the Minimum t-norm, is coherent. Finally, we examine the Lukasiewicz t-norm and we show by a counterexample that coherence is in general not assured. We give some conditions for coherence when the prevision assessments are made by using the Lukasiewicz t-norm.
2 Preliminary Notions and Results
In our approach, given two events A and H, with H=∅, the conditional event A∣H is looked at as a three-valued logical entity which is true, or false, or void, according to whether AH is true, or \widebarAH is true, or \widebarH is true. We observe that the conditional probability and/or conditional prevision values are assessed in the setting of coherence-based probabilistic approach.
In numerical terms A∣H assumes one of the values 1, or [math], or x, where x=P(A∣H) represents the assessed degree of belief on A∣H. Then, A∣H=AH+x\widebarH.
Given a family F={X1∣H1,…,Xn∣Hn}, for each i∈{1,…,n} we denote by {xi1,…,xiri} the set of possible values of Xi when Hi is true; then, for each i and j=1,…,ri, we set Aij=(Xi=xij).
We set C0=\widebarH1⋯\widebarHn (it may be C0=∅);
moreover, we denote by C1,…,Cm the constituents
contained in H1∨⋯∨Hn. Hence
⋀i=1n(Ai1∨⋯∨Airi∨\widebarHi)=⋁h=0mCh.
With each Ch,h∈{1,…,m}, we associate a vector
Qh=(qh1,…,qhn), where qhi=xij if Ch⊆Aij,j=1,…,ri, while qhi=μi if Ch⊆\widebarHi;
with C0 it is associated Q0=M=(μ1,…,μn).
Denoting by I the convex hull of Q1,…,Qm, the condition M∈I amounts to the existence of a vector (λ1,…,λm) such that:
∑h=1mλhQh=M,∑h=1mλh=1,λh≥0,∀h; in other words, M∈I is equivalent to the solvability of the system (Σ), associated with (F,M),
[TABLE]
Given the assessment M=(μ1,…,μn) on F={X1∣H1,…,Xn∣Hn}, let S be the set of solutions Λ=(λ1,…,λm) of system (Σ).
We point out that the solvability of system (Σ) is a necessary (but not sufficient) condition for coherence of M on F. When (Σ) is solvable, that is S=∅, we define:
[TABLE]
For what concerns the probabilistic meaning of I0, it holds that i∈I0 if and only if the (unique) coherent extension of M to Hi∣(⋁j=1nHj) is zero.
Then, the following theorem can be proved ([3, Theorem 3])
Theorem 2.1
[Operative characterization of coherence]
A conditional prevision assessment M=(μ1,…,μn) on
the family F={X1∣H1,…,Xn∣Hn} is coherent if
and only if the following conditions are satisfied:
(i) the system (Σ) defined in (1) is solvable; (ii) if I0=∅, then M0 is coherent. **
Coherence can be related to proper scoring rules ([4, 19, 30, 31, 32]).
Definition 1
Given any pair of conditional events A∣H and B∣K, with P(A∣H)=x and P(B∣K)=y, their conjunction
is the conditional random quantity (A∣H)∧(B∣K), with P[(A∣H)∧(B∣K)]=z, defined as
[TABLE]
In betting terms, the prevision z represents the amount you agree to pay, with the proviso that you will receive the quantity (A∣H)∧(B∣K).
Different approaches to compounded conditionals, not based on coherence, have been developed by other authors (see, e.g., [27, 33]).
We recall a result which shows that Fréchet-Hoeffding bounds still hold for the conjunction of conditional events ([23, Theorem 7]).
Theorem 2.2
Given any coherent assessment (x,y) on {A∣H,B∣K}, with A,H,B, K logically independent, H=∅,K=∅, the extension z=P[(A∣H)∧(B∣K)] is coherent if and only if the following Fréchet-Hoeffding bounds are satisfied:
[TABLE]
Remark 1
From Theorem 2.2, as the assessment (x,y) on {A∣H,B∣K} is coherent for every (x,y)∈[0,1]2, the set Π of coherent assessments (x,y,z) on {A∣H,B∣K,(A∣H)∧(B∣K)} is
[TABLE]
The set Π is the tetrahedron with vertices the points (1,1,1), (1,0,0), (0,1,0), (0,0,0). For other definition of conjunctions, where the conjunction is a conditional event, some results on lower and upper bounds have been given in [35].
Definition 2
Let be given n conditional events E1∣H1,…,En∣Hn.
For each subset S, with ∅=S⊆{1,…,n}, let xS be a prevision assessment on ⋀i∈S(Ei∣Hi).
The conjunction C1⋯n=(E1∣H1)∧⋯∧(En∣Hn) is defined as
[TABLE]
In particular, C1=E1∣H1;
moreover, for S={i1,…,ik}⊆{1,…,n}, the conjunction ⋀i∈S(Ei∣Hi) is denoted by Ci1⋯ik and xS is also denoted by xi1⋯ik.
Moreover, if S={i1,…,ik}⊆{1,…,n}, the conjunction ⋀i∈S(Ei∣Hi) is denoted by Ci1⋯ik and xS is also denoted by xi1⋯ik.
In the betting framework, you agree to pay x1⋯n=P(C1⋯n) with the proviso that you will receive: 1, if all conditional events are true; [math], if at least one of the conditional events is false; the prevision of the conjunction of that conditional events which are void, otherwise.
The operation of conjunction is associative and commutative.
We observe that, based on Definition 2, when n=3 we obtain
[TABLE]
We recall the following result ([24, Theorem 15]).
Theorem 2.3
Assume that the events E1,E2,E3,H1,H2,H3 are logically independent, with H1=∅,H2=∅,H3=∅.
Then, the set Π of all coherent assessments M=(x1,x2,x3,x12,x13,x23,x123) on
F={C1,C2,C3,C12,C13,C23,C123} is the set of points (x1,x2,x3,x12,x13,x23,x123)
which satisfy the following conditions
[TABLE]
Remark 2
As shown in (8), the coherence of (x1,x2,x3,x12,x13,x23,x123) amounts to the condition
[TABLE]
Then, in particular,
the extension x123 on C123 is coherent if and only if x123∈[x123′,x123′′], where
x123′=max{0,x12+x13−x1,x12+x23−x2,x13+x23−x3}, x123′′=min{x12,x13,x23,1−x1−x2−x3+x12+x13+x23}.
Then, by Theorem 2.3 it follows [24, Corollary 1]
Corollary 1
For any coherent assessment (x1,x2,x3,x12,x13,x23) on
{C1,C2,C3,C12,C13,C23}
the extension x123 on C123 is coherent if and only if x123∈[x123′,x123′′], where
[TABLE]
We recall that in case of logical dependencies, the set of all coherent assessments may be smaller than that one associated with the case of logical independence.
However (see [24, Theorem 16]) the set of coherent assessments is the same when H1=H2=H3=H (where possibly H=Ω; see also [26, p. 232]) and
a corollary similar to Corollary 1 also holds in this case. For a similar result based on copulas see [12].
3 Representation by Frank t-norms for (A∣H)∧(B∣K)
We recall that for every λ∈[0,+∞] the Frank t-norm Tλ:[0,1]2→[0,1] with parameter λ is defined as
[TABLE]
We recall that Tλ is continuous with respect to λ;
moreover, for every λ∈[0,+∞], it holds that TL(u,v)≤Tλ(u,v)≤TM(u,v), for every (u,v)∈[0,1]2 (see, e.g., [28],[29]). In the next result we study the relation between our notion of conjunction and t-norms.
Theorem 3.1
Let us consider the conjunction (A∣H)∧(B∣K), with A,B,H,K logically independent and with P(A∣H)=x, P(B∣K)=y.
Moreover, given any λ∈[0,+∞], let Tλ be the Frank t-norm with parameter λ. Then, the assessment
z=Tλ(x,y) on (A∣H)∧(B∣K) is a coherent extension of (x,y) on {A∣H,B∣K}; moreover (A∣H)∧(B∣K)=Tλ(A∣H,B∣K). Conversely, given any coherent extension z=P[(A∣H)∧(B∣K)] of (x,y), there exists λ∈[0,+∞] such that z=Tλ(x,y).
Proof
We observe that from Theorem 2.2,
for any given λ, the assessment z=Tλ(x,y) is a coherent extension of (x,y) on {A∣H,B∣K}. Moreover,
from (11) it holds that Tλ(1,1)=1, Tλ(u,0)=Tλ(0,v)=0, Tλ(u,1)=u, Tλ(1,v)=v. Hence,
[TABLE]
and, if we choose z=Tλ(x,y),
from (3) and (12) it follows that (A∣H)∧(B∣K)=Tλ(A∣H,B∣K).
Conversely, given any coherent extension z of (x,y), there exists λ such that z=Tλ(x,y). Indeed, if z=min{x,y}, then λ=0; if z=max{x+y−1,0}, then λ=+∞;
if max{x+y−1,0}<z<min{x,y}, then by continuity of Tλ with respect to λ
it holds that
z=Tλ(x,y)
for some λ∈]0,∞[ (for instance, if z=xy, then z=T1(x,y)) and hence (A∣H)∧(B∣K)=Tλ(A∣H,B∣K).
∎
Remark 3
As we can see from (3) and Theorem 3.1, in case of logically independent events, if the assessed values x,y,z are such that z=Tλ(x,y) for a given λ, then the conjunction (A∣H)∧(B∣K)=Tλ(A∣H,B∣K). For instance, if z=T1(x,y)=xy, then
(A∣H)∧(B∣K)=T1(A∣H,B∣K)=(A∣H)⋅(B∣K). Conversely, if (A∣H)∧(B∣K)=Tλ(A∣H,B∣K) for a given λ, then z=Tλ(x,y).
Then, the set Π given in (5) can be written as
Π={(x,y,z):(x,y)∈[0,1]2,z=Tλ(x,y),λ∈[0,+∞]}.
4 Conjunction of (A∣H) and (A∣K)
In this section we examine the conjunction of two conditional events in the particular case when A=B, that is (A∣H)∧(A∣K).
By setting P(A∣H)=x, P(A∣K)=y and P[(A∣H)∧(A∣K)]=z, it holds that
[TABLE]
Theorem 4.1
Let A,H,K be three logically independent events, with H=∅, K=∅. The set Π of all coherent assessments (x,y,z) on the family F={A∣H,A∣K,(A∣H)∧(A∣K)} is given by
[TABLE]
Proof
Let M=(x,y,z) be a prevision assessment on F.
The constituents associated with the pair (F,M) and contained in H∨K are:
C1=AHK, C2=\widebarAHK, C3=\widebarA\widebarHK, C4=\widebarAH\widebarK,
C5=A\widebarHK, C6=AH\widebarK.
The associated points Qh’s are Q1=(1,1,1),Q2=(0,0,0),Q3=(x,0,0),Q4=(0,y,0),Q5=(x,1,x),Q6=(1,y,y). With the further constituent C0=\widebarH\widebarK it is associated the point Q0=M=(x,y,z). Considering the convex hull I (see Figure 1) of Q1,…,Q6, a necessary condition for the coherence of the prevision assessment M=(x,y,z) on F is that M∈I, that is the following system must be solvable
[TABLE]
First of all, we observe that solvability of (Σ) requires that z≤x and z≤y, that is z≤min{x,y}. We now verify that (x,y,z), with (x,y)∈[0,1]2 and z=min{x,y}, is coherent. We distinguish two cases: (i) x≤y and (ii) x>y.
Case (i).
In this case z=min{x,y}=x. If y=0
the system (Σ) becomes
[TABLE]
which is clearly solvable. In particular there exist solutions with λ2>0,λ3>0,λ4>0, by
Theorem 2.1,
as the set I0 is empty the solvability of (Σ) is sufficient for coherence of the assessment (0,0,0).
If y>0 the system (Σ) is solvable and a solution is Λ=(λ1,…,λ6)=(x,yx(1−y),0,yy−x,0,0).
We observe that, if x>0, then λ1>0 and I0=∅ because C1=HK⊆H∨K, so that M=(x,y,x) is coherent. If x=0 (and hence z=0), then λ4=1 and I0⊆{2}. Then, as the sub-assessment P(A∣K)=y is coherent, it follows that the assessment M=(0,y,0) is coherent too.
Case (ii). The system is solvable and a solution is Λ=(λ1,…,λ6)=(y,xy(1−x),xx−y,0,0,0).
We observe that, if y>0, then λ1>0 and I0=∅ because C1=HK⊆H∨K, so that M=(x,y,y) is coherent. If y=0 (and hence z=0), then λ3=1 and I0⊆{1}. Then, as the sub-assessment P(A∣H)=x is coherent, it follows that the assessment M=(x,0,0) is coherent too.
Thus, for every (x,y)∈[0,1]2, the assessment (x,y,min{x,y}) is coherent and, as z≤min{x,y}, the upper bound on z is min{x,y}=TM(x,y).
We now verify that (x,y,xy), with (x,y)∈[0,1]2 is coherent; moreover we will show that (x,y,z), with z<xy, is not coherent, in other words the lower bound for z is xy.
First of all, we observe that M=(1−x)Q4+xQ6, so that a solution of (Σ) is Λ1=(0,0,0,1−x,0,x).
Moreover, M=(1−y)Q3+yQ5, so that another solution is Λ2=(0,0,1−y,0,y,0). Then
Λ=2Λ1+Λ2=(0,0,21−y,21−x,2y,2x)
is a solution of (Σ) such that I0=∅. Thus the assessment (x,y,xy) is coherent for every (x,y)∈[0,1]2.
In order to verify that xy is the lower bound on z we observe that the points Q3,Q4,Q5,Q6 belong to a plane π of equation:
yX+xY−Z=xy, where X,Y,Z are the axis’ coordinates. Now, by considering the function f(X,Y,Z)=yX+xY−Z, we observe that for each constant k the equation f(X,Y,Z)=k represents a plane which is parallel to π and coincides with π when k=xy. We also observe that
f(Q1)=f(1,1,1)=x+y−1=TL(x,y)≤xy=TP(x,y),
f(Q2)=f(0,0,0)=0≤xy=TP(x,y), and
f(Q3)=f(Q4)=f(Q5)=f(Q6)=xy=TP(x,y).
Then, for every P=∑h=16λhQh, with λh≥0 and ∑h=16λh=1, that is P∈I, it holds that
f(\mathcal{P})=f\big{(}\sum_{h=1}^{6}\lambda_{h}Q_{h}\big{)}=\sum_{h=1}^{6}\lambda_{h}f(Q_{h})\leq xy.
On the other hand, given any a>0, by considering P=(x,y,xy−a) it holds that
f(P)=f(x,y,xy−a)=xy+xy−xy+a=xy+a>xy.
Therefore, for any given a>0 the assessment (x,y,xy−a) is not coherent because (x,y,xy−a)∈/I. Then, the lower bound on z is xy=TP(x,y). Finally, the set of all coherent assessments (x,y,z) on F is the set Π in
(13).
∎
Based on Theorem 4.1, we can give an analogous version for the Theorem 3.1 (when A=B).
Theorem 4.2
Let us consider the conjunction (A∣H)∧(A∣K), with A,H,K logically independent and with P(A∣H)=x, P(A∣K)=y.
Moreover, given any λ∈[0,1], let Tλ be the Frank t-norm with parameter λ. Then, the assessment
z=Tλ(x,y) on (A∣H)∧(A∣K) is a coherent extension of (x,y) on {A∣H,A∣K}; moreover (A∣H)∧(A∣K)=Tλ(A∣H,A∣K). Conversely, given any coherent extension z=P[(A∣H)∧(A∣K)] of (x,y), there exists λ∈[0,1] such that z=Tλ(x,y).
The next result follows from Theorem 4.1 when H, K are incompatible.
Theorem 4.3
Let A,H,K be three events, with A logically independent from both H and K, with H=∅, K=∅, HK=∅. The set Π of all coherent assessments (x,y,z) on the family F={A∣H,A∣K,(A∣H)∧(A∣K)} is given by Π={(x,y,z):(x,y)∈[0,1]2,z=xy=TP(x,y)}.
Proof
We observe that
[TABLE]
Moreover, as HK=∅,
the points Qh’s are (x,0,0),(0,y,0),(x,1,x),(1,y,y), which coincide with the points Q3,…,Q6 of the case HK=∅. Then, as shown in the proof of Theorem 4.1, the condition M=(x,y,z) belongs to the convex hull of (x,0,0),(0,y,0),(x,1,x),(1,y,y) amounts to the condition z=xy.
∎
Remark 4
From Theorem 4.3, when HK=∅ it holds that
(A∣H)∧(A∣K)=(A∣H)⋅(A∣K)=TP(A∣H,A∣K),
where x=P(A∣H) and y=P(A∣K).
5 Further Results on Frank t-norms
In this section we give some results which concern Frank t-norms and the family
F={C1,C2,C3,C12,C13,C23,C123}. We recall that, given any t-norm T(x1,x2) it holds that T(x1,x2,x3)=T(T(x1,x2),x3).
5.1 On the Product t-norm
Theorem 5.1
Assume that the events E1,E2,E3,H1,H2,H3 are logically independent, with H1=∅,H2=∅,H3=∅.
If the assessment M=(x1,x2,x3,x12,x13,x23,x123) on
F={C1,C2,C3,C12,C13,C23,C123} is such that (x1,x2,x3)∈[0,1]3, xij=T1(xi,xj)=xixj, i=j, and x123=T1(x1,x2,x3)=x1x2x3, then
M is coherent. Moreover, Cij=T1(Ci,Cj)=CiCj, i=j, and C123=T1(C1,C2,C3)=C1C2C3.
Proof
From Remark 2, the coherence of M amounts to the inequalities in (9).
As xij=T1(xi,xj)=xixj, i=j, and x123=T1(x1,x2,x3)=x1x2x3,
the inequalities (9) become
[TABLE]
Thus, by recalling that xi+xj−1≤xixj, the inequalities are satisfied and hence M is coherent. Moreover, from (3) and (7) it follows that
Cij=T1(Ci,Cj)=CiCj, i=j, and C123=T1(C1,C2,C3)=C1C2C3.∎
5.2 On the Minimum t-norm
Theorem 5.2
Assume that the events E1,E2,E3,H1,H2,H3 are logically independent, with H1=∅,H2=∅,H3=∅.
If the assessment M=(x1,x2,x3,x12,x13,x23,x123) on
F={C1,C2,C3,C12,C13,C23,C123} is such that (x1,x2,x3)∈[0,1]3, xij=TM(xi,xj)=min{xi,xj}, i=j, and x123=TM(x1,x2,x3)=min{x1,x2,x3}, then
M is coherent. Moreover, Cij=TM(Ci,Cj)=min{Ci,Cj}, i=j, and C123=TM(C1,C2,C3)=min{C1,C2,C3}.
Proof
From Remark 2, the coherence of M amounts to the inequalities in (9).
Without loss of generality, we assume that x1≤x2≤x3. Then
x12=TM(x1,x2)=x1,
x13=TM(x1,x3)=x1,
x23=TM(x2,x3)=x2, and x123=TM(x1,x2,x3)=x1.
The inequalities (9) become
[TABLE]
Thus, the inequalities are satisfied and hence M is coherent. Moreover, from (3) and (7) it follows that
Cij=TM(Ci,Cj)=min{Ci,Cj}, i=j, and C123=TM(C1,C2,C3)=min{C1,C2,C3}.
∎
Remark 5
As we can see from
(\refEQ:MIN) and Corollary 1, the assessment x123=min{x1,x2,x3} is the unique coherent extension on C123 of the assessment (x1,x2,x3,min{x1,x2},min{x1,x3},min{x2,x3}) on
{C1,C2,C3,C12,C13,C23}.
We also notice that, if C1≤C2≤C3, then C12=C1, C13=C1, C23=C2, and C123=C1. Moreover, x12=x1,
x13=x1,
x23=x2, and x123=x1.
5.3 On Lukasiewicz t-norm
We observe that in general the results of Theorems 5.1 and 5.2 do not hold for the Lukasiewicz t-norm (and hence for any given Frank t-norm), as shown in the example below. We recall that TL(x1,x2,x3)=max{x1+x2+x3−2,0}.
Example 1
The assessment
(x1,x2,x3,TL(x1,x2),TL(x1,x3),TL(x2,x3), TL(x1,x2,x3))
on the family F={C1,C2,C3,C12,C13,C23,C123}, with (x1,x2,x3)=(0.5,0.6,0.7) is not coherent.
Indeed, by observing that TL(x1,x2)=0.1
TL(x1,x3)=0.2, TL(x2,x3)=0.3, and TL(x1,x2,x3)=0, formula (9) becomes
max{0,0.1+0.2−0.5,0.1+0.3−0.6,0.2+0.3−0.7}≤0≤min{0.1,0.2,0.3,1−0.5−0.6−0.7+0.1+0.2+0.3},
that is:
max{0,−0.2}≤0≤min{0.1,0.2,0.3,−0.2};
thus the inequalities are not satisfied and the assessment is not coherent.
More in general we have
Theorem 5.3
The assessment
(x1,x2,x3,TL(x1,x2),TL(x1,x3),TL(x2,x3))
on the family F={C1,C2,C3,C12,C13,C23}, with
TL(x1,x2)>0, TL(x1,x3)>0, TL(x2,x3)>0 is coherent if and only if
x1+x2+x3−2≥0. Moreover, when x1+x2+x3−2≥0 the unique coherent extension x123 on C123 is x123=TL(x1,x2,x3).
Proof
We distinguish two cases: (i) x1+x2+x3−2<0; (ii) x1+x2+x3−2≥0.
Case (i).
From (8) the inequality
1−x1−x2−x3+x12+x13+x23≥0
is not satisfied because
1−x1−x2−x3+x12+x13+x23=x1+x2+x3−2<0.
Therefore the assessment is not coherent.
Case (ii).
We set x123=TL(x1,x2,x3)=x1+x2+x3−2.
Then, by observing that 0<xi+xj−1≤x1+x2+x3−2, i=j, formula (9) becomes
max{0,x1+x2+x3−2}≤x1+x2+x3−2≤min{x1+x2−1,x1+x3−1,x2+x3−1,x1+x2+x3−2},
that is:
x1+x2+x3−2≤x1+x2+x3−2≤x1+x2+x3−2.
Thus, the inequalities are satisfied and the
assessment
(x1,x2,x3,TL(x1,x2),TL(x1,x3),TL(x2,x3),TL(x1,x2,x3)) on {C1,C2,C3,C12,C13,C23,C123}
is coherent and the sub-assessment
(x1,x2,x3,TL(x1,x2),TL(x1,x3),TL(x2,x3)) on
F is coherent too.
∎
A result related with Theorem 5.3 is given below.
Theorem 5.4
If the assessment
(x1,x2,x3,TL(x1,x2),TL(x1,x3),TL(x2,x3), TL(x1,x2,x3))
on the family F={C1,C2,C3,C12,C13,C23,C123}, is such that TL(x1,x2,x3)>0, then the assessment is coherent.
Proof
We observe that TL(x1,x2,x3)=x1+x2+x3−2>0; then
xi>0, i=1,2,3, and 0<xi+xj−1≤x1+x2+x3−2, i=j.
Then formula (9)) becomes:
max{0,x1+x2+x3−2}≤x1+x2+x3−2≤≤min{x1+x2−1,x1+x3−1,x2+x3−1,x1+x2+x3−2},
that is:
x1+x2+x3−2≤x1+x2+x3−2≤x1+x2+x3−2.
Thus, the inequalities are satisfied and the assessment is coherent.
∎
6 Conclusions
We have studied the relationship between the notions of conjunction and of Frank t-norms.
We have shown that, under logical independence of events and coherence of prevision assessments, for a suitable λ∈[0,+∞] it holds that P((A∣H)∧(B∣K))=Tλ(x,y) and (A∣H)∧(B∣K)=Tλ(A∣H,B∣K). Then, we have considered the case A=B, by determining the set of all coherent assessment (x,y,z) on (A∣H,B∣K,(A∣H)∧(A∣K)).
We have shown that, under coherence, for a suitable λ∈[0,1] it holds that
(A∣H)∧(A∣K)=Tλ(A∣H,A∣K).
We have also studied the particular case where A=B and HK=∅. Then, we have considered the conjunction of three conditional events and we have shown that the prevision assessments produced by the Product t-norm, or the Minimum t-norm, are coherent. Finally, we have examined the
Lukasiewicz t-norm and we have shown, by a counterexample, that coherence in general is not assured.
We have given some conditions for coherence when the prevision assessments are based on the Lukasiewicz t-norm. Future work should concern the deepening and generalization of the results of this paper.
Acknowledgments. We thank three anonymous referees for their useful comments.