Higher Secondary - First Year – Mathematics
Chapter : 1 - Sets, Relations and Functions- Key
Points
• Set
– Subset, super set, trivial subset, proper subset, improper subset
– Empty set, power set, universal set, singleton set, finite set, infinite set
– Cardinality of a set
– Union, Intersection, Complement, Set Difference, Symmetric Difference
– Properties and De Morgan Laws
– Cartesian Product
Intervals
– Constants, dependent and independent variables
– Open, Closed, finite and infinite intervals and neighbourhoods;
• Relations
– Domain and range of relation
– Extreme relations (empty and universal)
– Inverse of a relation
– Reflexive, Symmetric, Transitive, Equivalence Relations
• Functions
– Definition, domain, co-domain, range, image, pre-image,
– Tabular, graphical, analytical and piecewise representations,
– Identity function, constant function, zero function, modulus function, signum function,
greatest integer function, smallest integer function,
– Injective, surjective and bijective functions,
– Vertical test and Horizontal test,
– Composition of functions, inverse of a function,
– Addition and multiplication of real valued functions,
– Polynomial function, linear function, exponential function, logarithmic
function, rationalfunction, reciprocal function,
– Odd and Even functions.
Graphing functions
– Reflection, translation, dilation
– Drawing graph of some seems to be complicated functions.
Chapter-1 Sets, Relations and Functions Page 1
, Sets: a set is a collection of well-defined objects.
Exp :
(i) The collection of all beautiful flowers in Ooty Rose Garden.
(ii) The collection of all old men in Tamilnadu.
the union of two sets A and B is denoted by A 𝖴 B and is defined as
A 𝖴 B = {x : x ∈ A or x ∈ B}
the intersection as
A ∩ B = {x : x ∈ A and x ∈ B}.
Two sets A and B are disjoint if they do not have any common element. That is, A and
B
are disjoint if A ∩ B = ∅.
If A is a set, then the set of all subsets of A is called the power set of A and is usually
denoted as P(A). That is, P(A) = {B : B ⊆ A}. The number of elements in P(A) is 2n, where
n is the number of elements in A.
all sets under consideration in a mathematical process are assumed to be subsets of some
fixed set. This basic set is called the universal set. For example, depending on the
situation, for the set of prime numbers, the universal set can be any one of the sets
containing the set of prime numbers.
The complement of A with respect to U is denoted as A_ or Ac and defined as
A_ = {x : x ∈ U and x /∈ A}.
The set difference of the set A to the set B is denoted by either A − B or A _ B and is
defined as
A − B = {a : a ∈ A and a /∈ B}.
Note that,
(i) U − A = A_ (ii) A − A = ∅ (iii) ∅ − A = ∅ (iv) A − ∅ = A (v) A − U = ∅.
The symmetric difference between two sets A and B is denoted by AΔB and is
defined as AΔB = (A − B) 𝖴 (B − A). Actually the elements of AΔB are the elements of A
𝖴 B which are not in A ∩ B. Thus AΔB = (A 𝖴 B) − (A ∩ B).
A set X is said to be a finite set if it has k elements for some k ∈ W. In this case, we say
the finite set X is of cardinality k and is denoted by n(X). A set is an infinite set if
it is not finite. For an infinite set A, the cardinality is infinity. If n(A) = 1, then it is called a
singleton set. Note that
n(∅) = 0 and n({∅}) = 1
Chapter-1 Sets, Relations and Functions Page 2
Chapter : 1 - Sets, Relations and Functions- Key
Points
• Set
– Subset, super set, trivial subset, proper subset, improper subset
– Empty set, power set, universal set, singleton set, finite set, infinite set
– Cardinality of a set
– Union, Intersection, Complement, Set Difference, Symmetric Difference
– Properties and De Morgan Laws
– Cartesian Product
Intervals
– Constants, dependent and independent variables
– Open, Closed, finite and infinite intervals and neighbourhoods;
• Relations
– Domain and range of relation
– Extreme relations (empty and universal)
– Inverse of a relation
– Reflexive, Symmetric, Transitive, Equivalence Relations
• Functions
– Definition, domain, co-domain, range, image, pre-image,
– Tabular, graphical, analytical and piecewise representations,
– Identity function, constant function, zero function, modulus function, signum function,
greatest integer function, smallest integer function,
– Injective, surjective and bijective functions,
– Vertical test and Horizontal test,
– Composition of functions, inverse of a function,
– Addition and multiplication of real valued functions,
– Polynomial function, linear function, exponential function, logarithmic
function, rationalfunction, reciprocal function,
– Odd and Even functions.
Graphing functions
– Reflection, translation, dilation
– Drawing graph of some seems to be complicated functions.
Chapter-1 Sets, Relations and Functions Page 1
, Sets: a set is a collection of well-defined objects.
Exp :
(i) The collection of all beautiful flowers in Ooty Rose Garden.
(ii) The collection of all old men in Tamilnadu.
the union of two sets A and B is denoted by A 𝖴 B and is defined as
A 𝖴 B = {x : x ∈ A or x ∈ B}
the intersection as
A ∩ B = {x : x ∈ A and x ∈ B}.
Two sets A and B are disjoint if they do not have any common element. That is, A and
B
are disjoint if A ∩ B = ∅.
If A is a set, then the set of all subsets of A is called the power set of A and is usually
denoted as P(A). That is, P(A) = {B : B ⊆ A}. The number of elements in P(A) is 2n, where
n is the number of elements in A.
all sets under consideration in a mathematical process are assumed to be subsets of some
fixed set. This basic set is called the universal set. For example, depending on the
situation, for the set of prime numbers, the universal set can be any one of the sets
containing the set of prime numbers.
The complement of A with respect to U is denoted as A_ or Ac and defined as
A_ = {x : x ∈ U and x /∈ A}.
The set difference of the set A to the set B is denoted by either A − B or A _ B and is
defined as
A − B = {a : a ∈ A and a /∈ B}.
Note that,
(i) U − A = A_ (ii) A − A = ∅ (iii) ∅ − A = ∅ (iv) A − ∅ = A (v) A − U = ∅.
The symmetric difference between two sets A and B is denoted by AΔB and is
defined as AΔB = (A − B) 𝖴 (B − A). Actually the elements of AΔB are the elements of A
𝖴 B which are not in A ∩ B. Thus AΔB = (A 𝖴 B) − (A ∩ B).
A set X is said to be a finite set if it has k elements for some k ∈ W. In this case, we say
the finite set X is of cardinality k and is denoted by n(X). A set is an infinite set if
it is not finite. For an infinite set A, the cardinality is infinity. If n(A) = 1, then it is called a
singleton set. Note that
n(∅) = 0 and n({∅}) = 1
Chapter-1 Sets, Relations and Functions Page 2