0% found this document useful (0 votes)
16 views1 page

Relations and Functions

The document outlines the concepts of relations and functions, defining key terms such as domain, range, and co-domain. It describes various types of relations (reflexive, symmetric, transitive, etc.) and functions (injective, surjective, bijective, etc.), along with their properties and inverses. Additionally, it highlights important notes relevant for JEE and BTech, including the number of functions and the significance of graphs in understanding these concepts.

Uploaded by

soumikb746
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
0% found this document useful (0 votes)
16 views1 page

Relations and Functions

The document outlines the concepts of relations and functions, defining key terms such as domain, range, and co-domain. It describes various types of relations (reflexive, symmetric, transitive, etc.) and functions (injective, surjective, bijective, etc.), along with their properties and inverses. Additionally, it highlights important notes relevant for JEE and BTech, including the number of functions and the significance of graphs in understanding these concepts.

Uploaded by

soumikb746
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/ 1

Relations and Functions - JEE & BTech Level

Relations
• A relation R from a set A to a set B is a subset of A × B.
• If (a, b) ∈ R, we say that 'a is related to b'.
• Domain: Set of all first elements of R.
• Range: Set of all second elements of R.
• Co-domain: Set B (all possible second elements).

Types of Relations
• Reflexive Relation: (a, a) ∈ R for all a ∈ A.
• Symmetric Relation: If (a, b) ∈ R, then (b, a) ∈ R.
• Transitive Relation: If (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R.
• Equivalence Relation: A relation which is Reflexive, Symmetric, and Transitive.
• Identity Relation: {(a, a) | a ∈ A}.
• Universal Relation: A × A.
• Empty Relation: ∅ (no pair exists).

Functions (Mappings)
• A function f: A → B is a relation in which every element of A is related to exactly one element of
B.
• Domain: Input values (set A).
• Range: Actual output values.
• Co-domain: Set B (possible output values).

Types of Functions
• One-one (Injective): Each element of A maps to a unique element of B.
• Onto (Surjective): Every element of B is mapped by at least one element of A.
• Bijective: Both One-one and Onto.
• Constant Function: f(x) = c for all x ∈ A.
• Identity Function: f(x) = x for all x ∈ A.
• Polynomial, Rational, Exponential, Logarithmic, and Trigonometric Functions.

Inverse of a Function
• A function f: A → B has an inverse if it is bijective.
• Inverse function: f■¹: B → A such that f■¹(f(x)) = x.

Composition of Functions
• If f: A → B and g: B → C, then g ■ f: A → C defined by (g ■ f)(x) = g(f(x)).

Important Notes for JEE & BTech


• Equivalence relations partition a set into disjoint equivalence classes.
• Number of functions from A to B is |B|^|A|.
• Number of bijections from A to A is |A|! (factorial).
• Graphs of functions help in visualization (e.g., injective = horizontal line test).

You might also like