Scribd
Upload
16 views1 page

Set Theory For Relations and Functions

The document provides an overview of set theory, including definitions of sets, types of sets, Cartesian products, relations, and functions. It explains concepts such as subsets, universal sets, and various types of relations and functions, including reflexive, symmetric, and transitive properties. Additionally, it distinguishes between different types of functions, such as injective, surjective, and bijective.

Uploaded by

suhas.bhat.iit2007
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
16 views1 page

Set Theory For Relations and Functions

The document provides an overview of set theory, including definitions of sets, types of sets, Cartesian products, relations, and functions. It explains concepts such as subsets, universal sets, and various types of relations and functions, including reflexive, symmetric, and transitive properties. Additionally, it distinguishes between different types of functions, such as injective, surjective, and bijective.

Uploaded by

suhas.bhat.iit2007
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

Set Theory for Relations and Functions (Class 12

NCERT)

1. Set
A set is a well-defined collection of distinct objects. - Notation: Sets are usually denoted by capital
letters, e.g., A, B, C. - Elements: The members of a set are written inside curly braces: A = {1, 2, 3}.

2. Types of Sets
- Finite Set: Has a limited number of elements. Example: {1, 2, 3} - Infinite Set: Has unlimited
elements. Example: Natural numbers N = {1, 2, 3, ...} - Empty Set (∅): Contains no elements. ∅ = {}
- Subset: A is a subset of B if every element of A is in B. Written as A ⊆ B. - Proper Subset: A ⊂ B
means A is a subset of B but not equal to B. - Universal Set (U): The set that contains all elements
under consideration.

3. Cartesian Product of Sets


- If A and B are two sets, the Cartesian product A × B is the set of all ordered pairs (a, b) where a ∈
A and b ∈ B. - Example: If A = {1, 2}, B = {x, y}, then A × B = {(1, x), (1, y), (2, x), (2, y)} - If A has m
elements and B has n elements, then A × B has m × n elements.

4. Relation
- A relation R from set A to set B is a subset of A × B. - It is a rule that connects elements of A to
elements of B. - Example: If A = {1, 2}, B = {x, y}, and R = {(1, x), (2, y)}, then R is a relation from A
to B. - Domain: Set of first elements of ordered pairs in R. - Range: Set of second elements of
ordered pairs in R. - Co-domain: The set B in A × B.

5. Types of Relations
- 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: A relation that is reflexive, symmetric, and
transitive.

6. Function
- A function f from A to B is a special relation where every element in A has **exactly one** image in
B. - Notation: f: A → B such that f(a) = b. - Domain: Set A - Co-domain: Set B - Range: Set of all
actual outputs (images) of elements of A under f.

7. Types of Functions
- One-One (Injective): Every element of the domain maps to a unique element in the codomain. -
Onto (Surjective): Every element of the codomain is mapped by some element in the domain. -
Bijective: Both one-one and onto. Every element of domain and codomain is uniquely paired.

You might also like