search
Log In
0 votes
75 views
If X is minimum element of S then X is related to y for all y belongs to S. Let [S;R] be a poset. If every non empty subset of S has a minimum element then
a) S is Totally ordered set

b) S is bounded set.
C)  S is complemented lattice
d) S is boolean algebra.
Can anyone explain the exact meaning of question and what the answer would be?   Thanks in advance..
Ps:  what I understood from question is if X is minimum element then X will be part of every subset of S like if 1 is Min element in the set then 1 will be part of every non empty subset of S. Is this correct way of interpreting the question. If not can you please elaborate it
in Set Theory & Algebra 75 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
439 views
Let $A=\left \{ 1,2,3 \right \}$. A relation $R$ on $A\times A$ is defined by $\left ( a,b \right )R\left ( c,d \right )\Leftrightarrow \left ( “a\leq c “and” b\leq d “\right )$ S1:$R$ partial order S2: The poset $\left [ A\times A:R \right ]$ is a lattice Among S1 and S2 which one is true?
asked Feb 27, 2019 in Set Theory & Algebra srestha 439 views
0 votes
2 answers
2
104 views
A ____ can be used to prevent a user program from never returning control to the operating system.
asked Aug 27, 2018 in Operating System Kartavya Kothari 104 views
0 votes
1 answer
3
210 views
They have given answer B , but after running this program getting runtime error. Please explain
asked Jun 6, 2018 in Programming Shankar Kakde 210 views
1 vote
1 answer
4
218 views
Why it is that if we can list the element of set in a sequence then it is countable? I mean how it can be a necessary and sufficient condition for a set to be Countable.Because we can provide sequence no to any set.Cann't we?And how can an infinity set be countable, as it is already infinity?
asked Jul 27, 2016 in Set Theory & Algebra Sarvottam Patel 218 views
...