Set Theory Q: Show A∩⋃ⁿᵢ=1Bᵢ = ⋃ⁿᵢ=1(A∩Bᵢ)

Click For Summary
SUMMARY

The discussion centers on proving the set theory identity A∩⋃ⁿᵢ=1Bᵢ = ⋃ⁿᵢ=1(A∩Bᵢ) using De Morgan's law and alternative methods. Participants confirm that both approaches are valid, with one method involving direct element inclusion to demonstrate the equality. The conversation also raises a question about the applicability of De Morgan's law when A and Bᵢ are subsets of the same set X, clarifying that the law remains valid in this context.

PREREQUISITES
  • Understanding of set theory concepts, including unions and intersections.
  • Familiarity with De Morgan's laws in set theory.
  • Basic knowledge of mathematical notation and logic.
  • Experience with proofs in mathematics.
NEXT STEPS
  • Study the application of De Morgan's laws in various set operations.
  • Explore different proof techniques in set theory, including direct proof and proof by contradiction.
  • Learn about the properties of unions and intersections in advanced set theory.
  • Investigate the implications of subsets and their relationships in set theory.
USEFUL FOR

Mathematicians, students of mathematics, and educators looking to deepen their understanding of set theory and proof techniques.

jaejoon89
Messages
187
Reaction score
0
Letting A, B_1, B_2, ..., B_n subsets of X, then show

A\cap\bigcup_{n}^{i=1}B_{i} = \bigcup_{n}^{i=1}\left(A \cap\right B_{i})

----

Is it sufficient to say...

By De Morgan law, we have

\left(A\cap \right B_{i})\cup\left(A \right \cap\ B_{2})\cup\ --- \cup\left(A\cap \right\ B_{n}) = \bigcup_{i=1}^{n}\left(A\cap \right B_{i})

Is that sufficient, or is there a better/more complete way to do it?
 
Physics news on Phys.org
jaejoon89 said:
Letting A, B_1, B_2, ..., B_n subsets of X, then show

A\cap\bigcup_{n}^{i=1}B_{i} = \bigcup_{n}^{i=1}\left(A \cap\right B_{i})

----

Is it sufficient to say...

By De Morgan law, we have

\left(A\cap \right B_{i})\cup\left(A \right \cap\ B_{2})\cup\ --- \cup\left(A\cap \right\ B_{n}) = \bigcup_{i=1}^{n}\left(A\cap \right B_{i})

Is that sufficient, or is there a better/more complete way to do it?

Well, that looks fine to me. But the other way to do it, if you prefer to avoid ... type notation, is to choose

x\in A\cap\bigcup_{n}^{i=1}B_{i},

and say that therefore x\in A and x\in B_i for some i\in\mathbb{N}. Therefore

x\in A\cap B_i\subseteq\bigcup_{n}^{i=1}\left(A \cap\right B_{i})

\Rightarrow x\in\bigcup_{n}^{i=1}\left(A \cap\right B_{i}).

Then choose y\in\bigcup_{n}^{i=1}\left(A \cap\right B_{i})

\Rightarrow y\in A\cap B_i\subseteq A\cap\bigcup_{n}^{i=1}B_{i}

\Rightarrow y\in A\cap\bigcup_{n}^{i=1}B_{i}.

So A\cap\bigcup_{n}^{i=1}B_{i}= A\cap\bigcup_{n}^{i=1}B_{i}. \blacksquare

Obviously, though, that way requires a bit more writing. It's a matter of preference which you wish to use; both are valid.
 
For the last line, don't you mean

<br /> A\cap\bigcup_{n}^{i=1}B_{i}=\bigcup_{n}^{i=1}\left(A \cap\right B_{i})

But A and B_1, B_2, ... , B_n are subsets of X, so does the Demorgan law really apply here (since A and B_i are in the same family)? I thought they had to be distinct.
 
Last edited:

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
4K
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K