离散数学集合.pptVIP

1DiscreteMath

CS2800Prof.BartSelmanselman@cs.cornell.eduModuleBasicStructures:SetsRosen,chapt.2.

2SetTheory-DefinitionsandnotationAsetisanunorderedcollectionofobjectsreferredtoaselements.Asetissaidtocontainitselements.Differentwaysofdescribingaset.1–Explicitly:listingtheelementsofaset{1,2,3}isthesetcontaining“1”and“2”and“3.”listthemembersbetweenbraces.{1,1,2,3,3}={1,2,3}sincerepetitionisirrelevant.{1,2,3}={3,2,1}sincesetsareunordered.{1,2,3,…,99}isthesetofpositiveintegerslessthan100;useellipseswhenthegeneralpatternoftheelementsisobvious.{1,2,3,…}isawaywedenoteaninfiniteset(inthiscase,thenaturalnumbers).?={}istheemptyset,orthesetcontainingnoelements.Note:??{?}

3SetTheory-Definitionsandnotation2–Implicitly:byusingasetbuildernotations,statingthepropertyorpropertiesoftheelementsoftheset.S={m|2≤m≤100,misinteger} Sis thesetof allm suchthatmisbetween2and100andmisinteger.

4

SetTheory-WaystodefinesetsExplicitly:{John,Paul,George,Ringo}Implicitly:{1,2,3,…},or{2,3,5,7,11,13,17,…}Setbuilder:{x:xisprime},{x|xisodd}.Ingeneral{x:P(x)istrue},whereP(x)issomedescriptionoftheset.LetD(x,y)denote“xisdivisiblebyy.”Giveanothernamefor{x:?y((y1)?(yx))??D(x,y)}.CanweuseanypredicatePtodefineasetS={x:P(x)}?“Anypropertyshoulddefineaset…perhaps…”:and|areread“suchthat”or“where”Primes

5SetTheory-Russell’sParadoxCanweuseanypredicatePtodefineasetS={x:P(x)}?DefineS={x:xisasetwherex?x}Then,ifS?S,thenbydefnofS,S?S.SoSmustnotbeinS,right?ARRRGH!But,ifS?S,thenbydefnofS,S?S.No!Compare:Thereisatownwithabarberwhoshavesallthepeople(andonlythepeople