Scribd
Upload
6 views5 pages

Sets and Functions Guide

This document provides a comprehensive overview of Sets and Functions, including definitions, types, and examples. It covers various types of sets such as finite, infinite, equal, null, singleton, and universal sets, as well as different types of functions like one-to-one, onto, and bijective. Additionally, it includes exercises with solutions to reinforce understanding of the concepts presented.

Uploaded by

muntaha4041
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
6 views5 pages

Sets and Functions Guide

This document provides a comprehensive overview of Sets and Functions, including definitions, types, and examples. It covers various types of sets such as finite, infinite, equal, null, singleton, and universal sets, as well as different types of functions like one-to-one, onto, and bijective. Additionally, it includes exercises with solutions to reinforce understanding of the concepts presented.

Uploaded by

muntaha4041
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/ 5

Sets and Functions - A Complete Guide

This PDF is designed to provide a detailed explanation of Sets and Functions, their definitions, uses,

rules, types, and examples. It also includes exercises and their solutions to help you understand

these concepts better.

Sets:

A set is a collection of distinct objects, considered as an object in its own right. These objects can be

anything: numbers, letters, points, etc.

Definition:

A set is a well-defined collection of objects. The objects in a set are called elements or members.

Notation:

A set is usually denoted by a capital letter, and the elements are enclosed in curly braces.

Example:

Set A = {1, 2, 3, 4}

Use of Sets:

- Grouping objects together based on a common property.

- Can be used in solving problems related to probability, combinatorics, etc.

Types of Sets

1. Finite Set:
A set that contains a definite number of elements.

Example: A = {1, 2, 3}

2. Infinite Set:

A set that contains an infinite number of elements.

Example: B = {1, 2, 3, 4, ...}

3. Equal Set:

Two sets that contain exactly the same elements.

Example: A = {1, 2, 3}, B = {3, 2, 1}

4. Null Set (Empty Set):

A set that contains no elements.

Example: C = {}

5. Singleton Set:

A set that contains only one element.

Example: D = {5}

6. Universal Set:

The set that contains all the elements under consideration.


Example: U = {1, 2, 3, 4, 5}

Functions

A function is a relation between two sets, where each element of the first set is related to exactly

one element of the second set.

Definition:

A function is a rule that assigns every element in a set to exactly one element in another set.

Notation:

f: A -> B means a function f from set A to set B, where each element in A has a unique element in B.

Example:

f(x) = x^2, where x belongs to {1, 2, 3}

Types of Functions:

1. One-to-One (Injective) Function:

Each element of the first set is related to a distinct element in the second set.

Example: f(x) = 2x, where x belongs to {1, 2, 3} maps to {2, 4, 6}

2. Onto (Surjective) Function:

Every element of the second set has a pre-image in the first set.

Example: f(x) = x + 1, where x belongs to {1, 2, 3} maps to {2, 3, 4}


3. Bijective Function:

A function that is both one-to-one and onto.

Example: f(x) = x, where x belongs to {1, 2, 3} maps to {1, 2, 3}

Exercises

1. Find the union and intersection of the sets:

A = {1, 2, 3, 4}, B = {3, 4, 5, 6}

2. If f(x) = x^2, find the value of f(4) and f(-3).

3. Define the following sets:

A = {1, 2, 3, 4, 5}

B = {2, 4, 6, 8}

Find:

a. A intersection B

b. A union B

4. Prove that f(x) = 2x is a one-to-one function.

5. If f(x) = x + 5, determine whether f is onto.

Solutions

Solution 1:

Union of A and B: A union B = {1, 2, 3, 4, 5, 6}


Intersection of A and B: A intersection B = {3, 4}

Solution 2:

f(4) = 16

f(-3) = 9

Solution 3:

a. A intersection B = {2, 4}

b. A union B = {1, 2, 3, 4, 5, 6, 8}

Solution 4:

For f(x) = 2x, if f(x1) = f(x2), then 2x1 = 2x2 => x1 = x2. Therefore, the function is one-to-one.

Solution 5:

f(x) = x + 5 is onto if the range of f covers the entire set B. Since for every element in B, there is a

corresponding element in A, f(x) is onto.

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