Scribd
Upload
19 views

Types of Functions

A function relates a set of inputs to a set of outputs, with each input corresponding to exactly one output. There are three types of functions: one-to-one (injective) where each output corresponds to a unique input; many-to-one where multiple inputs can correspond to the same output; and onto (surjective) where each output in the target set corresponds to at least one input.

Uploaded by

Sushant Dudeja
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Types of Functions

A function relates a set of inputs to a set of outputs, with each input corresponding to exactly one output. There are three types of functions: one-to-one (injective) where each output corresponds to a unique input; many-to-one where multiple inputs can correspond to the same output; and onto (surjective) where each output in the target set corresponds to at least one input.

Uploaded by

Sushant Dudeja
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

FUNCTIONS

A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output.

Types of functions - :
1. One-one (injective) 2. Many-one 3. Onto (surjective)

Let f be a function whose domain is a set A. The function f is injective if for all a and b in A, if f(a) = f(b), then a = b; that is, f(a) = f(b) implies a =b. Equivalently, if a b, then f(a) f(b).

A function f: A -> B is called a many to one function if two or more elements of A are associated to the same element of set B.

A function f from a set X to a set Y is surjective (or onto), or a surjection, if every element y in Y has a corresponding element x in X given by f(x) = y.

You might also like