Ask your own question, for FREE!
Mathematics 13 Online
OpenStudy (anonymous):

proof of function of multiplication of integers!

OpenStudy (anonymous):

OpenStudy (anonymous):

problem 15

OpenStudy (anonymous):

This isn't a hard proof. There are only 4 cases. \[x\in A\]\[x\notin A\]\[x\in B\]\[x\notin B\]

OpenStudy (anonymous):

Oops, I mean \[x\in A \wedge x\in B\]\[x\in A \wedge x\notin B\]\[x\notin A \wedge x\in B\]\[x\notin A \wedge x\notin B\]

OpenStudy (anonymous):

@math_proof Do you understand?

OpenStudy (anonymous):

not ready

OpenStudy (anonymous):

which part are you talking about

OpenStudy (anonymous):

not really*

OpenStudy (anonymous):

Okay, there are only those four cases

OpenStudy (anonymous):

but which part are you talking about?

OpenStudy (anonymous):

part (i)

OpenStudy (anonymous):

ok

OpenStudy (anonymous):

So for each case, show what the result will be.

OpenStudy (anonymous):

For \[x\in A \wedge x\in B\]You get\[1\cdot 1 = 1\]We know that \[x \in A\cap B\]By definition. So for this case we confirm it is true. Just do the same with the other 3 cases.

OpenStudy (anonymous):

then for \[x \in A ∧ x notinB\]

OpenStudy (anonymous):

is\[1\times0 =0\]

OpenStudy (anonymous):

Yeah

OpenStudy (anonymous):

so its \[x inA cupB?\]

OpenStudy (anonymous):

Which is also correct, because \(x \notin A\cap B\)

OpenStudy (anonymous):

SO ALL of them will be true?

OpenStudy (anonymous):

Yeah, they won't make you prove it if it isn't true.

OpenStudy (anonymous):

This is an easy proof because there are only 4 cases to consider. Thus you can exhaustively confirm it for every case.

OpenStudy (anonymous):

what about part b?

OpenStudy (anonymous):

Okay for part b, what you need to do is see what happens for each case.

OpenStudy (anonymous):

Do you get 1 or 0?

OpenStudy (anonymous):

Then find a set operation on A and B in which \(x\in A \text{ some_operation } B\)

OpenStudy (anonymous):

still lost

OpenStudy (anonymous):

those are the same cases as in part a?

OpenStudy (anonymous):

These are the four cases: \[x\in A \wedge x\in B\] \[x\in A \wedge x\notin B\] \[x\notin A \wedge x\in B\] \[x\notin A \wedge x\notin B\] What does \(X_C(x)\) equal for each case?

OpenStudy (anonymous):

1, 0, 0, 0?

OpenStudy (anonymous):

For case \(x\in A \wedge x\notin B\) we have 1+0-1*0... does that equal 0? Try again.

OpenStudy (anonymous):

how are you getting the numbers?

OpenStudy (anonymous):

how is that 1+0-1*0

OpenStudy (anonymous):

\[x\in A \wedge x\notin B\Rightarrow X_A(x)=1\wedge X_B(x) = 0\]\[X_C(x) = X_A(x)+X_B(x) - X_A(x)X_B(x) = 1+0-1*0 = 1\]

OpenStudy (anonymous):

So we have 1, 1, 1, 0. So what set operation is this?

OpenStudy (anonymous):

ooooo

OpenStudy (anonymous):

is it a cartesian product (A × B) ∪ (A × C)

OpenStudy (anonymous):

No, it's just \[A\cup B\]

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!