Glam Prestige Journal

Bright entertainment trends with youth appeal.

$\begingroup$

Let β„™(𝑆) be the collection of all subsets of 𝑆, and β„š(𝑆) the collection of all proper subsets of 𝑆.

Which of the following hold for every set 𝑆?

β„™(𝑆) βŠ† β„š(𝑆)
β„™(𝑆) βŠ‡ β„š(𝑆)
β„™(𝑆) βŠƒ β„š(𝑆)
β„™(𝑆) = β„š(𝑆)


What's exactly wrong with this thought process?

If 𝑆 = {1,2,3}, then

β„™(𝑆) = {βˆ…,{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}

β„š(𝑆) = {βˆ…,{1},{2},{3},{1,2},{1,3},{2,3}}

β„™(𝑆) βŠ† β„š(𝑆) false. β„™(𝑆) is not a subset of β„š(𝑆)

β„™(𝑆) βŠ‡ β„š(𝑆) false. β„™(𝑆) is not a superset of β„š(𝑆)

β„™(𝑆) βŠƒ β„š(𝑆) true. β„™(𝑆) is a proper superset of β„š(𝑆), and β„š(𝑆) is not equal to β„™(𝑆)

β„™(𝑆) = β„š(𝑆) false. β„™(𝑆) and β„š(𝑆) sets are not subsets of each other.

$\endgroup$ 7

2 Answers

$\begingroup$

The notation $A\subseteq B$ is usually defined as $A\subset B$ or $A=B$. If one of the two things $A\subset B$ or $A=B$ is true, then $A\subseteq B$ must be true as well. Therefore it is impossible that $\Bbb P(S)\supseteq \Bbb Q(S)$ is false when $\Bbb P(S)\supset \Bbb Q(S)$ is true.


Apart from that, your reasoning has another error: you don't need an example set (in your case you use $S=\{1,2,3\}$) to show whether the assertions are true or false. In fact, you shouldn't use an example in a proof, since you then just prove a single special case, instead of a general principle. Of course examples are useful to gain intuition, and I highly encourage to first work out a few examples before you start proving something. But for the proof itself, you have to keep things general.

To show the assertions in a general case, we note that for any set $S$, the set $S$ itself is a subset of $S$ that is not proper. This follows from the definition of what a proper subset is. Furthermore, we know that any proper subset is also a subset (once again by definition of proper subset).

  • $\Bbb P(S)\not\subseteq \Bbb Q(S)$, since the set $S$ is an element of $\Bbb P(S)$ that is not a subset of $\Bbb Q(S)$.
  • $\Bbb P(S)\supseteq\Bbb Q(S)$, since any proper subset is also a subset.
  • $\Bbb P(S)\supset\Bbb Q(S)$, since the set $S$ is an element of $\Bbb P(S)$ that is not an element of $\Bbb Q(S)$, therefore $\Bbb P(S)\neq \Bbb Q(S)$. By the previous point $\Bbb P(S)\supseteq \Bbb Q(S)$, and remember that $\supseteq$ is defined as "$\Bbb P(S)\supset \Bbb Q(S)$ or $\Bbb P(S)= \Bbb Q(S)$". Since the latter is false, the former must be true.
  • $\Bbb P(S)\neq \Bbb Q(S)$, as we saw because $S$ is an element in $\Bbb P(S)$ and not in $\Bbb Q(S)$.
$\endgroup$ $\begingroup$

According to my point of view, if we take a same example If 𝑆 = {1,2,3}, then

β„™(𝑆) = {βˆ…,{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}

β„š(𝑆) = {βˆ…,{1},{2},{3},{1,2},{1,3},{2,3}}

False -> β„™(𝑆) βŠ† β„š(𝑆) , β„™(𝑆) is not a subset of β„š(𝑆)

True -> β„™(𝑆) βŠ‡ β„š(𝑆) , Because Q(S) is a subset of P(S)e.g Q(S) βŠ† P(S), So that`s why P(S) is a superset of Q(S) e.g P(S) βŠ‡ Q(S)

True -> β„™(𝑆) βŠƒ β„š(𝑆) , β„™(𝑆) is a proper superset of β„š(𝑆), and β„š(𝑆) is not equal to β„™(𝑆)

False -> β„™(𝑆) = β„š(𝑆) , β„™(𝑆) and β„š(𝑆) sets are not subsets of each other.

$\endgroup$

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

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