8.6-relations.pptVIP

* * College of Computer Science Technology, BUPT Example * * College of Computer Science Technology, BUPT Theorem If (L1, ≤) and (L2, ≤) are lattices, then (L, ≤) is a lattice, where L = L1×L2 the partial order ≤ of L is the product partial order. * * College of Computer Science Technology, BUPT Proof We denote the join and meet in L1 by ∨1 and∧1, respectively, and the join and meet in L2 by ∨2 and ∧2, respectively. Then L is a poset. We now need to show that if (a1, b1) and (a2, b2)?L, then (a1, b1)∨(a2, b2) and (a1, b1)∧(a2, b2) exist in L. We leave it as an exercise to verify that (a1, b1)∨(a2, b2) = (a1 ∨1 a2, b1 ∨2 b2) (a1, b1)∧(a2, b2) = (a1 ∧1 a2, b1 ∧2 b2). Thus L is a lattice. * * College of Computer Science Technology, BUPT Example L1 L2’ =L1 ? L1 L2 L= L1? L2 11 01 12 02 a b (11 ,11) (01 ,01) (01 ,11) (11 ,01) (11 ,12) (01 ,02) (11 ,a) (01 ,a) (11 ,b) (01 ,b) (01 ,12) (11 ,02) * * College of Computer Science Technology, BUPT Sublattice（子格） Let (L, ≤) be a lattice. A nonempty subset S of L is called a sublattice of L if a∨b ? S and a∧b?S whenever a ? S and b ? S. * * College of Computer Science Technology, BUPT Sublattice Example : (Dn, |) is a sublattice of (Z+, |) Example * * College of Computer Science Technology, BUPT Isomorphic Lattices（同构格） If f: L1?L2 is an isomorphism from the poset (L1, ≤1) to the poset (L2, ≤2) L1 is a lattice if and only if L2 is a lattice. If a and b are elements of L1, then f(a∧b) = f(a) ∧ f(b) f(a∨b) = f(a) ∨ f(b). If two lattices are isomorphic, as posets, we say they are Isomorphic Lattices. * * College of Computer Science Technology, BUPT Properties of Lattices Recall the meaning of a∨b and a∧b: a ≤ a∨b and b ≤ a∨b ; a∨b is an upper bound of a and b. If a ≤ c and b ≤ c , then a∨b ≤ c; a∨b is the least upper bound of a and b. a ∧ b ≤ a and a ∧ b ≤ b ; a ∧ b is an lower bound of a and b. If c ≤ a and c ≤ b, then c ≤ a ∧ b; a ∧ b is the greatest lower bound of a and b. * * College of Computer S