1
$\begingroup$

This is a follow up question to one I posted earlier. I'm trying to decide that if for $(S,\preceq)$ a partially ordered set and $E\subseteq S$, one has $L(E)=\langle s]$ for some $s\in S$ iff $\inf E$ exists, and in particular, $L(E)=\langle\inf E]$.

I'm simply curious about showing that $L(E)\subseteq\langle\inf E]$ when $\inf E$ exists. Taking some $x\in L(E)$, if $x$ is comparable to $\inf E$, then $x\preceq\inf E$, and so $x\in\langle\inf E]$. But what if $x$ and $\inf E$ are not comparable? Is it still possible to show such an inclusion?

Edit: $\langle s]$ is the set {$x\in S \ | \ x\preceq s$}.

  • 0
    Good, that is what I guessed. Thanks for clarifying.2010-09-08

1 Answers 1

3

If I correctly understand your question, it boils down to whether $\inf E$ is "larger" than or equal to every lower bound of $E$. Isn't this the definition? A greatest lower bound of a set must be, by definition, comparable to and "larger" than (or equal to) every lower bound.

I think the confusion arises because, as seen in your last question, having an inf does not imply that the set of lower bounds is totally ordered. It does imply, however, that all lower bounds are comparable to the inf.

So the answer is yes: If $E$ has an inf, then $L(E)=\langle \inf E]$. Anything smaller than a lower bound is also a lower bound, which gives the right to left inclusion. The other inclusion follows from the fact that $\inf E$ is the "greatest" lower bound.

  • 0
    @yunone: You're welcome. I might have better answered the previous question by explicitly mentioning this.2010-09-08