edited by
387 views
2 votes
2 votes
  1.  

Which of the above is a lattice :

  1. b and c
  2. a and d
  3. b and d
  4. a only
edited by

2 Answers

Best answer
3 votes
3 votes

Lattice : A partially ordered set in which every pair of elements has both a least upper bound and a greatest lower bound is called as lattice.

Upper Bound: An element which is greater than or equal to all the element in a subset is called upper bound of that subset.
Lower Bound: An element which is less than or equal to all the element in a subset is called lower bound of that subset.

Least Upper Bound : An element x is called the least upper bound of a pair (a,b) If x is an upper bound that is less than every other upper bound of (a, b).
Greatest Lower Bound : An element x is called the greatest lower bound of a pair (a, b). If x is a lower bound that is greater than every lower bound of (a,b).

 


In A, element 2 and 3 doesn't have least upper bound. Upper bound of 2 and 3 are 4, 5 and 6 But none of them is least upper bound. 6 is greater than 4 and 5. But 4 and 5 are not comparable. So we don't know which is less.

Similarly in D, 2 and 3 doesn't have Least upper bound. Upper bound of 2 and 3 are 7, 6 and 8.
 4 and 5 are not upper bound of 2 and 3. Because 2 and 5 are not comparable we don't know which is greater. Similarly between 3 and 4 we don't know which one is greater. Among 6, 7 and 8, 8 is greater than 6 and 7. But 6 and 7 are not comparable. So again we don't have least upper bound.

For B and C, we have greatest lower bound and least upper bound for every pair of element so they are lattices.

More ever Least upper bound and greatest lower bound for a subset is unique if exist.

edited by
0 votes
0 votes
In both a and d, the lower pair of incomparable elements have no LUB.

(A cross in a supposed lattice almost always causes an issue)
Answer:

Related questions

5 votes
5 votes
2 answers
1
Bikram asked May 24, 2017
567 views
Let $S$ be the set $\{1,2,3, \dots ,8\}$. Let $n$ be the number of sets of two non-empty disjoint subsets of $S$. The value of $n$ is _______.
5 votes
5 votes
1 answer
2
Bikram asked May 24, 2017
477 views
Total number of ways we can fill a $4 \times 4$ matrix by $0$ and $1$’s such that every row and column contains odd no of $0$'s and $1$'s is ________.
2 votes
2 votes
1 answer
3
Bikram asked May 24, 2017
218 views
What is the solution of the following recurrence relation? $a_n = 6.a_{n-1} - 9.a_{n-2}$ Base cases : $a_0 = 1$ and $a_1 = 6$.$3n$$2.3n$$3n + n.3n$$3n - n.3n$
3 votes
3 votes
1 answer
4
Bikram asked May 24, 2017
275 views
$O(G) = 12$ and $G$ is cyclic. The total number of generators possible in $G$ are __________.