0% found this document useful (0 votes)
37 views5 pages

Functions and Relations Overview

Chapter 2 covers the concepts of relations and functions, including definitions, types, and properties. It provides methods for solving problems related to Cartesian products, relations, and function checks, along with important formulas. Key concepts such as domain, codomain, range, and special functions like the Greatest Integer, Modulus, and Signum functions are also discussed.

Uploaded by

atechie2624
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views5 pages

Functions and Relations Overview

Chapter 2 covers the concepts of relations and functions, including definitions, types, and properties. It provides methods for solving problems related to Cartesian products, relations, and function checks, along with important formulas. Key concepts such as domain, codomain, range, and special functions like the Greatest Integer, Modulus, and Signum functions are also discussed.

Uploaded by

atechie2624
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Chapter 2: Relations and Type Condition

Bijective Both one-one and onto


Functions – Complete Guide Constant Function f(x) = c for all x
Identity Function f(x) = x
Modulus Function f(x) =
f(x) = ⌊x⌋
Greatest Integer
🔹 1. Basic Definitions to Cover Function
f(x) = { 1 if x > 0, 0 if x = 0, -1
Concept Definition Signum Function
if x < 0 }
Set A well-defined collection of objects.
Cartesian If A and B are two sets, then A × B =
Product {(a, b) 🔧 3. Methods & Steps to Solve Problems
A subset of a Cartesian product A ×
Relation
B.
A special type of relation where
Function every element of A has one and only 📌 A. Cartesian Product
one image in B.
Set of all first elements in ordered Question Type: Find A × B or number of elements
Domain
pairs. Steps:
Codomain The set B in a function from A to B.

2. Use formula: A × B = {(a, b) | a ∈ A, b ∈


Actual set of outputs (subset of 1. Write set A and set B.
Range
codomain).
B}.
3. Count total pairs using |A| × |B|.
🧮 2. Important Formulas and Properties
✅ Tip: A × B ≠ B × A unless A = B.
✴ Cartesian Product

 If A has m elements and B has n elements,


then 📌 B. Relation from A to B
n(A × B) = m × n
Question Type: Define or find a relation
✴ Number of Relations Steps:

 From A to B: 1. Find A × B.
Number of relations = 2^(m × n) 2. Define condition (e.g., x < y).
3. List ordered pairs satisfying condition.
✴ Number of Functions 4. That’s your relation R.

 From A to B: ✅ Tip: Relation is a subset of A × B.


Number of functions = n^m (where |A| =
m and |B| = n) 📌 C. Function Checking

✴ Types of Functions Question Type: Check if a relation is a function


Steps:
Type Condition
f(a₁) = f(a₂) ⇒ a₁ = a₂
One-One 1. Look at each element of domain.
(Injective) 2. Ensure each input maps to exactly one
output.
Every element in codomain has
Onto (Surjective) 3. If yes, it’s a function.
a pre-image in domain
✅ Tip: No two ordered pairs should have the same
first element with different second elements.

📌 D. Type of Function

Question Type: Determine whether a function is


One-One, Onto, etc.
Steps:

 One-One (Injective): Assume f(a₁) = f(a₂),


prove a₁ = a₂.
 Onto (Surjective): Take arbitrary y in
codomain. Solve f(x) = y.
 Bijective: Satisfy both above.

✅ Example: f(x) = 2x is One-One but not Onto from


ℝ to ℕ.
Step-by-Step Methods for Each
Problem Type
🔍 4. Things to Remember (Key Concepts &
Tips)

 Every function is a relation, but not every 🔹1. Cartesian Product of Sets
relation is a function.
 Domain and range must be clearly defined. Problem Type: Find A × B or total number of
 Graphical method: Vertical Line Test helps elements in A × B
identify if a curve represents a function.
 Real-world mapping: If a function 📌 Steps:
represents height of a person vs. age, it must

For composite functions: (f ∘ g)(x) =


be one-to-one but not necessarily onto. 1. List elements of A and B clearly.

A × B = {(a, b) | a ∈ A, b ∈ B}
 2. Use the formula:
f(g(x))
3. Write each ordered pair by pairing every
element of A with every element of B.
4. Count the total number of elements:
|A × B| = |A| × |B|

🧠 Example:

If A = {1, 2}, B = {3, 4},


A × B = {(1, 3), (1, 4), (2, 3), (2, 4)}
Number of elements = 2 × 2 = 4

🔹2. Relation from A to B


Problem Type: Find a relation or number of
relations from A to B
✅ A. One-One (Injective)
📌 Steps:
Steps:
1. Find A × B.
2. Define the relation condition (e.g., x < y, x 1. Take two inputs, say x₁ and x₂.
is even, etc.). 2. Assume f(x₁) = f(x₂)
3. Pick only those ordered pairs that satisfy the 3. Prove that x₁ = x₂
condition. 4. If this is true for all x, then function is One-
4. Relation = subset of A × B One.
5. If asked for number of relations:
2^(|A| × |B|) ✅ B. Onto (Surjective)

🧠 Example: Steps:

If A = {1, 2}, B = {1, 3}, define relation R as “x < 1. Let y be an arbitrary element of the
y”. codomain.
2. Solve f(x) = y
Then A × B = {(1,1), (1,3), (2,1), (2,3)} 3. If you get a valid x from domain, function is
R = {(1,3), (2,3)} (because 1 < 3, 2 < 3) Onto.

✅ C. Bijective

🔹3. Check Whether a Relation is a  A function is Bijective if it is both One-One


Function and Onto

Problem Type: Given ordered pairs or mapping, is


it a function?
🧠 Example:
📌 Steps:
Let f: ℝ → ℝ, f(x) = 2x + 3
1. Check each input (domain element): Is it

f(x₁) = f(x₂) ⇒ 2x₁ + 3 = 2x₂ + 3 ⇒ x₁ =


repeated?  To prove One-One:
2. If yes, check if it gives the same output
every time. x₂ ✔

Let y = 2x + 3 ⇒ x = (y - 3)/2 ⇒ x ∈ ℝ ✔
3. If each input maps to exactly one output,  To prove Onto:
it's a function.

🧠 Example: ✅ So, f is Bijective

{(1,2), (2,3), (1,3)} → Not a function (1 maps to 2


and 3)
🔹5. Finding Domain, Codomain, Range of a
{(1,2), (2,3), (3,4)} → Valid function Function

📌 Steps:

🔹4. Identify Type of Function (One-One, 1. Domain = all input values (given or derived
Onto, Bijective) from question)
2. Codomain = all possible output values ✅ B. Modulus Function: f(x) = |x|
(usually given)
3. Range = all actual outputs you get by  Returns positive value always
applying f(x)
Examples:
|–3| = 3, |4| = 4

🧠 Example: ✅ C. Signum Function: f(x) = sgn(x)

f(x) = √(x – 1), x ∈ ℝ x f(x)

Domain: x – 1 ≥ 0 ⇒ x ≥ 1
x>0 1
 x=0 0

Range: √(x – 1) ⇒ values ≥ 0 (i.e. [0, ∞))


 Codomain: Usually ℝ⁺ if not specified x<0 –1

🔹8. Composite Function & Inverse


Function
🔹6. Graph-based Questions (Visual
Identification) ✅ A. Composite Function (f ∘ g)(x) = f(g(x))
📌 Steps: Steps:
1. Use Vertical Line Test: Draw a vertical 1. Find g(x)
line. If it cuts the graph at more than one 2. Substitute g(x) into f(x)
point, it’s not a function.
2. Identify function types: 🧠 Example:
o Straight line: f(x) = ax + b
o Parabola: f(x) = x² (many-to-one)
Then (f ∘ g)(x) = f(g(x)) = f(x²) = x² + 1
If f(x) = x + 1, g(x) = x²
o Step graph: Greatest Integer
Function
o V-shaped: Modulus function

✅ B. Inverse Function

🔹7. Special Functions (Greatest Integer, Steps:


Modulus, Signum)

✅ A. Greatest Integer Function: f(x) = ⌊x⌋


1. Let y = f(x)

3. Solve for y ⇒ This y = f⁻¹(x)


2. Swap x and y: x = f(y)

 Returns greatest integer ≤ x

Steps:

 Take decimal input, write integer part before


decimal

⌊2.3⌋ = 2, ⌊–1.7⌋ = –2
Examples:

Common questions

Powered by AI

To verify if a function is bijective, one must prove that it is both injective (one-one) and surjective (onto). The steps are: For injectivity, assume f(x₁) = f(x₂), and show that this implies x₁ = x₂. For surjectivity, take an arbitrary element y in the codomain and prove there exists an element x in the domain such that f(x) = y. If both conditions are satisfied, the function is bijective .

A relation is any subset of a Cartesian product, whereas a function is a relation where each element of the domain maps to exactly one element in the codomain. The Vertical Line Test helps determine if a relation is a function by checking if any vertical line intersects the graph more than once, indicating that a single input has multiple outputs, thus not a function .

The modulus function, f(x) = |x|, returns the absolute value of x, ensuring all outputs are non-negative. In contrast, the signum function, f(x), returns 1 for positive x, 0 for x equal to zero, and -1 for negative x, effectively indicating the sign of x .

A one-one (injective) function is characterized by the property that if f(a₁) = f(a₂), then a₁ = a₂. Essentially, different elements in the domain map to different elements in the codomain, ensuring a unique mapping .

The Cartesian Product is critical as it forms the foundation for defining relations; it's the set of all ordered pairs (a, b) with a from set A and b from set B. It is calculated by pairing every element of A with every element of B, resulting in a total number of elements equal to the product of the sizes of A and B .

To form the composite function (f ∘ g)(x), substitute the output of g(x) into the input of f(x), essentially calculating f(g(x)). This requires first finding the expression for g(x), then substituting this expression into f(x) for the final result .

The vertical line test is used to determine if a graph represents a function. If a vertical line intersects the graph at more than one point at any location, then the graph does not represent a function, as this implies that a single input is mapped to multiple outputs .

To determine the domain, list all input values for which the function is defined. The codomain is the set of all potential output values, often given in the problem. The range consists of all actual outputs that result from applying the function to its domain .

The number of relations from set A to set B is 2^(m×n), where m is the number of elements in A and n is the number of elements in B. The number of functions from A to B is calculated as n^m, emphasizing that each element in A can map to any of the n elements in B .

To check if a set of ordered pairs is a function, ensure that each input (the first element of the pairs) is not repeated with a different output (the second element). If every input corresponds to exactly one output, the relation is a function .

You might also like