离散数学英文讲义：7-6 Partial Ordering.pptVIP

Definition 1 A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set S together with a partial ordering R is called a partial ordered set, or poset, and is denoted by (S,R). Examples 1、“greater than or equal” relation (≥) is partial ordering on the set of integer. 2、“divisibility relation” ( | ) is a partial ordering on the set of positive integer. 3、”inclusion relation” ( ? ) is a partial ordering on the power set of a set S. Definition 2 The elements a and b of a poset (S,≤) are called 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 incomparable. In poset (Z+, | ) are the integers 3 and 9 comparable? Are 5 and 7 comparable. Definition 3 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 a linear order. A totally ordered set is also called a chain. (Z,≤) is totally ordered, but (Z+, | ) is not. Definition 4 (S,≤) is well-ordered set if it is a poset such that ≤ is a total ordering and such that every nonempty subset of S has a least element. (Z+ x Z+, ≤ ) is well ordered. Theorem 1 The principle of well-ordered induction Suppose that S is well-ordered set. Then P(x) is true for all x ? S, if: BASIS STEP: P(x0) is true for the least element of S, and INDUCTION STEP: For every y ? S if P(x) is true for all x y, then P(y) is true. The lexicographic ordering (a1, a2) (b1, b2) Either if a1 b1 or if both a1 = b1 and a2 b2 (3,5) (4,8) (3,8) (4,5) (4,9) (4,11) (1,2,3,5) (1,2,4,3) discreet discrete discreet discreetness Lexicographic Order (1,7) (2,7) (3,7) (4,7) (5,7) (6,7) (7,7) (1,6) (2,6) (3,6) (4,6) (5,6) (6,6) (7,6) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5) (7,5) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4) (1,3) (2,3) (3,3) (4,3) (5,3) (6,3) (7,3) (1,2) (2,2) (3,2) (4,2) (5,2) (6,2) (7,2) (1,1) (2,1) (3,1) (4,1) (