December 31st, 2016, 03:27 PM  #1 
Newbie Joined: Jul 2016 From: Israel Posts: 24 Thanks: 0  Set Theory proof issue
Hey all, can you help me out with this set theory proof? Gush I can't seems to get this proof part! Where do I start? Is there a common place ground I can start with? Here is the set relation: $\displaystyle A \bigtriangleup B \subseteq (A \bigtriangleup D) \cup (B \bigtriangleup D) $ I need to proof if a proper set exists in the relation between the left hand side and the right hand side (?) I can use a truth table to show that, I think... and maybe to get a generic approach with Venn diagrams, but these are not acceptable solutions by my professor... but how do I go about a general proof? 
December 31st, 2016, 08:09 PM  #2  
Senior Member Joined: Aug 2012 Posts: 1,702 Thanks: 448  Quote:
The very first thing to do is always to make sure you understand exactly what the question is asking. And to clearly write down what the question is looking for. Often just writing down the question clearly is 90% of the way to the answer. Since your phrasing of the question is confusing, I'll take the liberty of being picky about it in order to clarify some things. I need to prove. A pet peeve of mine. Also, a math proof isn't just symbols, it's a story in words. Spelling and grammar enhance clarity. I have a problem here, I never heard of a proper set. There's a proper class, that's a collection that's too big to be a set. The class of all sets is a proper class. And there's a proper subset, that's a subset that's not the whole set. But there's no proper set. Do you mean just set? Quote:
I'm guessing that we are supposed to do three things, basically: * Prove that this expression isn't always true; * Prove that it's not always false; * Find $A$, $B$, and $D$ such that it's true. But that's a guess. Possibly this isn't an exact transcription of the problem; and also your understanding of the question is a little shaky. I see you already share my concerns I'm going on about this for two reasons: One, your next step is to write down exactly what the question is asking of you. And second, because this is the single universal truth I know about getting started on math problems. Always write down an extremely clear, detailed explanation of what they are asking you for. If you do that one single thing in every math class, it will change your life. Writing down a clear statement of the question organizes your mind around the problem. Quote:
The prof wants a settheoretic style answer. But how you get to it can and should involve Venn diagrams and truth tables and anything else that works for you. Figure out exactly what is being asked, then write it down as clearly as you can.  
January 1st, 2017, 06:30 AM  #3  
Newbie Joined: Jul 2016 From: Israel Posts: 24 Thanks: 0  Quote:
I apologize for my lack of clear English. Please let me rephrase: I've been given this problem to solve: "Prove that for all sets A, B, C, exists: A△B⊆(A△D)∪(B△D) Is A△B also a proper subset? Elaborate" So basically I need to prove whether A△B is also a proper subset (or not). I hope it is more clear? Last edited by shanytc; January 1st, 2017 at 06:32 AM.  
January 1st, 2017, 10:45 AM  #4 
Senior Member Joined: Feb 2012 Posts: 144 Thanks: 16 
mmh... a proper subset of what?

January 1st, 2017, 11:25 AM  #5 
Newbie Joined: Jul 2016 From: Israel Posts: 24 Thanks: 0  
January 1st, 2017, 05:11 PM  #6 
Senior Member Joined: Aug 2012 Posts: 1,702 Thanks: 448 
I just drew out a diagram of all the logical possibilities and convinced myself that it's always true. If the prof wouldn't accept that I'd just transform it to a laundry list of "If x is in A and not in B then this else that else if this then that etc." Tedious but you can read it right off your diagram. On the other hand by asking if the inclusion is proper, I'm wondering if I did something wrong! Last edited by Maschke; January 1st, 2017 at 05:33 PM. 
January 1st, 2017, 09:54 PM  #7 
Senior Member Joined: Aug 2012 Posts: 1,702 Thanks: 448 
This problem is a little tricky. I haven't got a full theory of what's going on yet, but I have an example of where the LHS is a proper subset of the RHS. First I made myself this diagram. It shows that if $x$ is in the set at the top, it must be in the set at the bottom. But, you can not always go up! For example, let $A = \{1, 2, 3\}$ $B = \{4, 5, 6\}$ $D = \{7\}$ Now the set $A \bigtriangleup B = \{1, 2, 3, 4, 5, 6\}$ As you follow any one of these numbers from top to bottom, it always ends up in the bottom row. However if you start at the bottom, $A \bigtriangleup D = \{1, 2, 3, 7$ and $A \bigtriangleup D = \{4, 5, 6, 7$. Their union is $\{1, 2, 3, 4, 5, 6, 7\}$. But now if you let $x = 7$, you can never make it up to the top row. You get stuck at the second line from the top. You can only make one AND clause true in each parent group, so their OR is False. In this case, the LHS is a proper subset of the RHS. That's not the end of it. There are probably cases where equality holds. Or maybe it's always a proper subset. I haven't figured that out yet. Have you made any progress? Honestly, one of the secrets to problems is that you just keep working at them till you figure them out. Like Edison said, it's 1% inspiration and 99% perspiration. ps  What if all the sets are empty? Then every expression is empty and the LHS = RHS. So that's at least one example of equality. Next research question: Are there examples with some or all of the sets nonempty that lead to equality? Under exactly what circumstances do you get equality and when is the inclusion proper? I think the prof wants you to analyze the problem like this. Last edited by skipjack; January 1st, 2017 at 10:35 PM. 
January 3rd, 2017, 01:00 PM  #9 
Senior Member Joined: Feb 2012 Posts: 144 Thanks: 16 
Take D=empty set. Then A delta D = A and B delta D = B so that the righthand side is AuB. Now if AnB is not empty the inclusion is strict.


Tags 
issue, proof, set, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Set Theory Proof  James Brady  Number Theory  3  October 13th, 2016 06:35 AM 
Set theory proof  outsos  Applied Math  6  April 12th, 2012 03:02 AM 
Set Theory Proof: (AuC)(BnA) = (AB)u(CB)  taleman  Applied Math  1  February 21st, 2012 10:40 AM 
Another Graph Theory Proof  coolhandluke  Applied Math  1  April 19th, 2010 09:28 AM 
small set theory proof  guroten  Applied Math  1  April 7th, 2009 01:55 AM 