I had this question on a test today.(adsbygoogle = window.adsbygoogle || []).push({});

Prove that if a function f:X-->Y is injective, then [itex]f(X\setminus A) \subset Y\setminus f(A), \forall A \subset X[/itex].

This is how I did it:

If x_1 is in A, then y_1=f(x_1) is in f(A). Because the function is injective, we can pick (cut Y into pieces) f(A) and f(X\A) so, that their intersection is empty (adjust A if needed). So, if x_2 is not in A = if x_2 is in X\A, then y_2=f(x_2) in f(X\A). From this we get that y_2 is in Y\f(A), since Y\f(A)=f(X\A). So, I've shown using the injective property, that y_2 in Y\f(A) follows from y_2 in f(X\A).

Right? Wrong?

- Kamataat

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Function proof

Loading...

Similar Threads for Function proof | Date |
---|---|

I Proof that BB(k) grows faster than any computable function | Yesterday at 11:18 AM |

Show a functions inverse is injective iff f is surjective | Aug 29, 2015 |

Proof of variance for functions of variable | Feb 24, 2012 |

Set function proof | Oct 13, 2011 |

Proofs involving functions and sets. Related questions. | Aug 16, 2008 |

**Physics Forums - The Fusion of Science and Community**