- #1
evinda
Gold Member
MHB
- 3,836
- 0
Hello! (Smile)
Let $(A, \leq)$ be an ordered set.
We say that $a \in A$ is:
The converse of the above does not hold, in general.Could you explain me why the converse does not hold? (Thinking)
Let $(A, \leq)$ be an ordered set.
We say that $a \in A$ is:
- minimal, when it does not exist in $A$ an element that is previous of $a$ and different from it, i.e. $(\forall x \in A)(x \leq a \rightarrow x=a)$
$$$$ - maximal, when it does not exist in $A$ an element that is next of $a$ and different from it, i.e. $(\forall x \in A)(a \leq x \rightarrow a=x)$
$$$$ - minimum when $(\forall x \in A) a \leq x$
$$$$ - maximum when $(\forall x \in A) x \leq a$
- If $a$ is minimum in $A$ then it is also minimal.
- If $a$ is maximum in $A$ then it is also maximal.
The converse of the above does not hold, in general.Could you explain me why the converse does not hold? (Thinking)