TT
HHAHTE
T
D
T
2
C
8 u 361,pohehical fylognisn)
r P
u 3,9 1potheheal yl
11 u *}_| T Co na oniHve o o
AA
12) p T Lontrapohve d
13)uVt)p| T lL12
T, BDemorganS Lawa onveson 13
L (uat)_ P
6 T 1,1 Modus Poreag
A =
Tatanisteat Premisea Mathenäticaly, tke premis
are said to
incesistent
he theN ARAuUE s a Contiracicti
PnPAfa.AlnR nA (alwoy falke)
auoap, thon tis an
s e t )premies reluts tn Conbradicisn
incoistent prewuse
Fro ve at;_p 2,S)* ) pIS ane jnon lent
2 r ) p pT&,
1o
T,21ypo ConjuncUn
T Conrap e d93
P
6 Sp S
2PAS P
T 1 Sip'ahn
T,7
o)P T,6,9 Modus Ponsns
Predicae Loi cal Theory Page
Date
cales then redicaFe
Predicae
P a) v preafl Han
PC6) T
P) F
Ruantufers
Univesal Quanthier Spee a quathy s e x
uoaase_d_oiacauaR Ken_e ute
it Aead aa n all aPla) ke iymbol
ealledas he meMal quanies
2 EXista tial Quatufien
qartihy rue a t least bne n st P(
P
2 Negatim ouantidier x_P(x)
Negatim Q
A
Pln
Neg ative q n
PCx) *a Pl«)
[a)] T RE
2 (a) n_y Man
9rtaU
M) . a am integea.
N)
Expre he to llo uag nag anher
nklaj Ltz)
Page
Dale
/M(n) = N(n)
et klx): S h e t
M) eloven
Nn) suecea
xp-
A) fhane ex'iuh a shdat
h Some shadush are_cleven_ a kla) =>Ml)
t S m estudan are Antsueresad a K) w N J .
y Negate he slatemoag
P:Ainkeges ane reaky haad
for all real no. K 2 3 , ken n29
Ar eKiab an inkeg i t l t>3)
Saststegera Jhe
Which is netpesker
J
graky than 8
hee emb area no, M `uch kat
9
Mn
Relatim No xelationmrom A to B 2
RCAXxB
9 RO s)y Ry A aSy
2 2 RUs) y
Ry VxSy
Pace:
Date
6
K y
I= (): A
Fquivalance Relatiim: 9avclatrn is retexive, Symebnc 4 ransihve
13RcPlexive relatim a CA la,a)E R
Fores A:2lL2,3 A_e Set
, C12), , 2), (33)js alexie
Telatho
}t-elexise 9 ¥acA la,a)2R
A L,1
R ,),03)3 u e-elexie
3)Non-|lexíve Y Some a EA
onrelexiue
) R
e,)
Yreatin
gR , hen R
Syeti'c relatum 9 9 AR R bAaAa
c'e a,6) eR 3_(6a) ER
mms c relation
S symmetne relahm aRb Ka a , b A
hen R i asynmeie Aet be thee
NoR hhs elatm, a,a) hyee c elenentj ill
Page
Date
6Anbsymmume relatim'a
aRbbXn a b
Transiie relatin aR b, Rc > aRc
Note 9 a cet A has n elomonti ho h-n
No d relexi ve telatns m A =
liv No Snmtic relahmy onA 2
mA_
L/ No:Q uexve 2 spmnmutn'é relations
Let RE AXA_ hen R s said fo be
Lgui valence Relaien
an eguvalae YelatgA
t R i o relexijve
ti R Symmutr'c
y) 1 y E Z a y iu dinihle hy32
t) R =
3
AA
Ci Refexiue we kaow hat_a-a: ohidh u davisible by
all ae Z
,a)ER_ a cz
R reexive
D)Symtnc
diisible by3 , there a,bG z
a 3 k henekEZ
a
-a = -3k - 3(-k)
here Ez
-k
oi i'i hle b 3 2Cb,aj eR
TY AYMoi
Page
Date/
lii Transihve t (ab) e b)eR
nceab_ )ERA A=b i aliisble by 3 e e a, bé2
-b__3k ke k 2
intebc) e R2 b -
b-c diude by 3 ian b e 2
b-c 3k2
A-C _ A-b t b-c
3 kk, t3 k
_ kk ) e z k e2
han k +ké2
hon Ce a-C u oivisible by 3
(a,c)ER
Theore 9) RAS_ are _equivalen ce relotuog_n SctE A
Prove Hhat tD R a n equualenee rc lauon
tiRASy_an equualenee Aelatn
A
1
P13
2 t:
Ra_ xR
aR
aR
[al:[hy
raphital ep
Rep rcetation Relations
naph representatm R 1,4), ,2
3,3, 3)}
2 MatiX rery etatam
Conneekal Hen
2
hot lonncekd
Aagonal antries :1
Relleciut 9/ al
Symeie MA M
A A' Ken
FoY hramaitint
+ MA Mg
M R t M A: M g / e _ t r e m s i h r e
1 &R
A : , 2, 3
e
oauech'ce
unekae it
lo cheek
C
T
(Ros eSoR
A,)E S (yEA
272 e(Ros)
Hence
Hence Ros =Sop*
Note t MpD M Boolean_prpduct)
Rus M VM
0D
O
Cmilar to addihon d mahmcas)
MphS MMaAMe
M
elat.m lagtetlast etatioe
Closure 11
Riexive
ReexLr (losunw f_f
CLesa R {0,i), (2,2) (2,3)
Page
Date I
lo mals R keise kaut to add h Smallest elanaat
R=I,1),2,2),(2)S3)
RCR
ymmeime cloune To make R sypsmehi e w kaue fo add
th smallat elomentxsthich e rtaulfrg_set
Hhaa Contaim R 1a hg Sypnmem'c daiure
R D , (2,2), ,3,1}-
Nok R R UR
Ste
Ta iue: Closure Washalu Mgonthm dond the Îrawitie zlaurt
gRSLL2) 2, )(33)3 A 1,3)
R A A.
hes a n_elomenta in A hen we haue to do ih 1skp
Mp
Set w Mp
Skep Compuke w
t rars aU he 1sen om w to w,
7
ttu Posihn ' s e in C Na.
Po hm s i n R,
non ne n 1 in w
Page
Date
Se 2 ompue w,
(i Posah'm )15. n C_
Poshlm d jn R, *.
N ny1",2)
w O11
Steh 3Cempute w 3
Pos, hion ) 1 C:1,22 3
'W
Byohseanng Get emaif»e lnsure R
) By witg nrshallS algnnBhm spiad he anahie closure R
A 1, 2,3,4
o 0 0 :w
MA
M
E
17
Paga
Dite/
Hente D_U,21,0,310,112, D ) ,l22LY3,
7/0/1012
a-
PoseT Partial Ordor relotion) A set togcPaen nf
patal de nelalien
Denocd by (S
called a peaet for e z,< (2LL(S),S
Comparale elements Tv elek ane sad fo be Comparalhle
qprecoede y 0suecned
To tallyordesed SetE[Linearlyordered Set)9 An a poset(S<)
e e u twe Rlomerta d S One Cenpanahle hen s Called
Lotay odned set rih reapect do e gwen aelati
A tolall dned Cet u ales Called achain
Forc ( z < )
Peodnct order LotSanalT ane two seth such that
SxT (SESES tEI, thea Cs t) (t)
Symbstst parhat ordep
relahm
The paden i CalMed produet nder
heoremT If (A S)And C8, S) ane furo poset hen
Prove that A XB, aso a poset w.rt_product
_onder dekined by lá,5) S (aE)a Sa A
Pag
Date:
TheoremLexicographic Order
erhen Or Ss henheat<t
mmedaate SucceMor
Z
Hassediagram SSaL,c
Carapheal Tepregntatim Pls) jal 1ic fasl .
poset) ieal fa,b, ei
OrcLL Ae hasat diagram (x )
6
2 3
Sb Maspecial elanent _oposeE
reattat elemeata 4 Ian element a pS.
EP
Page:
Date
2 Leaut element beP
E P.
3 oxImal"elament_ An element s called-maximal eleent A
o St s <
4) Mimmal elomenb An element te P gis caled minioaal ti a
Nobe aximal elament y unque, H a n breakt elaneat =
Maxima aemeat
Eveygrézest elamsat v maximal elkmest,bt maximal
eomeaE_
May may ot he areakot elamertE
Well_ordered Set : An Set_wth an roluing d relatian u Cu)
ell edined dCvey non-emptySulaet the S haa a
Leant element far eg S e t N wel oidened Lt'relatin_U)
buSet ntegus, 2 not welu osdered
Pper boundower bound/Graest lower bound /Least usper bound LAT
onot-
1 Find the lowe apper, Hhe subat la, 4,c?{,h3
a , 4,d,f},{8,d,9 nhe Hass didgram aA shoud
une
6
P
Oat
Aw
Subset Lower bound pper bound
tiab,c3 No louer sound e,ft,h
nce a he
MauMOl element
ec a Nouppe ,bound sin e
h maXimal
(grearat) element
4
No lowen bound
Ci) ac,d,f
iLd.gi
LAT TICE A ose < ) u Called a kattice e v two
elomenk_ P ha both Aeast uppe bound d greatest
Lourey beund that is ( , J ) EP hn
glb) lub lay) enist Ln p evey-pas yin ?
we donote geeakttottrrotn 6 (a,y) AAy_meet)
Lub CnY) aVy Cjoin)
Page
Date
A VB AUB
PS)e) ASA vB A n8.SA Proa
A,B P(S) BCA UB AeE8 ANB AnG
A UB S P(s)
PCS
AD P(s) e A
2 aVb
ESAAB
Note:L
NAy
astpper bound R g a k t Louer bound
i &b
C
b
NO
No No b
No naed do check o el's Shich ae cAnneeted,but
Chsck er thee elemets ushich ane ot_Conneikd to each
A
Ohan
Henc
Propertie Lattice
Va=a aAa a idenpoteat las) Theorem
2. a v6 =b Va a^6 bAa Comnutahe aw)
3 avb Vc) av b)vc aAChAc) : (an6)AC_(Associahe la)
42avfa Ab) a ACavb)=b)= a Absprphbm Laus)
Page
Date
Proofu ava e lub fa,al
aia duahy kheorem aAa a
2 awb : lub [ab
ub ba}
b Va AUb bVa
uang duaslpapesty aAb =bAa
3 2(,ve) = us a bve
&b bve < avsvc) avb av(bVc)_(From ci
<a d di)_
a v bVc)_ C. av(LVe)
av): v c S a v[Ve)
-(1)
N aVb)vc bav c
b a v b ( a vh) Vc -()
C vb) V c bvc<avb) ve rom ti ci
Atao a vb) VC -vi
from V andIvi g u _a V b V C ) < ( a vb)V
a vbvc) = (avf bvcp
By wnn9 dual P°Pen antbA) =(an) Ac
Keorem: i aSb aVC Sb vc
ane bc
iit aSb, csd > a Vc v d
iv Sb, c4d a n c S bnd
Page
Date:
iN) a
oofc te know hatashe a vbb Noud aAC
ND (avc)V CbV -
SavC):V(c vb)
a aV(cvc)vb)
Hanee
avCcv)
aVbvc)
Distibut
a vb) Vc
bVc
Aaal
(avc) (bve)
tti ivena b _a^ba a
do ( a c A (bac) a V
LaAC) ACCA)
aASCAC)AL). Proof
AACAL)
a A b Ac)
an
b) AC
nd
avh:b b_8 cVd d bacg
NoW (a Vc) V ChVd aVE
aVCVb) Vd
aVCbvc) Vd
a b ) v vd) bvd
= Th
. ( aNc) < (bva)
Produet ahcA 1
ain a kthice
Page
Date
tiv) a b< aAb-a & cede> cAd Ce
No AC) ACb'Ad) = an ( cn b)nd a(bnc) Add
a Ab) A( Cnd)
alc
OAC bnd proved
Distibuie Legualuty_
Ee lattie not distmbutivt, n dismbuiive aeguat
Aaaied bry eveny latkce
t) oAhvc) CaAb) V laA c)
aV(bAC)_ <(AVb)A CaVe)
Proof i a a nb a
anb) Aouse bound 4 a, bvc:
anb2< an[hVc
(anc) < a n[ bvc)
laAb)y lanc) á aACbve)_
i a avb ( I ) a a Vc)_
bacsh avb ) bhCSavb- bC c < a VC
aVb par boud a bAC_(Frnr AT 1VC uphen bou
aV(bhc) fa vh
avl bAC) aVc
T
Th AVv (bn) <aVb)_n (aVc) pyo ved
Page.
Date :/2/o9/1or
Proue hat
1)PoAuct tu Aattice i again a ttico
oe9n exam,
Proof ee L& M e urs latie os b te M
poveAa LXM
Dine LxM = y ): aL&ye M
edrins a_laliem ia LxM uh that
LXM4)uaposetz
Inndea to phow that LXM u a atbice , we haue to
a,Y)Y(n2,y2EC1,Ya,JiVy)
) CALy2)(n,A 12 JAyr)
A Hen Ce
ket ),a9e LXM omoMa
A 2 L 4 y,Y E M
NouO aa L M ae lattices Join
, V 1,E
The reonre he upn bound a
Arm
ebzZ2) u any arbtrany uper lreund n41) 4Xy)
(My) S (2Za )
2 ) (7/ Z2)
