Practice Questions

Relations and Functions

1
easySubjective

Consider the set S={1,2,3,4}S = \{1, 2, 3, 4\}. Create a relation R on S that is reflexive and symmetric but fails to be transitive. Justify your construction.

2
easySubjective

Explain the difference between a relation and a function with a simple example.

3
easySubjective

Justify whether the function f:ZZf: \mathbf{Z} \to \mathbf{Z} defined by f(x)=x+xf(x) = |x| + x is injective.

4
easySubjective

Identify if the relation R = {(1,1), (2,2), (3,3)} on set A = {1, 2, 3} is reflexive.

5
easySubjective

Define a universal relation.

6
easySubjective

Let the set be A={a,b,c}A = \{a, b, c\}. Analyze if the relation R={(a,a),(b,b),(a,c)}R = \{(a, a), (b, b), (a, c)\} defined on set A is reflexive. Justify your answer.

7
easySubjective

Describe the conditions for a relation R on a set A to be an equivalence relation.

8
easySubjective

Analyze if the function f:ZZf: \mathbf{Z} \rightarrow \mathbf{Z} defined by f(x)=xf(x) = |x| is one-one.

9
easySubjective

Let SS be the set of all straight lines in the Cartesian plane. A relation RR is defined on SS as L1RL2L_1 R L_2 if L1L_1 is parallel to L2L_2. Justify that RR is an equivalence relation. (Note: A line is considered parallel to itself).

10
easySubjective

Given two functions f(x)=x2f(x) = x^2 and g(x)=x+3g(x) = x + 3, calculate the value of (gof)(2)(gof)(2).

11
easySubjective

What is a bijective function?

12
mediumSubjective

Let R be a relation on the set of integers Z\mathbf{Z} defined by aRbaRb if a2b2a^2 - b^2 is divisible by 3. Prove that R is an equivalence relation.

13
mediumSubjective

If f:RRf: \mathbf{R} \rightarrow \mathbf{R} and g:RRg: \mathbf{R} \rightarrow \mathbf{R} are given by f(x)=xf(x) = |x| and g(x)=5x2g(x) = 5x - 2, calculate fog(x)fog(x) and gof(x)gof(x). Demonstrate that foggoffog \neq gof.

14
mediumSubjective

Explain what is meant by the domain of a relation R from a set A to a set B.

15
mediumSubjective

Summarize the properties of a symmetric relation. Given an example of a relation that is symmetric but not reflexive.

16
mediumSubjective

Define an empty relation in a set A.

17
mediumSubjective

Let A = {1, 2, 3}. List the elements of the relation R = {(a, b) : |a - b| = 1}. Also, state its domain and range.

18
mediumSubjective

Explain why the function f: N → N given by f(x) = x + 1 is one-one but not onto.

19
mediumSubjective

Given a function f: {1, 2} → {a, b} defined by f(1) = a, f(2) = b, and a function g: {a, b} → {x, y} defined by g(a) = x, g(b) = y. Describe the composition function gof.

20
mediumSubjective

Define reflexive, symmetric, and transitive relations. Provide one example for each type of relation on the set A = {a, b, c}.

21
mediumSubjective

Explain the concepts of one-one (injective) and onto (surjective) functions. Give an example of a function that is one-one but not onto, and another example that is onto but not one-one, using finite sets.

22
mediumSubjective

Analyze the injectivity and surjectivity of the function f:RRf: \mathbf{R} \rightarrow \mathbf{R} given by f(x)=3x+5f(x) = 3x + 5.

23
mediumSubjective

Let A={1,2,3}A = \{1, 2, 3\}. A relation RR is defined on AA as R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3)}R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3)\}. Examine if RR is reflexive, symmetric, or transitive.

24
mediumSubjective

Demonstrate that the relation R in the set {1,2,3}\{1, 2, 3\} given by R={(1,2),(2,1)}R = \{(1, 2), (2, 1)\} is symmetric but neither reflexive nor transitive.

25
mediumSubjective

Let L be the set of all lines in the XY plane. A relation R is defined on L as R={(L1,L2):L1R = \{(L_1, L_2) : L_1 is parallel to L2}L_2\}. Analyze if R is an equivalence relation.

26
mediumSubjective

Create a relation R on the set A = {1, 2, 3} that is symmetric and transitive, but not reflexive. Justify your answer.

27
mediumSubjective

Formulate a concise argument to prove that a function f:ABf: A \to B from a finite set A to a smaller finite set B (where A>B|A| > |B|) cannot be injective.

28
mediumSubjective

Create a function f:NNf: \mathbf{N} \to \mathbf{N} that is surjective but not injective, and justify both properties.

29
mediumSubjective

Let A=R{2}A = \mathbf{R} - \{2\} and B=R{1}B = \mathbf{R} - \{1\}. The function f:ABf: A \to B is defined by f(x)=x1x2f(x) = \frac{x-1}{x-2}. Formulate the inverse function g:BAg: B \to A and justify that it is indeed the inverse by showing gf=IAg \circ f = I_A and fg=IBf \circ g = I_B.

30
mediumSubjective

Let f:ABf: A \to B and g:BCg: B \to C be two surjective functions. Formulate a proof to show that the composition gf:ACg \circ f: A \to C is also surjective.

31
mediumSubjective

Formulate a proof to show that if R1R_1 and R2R_2 are two equivalence relations on a set AA, then their intersection R1R2R_1 \cap R_2 is also an equivalence relation on AA.

32
mediumSubjective

Let f:RRf: \mathbf{R} \to \mathbf{R} be defined by f(x)=sin(x)f(x) = \sin(x) and g:RRg: \mathbf{R} \to \mathbf{R} be defined by g(x)=x2g(x) = x^2. Formulate the composite functions gfg \circ f and fgf \circ g. Evaluate whether each composite function is injective or surjective, justifying your conclusions.

33
mediumSubjective

Let R be a relation on the set of integers Z\mathbf{Z} defined by R={(a,b):a+bR = \{(a, b) : a + b is an even integer}.\}. Analyze if R is symmetric.

34
mediumSubjective

Analyze if the function f:NNf: \mathbf{N} \rightarrow \mathbf{N} defined by f(x)=x+1f(x) = x + 1 is onto.

35
hardSubjective

Describe what an equivalence class is. Consider the relation R on the set of integers Z defined by R = {(a, b) : a ≡ b (mod 3)}. Find the equivalence classes [0], [1], and [2].

36
hardSubjective

Let f:NNf: \mathbf{N} \rightarrow \mathbf{N} be defined by f(n)={n2,if n is even n+12,if n is oddf(n) = \begin{cases} \frac{n}{2}, & \text{if } n \text{ is even} \ \frac{n+1}{2}, & \text{if } n \text{ is odd} \end{cases}. Analyze whether the function ff is bijective.

37
hardSubjective

Evaluate if the function f:RRf: \mathbf{R} \to \mathbf{R} defined by f(x)=xxf(x) = x|x| is bijective. Justify your conclusion by checking for injectivity and surjectivity.

38
hardSubjective

Identify the type of relation R in the set Z of integers defined as R = {(x, y): x - y is an even integer}. Explain your choice.

39
hardSubjective

Evaluate the statement: "If the composition gfg \circ f is one-one, then the function gg must be one-one." Justify your conclusion with a counterexample.

40
hardSubjective

Let N\mathbf{N} be the set of natural numbers. A relation RR is defined on the set N×N\mathbf{N} \times \mathbf{N} by (a,b)R(c,d)(a, b) R (c, d) if and only if ad=bcad = bc. Prove that RR is an equivalence relation. Furthermore, describe the equivalence class of (2,3)(2, 3).

41
hardSubjective

Design a function f:NZf: \mathbf{N} \to \mathbf{Z} (from the set of natural numbers to the set of integers) that is bijective. Formulate a proof to justify that your designed function is both one-one and onto.

42
hardSubjective

Consider the function f:R+[4,)f: \mathbf{R}^+ \rightarrow [4, \infty) given by f(x)=x2+4f(x) = x^2 + 4, where R+\mathbf{R}^+ is the set of all non-negative real numbers. Demonstrate that ff is invertible and calculate its inverse.

43
hardSubjective

Demonstrate that the relation R on the set N×N\mathbf{N} \times \mathbf{N} defined by (a,b)R(c,d)(a, b) R (c, d) if and only if a+d=b+ca + d = b + c is an equivalence relation.

44
hardSubjective

Let A=R{3}A = \mathbf{R} - \{3\} and B=R{1}B = \mathbf{R} - \{1\}. Analyze if the function f:ABf: A \rightarrow B defined by f(x)=x2x3f(x) = \frac{x - 2}{x - 3} is a bijective function.

45
hardSubjective

Let f:NSf: \mathbf{N} \rightarrow S be a function defined as f(x)=4x2+12x+15f(x) = 4x^2 + 12x + 15, where S is the range of ff. Demonstrate that ff is invertible and calculate the inverse of ff.