This document provides instructions for an activity to represent different types of functions visually. Students are asked to draw sets A and B and connect their elements to represent: (i) a many-to-one into function, where multiple elements of A map to single elements of B but not all of B is mapped to; (ii) a many-to-one onto function, where multiple elements of A map to single elements of B and all of B is mapped to; (iii) a one-to-one into function where each element of A maps to a single element of B but not all of B is mapped to; and (iv) a one-to-one bijection where each element of A maps to a
This document provides instructions for an activity to represent different types of functions visually. Students are asked to draw sets A and B and connect their elements to represent: (i) a many-to-one into function, where multiple elements of A map to single elements of B but not all of B is mapped to; (ii) a many-to-one onto function, where multiple elements of A map to single elements of B and all of B is mapped to; (iii) a one-to-one into function where each element of A maps to a single element of B but not all of B is mapped to; and (iv) a one-to-one bijection where each element of A maps to a
This document provides instructions for an activity to represent different types of functions visually. Students are asked to draw sets A and B and connect their elements to represent: (i) a many-to-one into function, where multiple elements of A map to single elements of B but not all of B is mapped to; (ii) a many-to-one onto function, where multiple elements of A map to single elements of B and all of B is mapped to; (iii) a one-to-one into function where each element of A maps to a single element of B but not all of B is mapped to; and (iv) a one-to-one bijection where each element of A maps to a
(i) Many – One, Into Function (ii) Many – One, Onto Function (iii) One – One, Into Function (iv) One – One, Onto Function Pre- Requisite knowledge 1. Function: let A and B be two non-empty sets. Then a function ‘f’ from set A to set B is a rule which associates element of set A to set B such that (i) All elements of set A are associated to elements in set B. (ii) An element of set A is associated to unique element in Set B. 2. One - one Function (Injection) - A function f : A → B is said to be a one - one function (or injection) if different elements of A have different images in B, i.e., no two different elements of A have the same image in B. 3. Many - one function - A function f : A → B it is said to be a many - one function if two or more elements of set A have the same image in B. 4. Onto function (Surjection): A function f : A → B is said to be an onto function (or surjection) if every element b ϵ B has at least one pre - image a ϵ A . 5. Into function: A function f : A → B is said to be an into function if there exist at least one element in B having no pre - image in A. In other words, f : A → B is an into function if it is not an onto function. 6. One - one onto function (Bijection): A function f : A → B is a bijection if it is one – one as well as onto. 7. One - one into function: A function f : A → B is said to be one - one into function if it is one – one as well as into. MATERIALS REQUIRED Coloured pen, pencil, eraser and scale. PROCEDURE: 1. On the plane side (left hand side) of a sheet, draw four sets of two rectangles to represent set A and set B. 2. With the use of colourful pen, represent the elements of set A as a i and elements of set B as b i . 3. Join the elements of set A and set B, covering all four cases. OBSERVATIONS: 1. In figure (i), f is many- one as well as into function, so it is many- one into function. 2. In figure (ii), f is many- one as well as onto function, so it is many- one onto function. 3. In figure (iii), f is one- one as well as into function, so it is one- one into function. 4. In figure (iv), f is a one-one onto function (bijection) since it is both one- one as well as onto. CONCLUSION: Different types of functions are represented through this activity.