https://ebookmass.com/product/discrete-mathematicalstructures-6th-edition-bernard-kolman/
Instant digital products (PDF, ePub, MOBI) ready for you
Download now and discover formats that fit your needs...
Instructor's Solutions Manual for Elementary Linear Algebra with Applications, 9th Edition Bernard Kolman
https://ebookmass.com/product/instructors-solutions-manual-forelementary-linear-algebra-with-applications-9th-edition-bernardkolman/
ebookmass.com
Molecular Biotechnology 6th Edition Bernard R. Glick
https://ebookmass.com/product/molecular-biotechnology-6th-editionbernard-r-glick/
ebookmass.com
(eTextbook PDF) for Mathematical Structures for Computer Science 7th Edition
https://ebookmass.com/product/etextbook-pdf-for-mathematicalstructures-for-computer-science-7th-edition/
ebookmass.com
Understand, Manage, and Measure Cyber Risk: Practical Solutions for Creating a Sustainable Cyber Program, 2nd Edition Ryan Leirvik
https://ebookmass.com/product/understand-manage-and-measure-cyberrisk-practical-solutions-for-creating-a-sustainable-cyber-program-2ndedition-ryan-leirvik/
ebookmass.com
Youngblood Brothers 01 Comanche Sunrise Ethan J. Wolfe
https://ebookmass.com/product/youngblood-brothers-01-comanche-sunriseethan-j-wolfe/
ebookmass.com
Angels of North County O'Connor
https://ebookmass.com/product/angels-of-north-county-oconnor/
ebookmass.com
Indigenous Peoples and Climate Justice: A Critical Analysis of International Human Rights Law and Governance
Giada Giacomini
https://ebookmass.com/product/indigenous-peoples-and-climate-justicea-critical-analysis-of-international-human-rights-law-and-governancegiada-giacomini/
ebookmass.com
Preacher Woman: A Critical Look at Sexism without Sexists
Katie Lauve-Moon
https://ebookmass.com/product/preacher-woman-a-critical-look-atsexism-without-sexists-katie-lauve-moon/
ebookmass.com
Insect Behavior: From Mechanisms to Ecological and Evolutionary Consequences First Edition, Impression 1. Edition Alex Córdoba-Aguilar
https://ebookmass.com/product/insect-behavior-from-mechanisms-toecological-and-evolutionary-consequences-first-editionimpression-1-edition-alex-cordoba-aguilar/
ebookmass.com
On the nonexistence of elements of Kervaire invariant one
Michael Anthony Hill
https://ebookmass.com/product/on-the-nonexistence-of-elements-ofkervaire-invariant-one-michael-anthony-hill/
ebookmass.com
List of Frequently Used Symbols
Chapter 1
0 , b, c, x, )1, Z elements of a set, p 2
E belong s to , p 2
Z + the set of positive integers, p. 2
N the set of nonnegative integers, p. 2
Chapter 3
p=}q P implies q , p. 57
p=.q p is eq ui valent to q, p. 58
lIP,. the number of permutations of n
Z the set of integers , p. 2 objects taken r at a time, p. 94
Q the set of rational numbers , p. 2 /1 1 Il-factorial, p. 94
IR the set of real numbers, p. 3
lI e,. the number of combinations of 11 0, { } the empty set , p. 3 objects taken r at a time, p. 97
c is contained in , p. 3
peE ) the probability of the even t E ,
U the uni versa l set , p. 3 p 106
IAI the card in ality of A, p. 4
!E the frequency of occ urrence of peA) the set of all subsets of A, p. 4 eve nt E, p. 106
A U B the un ion of sets A and B, p. 5
A n B the intersection of se ts A and B,
"
Chapter 4
A x B the Carte s ian product of A and B , p.6 p 123
UA k the uni on from J to n of A b p. 7
k =J
"
nA k the intersection from 1 to 11 of Ab
k J p 7
A-B the complement of B with respect
R(x) the R -relative set of x, p. 130
R(A) the R -relative s et of A, p. 130
MR the matrix of R , p. 131
R OO the connectivity relation of R , the to A, p. 7 transitivity closure of R , p 136
A the complement of A , p. 7
A EB B the symmetric difference of sets A
R* the reachabi1ity relation of R, p.139
!:::,. the relation of equality, p. 141 and B, p. 7
A * the set of all fin ite seq uence s of =. b (mod /1) congruent to b mod II , p. 14 8 elements of A , p. 17
[a ) the equivalence class of a, p. 150 /\. the empty sequence or string, p. 17
A I R a partition of set A determined by 11 1m 12 divides m , p. 21 the equivalen ce relation R on A ,
GCD(a , b) the grea test common divisor of a p. 150 and b , p. 22
LCM(a , b) the least commo n multiple of a and b,p.25
((hdk- I d l d o) " the base b expansion , p. 27
AT the transpose of the matrix A, p. 35
A v B the join of A and B, p. 37
A /\ B the meet of A and B, p. 37
Chapter 5
S o R the composition of Rand S , p. 164
I II the identity function on A, p. 18 3
f- I the inverse of the function f , p. 185
f ll the characteri s tic function of a set
A O B the Boolean product of A and B, A , p. 190 p. 38
LxJ the large s t integer le ss than or equal to x , p 190
rx l the smallest integer greater than or
Chapter 2 equal to x , p. 190
,../ not p , p. 5 1
P
/\ q P and q , p. 52
p V q P or q, p. 52
V for all , p 54
o (f) the order of a function f , p. 200
8(f) the 8 -c1 ass of a function f , p. 20 I
19 the base 2 log function, p 202
(a, a ,· .. a ) permutation of the set
:3 th e re exi s ts , p. 54 pea,)
A = {a i, a2, , a,, }, p. 205
Chapter 6
<apartialorderrelation,p. 218
a v b, LUB(#, b) theleastupperboundof a and b, p.230,233
a Ab, GLB(#, b) the greatest lower boundof a and b, p.230,233
a! the complement of a, p.240
Bn Boolean algebra, p.244 o * y ** andgate,pp. 251-252
orgate,pp. 251 -252
- inverter (NOT), pp. 251-252
Chapter 7
Chapter 8
(7, u()) thetreewithroot i>o, p. 271
r(i;) the subtree of T withroot v, p.273
(V, E,y) thegraphwithverticesin V and edges in E, p. 306
£/„ the discrete graphon at vertices, p.308
Kn the complete graph on n vertices, p.308
Ln the linear graph on n vertices, p.308
Ge the subgraph obtained by omitting e fromG,p.308
GR the quotient graphwith respect to R, p.309
etj excesscapacityofedge (/, j), p.323
c(K) the capacity of acut K, p.327
X (G) the chromatic number of C, p.335
PG the chromatic polynomial ofG, p.336
Chapter 9
S5thesetofallfunctionsfrom S to 5, p. 349
S/R the quotient semigroup of a semigroup 5,p.358
Z„ the quotient set Z/ = (mod a?), p. 358
//? natural homomorphism of S onto S/R, p.359
a// aleft coset of H inG,p.373
Chapter 10
(V, 5, i>0, «->) phrase structure grammar,p.388 => direct derivability, p.388
L(G) the language of G,p.389
() ::= BNF specification ofa grammar, p.395
y the set of transition functions of a finite-state machine, p.403
(5, /, 5^ afinite-statemachine,p.403
fx the transition function corresponding toinput x, p.403
(S, /, T, so, T) Mooremachine,p.405
M/R quotient machine ofmachine M, p.406
l(w) thelengthofastring w, p. 411
Chapter 11
e an (m,n) encoding function, p.430
8(x, y) the distance between the words x and >', p.432
A 0 Bthemod2sumofAandB,p.435
A*Bthemod2 Boolean product ofA andB,p.435
d an (n, m) decoding function,p.440
€j acosetleader,p.443
x *Hthe syndrome of x, p. 446
Preface
Discrete mathematicsisaninterestingcoursebothtoteachandtostudyatthe freshmanandsophomorelevelforseveralreasons.Itscontentismathematics, butmostofitsapplicationsandmorethan half ofitsstudentsarefrom computer scienceorengineeringconcentrations.Thus,carefulmotivationoftopicsandpre viewsofapplicationsareimportantandnecessarystrategies.Moreover,thereare a number of substantive and diverse topics covered inthe course, soatextmust proceed clearlyandcarefully, emphasizing keyideaswith suitable pedagogy.In addition,thestudentisgenerallyexpectedtodevelopan important newskill:the abilitytowriteamathematicalproof.Thisskillisexcellenttrainingforwriting computer programs.
Thistextcanbeusedbystudentsasan introduction tothe fundamental ideasof discrete mathematics, andasa foundation forthe development of more advanced mathematical concepts.Ifusedinthisway,thetopics dealing withspecificcom puterscienceapplicationscanbeomittedorselected independently asimportant examples.Thetextcanalsobeusedinacomputerscienceorelectricalandcom puterengineeringcurriculumto present the foundations ofmanybasic computer relatedconcepts,andtoprovideacoherentdevelopmentandcommonthemefor theseideas.The instructor can easily develop a suitable syllabus by referring to the chapter prerequisites which identify material needed bythatchapter.
• Approach
First, wehave limited both the areas covered andthe depth of coverage to what wedeemprudentin afirstcourse taughtatthefreshmanandsophomorelevel.We have identified aset of topicsthatwefeelare of genuine usein computer science and elsewhere andthatcanbe presented ina logically coherent fashion.Wehave presentedanintroductiontothesetopicsalongwithanindicationofhowtheycan bepursuedingreaterdepth.Thisapproachmakesourtextan excellent reference for upper-division courses.
Second,thematerialhasbeen organized and interrelated to minimize themass of definitions andthe abstraction of some of the theory. Relations and digraphs are treated astwoaspectsofthesame fundamental mathematical idea,witha directed graphbeingapictorialrepresentationofarelation.Thisfundamentalideaisthen usedasthebasisofvirtuallyalltheconcepts introduced inthebook,including functions,partialorders,graphs,andmathematicalstructures.Wheneverpossible, eachnewidea introduced inthetextuses previously encountered material and, inturn,is developed insuchawaythatit simplifies the more complex ideasthat follow.
• What Is New in the Sixth Edition
Wehavebeengratifiedbythewide acceptance of thefirstfive editions ofthisbook throughout the25yearsofitslife. Equally pleasing isthe confirmation of theorig inal decisions about content and approach forthe book fromthe earliest editions. For example, the Association of Computing Machinery Special Interest Groupfor Computer Science Education (SIGCSE) and others have recently made recom mendations regarding the structure of a one-semester course in discrete structures that arewell supported bythistext.In preparing this edition, wehave carefully considered these recommendations, as well as many suggestions from faculty and
students for improving the content and presentation ofthe material. Although manychangeshavebeenmadetodevelopthisrevision,ourobjectivehasremained thesameasinthefirstfiveeditions: topresentthebasic notions of discrete math ematicsandsome of itsapplicationsina clear and concise mannerthatwillbe understandable to the student.
We believe thatthisbook works wellinthe classroom becauseofthe unifying roleplayedbythetwokey concepts: relations and digraphs. Substantial strength eningofthelogicmaterialhasbeenmadebytheadditionoftwonewsections, Mathematical Statements and Logic and Problem Solving alongwith accompany ing exercises. New material onfuzzysetsandfuzzylogicintroducesstudentsto atopicthatisextremelyimportantformodernissues of automated feedbackand controlofprocesses.Thepopularpuzzle Sudoku, relatedpuzzles,andtheirunder lying mathematical connections, forma continuing threadinthetext connecting settheory,Booleanmatrices,algorithmsandcoding,logic,thegeneralconstruc tionofproofs,coloring problems and polynomials, andothertopicsinawaythat studentswillfindboth interesting and instructive. Otherimportantchangesin clude:
• Additional emphasis onhowtodevelopaconjectureandhowtoproveor disprove it.
•Thiseditioncontinuestoweavethediscussionofproofsandprooftech niquesthroughoutthebookwithcommentsonmostproofs,exercisesrelated tothemechanicsofprovingstatements,andTipsforProofssections.Many ofthenewexercisesprovidemorepracticeinbuildingproof-readingand -writing skills.
• More applications are included.
• More exercises have been added.
• More figureshavebeen included
•Anumberofexplanationshavebeenrewrittenforgreaterclarityandim provedpedagogy.
•TheEnd-of-Chaptermaterialfromthefiftheditionhasbeenrearrangedas follows:theconceptualreviewquestionsarenowfoldedintotheSelf-Test attheendofeachchapterandthecodingexerciseshavebeenmovedto Appendix C.
• Exercises
Theexercisesformanintegralpartofthebook.Manyarecomputationalinna ture,whereasothersareofatheoreticaltype.Manyofthelatterandtheexperi ments,tobefurtherdescribedbelow,requireverbalsolutions.Exercisestohelp developproof-writingskillsaskthestudenttoanalyzeproofs,amplifyarguments, orcompletepartialproofs.Guidanceandpracticeinrecognizingkeyelements and patterns havebeen extended inmanynew exercises. Answers toalloddnumbered exercisesand self-test items appear intheback of thebook. Solutions toall exercises appear inthe Instructor's Solutions Manual, which is available (to instructors only)gratisfromthepublisher.The Instructor's Solutions Manual alsoincludesnotesonthe pedagogical ideas underlying eachchapter,goalsand grading guidelines forthe experiments (further described below), andatestbank.
• Experiments
Chapters1through 10 eachendwithastudentexperiment.Theseprovideoppor tunitiesfordiscoveryandexploration,oramore-in-depthlookattopicsdiscussed
inthetext.Theyare designed as extended-time, out-of-class experiences andare suitable for group work. Each experiment requires significantly more writing than section exercises do.Some additional experiments aretobe found in Appendix B. Content, prerequisites, and goals for each experiment are given inthe Instructor's Solutions Manual.
• Coding Exercises
Aset of coding exercises foreach chapter are included in Appendix C.
• End-of-Chapter Material
Each chapter contains Tipsfor Proofs, a summary of Key Ideas, anda Self-Test including aset of conceptual review questions covering the chapter's material.
• Organization
Chapter 1 contains material thatis fundamental tothe course. This includes sets, subsets,andtheir operations; sequences; properties of theintegers including base n representations; matrices;and mathematical structures. Agoal of this chapter istohelp students developskillsin identifying patterns onmanylevels. Chapter 2 covers logicand related material, including methods of proof and mathematical induction. Although the discussion of proof is based onthis chapter, the commen taryon proofs continues throughout the book. Twonew sections, Mathematical Statements and LogicandProblem Solving have been added. This material isused tobriefly discuss the currently widely popular puzzle Sudoku and related puzzles. Chapter 3,oncounting,dealswith permutations, combinations, the pigeonhole principle, elementsof discrete probability,and recurrence relations.
Chapter 4 presents basictypesand properties of relations, along with their rep resentation as directed graphs. Connections with matrices and other data structures arealsoexploredinthischapter. Chapter 5dealswiththenotionofafunction,and gives important examplesoffunctions, including functions of special interest in computer science.An introduction tothe growth of functions is developed. New material onfuzzysetsandfuzzylogichasbeenadded. Chapter 6coverspar tially ordered sets,includinglatticesand Boolean algebras. A symbolic version forfindinga Boolean function fora Boolean expression is developed alongwith the pictorial Karnaughmethod. Chapter 7 introduces directed and undirected trees alongwith applications oftheseideas. Elementary graph theorywith applications to transport networks and matching problems isthe focus of Chapter 8.
In Chapter 9wereturnto mathematical structures and present thebasicideas of semigroups, groups, rings,andfields.By building on work in previous chapters, onlyafewnew concepts are needed. Chapter 10 is devoted tofinitestate machines. It complements andmakes effective use of ideas developed in previous chapters. Chapter 11 finishesthe discussion of coding for error-detecting and correction and for security purposes. Appendix A discusses Algorithms and Pseudocode. The simplified pseudocode presented hereisusedin some text examples and exercises; these maybe omitted without loss of continuity. Appendix B gives some additional experiments dealing with extensions or previews of topics in various parts of the course. Appendix C contains aset of coding exercises, separated into subsets for each chapter.
• Optional Supplements
There is available withthistexta 406 page workbook: Practice Problems in Dis creteMathematics by Boyana Obrenic (ISBN 0-13-045803-1). It consists entirely
of problem setswithfullyworkedoutsolutions.Inaddition,thereisa316page workbook: DiscreteMathematics Workbook by James Bush (ISBN 0-13-0463272).This item has outlines ofkey ideas, key terms, and sample problem sets (with solutions).
• Acknowledgments
Wearepleasedtoexpressourthankstothefollowingreviewersofthefirstfour editions: Harold Fredrickson, Naval Postgraduate School; Thomas E. Gerasch, George Mason University; Samuel J.Wiley,La Salle College; Kenneth B.Reid, Louisiana SateUniversity;RonSandstrom,FortHaysState University; Richard H.Austing,Universityof Maryland; Nina Edelman, Temple University; Paul Gormley,VillanovaUniversity; Herman Gollwitzer andLorenN. Argabright, both atDrexelUniversity;BillSands,UniversityofCalgary,who brought toouratten tiona number of errorsinthe second edition; Moshe Dror, University of Ari zona,Tucson; Lloyd Gavin, California State University at Sacramento; Robert H. Gilman, StevensInstituteofTechnology;EarlE. Kymala, California State University at Sacramento; andArtLew, University of Hawaii, Honolulu; Ashok T. Amin, University of Alabama at Huntsville; Donald S. Hart, Rochester Institute ofTechnology;MinhuaLiu,WilliamRainey Harper College;CharlesParry,Vir ginia Polytechnic Institute&University; Arthur T.Poe,Temple University; Suk JaiSeo,UniversityofAlabamaat Huntsville; PaulWeiner,St. Mary's Univer sityofMinnesota;andofthefifthedition:EdwardBoylan,RutgersUniversity; AkihiroKanamori,BostonUniversity;CraigJensen,University of NewOrleans; HaroldReiter,UniversityofNorthCarolina; Charlotte Zhong-Hui Duan,Univer sityofAkron;andofthesixthedition:DanrunHuang,St.CloudStateUniversity; George Davis, Georgia State University; Ted Krovetz, California State Univer sity,Sacramento;LesterMcCann,TheUniversityofArizona;SudiptoGhosh, Colorado StateUniversity;BrigitteServatius,Worcester Polytechnic Institute; Carlo Tomasi, DukeUniversity;AndrzejCzygrinow, Arizona StateUniversity; JohanBelinfante,GeorgiaInstituteofTechnology;GaryWalker, Pennsylvania StateUniversity-Erie.Thesuggestions,comments,andcriticismsofthesepeople greatly improved the manuscript.
WethankDennisR.Kletzing,who carefully typesettheentire manuscript; Lil ianN.Bradyforcarefullyandcriticallyreadingpageproofs;BlaisedeSesa,who checked the answers and solutions toall the exercises in the book; and instructors and students frommany institutions inthe United States and other countries, for sharingwithustheirexperienceswiththebookandofferinghelpfulsuggestions.
Finally, a sincere expression of thanks goestoBill Hoffman, Senior Editor, Caroline Celano,AssociateEditor, Linda Behrens, Senior Managing Editor,Kristy Mosch, Production ProjectManager,KatieWinter, Marketing Manager, JonCon nelly, Marketing Assistant, Lisa McDowell, Operations Specialist, Heather Scott, Art Director, Tom Benfatti, Art Editor, and to the entire staff of Pearson for their enthusiasm, interest,andunfailing cooperation duringthe conception, design,pro duction, and marketing phases of this edition.
CHAPTER 1 Fundamentals
Prerequisites: There are noformal prerequisites for this chapter; the reader is encouraged to read care fullyand work through all examples.
Inthis chapter we introduce some of the basic tools of discrete mathematics. We beginwithsets,subsets,andtheir operations, notions with which youmay already befamiliar.Nextwedealwith sequences, usingboth explicit andrecursivepat terns. Then wereviewsome of thebasic properties of the integers. Finally we introduce matrices and matrix operations. This givesusthe background needed to beginour exploration of mathematical structures.
Looking Back: Matrices
Theoriginofmatricesgoesbackto approximately 200B.C.E., 1897), aBritish mathematician andlawyer.In 1851, Sylvester whentheywereusedbythe Chinese tosolvelinearsystemsofmetArthurCayley (1821-1895), alsoa British lawyerwitha equations.Afterbeingintheshadowsfornearlytwothousandstronginterestin mathematics. Cayleyquicklyrealizedthe imyears,matricescamebackinto mathematics towardtheendofportanceofthenotionofamatrixandin1858 published abook the seventeenth centuryandfromthen research inthisareapro-showingthebasic operations onmatrices.Healso discovered a ceededatarapidpace.Theterm "matrix" (the singular of"ma- number of important results inmatrix theory, trices") was coined in 1850 by James Joseph Sylvester (1814—
James Joseph Sylvester
Arthur Cayley
1.1 Sets and Subsets
Sets
A set isanywell-definedcollectionofobjectscalledthe elements or members of the set.Forexample,thecollectionofallwoodenchairs,the collection ofall one-legged black birds,orthe collection of real numbers between zero andone areallsets. Well-defined justmeansthatitispossibletodecideifagivenobject belongstothecollectionornot.Almostallmathematicalobjectsarefirstofall sets,regardlessofanyadditionalpropertiestheymaypossess.Thussettheoryis, inasense,thefoundationonwhichvirtuallyallofmathematicsisconstructed.In spiteofthis,settheory(atleasttheinformalbrandweneed)isquiteeasytolearn and use.
Onewayofdescribingasetthathasafinitenumberofelementsisbylisting theelementsofthesetbetweenbraces.Thusthesetofallpositiveintegersthatare less than 4 can be written as
{1,2,3}. (1)
Theorderinwhichtheelementsofasetarelistedisnotimportant.Thus {1,3, 2},{3, 2,1}, {3,1,2}, {2,1,3},and{2,3, 1} areallrepresentationsoftheset givenin(1).Moreover,repeatedelementsinthelistingoftheelementsofasetcan beignored.Thus,{1,3,2, 3,1} isanotherrepresentationofthesetgivenin(1).
Weuse uppercase letterssuchasA, B, C to denote sets,and lowercase letters suchas ay b, c, x, y, z, t todenotethe members (or elements) ofsets.
Weindicatethefactthat x isanelementoftheset A bywriting x € A,and weindicatethefactthat x isnotanelementof A bywriting x £ A.
Example 1 Let A= {1, 3,5,7}. Then 1 e A, 3 e A,but2 £ A.
Sometimesitis inconvenient orimpossibletodescribeasetbylistingallof itselements.Anotherusefulwaytodefineasetisbyspecifyingapropertythat theelementsofthesethaveincommon.Weusethenotation P(x) todenote asentenceorstatementPconcerningthevariableobject x. Thesetdefinedby P(x), written {x\ P(x)}, isjustthecollectionofallobjectsforwhichPissensi bleand true, {x\P(x)} isread,"thesetofall x suchthat P(x)." Forexample, {x | x isapositiveintegerlessthan 4} istheset{1,2, 3} describedin(1)bylisting its elements.
Example 2 The set consisting ofall the letters in the word "byte" canbe denoted by {b, y, t, e} orby {x\x isaletterintheword"byte"}.
Example 3 We introduce here several sets and their notations that will be used throughout this book.
(a) Z+ = {x | x isa positive integer}.
Thus Z+ consists ofthe numbers usedfor counting: 1,2,3 (b)N= {x | x isa positive integer orzero}= {x\x isa natural number}.
ThusN consists of the positive integers andzero:0,1,2, (c)Z= {jc | x isaninteger}.
Thus Z consists of allthe integers: ..., -3,-2, -1, 0, 1, 2, 3,....
(d) Q = {x | x isa rational number}.
a Thus Q consists of numbers that can be written as -, where a and b are inteb gers and b isnot0.
Figure 1.1
(e) R ={x | x isareal number}.
(f)Thesetthathasno elements initis denoted either by{}orthe symbol 0and is called the empty set.
Example 4 Since the square ofa real number is always nonnegative, {x | x isa real number and x2 = 1} =0.
Setsarecompletelyknownwhentheirmembersareallknown.Thuswesay twosets A and B are equal iftheyhavethesame elements, andwewrite A=B.
Example 5 IfA= {1, 2, 3} and B= {x \x isa positive integer and x2 < 12}, then A= B.
Example 6IfA= {JAVA, PASCAL, C++} and B= {C++, JAVA, PASCAL}, then A= B.
Subsets
Ifevery element of A isalsoan element of B, thatis,if whenever x e A then x € B, wesaythatAisa subset of B orthat A is contained in B, andwewrite A c B. If A isnota subset of B, we write A <£ B. (See Figure 1.1.) Diagrams,suchasthoseinFigure1.1,whichareusedtoshow relationships between sets,are called Venn diagrams after the British logician John Venn.Venn diagrams willbeused extensively in Section 1.2.
Example 7 We have Z+ c Z. Moreover, if Q denotes thesetof rational numbers, then Z c
Example 8Let A= {1,2,3,4,5,6}, B = {2,4,5},and C= {1,2,3,4,5}. Then B c A, B cC,andC c A. However, A £ B, A <£ C,and C £ B.
Example 9IfAis any set, then A c A. Thatis, every setisa subset of itself.
Example 10 LetAbeaset and let B = {A, {A}}. Then, since A and {A} are elements of B, we have A € £ and{A} eB. It follows that {A}c S and {{A}} c B. However, itis not true that Ac B.
ForanysetA,sincethereareno elements of 0thatarenotinA,wehave 0cA.(Wewill look atthis again in Section 2.1.)
Figure 1.2
ItiseasytoseethatA= B ifandonlyifAc B and 5 cA.Thissimple statement isthebasisforproofs of many statements about sets. The collection of everything, it turns out, cannot be considered aset without presenting serious logical difficulties. Toavoidthisand other problems, which need not concern us here, we will assume that for each discussion there isa "uni versal set" U (which willvarywiththe discussion) containing all objects for which the discussion is meaningful. Any other set mentioned inthe discussion willauto matically be assumed tobea subset of U. Thus, if weare discussing real numbers and we mention sets A and B, then A and B must (we assume) be sets of real numbers, not matrices, electronic circuits, or rhesus monkeys. In most problems, a universal setwillbe apparent from the setting of the problem. InVenn diagrams, the universal set U willbe denoted bya rectangle, while sets within U willbe denoted by circles as shown in Figure 1.2.
AsetAis called finite ifithas n distinct elements, where n gN.Inthis case, n iscalledthe cardinality ofAandisdenotedby|A|.Thus,thesetsof Examples 1,2,4,5,and6arefinite.Aset that isnotfiniteis called infinite. The setsintroducedinExample3(except 0) areinfinitesets.
IfAisaset,thenthesetofallsubsetsofAiscalledthe power set ofAandis denotedby P(A). (BesuretodistinguishbetweenP(A),astatementaboutA,and P(A), the power set of A.)
Example 11 Let A= {1,2, 3}. Then P(A) consists of the following subsets of A: { }, {1}, {2}, {3}, {1,2},{1,3},{2,3},and{1,2,3}(orA).Inalatersection,wewillcountthe number of subsets that a set can have.
1.1 Exercises
1.LetA= {1, 2,4, a, b,c}. Identify eachofthe following as true or false.
(a)2 e A(b)3 eA (c) c £ A (d)0gA(e){} i A (f)AgA
2.LetA= {x | x isarealnumberand x< 6}.Identify eachofthe following astrueorfalse.
(a)3gA(b)6gA(c)5 i A (d) 8£ A(e) -8gA (f)3.4 i A
3.Ineachpart,givethesetoflettersineachwordbylisting the elements of the set.
(a) AARDVARK (b) BOOK (c) MISSISSIPPI
4.Givethesetbylistingitselements.
(a)Thesetofallpositiveintegersthatarelessthanten. (b) {jc | x GZand*2 < 12}
5.LetA={1,{2,3},4}.Identifyeachofthefollowingas true or false.
(a)3gA(b) {1,4} cA(c) {2,3} c A (d) {2,3}gA (e) {4}gA (f) {1,2,3}CA
InExercises6 through 9, writethesetintheform{x\ P(x)}, where P(x) isa property thatdescribestheelementsoftheset.
6. {2,4,6,8,10} 7. {a,e,i,o,u}
8.{1,8,27, 64,125} 9. {-2, -1,0,1, 2}
10.LetA= {1,2, 3,4, 5}.Whichofthefollowingsetsare equal toA?
(a) {4,1,2,3,5} (b) {2,3,4} (c) {1,2,3,4,5,6}
(d) {x | x isanintegerand x2< 25}
(e) {x | x isa positive integer and x <5}
(f) {x | x isapositiverational number and x<5}
11.Whichofthefollowingsetsaretheemptyset?
(a) {x | x isarealnumberand x2—1=0}
(b) {x | x isarealnumberand x2 +1=0}
(c) {* | x isarealnumberand x2 = —9}
(d) {x | x isareal number and x=2x + 1}
(e) {x | x isarealnumberand x—x + 1}
12.Listallthesubsets of [a,b].
13.Listallthesubsetsof {JAVA, PASCAL,C++}.
14.Listallthe subsets of {}.
15.Let A= {1, 2,5,8, 11}. Identifyeachofthefollowingas true or false.
(a) {5,1}CA (b) {8,1}gA
(c) {1,8,2,11,5} £ A(d) 0C A
(e) {1,6} £ A(f) {2}CA
(g) {3}£ A (h) AC {11,2,5,1,8,4}
16.LetA= {x | x isan integer and x2< 16}. Identify each ofthe following astrueorfalse.
(a) {0,1, 2,3}cA(b) {-3, -2, -1} cA
(c){}cA
(d) {x | x isan integer and \x\ <4}cA
(e) AC {-3,-2,-1,0, 1,2,3}
17.LetA= {1}, B ={1, a, 2, b, c}, C= {b, c}, D={a, b}, and E= {1, a, 2, b, c,d}. Foreachpart,replacethesym bol•witheithercor £ togiveatrue statement.
(a)A• B (b)0dA (c) BBC
(d) CD£ (e) D •C (f) BDE
InExercises18 through 20,findtheset of smallest cardinality thatcontainsthegivensetsassubsets.
18. {a,b,c}Aa,d,e,f),{b,c,e,g}
19. {1,2},{1,3},0
20. {2,4,6,...,20},{3,6,9,...,21}
21.Isitpossibletohavetwodifferent(appropriate)univer salsetsforacollectionofsets?Wouldhavingdifferent universalsetscreateany problems? Explain.
22.UsetheVenndiagraminFigure 1.3 toidentifyeachofthe following astrueorfalse.
(a)Ac B (b) B cA (c)C cz B
(d) x G B (e) x GA (f) y e B
Figure 1.3
23.UsetheVenndiagraminFigure 1.4 toidentifyeachofthe following astrueorfalse.
(a) KA (b) Ac C (c)Ca (d) w gA(e) t eA (f) weB
Figure 1.4
24.(a) Complete the following statement. A generic Venn diagram forasinglesethasregions.Describe them in words,
(b) Complete the following statement. A generic Venn diagram fortwosetshasregions.Describe them in words.
1.2 Operations on Sets 5
25.Completethefollowingstatement.AgenericVenndia gramforthreesetshasregions.Describethemin words.
26.(a) IfA = {3,7},findP(A).
(b) Whatis|A|? (c) What is |P(A)|?
27. If P(B) = {{ },{m},{/2}, {m,n}}, thenfind £.
28.(a)IfA= {3,7,2}, find P(A).
(b)Whatis| A|? (c)Whatis |P(A)|?
29.If P(B) = {{a},{ },{c},{fc,c}, {a, &},...} and \P(B)\ =8, then B= InExercises30 through 32,drawa Venn diagramthat repre sentstheserelationships.
30.Ac B, A cC, B £ C,andC g B
31. x GA, x G £, x <£ C, y G B, y GC,and y <£ A
32.Ac £, x £ A, * G £, A £ C, y G £, y GC
33. Describe allthe subset relationships thatholdforthesets givenin Example 3.
34. Show that if Ac B and B c C, then Ac C.
35. The statement about sets in Exercise 34 can be restated as"Anysubset of isalsoa subset of anysetthat contains "
36.SupposeweknowthatsetAhas n subsets, Si, S2,..., Sn. If set B consists of the elements of A and one more ele mentso |Z?| = IAI +1, showthat B musthave 2n subsets.
37.ComparetheresultsofExercises 12, 13,26,and28and complete the following: Anysetwithtwo elements has subsets.Anysetwiththree elements has subsets.
1.2 Operations on Sets
Inthissectionwewilldiscussseveral operations thatwill combine givensetsto yieldnewsets.Theseoperations,whichareanalogoustothefamiliaroperations ontherealnumbers,willplayakeyroleinthemany applications andideasthat follow.
If Aand B aresets,we define their union astheset consisting of all elements thatbelong toAor B and denote itbyAU B. Thus
AU B = {x \x e Aorx eB}.
Observe that xe AU B if xeA or xeB or x belongs to both A and B.
Example 1 LetA= {a, b, c, e, f] and B= {b, d, r, s}. Find AU B.
Solution
Since AU B consists of allthe elements that belong to either Aor B, AU B= {a, b, c,d, e, /, r, s}.
We can illustrate the union of twosets with aVenn diagram as follows. If A and B arethesetsin Figure 1.5(a),thenAU B istheset represented bythe shaded region in Figure 1.5(b).
(b)AUfi
1.5
IfAand B aresets,we define their intersection astheset consisting ofall elementsthatbelongtobothAand B anddenoteitbyAfl B. Thus
Afl B = {x | x gA and jc G 5}.
Example 2 Let A= {a, ft, c, e, /}, B = {ft, e, /,r, *}, and C= [a, t, w, u}. Find An fi, Afl C, and B fl C.
Solution
Theelementsft, e, and/aretheonlyonesthatbelongtobothAand B, soAHi?= {ft, e, /}. Similarly, AflC= {a}. Thereareno elements thatbelongtoboth B andC,so B flC={}.
Twosetsthathavenocommonelements,suchas B and C inExample2,are called disjoint sets.
WecanillustratetheintersectionoftwosetsbyaVenndiagramasfollows.If Aand B arethesetsgiveninFigure1.6(a),thenAfl B isthesetrepresentedby theshadedregioninFigure 1.6(b). Figure1.7 illustrates a Venn diagramfortwo disjoint sets.
(b)AHB
1.7
The operations of union and intersection can be defined for three or more sets in an obvious manner:
AU BUC={x | x GA or* G B orx g C] and
Afl B n C={x | x gAand xeB and xeC}.
The shaded region in Figure 1.8(b)isthe union of thesetsA, B, andC shown inFigure1.8(a),andtheshadedregioninFigure1.8(c)isthe intersection of the setsA, B, andC.NotethatFigure1.8(a)saysnothingaboutpossiblerelation shipsbetweenthesets,butallowsforallpossiblerelationships.Ingeneral,if Ai, A2,..., A„ aresubsetsof £/, then A\U A2 U•••U An willbedenotedby
Figure
Figure
M, <ffm^. U
$Mm lift!
wi0k ^•pf >W$i$\ \pC: m|:;v pfttSj lm^JWf W'W
(b)AU£UC (c) A n b nc
Q A*, read as, "the union from 1to n of Asub fc," and Ai DA2 H•••fl An will be denotedby P| A*, readas,"the intersection from1to n ofAsub /:."
Example 3 LetA= {1, 2, 3,4, 5,7}, B= {1, 3,8, 9}, and C= {1, 3,6, 8}. Then AHBDC isthesetofelementsthatbelongtoA, £, andC.ThusAfl B H C={1, 3}.
IfAand B aretwosets,wedefinethe complement of B with respect toAas thesetofallelementsthatbelongtoAbutnotto B, andwedenoteitbyA- B. Thus A- B={x | x GAandjc £ 5}.
Example 4 LetA= {a, 6, c) and £ = {6, c, J, e}. Then A- B= {a} and B-A = {d, e).
IfAand B arethesetsinFigure1.9(a),thenA- B and £ -Aarerepresented bytheshadedregionsinFigures1.9(b)and1.9(c),respectively.
A-B u ( A ( (c) B-A
If U isa universal setcontainingA,then [/ —Aiscalledthe complement of Aandis denoted byA.ThusA= [x \x £ A}.
Example 5 LetA= {x \x isan integer and * < 4} and U =Z. Then A= {x | x isan integer andjc>4}.
IfAisthesetinFigure1.10,itscomplementistheshadedregioninthatfigure. IfAand B aretwosets,wedefinetheir symmetric difference asthesetofall elementsthatbelongtoAorto B, butnottobothAand B, andwedenoteitby A© B. Thus
A © B=[x | (jc gAand jc £ B) or(jcG £ and x £ A)}.
Example 6 LetA = {«, ft, c, d] and £ = {a, c, e, /, g}. Then A® B= {b,d, e, /, g}.
(b)
1.10
IfAand B areasindicatedinFigure 1.11(a), theirsymmetricdifferenceisthe shadedregionshowninFigure 1.11(b). Itiseasytoseethat
A 0 B =(A -B) U (B- A).
THEOREM1
1.11
Algebraic Properties of Set Operations
The operations onsetsthatwehavejust defined satisfymany algebraic properties, someofwhichresemblethealgebraicpropertiessatisfiedbytherealnumbersand their operations. Allthe principal properties listedherecanbeprovedusingthe definitions given andthe rules of logic. We shallproveonlyoneofthe properties andleaveproofsofthe remaining onesas exercises forthereader. Proofs are fundamental to mathematics. WediscussprooftechniquesinChapter2,butinthis chaptersomeproofsare given as examples forlaterwork.Somesimpleproofsare required inthe exercises. Venn diagrams areoftenusefultosuggestorjustifythe method of proof.
The operations defined onsets satisfy the following properties: Commutative Properties
1. AUB = BUA
2. ADB = BHA
Associative Properties
3. A U (B UC)= (A U B) U C
4. A n (B n C) = (A n B) n c
Distributive Properties
5. A H (B U C) =(A fl B) U(An C)
6.AU (B fl C)=(AU B) n (AUC)
Figure
(a)
Figure
(b) A H B
Figure 1.12
THEOREM 2
Idempotent Properties
7. AUA=A
8. A fl A=A
Properties of the Complement
9. (A) =A
10. AUA= 17
11. Ar\A =0
12. 0= U
13. £/ =0
14. AU B=A fl B Properties 14and15are known as 15. ADA = AUfl De Morgan's laws.
Properties of a Universal Set
16. AU U=U
17. A H f/ =A
Properties of theEmptySet
18. AU0 = AorAU{ }=A
19.A H 0=0orA D {}={}
Proof
WeproveProperty14hereandleaveproofs of the remaining properties asex ercisesforthereader.A common style of proof for statements aboutsetsisto choose an element inone of thesetsandsee what weknow about it. Suppose that x € AU B. Thenwe know that x i A Ufl,so x £ A and x £ fl. JWhy?) This means x e_A HB (why?), soeachelementofAUfl belongs toAflfl.Thus AU B c AC) fl. Conversely, suppose that x e A D fl. Then x £ A and xjz fl (why?), so x fi AUfl, which means that x e AUfl. Thus each element of AH fl also belongs toAUfl,andA D fl c AUfl. Now wesee that AUfl=Aflfl.•
The Addition Principle
Suppose nowthatAandflarefinitesubsets of auniversalset U. Itisfrequently usefultohaveaformulafor|AU fl|, the cardinality of theunion. If Aandflare disjoint sets,thatis,ifAflfl= 0, theneach element of AUflappearsin either A or B, butnotinboth;therefore, |AUfl| =|A|+ |fl|.IfA andfloverlap,asshown inFigure1.12,thenelementsinAflflbelongtobothsets,andthesum \A\+\B\ countstheseelementstwice.To correct forthis double counting, wesubtract |A fl fl|. Thuswehavethefollowingtheorem, sometimes calledthe addition principle. Because ofFigure1.12,thisisalso called the inclusion-exclusion principle.
IfAandflarefinitesets,then|AUfl|= |A| + |fl| - |A n fl|. •
Example 7 LetA= {a, b, c, d, e] and fl= {c, e, /, h, k, m}. Verify Theorem 2.
Solution
We have AUfl= {a, b, c, d, e, f h, k, m] and Aflfl={c, e). Also, \A\ =5, |fl| =6,|AUfl|=9,and \A D fl| =2. Then |A| + |fl| -|A fl fl|=5+6-2 or 9 and Theorem 2 is verified.
ADB
Figure 1.13
IfAandflaredisjointsets, ADA =0and \A nfl|=0,sotheformulain Theorem2nowbecomes |AUfl| = |A|+ |fl|. Thisspecialcasecanbestatedin awaythatisusefulinavarietyofcountingsituations. Ifatask T\ canbeperformedinexactly n ways,andadifferenttask T2 canbe A n B n C performedinexactly m ways,thenthenumberofwaysofperformingtask T\ or task T2 is n +m.
ThesituationforthreesetsisshowninFigure 1.13. Westatethethree-set addition principle withoutdiscussion.
THEOREM 3 Let A, fl, and Cbe finite sets. Then \A UflU C\ = \A\ + \B\ + \C\ -|Anfl||fl n c| -|AnC|+|Anfln C|. • Theorem 3canbe generalized formorethanthreesets.Thisis done in Exer cises 50 and 51.
Example 8 Let A= {a,b, c, d, e}, fl= {a, b, e, g, /z}, and C= {b,d,e, g,h9k,m,n}. Verify Theorem 3.
Solution
Wehave AUBUC = (a,fe,c,rf, e, g, h, k, m, n}, A flfl= {a, b, e}, AflC= {6, d, e},BDC = {b, e, g, /*}, and AHflHC = {£, <?}, so \A\ =5, |fl| =5, \C\= 8, |AUflUC| =10, |AHfl| =3, |AHC| =3, |flnC|=4,and|AflflnC| =2. Thus |A|+|fl|+|C|-|Anfl|-|flnC|-|AnC|+|AnflnC| = 5+5+8-3-3-4+2 or 10, and Theorem 3is verified.
Example 9 A computer company wants to hire 25 programmers to handle systems program ming jobs and40 programmers for applications programming. Of thosehired,ten willbeexpectedtoperformjobsofbothtypes.Howmany programmers mustbe hired?
Solution
LetAbethesetofsystems programmers hiredandflbethesetof applications programmers hired.The company must have \A\= 25and |fl| =40,and \A fl fl I = 10. The number of programmers thatmustbe hired is|AUfl|,but|AUfl|= \A\ + IA|- IA fl fl|. Sothecompanymusthire25+40-10or55 programmers.
Example 10
Asurveyhasbeentakenonmethodsof commuter travel.Each respondent was askedto check BUS,TRAIN,or AUTOMOBILE asa major method of traveling towork. More thanone answer was permitted. The results reported wereasfol lows:BUS,30people;TRAIN,35people; AUTOMOBILE, 100people;BUSand TRAIN, 15people;BUSand AUTOMOBILE, 15 people; TRAIN and AUTOMO BILE,20people;andallthree methods, 5 people. Howmany people completed a survey form?
Solution
Let fl, 7\ andAbethesets of people who checked BUS, TRAIN, and AUTOMO BILE, respectively. We know |fl| = 30, \T\ =35, \A\= 100, |fl n T\= 15, |fl H A\= 15, \T H A\= 20,and |fl n T D A\ =5.So |fl| + \T\ + \A\ - |fl fl 7| - |fl nA|- |r nA|+ |fl n r nA|=30+35+ 100 -15-15-20+5or 120is IA UflU C|, the number of people who responded.
Bnc
1.2 Exercises
InExercises1through4,letU= [a, b, c, d, e, /, g, h, k], A = (fl,i,c,g), B= [d,e,f,g], C= [a,c,f], and D = [f,h,k}.
1. Compute
(a) AUB (b) flUC (c) A D C (d) flOD (e) (AUfl)-C (f) A-B (g)A(h) A 0 fl (i)Aec U) (Anfl)-c
2. Compute
(a) AUD (b) flUD (c) CflD (d) AHD (e) (AUfl)-(CUfl)
(f)fl-C(g)fl(h)C-fl (i) C0D (J) (Aflfl)-(flnD)
3. Compute (a)AUflUC (b) Anfl n c (c) AH(flUC) (d) (AUfl)HC (e) ATTfl (f) ATTfl
4. Compute
(a) AU0 (b) AUtf (c) flUfl (d) CH{ }(e) CUD (f) cTTd
In Exercises 5through8,letU= {1,2, 3,4,5,6,7,8,9}, A= {1,2,4,6,8}, fl= {2,4,5,9}, C={x\xisa posi tive integer andx2< 16}, andD = {7, 8}.
5. Compute
(a) AUfl (b) AUC (d) flUC (e) AC\C (g) flHC (h) COD
6. Compute
(a) A-B (b) fl-A (d) C (e)A (g) C0D (h) flee
7. Compute
(c) AUD (f) AflD (c) C-D (f) A0fl
(a) AUflUC (b) AflflflC (c) Afl(flUC) (d) (AUfl)DD
(e) AUfl
8. Compute (a) flUCUD
(c) AUA
(e) AUA (f) AOfl
(b) flOCHD (d) ADA (f) AC)(CUD)
InExercises9and 10, letU= {a,b,c, d,e, f,g,h], A= {a, c, /, g},B= {a, e], and C = [b, h}.
9. Compute (b) B (e) U
(a) A (d) ADB (c) AUB (1) A-B
10. Compute (a) AOfl (d) enc
1.2
(b) flUC (e) A0fl (c) AUA (f) flee
11.Let t/ betheset of real numbers, A= {x\x isa solution of jc2 -1=0},andfl= {-1,4}. Compute (a)A(b)fl(c) AUfl (d) ATTfl
InExercises12and13,refertoFigure1.14.
Figure 1.14
12. Identify the following astrueorfalse. (a) yeA fl fl(b) xeB UC (c) weB fl C (d) u$C
13. Identify the following astrueorfalse. (a)jcGAflflnC (b) yeAUBUC (c) z € A n C (d) v € fl 0 C
14. Describe the shaded region shownin Figure 1.15using unions and intersections of the sets A, fl, and C. (Several descriptions are possible.)
Figure 1.15
15. Let A,fl, and Cbe finite sets with \A\ = 6, |fl| =8, \C\ =6,|AUflU C| =11,|A D fl|=3,|An C| =2, and |fl fl C\= 5. Find |Aflfln C|.
/n Exercises 16through18, verify Theorem2 for the given sets.
16. (a) A= {1,2, 3,4}, fl= {2,3,5, 6,8}
(b)A= {l,2,3,4},fl = {5,6,7,8,9}
17.(a) A= {a,b,c,d9e,f},B = {a,c,f,g,h,i,r}
(b) A = {a,b,c,d,e}9 fl= {/, g, r, s, f, «}
18.(a)A= {jc | x isa positive integer <8}, fl= {^ |jcisan integer such that 2< x<5}
(b)A= {jc | jc isa positive integerand jc2 < 16}, fl= {jc | jc isanegativeintegerand jc2 < 25}
