Lattice

and
Boolean Algebra
Lattice and Boolean Algebra
Slide 2
Algebra
An algebraic system is defined by the tuple
(A,o
1
, , o
k
; R
1
, , R
m
; c
1
, c
k
), where, A is
a non-empty set, o
i
is a function A
p
i
A, p
i
is
a positive integer, R
j
is a relation on A, and c
i

is an element of A.
Lattice and Boolean Algebra
Slide 3
Lattice
The lattice is an algebraic system (A, v, ),
given a,b,c in A, the following axioms are
satisfied:
1. Idempotent laws: a v a = a, a a = a;
2. Commutative laws: a v b = b v a, a b = b a
3. Associative laws: a v (b v c) = (a v b) v c,
a (b c) = (a b) c
4. Absorption laws: a v (a b) = a, a (a v b) = a
Lattice and Boolean Algebra
Slide 4
Lattice - Example
Let A={1,2,3,6}.
Let a v b be the least common multiple
Let a . b be the greatest common divisor
Then, the algebraic system (A, v, .) satisfies
the axioms of the lattice.
Lattice and Boolean Algebra
Slide 5
Distributive Lattice
The lattice (A, v, ) satisfying the following
axiom is a distributive lattice
5. Distributive laws: a v (b c) = (a v b) (a v c),
a (b v c) = (a b) v (a c)
Lattice and Boolean Algebra
Slide 6
Examples
distributive
non-distributive

a (bvc) = a bv a c
Lattice and Boolean Algebra
Slide 7
Complemented Lattice
Let a lattice (A, v, ) have a maximum
element 1 and a minimum element 0. For any
element a in A, if there exists an element x
a

such that a v x
a
= 1 and a x
a
= 0, then the
lattice is a complemented lattice.
Find complements in the previous example
Lattice and Boolean Algebra
Slide 8
Boolean Algebra
Let B be a set with at least two elements 0 and 1.
Let two binary operations v and , and a unary
operation are defined on B. The algebraic system
(B, v, , , 0,1) is a Boolean algebra, if the
following postulates are satisfied:
1. Idempotent laws: a v a = a, a a = a;
2. Commutative laws: a v b = b v a, a b = b a
3. Associative laws: a v (b v c) = (a v b) v c,
a (b c) = (a b) c
4. Absorption laws: a v (a b) = a, a (a v b) = a
5. Distributive laws: a v (b c) = (a v b) (a v c),
a (b v c) = (a b) v (a c)
Lattice and Boolean Algebra
Slide 9
Boolean Algebra
6. Involution:
7. Complements: a v a = 1, a a = 0;
8. Identities: a v 0 = a, a 1 = a;
9. a v 1 = 1, a 0 = 0;
10. De Morgans laws:



a = a

avb = a b
a b = avb
Lattice and Boolean Algebra
Slide 10
Huntingtons Postulates
To verify whether a given algebra is a
Boolean algebra we only need to check 4
postulates:
1. Identities
2. Commutative laws
3. Distributive laws
4. Complements
Lattice and Boolean Algebra
Slide 11
Example
prove the idempotent laws given
Huntingtons postulates:
a = a v 0
= a v aa
= (a v a) (a v a)
= (a v a) 1
= a v a
Lattice and Boolean Algebra
Slide 12
Models of Boolean Algebra
Boolean Algebra over {0,1}
B={0,1}. (B, v, , , 0,1)
Boolean Algebra over Boolean Vectors
B
n
= {(a
1
, a
2
, , a
n
) | a
i
e {0,1}}
Let a=(a
1
, a
2
, , a
n
) and b = (b
1
, b
2
, , b
n
) e B
n

define
a v b = (a
1
v b
1
, a
2
v b
2
, , a
n
v b
n
)
a b = (a
1
b
1
, a
2
b
2
, , a
n
b
n
)
a=(a
1
, a
2
, , a
n
)
then (B
n
, v, , , 0,1) is a Boolean algebra, where,
0 = (0,0, , 0) and 1 = (1,1, , 1)
Boolean Algebra over Power Set
Lattice and Boolean Algebra
Slide 13
Examples
B
3

P({a,b,c}) {n e N| n|30}
Lattice and Boolean Algebra
Slide 14
Isomorphic Boolean Algebra
Two Boolean algebras (A, v, , , 0
A
,1
A
)
and
(B, v, , , 0
B
,1
B
) are isomorphic iff there is
a mapping f:AB, such that
1. for arbitrary a,b e A, f(avb) = f(a)vf(b),
f(a b) = f(a) f(b), and f(a) = f(a)
2. f(0
A
) = 0
B
and

f(1
A
) = 1
B

An arbitrary finite Boolean algebra is
isomorphic to the Boolean algebra
(B
n
, v, , , 0,1)
Question: define the mappings for the previous
slide.
Lattice and Boolean Algebra
Slide 15
De Morgans Theorem
De Morgans Laws hold


These equations can be generalized

avb = a b
a b = avb

x
1
v x
2
v v x
n
= x
1
x
2
x
n
x
1
x
2
x
n
= x
1
v x
2
v v x
n
Lattice and Boolean Algebra
Slide 16
Definition
Let (B
n
, v, , , 0,1) be a Boolean algebra.
The variable that takes arbitrary values in the
set B is a Boolean variable. The expression
that is obtained from the Boolean variables
and constants by combining with the
operators v, , and parenthesis is a
Boolean expression. If a mapping f:B
n
B is
represented by a Boolean expression, then f
is a Boolean function. However, not all
mappings f:B
n
B are Boolean functions.
Lattice and Boolean Algebra
Slide 17
Theorem
Let F(x
1
, x
2
, , x
n
) be a Boolean expression.
Then the complement of the complement of
the Boolean expression F(x
1
, x
2
, , x
n
) is
obtained from F as follows
1. Add parenthesis according to the order of
operations
2. Interchange v with
3. Interchange x
i
with x
i

4. Interchange 0 with 1
Example

xv(y z) = x (yvz )
Lattice and Boolean Algebra
Slide 18
Principle of Duality
In the axioms of Boolean algebra, in an
equation that contains v, , 0, or 1, if we
interchange v with , and/or 0 with 1, then
the other equation holds.
Lattice and Boolean Algebra
Slide 19
Dual Boolean Expressions
Let A be a Boolean expression. The dual A
D

is defined recursively as follows:
1. 0
D
= 1
2. 1
D
= 0
3. if x
i
is a variable, then x
i
D
= xi
4. if A, B, and C are Boolean expressions, and
A = B v C, then A
D
= B
D
C
D

5. if A, B, and C are Boolean expressions, and
A = B C, then A
D
= B
D
v C
D

6. if A and B are Boolean expressions, and
A = B, then


A
D
= (B
D
)
Lattice and Boolean Algebra
Slide 20
Examples
1. Given xy v yz = xy v yz v xz
the dual (x v y)(y v z) = (x v y)(y v z)(x v
z)

2. Consider the Boolean algebra B={0,1,a,a}
check if f is a Boolean function.
f(x) = xf(0) v xf(1)
f(x) = x a v x 1
f(a) = a a v a 1 = a
x f(x)
0 a
1 1
a a
a 1
Lattice and Boolean Algebra
Slide 21
Logic Functions
Let B = {0,1}. A mapping B
n
B is always
represented by a Boolean expressiona two-valued
logic function.
f v g = h f(x
1
,x
2
,,x
n
) v g(x
1
,x
2
,,x
n
) =
h(x
1
,x
2
,,x
n
)
f = g f(x
1
,x
2
,,x
n
) = g(x
1
,x
2
,,x
n
)
x y f g fvg fg f g
0 0 0 0 0 0 1 1
0 1 1 0 1 0 0 1
1 0 1 0 1 0 0 1
1 1 0 1 1 0 1 0
Example
Lattice and Boolean Algebra
Slide 22
Logical Expressions
1. Constants 0 and 1 are logical expressions
2. Variables x
1
,x
2
,,x
n
are logical expressions
3. If E is a logical expression, then E is one
4. If E
1
and E
2
are logical expressions, then
(E
1
v E
2
) and (E
1
E
2
) are also logical
expressions
5. The logical expressions are obtained by
finite application of 1 - 4
Lattice and Boolean Algebra
Slide 23
Evaluation of logical Expressions
An assignment mapping o:{x
i
} {0,1} (i = 1, , n)
The valuation mapping |F|
o
of a logical expression is
obtained:
1. |0|
o
= 0 and |1|
o
= 1
2. If x
i
is a variable, then | x
i
|
o
= o(x
i
)
3. If F is a logical expression, then |F|
o
= 1 |F|
o
= 0
4. If F and G are logical expressions, then
|F v G|
o
= 1 (|F|
o
= 1 or |G|
o
= 1)
5. If F and G are logical expressions, then
|F G|
o
= 1 (|F|
o
= 1 and |G|
o
= 1)
Example: F:x v y z
o(x) = 0, o(y) = 0, o(z) = 1
Lattice and Boolean Algebra
Slide 24
Equivalence of Logic Expressions
Let F and G be logical expressions. If
|F|
o
= |G|
o
hold for every assignment o,
then F and G are equivalent ==> F G
Logical expressions can be classified into 2
2
n

equivalence classes by the equivalence
relation ()