Scribd
Upload
4 views

Relations and Functions Class 11 Notes

The document provides revision notes for Class-12 Mathematics, focusing on the concepts of relations and functions. It defines various types of relations such as empty, universal, reflexive, symmetric, transitive, and equivalence relations, along with the definitions and examples of different types of functions including one-one, onto, and bijective functions. Additionally, it covers binary operations and their properties in relation to sets.

Uploaded by

msnavya1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
4 views

Relations and Functions Class 11 Notes

The document provides revision notes for Class-12 Mathematics, focusing on the concepts of relations and functions. It defines various types of relations such as empty, universal, reflexive, symmetric, transitive, and equivalence relations, along with the definitions and examples of different types of functions including one-one, onto, and bijective functions. Additionally, it covers binary operations and their properties in relation to sets.

Uploaded by

msnavya1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
Created By : Varun Sir IMGS-INSTITUTE OF MATH & PHYSICS Mob : +91-7827852724 Revision Notes Class-12 Mathematics Chapter 1 — Relations and Functions Relation © _Itdefines relationship between two set of values let say from set A to set B. . Set A is then called domain and set B is then called codomain. @ — If(a,b)eR , it shows that a is related to b under the relation R Types of Relations 1. Empty Relation: © In this there is no relation between any element of a set. © Itis also known as void relation . For example: if set A is {2,4,6} then an empty relation can beR = {x,y} where x+y >I1 2. Universal Relation: In this each element of a set is related to every element of that set. © For example; if set A is {2,4,6} then a universal relation can be R= {x,y} where x+y >0 3. Trivial Relation: Empty relation and universal relation is sometimes called trivial relation. 4. Reflexive Relation: . In this each element of set (say) A is related to itself i.e., a relation R in set A is called reflexive if (a,a) then L, is also parallel to L, Transitive because if Li parallel to L> and L, parallel to L, then L, is also parallel to Ls Functions ¢ A function f from a set A to a set B is a rule which associates each clement of set A to a unique element of set B. Created By : Varun Sir IMGS-INSTITUTE OF MATH & PHYSICS Mob : +91-7827852724 Range is the set of all possible resulting value given by the function. For example: x’ is a function where values of X will be the domain and value given by x’ is range. ‘Types of Function: 1 Composit One-One Function: A function f from set A to set B is called one-one function if no two distinct elements of A have the same image in B. Mathematically, a function f from set A to set B if f(x) =f(y) implies that x=y forallx,yeA. One-one function is also called an injective function. For example: If'a function f from a set of real number to a set of real number, then f (x) = 2x is a one-one function. Onto Function: A function f from set A to set B is called onto function if each element of set B has a preimage in set A or range of function f is equal to the codomain i.e., set B. Onto function is also called surjective function. For example: Ifa function f from a set of natural number to a set of n Natural number, then £(*) =%=1 jg onto function. Bijective Function: A function f from set A to set B is called bijective function if it is both one-one function and onto function. For example: Ifa function f from a set of real number to a set of real number, then f(x) =2x is one-one function and onto funetion. n of function and invertible function Composition of function: Let f: AB and £:B>C then the composite of g and f, written as gof is a function from A to C such that (gof)(a)=g(f(a)) for all aA. (Not in the current syllabus) Properties of composition of function: Let f: AB, g:B—>C and h:C->A then Created By : Varun Sir IMGS-INSTITUTE OF MATH & PHYSICS Mob : +91-7827852724 a, Composition is associative ie., h(gf ) = (hg)f b. If fand gare one-one then g ef is also one-one ¢. If fand gare onto then gof is also onto d. —_ Invertible function: If f is bijective then there is a function f': BA such that (f'f)(a) =a forall a€A and (f"'f)(b)=b forall beB © fis the inverse of the function f and is always unique. Binary Operations ¢ A binary operation are mathematical operations such as addition, subtraction, multiplication and division performed between two operands. ¢ A binary operation ona set A is defined as operations performed between two elements of set A and the result also belongs to set A. Then set A is called binary composition © — Itis denoted by * ¢ For example: Binary addition of real numbers is a binary composition ¢ since on adding two real number the result will always a real number. Properties of Binary Composition: ¢ A binary operation * on the set X is commutative, i.c., a*b=b*a, for every a,beX ¢ A binary operation * on the set X is associative, i.e., a*(b*c)=(a*b)*c, for every a,b,ceX ¢ There exists identity for the binary operation *:AxA >A, ie., a*e=c*a=a_foralla,ceA . A binary operation *: AxA > A js said to be invertible with respect to the operation * if there exist an element b in A such that a*b=b*a =e eis identity element in A then b js the inverse of @ and is denoted -I bya’.

You might also like