Activity 01
Card Sort: Bijectivity Check
Prepare cards with functions, domains, codomains, and graphs. In small groups, students sort them into bijective or non-bijective piles, then justify choices using injectivity and surjectivity tests. Groups present one example to the class.
Explain why a function must be bijective to possess an inverse.
Facilitation TipFor Card Sort: Bijectivity Check, ensure each group has at least three examples where injectivity, surjectivity, and bijectivity are clearly different.
What to look forPresent students with three function definitions (e.g., f(x) = 2x + 1, g(x) = x², h(x) = |x|). Ask them to identify which functions are injective, surjective, and bijective over specified domains. They should provide a brief justification for each classification.