Scribd
Upload
7K views3 pages

Chapter 1 Mathematics - Class 12 - Formula - Sheet

This document defines and describes different types of relations and functions. It begins by defining a relation as a connection between elements of two sets and describes empty, universal, reflexive, symmetric, and transitive relations. It then defines a function as a unique mapping between elements of two sets and describes one-to-one, onto, and bijective functions. It also discusses function composition, invertible functions, binary operations, and their properties.

Uploaded by

Aditya Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7K views3 pages

Chapter 1 Mathematics - Class 12 - Formula - Sheet

This document defines and describes different types of relations and functions. It begins by defining a relation as a connection between elements of two sets and describes empty, universal, reflexive, symmetric, and transitive relations. It then defines a function as a unique mapping between elements of two sets and describes one-to-one, onto, and bijective functions. It also discusses function composition, invertible functions, binary operations, and their properties.

Uploaded by

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

Understanding Relations and

Functions
Relation Overview
The concept of a relation is fundamental in mathematics, providing a framework for
associating elements of two sets based on a specific connection. Consider two non-
empty sets; a relation between them exists if there's an identifiable link connecting
elements across these sets. Formally, a relation R from set A to set B is defined as a
subset of the Cartesian product A × B, characterized by a relationship between an
element x in set A and an element y in set B within the ordered pairs of A × B.

Types of Relations
Relations can vary in nature, and when a relation R is from set A to itself, it is
described as a relation on A. This implies that such a relation is a subset of A × A,
highlighting two extremities: the empty set (φ) and the set A × A itself. The specific
types of relations include:
 Empty Relation: This occurs when no element in A is related to any element
in A, symbolized as R = φ ⊂ A × A, defining R as an empty relation within set
A.
 Universal Relation: Conversely, if every element in A is related to every
other element in A, denoted as R = A × A, R is considered a universal relation
in set A.
 Both empty and universal relations are sometimes referred to as trivial
relations due to their foundational nature.
Further, a relation R in set A can be classified as:
 Reflexive: If for every element a in A, the ordered pair (a, a) is in R.
 Symmetric: If an ordered pair (a1, a2) in R implies that the ordered pair (a2,
a1) is also in R, for all elements a1, a2 in A.
 Transitive: If (a1, a2) in R and (a2, a3) in R imply that (a1, a3) is in R,
applicable for all a1, a2, a3 in A.
 Equivalence Relation: A relation is an equivalence relation if it is reflexive,
symmetric, and transitive.

Functions
A function represents a special type of relation that dictates a unique output for
every input. It is an ordered pair collection adhering to a specific rule: each element
(or input) in set A is connected to exactly one element (or output) in set B.
Mathematically, a function from set A to set B is defined when every element of A
has a singular and unique image in set B. This definition ensures that the
function's domain is A, and within this function, no two distinct ordered pairs
share the same first element, emphasizing the uniqueness of the relationship
between A and B as non-empty sets.
Understanding Relations and
Functions
Types of Functions

1. One to one Function: A function f : X → Y is defined to be one-one (or


injective), if the images of distinct elements of X under f are distinct, i.e., for
every x1 , x2 ∈ X, f(x1 ) = f(x2 ) implies x1 = x2 . Otherwise, f is called many-
one.

One to one Function

Many to one Function


2. Onto Function: A function f: X → Y is said to be onto (or surjective), if every
element of Y is the image of some element of X under f, i.e., for every y ∈ Y,
there exists an element x in X such that f(x) = y.

Onto Function

3. One-one and Onto Function: A function f: X → Y is said to be one-one and


onto (or bijective), if f is both one-one and onto.
Understanding Relations and
Functions

One to One & Onto Function

Composition of Functions

Let f: A → B and g: B → C be two functions. Then the composition of f and g,


denoted by gof, is defined as the function gof: A → C given by;

gof (x) = g(f (x)), ∀ x ∈ A

Invertible Functions

A function f : X → Y is defined to be invertible if there exists a function g : Y → X


such that gof = IX and fog = IY. The function g is called the inverse of f and is
denoted by f–1.

An important note is that, if f is invertible, then f must be one-one and onto and
conversely, if f is one-one and onto, then f must be invertible.

Binary Operations

A binary operation ∗ on a set A is a function ∗ : A × A → A. We denote ∗ (a, b) by a ∗


b.

Properties

 An element e ∈ X is the identity element for binary operation ∗ : X × X → X if


a∗e=a=e∗a∀a∈X
 An element a ∈ X is invertible for binary operation ∗ : X × X → X, if there
exists b ∈ X such that a ∗ b = e = b ∗ a where e is the identity for the binary
operation ∗. The element b is called the inverse of a and is denoted by a–1.
 An operation ∗ on X is commutative if a ∗ b = b ∗ a ∀ a, b in X.
 An operation ∗ on X is associative if (a ∗ b) ∗ c = a ∗ (b ∗ c)∀ a, b, c in X.

You might also like