Monday, 22 June 2015

discrete mathematics - Showing a counter-example for a 4 sets that share a subset relation



What is the easiest and correct way of finding a counter-example of this kind of questions:




Do these relation holds for every sets A,B,C,D?



1) (AC)×(BD))=(A×B)(C×D)




2) (C×D)(A×(DB))(A×D)(C×(DB))




Thanks in advance.


Answer



Here's my answer to the actual question you asked, not the specific set theory questions.



For me the "easiest and correct way" to decide whether such a statement is true is to play with small examples. That often leads either to a counterexample (if the assertion is false) or to an idea of how to prove it (if it's true).



No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...