# Thread: Power set of B

1. ## Power set of B

Is there such an expression as $\displaystyle \forall B \mathcal,{P}(B)$?

It's very hard for me imagine there would be more than one $\displaystyle B$ in $\displaystyle \mathcal{P}(B)$.

2. Originally Posted by novice
Is there such an expression as $\displaystyle \forall B \mathcal,{P}(B)$?
It's very hard for me imagine there would be more than one $\displaystyle B$ in $\displaystyle \mathcal{P}(B)$.
Can you possibly fill out that question with more details?

Is it just $\displaystyle \mathcal{P}(B)=\{Y:Y\subseteq B\}~?$
If $\displaystyle B$ has n elements the $\displaystyle \mathcal{P}(B)$ has $\displaystyle 2^n$ elements.

3. Originally Posted by Plato
Can you possibly fill out that question with more details?

Is it just $\displaystyle \mathcal{P}(B)=\{Y:Y\subseteq B\}~?$
If $\displaystyle B$ has n elements the $\displaystyle \mathcal{P}(B)$ has $\displaystyle 2^n$ elements.
$\displaystyle \forall B \in \mathcal{P}(B)(A \subseteq B)$

Could it be a typo?

Does $\displaystyle \{Y:Y\subseteq B\}$ mean $\displaystyle \forall Y \in \mathcal{P}(B)(Y \subseteq B)$

4. Originally Posted by novice
Is there such an expression as $\displaystyle \forall B \mathcal,{P}(B)$?
I don't recognize that as a meaningful formula.

What is it that you're trying to say there?

5. Originally Posted by novice
$\displaystyle \forall B \in \mathcal{P}(B)(A \subseteq B)$
That's a formula, though it's an odd one. It seems not what you intend.

What you probably mean is

$\displaystyle \forall A \in \mathcal{P}(B)(A \subseteq B)$

Originally Posted by novice
Does $\displaystyle \{Y:Y\subseteq B\}$ mean $\displaystyle \forall Y \in \mathcal{P}(B)(Y \subseteq B)$
No.

$\displaystyle \{Y:Y\subseteq B\}$

is a term; it's a "name"; it names a particular set; it doesn't make an assertion.

$\displaystyle \forall Y \in \mathcal{P}(B)(Y \subseteq B)$

is not a term, but rather it's a formula; it makes an assertion (once we agree on what 'B' stands for, or, alternatively, once we decide it should be taken in the sense of a universal generalization on 'B').

You very much need to get that logic book I recommended, as soon as possible; it will get you on the right track to writing correct symbolizations.

6. Originally Posted by MoeBlee
I don't recognize that as a meaningful formula.

What is it that you're trying to say there?
I am supposed to provide an example of a set $\displaystyle A$ that satisfies$\displaystyle \forall B P(B)(A\subseteq B)$.

$\displaystyle A= \varnothing$ seems to fit the expression, but I know there is only one $\displaystyle B$ in $\displaystyle P(B)$

If B={1,2}, P(B)={$\displaystyle \varnothing$ {1},{2},B}. I wondering why $\displaystyle \forall B$ is used. It doesn't make sense.

7. Originally Posted by MoeBlee
You very much need to get that logic book I recommended, as soon as possible; it will get you on the right track to writing correct symbolizations.
It's coming my way.

8. Originally Posted by novice
$\displaystyle A$ that satisfies$\displaystyle \forall B P(B)(A\subseteq B)$.
I don't recognize that as a formula. Yes, it doesn't make sense. I can't find an A that satisfies it, because it's not even a formula.

The earlier formula you gave was

$\displaystyle \forall B \in \mathcal{P}(B)(A \subseteq B)$

That is equivalent to:

For all B (If B is a subset of B, then A is subset of B).

An A that satisfies that is B itself, or any other A that is a subset of B, depending on what B is.

Though maybe you've not rendered the formula correctly (it is rather odd)?

9. It surely is a typo of some sort.
I know of several books that use this notation, $\displaystyle P(B:A)$.
It stands for $\displaystyle A\in P(B)$ and $\displaystyle P(B:A)=\{X\in P(B):A\subseteq X\}$.
All subsets of B that have A as a subset.

Is that close to what you think it may mean?

10. Thank you both. I am going scrape off everything I got so far and study logic first to rebuild it from ground up.

11. Originally Posted by novice
It's coming my way.
You'll enjoy it. You're doing the right thing.