SLIDE 1 Homogeneous orthocomplete effect algebras are covered by MV-algebras
Josef Niederle and Jan Paseka
Department of Mathematics and Statistics Masaryk University Brno, Czech Republic niederle,paseka@math.muni.cz Supported by
TACL 2011 July 26-30 Marseille, France
SLIDE 2 Outline
1
Introduction
2
Basic definitions
3
The condition (W+)
4
Main theorem and its generalizations
SLIDE 3 Outline
1
Introduction
2
Basic definitions
3
The condition (W+)
4
Main theorem and its generalizations
SLIDE 4 Introduction Joint work of J. Niederle and J. Paseka Special types of effect algebras E called homogeneous were introduced by G. Jenˇ ca. The aim of our paper is to show that every block of an Archimedean homogeneous effect algebra satisfying the property (W+) is lattice
- rdered. Therefore, any Archimedean homogeneous effect algebra
satisfying the property (W+) is covered by MV-algebras. As a corollary, this yields that every block of a homogeneous
- rthocomplete effect algebra is a Heyting effect algebra.
SLIDE 5 Introduction Joint work of J. Niederle and J. Paseka Special types of effect algebras E called homogeneous were introduced by G. Jenˇ ca. The aim of our paper is to show that every block of an Archimedean homogeneous effect algebra satisfying the property (W+) is lattice
- rdered. Therefore, any Archimedean homogeneous effect algebra
satisfying the property (W+) is covered by MV-algebras. As a corollary, this yields that every block of a homogeneous
- rthocomplete effect algebra is a Heyting effect algebra.
SLIDE 6 Introduction Joint work of J. Niederle and J. Paseka Special types of effect algebras E called homogeneous were introduced by G. Jenˇ ca. The aim of our paper is to show that every block of an Archimedean homogeneous effect algebra satisfying the property (W+) is lattice
- rdered. Therefore, any Archimedean homogeneous effect algebra
satisfying the property (W+) is covered by MV-algebras. As a corollary, this yields that every block of a homogeneous
- rthocomplete effect algebra is a Heyting effect algebra.
SLIDE 7 Introduction Joint work of J. Niederle and J. Paseka Special types of effect algebras E called homogeneous were introduced by G. Jenˇ ca. The aim of our paper is to show that every block of an Archimedean homogeneous effect algebra satisfying the property (W+) is lattice
- rdered. Therefore, any Archimedean homogeneous effect algebra
satisfying the property (W+) is covered by MV-algebras. As a corollary, this yields that every block of a homogeneous
- rthocomplete effect algebra is a Heyting effect algebra.
SLIDE 8
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 9
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 10
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 11
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 12
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 13
Forerunners of our work Anatolij Dvureˇ censkij Gejza Jenˇ ca Mirko Navara Sylvia Pulmannov´ a Zdenka Rieˇ canov´ a Josef Tkadlec
SLIDE 14 Outline
1
Introduction
2
Basic definitions
3
The condition (W+)
4
Main theorem and its generalizations
SLIDE 15 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 16 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 17 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 18 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 19 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 20 Basic definition – effect algebras Definition (D. Foulis and M.K. Bennett, 1994) A partial algebra (E;⊕,0,1) is called an effect algebra if 0, 1 are two distinct elements and ⊕ is a partially defined binary operation on E which satisfy the following conditions for any x,y,z ∈ E: (Ei) x⊕y = y⊕x if x⊕y is defined, (Eii) (x⊕y)⊕z = x⊕(y⊕z) if one side is defined, (Eiii) for every x ∈ E there exists a unique y ∈ E such that x⊕y = 1 (we put x′ = y), (Eiv) if 1⊕x is defined then x = 0. Example Let E = [0,1] ⊆ R. We put x⊕y = x+y iff x+y ≤ 1. Hence 3
4 ⊕ 4 5 does
not exist in E.
SLIDE 21 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 22 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 23 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 24 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 25 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 26 Basic definitions – effect algebras A subset Q ⊆ E is called a sub-effect algebra of E if (i) 1 ∈ Q (ii) if out of elements x,y,z ∈ E with x⊕y = z two are in Q, then x,y,z ∈ Q. An effect algebra Eis called an orthoalgebra if x⊕x exists implies that x = 0 . On every effect algebra E the partial order ≤ and a partial binary
- peration ⊖ can be introduced as follows:
x ≤ y and y⊖x = z iff x⊕z is defined and x⊕z = y . If E with the defined partial order is a (complete) lattice then (E;⊕,0,1) is called a (complete) lattice effect algebra.
SLIDE 27
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 28
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 29
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 30
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 31
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 32
Basic definitions – effect algebras An effect algebra E satisfies the Riesz decomposition property (or RDP) if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2, there are u1,u2 such that u1 ≤ v1,u2 ≤ v2 and u = u1 ⊕u2. (i) Every lattice effect algebra with RDP can be organized into an MV-algebra and conversely. (ii) Every MV-algebra which is an orthoalgebra is a Boolean algebra. An effect algebra E is called homogeneous if, for all u,v1,v2 ∈ E such that u ≤ v1 ⊕v2 ≤ u′, there are u1,u2 such that u1 ≤ v1, u2 ≤ v2 and u = u1 ⊕u2. A subset B of E is called a block of E if B is a maximal sub-effect algebra of E with the Riesz decomposition property.
SLIDE 33 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 34 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 35 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 36 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 37 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 38 Basic definitions – Effect algebras (i) Every orthoalgebra is homogeneous. (ii) Every lattice effect algebra is homogeneous. (ii) Every effect algebra with the Riesz decomposition property is homogeneous. An element w of an effect algebra E is called sharp if w∧w′ = 0. The well known fact is that in every lattice effect algebra E the subset S(E) = {w ∈ E | w∧w′ = 0} is a sub-lattice effect algebra of E being an
SLIDE 39
Blocks of E and S(E) - Example 1 - The diamond S(E) = {0,1} is a Boolean algebra, but E has two blocks, {0,a,1} and {0,b,1}. For any block B of E, S(E)∩B = {0,1} is a block of S(E).
SLIDE 40
Blocks of E and S(E) - Example 1 - The diamond S(E) = {0,1} is a Boolean algebra, but E has two blocks, {0,a,1} and {0,b,1}. For any block B of E, S(E)∩B = {0,1} is a block of S(E).
SLIDE 41 Blocks of E and S(E) - Example 2 S(E) = {0,a,b,1} is a Boolean algebra and E has again two
- blocks. Namely, there are two
blocks here, the Boolean algebra S(E) and a 3-element chain C3 = {0,c,1}. S(E)∩C3 = {0,1} is not a block of S(E).
SLIDE 42 Blocks of E and S(E) - Example 2 S(E) = {0,a,b,1} is a Boolean algebra and E has again two
- blocks. Namely, there are two
blocks here, the Boolean algebra S(E) and a 3-element chain C3 = {0,c,1}. S(E)∩C3 = {0,1} is not a block of S(E).
SLIDE 43
Meager and hypermeager elements In what follows set M(E) = {x ∈ E | if v ∈ S(E) satisfies v ≤ x then v = 0}. We also define HM(E) = {x ∈ E | there is y ∈ E such that x ≤ y and x ≤ y′} and UM(E) = {x ∈ E | for every y ∈ S(E) such that x ≤ y it holds x ≤ y⊖x}. An element x ∈ M(E) is called meager, an element x ∈ HM(E) is called hypermeager and an element x ∈ UM(E) is called ultrameager.
SLIDE 44
Meager and hypermeager elements In what follows set M(E) = {x ∈ E | if v ∈ S(E) satisfies v ≤ x then v = 0}. We also define HM(E) = {x ∈ E | there is y ∈ E such that x ≤ y and x ≤ y′} and UM(E) = {x ∈ E | for every y ∈ S(E) such that x ≤ y it holds x ≤ y⊖x}. An element x ∈ M(E) is called meager, an element x ∈ HM(E) is called hypermeager and an element x ∈ UM(E) is called ultrameager.
SLIDE 45
Meager and hypermeager elements In what follows set M(E) = {x ∈ E | if v ∈ S(E) satisfies v ≤ x then v = 0}. We also define HM(E) = {x ∈ E | there is y ∈ E such that x ≤ y and x ≤ y′} and UM(E) = {x ∈ E | for every y ∈ S(E) such that x ≤ y it holds x ≤ y⊖x}. An element x ∈ M(E) is called meager, an element x ∈ HM(E) is called hypermeager and an element x ∈ UM(E) is called ultrameager.
SLIDE 46
Meager and hypermeager elements - Example 3
SLIDE 47
Meager and hypermeager elements - Example 4
SLIDE 48
Meager and hypermeager elements Lemma Let E be an effect algebra. Then UM(E) ⊆ HM(E) ⊆ M(E). Moreover, for all x ∈ E, x ∈ HM(E) iff x⊕x exists and, for all y ∈ M(E), y = 0 there is h ∈ HM(E), h = 0 such that h ≤ y. Lemma In every homogeneous effect algebra E, UM(E) = HM(E). For an element x of an effect algebra E we write ord(x) = ∞ if nx = x⊕x⊕···⊕x (n-times) exists for every positive integer n and we write ord(x) = nx if nx is the greatest positive integer such that nxx exists in E. An effect algebra E is Archimedean if ord(x) < ∞ for all x ∈ E, x = 0.
SLIDE 49
Meager and hypermeager elements Lemma Let E be an effect algebra. Then UM(E) ⊆ HM(E) ⊆ M(E). Moreover, for all x ∈ E, x ∈ HM(E) iff x⊕x exists and, for all y ∈ M(E), y = 0 there is h ∈ HM(E), h = 0 such that h ≤ y. Lemma In every homogeneous effect algebra E, UM(E) = HM(E). For an element x of an effect algebra E we write ord(x) = ∞ if nx = x⊕x⊕···⊕x (n-times) exists for every positive integer n and we write ord(x) = nx if nx is the greatest positive integer such that nxx exists in E. An effect algebra E is Archimedean if ord(x) < ∞ for all x ∈ E, x = 0.
SLIDE 50
Meager and hypermeager elements Lemma Let E be an effect algebra. Then UM(E) ⊆ HM(E) ⊆ M(E). Moreover, for all x ∈ E, x ∈ HM(E) iff x⊕x exists and, for all y ∈ M(E), y = 0 there is h ∈ HM(E), h = 0 such that h ≤ y. Lemma In every homogeneous effect algebra E, UM(E) = HM(E). For an element x of an effect algebra E we write ord(x) = ∞ if nx = x⊕x⊕···⊕x (n-times) exists for every positive integer n and we write ord(x) = nx if nx is the greatest positive integer such that nxx exists in E. An effect algebra E is Archimedean if ord(x) < ∞ for all x ∈ E, x = 0.
SLIDE 51 Orthogonal systems We say that a finite system F = (xk)n
k=1 of not necessarily different
elements of an effect algebra E is orthogonal if x1 ⊕x2 ⊕···⊕xn (written
n
xk or F) exists in E. An arbitrary system G = (xκ)κ∈H of not necessarily different elements
- f E is called orthogonal if K exists for every finite K ⊆ G.
We say that for a orthogonal system G = (xκ)κ∈H the element G exists iff {K | K ⊆ G is finite} exists in E and then we put
G = {K | K ⊆ G is finite}. We say that G is the orthogonal sum
- f G and G is orthosummable. (Here we write G1 ⊆ G iff there is H1 ⊆ H
such that G1 = (xκ)κ∈H1). We denote G⊕ := {K | K ⊆ G is finite}. E is called orthocomplete if every orthogonal system is
SLIDE 52 Orthogonal systems We say that a finite system F = (xk)n
k=1 of not necessarily different
elements of an effect algebra E is orthogonal if x1 ⊕x2 ⊕···⊕xn (written
n
xk or F) exists in E. An arbitrary system G = (xκ)κ∈H of not necessarily different elements
- f E is called orthogonal if K exists for every finite K ⊆ G.
We say that for a orthogonal system G = (xκ)κ∈H the element G exists iff {K | K ⊆ G is finite} exists in E and then we put
G = {K | K ⊆ G is finite}. We say that G is the orthogonal sum
- f G and G is orthosummable. (Here we write G1 ⊆ G iff there is H1 ⊆ H
such that G1 = (xκ)κ∈H1). We denote G⊕ := {K | K ⊆ G is finite}. E is called orthocomplete if every orthogonal system is
SLIDE 53 Orthogonal systems We say that a finite system F = (xk)n
k=1 of not necessarily different
elements of an effect algebra E is orthogonal if x1 ⊕x2 ⊕···⊕xn (written
n
xk or F) exists in E. An arbitrary system G = (xκ)κ∈H of not necessarily different elements
- f E is called orthogonal if K exists for every finite K ⊆ G.
We say that for a orthogonal system G = (xκ)κ∈H the element G exists iff {K | K ⊆ G is finite} exists in E and then we put
G = {K | K ⊆ G is finite}. We say that G is the orthogonal sum
- f G and G is orthosummable. (Here we write G1 ⊆ G iff there is H1 ⊆ H
such that G1 = (xκ)κ∈H1). We denote G⊕ := {K | K ⊆ G is finite}. E is called orthocomplete if every orthogonal system is
SLIDE 54 Orthogonal systems We say that a finite system F = (xk)n
k=1 of not necessarily different
elements of an effect algebra E is orthogonal if x1 ⊕x2 ⊕···⊕xn (written
n
xk or F) exists in E. An arbitrary system G = (xκ)κ∈H of not necessarily different elements
- f E is called orthogonal if K exists for every finite K ⊆ G.
We say that for a orthogonal system G = (xκ)κ∈H the element G exists iff {K | K ⊆ G is finite} exists in E and then we put
G = {K | K ⊆ G is finite}. We say that G is the orthogonal sum
- f G and G is orthosummable. (Here we write G1 ⊆ G iff there is H1 ⊆ H
such that G1 = (xκ)κ∈H1). We denote G⊕ := {K | K ⊆ G is finite}. E is called orthocomplete if every orthogonal system is
SLIDE 55 Outline
1
Introduction
2
Basic definitions
3
The condition (W+)
4
Main theorem and its generalizations
SLIDE 56
The condition (W+) An effect algebra E fulfills the condition (W+) (introduced by Tkadlec) if for each orthogonal subset A ⊆ E and each two upper bounds u,v of A⊕ there exists an upper bound w of A⊕ below u,v. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the condition (W+). Every orthocomplete effect algebra is Archimedean. Proposition Let E be an Archimedean effect algebra fulfilling the condition (W+). Then every meager element of E is the orthosum of a system of hypermeager elements.
SLIDE 57
The condition (W+) An effect algebra E fulfills the condition (W+) (introduced by Tkadlec) if for each orthogonal subset A ⊆ E and each two upper bounds u,v of A⊕ there exists an upper bound w of A⊕ below u,v. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the condition (W+). Every orthocomplete effect algebra is Archimedean. Proposition Let E be an Archimedean effect algebra fulfilling the condition (W+). Then every meager element of E is the orthosum of a system of hypermeager elements.
SLIDE 58
The condition (W+) An effect algebra E fulfills the condition (W+) (introduced by Tkadlec) if for each orthogonal subset A ⊆ E and each two upper bounds u,v of A⊕ there exists an upper bound w of A⊕ below u,v. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the condition (W+). Every orthocomplete effect algebra is Archimedean. Proposition Let E be an Archimedean effect algebra fulfilling the condition (W+). Then every meager element of E is the orthosum of a system of hypermeager elements.
SLIDE 59
The condition (W+) An effect algebra E fulfills the condition (W+) (introduced by Tkadlec) if for each orthogonal subset A ⊆ E and each two upper bounds u,v of A⊕ there exists an upper bound w of A⊕ below u,v. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the condition (W+). Every orthocomplete effect algebra is Archimedean. Proposition Let E be an Archimedean effect algebra fulfilling the condition (W+). Then every meager element of E is the orthosum of a system of hypermeager elements.
SLIDE 60
Shifting lemma Lemma (Shifting lemma) Let E be an Archimedean effect algebra fulfilling the condition (W+), let u,v ∈ E, and let a1,b1 be two maximal lower bounds of u,v. There exist elements y,z and two maximal lower bounds a,b of y,z for which y ≤ u, z ≤ v, a ≤ a1, b ≤ b1, a∧b = 0, a,b are maximal lower bounds of y,z and y,z are minimal upper bounds of a,b. Furthemore, (y⊖a)∧(z⊖a) = 0, (y⊖b)∧(z⊖b) = 0, (y⊖a)∧(y⊖b) = 0, (z⊖a)∧(z⊖b) = 0. The Shifting lemma provides the following minimax structure.
SLIDE 61
Meets in Archimedean homogeneous effect algebra fulfilling the condition (W+) Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). Every two hypermeager elements u,v possess u∧v. Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every orthogonal elements u,v, u∧v and u∨[0,u⊕v] v exist and [0,u∧v] ⊆ B for every block B containing u or v. Corollary Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every element u, u∧u′ and u∨u′ exist and [0,u∧u′] ⊆ B for every block B containing u.
SLIDE 62
Meets in Archimedean homogeneous effect algebra fulfilling the condition (W+) Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). Every two hypermeager elements u,v possess u∧v. Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every orthogonal elements u,v, u∧v and u∨[0,u⊕v] v exist and [0,u∧v] ⊆ B for every block B containing u or v. Corollary Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every element u, u∧u′ and u∨u′ exist and [0,u∧u′] ⊆ B for every block B containing u.
SLIDE 63
Meets in Archimedean homogeneous effect algebra fulfilling the condition (W+) Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). Every two hypermeager elements u,v possess u∧v. Proposition Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every orthogonal elements u,v, u∧v and u∨[0,u⊕v] v exist and [0,u∧v] ⊆ B for every block B containing u or v. Corollary Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). For every element u, u∧u′ and u∨u′ exist and [0,u∧u′] ⊆ B for every block B containing u.
SLIDE 64 Outline
1
Introduction
2
Basic definitions
3
The condition (W+)
4
Main theorem and its generalizations
SLIDE 65
Main theorem Theorem Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). Then every block in E is a lattice and E can be covered by MV-algebras. Corollary Let E be an orthocomplete homogeneous effect algebra. Then E can be covered by Heyting MV-effect algebras.
SLIDE 66
Main theorem Theorem Let E be an Archimedean homogeneous effect algebra fulfilling the condition (W+). Then every block in E is a lattice and E can be covered by MV-algebras. Corollary Let E be an orthocomplete homogeneous effect algebra. Then E can be covered by Heyting MV-effect algebras.
SLIDE 67
Generalization of the Main theorem Definition An effect algebra E has the maximality property if {u,v} has a maximal lower bound w for every u,v ∈ E. It is easy to see that an effect algebra E has the maximality property if and only if {u,v} has a maximal lower bound w, w ≥ t for every u,v,t ∈ E such that t is a lower bound of {u,v}. As noted by Tkadlec E has the maximality property if and only if {u,v} has a minimal upper bound w for every u,v ∈ E. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the maximality property.
SLIDE 68
Generalization of the Main theorem Definition An effect algebra E has the maximality property if {u,v} has a maximal lower bound w for every u,v ∈ E. It is easy to see that an effect algebra E has the maximality property if and only if {u,v} has a maximal lower bound w, w ≥ t for every u,v,t ∈ E such that t is a lower bound of {u,v}. As noted by Tkadlec E has the maximality property if and only if {u,v} has a minimal upper bound w for every u,v ∈ E. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the maximality property.
SLIDE 69
Generalization of the Main theorem Definition An effect algebra E has the maximality property if {u,v} has a maximal lower bound w for every u,v ∈ E. It is easy to see that an effect algebra E has the maximality property if and only if {u,v} has a maximal lower bound w, w ≥ t for every u,v,t ∈ E such that t is a lower bound of {u,v}. As noted by Tkadlec E has the maximality property if and only if {u,v} has a minimal upper bound w for every u,v ∈ E. Statement (Tkadlec 2010) Lattice effect algebras and orthocomplete effect algebras fulfill the maximality property.
SLIDE 70 Generalization of the Main theorem Statement (Tkadlec 2010) Let E be an Archimedean effect algebra fulfilling the condition (W+), and let y,z ∈ E. Every lower bound of y,z is below a maximal one and every upper bound of y,z is above a minimal one. Then E has the maximality property. Theorem Let E be a homogeneous effect algebra having the maximality
- property. Then every block B in E is a lattice and E can be covered by
MV-algebras. Corollary (Rieˇ canov´ a 2000) Let E be a lattice effect algebra. Then E can be covered by MV-algebras which are blocks of E.
SLIDE 71 Generalization of the Main theorem Statement (Tkadlec 2010) Let E be an Archimedean effect algebra fulfilling the condition (W+), and let y,z ∈ E. Every lower bound of y,z is below a maximal one and every upper bound of y,z is above a minimal one. Then E has the maximality property. Theorem Let E be a homogeneous effect algebra having the maximality
- property. Then every block B in E is a lattice and E can be covered by
MV-algebras. Corollary (Rieˇ canov´ a 2000) Let E be a lattice effect algebra. Then E can be covered by MV-algebras which are blocks of E.
SLIDE 72 Generalization of the Main theorem Statement (Tkadlec 2010) Let E be an Archimedean effect algebra fulfilling the condition (W+), and let y,z ∈ E. Every lower bound of y,z is below a maximal one and every upper bound of y,z is above a minimal one. Then E has the maximality property. Theorem Let E be a homogeneous effect algebra having the maximality
- property. Then every block B in E is a lattice and E can be covered by
MV-algebras. Corollary (Rieˇ canov´ a 2000) Let E be a lattice effect algebra. Then E can be covered by MV-algebras which are blocks of E.
SLIDE 73
Example 5 - orthoalgebra E a and b have two different minimal upper bounds, a⊕b = f ′ and a⊕c = e′.
SLIDE 74 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 75 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 76 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 77 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 78 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 79 References
censkij, S. Pulmannov´ a: New Trends in Quantum Structures, Kluwer Acad. Publ., Dordrecht/Ister Science, Bratislava 2000.
ca: Blocks of homogeneous effect algebras, Bulletin of the Australian Mathematical Society 64 (2001), 81–98.
ca: Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras, Order 27 (2010), 41–61.
- J. Niederle, J. Paseka: Homogeneous orthocomplete effect
algebras are covered by MV-algebras, preprint 2011.
canov´ a: Generalization of blocks for D-lattices and lattice-ordered effect algebras, Inter. J. Theor. Phys. 39 (2000), 231–237.
- J. Tkadlec: Common generalizations of orthocomplete and lattice
effect algebras, Inter. J. Theor. Phys., 49 (2010), 3279–3285.
SLIDE 80
Thank you for your attention.