Why doesn't A ⊂ (B ∪ C) imply A ⊂ B or A ⊂ C?

3 replies · 2K views · last reply
A.MHF
Messages
26
Reaction score
1

Homework Statement


So I was doing this problem in Munkres's Topology book:

Determine whether the statement is true or false, If a double implication fails, determine whether one or the other of the possible implications holds:

A ⊂ B or A ⊂ C ⇔ A ⊂ ( B ∪ C )

Homework Equations


-

The Attempt at a Solution


I know that the ⇒ direction is true because (x∈A→x∈B or x∈A→x∈C)⇒(x∈A→(x∈B or x∈C))
For the other direction, I thought at first that it's true, but I checked some online answers and what I found is it's false. I thought it's true because what I had in mind is the word "or" stands for "either A is a subset of B, or A is a subset of C, or both". And if A is a subset of the union of B and C, then it's implied that A is a subset of at least one of them. What am I getting wrong?

This is the answer that I found online:

If the LHS statement is true then for each
latex.png
we have that
Set-theory expression: x ∈ A or x ∈ B, as a standalone formula.
and so
Inline math: x ∈ A ∪ B, with x in A union B.
, i.e.
latex.png
. The other direction is not correct though. Consider the sets
Three sets defined as A = {1, 3}, B = {1, 2}, C = {3, 4}, typeset as plain text in a single line.
then
latex.png
but it is not true that
Formula reading A ⊂ B or A ⊂ C, with the 'or' between the two subset statements.
.
 
A.MHF said:

Homework Statement


So I was doing this problem in Munkres's Topology book:

Determine whether the statement is true or false, If a double implication fails, determine whether one or the other of the possible implications holds:

A ⊂ B or A ⊂ C ⇔ A ⊂ ( B ∪ C )

Homework Equations


-

The Attempt at a Solution


I know that the ⇒ direction is true because (x∈A→x∈B or x∈A→x∈C)⇒(x∈A→(x∈B or x∈C))
For the other direction, I thought at first that it's true, but I checked some online answers and what I found is it's false. I thought it's true because what I had in mind is the word "or" stands for "either A is a subset of B, or A is a subset of C, or both". And if A is a subset of the union of B and C, then it's implied that A is a subset of at least one of them. What am I getting wrong?

This is the answer that I found online:

If the LHS statement is true then for each
latex.png
we have that
Set notation reading x ∈ A or x ∈ B, with x, A and B in italic.
and so
Set membership statement x ∈ A ∪ B, with x an element of the union of sets A and B.
, i.e.
latex.png
. The other direction is not correct though. Consider the sets
Set definitions: A = {1, 3}, B = {1, 2}, C = {3, 4}.
then
Set relation A ⊆ B ∪ C, with the symbol ⊂ rendered as a subset sign.
but it is not true that
Text reading "A ⊆ B or A ⊆ C" with the symbols ⊆ and ⊂ shown as in the image.
.
The example shows that this is wrong: "And if A is a subset of the union of B and C, then it's implied that A is a subset of at least one of them."
A={1,3}⊂ B∪C={1,2,3,4}, but clearly A is not a subset of either B or C.

Venn diagram with two overlapping black ellipses labelled B and C, and a red ellipse labelled A lying across both, extending into the overlap and beyond each side.
 
  • Like
Likes   Reactions: A.MHF
A.MHF said:

Homework Statement


So I was doing this problem in Munkres's Topology book:

Determine whether the statement is true or false, If a double implication fails, determine whether one or the other of the possible implications holds:

A ⊂ B or A ⊂ C ⇔ A ⊂ ( B ∪ C )

Homework Equations


-

The Attempt at a Solution


I know that the ⇒ direction is true because (x∈A→x∈B or x∈A→x∈C)⇒(x∈A→(x∈B or x∈C))
For the other direction, I thought at first that it's true, but I checked some online answers and what I found is it's false. I thought it's true because what I had in mind is the word "or" stands for "either A is a subset of B, or A is a subset of C, or both". And if A is a subset of the union of B and C, then it's implied that A is a subset of at least one of them. What am I getting wrong?
Your problem isn't in misunderstanding of the word "or" (as implied by your thread title). The counterexample given below clearly shows that A can be contained in ##B \cup C## without A being a subset of either of the other sets.

Note that in the example, one element of A is contained in B, and the other element of A is contained in C, but A is not a subset of either B or C.
A.MHF said:
This is the answer that I found online:

If the LHS statement is true then for each
latex.png
we have that
Set-theory expression x ∈ A or x ∈ B, with the symbols x, A, B and the connective 'or' written in math notation.
and so
Set membership expression: x ∈ A ∪ B
, i.e.
latex.png
. The other direction is not correct though. Consider the sets
Three sets written as A = {1, 3}, B = {1, 2}, C = {3, 4}.
then
Set relation A ⊆ B ∪ C, with the subset symbol written as ⊂, in plain text.
but it is not true that
Text reads: A ⊆ B or A ⊆ C, with the subset symbols shown as ⊆.
.
 
  • Like
Likes   Reactions: A.MHF
Oh, I don't how I missed that, feel stupid for asking haha.
Thanks.