Scribd
Upload
24 views2 pages

Chapter 1 Relations and Functions Updated

The document outlines key concepts related to relations and functions, including types of relations (reflexive, symmetric, transitive) and functions (injective, surjective, bijective). It explains function composition, inverses, equivalence classes, and specific functions like the signum and greatest integer functions. Additionally, it provides formulas for calculating the number of relations and functions between sets.

Uploaded by

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

Chapter 1 Relations and Functions Updated

The document outlines key concepts related to relations and functions, including types of relations (reflexive, symmetric, transitive) and functions (injective, surjective, bijective). It explains function composition, inverses, equivalence classes, and specific functions like the signum and greatest integer functions. Additionally, it provides formulas for calculating the number of relations and functions between sets.

Uploaded by

avinashdixit459
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Chapter 1: Relations and Functions

CONCEPT SHEET - RELATIONS & FUNCTIONS (Updated)

1. Types of Relations
- Reflexive: (a, a) in R for all a in A
- Symmetric: (a, b) in R => (b, a) in R
- Transitive: (a, b), (b, c) in R => (a, c) in R
- Equivalence Relation: A relation which is reflexive, symmetric, and transitive

2. Functions
- A function f from A to B (f: A -> B) assigns each a in A to exactly one b in B.
- Domain: Set A (inputs)
- Codomain: Set B (possible outputs)
- Range: Actual set of outputs (subset of codomain)

3. Types of Functions
- One-One (Injective): Different inputs -> Different outputs
- Onto (Surjective): Every element of codomain has a pre-image
- Bijective: Both One-One and Onto

4. Composition of Functions
- If f: A -> B, g: B -> C, then composition is gof: A -> C
- (gof)(x) = g(f(x))

5. Inverse of a Function
- Only bijective functions have inverses
- If f: A -> B is bijective, then f^-1: B -> A
- f(f^-1(x)) = x and f^-1(f(x)) = x

6. Equivalence Class
- If ~ is an equivalence relation on set A, the equivalence class of a in A is:
- [a] = { x in A | x ~ a }
- All elements in the same class are related to each other.
7. Signum Function
- signum(x) = 1 if x > 0
- signum(x) = 0 if x = 0
- signum(x) = -1 if x < 0

8. Greatest Integer Function


- f(x) = [x] (floor function)
- It gives the greatest integer less than or equal to x
- Examples: [2.4] = 2, [-2.4] = -3

9. One-One and Onto Proof Tips


- To prove one-one (injective): Assume f(x1) = f(x2) => show x1 = x2
- To prove onto (surjective): Let y = f(x), solve for x in terms of y
- If x exists for every y in codomain, function is onto

FORMULA SHEET - RELATIONS & FUNCTIONS

- Number of relations from set A (n elements) to B (m elements): 2^(m×n)


- Number of functions from A to B: m^n
- One-One functions (from set A to B, where m >= n): P(m, n) = m(m-1)(m-2)...(m-n+1)
- Number of bijective functions (if m = n): n!
- Inverse function: f(f^-1(x)) = x and f^-1(f(x)) = x

You might also like