Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views2 pages

Relations and Functions Class 12 ISC

The document provides an overview of relations and functions for Class 12 ISC, defining key concepts such as types of relations (empty, universal, reflexive, symmetric, transitive, and equivalence) and functions (one-one, onto, and bijective). It also covers special types of functions, composition of functions, inverses, binary operations, and important formulas related to counting relations and functions. Additionally, it includes tips for identifying functions and understanding their properties.

Uploaded by

ayshairfu110
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

Relations and Functions Class 12 ISC

The document provides an overview of relations and functions for Class 12 ISC, defining key concepts such as types of relations (empty, universal, reflexive, symmetric, transitive, and equivalence) and functions (one-one, onto, and bijective). It also covers special types of functions, composition of functions, inverses, binary operations, and important formulas related to counting relations and functions. Additionally, it includes tips for identifying functions and understanding their properties.

Uploaded by

ayshairfu110
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Relations and Functions - Class 12 ISC

1. Relations
Definition:
A relation from set A to set B is a subset of the Cartesian product A x B, meaning it is a set of
ordered pairs (a, b) where a in A and b in B.

Types of Relations
1. Empty Relation: No element of A is related to any element of B.
2. Universal Relation: Every element of A is related to every element of B.
3. Reflexive Relation: Every element is related to itself.
4. Symmetric Relation: If (a, b) in R, then (b, a) in R.
5. Transitive Relation: If (a, b) in R and (b, c) in R, then (a, c) in R.
6. Equivalence Relation: A relation that is reflexive, symmetric, and transitive.

2. Functions
Definition:
A function f: A -> B is a relation where each element of set A has exactly one output in set B.

Types of Functions
1. One-One (Injective) Function: No two elements in A map to the same element in B.
2. Onto (Surjective) Function: Every element in B is mapped by at least one element in A.
3. Bijective Function: A function that is both one-one and onto.

3. Special Types of Functions


1. Constant Function: f(x) = c for all x in A.
2. Identity Function: f(x) = x.
3. Polynomial Function: f(x) = ax^n + bx^(n-1) + ... + c.
4. Modulus Function: f(x) = |x|.
5. Greatest Integer Function: f(x) = [x] (greatest integer less than or equal to x).
6. Signum Function: f(x) = { 1 if x > 0, 0 if x = 0, -1 if x < 0 }.

4. Composition of Functions
If f: A -> B and g: B -> C, then the composition of f and g is defined as:
(g o f)(x) = g(f(x)).

5. Inverse of a Function
A function f: A -> B has an inverse f^-1 if and only if it is bijective.

6. Binary Operations
A binary operation on a set A is a function *: A x A -> A.
Properties:
1. Closure: a * b in A for all a, b in A.
2. Associativity: (a * b) * c = a * (b * c).
3. Identity Element: a * e = a for all a.
4. Inverse Element: a * a^-1 = e.

7. Important Formulas
1. Number of Relations from A to B: 2^(m x n).
2. Number of Functions from A to B: n^m.
3. Number of One-One Functions: P(n, m) = n! / (n-m)!
4. Number of Onto Functions: n^m - Summation(k=1 to n) [C(n, k) * (n-k)^m * (-1)^k].

Tips & Tricks


1. If the question asks for counting relations, functions, or bijections, use formula-based methods.
2. If a function maps one element to multiple elements, it is not a function.
3. Reflexive + Symmetric + Transitive implies Equivalence relation.
4. Use vertical line test to check if a given graph is a function.
5. Inverse functions exist only for bijective functions.

You might also like