Scribd
Upload
17 views21 pages

Mat 2155 Po

The document discusses various concepts in lattice theory, including universal upper and lower bounds, modular lattices, and Boolean algebras. It defines Boolean lattices and their properties, including De Morgan's laws, atoms in finite Boolean lattices, and Boolean expressions and functions. Additionally, it explains the forms of Boolean expressions, including conjunctive and disjunctive normal forms.

Uploaded by

klavidaesbella56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views21 pages

Mat 2155 Po

The document discusses various concepts in lattice theory, including universal upper and lower bounds, modular lattices, and Boolean algebras. It defines Boolean lattices and their properties, including De Morgan's laws, atoms in finite Boolean lattices, and Boolean expressions and functions. Additionally, it explains the forms of Boolean expressions, including conjunctive and disjunctive normal forms.

Uploaded by

klavidaesbella56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

b v(c d)=b v a = b

(b v c) (b v d)= c e = c
b=c
universal upper bound and universal lower bound

Remark 1: Universal upper bound if exists is unique.


Remark 2: Universal lower bound if exists is unique.
Remark 3: Every finite latice has ULB and UUB.
Theorem:
complemented lattice
modular lattice
A lattice (A, <) is said to be modular if for any three elements a,b,c
in A where a < c, a (b c) = (a b) c

1. Show that a lattice is a modular lattice if and only if the


following condition holds a (b (a c) = (a b) (a c)
Boolean Algebra

A non empty set A together with one or


more binary operations defined on it is
called an algebraic structure.

Boolean Lattice: A distributive complemented lattice is called a boolean


lattice.. In a boolean lattice every element has a unique complement.
the complement of a is denoted by a . The unary operation
'complementation' is denoted by '- ' on a boolean lattice.

Boolean Algebra : Let (A , <) be a boolean Lattice. the algebraic system


(A, v, , -) defined by the Boolean Lattice is called a Boolean Algebra.

De Morgan's Law
Let (A, v, ,-) be a Boolean Algebra . For any a, b in A
(i) a v b = a b
(ii) a b = a v b
Atom

Lemma : Let (A, <) be a finite Boolean Lattice . For any non zero
element b in A, there is atleast one atom a in A such that a < b.

Lemma 2: Let (A, v, ,- )be a finite Boolean Algebra. Let b be any non
zero element in A. Let a1, a2, ..., ak be all the atoms such that ai < bi,
for i = 1,2,...,k. Then b = a1 v a2 v....vak.
Boolean Expression and Functions
Let (A , v, , -) be a boolean algebra . The boolean expression for this
algebra is defined as
(i) any element of A is a Boolean expression.
(ii) any variable name is a boolean expression.
(iii) if E1, E2, are boolean expression then so ar E1 v E2, E1 E2 , E1

Boolean Expression that contains n distinct variables is called a Boolean


expression of n variables.

Two boolean expressions are said to be equivalent if one can be


obtained from the other by finite number of applications of the
identities of boolean algebra.

Manipulating a boolean expression means simplifying the expression to


an equivalent form.

Boolean Function
Let A = {0,1} Then A consists of all ordered n tuples of ordered pairs
of 0's and 1's . f: A A is called a boolean function if it is associated
with a boolean expression in n variables.

Conjunctive and Disjunctive normal forms


A B.E of n variables is said to be a min term, if this is of the
form where is either or .

A B.E over the 2 valued B A ({0,1}, v, , -) is said to be in


DNF if it is the join of min terms .

You might also like