3
$\begingroup$

A partially ordered set $\langle P,\leq\rangle$ is separative iff it satisfies the following condition: \[ \neg x\leq y\Rightarrow\exists z(z\leq x\wedge z\bot y) \] where: \[ x\bot y\iff\neg\exists z(z\leq x\wedge z\leq y). \] If $\langle B,\leq\rangle$ is a complete Boolean lattice (every subset of $B$ has supremum), then $B^+=B\setminus\{0\}$ is separative.

My question is: what if $B$ is not complete? Is it separative or does not have to be separative?

$\endgroup$
5
$\begingroup$

Recall that $\lnot x\leq y$ is the same as saying that $x\cdot y\neq x$. Let $z=x\cdot\bar y$ (where $\bar y$ is the complement of $y$).

Then $z\leq x$, and of course $z\leq\bar y$. But also $z\cdot y=x\cdot\bar y\cdot y=x\cdot 0=0$. Therefore $z\perp y$ as wanted.

| cite | improve this answer | |
$\endgroup$
  • 1
    $\begingroup$ Thanks a lot for a quick response! $\endgroup$ – Mad Hatter Oct 25 '13 at 12:27

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.