Proof] 1-1 and Onto: f(A^c) = [f(A)]^c

  • Thread starter second
  • Start date
In summary: Therefore, we have shown that f is 1-1 and onto if and only if for each set A \subset X, f(A^c) = [f(A)]^c.
  • #1
second
4
0

Homework Statement


Show that f : X ! Y is 1-1 and onto if and only if for each set A [itex]\subset[/itex] X, f(A^c) = [f(A)]^c. ...c is a complement ...



Homework Equations



proof by contradiction.
if f is not 1-1,there are x and y with f(x)=f(y)

The Attempt at a Solution


I was thinking if f is not onto ...then i can say A=X...BUT i can't figure it out..i can explain one to one or onto..i am just having hard time here.

[
 
Physics news on Phys.org
  • #2
Solution]Suppose f is 1-1 and onto. Then for any set A \subset X, we have that f(A) = f(A^c)^c. Suppose this is false. Then there exists some set A \subset X such that f(A) \neq f(A^c)^c. Since f is onto, there exists x \in A^c such that f(x) \in f(A). Thus, since f is 1-1, there exists y \in A such that f(y) = f(x). This contradicts the fact that f is 1-1. Conversely, suppose that for all sets A \subset X, f(A) = f(A^c)^c. We will prove that f is 1-1 and onto.First, we will prove that f is 1-1. Suppose not, then there exist x,y \in X such that f(x) = f(y) but x \neq y. Let A = \{ x \}. Then f(A) = \{ f(x) \} while f(A^c) = \{ f(y) \}. This contradicts our assumption that f(A) = f(A^c)^c. Next, we will prove that f is onto. Let y \in Y be arbitrary. Let A = f^{-1}(\{ y \}^c). Then f(A^c) = f(f^{-1}(\{ y \}^c))^c = \{ y \}^c^c = \{ y \}. Thus, by our assumption, f(A) = \{ y \}^c. Since f(A) = \{ y \}^c, there exists x \in A such that f(x) = y. Thus, f is onto.
 

FAQ: Proof] 1-1 and Onto: f(A^c) = [f(A)]^c

What does "Proof] 1-1 and Onto: f(A^c) = [f(A)]^c" mean?

This statement is referring to a function, denoted by "f", that maps elements from a set A to elements in another set. The superscript "c" represents the complement of the set, meaning all the elements that are not in the original set A.

What is a one-to-one (1-1) function?

A one-to-one function is a function where each element in the domain (set A) is mapped to a unique element in the range (set B). In other words, no two elements in the domain are mapped to the same element in the range.

What is an onto function?

An onto function is a function where every element in the range (set B) is mapped to by at least one element in the domain (set A). In other words, there are no "leftover" elements in the range that are not being mapped to by any elements in the domain.

How do you prove that a function is both 1-1 and onto?

To prove that a function is both 1-1 and onto, you must show that for every element in the range, there is exactly one element in the domain that maps to it. This can be done through various methods, such as using algebraic manipulation or creating a table of values and showing that each element in the range is mapped to by exactly one element in the domain.

What is the significance of the statement "f(A^c) = [f(A)]^c" in terms of 1-1 and onto functions?

This statement is significant because it shows that the function f is both 1-1 and onto. In other words, every element in the range is mapped to by exactly one element in the domain, and there are no "leftover" elements in the range that are not being mapped to. This is a useful property to have in a function, as it ensures that there are no duplicates in the range and no elements are left out.

Back
Top