Hello, Can someone please help me do a proof by contradiction on this problem? Suppose that r and s are reflexive relations on a set A. Prove or Disprove this statement. r U s is reflexive I'm stuck with proof by contradiction
Follow Math Help Forum on Facebook and Google+
Originally Posted by l flipboi l Suppose that r and s are reflexive relations on a set A. Prove or Disprove this statement. If is a reflexive relation on set then . If is any other relation on then which means the union is reflexive.
Originally Posted by Plato If is a reflexive relation on set then . If is any other relation on then which means the union is reflexive. Thanks! is this direct proof?
Originally Posted by l flipboi l is this direct proof? That proof is about as direct as it ever gets.
Originally Posted by Plato That proof is about as direct as it ever gets. Thanks! is there a way to show using proof by contradiction?
Originally Posted by l flipboi l Thanks! is there a way to show using proof by contradiction? Yes, but then we end up using the very idea I gave you in the so called direct proof.
View Tag Cloud