Power Set Unions and inclusion

Click For Summary

Homework Help Overview

The discussion revolves around a proof related to set theory, specifically concerning power sets and their unions. The original poster is working on an exercise from Velleman's "How to prove it," which involves proving that if the union of the power sets of two sets A and B equals the power set of their union, then one set must be a subset of the other.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss various proof strategies, including contradiction and contrapositive approaches. There is mention of using Venn diagrams for visualization. The original poster expresses uncertainty about defining subsets and the effectiveness of the software "Proof Designer." One participant questions the validity of treating a disjunction as an implication in the context of the proof.

Discussion Status

The discussion is ongoing, with participants exploring different methods and questioning their approaches. Some guidance has been offered regarding the use of contrapositive reasoning, but there is no explicit consensus or resolution at this point.

Contextual Notes

Participants note challenges with the software and the complexity of defining subsets appropriately. There is also a mention of time constraints affecting the ability to finalize the proof.

Kolmin
Messages
66
Reaction score
0
I am studying Velleman's "How to prove it: a structured approach" and I have to say that it is one of the best decision I have taken. Right now I am working on the exercises that are on Velleman's page along with the java applet "Proof Designer" and I have the feeling I start to get a bit how proofs work. But still...

This proof is really making me think and I don't see how I can get out of it.

Assume [itex]\wp[/itex](A)[itex]\cup[/itex][itex]\wp[/itex](B)=[itex]\wp[/itex](A[itex]\cup[/itex]B)
Prove that A[itex]\subseteq[/itex]B or B[itex]\subseteq[/itex]A.
[Suggested Exercise no.20]

I have to admit I tried basically everything (i.e. contradiction, cases) but I don't really go anywhere close to the solution.

For example, proof designer asks you to define a bounded variable if it is in the "given" section. I rephrase [itex]\wp[/itex](A)[itex]\cup[/itex][itex]\wp[/itex](B)=[itex]\wp[/itex](A[itex]\cup[/itex]B) and I don't know how to define the subset X of A and B (out of desperation I put X=A but doesn't look a great idea).

Still I am not sure if it is a matter of not knowing how to properly use the software (which is actually quite easy) or I simply don't know how to work out the proof.
 
Physics news on Phys.org
How does your contradiction look?
 
Tried to use Venn Diagram?? It really helps in visualizing the sets, their union, intersections, etc.
 
Kolmin said:
I am studying Velleman's "How to prove it: a structured approach" and I have to say that it is one of the best decision I have taken. Right now I am working on the exercises that are on Velleman's page along with the java applet "Proof Designer" and I have the feeling I start to get a bit how proofs work. But still...

This proof is really making me think and I don't see how I can get out of it.

Assume [itex]\wp[/itex](A)[itex]\cup[/itex][itex]\wp[/itex](B)=[itex]\wp[/itex](A[itex]\cup[/itex]B)
Prove that A[itex]\subseteq[/itex]B or B[itex]\subseteq[/itex]A.
[Suggested Exercise no.20]

I have to admit I tried basically everything (i.e. contradiction, cases) but I don't really go anywhere close to the solution.

For example, proof designer asks you to define a bounded variable if it is in the "given" section. I rephrase [itex]\wp[/itex](A)[itex]\cup[/itex][itex]\wp[/itex](B)=[itex]\wp[/itex](A[itex]\cup[/itex]B) and I don't know how to define the subset X of A and B (out of desperation I put X=A but doesn't look a great idea).

Still I am not sure if it is a matter of not knowing how to properly use the software (which is actually quite easy) or I simply don't know how to work out the proof.
How about proving the contra positive?
Assume [itex]\displaystyle \text{ A} \not\subseteq \text{B and B} \not\subseteq \text{ A }.[/itex]

Prove [itex]\displaystyle \ \ <br /> \wp\text{(A)}\cup\wp\text{(B)}\neq\wp\text{(A}\cup\text{B)}\,.[/itex]​
 
Last edited:
Well, my contradiction didn't look that great...

About the Venn diagrams, it's not a matter of understanding the result (at least this one...): the only problem is really to prove it.

Right now I am trying with the contrapositive (thanks for the suggestion...:smile: ) but it's a bit problematic. I don't know if you ever used "Proof Designer": I find it amazing, because it really forces you to not fly around.
The fact is that I guess I should build up a subset with certain properties but I am not really sure I can do it. [...or maybe I am completely wrong]
 
Btw, a question that should look silly but that I facing yesterday.

Let's imagine we have the following goal:

A not-[itex]\subseteq[/itex]B [itex]\vee[/itex] A[itex]\subseteq[/itex]B

Instead of using the disjunction or the cases approach to prove the goal, can we consider it an implication?

I mean, basically it is the same of

[itex]\neg[/itex](A[itex]\subseteq[/itex]B) [itex]\vee[/itex] A[itex]\subseteq[/itex]B

which is the same as

A[itex]\subseteq[/itex]B[itex]\rightarrow[/itex]A[itex]\subseteq[/itex]B

I was wondering cause (if the trick is not wrong) you cannot use it in Proof Designer
 
Anyway, I finally got it.
Being a bit in a hurry for a travel, I will post the proof when I'll have time (hopefully before coming from the trip).
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
24
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K