Proving Lattice Property in Dual Posets: A Discrete Math Question

Click For Summary
SUMMARY

The discussion focuses on proving that if a poset (S, R) is a lattice, then its dual poset (S, R^-1) is also a lattice. The proof utilizes the definitions of supremum and infimum in the context of posets, demonstrating that the conditions for these properties hold when the relation is inverted. Specifically, the supremum in (S, R) corresponds to the infimum in (S, R^-1) and vice versa. This relationship is illustrated using the power set of a set X, where inclusion and containment relations are analyzed.

PREREQUISITES
  • Understanding of posets and their properties
  • Familiarity with lattice theory and definitions of supremum and infimum
  • Knowledge of dual posets and relation inversion
  • Basic concepts of set theory, particularly power sets
NEXT STEPS
  • Study the definitions and properties of lattices in discrete mathematics
  • Learn about dual posets and their significance in order theory
  • Explore examples of supremum and infimum in various posets
  • Investigate applications of lattice theory in computer science and data structures
USEFUL FOR

Mathematicians, computer scientists, and students studying discrete mathematics, particularly those interested in order theory and lattice structures.

socratesg
Messages
1
Reaction score
0
I have a question from hw, the question is stated "Show that if the poset (S,R) is a lattice then the dual poset (S,R^-1) is also a lattice"

I know by Rosen theory that the dual of a Poset is also a poset but how can i prove that it is also a lattice, what def. am i missing. Any help would be greatly apprieciated.
 
Physics news on Phys.org
By using the fact (S, R) is a lattice, presumably.
 
I'm seeing all this stuff for the first time, so don't mind the detail. (S,R) is a lattice iff for each pair of elements {a,b} in S, there is an element of S denoted supR{a,b} satisfying:

1) aRsupR{a,b}, bRsupR{a,b}
2) if s in S satisfies aRs and bRs, then supR{a,b}Rs

and an element of S denoted infR{a,b} satisfying:

1) infR{a,b}Ra, infR{a,b}Rb
2) if s in S satisfies sRa and sRb, then sRinfR{a,b}

I assume that R-1 is defined by aR-1b iff bRa. If so, then we want to show that for every pair {a,b} contained in S, there is a supremum and infimum with respect to R-1. Let's go back to the supremum in (S,R), and rewrite the conditions. So:

1) aRsupR{a,b}, bRsupR{a,b}
2) if s in S satisfies aRs and bRs, then supR{a,b}Rs

becomes

1) supR{a,b}R-1a, supR{a,b}R-1b
2) If s in S satisfies sR-1a and sR-1b, then sR-1supR{a,b}

So supR{a,b} satisfies precisely the conditions required for it to be an infimum of {a,b} with respect to R-1. So if (S,R) is a lattice, then for every pair {a,b}, there is a supremum s and infimum i with respect to R. (S,R-1) is a lattice because for each {a,b} there is a supremum with respect to R-1, that being the infimum with respect to R, namely i, and there is an infimum with respect to R-1, that being the supremum with respect to R, namely s.

A good way to think of this is to think of S being the power set of some set X, and R being inclusion [itex]\subseteq[/itex]. Then sup{a,b} = [itex]a \cup b[/itex] and inf{a,b} = [itex]a \cap b[/itex]. R-1 would be containment, [itex]\supseteq[/itex] and clearly you can see why when we switch the relation around, the intersection plays the role of the union, and the union plays the role of the intersection.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K