Scribd
Upload
224 views3 pages

Chapter 1 - Sets (Notes)

The document provides an overview of sets, including definitions, types, and methods of representation. It covers operations on sets such as union, intersection, difference, and complement, along with their properties and laws. Additionally, it discusses subsets, power sets, and the concept of equivalent sets.

Uploaded by

Maths Club
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
224 views3 pages

Chapter 1 - Sets (Notes)

The document provides an overview of sets, including definitions, types, and methods of representation. It covers operations on sets such as union, intersection, difference, and complement, along with their properties and laws. Additionally, it discusses subsets, power sets, and the concept of equivalent sets.

Uploaded by

Maths Club
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/ 3

THE STUDY L'ECOLE INTERNATIONALE

CHAPTER - 1
SETS

Definition: A set is a well-defined collection of objects.

There are two methods of representing a set:


(a) Roster or Tabular form e.g. natural numbers
less than 5 = {1, 2, 3, 4}

(b) Set-builder form or Rule method e.g.: Vowels in English


alphabet= {x : x is a vowel in the
English alphabet }
Types of sets:
(i) Empty set or Null set or void set
(ii) Finite set
(iii) Infinite set
(iv) Singleton set
Subset: A set A is said to be a subset of set
B if    ,   . We write it as A  B.

Equal sets: Two sets A and B are equal if they have exactly the
same elements i.e A = B if A  B and B  A.

Power set: The collection of all subsets of a set A is called


power set of A, denoted by P(A) i.e. P(A) = { B : B  A }
If A is a set with n(A) = m then n [P(A)] = 2m.
Equivalent sets: Two finite sets A and B are equivalent, if their
cardinal numbers are same i.e., n(A) = n(B).

Proper subset and super set: If A  B then A is called the


proper subset of B and B is called the superset of A.

Types of Intervals
Open Interval (a, b) = { x  R : a < x < b }
Closed Interval [a, b] = { x  R : a  x  b }
Semi open or Semi closed Interval,
(a,b] = { x  R : a < x ≤ b}
[a,b) = { x  R : a ≤ x < b}
Union of Sets
B
Union of two sets A and B is, U A

A  B = { x : x  A or x  B }

AUB

Intersection of Sets

Intersection of two sets A and B is,

A  B = { x : x  A and x  B}

U A B
Disjoint Sets
Two sets A and B are said to be disjoint if A  B = 

Difference of Sets
Difference of sets A and B is, A – B = { x : x  A and x  B}

B
U A

A–B

Difference of sets B and A is,

B – A = { x : x  B and x A }

Complement of Set

Complement of a set A, denoted by A' or Ac is


A' = Ac = U – A = { x : x  U and x  A}

A
 Properties of complement sets :
1. Complement laws
(i) A  A' = U (ii) A  A' =  (iii) (A')' = A
2. De Morgan's Laws
(i) (A  B)' = A'  B' (ii) (A  B)' = A'  B'

Note : This law can be extended to any number of sets.

3. ' =  and ' = 

4. If A  B then B’  A’

Laws of Algebra of sets


(i) A=A

(ii) A=

 A – B = A  B' = A – (A  B)
 Commutative Laws :–
(i) A  B = B  A (ii) A  B = B  A
 Associative Laws :–
(i) (A  B)  C = A  (B  C)

(ii) (A  B)  C = A  (B  C)
 Distributive Laws :–
(i) A  (B  C) = (A  B)  (A  C)

(ii) A  (B  C) = (A  B)  (A  C)

 If A  B, then A  B = A and A  B = B

 When A and B are disjoint n(A  B) = n(A) + n(B)

 When A and B are not disjoint n(A  B) = n(A) + n(B) – n(A  B)

 n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B  C) – n(A  C)+ n(A  B  C)

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