Index Family Subset Proof: Union subset Intersection

Click For Summary

Homework Help Overview

The problem involves an indexed family of sets and requires showing the relationship between the union and intersection of these sets. Specifically, it examines the condition under which the union of the sets is a subset of their intersection, and the implications of this condition regarding the equality of the sets.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss proving that if the union of the sets is a subset of their intersection, then all sets must be equal. They explore the contrapositive approach and question the logical consistency of their reasoning.

Discussion Status

There is an ongoing exploration of the logical steps needed to establish the proof. Participants are providing guidance and suggestions on how to approach the problem, particularly in terms of assumptions and the structure of the argument.

Contextual Notes

Some participants express uncertainty about their reasoning and the logical flow of their arguments, indicating a need for clarification on specific steps in the proof.

mliuzzolino
Messages
58
Reaction score
0

Homework Statement



Let [itex]{B_j: j \in J}[/itex] be an indexed family of sets. Show that [itex]\bigcup_{i \in J} B_i \subseteq \bigcap_{j \in J} B_j[/itex] iff for all i, j, [itex]\in[/itex] J, Bi = Bj.


Homework Equations





The Attempt at a Solution



First show that [itex]\bigcup_{i \in J} B_i \subseteq \bigcap_{j \in J} B_j \Rightarrow[/itex] for all i, j, [itex]\in[/itex] J, Bi = Bj.

By contrapositive, [itex]B_i \neq B_j \Rightarrow \bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j[/itex]

Suppose [itex]B_i \neq B_j[/itex].

Let [itex]x \in \bigcup_{i \in J} B_i[/itex]. So there exists an i in J such that x in Bi. But since Bi [itex]\neq[/itex] Bj, [itex]i \neq j[/itex] and there exists an [itex]i \in J \ni x \notin B_j.[/itex].



I know that the definition of the index family of intersections is for all j in J, x in Ej. But I'm not sure how to say that this isn't the case in the above proof...


Any guidance for a lost soul?
 
Physics news on Phys.org
mliuzzolino said:

Homework Statement



Let [itex]{B_j: j \in J}[/itex] be an indexed family of sets. Show that [itex]\bigcup_{i \in J} B_i \subseteq \bigcap_{j \in J} B_j[/itex] iff for all i, j, [itex]\in[/itex] J, Bi = Bj.

The Attempt at a Solution



First show that [itex]\bigcup_{i \in J} B_i \subseteq \bigcap_{j \in J} B_j \Rightarrow[/itex] for all i, j, [itex]\in[/itex] J, Bi = Bj.

By contrapositive, [itex]B_i \neq B_j \Rightarrow \bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j[/itex]

The contrapositive would be if there exist p and q such that ##B_p\neq B_q## then ##\bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j##. Don't use i and j for the indices and also the particular values.

Suppose [itex]B_i \neq B_j[/itex]. (##\color{red}{B_p\ne B_q}##)

[STRIKE]Let [itex]x \in \bigcup_{i \in J} B_i[/itex]. So there exists an i in J such that x in Bi. But since Bi [itex]\neq[/itex] Bj, [itex]i \neq j[/itex] and there exists an [itex]i \in J \ni x \notin B_j.[/itex].[/STRIKE]

Why don't you start with with x in one of ##B_p,B_q## and not the other? Then look at where it fits in the result.
 
Last edited:
Maybe I entirely mistook your guidance, but this is where I ended up going with it...not sure it's logically consistent though?


[itex]\exists p, q \in J \ni B_p \neq B_q \Rightarrow \bigcup_{i_J} B_i \not\subset \bigcap_{j \in J} B_j[/itex]

Suppose [itex]\exists p, q \in J \ni B_p \neq B_q[/itex]. Let [itex]x \in \bigcup_{i \in J} B_i[/itex], then [itex]\exists i \in J \ni x \in B_i[/itex]. Then suppose [itex]x \in B_p[/itex] then [itex]x \notin B_q[/itex].

Therefore, for all [itex]j \in J[/itex], namely j = q, [itex]x \notin B_j[/itex].

So [itex]\bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j[/itex].


A bit of these steps seem dodgy to me. Your input is greatly appreciated! :)
 
mliuzzolino said:
Maybe I entirely mistook your guidance, but this is where I ended up going with it...not sure it's logically consistent though?


[itex]\exists p, q \in J \ni B_p \neq B_q \Rightarrow \bigcup_{i_J} B_i \not\subset \bigcap_{j \in J} B_j[/itex]

Suppose [itex]\exists p, q \in J \ni B_p \neq B_q[/itex]. [STRIKE]Let [itex]x \in \bigcup_{i \in J} B_i[/itex], then [itex]\exists i \in J \ni x \in B_i[/itex].[/STRIKE]

No. Don't start with saying x is in the union. Without loss of generality you can say there is an x that is ##B_p## and not ##B_q##. Start with that x and show it is in the left side but not the right side.
 
LCKurtz said:
No. Don't start with saying x is in the union. Without loss of generality you can say there is an x that is ##B_p## and not ##B_q##. Start with that x and show it is in the left side but not the right side.


So, again my copious stupidity may be valiantly working against my attempts to understand this, but...

By supposition [itex]B_p \neq B_q[/itex], [itex]x \in B_p[/itex] AND [itex]x \notin B_q[/itex]. Since there exists [itex]p \in J \ni x \in B_p[/itex], then [itex]x \in \bigcup_{i \in J} B_i.[/itex]

Then, since there exists [itex]j \in J,[/itex] namely j = q, [itex]\ni x \notin B_j[/itex], then [itex]x \notin \bigcap_{j \in J} B_j[/itex].

Therefore, [itex]\bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j[/itex].
 
mliuzzolino said:
So, again my copious stupidity may be valiantly working against my attempts to understand this, but...

By supposition [itex]B_p \neq B_q[/itex], [itex]x \in B_p[/itex] AND [itex]x \notin B_q[/itex]. Since there exists [itex]p \in J \ni x \in B_p[/itex], then [itex]x \in \bigcup_{i \in J} B_i.[/itex]

Then, since there exists [itex]j \in J,[/itex] namely j = q, [itex]\ni x \notin B_j[/itex], then [itex]x \notin \bigcap_{j \in J} B_j[/itex].

Therefore, [itex]\bigcup_{i \in J} B_i \not\subset \bigcap_{j \in J} B_j[/itex].

Good. You are now halfway done with the original problem. The other direction is even easier :smile:
 
Thanks!
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 28 ·
Replies
28
Views
3K