CBSE Class 12 Mathematics Chapter 1 Relations and Functions NCERT Solutions
This chapter delves into the fundamental concepts of Relations and Functions for Class 12 Mathematics, aligned with CBSE guidelines. The NCERT Solutions provide a detailed exploration of different types of relations, focusing on determining whether a given relation is reflexive, symmetric, and transitive. It covers various sets and relation definitions, offering step-by-step analysis for each case. The solutions clarify the conditions for reflexivity (e.g., (a, a) ∈ R), symmetry (if (a, b) ∈ R, then (b, a) ∈ R), and transitivity (if (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R). This resource is crucial for students to build a strong foundation in these topics, essential for understanding advanced mathematical concepts and preparing effectively for their board examinations.
Quick info
| Board | CBSE |
|---|---|
| Class | Class 12 |
| Subject | Mathematics |
| Session | 2026 |
| Language | English |
| Type | NCERT Solutions |
| Chapter | Chapter 1 |
Chapter summary
Chapter 1 of the CBSE Class 12 Mathematics syllabus introduces Relations and Functions. These NCERT Solutions focus on the properties of relations: reflexivity, symmetry, and transitivity. The exercises involve analyzing various relations defined on different sets, such as numerical sets, natural numbers, integers, and sets of people, to classify them based on these properties. The solutions provide clear reasoning and step-by-step verification for each property.
Learning outcomes
- Understand the definitions of reflexive, symmetric, and transitive relations.
- Analyze given relations on different sets to determine their properties.
- Apply the definitions of reflexivity, symmetry, and transitivity to verify or disprove them for a given relation.
- Solve problems involving relations defined on sets of numbers and real-world scenarios.
- Distinguish between different types of relations based on their properties.
Topics covered
Paper topics
- Relations
- Sets
- Natural Numbers
- Integers
- Reflexive Relations
- Symmetric Relations
- Transitive Relations
- Equivalence Relations
- Relations on Sets
- Human Beings as Elements
- Workplace Relations
- Locality Relations
Important topics
- Reflexive Relations
- Symmetric Relations
- Transitive Relations
- Checking Properties of Relations
- Relations on Different Sets
PDF preview
Read page by page below. PDF is streamed from the official NCERT website — no download button on this page.
Questions and Solutions
Question 1.1
- Relation R in the set defined as
- Relation R in the set of N natural numbers defined as
- Relation R in the set defined as
- Relation R in the set of Z integers defined as
- Relation R in the set of human beings in a town at a particular time given by:
- The set is and the relation is , which can be written as . The pairs in R are .
- Reflexive: For R to be reflexive, for all . For example, requires , which is false. Thus, R is not reflexive.
- Symmetric: For R to be symmetric, if , then . We see that because . However, because . Thus, R is not symmetric.
- Transitive: For R to be transitive, if and , then . We have (since ) and (since ). However, because . Thus, R is not transitive.
- The set is the set of natural numbers N, and the relation is . The possible values for x are 1, 2, 3. The pairs in R are .
- Reflexive: For R to be reflexive, for all . For example, is not in R since . Thus, R is not reflexive.
- Symmetric: For R to be symmetric, if , then . We see that . However, because . Thus, R is not symmetric.
- Transitive: For R to be transitive, if and , then . In the set R, there are no pairs and such that the second element of the first pair is the first element of the second pair. For example, we have , but there is no pair starting with 6. Thus, the condition for transitivity is vacuously satisfied, but this is often interpreted as not being transitive in practical examples unless a chain exists. However, based on the strict definition, if no such chain exists, it doesn't violate transitivity. But typically, if no pairs allow for checking transitivity, it's not considered transitive in the context of these problems unless explicitly stated otherwise. Given the pairs, we cannot form a chain . Thus, R is not transitive.
- The set is and the relation is .
- Reflexive: For any , is divisible by (since ). Thus, for all . So, R is reflexive.
- Symmetric: For R to be symmetric, if , then . We see that because 4 is divisible by 2. However, because 2 is not divisible by 4. Thus, R is not symmetric.
- Transitive: For R to be transitive, if and , then . If is divisible by , we can write for some integer . If is divisible by , we can write for some integer . Substituting , we get . This shows that is divisible by , so . Thus, R is transitive.
- The set is the set of integers Z, and the relation is .
- Reflexive: For any integer , , which is an integer. Thus, for all . So, R is reflexive.
- Symmetric: For R to be symmetric, if , then . If is an integer, then is also an integer. Thus, if , then . So, R is symmetric.
- Transitive: For R to be transitive, if and , then . If is an integer and is an integer, then their sum is also an integer. Thus, if and , then . So, R is transitive.
- The set is the set of human beings in a town at a particular time.
- Relation :
- Reflexive: Any person works at the same place as themselves. So, . R is reflexive.
- Symmetric: If person works at the same place as person , then person also works at the same place as person . So, if , then . R is symmetric.
- Transitive: If person works at the same place as person , and person works at the same place as person , then person also works at the same place as person . So, if and , then . R is transitive.
- Relation :
- Reflexive: Any person lives in the same locality as themselves. So, . R is reflexive.
- Symmetric: If person lives in the same locality as person , then person also lives in the same locality as person . So, if , then . R is symmetric.
- Transitive: If person lives in the same locality as person , and person lives in the same locality as person , then person also lives in the same locality as person . So, if and , then . R is transitive.
- Relation :
- Reflexive: A person cannot be exactly 7cm taller than themselves. So, . R is not reflexive.
- Symmetric: If person is exactly 7cm taller than person , then person is exactly 7cm shorter than person , not taller. So, if , then . R is not symmetric.
- Transitive: If person is exactly 7cm taller than person (so ), and person is exactly 7cm taller than person (so ), then . This means is 14cm taller than , not 7cm taller. So, if and , then . R is not transitive.
- Relation :
- Reflexive: A person cannot be the wife of themselves. So, . R is not reflexive.
- Symmetric: If is the wife of , then must be the husband of . Therefore, cannot be the wife of . So, if , then . R is not symmetric.
- Transitive: If is the wife of , and is the wife of , this is impossible in a standard definition of marriage (a person cannot be married to two people simultaneously in this context). Even if we consider polygamy, if is wife of , and is wife of , then cannot be the wife of (unless , which is not reflexive). Thus, the condition for transitivity cannot be met in a way that implies . R is not transitive.
- Relation :
- Reflexive: A person cannot be the father of themselves. So, . R is not reflexive.
- Symmetric: If is the father of , then is the child (son or daughter) of , not the father. So, if , then . R is not symmetric.
- Transitive: If is the father of , and is the father of , then is the grandfather of , not the father. So, if and , then . R is not transitive.
- Relation :
Common mistakes
- Confusing the conditions for symmetry and transitivity.
- Incorrectly assuming a relation is reflexive, symmetric, or transitive without proper verification.
- Errors in checking the conditions for all elements in the given set.
- Misinterpreting the definition of the relation itself.
Revision tips
- Clearly write down the definitions of reflexive, symmetric, and transitive relations before starting.
- For each relation, systematically check all three properties one by one.
- Pay close attention to the set on which the relation is defined (e.g., N, Z, A).
- When disproving a property, provide a specific counterexample.
- Practice with diverse examples, including those involving real-world scenarios.
Practice MCQs
Q1. Which property requires that if (a, b) is in the relation R, then (b, a) must also be in R?
Explanation: The definition of a symmetric relation states that for every pair (a, b) in R, the pair (b, a) must also be in R.
Q2. A relation R on a set A is reflexive if:
Explanation: A relation is reflexive if every element of the set is related to itself, meaning (a, a) must be in R for all elements 'a' in the set A.
Q3. If (x, y): y is divisible by x} on the set , 2, 3, 4}, which property does R satisfy?
Explanation: For any x in A, x is divisible by x, so it's reflexive. If y is divisible by x and z is divisible by y, then z is divisible by x, making it transitive. However, (4, 2) is not in R, so it's not symmetric.
Q4. Consider the relation (x, y): x and y work at the same place}. Is this relation transitive?
Explanation: If x and y work at the same place, and y and z work at the same place, it logically follows that x and z also work at the same place. Thus, the relation is transitive.
Q5. The relation (x, y): x - y is an integer} on the set of integers (Z) is:
Explanation: For any integer x, x-x=0 (integer), so it's reflexive. If x-y is an integer, y-x is also an integer, so it's symmetric. If x-y and y-z are integers, their sum (x-z) is also an integer, so it's transitive.
Frequently asked questions
What are the three main properties of relations discussed in Chapter 1?
Chapter 1 focuses on three key properties of relations: reflexivity, symmetry, and transitivity. These properties help classify different types of relations.
How do I determine if a relation is reflexive?
A relation R on a set A is reflexive if every element 'a' in set A is related to itself, meaning the pair (a, a) must be present in the relation R for all a ∈ A.
What is the condition for a relation to be symmetric?
A relation R is symmetric if, for every pair (a, b) that belongs to R, the pair (b, a) also belongs to R.
When is a relation considered transitive?
A relation R is transitive if, whenever pairs (a, b) and (b, c) are in R, the pair (a, c) is also in R.
How do these NCERT Solutions help with exam preparation?
These solutions provide step-by-step explanations and clear reasoning for checking the properties of various relations, helping students understand the concepts thoroughly and practice applying them, which is crucial for exam success.
Are equivalence relations covered in this exercise?
While this specific exercise focuses on identifying reflexivity, symmetry, and transitivity individually, a relation that satisfies all three properties is called an equivalence relation. Understanding these three is the first step to identifying equivalence relations.
Content reviewed by the NCERT Help team. Editorial Team and update policy
NCERT Solutions PDF PDF on NCERT Help. URL unchanged for search indexing.