This is the problem:(adsbygoogle = window.adsbygoogle || []).push({});

"Prove that if A is denumerable and there exists a g: A -> B that is surjective, then there exists an h: B -> A so that h is injective."

So I've started it as:

Suppose a set A is denumerable and a function f: A-> B is surjective. Since there exists a surjective function f: A-> B and A is denumerable, B is countable..."

I'm a little stuck here. Any ideas?

**Physics Forums | Science Articles, Homework Help, Discussion**

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!

# Denumerable set and surjective function

Loading...

Similar Threads for Denumerable surjective function |
---|

I How Likelihood Functions work |

I The CDF from the Characteristic Function |

I The characteristic function of order statistics |

I Definition of surjection |

I Proof that BB(k) grows faster than any computable function |

**Physics Forums | Science Articles, Homework Help, Discussion**