Scribd Logo
Upload

Welcome to Scribd!

  • Discrete Notes

    Uploaded by

    Muhammad Shoaib
    5 views6 pages
    Notes

    Original Title

    discrete notes

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Notes

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    5 views6 pages

    Discrete Notes

    Uploaded by

    Muhammad Shoaib
    Notes

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 6
    6:36 AM | 0.5KB/s A @ G i stl G2 € Discrete mathematics... Q @ : 63. Disprols, Algebraic Profs, and Bockan Algebras 369 Problem-Solving Strategy How can you discover whether a given universal statement about sts is truc or false? ‘There are two basic approaches: the optimistic and the pessimistic. In the optimistic approach, you simply plunge in and start trying to prove the statement, asking yourself, “What do T need to show” and “How do I show it?” In the pessimistic approach, you start by searching your mind for a set of conditions that must be Fulfilled to construct & counterexample. With either approach you may have clea sailing and be immediately successful or you may run into difficult. The trick is to be ready to switeh to the other approach ifthe one you are trying does not look promising. For more difficult questions, you may alternate several times between the two approaches before arriving atthe correct The Number of Subsets of a Set ‘The following theorem states the important fact that if a set has n elements, then its power sot has 2" elements. The proof uses mathematical induction and is based on the following observations. Suppose X isa set and z isan element of X. 1. The subsets of X can be split into two groups: those that do not contain z and those that do contain z. 2. The subsets of X that do not contain z are the same as the subsets of X — (2). 3. The subsets of X that do not conti an be matched up one for one with the subsets ‘of X that do contain z by matching each subset A that does not contain z to the subset ‘AU {z} that contains z. Thus there are as many subsets of X that contain z as there are ‘subsets of X that do not contain z. For instance, if X = {x y. 2} the following table shows the correspondence between subsets of X that do not contain z and subsets of X that contain z ‘Theorem 6.3.1 Forall integers» > ‘set X has n elements, then %(X) has 2" elements, Proof (by mathematical induction): Let the property P(n) be the sentence ‘Any set with n elements has 2" subsets ~Pw ‘Show that P(O) is true: ‘To establish P(0), we must show that Any set with O elements has 2” subsets. = P40) continaed on = © partial ord aaites KY is not older than x. That is if Ry, then y x. The relation Rs transitive because if person x is older than person y and y is older than person z, then x is older than z. That is f xy and yRz, then xRz. However, R isnot reflexive, because no person is older than himself or herself. That is, x Rx for ll people x. It follows that isnot a paiaoering. < Indifferent posets different symbols such as <, C, and | re used for ng. laste we ml syed tn we car we ice deus in rch ees arbitrary pose. Customarily the notation a ~ bis used to denote tha (a,b) ¢ R inan arbitrary poset (S. 8). This notation is used because the “ess than or equal 1” relation on the st of real numbers isthe most familar example of ing andthe symbol = is similar tothe = sym (Note that the symbol ~ is used to denote the relation in any poset, not just the “less than or equals” elation.) The notation a < b denotes tata < B but #. Also, We say “ais less than b” of “bis greater than a” ifa

    You might also like