f−1(S∩T)=f−1(S)∩f−1(T)
I think I have to show that the LHS is a subset of the RHS and the RHS is a subset of the LHS, but I don't know how to do this exactly.
Answer
You didn’t specify the domain and codomain of f, so I’m going to assume that f:X→Y.
Just follow the trail of definitions. Suppose that x∈f−1[S∩T]; by the definition of f−1 this means that f(x)∈S∩T. By the definition of intersection this means that f(x)∈S and f(x)∈T. By the definition of f−1 again these mean that x∈f−1[S] and x∈f−1[T]. And finally, using the definition of intersection once more, we see that this means that x∈f−1[S]∩f−1[T]. Since x was an arbitrary element of f−1[S∩T], we’ve shown that every element of f−1[S∩T] is an element of f−1[S]∩f−1[T] and hence that f−1[S∩T]⊆f−1[S]∩f−1[T]. (I call this kind of argument element-chasing.)
Added: I included a lot of unnecessary verbiage in an attempt to emphasize that I was doing nothing more than translating one statement into another using definitions. I wanted to emphasize that this is a ‘follow-your-nose’ proof requiring no really clever ideas: do the most obvious thing at each step, and it works. The argument can be boiled down to something very short:
Let x∈f−1[S∩T]. Then f(x)∈S∩T, so f(x)∈S and f(x)∈T. But then x∈f−1[S] and x∈f−1[T], so x∈f−1[S]∩f−1[T], and therefore f−1[S∩T]⊆f−1[S]∩f−1[T].
Now see if you can use the same sort of approach to prove the opposite inclusion.
No comments:
Post a Comment