Scribd
Upload
44 views3 pages

Vedantu Notes 12 Jee

The document discusses different types of relations including empty, universal, reflexive, symmetric, transitive and equivalence relations. It also discusses composition of functions, functional equations and different types of functions including one-to-one, onto and bijective functions.

Uploaded by

chinmaymohite0
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
44 views3 pages

Vedantu Notes 12 Jee

The document discusses different types of relations including empty, universal, reflexive, symmetric, transitive and equivalence relations. It also discusses composition of functions, functional equations and different types of functions including one-to-one, onto and bijective functions.

Uploaded by

chinmaymohite0
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/ 3

Relation & Functions

All 2023 PYQ in CBT and PDF Format

https://t.me/vedantumath1/3938

Click on the above Link


Relation & Types of Relations
Functions

Empty Relation Symmetric Relation


A relation R : A 🠆 R is empty if a R a ∀ a, A relation R : A → A is symmetric if aRb ⇒
b ∈ A. R = ϕ ⊂ A × A. bRa ∀ a, b ∈ A
For eg: R = {(a, b) : a = b2}, A = (1,5,10}

Universal Relation Transitive Relation


A relation R : A 🠆 A is universal if a R b ∀, A relation R : A × A is transitive if aRb, bRc
a, b ∈ A, R = A × A. if R = ϕ, then R is ⇒ aRc ∀ a, b, c ∈ A.
universal.

Reflexive Relation Equivalence Relation


A relation R : A → A is reflexive if aRa ∀ a (reflexive, symmetric, transitive e.g., Let T
∈A = the set of all triangles in a plane and R :
T 🠆 T defined by R = {(T1, T2)} : T1is
congruent to T2}. Then, R is equivalence.
Composition of Functions
The composition of functions f : A 🠆 B and g : B
🠆 C is denoted by gof, and is defined as gof : A
Types of Functions
🠆 C given by gof(x) = g(f(x)) ∀ x ∈ A, e.g. let
A = N and f, g : N 🠆 N such that f(x) = x2 and
g(x) = x3 ∀ x ∈ N.
Relation & One-one (injective)
Then gof(2) = g(f(2)) = g(22) = 43 = 64. Functions f : x 🠆 y is one-one if f(x1) = f(x2) ⇒
x1, = x2 ∀ x1, x2 ∈ x. Otherwise, f
is many-one, f1 is one-one.
Functional Equation

Onto (surjective)
f : x 🠆 y is onto it for energy y
∈ Y, ∃ x ∈ X S.t. f(x) = y, f2
is onto.

Bijective
f : x 🠆 y is both one-one and
onto, then f is bijective. F3 is
bijective.

You might also like