Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have come across this problem in my discrete mathematics class and I have no clue how to go about it since I haven't dealt with upper bounds before in sets. If anyone could help me out, I'd greatly appreciate it.

In the special case S = {1, 2, 3, 4}, there exists two sets A,B that are elements of P(S) such that {A,B} has no upper bounds.

share|cite|improve this question

You need to specify your ordering. It seems safe to assume that you mean membership (i.e. $A \leq B \Leftrightarrow A \subseteq B$). In that case it seems like there are many sets $A,B$ that satisfy the condition that $A,B \in P(S)$ and $\{A,B\}$ has no upper bounds. For instance $A = \{1\}$ and $B = \{2\}$.

share|cite|improve this answer

What order are you considering? The natural one would be to order the subsets by inclusion. In this case, $S$ is an upper bound for $P(S)$. But if $A$ and $B$ are elements of $P(S)$, then $\{A,B\}$ looks something like $\{\{2\},\{3\}\}$ and is not in $P(S)$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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