CBSE Explorer

Relations and Functions

AI Learning Assistant

I can help you understand Relations and Functions better. Ask me anything!

Summarize the main points of Relations and Functions.
What are the most important terms to remember here?
Explain this concept like I'm five.
Give me a quick 3-question practice quiz.

Summary

Chapter Summary: Relations and Functions

Key Concepts

  • Relations: A relation R from set A to set B is a subset of A x B.
  • Functions: A special type of relation where each element in the domain maps to exactly one element in the co-domain.

Types of Relations

  • Empty Relation: R = Φ, no elements are related.
  • Universal Relation: R = A x A, every element is related to every other element.
  • 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 that is reflexive, symmetric, and transitive.

Functions

  • One-One (Injective): f(x₁) = f(x₂) implies x₁ = x₂.
  • Onto (Surjective): For every y in the co-domain, there exists an x in the domain such that f(x) = y.
  • Bijective: A function that is both one-one and onto.

Important Definitions

  • Equivalence Class: The subset of X containing all elements related to a.
  • Composition of Functions: Combining two functions where the output of one function becomes the input of another.
  • Invertible Functions: Functions that have an inverse.

Examples of Relations

  1. Symmetric but not Reflexive or Transitive: R = {(1, 2), (2, 1)}.
  2. Equivalence Relation: R = {(x, y): x and y have the same number of pages}.
  3. Reflexive and Transitive but not Symmetric: R = {(a, b): a ≤ b}.

Common Pitfalls

  • Confusing one-one and onto functions.
  • Misidentifying types of relations (e.g., assuming a relation is equivalence without checking all properties).

Exam Tips

  • Always verify the properties of relations and functions with examples.
  • Practice identifying and constructing equivalence classes.

Learning Objectives

Learning Objectives

  • Define the concept of relations and functions.
  • Identify different types of relations: reflexive, symmetric, transitive, and equivalence relations.
  • Explain the definitions of one-one (injective), onto (surjective), and bijective functions.
  • Describe the composition of functions and invertible functions.
  • Analyze examples of relations and functions to determine their properties.
  • Apply the definitions of relations and functions to solve mathematical problems.

Detailed Notes

Chapter 1: Relations and Functions

1.1 Introduction

  • The notion of relations and functions, domain, co-domain, and range were introduced in Class XI.
  • A relation in mathematics is defined as a recognisable connection between two objects or quantities.
  • Example of relations from set A (students of Class XII) to set B (students of Class XI):
    • (i) {(a, b) ∈ A × B: a is brother of b}
    • (ii) {(a, b) ∈ A × B: a is sister of b}
    • (iii) {(a, b) ∈ A × B: age of a is greater than age of b}
    • (iv) {(a, b) ∈ A × B: total marks obtained by a in the final examination is less than the total marks obtained by b}
    • (v) {(a, b) ∈ A × B: a lives in the same locality as b}
  • A relation R from A to B is defined as an arbitrary subset of A × B.

1.2 Types of Relations

  • Empty Relation: R = ∅ ⊆ A × A, where no element of A is related to any element of A.
  • Universal Relation: R = A × A, where each element of A is related to every element of A.
  • Reflexive Relation: R is reflexive if (a, a) ∈ R for every a ∈ A.
  • Symmetric Relation: R is symmetric if (a₁, a₂) ∈ R implies (a₂, a₁) ∈ R for all a₁, a₂ ∈ A.
  • Transitive Relation: R is transitive if (a₁, a₂) ∈ R and (a₂, a₃) ∈ R implies (a₁, a₃) ∈ R for all a₁, a₂, a₃ ∈ A.
  • Equivalence Relation: A relation that is reflexive, symmetric, and transitive.

1.3 Types of Functions

  • One-One (Injective): A function f: X → Y is one-one if f(x₁) = f(x₂) implies x₁ = x₂.
  • Onto (Surjective): A function f: X → Y is onto if for every y ∈ Y, there exists an x ∈ X such that f(x) = y.
  • Bijective: A function is bijective if it is both one-one and onto.

Key Definitions and Properties

  • Equivalence Class: [a] containing a ∈ X for an equivalence relation R in X is the subset of X containing all elements b related to a.
  • Characteristic Property of Finite Sets: For a finite set X, a function f: X → X is one-one if and only if it is onto, and vice versa.

Historical Note

  • The concept of function has evolved over time, starting from R. Descartes to G. H. Hardy.
  • The modern set-theoretic definition of function was developed by Georg Cantor.

Examples of Relations

  • Example of a relation that is symmetric but neither reflexive nor transitive: R = {(1, 2), (2, 1)}.
  • Example of an equivalence relation: R = {(x, y) : x and y have the same number of pages in a library}.

Exercises

  1. Determine the properties of various relations defined in different sets.
  2. Show that specific functions are one-one, onto, or neither.

Exam Tips & Common Mistakes

Common Mistakes and Exam Tips

Common Pitfalls

  • Misunderstanding Relations: Students often confuse the definitions of reflexive, symmetric, and transitive relations. Ensure you understand each definition clearly:
    • Reflexive: For every element a in set A, (a, a) must be in relation R.
    • Symmetric: If (a₁, a₂) is in R, then (a₂, a₁) must also be in R.
    • Transitive: If (a₁, a₂) and (a₂, a₃) are in R, then (a₁, a₃) must also be in R.
  • Equivalence Relations: Many students fail to check all three properties (reflexive, symmetric, transitive) when determining if a relation is an equivalence relation. Always verify all conditions.
  • Function Types: Confusion often arises between one-one (injective), onto (surjective), and bijective functions. Remember:
    • One-one: Distinct elements in the domain map to distinct elements in the codomain.
    • Onto: Every element in the codomain is an image of some element in the domain.
    • Bijective: A function that is both one-one and onto.

Exam Tips

  • Practice with Examples: Work through examples of each type of relation and function to solidify your understanding. For instance, show that the relation R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
  • Use Diagrams: When studying functions, sketch diagrams to visualize mappings between sets. This can help clarify whether a function is one-one or onto.
  • Check Extremes: For relations, remember the definitions of empty and universal relations. These can often be overlooked but are crucial for understanding the broader concepts.
  • Review Definitions Regularly: Make flashcards for key definitions and properties of relations and functions to reinforce your memory.
  • Solve Past Papers: Familiarize yourself with the format and types of questions that appear in exams by solving past papers.

Practice & Assessment

Multiple Choice Questions

A.

1

B.

2

C.

3

D.

4
Correct Answer: B

Solution:

To be reflexive, all pairs (1, 1), (2, 2), and (3, 3) must be included. For symmetry, if (a, b) is included, then (b, a) must also be included. There are 2 such relations: {(1,1),(2,2),(3,3)}\{(1, 1), (2, 2), (3, 3)\} and {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}.

A.

R={(1,1),(2,2),(3,3),(1,2),(2,1)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}

B.

R={(1,1),(2,2),(3,3),(1,2),(2,3)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}

C.

R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)\}

D.

R={(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(3,1)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3), (3, 1)\}
Correct Answer: A

Solution:

An equivalence relation must be reflexive, symmetric, and transitive. Option (a) satisfies all these properties: it is reflexive as it includes (1,1)(1, 1), (2,2)(2, 2), and (3,3)(3, 3); symmetric as it includes both (1,2)(1, 2) and (2,1)(2, 1); and transitive as there are no pairs that violate transitivity.

A.

The function is one-one but not onto.

B.

The function is onto but not one-one.

C.

The function is both one-one and onto.

D.

The function is neither one-one nor onto.
Correct Answer: C

Solution:

The function f:ABf: A \to B is one-one because each element of AA maps to a unique element in BB. It is also onto because every element in BB is an image of some element in AA. Therefore, the function is both one-one and onto.

A.

RR is reflexive, symmetric, and transitive.

B.

RR is reflexive and symmetric, but not transitive.

C.

RR is symmetric and transitive, but not reflexive.

D.

RR is reflexive and transitive, but not symmetric.
Correct Answer: A

Solution:

The relation RR is reflexive because for any aAa \in A, aa=0|a - a| = 0 is even. It is symmetric because if ab|a - b| is even, then ba|b - a| is also even. It is transitive because if ab|a - b| and bc|b - c| are even, then ac|a - c| is also even.

A.

R = {(a, a) : a is a student in a class}

B.

R = {(a, b) : a is taller than b}

C.

R = {(a, b) : a is a friend of b}

D.

R = {(a, b) : a is the father of b}
Correct Answer: A

Solution:

A reflexive relation on a set A is one where every element is related to itself. In option A, each student is related to themselves.

A.

f \circ f(x) = e^{2x}

B.

f \circ f(x) = e^{e^x}

C.

f \circ f(x) = e^{x^2}

D.

f \circ f(x) = x
Correct Answer: B

Solution:

The composition ff(x)f \circ f(x) means applying ff twice. Since f(x)=exf(x) = e^x, we have f(f(x))=f(ex)=eexf(f(x)) = f(e^x) = e^{e^x}. Therefore, ff(x)=eexf \circ f(x) = e^{e^x}.

A.

{(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}

B.

{(1,1),(2,2),(3,3),(1,3),(3,1)}\{(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)\}

C.

{(1,1),(2,2),(3,3)}\{(1, 1), (2, 2), (3, 3)\}

D.

{(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)\}
Correct Answer: A

Solution:

The relation {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\} is reflexive and symmetric but not transitive because it does not contain the pair (1, 3) which is needed for transitivity.

A.

hh is injective but not surjective

B.

hh is surjective but not injective

C.

hh is both injective and surjective

D.

hh is neither injective nor surjective
Correct Answer: C

Solution:

The function hh maps each element of AA to a unique element in BB, hence it is injective. It also covers all elements of BB, making it surjective. Therefore, hh is both injective and surjective.

A.

ff is one-one but not onto.

B.

ff is onto but not one-one.

C.

ff is both one-one and onto.

D.

ff is neither one-one nor onto.
Correct Answer: A

Solution:

The function ff is defined from a set AA with 3 elements to a set BB with 4 elements. Since each element of AA maps to a unique element in BB, ff is one-one. However, not every element in BB is mapped to, so ff is not onto.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: B

Solution:

The function f(n)=2nf(n) = 2n is one-one because each natural number maps to a unique even number. However, it is not onto because odd numbers are not in the range.

A.

R is reflexive.

B.

R is symmetric.

C.

R is transitive.

D.

R is an equivalence relation.
Correct Answer: B

Solution:

The relation RR is symmetric because if (a,b)R(a, b) \in R, then a+b=6a + b = 6 implies b+a=6b + a = 6, so (b,a)R(b, a) \in R. However, RR is not reflexive because there is no aAa \in A such that a+a=6a + a = 6. It is also not transitive because if (a,b)R(a, b) \in R and (b,c)R(b, c) \in R, a+b=6a + b = 6 and b+c=6b + c = 6 does not imply a+c=6a + c = 6. Thus, RR is not an equivalence relation.

A.

The function is one-one but not onto.

B.

The function is onto but not one-one.

C.

The function is both one-one and onto.

D.

The function is neither one-one nor onto.
Correct Answer: C

Solution:

The function f(x)=x33x+1f(x) = x^3 - 3x + 1 is a cubic polynomial, which is continuous and differentiable everywhere. The derivative f(x)=3x23f'(x) = 3x^2 - 3 is zero at x=1x = 1 and x=1x = -1. However, the function changes sign around these points, indicating that f(x)f(x) is strictly increasing on (,1)(-\infty, -1), (1,1)(-1, 1), and (1,)(1, \infty). Therefore, f(x)f(x) is one-one. Since the range of a cubic polynomial is R\mathbb{R}, the function is onto as well.

A.

The function is one-one and onto.

B.

The function is many-one and onto.

C.

The function is one-one but not onto.

D.

The function is neither one-one nor onto.
Correct Answer: D

Solution:

The modulus function f(x)=xf(x) = |x| is neither one-one nor onto because different values of xx can have the same absolute value, and not all real numbers are positive or zero.

A.

ff is one-one and onto.

B.

ff is one-one but not onto.

C.

ff is onto but not one-one.

D.

ff is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one (as f(1)=f(1)f(1) = f(-1)) nor onto (as negative numbers are not in the range).

A.

Reflexive and symmetric but not transitive.

B.

Symmetric and transitive but not reflexive.

C.

Reflexive and transitive but not symmetric.

D.

Transitive but neither reflexive nor symmetric.
Correct Answer: D

Solution:

The relation R={(1,2),(2,3),(1,3)}R = \{(1, 2), (2, 3), (1, 3)\} is transitive because (1,2)(1, 2) and (2,3)(2, 3) imply (1,3)(1, 3). However, it is not reflexive since it does not contain (1,1)(1, 1), (2,2)(2, 2), or (3,3)(3, 3). It is also not symmetric because (1,2)(1, 2) does not imply (2,1)(2, 1). Therefore, the relation is transitive but neither reflexive nor symmetric.

A.

f:NNf: \mathbb{N} \to \mathbb{N} given by f(x)=2xf(x) = 2x

B.

f:RRf: \mathbb{R} \to \mathbb{R} given by f(x)=x2f(x) = x^2

C.

f:RRf: \mathbb{R} \to \mathbb{R} given by f(x)=3x+1f(x) = 3x + 1

D.

f:ZZf: \mathbb{Z} \to \mathbb{Z} given by f(x)=x+1f(x) = x + 1
Correct Answer: A

Solution:

The function f(x)=2xf(x) = 2x is one-one because different inputs give different outputs, but it is not onto because odd numbers in the codomain cannot be expressed as 2x2x for any natural number xx.

A.

3

B.

5

C.

8

D.

9
Correct Answer: C

Solution:

An equivalence relation partitions a set into disjoint subsets. For a set with 3 elements, the possible partitions are: all elements in one subset (1), each element in its own subset (1), and two elements in one subset with the third in another (3). Therefore, there are a total of 1 + 1 + 3 = 5 possible partitions, but each partition corresponds to an equivalence relation, so the total number of equivalence relations is 8.

A.

{(1, 4), (2, 5), (3, 6)}

B.

{(1, 1), (2, 2), (3, 3)}

C.

{(1, 4), (2, 4), (3, 4)}

D.

{(1, 5), (2, 6), (3, 4)}
Correct Answer: B

Solution:

A reflexive relation on a set AA must include all pairs (a,a)(a, a) for all aAa \in A. Since BB is the codomain, option b is not reflexive on A×BA \times B, but it is reflexive on AA. However, the question is misleading as reflexivity is not typically defined for relations from AA to BB unless A=BA = B. Thus, the correct option is a trick question.

A.

f1(x)=x32f^{-1}(x) = \frac{x - 3}{2}

B.

f1(x)=2x3f^{-1}(x) = 2x - 3

C.

f1(x)=x+32f^{-1}(x) = \frac{x + 3}{2}

D.

f1(x)=x23f^{-1}(x) = \frac{x}{2} - 3
Correct Answer: A

Solution:

To find the inverse of f(x)=2x+3f(x) = 2x + 3, set y=2x+3y = 2x + 3 and solve for xx: x=y32x = \frac{y - 3}{2}. Therefore, the inverse function is f1(x)=x32f^{-1}(x) = \frac{x - 3}{2}.

A.

f1(x)=x73f^{-1}(x) = \frac{x - 7}{3}

B.

f1(x)=x+73f^{-1}(x) = \frac{x + 7}{3}

C.

f1(x)=3x7f^{-1}(x) = 3x - 7

D.

f1(x)=x37f^{-1}(x) = \frac{x}{3} - 7
Correct Answer: A

Solution:

To find the inverse, solve for xx: y=3x+7x=y73y = 3x + 7 \Rightarrow x = \frac{y - 7}{3}. Thus, the inverse function is f1(x)=x73f^{-1}(x) = \frac{x - 7}{3}.

A.

R is reflexive and symmetric but not transitive.

B.

R is symmetric and transitive but not reflexive.

C.

R is reflexive, symmetric, and transitive.

D.

R is not reflexive, symmetric, or transitive.
Correct Answer: C

Solution:

For reflexivity, aa=0a - a = 0 is a multiple of 4, so RR is reflexive. For symmetry, if (a,b)R(a, b) \in R, then aba - b is a multiple of 4, and so is ba=(ab)b - a = -(a - b), hence (b,a)R(b, a) \in R. For transitivity, if (a,b)R(a, b) \in R and (b,c)R(b, c) \in R, then aba - b and bcb - c are multiples of 4, so ac=(ab)+(bc)a - c = (a - b) + (b - c) is also a multiple of 4, hence (a,c)R(a, c) \in R. Therefore, RR is reflexive, symmetric, and transitive.

A.

{(1, 2), (2, 1)}

B.

{(1, 1), (2, 2), (3, 3)}

C.

{(1, 2), (2, 3), (1, 3)}

D.

{(1, 2), (2, 3), (3, 1)}
Correct Answer: A

Solution:

The relation {(1, 2), (2, 1)} is symmetric because if (1, 2) is in the relation, then (2, 1) is also in the relation. However, it is neither reflexive (since not all elements are related to themselves) nor transitive (since there is no (1, 3) or (3, 1) to complete a transitive closure).

A.

The function is one-one and onto.

B.

The function is one-one but not onto.

C.

The function is onto but not one-one.

D.

The function is neither one-one nor onto.
Correct Answer: D

Solution:

The function g(x)=sinxg(x) = \sin x is periodic and not injective, hence it is not one-one. It is also not onto because its range is limited to [1,1][-1, 1], not covering all real numbers.

A.

It is one-one and onto.

B.

It is one-one but not onto.

C.

It is onto but not one-one.

D.

It is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=sinxf(x) = \sin x is periodic with period 2π2\pi, which means it is not one-one over the entire set of real numbers. Additionally, the range of f(x)=sinxf(x) = \sin x is [1,1][-1, 1], meaning it is not onto when considering the entire set of real numbers as the codomain. Therefore, f(x)=sinxf(x) = \sin x is neither one-one nor onto.

A.

Reflexive only

B.

Symmetric only

C.

Transitive only

D.

Reflexive, symmetric, and transitive
Correct Answer: D

Solution:

The relation RR is reflexive because for any real number aa, aa=0a - a = 0, which is an integer. It is symmetric because if aba - b is an integer, then bab - a is also an integer. It is transitive because if aba - b and bcb - c are integers, then ac=(ab)+(bc)a - c = (a - b) + (b - c) is also an integer. Thus, RR is an equivalence relation.

A.

ff is one-one and onto

B.

ff is many-one and onto

C.

ff is one-one but not onto

D.

ff is neither one-one nor onto
Correct Answer: D

Solution:

The function f(x)=x4f(x) = x^4 is neither one-one nor onto because it maps multiple xx values to the same f(x)f(x) value (e.g., f(1)=f(1)f(1) = f(-1)) and does not cover all real numbers.

A.

The composition gfg \circ f is onto.

B.

The composition fgf \circ g is one-one.

C.

The composition gfg \circ f is one-one.

D.

The composition fgf \circ g is onto.
Correct Answer: A

Solution:

The composition gf(x)=(x2)+1g \circ f(x) = (x^2) + 1 is onto because for any real number yy, there exists x=y1x = \sqrt{y-1} such that gf(x)=yg \circ f(x) = y. However, it is not one-one because gf(x)=gf(x)g \circ f(x) = g \circ f(-x).

A.

R\mathbb{R}

B.

[0,)[0, \infty)

C.

(,0](-\infty, 0]

D.

(,)(-\infty, \infty)
Correct Answer: B

Solution:

The function f(x)=x2f(x) = x^2 maps all real numbers to non-negative real numbers, so the range is [0,)[0, \infty).

A.

ff is one-one but not onto

B.

ff is onto but not one-one

C.

ff is both one-one and onto

D.

ff is neither one-one nor onto
Correct Answer: C

Solution:

The function f(x)=2x+1f(x) = 2x + 1 is a linear function with a non-zero slope, hence it is one-one. Since it maps every real number to another real number, covering the entire real line, it is also onto. Therefore, ff is both one-one and onto.

A.

Reflexive only

B.

Symmetric only

C.

Transitive only

D.

Symmetric and Transitive
Correct Answer: B

Solution:

The relation RR is symmetric because if ab|a - b| is odd, then ba|b - a| is also odd, hence (b,a)R(b, a) \in R. However, RR is not reflexive because aa=0|a - a| = 0 is not odd, and it is not transitive because if (a,b)R(a, b) \in R and (b,c)R(b, c) \in R, ac|a - c| is not necessarily odd.

A.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=2x+1f(x) = 2x + 1

B.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x3f(x) = x^3

C.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=xf(x) = |x|

D.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x2f(x) = x^2
Correct Answer: A

Solution:

The function f(x)=2x+1f(x) = 2x + 1 is both one-one and onto, making it a bijection.

A.

fff \circ f is one-one.

B.

fff \circ f is onto.

C.

fff \circ f is neither one-one nor onto.

D.

fff \circ f is both one-one and onto.
Correct Answer: C

Solution:

The function f(x)=sinxf(x) = \sin x is neither one-one nor onto as it maps R\mathbb{R} to [1,1][-1, 1]. The composition ff(x)=sin(sinx)f \circ f(x) = \sin(\sin x) further restricts the range to [sin1,sin1][-\sin 1, \sin 1], making it neither one-one nor onto.

A.

1

B.

2

C.

3

D.

4
Correct Answer: B

Solution:

The smallest equivalence relation containing (1,2)(1, 2) is {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}. Adding (2,3)(2, 3) and (3,2)(3, 2) makes it the universal relation. Thus, there are 2 such relations.

A.

Injective

B.

Surjective

C.

Bijective

D.

None of the above
Correct Answer: C

Solution:

A function that is both one-one (injective) and onto (surjective) is called bijective.

A.

The function is one-one but not onto.

B.

The function is onto but not one-one.

C.

The function is neither one-one nor onto.

D.

The function is both one-one and onto.
Correct Answer: C

Solution:

The function f(x)=3x24x+5f(x) = 3x^2 - 4x + 5 is a quadratic function, which is not one-one because it is not strictly increasing or decreasing over its entire domain. Additionally, it is not onto because a quadratic function with a minimum value (parabola opening upwards) cannot cover the entire range of real numbers. Thus, the function is neither one-one nor onto.

A.

{(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}

B.

{(1,1),(2,2),(3,3),(1,2),(2,3)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}

C.

{(1,1),(2,2),(3,3),(1,2),(2,1),(3,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (3, 1)\}

D.

{(1,1),(2,2),(3,3),(1,2),(2,1),(3,2)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (3, 2)\}
Correct Answer: A

Solution:

The relation {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\} is reflexive and symmetric because it contains all pairs (a,a)(a, a) for aAa \in A and for every (a,b)(a, b), (b,a)(b, a) is also present. It is not transitive because (1,2)(1, 2) and (2,1)(2, 1) are present, but (1,1)(1, 1) is not required for transitivity.

A.

gfg \circ f

B.

fgf \circ g

C.

f+gf + g

D.

gfg - f
Correct Answer: A

Solution:

The composition of two functions ff and gg is denoted by gfg \circ f, which means applying ff first and then gg.

A.

{4,5,6}\{4, 5, 6\}

B.

{4,5}\{4, 5\}

C.

{4,5,6,7}\{4, 5, 6, 7\}

D.

{4,5,6,7,8}\{4, 5, 6, 7, 8\}
Correct Answer: A

Solution:

For a function to be bijective, the sets AA and BB must have the same number of elements. Since AA has 3 elements, BB must also have 3 elements.

A.

It is an equivalence relation.

B.

It is reflexive and symmetric but not transitive.

C.

It is reflexive and transitive but not symmetric.

D.

It is symmetric and transitive but not reflexive.
Correct Answer: A

Solution:

The relation RR is reflexive because aa=0a - a = 0 is divisible by 4 for any integer aa. It is symmetric because if aba - b is divisible by 4, then bab - a is also divisible by 4. It is transitive because if aba - b and bcb - c are divisible by 4, then aca - c is divisible by 4. Thus, RR is an equivalence relation.

A.

1

B.

2

C.

3

D.

4
Correct Answer: B

Solution:

There are two equivalence relations that include the pair (1, 2): {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\} and the universal relation.

A.

gf=fgg \circ f = f \circ g for all xRx \in \mathbb{R}.

B.

gffgg \circ f \neq f \circ g for all xRx \in \mathbb{R}.

C.

gf=fgg \circ f = f \circ g for x=0x = 0, but not for other values.

D.

gffgg \circ f \neq f \circ g for x=0x = 0, but equal for other values.
Correct Answer: B

Solution:

For gf(x)=g(f(x))=cos(3x2)g \circ f(x) = g(f(x)) = \cos(3x^2) and fg(x)=f(g(x))=3(cosx)2f \circ g(x) = f(g(x)) = 3(\cos x)^2. These expressions are not equal for any xx, including x=0x = 0.

A.

The function is one-one and onto.

B.

The function is one-one but not onto.

C.

The function is onto but not one-one.

D.

The function is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one (since f(x)=f(x)f(x) = f(-x)) nor onto (since negative numbers are not in the range).

A.

The function ff is one-one but not onto.

B.

The function ff is onto but not one-one.

C.

The function ff is both one-one and onto.

D.

The function ff is neither one-one nor onto.
Correct Answer: A

Solution:

The function f(x)=exf(x) = e^x is one-one because it is strictly increasing for all xRx \in \mathbb{R}. However, it is not onto because its range is (0,)(0, \infty), not all of R\mathbb{R}.

A.

Reflexive and symmetric but not transitive.

B.

Reflexive and transitive but not symmetric.

C.

Symmetric and transitive but not reflexive.

D.

Reflexive, symmetric, and transitive.
Correct Answer: D

Solution:

For reflexivity, a+a=2aa + a = 2a is even for all aAa \in A. For symmetry, if a+ba + b is even, then b+ab + a is also even. For transitivity, if a+ba + b and b+cb + c are even, then a+ca + c is also even. Thus, RR is reflexive, symmetric, and transitive.

A.

Lines that are parallel to each other.

B.

Lines that intersect at a point.

C.

Lines that are perpendicular to each other.

D.

Lines that have the same slope.
Correct Answer: A

Solution:

The relation of being parallel is reflexive (a line is parallel to itself), symmetric (if line L1L_1 is parallel to L2L_2, then L2L_2 is parallel to L1L_1), and transitive (if L1L_1 is parallel to L2L_2 and L2L_2 is parallel to L3L_3, then L1L_1 is parallel to L3L_3).

A.

The function is one-one but not onto.

B.

The function is onto but not one-one.

C.

The function is both one-one and onto.

D.

The function is neither one-one nor onto.
Correct Answer: A

Solution:

The function f(n)=2nf(n) = 2n is one-one because f(n1)=f(n2)f(n_1) = f(n_2) implies n1=n2n_1 = n_2. However, it is not onto because there is no natural number nn such that f(n)=1f(n) = 1.

A.

One-one only

B.

Onto only

C.

Both one-one and onto

D.

Neither one-one nor onto
Correct Answer: D

Solution:

The function f(x)=2x33x2+1f(x) = 2x^3 - 3x^2 + 1 is neither one-one nor onto. It is not one-one because it is a cubic polynomial which can have turning points, and it is not onto because there is no xx such that f(x)f(x) covers all real numbers.

A.

1

B.

2

C.

3

D.

4
Correct Answer: B

Solution:

A relation is reflexive if it contains all pairs (a,a)(a, a) for aAa \in A. It is symmetric if for every (a,b)(a, b) in the relation, (b,a)(b, a) is also in the relation. To satisfy these conditions and not be transitive, we can have two such relations.

A.

Books with the same number of pages

B.

Books written by the same author

C.

Books published in the same year

D.

Books with the same title
Correct Answer: A

Solution:

The relation 'books with the same number of pages' is reflexive, symmetric, and transitive, making it an equivalence relation.

A.

f(x)=x2f(x) = x^2

B.

f(x)=x+1f(x) = x + 1

C.

f(x)=2xf(x) = 2x

D.

f(x)=1xf(x) = \frac{1}{x}
Correct Answer: A

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one nor onto. It is not one-one because f(x)=f(x)f(x) = f(-x) for any xx. It is not onto because negative numbers are not in the range of f(x)=x2f(x) = x^2.

A.

Yes, ff is invertible

B.

No, ff is not invertible

C.

Yes, ff is invertible but not bijective

D.

No, ff is not invertible but bijective
Correct Answer: A

Solution:

The function f(x)=x+3f(x) = x + 3 maps each element of set A={1,2,3}A = \{1, 2, 3\} to a unique element in set B={4,5,6}B = \{4, 5, 6\}, making it one-one. Since each element of BB is covered, the function is also onto. Therefore, ff is bijective and hence invertible.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: D

Solution:

The function f(x)=x24x+3f(x) = x^2 - 4x + 3 is a quadratic function, which is neither one-one (since it is not injective) nor onto (since it does not cover all real numbers, e.g., there is no xx such that f(x)=1f(x) = -1).

A.

3

B.

6

C.

9

D.

12
Correct Answer: B

Solution:

The number of one-one functions from a set to itself is the number of permutations of the set. For a set with 3 elements, this is 3!=63! = 6.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: D

Solution:

The function f(x)=x24x+3f(x) = x^2 - 4x + 3 is a quadratic function, which is neither one-one (as it is not injective) nor onto (as it does not cover all real numbers as outputs).

A.

Reflexive

B.

Symmetric

C.

Transitive

D.

None of the above
Correct Answer: D

Solution:

The relation RR is not reflexive as it does not include pairs like (1,1)(1, 1). It is not symmetric because (1,2)(1, 2) is in RR but (2,1)(2, 1) is not. It is not transitive because (1,2)(1, 2) and (2,3)(2, 3) are in RR, but (1,3)(1, 3) is not. Hence, none of the properties are satisfied.

A.

{(1, 4), (2, 5), (3, 6)}

B.

{(1, 5), (2, 4), (3, 5)}

C.

{(1, 4), (1, 5), (2, 6)}

D.

{(2, 5), (3, 6), (3, 4)}
Correct Answer: A

Solution:

A relation from AA to BB is a subset of A×BA \times B. Option A is a valid subset.

A.

One-one

B.

Onto

C.

Bijective

D.

Neither one-one nor onto
Correct Answer: A

Solution:

The function ff is one-one because each element of AA maps to a unique element in BB. However, it is not onto because not every element in BB is an image of some element in AA.

A.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x2f(x) = x^2

B.

f:R+R+f: \mathbb{R}^+ \to \mathbb{R}^+ defined by f(x) = \ln(x)$

C.

f:NNf: \mathbb{N} \to \mathbb{N} defined by f(x)=2xf(x) = 2x

D.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x3f(x) = x^3
Correct Answer: D

Solution:

The function f(x)=x3f(x) = x^3 is a cubic polynomial, which is strictly increasing over the entire set of real numbers. This means it is one-one. Additionally, for every real number yy, there exists a real number xx such that f(x)=yf(x) = y, meaning it is onto. Therefore, f(x)=x3f(x) = x^3 is both one-one and onto.

A.

ff is one-one and onto.

B.

ff is one-one but not onto.

C.

ff is onto but not one-one.

D.

ff is neither one-one nor onto.
Correct Answer: B

Solution:

The function f(n)=n2+1f(n) = n^2 + 1 is one-one because if f(a)=f(b)f(a) = f(b), then a2+1=b2+1a^2 + 1 = b^2 + 1, which implies a=ba = b. However, it is not onto because there is no natural number nn such that f(n)=1f(n) = 1, for instance.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: D

Solution:

The modulus function f(x)=xf(x) = |x| is neither one-one nor onto. It is not one-one because f(x)=f(x)f(x) = f(-x) for x0x \neq 0, and it is not onto because it does not map to negative numbers.

A.

The function is one-one but not onto.

B.

The function is onto but not one-one.

C.

The function is both one-one and onto.

D.

The function is neither one-one nor onto.
Correct Answer: C

Solution:

A bijective function is both one-one (injective) and onto (surjective).

A.

The function gg is one-one and onto.

B.

The function gg is one-one but not onto.

C.

The function gg is onto but not one-one.

D.

The function gg is neither one-one nor onto.
Correct Answer: B

Solution:

The function g(x)=e2x5g(x) = e^{2x} - 5 is strictly increasing because the derivative g(x)=2e2x>0g'(x) = 2e^{2x} > 0 for all xx. Therefore, gg is one-one. However, g(x)g(x) approaches 5-5 as xx \to -\infty and grows without bound as xx \to \infty, thus it is not onto since it cannot achieve values less than 5-5.

A.

R = {(1, 2), (2, 1)}

B.

R = {(1, 2), (2, 3)}

C.

R = {(1, 1), (2, 2)}

D.

R = {(1, 3), (3, 2)}
Correct Answer: A

Solution:

A symmetric relation satisfies (a,b)R    (b,a)R(a, b) \in R \implies (b, a) \in R. Option A satisfies this condition.

A.

f is one-one but not onto

B.

f is onto but not one-one

C.

f is both one-one and onto

D.

f is neither one-one nor onto
Correct Answer: C

Solution:

A bijective function is both one-one (injective) and onto (surjective).

A.

R = {(1, 2), (2, 1)}

B.

R = {(1, 1), (2, 2), (3, 3)}

C.

R = {(1, 2), (2, 3), (1, 3)}

D.

R = {(1, 2), (2, 3)}
Correct Answer: A

Solution:

The relation R = {(1, 2), (2, 1)} is symmetric because if (1, 2) is in R, then (2, 1) is also in R. However, it is not reflexive because not all elements are related to themselves, and it is not transitive because (1, 2) and (2, 1) do not imply (1, 1).

A.

It is one-one and onto.

B.

It is one-one but not onto.

C.

It is onto but not one-one.

D.

It is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one nor onto. It is not one-one because f(x)=f(x)f(x) = f(-x) for any xx. It is not onto because negative numbers are not in the range of f(x)=x2f(x) = x^2.

A.

R = {(a, a) : a ∈ A}

B.

R = {(a, b) : a < b}

C.

R = {(a, b) : a ≠ b}

D.

R = {(a, b) : a > b}
Correct Answer: A

Solution:

A reflexive relation on a set A is one where every element is related to itself, i.e., (a, a) is in the relation for all a in A.

A.

The function is one-one and onto.

B.

The function is one-one but not onto.

C.

The function is onto but not one-one.

D.

The function is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=3x2f(x) = 3x^2 is neither one-one nor onto. It is not one-one because f(x)=f(x)f(x) = f(-x) for any xx. It is not onto because negative numbers are not in the range of f(x)=3x2f(x) = 3x^2.

A.

R = {(a, b) : a = b}

B.

R = {(a, b) : |a - b| \text{ is even}}

C.

R = {(a, b) : a < b}

D.

R = {(a, b) : a + b = 5}
Correct Answer: B

Solution:

The relation R={(a,b):ab is even}R = \{(a, b) : |a - b| \text{ is even}\} is an equivalence relation because it is reflexive, symmetric, and transitive. Reflexivity holds as aa=0|a - a| = 0 is even. Symmetry holds because if ab|a - b| is even, then ba|b - a| is also even. Transitivity holds because if ab|a - b| and bc|b - c| are even, then ac|a - c| is also even.

A.

R is reflexive, symmetric, and transitive.

B.

R is reflexive and symmetric but not transitive.

C.

R is symmetric and transitive but not reflexive.

D.

R is reflexive and transitive but not symmetric.
Correct Answer: A

Solution:

The relation RR is reflexive because for any aAa \in A, aa=0|a - a| = 0 is even. It is symmetric because if ab|a - b| is even, then ba|b - a| is also even. It is transitive because if ab|a - b| and bc|b - c| are even, then ac=ab+bc|a - c| = |a - b| + |b - c| is also even.

A.

One-one only

B.

Onto only

C.

Both one-one and onto

D.

Neither one-one nor onto
Correct Answer: A

Solution:

The function f(n)=n2+n+1f(n) = n^2 + n + 1 is one-one because for any n1,n2Nn_1, n_2 \in \mathbb{N}, if f(n1)=f(n2)f(n_1) = f(n_2), then n1=n2n_1 = n_2. However, it is not onto because not all natural numbers can be expressed in the form n2+n+1n^2 + n + 1.

A.

It is reflexive, symmetric, and transitive.

B.

It is only reflexive.

C.

It is symmetric and transitive but not reflexive.

D.

It is neither reflexive nor symmetric.
Correct Answer: A

Solution:

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

A.

fff \circ f is one-one and onto.

B.

fff \circ f is one-one but not onto.

C.

fff \circ f is onto but not one-one.

D.

fff \circ f is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=3x2f(x) = 3x^2 is neither one-one nor onto because it maps both positive and negative values of xx to the same value and does not cover all real numbers (e.g., negative numbers are not in the range). Thus, fff \circ f is also neither one-one nor onto.

A.

f(x)=2xf(x) = 2x

B.

f(x)=x+1f(x) = x + 1

C.

f(x)=x2f(x) = x^2

D.

f(x)=x1f(x) = x - 1
Correct Answer: A

Solution:

The function f(x)=2xf(x) = 2x is one-one because for f(x1)=f(x2)f(x_1) = f(x_2), we have 2x1=2x22x_1 = 2x_2 which implies x1=x2x_1 = x_2. However, it is not onto because there is no natural number xx such that f(x)=1f(x) = 1.

A.

One-one only

B.

Onto only

C.

Both one-one and onto

D.

Neither one-one nor onto
Correct Answer: D

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one nor onto when the domain and co-domain are both R\mathbb{R}. It is not one-one because f(x)=f(x)f(x) = f(-x), and it is not onto because negative numbers are not in the range.

A.

ff is one-one and onto.

B.

ff is one-one but not onto.

C.

ff is onto but not one-one.

D.

ff is neither one-one nor onto.
Correct Answer: D

Solution:

The function f(x)=x2f(x) = x^2 is neither one-one (since f(x)=f(x)f(x) = f(-x) for any xx) nor onto (since negative numbers are not in the range of ff).

A.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=x2f(x) = x^2

B.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=exf(x) = e^x

C.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=sinxf(x) = \sin x

D.

f:RRf: \mathbb{R} \to \mathbb{R} defined by f(x)=3x+2f(x) = 3x+2
Correct Answer: A

Solution:

The function f(x)=x2f(x) = x^2 is not one-one because f(x)=f(x)f(x) = f(-x) for any xx. It is also not onto because negative numbers are not in the range of f(x)=x2f(x) = x^2.

A.

f(x)=x3f(x) = x^3 over R\mathbb{R}

B.

f(x)=x2f(x) = x^2 over R\mathbb{R}

C.

f(x)=exf(x) = e^x over R\mathbb{R}

D.

f(x)=sin(x)f(x) = \sin(x) over R\mathbb{R}
Correct Answer: A

Solution:

The function f(x)=x3f(x) = x^3 is invertible over R\mathbb{R} because it is both one-one and onto. The function f(x)=x2f(x) = x^2 is not invertible over R\mathbb{R} because it is not one-one. The function f(x)=exf(x) = e^x is one-one and onto R+\mathbb{R}^+, but not onto R\mathbb{R}. The function f(x)=sin(x)f(x) = \sin(x) is not one-one over R\mathbb{R}.

A.

f is one-one and onto.

B.

f is one-one but not onto.

C.

f is onto but not one-one.

D.

f is neither one-one nor onto.
Correct Answer: A

Solution:

The function f(x)=1xf(x) = \frac{1}{x} is one-one because if f(x1)=f(x2)f(x_1) = f(x_2), then 1x1=1x2\frac{1}{x_1} = \frac{1}{x_2} implies x1=x2x_1 = x_2. It is onto because for any yRy \in \mathbb{R}, y0y \neq 0, there exists x=1yx = \frac{1}{y} such that f(x)=yf(x) = y. Therefore, ff is both one-one and onto.

A.

One-one but not onto.

B.

Onto but not one-one.

C.

Both one-one and onto.

D.

Neither one-one nor onto.
Correct Answer: A

Solution:

The function f(n)=n2+n+1f(n) = n^2 + n + 1 is strictly increasing for nNn \in \mathbb{N}, hence it is one-one. However, not every natural number can be expressed in the form n2+n+1n^2 + n + 1, so it is not onto.

A.

It is one-one but not onto.

B.

It is onto but not one-one.

C.

It is both one-one and onto.

D.

It is neither one-one nor onto.
Correct Answer: C

Solution:

The function f(x)=x33xf(x) = x^3 - 3x is a cubic polynomial, which is continuous and differentiable everywhere. The derivative f(x)=3x23f'(x) = 3x^2 - 3 is zero at x=±1x = \pm 1, indicating local extrema. However, the function still covers all real values as x±x \to \pm \infty, making it onto. Since it is a cubic function, it is also one-one. Thus, the function is both one-one and onto.

A.

Reflexive

B.

Symmetric

C.

Transitive

D.

Equivalence
Correct Answer: B

Solution:

The relation RR is symmetric because if ab|a - b| is a prime number, then ba|b - a| is also a prime number. However, it is not reflexive because aa=0|a - a| = 0 is not a prime number. It is not transitive because if ab|a - b| and bc|b - c| are prime, ac|a - c| may not be a prime. Hence, RR is not an equivalence relation.

A.

Yes, because every odd number in N\mathbb{N} is an image of some nn.

B.

No, because not every natural number is an image of some nn.

C.

Yes, because every even number in N\mathbb{N} is an image of some nn.

D.

No, because ff is not defined for all nn.
Correct Answer: A

Solution:

The function f(n)=2n+1f(n) = 2n + 1 maps natural numbers to odd numbers in N\mathbb{N}. Every odd number can be expressed as 2n+12n + 1 for some nNn \in \mathbb{N}, hence ff is onto.

A.

x2+2x+4x^2 + 2x + 4

B.

x2+4x^2 + 4

C.

x2+4x+4x^2 + 4x + 4

D.

x2+2xx^2 + 2x
Correct Answer: C

Solution:

The composition gf(x)=g(f(x))=g(x+2)=(x+2)2=x2+4x+4g \circ f(x) = g(f(x)) = g(x + 2) = (x + 2)^2 = x^2 + 4x + 4.

A.

R = {(1, 2), (2, 1)}

B.

R = {(1, 1), (2, 2), (1, 2)}

C.

R = {(1, 2), (2, 3), (1, 3)}

D.

R = {(1, 1), (2, 2), (3, 3)}
Correct Answer: A

Solution:

A symmetric relation is one where if (a,b)R(a, b) \in R, then (b,a)R(b, a) \in R. The relation in option A is symmetric but not reflexive or transitive.

A.

f is one-one and onto.

B.

f is one-one but not onto.

C.

f is onto but not one-one.

D.

f is neither one-one nor onto.
Correct Answer: B

Solution:

The function f(n)=n2f(n) = n^2 is one-one because different natural numbers have different squares. However, it is not onto because not every natural number is a perfect square, so not all natural numbers are in the range of ff.

A.

ff is one-one and onto.

B.

ff is one-one but not onto.

C.

ff is onto but not one-one.

D.

ff is neither one-one nor onto.
Correct Answer: D

Solution:

The modulus function f(x)=xf(x) = |x| is not one-one because f(x)=f(x)f(x) = f(-x) for any xx. It is not onto because there is no xx such that f(x)f(x) is negative.

A.

Reflexive

B.

Symmetric

C.

Transitive

D.

None of the above
Correct Answer: D

Solution:

The relation RR is not reflexive because not all pairs (a,a)(a, a) satisfy a+a>4a + a > 4. It is not symmetric because if (a,b)R(a, b) \in R, b+ab + a may not be greater than 4. It is not transitive because (a,b)R(a, b) \in R and (b,c)R(b, c) \in R does not imply (a,c)R(a, c) \in R. Hence, RR satisfies none of these properties.

A.

{(1,4),(2,5),(3,6)}\{(1, 4), (2, 5), (3, 6)\}

B.

{(1,5),(2,4)}\{(1, 5), (2, 4)\}

C.

{(1,4),(2,5),(3,7)}\{(1, 4), (2, 5), (3, 7)\}

D.

{(1,4),(2,5),(3,6),(1,5)}\{(1, 4), (2, 5), (3, 6), (1, 5)\}
Correct Answer: A

Solution:

A relation from AA to BB is a subset of A×BA \times B. Option (a) is a valid subset.

A.

ff is one-one but not onto.

B.

ff is onto but not one-one.

C.

ff is both one-one and onto.

D.

ff is neither one-one nor onto.
Correct Answer: A

Solution:

The function f(x)=2xf(x) = 2x is one-one because if f(x1)=f(x2)f(x_1) = f(x_2), then 2x1=2x22x_1 = 2x_2 implies x1=x2x_1 = x_2. It is not onto because there is no natural number xx such that f(x)=1f(x) = 1.

A.

R is reflexive.

B.

R is symmetric.

C.

R is transitive.

D.

R is an equivalence relation.
Correct Answer: C

Solution:

The relation RR is a set of ordered pairs where each element from set AA is related to a unique element in set BB. It is not reflexive because not all elements of AA are related to themselves. It is not symmetric because if (1,4)R(1, 4) \in R, then (4,1)R(4, 1) \notin R. However, it is transitive because there are no elements a,b,ca, b, c such that (a,b)R(a, b) \in R and (b,c)R(b, c) \in R but (a,c)R(a, c) \notin R. Therefore, RR is transitive.

A.

The function ff is one-one but not onto.

B.

The function ff is onto but not one-one.

C.

The function ff is both one-one and onto.

D.

The function ff is neither one-one nor onto.
Correct Answer: A

Solution:

The function ff maps each element of set AA to a unique element in set BB, hence it is one-one. However, not all elements of set BB are covered by the mapping, specifically 77 is not an image of any element in AA, so it is not onto.

A.

{(1,1),(2,2),(3,3),(1,3)}\{(1, 1), (2, 2), (3, 3), (1, 3)\}

B.

{(1,1),(2,2),(3,3),(2,1)}\{(1, 1), (2, 2), (3, 3), (2, 1)\}

C.

{(1,1),(2,2),(3,3),(3,2)}\{(1, 1), (2, 2), (3, 3), (3, 2)\}

D.

{(1,1),(2,2),(3,3),(3,1)}\{(1, 1), (2, 2), (3, 3), (3, 1)\}
Correct Answer: A

Solution:

To make RR reflexive, we need to add (1,1),(2,2),(3,3)(1, 1), (2, 2), (3, 3). To make it transitive, we need to add (1,3)(1, 3) because (1,2)(1, 2) and (2,3)(2, 3) imply (1,3)(1, 3). Adding (1,3)(1, 3) does not make it symmetric.

A.

The inverse of ff is ln(x)\ln(x) and it is defined for all xRx \in \mathbb{R}

B.

The inverse of ff is ln(x)\ln(x) and it is defined for x>0x > 0

C.

The inverse of ff is ln(x)\ln(x) and it is defined for x0x \geq 0

D.

The inverse of ff is ln(x)\ln(x) and it is defined for x<0x < 0
Correct Answer: B

Solution:

The function f(x)=exf(x) = e^x is one-one and onto from R\mathbb{R} to (0,)(0, \infty). Its inverse is ln(x)\ln(x), which is defined for x>0x > 0.

A.

The function is one-one and onto.

B.

The function is many-one and onto.

C.

The function is one-one but not onto.

D.

The function is neither one-one nor onto.
Correct Answer: A

Solution:

The function f(x)=3xf(x) = 3x is both one-one and onto because for every yRy \in \mathbb{R}, there exists an xRx \in \mathbb{R} such that f(x)=yf(x) = y and f(x1)=f(x2)f(x_1) = f(x_2) implies x1=x2x_1 = x_2.

A.

1

B.

2

C.

3

D.

4
Correct Answer: B

Solution:

A relation is reflexive if it contains all pairs of the form (a,a)(a, a) for aAa \in A. It is symmetric if for every pair (a,b)(a, b) in the relation, the pair (b,a)(b, a) is also in the relation. However, to ensure the relation is not transitive, we must avoid including certain pairs that would complete transitive triples. Thus, the number of such relations is 2.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: A

Solution:

The function ff is one-one and onto because each element in AA maps to a unique element in BB, and every element in BB is an image of some element in AA.

A.

Reflexive only

B.

Symmetric only

C.

Transitive only

D.

Reflexive and symmetric
Correct Answer: B

Solution:

The relation RR is symmetric because if (a,b)R(a, b) \in R, then (b,a)R(b, a) \in R. However, it is neither reflexive (since (1,1)(1, 1), (2,2)(2, 2), and (3,3)(3, 3) are not in RR) nor transitive (since (1,2)(1, 2) and (2,1)(2, 1) do not imply (1,1)R(1, 1) \in R).

A.

The function is one-one and onto.

B.

The function is one-one but not onto.

C.

The function is onto but not one-one.

D.

The function is neither one-one nor onto.
Correct Answer: B

Solution:

The function f(n)=n+1f(n) = n + 1 is injective (one-one) because different inputs give different outputs. However, it is not surjective (onto) because there is no natural number nn such that f(n)=1f(n) = 1.

A.

1

B.

3

C.

6

D.

9
Correct Answer: C

Solution:

The number of one-one functions from a set to itself is the same as the number of permutations of the set, which is 3!=63! = 6.

A.

R is reflexive.

B.

R is symmetric.

C.

R is transitive.

D.

R is neither reflexive, symmetric, nor transitive.
Correct Answer: D

Solution:

The relation RR is not reflexive because there is no aa such that aa=1a - a = 1. It is not symmetric because if (a,b)R(a, b) \in R, then ab=1a - b = 1, but ba=1b - a = -1, so (b,a)R(b, a) \notin R. It is not transitive because if (a,b)R(a, b) \in R and (b,c)R(b, c) \in R, then ab=1a - b = 1 and bc=1b - c = 1, but ac=2a - c = 2, so (a,c)R(a, c) \notin R. Thus, RR is neither reflexive, symmetric, nor transitive.

A.

{(1,2),(2,1)}\{(1, 2), (2, 1)\}

B.

{(1,1),(2,2),(3,3)}\{(1, 1), (2, 2), (3, 3)\}

C.

{(1,2),(2,3),(1,3)}\{(1, 2), (2, 3), (1, 3)\}

D.

{(1,2),(2,3)}\{(1, 2), (2, 3)\}
Correct Answer: A

Solution:

Option (a) is symmetric because if (1,2)(1, 2) is in the relation, then (2,1)(2, 1) is also in the relation. However, it is neither reflexive nor transitive.

A.

ff is one-one and onto.

B.

ff is one-one but not onto.

C.

ff is onto but not one-one.

D.

ff is neither one-one nor onto.
Correct Answer: B

Solution:

The function f(n)=2nf(n) = 2n is one-one because different inputs give different outputs, but it is not onto because odd numbers are not in the range.

A.

gg is one-one and onto

B.

gg is one-one but not onto

C.

gg is onto but not one-one

D.

gg is neither one-one nor onto
Correct Answer: D

Solution:

The function g(x)=x24x+4g(x) = x^2 - 4x + 4 can be rewritten as (x2)2(x-2)^2, which is a parabola opening upwards with vertex at (2,0)(2, 0). It is not one-one because it fails the horizontal line test. It is not onto because its range is [0,)[0, \infty), not the entire set of real numbers.

A.

ff is one-one and onto

B.

ff is one-one but not onto

C.

ff is onto but not one-one

D.

ff is neither one-one nor onto
Correct Answer: B

Solution:

The function f(n)=2n+1f(n) = 2n + 1 is one-one because different inputs give different outputs. However, it is not onto because there is no natural number nn such that f(n)=2mf(n) = 2m for any even natural number mm.

True or False

Correct Answer: True

Solution:

The universal relation on a set XX includes all possible pairs from XX, hence it is R=X×XR = X \times X.

Correct Answer: False

Solution:

A symmetric relation only requires that if (a,b)(a, b) is in the relation, then (b,a)(b, a) must also be in the relation. It does not require that (a,a)(a, a) is in the relation for all aa.

Correct Answer: True

Solution:

A function is invertible if there exists a function g:YXg: Y \to X such that gf=IXg \circ f = I_X and fg=IYf \circ g = I_Y. This requires ff to be both one-one and onto.

Correct Answer: True

Solution:

The identity function maps each element to itself, so every element in the domain has a corresponding element in the co-domain, making it onto.

Correct Answer: True

Solution:

A relation is symmetric if for every (a, b) in R, (b, a) is also in R. Here, both (1, 2) and (2, 1) are present, so the relation is symmetric.

Correct Answer: True

Solution:

A reflexive relation requires that every element is related to itself, which is represented by the pair (a, a).

Correct Answer: True

Solution:

A function from a set AA to itself that is one-one and onto is a permutation of AA. Thus, the set of all such functions is equivalent to the set of permutations of AA.

Correct Answer: True

Solution:

For a function to have an inverse, it must be bijective, meaning it is both injective (one-one) and surjective (onto).

Correct Answer: True

Solution:

R. Descartes first used the word 'function' in 1637 in his manuscript 'Geometrie'.

Correct Answer: True

Solution:

R. Descartes used the word 'function' in his manuscript 'Geometrie' in 1637 to describe some positive integral power of a variable.

Correct Answer: True

Solution:

A function is invertible if there exists an inverse function such that the composition of the function and its inverse yields the identity function. This requires the function to be both injective and surjective.

Correct Answer: True

Solution:

A function is invertible if there exists a function g:BAg: B \to A such that gf=IAg \circ f = I_A and fg=IBf \circ g = I_B, which is possible only if ff is both one-one and onto.

Correct Answer: True

Solution:

The set of all odd integers is an equivalence class because all odd integers are related to each other under the relation of congruence modulo 2, and no odd integer is related to any even integer.

Correct Answer: False

Solution:

The modulus function f(x)=xf(x) = |x| is neither one-one nor onto. It maps both positive and negative values of xx to the same non-negative value, and it does not cover all real numbers as its range.

Correct Answer: False

Solution:

For a relation to be reflexive, every element x in the set must relate to itself, i.e., (x, x) must be in R. However, for R = {(x, y) : y = x + 5 and x < 4}, there is no x such that x = x + 5, so R is not reflexive.

Correct Answer: True

Solution:

The identity function maps each element to itself, ensuring it is both one-one and onto, thus making it bijective.

Correct Answer: False

Solution:

The function f(x)=2xf(x) = 2x is not onto because there is no natural number xx such that f(x)=1f(x) = 1, hence not every element in the co-domain has a pre-image.

Correct Answer: False

Solution:

The composition of two functions ff and gg, denoted as gfg \circ f, is not necessarily equal to fgf \circ g. The order of composition matters.

Correct Answer: False

Solution:

The modulus function f(x)=xf(x) = |x| is not onto because negative numbers are not in the range of f(x)f(x).

Correct Answer: True

Solution:

A relation from set AA to set BB is defined as a subset of the Cartesian product A×BA \times B.

Correct Answer: True

Solution:

By definition, a relation from set AA to set BB is any subset of the Cartesian product A×BA \times B. This means that each relation is indeed a subset of the Cartesian product of the two sets.

Correct Answer: False

Solution:

The modulus function is not one-one because different inputs can produce the same output, e.g., f(1) = 1 and f(-1) = 1.

Correct Answer: True

Solution:

The set theoretic definition of a function is indeed an abstraction of the definition given by Dirichlet, as stated in the historical note.

Correct Answer: True

Solution:

For finite sets of the same size, a function that is one-one (injective) is also onto (surjective), and vice versa.

Correct Answer: True

Solution:

A symmetric relation only requires that if (a,b)(a, b) is in the relation, then (b,a)(b, a) must also be in the relation. It does not require reflexivity or transitivity.

Correct Answer: True

Solution:

A symmetric relation requires that if one element is related to another, then the reverse must also be true.

Correct Answer: True

Solution:

A function is onto (surjective) if every element in the co-domain B is an image of at least one element from the domain A, meaning the range of f is B.

Correct Answer: True

Solution:

The modulus function is not one-one because different inputs can produce the same output (e.g., f(1)=f(1)=1f(-1) = f(1) = 1), and it is not onto because negative numbers are not in its range.

Correct Answer: False

Solution:

The modulus function is neither one-one nor onto; it maps both positive and negative values of xx to the same non-negative value.

Correct Answer: True

Solution:

Since f is one-one, each element of the domain {1, 2, 3} is mapped to a unique element in the co-domain {1, 2, 3}. Therefore, all elements in the co-domain must be covered, making f onto.

Correct Answer: True

Solution:

If f: A → B and g: B → C are both invertible, then their composition g∘f: A → C is also invertible. The inverse of g∘f is (f⁻¹∘g⁻¹).

Correct Answer: True

Solution:

By definition, a symmetric relation RR satisfies the condition that if (a,b)R(a, b) \in R, then (b,a)R(b, a) \in R for all a,bXa, b \in X.

Correct Answer: True

Solution:

An equivalence relation partitions a set into equivalence classes, where each element is related to every other element in the same class.

Correct Answer: True

Solution:

By definition, a reflexive relation on a set XX includes every element related to itself, meaning (a,a)(a, a) must be in the relation for every aXa \in X.

Correct Answer: True

Solution:

An equivalence relation partitions a set into equivalence classes, where each element is related to every other element in its class, and no element is related to any element in a different class.

Correct Answer: True

Solution:

The identity function f: N → N defined by f(x) = x is onto because every element in the co-domain has a pre-image in the domain, specifically itself.

Correct Answer: False

Solution:

A relation is reflexive if every element is related to itself. For R = {(x, y) : y = x + 1}, no element x is related to itself because x + 1 ≠ x. Hence, R is not reflexive.

Correct Answer: True

Solution:

A reflexive relation requires that every element is related to itself, hence all pairs (a,a)(a, a) must be included.

Correct Answer: False

Solution:

The composition of two functions ff and gg, denoted as gfg \circ f, is not necessarily equal to fgf \circ g. The order of composition matters, and thus it is not always commutative.

Correct Answer: False

Solution:

Function composition is not commutative; g \circ f(x) = g(f(x)) is generally not the same as f \circ g(x) = f(g(x)).

Correct Answer: True

Solution:

The identity function maps each element to itself, which means it is both one-one (injective) and onto (surjective) for any set, including finite sets.

Correct Answer: True

Solution:

The relation R is reflexive because any book has the same number of pages as itself. It is symmetric because if book x has the same number of pages as book y, then y has the same number of pages as x. It is transitive because if book x has the same number of pages as book y, and book y has the same number of pages as book z, then book x has the same number of pages as book z. Thus, R is an equivalence relation.

Correct Answer: True

Solution:

If both f and g are invertible, then there exist functions f⁻¹: B → A and g⁻¹: C → B such that f⁻¹∘f = I_A and g⁻¹∘g = I_B. The composition g∘f is invertible with the inverse being f⁻¹∘g⁻¹.

Correct Answer: True

Solution:

The identity function maps each element to itself, covering all elements in the set, hence it is onto.

Correct Answer: True

Solution:

The identity function maps each element to itself, ensuring that it is both injective (one-one) and surjective (onto).

Correct Answer: True

Solution:

A function is called bijective if it is both one-one (injective) and onto (surjective).

Correct Answer: True

Solution:

For a finite set, a function that is one-one must map each element of the domain to a unique element in the co-domain, which means all elements in the co-domain are covered, making the function onto.

Correct Answer: True

Solution:

A reflexive relation requires that for every element 'a' in set X, the pair (a, a) is in the relation.

Correct Answer: True

Solution:

A function f:XYf: X \to Y is invertible if there exists a function g:YXg: Y \to X such that gf=IXg \circ f = I_X and fg=IYf \circ g = I_Y, where IXI_X and IYI_Y are identity functions on XX and YY, respectively.

Correct Answer: True

Solution:

By definition, an equivalence relation on a set must satisfy the properties of reflexivity, symmetry, and transitivity.

Correct Answer: True

Solution:

A relation is an equivalence relation if it is reflexive, symmetric, and transitive. For R = {(a, b) : a - b is even}, it satisfies all these properties: reflexive (a - a = 0 is even), symmetric (if a - b is even, then b - a is also even), and transitive (if a - b is even and b - c is even, then a - c is even).

Correct Answer: False

Solution:

The function f(x) = 2x maps natural numbers to even natural numbers. There is no x in N such that f(x) = 1, which is an odd number. Therefore, f is not onto.

Correct Answer: False

Solution:

A function is one-one if different elements in the domain map to different elements in the co-domain. For f(x) = x^2, f(1) = 1 and f(-1) = 1, which means f is not one-one.