Practice Questions
Relations and Functions
Consider the set . Create a relation R on S that is reflexive and symmetric but fails to be transitive. Justify your construction.
Explain the difference between a relation and a function with a simple example.
Justify whether the function defined by is injective.
Identify if the relation R = {(1,1), (2,2), (3,3)} on set A = {1, 2, 3} is reflexive.
Define a universal relation.
Let the set be . Analyze if the relation defined on set A is reflexive. Justify your answer.
Describe the conditions for a relation R on a set A to be an equivalence relation.
Analyze if the function defined by is one-one.
Let be the set of all straight lines in the Cartesian plane. A relation is defined on as if is parallel to . Justify that is an equivalence relation. (Note: A line is considered parallel to itself).
Given two functions and , calculate the value of .
What is a bijective function?
Let R be a relation on the set of integers defined by if is divisible by 3. Prove that R is an equivalence relation.
If and are given by and , calculate and . Demonstrate that .
Explain what is meant by the domain of a relation R from a set A to a set B.
Summarize the properties of a symmetric relation. Given an example of a relation that is symmetric but not reflexive.
Define an empty relation in a set A.
Let A = {1, 2, 3}. List the elements of the relation R = {(a, b) : |a - b| = 1}. Also, state its domain and range.
Explain why the function f: N → N given by f(x) = x + 1 is one-one but not onto.
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.
Define reflexive, symmetric, and transitive relations. Provide one example for each type of relation on the set A = {a, b, c}.
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.
Analyze the injectivity and surjectivity of the function given by .
Let . A relation is defined on as . Examine if is reflexive, symmetric, or transitive.
Demonstrate that the relation R in the set given by is symmetric but neither reflexive nor transitive.
Let L be the set of all lines in the XY plane. A relation R is defined on L as is parallel to . Analyze if R is an equivalence relation.
Create a relation R on the set A = {1, 2, 3} that is symmetric and transitive, but not reflexive. Justify your answer.
Formulate a concise argument to prove that a function from a finite set A to a smaller finite set B (where ) cannot be injective.
Create a function that is surjective but not injective, and justify both properties.
Let and . The function is defined by . Formulate the inverse function and justify that it is indeed the inverse by showing and .
Let and be two surjective functions. Formulate a proof to show that the composition is also surjective.
Formulate a proof to show that if and are two equivalence relations on a set , then their intersection is also an equivalence relation on .
Let be defined by and be defined by . Formulate the composite functions and . Evaluate whether each composite function is injective or surjective, justifying your conclusions.
Let R be a relation on the set of integers defined by is an even integer Analyze if R is symmetric.
Analyze if the function defined by is onto.
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].
Let be defined by . Analyze whether the function is bijective.
Evaluate if the function defined by is bijective. Justify your conclusion by checking for injectivity and surjectivity.
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.
Evaluate the statement: "If the composition is one-one, then the function must be one-one." Justify your conclusion with a counterexample.
Let be the set of natural numbers. A relation is defined on the set by if and only if . Prove that is an equivalence relation. Furthermore, describe the equivalence class of .
Design a function (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.
Consider the function given by , where is the set of all non-negative real numbers. Demonstrate that is invertible and calculate its inverse.
Demonstrate that the relation R on the set defined by if and only if is an equivalence relation.
Let and . Analyze if the function defined by is a bijective function.
Let be a function defined as , where S is the range of . Demonstrate that is invertible and calculate the inverse of .