Skip to content
Part BCSIR NET June 2025the-set-of-maps-is-far-bigger-than-the-sets-it-runs-between

The set of maps is far bigger than the sets it runs between

Let A, B be non-empty subsets of with cardinality |A| ≥ 2. Let {f : A → B | f is one-to-one} and {g : B → A | g is onto}. Which of the following statements is true?

  1. A.If A ⊊ B and B is finite, then there is a one-to-one map from to .
  2. B.If , then there exists a one-to-one map from to B.
  3. C.If and A is finite, then there exists a one-to-one map from B to .
  4. D.If A is finite, then is finite for any B.

You have the answer. Trap Analysis is why the other three were written.

Not a worked solution repeated four times — the specific reasoning error each wrong option was built to reward, and why this one tests standard counterexample.

See pricing

50 are analysed free — try those first.

The trap it tests

Standard counterexample

There is a canonical object that settles this. Recognising it is the whole question.

Drill statements like this

More on this topic

The chapter behind this: Elements of set theory: operations, De Morgan and difference — free to read

From The Real LineElements of set theory: operations, De Morgan and difference

ShareWhatsAppTelegram