Scribd
Upload
4 views2 pages

Relations and Functions Quick Revision Notes

The document provides a quick revision of relations and functions, covering concepts such as Cartesian products, types of relations (reflexive, symmetric, transitive), and functions (one-one, onto, bijective). It also explains the inverse of functions, identity and constant functions, modulus and greatest integer functions, and offers graphing tips. Additionally, it includes domain and range tricks and exam preparation tips.

Uploaded by

sonuyaduvanshi174
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
4 views2 pages

Relations and Functions Quick Revision Notes

The document provides a quick revision of relations and functions, covering concepts such as Cartesian products, types of relations (reflexive, symmetric, transitive), and functions (one-one, onto, bijective). It also explains the inverse of functions, identity and constant functions, modulus and greatest integer functions, and offers graphing tips. Additionally, it includes domain and range tricks and exam preparation tips.

Uploaded by

sonuyaduvanshi174
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
You are on page 1/ 2

Relations and Functions – Quick Revision Notes

1. Cartesian Product of Sets


- If A = {a₁, a₂}, B = {b₁, b₂}, then A × B = {(a₁,b₁), (a₁,b₂), (a₂,b₁), (a₂,b₂)}
- Number of elements in A × B = |A| × |B|

2. Relation
- A relation from set A to B is a subset of A × B
- Types of relations on a set A:

Property Definition Example

Reflexive (a,a) ∈ R ∀ a ∈ A {(1,1), (2,2)}

Symmetric (a,b) ∈ R ⇒ (b,a) ∈ R {(1,2), (2,1)}

Transitive (a,b),(b,c) ∈ R ⇒ (a,c) ∈ R {(1,2), (2,3), (1,3)}

Equivalence Reflexive + Symmetric +


Transitive

3. Function (Mapping)
- A function is a relation where each input has only one output.
- Notation: f: A → B
Domain = inputs, Codomain = B, Range = actual outputs

4. Types of Functions
Type Condition Example

One-One (Injective) f(x₁) = f(x₂) ⇒ x₁ = x₂ f(x) = 2x

Onto (Surjective) Every element of codomain f(x) = x³


has a pre-image

Bijective Both one-one and onto Invertible

5. Inverse of a Function
- Only bijective functions have an inverse.
Steps to find f⁻¹(x):
1. Let y = f(x)
2. Solve for x in terms of y
3. Interchange x and y
4. Replace y with f⁻¹(x)

6. Identity and Constant Functions


- Identity Function: f(x) = x
- Constant Function: f(x) = c (same output for all x)

7. Modulus and Greatest Integer Functions


- f(x) = |x|: Always non-negative
- f(x) = [x]: Greatest integer ≤ x
e.g., [3.7] = 3, [-2.3] = -3

8. Graph Tips
- f(x) = x → Straight line (45°)
- f(x) = x² → Parabola upward
- f(x) = |x| → V-shaped
- f(x) = 1/x → Hyperbola

9. Domain and Range – Quick Tricks


Function Domain Range

x² ℝ [0, ∞)

√x [0, ∞) [0, ∞)

1/x ℝ \ {0} ℝ \ {0}

Tips for Compartment Exam:


- Practice proving one-one, onto, inverse
- Memorize definitions of relation types
- Draw graphs of basic functions
- Attempt past year questions

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy