Example 1: Checking Equivalence Relation (Divisibility)
Question: Show that the relation R on the set of integers given by is an equivalence relation.
Solution: To be an equivalence relation, R must be reflexive, symmetric, and transitive.
Reflexive: We check if for any integer . This means we check if 2 divides . Since and , 2 divides 0. Thus, R is reflexive.
Symmetric: We check if implies .
Assume , so is divisible by 2. This means for some integer .
Multiplying by -1, we get . Since is also an integer, is divisible by 2.
Thus, is true. R is symmetric.
Transitive: We check if and implies .
Assume and .
Adding these equations gives ,
which simplifies to .
Since is an integer, is divisible by 2. Thus, is true. R is transitive.
Since R is reflexive, symmetric, and transitive, it is an equivalence relation.
Example 2: Non-Equivalence Relation
Question: Let R be the relation on the set of real numbers defined as if . Check if R is reflexive, symmetric, or transitive.
Solution:
Reflexive: We need to check if for all real numbers . This is not always true. Counterexample: Let . Then . The inequality is false. Thus, R is not reflexive.
Symmetric: We need to check if implies . Counterexample:
Let and . is , which is true.
But is , which is false. Thus, R is not symmetric.
Transitive: We need to check if and implies .
Counterexample: Let .
: . (True)
: . (True)
But is ? . (False)
Thus, R is not transitive.
Example 3: Relation of Parallel Lines
Question: Show that the relation 'is parallel to' on the set L of all lines in a plane is an equivalence relation.
Solution: Let R be the relation 'is parallel to' ().
Reflexive: For any line , (a line is parallel to itself). R is reflexive.
Symmetric: If line , then it follows that . R is symmetric.
Transitive: If line and , then it follows that . R is transitive.
Since R is reflexive, symmetric, and transitive, it is an equivalence relation.
Example 4: Smallest Equivalence Relation
Question: Let . Find the smallest equivalence relation on A containing the element (1,2).
Solution: We start with the required element and add the minimum pairs needed to satisfy all three properties.
Start: must contain .
Reflexivity: To be reflexive on A={1,2,3}, R must contain .
Symmetry: We have (1,2), so we must add its reverse, .
Transitivity: Now we check for chains. We have and , which requires to be in R. We have and , which requires to be in R. Both (1,1) and (2,2) were already added for reflexivity.
The smallest set containing all required elements is .
Example 5: Counting Relations
Question: Let . How many reflexive relations can be defined on A?
Solution:
Total Pairs: The set has elements.
Reflexive Condition: A reflexive relation on A must contain all diagonal elements, which are (1,1) and (2,2). These are mandatory.
Optional Pairs: The non-diagonal elements are (1,2) and (2,1). For each of these, we have a choice: either include it in the relation or not.
Counting:
Choice for (1,2): In or Out (2 options)
Choice for (2,1): In or Out (2 options)
The total number of reflexive relations is . In general, for a set with n elements, there are non-diagonal elements, so the number of reflexive relations is .
Answer: There are 4 reflexive relations.
Example 6: Relation on Ordered Pairs
Question: Let R be a relation on defined by if . Prove R is an equivalence relation.
Solution: The condition is equivalent to , representing pairs with the same ratio.
Reflexive: Check . This requires , which is true by the commutative property of multiplication. R is reflexive.
Symmetric: Assume , which means . We need to check if , which requires . Since is the same equation, this is true. R is symmetric.
Transitive: Assume and . This means (1) and (2) . We need to prove , i.e., .
From (1), . From (2), .
Substitute into the first equation:
Since , , so we can cancel from both sides to get . R is transitive.
Conclusion: It is an equivalence relation.
Example 7: Checking One-one (Injective)
Question: Show that the function defined by is one-one.
Solution: To prove a function is one-one (injective), we must show that for any two elements in the domain, if their outputs are equal, their inputs must also be equal. That is,
Assume : Let .
Solve for : Taking the cube root of both sides gives .
Conclusion: Since the condition holds, the function is one-one.
Example 8: Checking Onto (Surjective)
Question: Show that the function defined by is onto.
Solution: To prove a function is onto (surjective), we must show that for any element in the codomain, there exists at least one element in the domain (a pre-image) such that . The range must equal the codomain.
Set : Let be any number in the codomain . We have .
Solve for x: To find a potential pre-image, we solve for : .
Verify: For any real number , its real cube root is also a unique real number. This is in the domain .
Conclusion: Since every element in the codomain has a pre-image , the function is onto.
Example 9: Many-one and Into Function
Question: Let be defined by . Classify the function.
Solution:
One-one vs. Many-one: The function is many-one because we can find different inputs that produce the same output. For example, and .
Onto vs. Into: The function is into because its range is not equal to its codomain. The codomain is all integers (), but the range is only the set of non-negative perfect squares . For example, the integer 3 is in the codomain but has no integer pre-image (since is not an integer).
Example 10: Bijective Function
Question: Is the function defined by bijective?
Solution: A function is bijective if it is both one-one and onto.
One-one: Assume . Then
Cross-multiplying gives which simplifies to
This further simplifies to , or .
So, it is one-one.
Onto: Let and set .
Solving for gives
Since , a valid pre-image exists for every in the codomain. So, it is onto. Conclusion: Since it is both one-one and onto, the function is bijective.
Example 11: Modulus Function
Question: Classify the function defined by .
Solution:
One-one vs. Many-one: The function is many-one. For example, and . Different inputs (-1 and 1) lead to the same output.
Onto vs. Into: The function is into. The codomain is all real numbers (), but the range is only the set of non-negative real numbers, . No negative number in the codomain has a pre-image.
Example 12: Signum Function
Question: Classify the function defined by .
Solution: The Signum function is defined as
if , if , and if .
One-one vs. Many-one: The function is many-one. For example, and . All positive numbers map to 1.
Onto vs. Into: The function is into. The codomain is the set of all integers (), but the range is only the set . For example, the integer 2 has no pre-image.
Example 13: One-one but not Onto
Question: Let be defined by . Classify the function.
Solution:
One-one: Assume .
Then , which implies . The function is one-one.
Onto: The codomain is . The range is the set of outputs: . So the range is .
Since the range does not include the number 1 (which is in the codomain), the function is not onto.
Example 14: Many-one and Onto
Question: Let be defined by . Classify the function.
Solution:
One-one vs. Many-one: The function is many-one because and .
Onto vs. Into: The codomain is specified as . The range of is also the set of all non-negative real numbers, .
Since the range is equal to the codomain, the function is onto.
Example 15: Proving a function is NOT one-one
Question: Show that from is not one-one.
Solution: To show a function is not one-one, we only need to find a single counterexample of two different inputs that produce the same output.
Let and . Clearly .
Calculate the outputs: and .
Since but , the function is not one-one.
Example 16: Finding Compositions
Question: Let and . Find and .
Solution:
To find : We substitute the entire function into the variable of the function .
To find : We substitute the entire function into the variable of the function .
.
Note that in general, .
Example 17: Finding the Inverse of a Linear Function
Question: Find the inverse of the bijective function .
Solution:
Replace with y: .
Swap x and y: . This step represents the inversion.
Solve for y: .
State the Inverse: .
Example 18: Finding Inverse of a Quadratic Function
Question: Let be a function defined by . Find the inverse of f.
Solution: The restricted domain makes the function bijective.
Replace with y: .
Swap x and y: .
Solve for y: .
Choose the Correct Root: The range of the inverse function must be the domain of the original function , which is . To ensure our output is non-negative, we must choose the positive root.
Therefore, .
Example 19: Composition with Itself
Question: If , find .
Solution: We need to compute .
Simplify the term in the denominator's square root:
Substitute this back:
Cancel the terms: .
Example 20: Finding a Value in a Composition
Question: If and , find a value of x for which .
Solution:
Calculate :
Calculate :
Set them equal and solve:
.
Using the quadratic formula,
Example 21: Inverse of a Rational Function
Question: Find the inverse of where .
Solution:
Replace f(x) with y:
Swap x and y:
Solve for y: .
State the inverse: .
Example 22: Finding Domain of a Composition
Question: Let and . Find the domain of .
Solution: The domain of is the set of all in the domain of such that the output is in the domain of .
Find Domains of f and g: Domain of is . Domain of is .
Apply Condition: The output of , which is , must be in the domain of . So, .
Solve: . The domain is .
Alternatively: First find the composite function The domain of this new function is the set of x for which the expression is defined, which is , or .
Example 23: Composition of a Function and its Inverse
Question: Let . Verify that .
Solution:
Find the inverse : Let . Swap variables: . Solve for y:
So,
Perform the composition:
Conclusion: The composition results in the identity function, as expected.
Example 24: Verifying Invertibility
Question: Is the function defined by invertible?
Solution: A function is invertible if and only if it is bijective (both one-one and onto).
One-one: The function is not one-one. For example, and . Different inputs (0 and ) give the same output.
Onto: The function is not onto. The codomain is , but the range of is the closed interval . Values in the codomain like 2 have no pre-image. Since the function is neither one-one nor onto, it is not invertible.
Example 25: Inverse of a Cubic Function
Question: Find the inverse of the bijective function .
Solution:
Replace f(x) with y: .
Swap x and y: .
Solve for y: .
State the inverse: .
Example 26: Composition of Three Functions
Question: Let . Find .
Solution: We work from the inside out.
First, find :
Then, apply h to the result:
Answer: .
Example 27: Finding g when f and gof are known
Question: Let and . Find .
Solution: We are given .
Substitute the expression for :
We can see that the right side is a perfect square:
Let . The equation becomes .
Replacing the variable with , we get the function .
Example 28: Finding f when g and gof are known
Question: Let and . Find .
Solution: We start with the definition of the composition:
To find , we substitute the entire function into the variable of .
We are given that this is equal to .
So, .
Solving for :
Answer: .
Example 29: Inverse Property
Question: Let and . Find .
Solution: Method 1: Using the Inverse Property
Property: .
Find the inverses:
For , the inverse is .
For , the inverse is .
Compose the inverses: .
Method 2: Find the Composition First
Find :
Find the inverse of the result: Let . To find , let .
Swap variables: . Solve for y: .
Both methods give the same answer: .
Example 30: Identity Function
Question: Let be the identity function, . Find and .
Solution:
- Composition: .
The composition of the identity function with itself is the identity function.
Inverse: The function is a straight line with slope 1, passing through the origin. It is both one-one and onto, so it is bijective and has an inverse.
Let .
Swap variables: .
Solve for y: .
The function is its own inverse: .