High School How does r∪(-p∩q∩-r) simplify to r∪(-p∩q) ?

  • Thread starter Thread starter SamRoss
  • Start date Start date
  • Tags Tags
    rules simplify
Click For Summary
The expression r∪(-p∩q∩-r) simplifies to r∪(-p∩q) by applying the associative and distributive laws of set theory. The key step involves recognizing that r∪-r equals the universal set U, allowing the expression to simplify to r∪(-p∩q) since U∩A equals A for any set A. The simplification shows that both expressions contain the same elements, as the first expression only adds elements from -p∩q that are not already in r. Thus, the two expressions are equivalent in terms of their set contents. Understanding these laws clarifies the simplification process.
SamRoss
Gold Member
Messages
256
Reaction score
36
How does r∪(-p∩q∩-r) simplify to r∪(-p∩q) ? The second expression is just the first with the "-r" gone at the end. I'm not seeing how to get from the first expression to the second using any of the basic laws like distribution, de morgan, tautology, etc. What am I missing?
 
Physics news on Phys.org
Let ##U## be the set of which all these sets r,p,q are subsets, so that ##-r=U-r## and ##U=r\cup -r##.
Then we have:
\begin{align*}
r\cup(-p\cap q\cap -r)
&= r\cup((-p\cap q)\cap -r) \quad\textrm{[associative law]}
\\&=
(r\cup(-p\cap q)) \cap( r\cup-r)
\quad\textrm{[distributive law]}
\\&=
(r\cup(-p\cap q)) \cap U
\quad\textrm{[see preamble above]}
\\&=
r\cup(-p\cap q)
\quad\textrm{[since $U\cap A=A$ for any $A\subseteq A$]}
\end{align*}
 
After you do distribution, you can represent ##(r \cup \neg r)## as "##T##" since its always true. Then ##(A) \cap T## is equivalent to ##(A)##.

Your text materials may use a different technique than the notation "T". They should have some rule equivalent to the effect of using "T".
 
The second expression will include elements of ##(-p \cap q)##, whether they are in r or not. The first expression will only add elements of ##(-p \cap q)## that are not in r, but the others were in r already. So there is no difference.

To mathematically show that, you can break up ##(-p \cap q) = (-p \cap q \cap r) \cup (-p \cap q \cap -r)##.
So $$ r \cup (-p \cap q) = r \cup ((-p \cap q \cap r) \cup (-p \cap q \cap -r)) $$
$$ = (r \cup (-p \cap q \cap r)) \cup (r \cup (-p \cap q \cap -r)) $$
$$ = r \cup (r \cup (-p \cap q \cap -r)) $$
$$ = r \cup (-p \cap q \cap -r) $$
There may be more direct ways to do this, but I don't see any now.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
14K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K