离散数学杨争锋ch076.pptxVIP

(2) Examples (a) Example 1 (page 566) Show that the “greater than or equal” relation (≥) is a partial ordering on the set of integers. Solution: reflexive??? antisymmetric??? Transitive??? 牛牛文库文档分享 (b) Show that the divisibility relation | is a partial ordering on the set of positive integers. Solution: reflexive??? antisymmetric??? transitive??? 牛牛文库文档分享 (c) Show that the inclusion relation ? is a partial ordering on the power set of a set S.Solution: reflexive??? antisymmetric??? transitive??? 牛牛文库文档分享 (3) Notations ≤ and (花写) In a poset the notation a≤b denotes that (a,b)∈R Note that the symbol ≤ is used to denote the relation in any poset, not just the “less than or equal” relation. The notation ab denotes that a≤ b, but a≠b. 牛牛文库文档分享 (4) Remark (备注): When a and b are elements of the posets (S, ≤), it is not necessary that either a≤b or b≤a. For example, (a) In (P(Z), ?), {1,2} is not related to {1,3}. (b) In (Z, |), 2 is not related to 3 and 3 is not related to 2. 牛牛文库文档分享 (5) Definition (page 567) The elements a and b of a poset (S,≤) are comparable if either a≤b or b≤a. When a and b are elements of S such that neither a≤b nor b≤a, a and b are called 牛牛文库文档分享 (6) Example 6 In the poset (Z+, |), are the integers 3 and 9 comparable? Are 5 and 7 comparable? Solution: It is very 牛牛文库文档分享 (7) Remark: The adjective “partial” is used to describe partial ordering since pairs of elements may be imcomparable. When every two elements in the set are comparable, the relation is called a total 牛牛文库文档分享 (8) Definition 3 (page 568) If (S,≤) is a poset and every two elements of S are comparable, S is called a totally ordered or linearly ordered set, and ≤ is called a total order or linear order. A totally ordered set is also called a 牛牛文库文档分享 (9) Examples (a) Example 5 The poset (Z, ≤) is the totally ordered function, since a≤b or b≤a whenever a and b are integers. (b) Example 6 The poset (Z+, |) is not totally ordered since it contains elements that are incom