In class we had the following function which I intend to prove for my own peace of mind.
Let M and N be sets and f:M⟶N a function:
f:P(M)⟶P(N)X⟼{f(x)∣x∈X}
Let X,Y⊂M then:
f(X∩Y)⊂f(X)∩f(Y)
Note: In our book (Zorich Analysis) ⊂ denotes a subset, not necessarily a real subset.
Question: Is f(X∩Y)⊂f(X)∩f(Y) a correct statement?
So I know that I need to show A⊂B⟺x∈A⟶x∈B. I tried as follows:
f(X∩Y)={f(x)∣x∈(X∩Y)}
I guess for the proof to be correct I should mention here that X∩Y≠∅ because x∈∅ would be a contradiction to start with. I continued like this:
x∈{f(x)∣x∈X∧x∈Y}⟶x∈{f(x)∣x∈X}∧x∈{f(x)∣x∈Y}
I don't know if this step is correct or not, but it seemed like it to me, I could conclude from there that:
x∈{f(x)∣x∈X∧x∈Y}⟶x∈{f(x)∣x∈X}∧x∈{f(x)∣x∈Y}⟶x∈f(X)∧x∈f(Y)⟶x∈(f(X)∩f(Y))
Would this complete the proof? Or do I also need to show that f(X)∩f(Y)⊄f(X∩Y) ?
Answer
The simple way of doing this is to show f(X∩Y)⊂f(X) and f(X∩Y)⊂f(Y), because a subset of f(X)∩f(Y) is the same as a subset of f(X) and f(Y). (More generally, a subset of A∩B is the same as a subset of A and of B.)
But both follow from the more general statement that if A⊂B, then f(A)⊂f(B). Indeed, any element of f(A) is of the form f(a) for some a∈A, whence a∈B, whence f(a)∈f(B), i.e., any element of f(A) is an element of f(B). Now apply this statement to A=X∩Y and B=X or B=Y.
No comments:
Post a Comment