Relations and Functions

NCERT Class 12 Mathematics Chapter 1: Relations and Functions (Pages 1–17)

Summary of Relations and Functions

Playing 00:00 / 00:00

Relations and Functions Summary

In this chapter, we delve into the foundational concepts of relations and functions, which are essential in the field of mathematics. We begin by defining what a relation is, explaining how it refers to a connection or link between two objects or quantities. For example, if we consider a set of students from two consecutive class levels, we can illustrate various relations, such as being siblings or having a specific age relationship. From these examples, we abstractly define a relation mathematically as a subset of ordered pairs forming a relation from one set to another. One of the critical distinctions made in the chapter is between general relations and functions. We clarify that a function is a particular type of relation where each input is linked to exactly one output. We categorize functions based on various criteria, like being one-one (injective) where distinct inputs produce distinct outputs, or onto (surjective) where every element in the output set is covered by inputs from the domain. We also discuss the composition of functions, illustrating how two functions can be combined such that the output of one becomes the input of another. This operation is fundamental for constructing new functions and understanding their behaviors. The concept of invertible functions is touched upon, explaining that a function is invertible if it is both one-one and onto, allowing us to reverse the operation, retrieving the original inputs from the outputs. Furthermore, we examine different types of relations, including reflexive, symmetric, and transitive properties. Reflexive relations require that every element is related to itself, while symmetric relations imply mutual connections between pairs, and transitive relations involve a chain relationship across multiple elements. Finally, we conclude with equivalence relations, which satisfy all three properties: reflexive, symmetric, and transitive. Such relations help us form equivalence classes, which group elements that share common properties. This study of relations and functions establishes a critical groundwork for understanding more complex mathematical concepts encountered in various mathematical disciplines.

Relations and Functions key concepts

Domain
The set of all possible input values for a function.
Co-domain
The set of possible output values derived from the function.
Range
The actual set of output values that a function produces from its inputs.

Important topics in Relations and Functions

1.Definitions of relations and functions.
2.Types of relations and examples.
3.Characteristics of different types of functions.
4.Concept of composing functions.
5.Application of relations in real-life scenarios.
6.Understanding domain, co-domain, and range.
7.Notation for denoting relations.
8.Properties of invertible functions.
9.Introduction to binary operations.

Relations and Functions syllabus breakdown

Introduction
This section introduces the fundamental concepts related to relations and functions, emphasizing their relevance and applications in mathematics.
Types of Relations
The chapter explains the various types of relations that can exist between sets, including examples to illustrate their nature.
Types of Functions
This section describes different function types, detailing specific characteristics that distinguish them from general relations.
Composition of Functions
The composition of functions is explored, illustrating how functions can be combined to create new mappings. ---

Reviewed & Verified by Edzy Expert

Academically Reviewed

Dr. Ananya Sharma

CBSE Mathematics Reviewer

Mathematics educator with 12+ years of experience in CBSE curriculum design, content review, and competitive exam preparation.

M.Sc. MathematicsB.Ed.CTET Qualified

Relations and Functions Revision Guide

Revise the most important ideas from Relations and Functions.

Key Points

Definition of a Relation.

A relation R from set A to B is a subset of A × B, indicating how elements of A relate to those in B.

Types of Relations.

Relations can be empty, universal, reflexive, symmetric, or transitive. Important in characterizing relationships within sets.

Empty Relation.

An empty relation R is where no element of A is related to any element of A, denoted as R = φ.

Universal Relation.

A universal relation R includes all possible pairs from A, denoted as R = A × A.

Reflexive Relation.

A relation R is reflexive if every element relates to itself: (a, a) ∈ R for all a ∈ A.

Symmetric Relation.

A relation R is symmetric if (a, b) ∈ R implies (b, a) ∈ R for all a, b ∈ A.

Transitive Relation.

A relation R is transitive if (a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R for all a, b, c ∈ A.

Equivalence Relation.

An equivalence relation is reflexive, symmetric, and transitive, allowing partitioning of sets into equivalence classes.

Equivalence Classes.

An equivalence class [a] is the subset of all elements related to a under an equivalence relation.

Definition of Functions.

A function f from set X to Y assigns each element x ∈ X exactly one element y ∈ Y.

One-to-One Function.

A function f: X → Y is one-to-one (injective) if f(x₁) = f(x₂) implies x₁ = x₂.

Onto Function.

A function f: X → Y is onto (surjective) if for every y in Y, there exists an x in X such that f(x) = y.

Bijective Functions.

A function is bijective if it is both one-to-one and onto, allowing for an inverse function.

Composition of Functions.

The composition of functions f and g, denoted (gof)(x) = g(f(x)), combines the mappings of both functions.

Invertible Functions.

A function is invertible if there exists another function that retraces its steps, fulfilling both gof = I_X and fog = I_Y.

Real-World Application of Functions.

Functions model real-world scenarios in science and engineering, representing relationships between varying quantities.

Misconceptions about Relations.

Common misconceptions include assuming all sets exist in every relation; always check for defined subsets.

Important Examples.

Examples include equivalence relations on integers, such as parity (even/odd), allowing classification of integers.

Essential Formulas.

Know key formulas relating to functions, such as range, domain, and types of functions to streamline calculations.

Graphs Represent Functions.

Graphs visually depict the behavior of functions, helping in understanding relationships between variables.

Notation.

Understand notation for functions and relations, including R, f(x), and their specific meanings in context.

Relations and Functions Questions & Answers

Work through important questions and exam-style prompts for Relations and Functions.

What is a relation R from set A to set B?

Single Answer MCQ

Q-00077706

View explanation

Which of the following relations is an example of an empty relation?

Single Answer MCQ

Q-00077707

View explanation

Which type of relation means every element in set A is related to every element in set A?

Single Answer MCQ

Q-00077709

View explanation

What does it mean for a relation R to be reflexive?

Single Answer MCQ

Q-00077711

View explanation

Which of the following is a property of equivalence relations?

Single Answer MCQ

Q-00077713

View explanation

If R is a relation such that (1, 2) ∈ R and (2, 1) ∈ R, which property does R exhibit?

Single Answer MCQ

Q-00077715

View explanation

Which statement about functions as relations is true?

Single Answer MCQ

Q-00077717

View explanation

How do sets A = {1, 2} and B = {3, 4} relate in a function?

Single Answer MCQ

Q-00077719

View explanation

Show all 51 questions

What describes a transitive relation?

Which of the following represents a universal relation for the set A = {1, 2}?

Identify a characteristic that all equivalence relations must have.

If R is a relation from A to B and it is defined by R = {(x, y) | x is greater than y}, which relationship property does R exhibit?

In what scenario would a function not be defined?

Which of the following is a correct statement about relations?

What defines an empty relation in a set A?

Which relation is characterized by every element being related to itself?

In which relation does (a, b) imply (b, a)?

What is the relation called if it satisfies both reflexivity and symmetry but not transitivity?

Which property must a relation have to be classified as an equivalence relation?

Which of the following is an example of a universal relation?

If A = {x ∈ R : x < 5}, what kind of relation does R = {(x, y) : x - y < 0} represent?

Which of the following examples depicts a reflexive relation?

If R is a symmetric relation, what can be implied if (a, b) belongs to R?

What is an equivalence class [a] for a given element a in the equivalence relation R?

Which relation type is represented by (a, b) in A where x + y > 4?

Which of the following statements about equivalence relations is false?

If f(x) = 2x + 1 and g(x) = x^2, what is gof(2)?

What is the composition fog(x) if f(x) = 3x - 4 and g(x) = x + 5?

For functions f(x) = x + 3 and g(x) = 2x, what is the expression for gof(x)?

If f(x) = cos(x) and g(x) = 3x^2, then what is fog(0)?

Given f(x) = x^2 and g(x) = x + 5. What is gof(3)?

If f(x) = 2x and g(x) = x - 1, find fog(4).

For f(x) = 1/x and g(x) = x + 2, find gof(x) for x > 0.

If f(x) = 2x - 1 and g(x) = x^2, determine if gof is equal to fog.

Determine f(g(1)) if f(x) = x + 5 and g(x) = 3x - 2.

If f(x) = x/x+1 and g(x) = 2x, find the gof(4).

Which of the following is a property of an injective function?

What is the definition of a surjective function?

If a function is both injective and surjective, it is called what?

Which function is an example of a many-one function?

In which scenario is a function not considered onto?

Which of the following functions is a bijection?

Which of the following graphs depicts a function that is injective?

What is the range of the function f(x) = 2x for x ∈ N?

Which function is not one-one?

If f: R → R is defined by f(x) = x + 5, what is f(0)?

Which of the following statements is true regarding the function f(x) = 1/x?

For which function is the output not limited to positive values?

Which statement is true for a constant function?

If f(x) = 2x and g(x) = x^2, what is (f∘g)(2)?

Which of the following is an example of a function that is neither injective nor surjective?

Single Answer MCQ

Q-00103035

View explanation

Relations and Functions Practice Worksheets

Practice questions from Relations and Functions to improve accuracy and speed.

Relations and Functions - Practice Worksheet

This worksheet covers essential long-answer questions to help you build confidence in Relations and Functions from Mathematics Part - I for Class 12 (Mathematics).

Practice

Questions

Define a relation and explain its different types with examples. How does each type apply in real-world situations?

A relation on a set A is defined as a subset of the Cartesian product A × A. The major types of relations include: 1. **Empty Relation**: The relation with no elements, illustrated by R = φ. Example: No one in a class is sitting next to a friend. 2. **Universal Relation**: Every element is related to every other element, denoted as R = A × A. Example: Every student knows their own score. 3. **Reflexive**: A relation where (a, a) ∈ R for all a in A, such as 'is equal to'. 4. **Symmetric**: If (a, b) ∈ R, then (b, a) ∈ R, e.g., 'is a sibling of'. 5. **Transitive**: If (a, b) and (b, c) are in R, then (a, c) must also be in R, like 'is greater than'. 6. **Equivalence Relation**: A relation that is reflexive, symmetric and transitive. Example: 'is of the same height'. Each of these types is fundamental in categorizing connections within sets.

What are equivalence relations, and how can you prove that a specific relation is an equivalence relation? Include an example in your explanation.

An equivalence relation on a set A is a relation that satisfies three properties: reflexive, symmetric, and transitive. To prove a relation R is an equivalence relation, one must show: 1. **Reflexive**: Show (a, a) ∈ R for all a in A. 2. **Symmetric**: Show if (a, b) ∈ R then (b, a) ∈ R. 3. **Transitive**: Show if (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R. **Example**: Let R be defined on integers Z by R = {(a, b): a is congruent to b modulo n}. This relation is reflexive (a ≡ a), symmetric (if a ≡ b, then b ≡ a), and transitive (if a ≡ b and b ≡ c then a ≡ c). Thus, it is an equivalence relation.

Explain the concept of functions in mathematics. How do you distinguish between one-one and onto functions? Provide examples of each.

In mathematics, a function f: X → Y assigns to each element x in X exactly one element y in Y. 1. A function is **one-one (injective)** if it maps distinct elements in X to distinct elements in Y, meaning if f(x1) = f(x2), then x1 must equal x2. Example: f(x) = 2x is one-one as different x values yield different f(x) values. 2. A function is **onto (surjective)** if every element in Y is the image of at least one element in X; in other words, the range of f is equal to Y. Example: The function f(x) = x² is NOT onto when Y = R because negative numbers are not outputs of the function. A function can be both one-one and onto, termed **bijective**, like f(x) = x + 1 on integers.

Demonstrate with an example, what constitutes the composition of two functions. Explain how to determine if the composite function is one-one or onto.

The composition of two functions f: A → B and g: B → C is defined as (g ∘ f)(x) = g(f(x)). To compose, you apply f first, then g. **Example**: Let f(x) = 2x and g(x) = x + 3. Then the composite function (g ∘ f)(x) = g(2x) = 2x + 3. To analyze if g ∘ f is one-one or onto: 1. **One-one**: f is one-one (since it doubles the input) and g is also one-one (as it just adds a constant). Hence, g ∘ f is one-one. 2. **Onto**: g is onto (covers all of R), and f is onto for R as input is any real number. Thus, g ∘ f is onto as well.

Define and give examples of binary operations. How are they related to functions and relations?

A binary operation on a set A is a calculation that combines two elements a and b from A to produce another element in A. Formally, it's a function from A × A to A, denoted as *: A × A → A. **Examples**: 1. **Addition**: +: Z × Z → Z, where a + b is an integer if a and b are integers. 2. **Multiplication**: ×: R × R → R, where ab is a real number. These operations are functions because they map pairs of inputs to a single output. Relations can arise from binary operations when defining equivalences like a + b = c, leading to the exploration of properties like commutativity.

Explain the difference between injective and surjective functions with examples where each is applicable. What is the significance of these properties in mathematical analysis?

Injective (one-one) functions ensure distinct inputs have distinct outputs, significant in uniqueness in solutions. Surjective (onto) functions ensure every possible output can be achieved from at least one input. **Examples**: Injective: f(x) = 3x + 1 is injective as it never produces the same output for different inputs, while Surjective: g(x) = x² is surjective from R to R+ (non-negative reals) as every positive number has a pre-image. In analysis, injectivity maintains uniqueness in inverses, and surjectivity ensures covering complete output spaces, vital for defining functions in integration and calculus.

How do the concepts of domain and range function within the context of relations and functions? Illustrate with relevant examples.

The **domain** of a function is the set of all possible inputs, while the **range** is the set of all possible outputs (resulting from the domain). In the context of relations, they define sets involved in relationships. **Example**: For the function f(x) = 1/x, the domain is R - {0} because x cannot be zero (as it would be undefined), and the range is also R - {0} as it can take any real value except for zero. In relations, if A = {1, 2, 3} and B = {x | x is x ≤ 3}, a relation R defined as R = {(1, 1), (2, 2), (3, 3)} indicates a connection based on matching items within A and B.

Discuss the importance of reflexive, symmetric, and transitive properties in establishing equivalence relations.

Reflexive, symmetric, and transitive properties are essential to establish equivalence relations. A relation R is reflexive if every element is related to itself, symmetric if a relation between two different elements exists in both directions, and transitive if a relation between three elements forms a consistent chain. This helps in partitioning sets into equivalence classes, which is fundamental in areas like modular arithmetic and classification in algebra. **Example**: Consider R defined on the set of all people relating a person A to person B if 'A is the parent of B'. This relation is reflexive (root), symmetric (parent/child relationship), and transitive (generational linking). Thus, it can categorize people under similar lineage.

Define binary operations and provide examples. How do these operations establish independence in set theory?

A binary operation combines two elements to create a third element from a given set. In set theory, these operations can influence structure and shape properties essential for deeper analysis. For instance, let A = {0, 1}. **Example**: - Addition mod 2: 0 + 0 = 0, 1 + 1 = 0, establishing a closure property within a finite group. - Multiplication has a distinct result where it generates 0 and 1 distinctly while defining actions within the group (0 acts as the identity). These dictate how elements relate within sets and establish closure and identity, stimulating exploration of fields, groups, and rings in algebra.

Relations and Functions - Mastery Worksheet

This worksheet challenges you with deeper, multi-concept long-answer questions from Relations and Functions to prepare for higher-weightage questions in Class 12.

Mastery

Questions

Define and differentiate between reflexive, symmetric, and transitive relations. Provide examples for each and illustrate their distinctions with a Venn diagram.

Reflexive relation: (a, a) ∈ R for all a. Example: R = {(1, 1), (2, 2)} on set {1, 2}. Symmetric relation: If (a, b) ∈ R, then (b, a) ∈ R. Example: R = {(1, 2), (2, 1)}. Transitive relation: If (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R. Example: R = {(1, 2), (2, 3), (1, 3)}. Diagrams show how relationships overlap and intersect.

Given the sets A = {1, 2, 3} and B = {1, 4, 5}, denote a relation R from A to B defined by R = {(1,1), (2,4), (3,5)}. Determine if R is a function, and justify your answer.

R is a function since every element in set A maps to exactly one element in set B. Each input has a unique output. Therefore, R is a function. Diagram shows arrows from A to corresponding B elements.

Prove or disprove: The composition of two injective functions is injective. Provide examples to support your proof.

Proven. Let f: A → B and g: B → C be injective. If f(a1) = f(a2), then a1 = a2 (by injectivity of f). Thus, g(f(a1)) = g(f(a2)) implies a1 = a2, proving the composition g ∘ f is injective.

Let R be a relation on set A such that R = {(x, y) : x < y}. Determine if R is reflexive, symmetric, and transitive. Justify your answers with examples.

R is not reflexive (no (x,x) exists), not symmetric (if (x,y), then (y,x) does not hold), and transitive (if (x,y) and (y,z), then (x,z) holds). Thereby, R exhibits transitive property only.

If A is a set of integers, describe a relation R defined by R = {(a, b) : a - b is even}. Prove that R is an equivalence relation.

R is reflexive (a - a = 0 is even), symmetric (if a - b is even, then b - a is even), and transitive (if a - b and b - c are even, then a - c is even). Thus, R is an equivalence relation.

A function f: R → R is defined as f(x) = x^2. Determine whether f is injective, surjective, or bijective. Support your conclusions with examples.

f is not injective (since f(-1) = f(1)), not surjective (as values below 0 are not achieved). Therefore, f is neither injective nor surjective.

Analyze the composition of the functions f(x) = 2x and g(x) = x + 3. Find (g∘f)(x) and determine if the result is a function.

(g∘f)(x) = g(f(x)) = g(2x) = 2x + 3, which is indeed a function as every input results in a unique output.

Explore the concept of equivalence classes. Given an equivalence relation R on a set A = {1, 2, 3, 4} defined as R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}, find the equivalence class of 1.

The equivalence class of 1, denoted [1], includes elements related to 1 under R. Here, it is {1, 2}. Visualizing helps comprehend the relationships between elements.

Examine whether the relation R defined on the power set P(X) by R = {(A, B) : A ⊆ B} is an equivalence relation.

R is not reflexive (if A ⊂ A, then not all A = A), not symmetric (A ⊆ B does not imply B ⊆ A), not transitive (A ⊆ B and B ⊆ C does not imply A ⊆ C). Hence, not an equivalence relation.

Relations and Functions - Challenge Worksheet

The final worksheet presents challenging long-answer questions that test your depth of understanding and exam-readiness for Relations and Functions in Class 12.

Challenge

Questions

Evaluate the implications of equivalence relations in the context of social networks. Discuss how this concept can be used to categorize users based on their interactions.

Justify your answer by providing examples of different equivalence classes within a network and analyze how these classes affect user behavior and connections.

Analyze the function f(x) = x^3 - 4x to determine whether it is one-one, onto, or bijective. Justify your reasoning using appropriate mathematical arguments.

Provide evidence about its injectivity and surjectivity, referring to its derivative and range.

Explore the consequences of the composition of functions using g(x) = sin(x) and f(x) = x^2. Determine if the composition fog and gof are equivalent and discuss their implications.

Discuss the domain and range of each composition and whether they yield the same outputs for all inputs.

Evaluate the relationship between reflexive, symmetric, and transitive properties in the context of a community. How do these properties help in categorizing members?

Discuss real-life scenarios where these properties help in understanding membership relationships within the community.

Discuss the application of the pigeonhole principle in proving that certain functions cannot be one-one. Provide a specific example using a numerical function.

Demonstrate how the pigeonhole principle applies to prove the failure of injectivity in the chosen function.

Check if the relation R = {(x, y) | xy > 0} defined on the set of real numbers is reflexive, symmetric, and transitive. Justify each property with examples.

Provide thorough reasoning for each property, discussing edge cases.

Examine the implications of defining a binary operation using a relation and discuss its closure properties with examples.

Evaluate various sets and operations showing fulfillment or failure of closure.

Propose a function that illustrates being one-one but not onto, and provide justification with its graphical representation.

Create a corresponding graph to show the behavior of the function clearly illustrating the points made.

Demonstrate how to classify the relation R = {(1, 1), (2, 2), (3, 3), (1, 2)}. Analyze if it meets the criteria for any special types of relations.

Identify each property: reflexivity, symmetry, transitivity and categorize R accordingly.

Evaluate the significance of the inverse function theorem in identifying the inverses of given functions, using examples from complex equations.

Discuss conditions under which functions may or may not have inverses along with example functions that illustrate these conditions.

Relations and Functions Formula Sheet

Quickly revise formulas and terms from Relations and Functions.

Formulas

R = A × B

R represents a relation from set A to set B, defined as the Cartesian product of A and B. This establishes a framework for relating elements from two sets.

R = ∅

R is an empty relation when it contains no pairs, meaning no elements of A are related to elements of B. It is a subset of A × B.

R = A × A

R is a universal relation if every element in A relates to every element in A. This is the largest possible relation in terms of pairs.

a R b ⇔ (a, b) ∈ R

This notation denotes that element 'a' is related to element 'b' under relation R. It serves as a concise way to express relations.

(a, a) ∈ R for all a ∈ A

This condition defines a reflexive relation R on set A, indicating that every element is related to itself.

If (a₁, a₂) ∈ R, then (a₂, a₁) ∈ R

This statement defines a symmetric relation indicating that the order of elements in the pairs does not affect their relation.

If (a₁, a₂) ∈ R and (a₂, a₃) ∈ R, then (a₁, a₃) ∈ R

This defines a transitive relation, describing how relations can be chained together between elements.

f: X → Y

This notation defines a function f that maps elements from set X (domain) to set Y (co-domain).

f is injective if f(x₁) = f(x₂) ⇒ x₁ = x₂

This defines a one-to-one function (injective), where each input maps to a distinct output.

f is surjective if ∀ y ∈ Y, ∃ x ∈ X such that f(x) = y

A function is onto (surjective) when every element in the co-domain has a pre-image in the domain.

Equations

x R y ⇔ y ∈ f(x)

This notation defines a relation based on the output of a function f for an element x.

R(a) = {b ∈ B | (a, b) ∈ R}

This defines the range of an element a under the relation R, highlighting all elements b in set B related to a.

f(g(x))

This represents the composition of two functions, where the output of function g becomes the input for function f.

f(g(x)) = x

For an invertible function, this equality holds, signifying that the composition of a function and its inverse yields the identity element.

A = {1, 2, 3} → B = {4, 5}

This defines a mapping from set A to set B, demonstrating the fundamental concepts of functions.

g: X → Y, g(x) = ax^2 + bx + c

This defines a quadratic function, which is a specific type of function mapping inputs from domain X to outputs in co-domain Y.

f(x) + g(x)

This represents the sum of two functions, indicating how different functions can interact to produce new outputs.

R = {(x, y) | x is related to y}

This expresses a relation R as a set of ordered pairs, providing a way to visualize relationships.

f: X → Y and f is bijective

This indicates that the function f is both one-to-one and onto, ensuring that it has an inverse function.

f^-1: Y → X

This denotes the inverse function f^-1 which reverses the mapping of function f, applicable when f is bijective.

Relations and Functions FAQs

Explore the essential concepts of relations and functions in mathematics for Class 12. Learn about various types of relations, equivalence, and the properties of functions.

QWhat is a relation in mathematics?

A relation in mathematics is defined as a subset of the Cartesian product of two sets. It establishes a connection or relationship between elements of these sets. For example, if A is the set of students in Class XII and B in Class XI, a relation from A to B can include pairs like {(a, b): a is the brother of b}.

QWhat are the different types of relations?

The different types of relations include the empty relation, where no elements are related; the universal relation, where every element from one set is related to every element from another; and equivalence relations, which must be reflexive, symmetric, and transitive.

QWhat is an equivalence relation?

An equivalence relation on a set is a relation that is reflexive (each element is related to itself), symmetric (if one element is related to another, the second is related to the first), and transitive (if one element relates to a second, and the second relates to a third, the first leads to the third).

QCan you provide examples of relations?

Sure! Examples of relations include: R = {(a, b): a is sister of b}, which can be an empty relation in a boys' school, and R' = {(a, b): the difference in ages is less than 3 years}, which can represent a universal relation.

QWhat makes a function one-one (injective)?

A function is one-one or injective if it maps distinct elements of its domain to distinct elements in its range. In other words, for any two different elements x1 and x2 in the domain, their images must also be different: f(x1) ≠ f(x2).

QWhat is a surjective function?

A function is surjective (onto) if every element in the codomain is an image of at least one element from the domain. This means that the range of the function equals its codomain.

QHow do you define a bijective function?

A function is bijective if it is both one-one and onto. This means that each element of the domain is paired with a unique element of the codomain, and all elements of the codomain are covered, indicating a perfect one-to-one correspondence.

QWhat is composition of functions?

Composition of functions involves creating a new function from two functions, say f and g, by applying one after the other. If g: B → C and f: A → B, then the composition g∘f: A → C is defined as (g∘f)(x) = g(f(x)) for all x in A.

QCan functions be invertible?

Yes, a function is invertible if there exists another function that 'undoes' the action of the original function. For a function to be invertible, it must be bijective, allowing a one-to-one relationship between the elements.

QWhat types of functions are discussed in this chapter?

The chapter discusses types of functions such as identity functions, constant functions, polynomial functions, and rational functions. Each type has distinct characteristics and plays a critical role in different mathematical contexts.

QWhat is a reflexive relation?

A reflexive relation on a set is one where every element of the set is related to itself. Formally, for every element a in set A, (a, a) must be in the relation R.

QWhat does symmetric relation imply?

In a symmetric relation, if one element a is related to another element b, then b must also be related to a. Mathematically, if (a, b) is in relation R, then (b, a) must also be in R.

QCan relations be visualized?

Yes, relations can be visualized using directed graphs or matrices. In a directed graph, nodes represent elements and directed edges represent relationships. This visual representation helps in understanding how elements are interconnected.

QWhat is a universal relation?

A universal relation R on a set A is one where every element of A is related to every other element of A. This can be represented as R = A × A, which includes all possible pairs.

QWhat is a binary operation?

A binary operation is a calculation involving two elements from a set to produce another element of the same set. Examples include addition and multiplication defined on numbers.

QCan a function be both injective and surjective?

Yes, a function can be both injective (one-one) and surjective (onto). When a function meets both criteria, it is termed bijective, forming a perfect pairing between the input and output sets.

QHow do you determine if a relation is transitive?

To verify if a relation is transitive, check if for every pair (a, b) and (b, c) in relation R, the pair (a, c) must also exist in R. If this holds for all applicable pairs, the relation is transitive.

QHow is the concept of relations significant in mathematics?

The concept of relations is critical as it lays the groundwork for advanced concepts in mathematics, including function theory, graph theory, and set theory, aiding in the understanding of relationships between different mathematical objects.

QWhat is the importance of equivalence classes?

Equivalence classes partition a set into disjoint subsets, where all elements within a class are equivalent under a given equivalence relation. These classes simplify the study of functions and relations in mathematics.

QWhat historical perspectives shaped the understanding of functions?

The understanding of functions has evolved through contributions from mathematicians like Descartes, Gregory, Leibniz, and Euler, shaping the definitions and notations that are fundamental to the field today.

QIn what ways does this chapter help students?

This chapter enhances students' understanding of foundational concepts such as relations and functions, promotes logical reasoning, and develops problem-solving skills through practical exercises and examples.

Relations and Functions Downloads

Download worksheets, revision guides, formula sheets, and the official textbook PDF for Relations and Functions.

Relations and Functions Official Textbook PDF

Download the official NCERT/CBSE textbook PDF for Class 12 Mathematics.

Official PDFEnglish EditionNCERT Source

Download PDF

Relations and Functions Revision Guide

Use this one-page guide to revise the most important ideas from Relations and Functions.

Best for1-page chapter recap

Download PDF

Relations and Functions Formula Sheet

Quickly revise the main formulas and terms from Relations and Functions.

Best forRapid recall sheet

Download PDF

Relations and Functions Practice Worksheet

Solve basic and application-based questions from Relations and Functions.

Best forCore practice set

Download PDF

Relations and Functions Mastery Worksheet

Work through mixed Relations and Functions questions to improve accuracy and speed.

Best forMixed difficulty set

Download PDF

Relations and Functions Challenge Worksheet

Try harder Relations and Functions questions that test deeper understanding.

Best forFor deeper problem solving

Download PDF

Relations and Functions Flashcards

Test your memory with quick recall prompts from Relations and Functions.

These flash cards cover important concepts from Relations and Functions in Mathematics Part - I for Class 12 (Mathematics).

1/20

What is a relation in mathematics?

1/20

A relation R from set A to set B is defined as a subset of the Cartesian product A × B. If (a, b) ∈ R, we say a is related to b.

How well did you know this?

Not at allPerfectly

2/20

Give an example of a relation.

2/20

Let A = {1, 2} and B = {3, 4}. R = {(1, 3), (2, 4)} is a relation from A to B.

How well did you know this?

Not at allPerfectly

Active

3/20

What are the types of relations?

Active

3/20

Relations can be classified as reflexive, symmetric, transitive, antisymmetric, and equivalence relations.

How well did you know this?

Not at allPerfectly

4/20

What is a reflexive relation?

4/20

A relation R on set A is reflexive if for every element a ∈ A, (a, a) ∈ R.

5/20

Define symmetric relation.

5/20

A relation R is symmetric if for all a, b ∈ A, if (a, b) ∈ R then (b, a) ∈ R.

6/20

What is transitive relation?

6/20

A relation R is transitive if for all a, b, c ∈ A, if (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R.

7/20

What is an equivalence relation?

7/20

An equivalence relation is a relation that is reflexive, symmetric, and transitive.

8/20

What is the domain of a function?

8/20

The domain of a function is the set of all possible input values (x-values) for which the function is defined.

9/20

Define co-domain.

9/20

The co-domain of a function is the set of potential output values (y-values) that the function can map to.

10/20

What is the range of a function?

10/20

The range of a function is the set of actual output values that the function can produce.

11/20

What is a function?

11/20

A function is a relation in which each element of the domain is associated with exactly one element of the co-domain.

12/20

How do we denote a function?

12/20

Functions are typically denoted by f, g, h, etc., such that f(x) represents the output corresponding to input x.

13/20

What is a composite function?

13/20

If f and g are two functions, the composite function (f ∘ g)(x) = f(g(x)) applies g first and then f.

14/20

What is an inverse function?

14/20

If f is a function, its inverse f⁻¹ is defined such that f(f⁻¹(x)) = x for all x in the domain of f.

15/20

Define binary operation.

15/20

A binary operation on a set is a rule for combining any two elements of the set to produce another element of the same set.

16/20

What is a one-to-one function?

16/20

A function is one-to-one if it assigns distinct outputs for distinct inputs; if f(a) = f(b) then a must equal b.

17/20

Define onto function.

17/20

A function f is onto if every element in the co-domain is mapped by some element in the domain.

18/20

What is a common mistake in functions?

18/20

Assuming that every relation is a function; remember, a function must have a single output for each input.

19/20

What is the vertical line test?

19/20

The vertical line test determines if a graph represents a function; if any vertical line intersects the graph more than once, it is not a function.

20/20

What is the horizontal line test?

20/20

The horizontal line test checks if a function is one-to-one; if any horizontal line intersects the graph more than once, it is not one-to-one.

Show all 20 flash cards

Practice mode

Live Academic Duel

Master Relations and Functions via Live Academic Duels

Challenge your classmates or test your individual retention on the core concepts of CBSE Class 12 Mathematics (Mathematics Part - I). Compete in speed-recall question rounds matched explicitly to the latest syllabus milestones for Relations and Functions.

CBSE-aligned questions

Instant speed-recall rounds

Quick, competitive practice on Relations and Functions with zero setup.