Is the statement on the UNION and INTERSECTION of Indexed Sets always true?

Click For Summary

Homework Help Overview

The discussion revolves around the properties of the union and intersection of indexed sets, specifically questioning whether the union of a collection of sets is always a subset of their intersection. The original poster references a problem from "Book of Proof" and presents a specific example to challenge the assertion made in the solutions manual.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to validate the claim by providing a counterexample involving specific indexed sets. Other participants discuss the definitions of union and intersection, noting that the intersection is generally a subset of the union, and question the validity of the original statement.

Discussion Status

Participants are actively engaging with the problem, offering different perspectives on the relationship between union and intersection. Some provide reasoning to support the idea that the intersection cannot be a subset of the union in general cases, while others clarify definitions and implications. There is no explicit consensus reached on the correctness of the original statement.

Contextual Notes

The original poster expresses confusion regarding the solution provided in the textbook and seeks clarification based on their own mathematical reasoning. There is an indication of potential misunderstanding of the concepts involved, as well as a desire for validation of their example.

SmashtheVan
Messages
42
Reaction score
0

Homework Statement


Can't quite figure out the LaTeX for Indexed Sets, so bear with me:

From "Book of Proof" Section 1.8 #11 http://www.people.vcu.edu/~rhammack/BookOfProof/index.html

Is the UNION of Aa, where a is in I, a subset of the INTERSECTION of Aa always true for any collection of sets Aa with index set I?

Homework Equations


The Attempt at a Solution



The answer listed in the solutions is "Yes, this is always true."

However, I contest that it is false.
My reasoning:

Given I= {1,2,3} and Aa=[a, 2a]

This gives me A1= [1,2], A2= [2,4], and A3= [3,6]

The UNION is therefore [1,6] and the INTERSECTION is the nullset: {}

I find that the INTERSECTION is a subset of the UNION, but not the other way around, as the book asks.

Am I correct in my work, or is the statement given by the solutions manual correct?
 
Physics news on Phys.org
Yes, the union contains all the elements that are in some of the sets; the intersection contains all the elements that are in all of the sets - in general there are fewer of those.

In fact the opposite is easy to show: suppose that x lies in the intersection*, then x lies in all Aa, so in particular it lies in one of them and therefore sits in the union as well. Hence, the intersection is a subset of the union. *) For the nitpickers/mathematicians: if no such x exists, i.e. the intersection is empty, then the proof is trivial because the empty set is a subset of any set by definition.
 
I agree with you. It's almost never the case that the union of any number of sets is a subset of the intersection of the same sets. The only way this is possible is if all sets have the same elements (in which case the union is equal to the intersection).
 
Thanks everyone.

When I saw the solution it didn't make sense to me based on the previous exercises I got right using Unions/Intersections, so I gave myself that example to work it out mathematically. Must have been just a mixup by the author over the Union and Intersection symbols. Just looking for a 2nd opinion.
 

Similar threads

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