Scribd
Upload
29 views2 pages

Relation and Function Class11 Notes

The document provides an overview of relations and functions, defining key concepts such as relation, domain, co-domain, and range. It outlines various types of relations (e.g., empty, universal, identity) and functions (e.g., injective, surjective, bijective) along with their representations and properties. Additionally, it discusses the composition of functions and the conditions under which a function is invertible.

Uploaded by

sid89646
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
29 views2 pages

Relation and Function Class11 Notes

The document provides an overview of relations and functions, defining key concepts such as relation, domain, co-domain, and range. It outlines various types of relations (e.g., empty, universal, identity) and functions (e.g., injective, surjective, bijective) along with their representations and properties. Additionally, it discusses the composition of functions and the conditions under which a function is invertible.

Uploaded by

sid89646
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

Class 11 – Relations and Functions:

Short Notes
1. Relation
- A relation is a subset of the Cartesian product A × B.
- If A = {1, 2} and B = {x, y}, then A × B = {(1,x), (1,y), (2,x), (2,y)}.
- Any subset of A × B is a relation from A to B.

2. Domain, Co-domain, Range


- Domain: Set of all first elements of the ordered pairs.
- Co-domain: Set B in A × B.
- Range: Set of all second elements that actually appear in relation.

3. Types of Relations
- Empty Relation: No element is related (e.g., R = ∅).
- Universal Relation: Every element of A is related to every element of B.
- Identity Relation: Each element is related to itself.
- Reflexive: (a, a) ∈ R for all a ∈ A.
- Symmetric: If (a, b) ∈ R, then (b, a) ∈ R.
- Transitive: If (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R.
- Equivalence Relation: Reflexive, symmetric, and transitive.

4. Function
- A function is a special type of relation.
- Each element of domain is related to exactly one element in co-domain.
- Represented as f: A → B.

5. Types of Functions
- One-one (Injective): Different elements of domain map to different elements of co-domain.
- Onto (Surjective): Every element of co-domain has a pre-image.
- Bijective: Both one-one and onto.
- Constant Function: f(x) = c.
- Identity Function: f(x) = x.

6. Representation of Functions
- Set notation
- Arrow diagram
- Graphs

7. Composition of Functions
- If f: A → B and g: B → C, then (g ∘ f)(x) = g(f(x)).
8. Invertible Function
- A function f is invertible if there exists g such that g(f(x)) = x and f(g(x)) = x.
- Only bijective functions have inverses.

You might also like