Exercise 3.3.3

When is the empty function injective? surjective? bijective?

  • \(\bullet\) Show that \(\forall X,f:\emptyset\to X\) is injective

  • \(\Vdash\) \(\forall X,f:\emptyset\to X\) is injective

  • \(\equiv\) { Definition 3.3.14 }

    • \(\forall X, \forall x\in\emptyset, \forall x'\in\emptyset,~x\neq x'\implies f(x)\neq f(x')\)
  • \(\equiv\) { \(x,x'\in\emptyset\) is always false }

    • Vacuosly true
  • \(\square\)

  • \(\bullet\) Show that \(f:\emptyset\to \emptyset\) is surjective

  • \(\Vdash\) \(f:\emptyset\to\emptyset\) is surjective

  • \(\equiv\) { Definition 3.3.17 }

    • \(\forall y\in \emptyset, \exists x\in\emptyset,~f(x) = y\)
  • \(\equiv\) { \(\forall y\in\emptyset\) is always false }

    • Vacuosly true
  • \(\square\)

  • \(f:\emptyset\to\emptyset\) is bijective by Definition 3.3.20 \(\square\)