Boolean Algebra

September 7,2020 416 PM

2.2 Basic Definitions

1.ClosAre A set S clottd with reupect to a binary epcroior i, 4.ldenhity Element A set Sis said to be an ldenhity ttment with respect ha lo.Dustributive Lauw IF ond ore 2 binany operators
Is said to be distnbuhivt ovtr whtntvir
on a t+ ,
hr voy poir of cements of S, the binory opcrator specifies a rule binany operohionon S if there exisiS an eemtnt e ¬ with the propert
r
obtaining a
unique ckmtnt of that X e x t o r evtry 2 ES
Exampie: Set of natural nbs
1.2.3.4 is cloed with
Exampie: The temet 0 ii an idtnhHy tHment with reupect to the
o n the
apect fo bino optrator by the rues of orithmehc binony optrator set of in kgrrs
oddition,sinu, for ony .b EN, thatii a unique C EN 3,2,1 D.1,245, Sint
Suth that asbs C. Tht stt of notural numbert 5 Nr

clostd with respect to binany optra tor by thc rults +00 x x for ony xe
of avithmeHe substrachon, becausSe 2-31 and The stt of notural numbt15, N, has no ioenhy ekmenty sin u O it excluded
2,3 CN, but C1EN. fwm tne st,
is 5. Invtrie A st howing the idenhty ekment e with reipech to a binary
2.ASSocaTivelow A
binony operator on a 8t1 soid to be
a3sociahre whtntvtr
Oprators said haN an Invese whtnevir for evtry x E, thtre exists
to
(xy)z x(y z) for all x.y.2 e
an etment yef' such that
3.Communatit law A binory operator on a tt s sord to be
Communahe whthtvtr
Fxamplt In the tt of intgant, I,ond
ihe optrator , with
e-0, the
y x fr ol x.yeS inetse of an ttment iu C,sinu a e a ) - 0 ,

-Field- Binany 0perator oddition

A1gebraic Structurc Addiht ldtntity 0
tt of etments,togethtr ith 2 binory operators
each having Poperhits - 5 and both operators
Addihrt Inatr)e Substrachon
Bnsny ophahe tmulfiplication
Combining t gi Popthy .
Malhplicotie ldtnhky:
Rtal nbs with ond » Formsfeld of real numbers 0.40 MUIiplitativt In verit Division Lla
that of pver t:
Boiti of anth mehC 4 or dinory
ONLY
OStn BuTIve Louw appico Bu fs
a: Cbi)- (0:b)+ (a:-c)
algebia
 2.3 AXIOMATIC DE FINITION OF B00 LFAN ALGEBRA
Baolt an Algtbra
is an algebraic Strucharc defintd by a tet of etments. B
tgetner with 2 b n a y optators, f and p r o v i d e d that the following (Huntington)
TWD-Valutd Bootean A19ebra-
postulates ore satisfied
set of 2
etmt nts B3o1
. Sthaturc:Clostd with respect to . d aes end gen the xey fBAKyEB
X+
b.Jhwchurd : Cloitd with vespect to
1 0
aOis an identity elcment with tedpect to ti x10:01x=x. lerat re5-
to x171-ar
D1i an
idtntity tiemti with tspect x

3 Struchurt is commutative with respeci to x y yt.

b.
EXACT SAME RULES nS AND "OR "NOT
Sfrchurt i Commuta hvd with etpet to
yy*
Bo13 t ond
i s distnbuhive outr +;xtyr2) C-y)lx-z).
bisdistrnbutie our (9:2) +9)- u12. 1 STrmcture Closed with respect to + &
Reut eithtr o 0, 1,06 B
5 . Fr evey ttmet x e B, thtue eusts an ekment x' E B (compiemtni of x) a. DtD=0 0t 1 1101 2010entY el For
Suth that (a) x1x'-1 ond [b) X-N'=0. 1:1
b.
100-10~110491TYel F
3. Commu fa tive Laws ac obvious from the Smethy of
Theve exists at kast 2 eltments
. x,y ¬B Suth that 4 the binory perotor tabes
40. Distibutire Lawj * yt2) 0:9)t07) 3 ouer +

Comparing Boolean algebra with arithmetic and ordinary algebra (the feld of real numbers), we 2
917xy12) x y 2 x 9)r 2
note the following diferences:

1.Huntington postulates do not include the associative law However, this law holds for
Boolean algebra and can be derived (for both operators).from the other postulates Same sumbols
2.The distributive law of Over:e.z+(y 2)= (z +)-(z+ 2))is valid for
Boolean algebra. but not for ordinary algebra
3.Boolean algebra does not have addtive or muitplicative inverses therefore, there are no
subtraction or division operations
4.algebra
Postudate5definesan operatorcalled thecomplementthatisnotavalable inordinary Not 1iKE regular" maths
5.Ordinaryalgebra deals with the real numbers. whichconsttute an infinite set of elements b.Distri butke law u a r + (y.2)=(xty)-(x12) - similar 5t3x2 (S+3) xUS+2)
Boolean algebradeals with the as yet undefined setof elements B butin the two-valued
Boolean algebradefinednext land ofinterestinoursubsequent useofthatalgebra).Bis 5. x*x'-1 010' 011 1+1 1101
defined asa set with only two elements, 0 and1
0 000:10 1:1 1:0 0
lo. SaHshed be Booltan Alg. hos 2 ekments 1A0 44 0,
24 BASIC THEOREMS AND PRoPEkTES
F BoOLEAN ALGEBRA.
WEORSN 10E 2t22
Table 2.1 Postulates and Theorems of Boolean Algebra 5t
Stalement
z1- uetifcaten

Postulate2 +0- b)

Postulate 5 zta'=1 =0 phlale 26)

Sa)
heorem4

S)
Theorem3, imvolution (9
2a)
Postulate 3, commutafive (8) +y=Vt D) Tyy

Theorem 4, associatnve )
z+(+z)-(z+) + z (yz)= (zy)
Postulate 4, distnbutve (a) z(y+ )-zy tz +yE ( + v)(r+ 2) alarnere

Theorem 5, DeMorgan (a)

( +)-zy (zy)=z+ *11-r) ent 2Cb)

Sta)
4b)

2b)
S(0)

Statement
|-0-0by auay
Justihcabon

L2)
+ - 0
C
2y-1+zy pochuiade 2

2' +0) L4)

 Statement
Justification

+ zy z-1+zy poshulate 200)

=
r(1 +
y) 4i)

=
z (y+ 1) Jea)

=z-1 theorem 2a)

2)
The
theorems of Boclean algebra can ba proven by means of truth tables. In truth tables, both sides of the relationare checked to
yiold identical resuts for all possble combinations of the variables involved. The following truth table verifes the
see whethar they
first absorption theorem

xy

1
THEORE 1b): x x x
5 5#
Statament Junticotion Com Poe to DE MORGANS TH 5oRÉM
AND OR
pasu tak 21a)

Sth)
Xy Xy
4ta) 00 00 0

0 o
c1
10

2t6)

Note tat eorem 1tb) the dual of heoen 1j) ant that oach slap cf he proot in part ibj in the dual of iu counterpart in part
) Anydatheorh ca be amiartydorved trom the proct ottscArpondngthootem

THEOREM3: ()-r.From postdate 5, we have ta':1 (5) X 0

The complemet of 2'sx
ant
- 0, whch togster defrne complerment of
te
and s ano (2) Tharetore, since the carplerore is unige, we have (r) "- z. The thecrams a =0
K+ =IT(3)
h vanabies may be proven algebraicaly om ihe postdatos and the heorens hat have areaty ben proven. Tate, 1
mple, 1he bsoptecn teorem
 "2b)
So) -THCrom
-0-0by suabty

0 0+X:0 L2) a +Xy

xLIEy) 4)
L2+0)
L4) (2 )
t2) 23
(5)
b X(x+U)
(4
Thealgebraic proofs of the associative law and DeMorgan's theorem are long
and will not be shown here. However, their validity XXtXy
theorem. (r +) zy,is as follows: tX-9 Cb)
iseasily shown with truth tables. For example, the truth table for the first DeMorgan's (A )
(z+)
 O LobIC DIAGRAM FOR F = x+9z
25 B00LEAN FUNCTIO6NS Aigcbrac ManipuLaITION~
Fi Simpli ty 4he follauwing Beo tean exprtctioni :

Fi X+Y'Z
1 if x1 R yLZ 4}otherwie =O 1. x'T4) a + ay 0+ y= xy
Compie mtnt operotion ; y'|. iy- 0 2 ty (xx')(x4y) 1 (xiy)xt
F I i f xl oR
ye0A 2=1 3. (x+9)xy) x +
xy'» yx 19y'= x*ny'+ xyt 0 ll+y' +y)
n b of variables in fct 1MPLEMmENTATION of BooleaN funchion
NHrdbtr of ows tuth tabk
In
2 a) f2 y ' z ta' yz iay
*Ceunt from 0 2 - 1 xy+ y2 + w'2ix'yz

xyt1+2)+xzl14 9)

5.Lx+y)lx+ 2)(y+2) (x+y)(x' t2) by duolity t

-

Complement of a
fun chion
0
O (AtB+C) (A+)' kt 8 C x
minimized A' th. 5 (a) (De Movgan)
b)F y' t a'z A' (BtC) Subst. Bt =x
A' (8'C th. S (a) oeMorgan)
th.4 b) [ossociahve)
A'BC'
Fa
#2 lAt8t C+Dt.t F) C'+A'S'CD'F
(ABCO. F)' =
A'+B'+ D'+ t
F

y'y'zt X'yz+xy'= X'z y+y)+ xy-Xz ixy

fquals 1 whtn z o l
or whth y =10
A1gCbraIc ManipuLAnON Example
Simpli fy the foll uwing Bootean exprcsioni :
DF-xy'4x'y
F ' ( x + y )( x + 9 ) * x'x+ x y ' + x y +44

1. x(x'r4)= a ' ay 0+ xy=«y xy 1xy

2 ty (x')a19) 1 (xy) x+y
3. (x+9)Lx9) x
+xy'+ y« +91' =
x txy'+ xy+ 0 xllty'+y) *x 2) F , 2 yy2)
2

y x ' z t nyz ty2 X'+ (y'2) (y2)'

xyt xyz +*2ix'yz x'+(yt2)(y'+2')
y1+2)+*2(i+ y) X'*yy'+y2'+ 29' *22
Exytx'z X'+yz't 2y
5.Lx+y)Uxt 2)(y12) (x»y) cx' tz) by oluglity 4)
3) F: (xty +2)lx+9)Uxt2)
F': (xuyt2)+ (x49'}'+ (Xt2)'
Complement of a fun chon (Xy'2Jr(X9) + ( x a )

# (At8+C)'= (At)
A'' th. 5 a) (ve Morgan)
A'(B1c) Subst. BtC=x

A (8'C) th. S (a) UOe Morgan)

A'8'C' th. 4 b) (ossociahive)

+2 AtB+C+Dtt F)' A's'C D'... F'

(ABCO.F)'= A'+B+ C'+ D't. + F