• edited by
9,279 views
18 18 votes

Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in  L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true?

  1. $L$ is a poset

  2. $L$ is a Boolean algebra

  3. $L$ is a lattice

  4. None of the above

4 Answers

Best answer
23 23 votes

Which of the following is/are true? This is question with Multiple answers.

As our Relation $R$ on Set $L$ is Reflexive , anti symmetric & Transitive it is poset.

Since $\text{LUB}$ & $\text{GLB}$ exists for any two elements it is lattice.

Answer: $A$ & $C$.

$B$ is not guaranteed to be true.

Ref: http://uosis.mif.vu.lt/~valdas/PhD/Kursinis2/Sasao99/Chapter2.pdf

• edited by
6 6 votes

it is given that set with a relation Relation R which is transitive, antisymmetric and reflexive so it is already a poset .Additionally, it is guaranteeing about the existence  of LUB and GLB too.so now it is  : Poset + Having lub and Glb both , That is Lattice . so option A and C both r true .

For being option B true it needs some extra information that is :

A lattice can be Boolean Algebra only  when It is distributed lattice , complimented lattice and bounded lattice along with it will have to satisfy the properties of Boolean algebra . and we dont have any such info about this lattice .

counter of B is :

  it is poset, lattice but not B.A

1 1 vote
As it is Reflexive , anti-symmetric , transitive , it is poset.

Since lub and gub exist for any pair of elements, the poset becomes a lattice. So, C is the answer.
1 1 vote
The answer is a and c. because in the question it is given that LUB and GLB exists and by definition LUB and GLB are always unique. If it is not unique that we can say that LUB and GLB does not exist. It is not required to mention explicitly the word unique.
Answer:
Position:
Show:

Related questions

43 43 votes
6 answers 6 answers
17.2k
17.2k views
Kathleen asked Sep 23, 2014
17,194 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
27 27 votes
6 answers 6 answers
6.6k
6.6k views
Kathleen asked Sep 23, 2014
6,590 views
Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof:“From xRy, using symme...
35 35 votes
5 answers 5 answers
15.3k
15.3k views
Kathleen asked Sep 23, 2014
15,304 views
The number of binary relations on a set with $n$ elements is:$n^2$$2^n$$2^{n^2}$None of the above
17 17 votes
3 answers 3 answers
6.8k
6.8k views
Kathleen asked Sep 23, 2014
6,768 views
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$.Show that $|aH| = |bH|.$Show that for every pair of elem...