Proving equivalence for a collection of subsets?

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
11 replies · 2K views
SMA_01
Messages
215
Reaction score
0

Homework Statement


Let f:X→Y where X and Y are sets. Prove that if {S[itex]\alpha[/itex]}[itex]\alpha\in[/itex]I is a collection of subsets of Y, then f-1([itex]\cup[/itex][itex]\alpha\in[/itex]IS[itex]\alpha[/itex])=[itex]\cup[/itex][itex]\alpha\in[/itex]If-1(S[itex]\alpha[/itex])


Would I prove this by showing set inclusion both ways? And any hints on how to begin?

Thanks.
 
on Phys.org
SMA_01 said:

Homework Statement


Let f:X→Y where X and Y are sets. Prove that if {S[itex]\alpha[/itex]}[itex]\alpha\in[/itex]I is a collection of subsets of Y, then f-1([itex]\cup[/itex][itex]\alpha\in[/itex]IS[itex]\alpha[/itex])=[itex]\cup[/itex][itex]\alpha\in[/itex]If-1(S[itex]\alpha[/itex])

Would I prove this by showing set inclusion both ways? And any hints on how to begin?

Thanks.
OK. So if [itex]\displaystyle x\in f^{-1}\left(\cup_{\alpha\in I}\,S_\alpha \right)[/itex], what does that say?
 
SammyS said:
OK. So if [itex]\displaystyle x\in f^{-1}\left(\cup_{\alpha\in I}\,S_\alpha \right)[/itex], what does that say?

That f(x) is in the union of the subsets?
 
This is what I'm thinking:
If you take [itex]\cup[/itex]S[itex]\alpha[/itex] in Y, then that's the collection of subsets of Y, and "map" it back to X, then it would include every x in X such that f(x) is in one of the subsets, correct?
I'm not sure if I'm interpreting the other side of the equivalence correctly, but here's my attempt: If I take a particular S[itex]\alpha[/itex] and I map it back to X, then that will encompass every x value such that f(x) is in that particular subset. Then, I do this for each S[itex]\alpha[/itex] and take the union of all the x values in the preimage...is this a correct line of thinking?
 
SammyS said:
and that means ...

That f(x) must be in at least one particular subset...?
 
SMA_01 said:
That f(x) must be in at least one particular subset...?

How about giving that subset a name, say, [itex]S_a[/itex]? Now, if [itex]f(x)\in S_a[/itex], where does [itex]x[/itex] lie?
 
Michael Redei said:
How about giving that subset a name, say, [itex]S_a[/itex]? Now, if [itex]f(x)\in S_a[/itex], where does [itex]x[/itex] lie?

Then x would be in the preimage of S[itex]\alpha[/itex]?
 
Okay, I see how this shows the left-hand side of the equivalence is a subset of the right-hand side. But when writing my proof, will I have to generalize it so that f(x) can be in more than one S[itex]\alpha[/itex]?
 
No, one is enough. If some element ##e\in S_k##, then ##e\in\bigcup_{k\in I}S_k##.
 
Michael Redei said:
How about giving that subset a name, say, [itex]S_a[/itex]? Now, if [itex]f(x)\in S_a[/itex], where does [itex]x[/itex] lie?
I would be inclined to say, [itex]\displaystyle \dots\text{ "then }f(x)\in S_{\alpha_0}\,, \text{ for some }\alpha_0\in I/ .\text{"}[/itex]
 
Got it, thank you both for your help!