Mathematical Language

and Symbols
Mathematical Language

-is precise which means it is able to make

very fine distinctions or definitions among set
of mathematical symbols.

- It is powerful, that is, one can express

complex thoughts with relative ease
Mathematical Symbols
SET
 Set is a collection of well defined objects which are
distinct from each other. Sets are usually denoted by
capital letters A B C , , , K and elements are usually
denoted by small letters a b c , , ,... . If a is an element
of a set A, then we write a A ∈ and say a belongs to A or a
is in A or a is a member of A. If a does not belongs to A,
we write a A ∉ .
 Standard Notations N : A set of natural numbers. W : A set of whole numbers.
Z : A set of integers. Z Z + − / : A set of all positive/negative integers. Q : A
set of all rational numbers. Q Q + − / : A set of all positive/negative rational
numbers.
 R : A set of real numbers. R R + − / : A set of all positive/negative real
numbers.
 C : A set of all complex numbers.
 Methods for Describing a Set
 (i) Roster/Listing Method/Tabular Form
In this method, a set is described by listing element, separated by
commas, within braces. e.g. A a e i o u = { , , , , }

 (ii) Set Builder/Rule Method

In this method, we write down a property or rule which gives us all the
elements of the set by that rule. e.g. A x x = { : is a vowel of English alphabets}
Important Points to be Remembered
(i) Every set is a subset of itself i.e. A A ⊆ , for any set A.
(ii) Empty set φ is a subset of every set i.e. φ ⊂ A,for any set A.
(iii) For any set Aand its universal setU, A U ⊆
(iv) If A= φ,then power set has only one element i.e. n P A ( ( )) =1
(v) Power set of any set is always a non-empty set.
(vi) Suppose A= {1, 2} , then P A ( ) {{ }, { }, { , }, } = φ 1 2 1 2 (a) A P A ∉ ( ) (b) { } ( )
APA∈
(vii) If a set Ahasnelements, then P A ( )or subset of Ahas 2n elements.
(viii) Equal sets are always equivalent but equivalent sets may not be equal.
(ix) The set { } φ is not a null set. It is a set containing one element φ.
Relation
 If A and B are two non-empty sets, then a relation R from A to B is a
subset of A B × . If R A B ⊆ × and ( , ) , a b R ∈ then we say that a is
related to b by the relation R, written as aRb.

 Domain and Range of a Relation

Let R be a relation from a set A to set B. Then, set of all first
components or coordinates of the ordered pairs belonging to R is called
the domain of R, while the set of all second components or coordinates
of the ordered pairs belonging to R is called the range of R. Thus,
domain of R a a b R = ∈ { :( , ) } and range of R b a b R = ∈ { :( , ) }
Types of Relation
(i) Void Relation As φ ⊂ × A A, for any set A, so φis a relation on A,
called the empty or void relation.
(ii) Universal Relation Since, A A A A × ⊆ × , so A A × is a relation on A,
called the universal relation.
(iii)Identity Relation The relation I a a a A A = ∈ {( , ): } is called the
identity relation on A.
(iv) Reflexive Relation A relation R is said to be reflexive relation, if
every element of A is related to itself. Thus, ( , ) , a a R a A R ∈ ∀ ∈
⇒ is reflexive. (v) Symmetric Relation A relation R is said to be
symmetric relation, iff ( , ) a b R ∈ ⇒( , ) , , b a R a b A ∈ ∀ ∈ i.e. a
R b bRa a b A ⇒ ∀ ∈ , , ⇒ R is symmetric.
 Anti-Symmetric Relation A relation R is said to be anti-symmetric
relation, iff ( , ) a b R ∈ and ( , ) b a R ∈ ⇒ a b a b A = ∀ ∈ , ,
 Transitive Relation A relation R is said to be transitive relation, iff
( , ) and ( , ) a b R b c R ∈ ∈ ⇒ ( , ) , , , a c R a b c A ∈ ∀ ∈
 Equivalence Relation A relation R is said to be an equivalence
relation, if it is simultaneously reflexive, symmetric and transitive
on A.
 Partial Order Relation A relation R is said to be a partial order
relation, if it is simultaneously reflexive, symmetric and anti-
symmetric on A.
 Total Order Relation A relation R on a set A is said to be a total
order relation on A, if R is a partial order relation on A.
Functions
 “One of the most important concepts in all of mathematics is that of function.” (T.P. Dick
and C.M. Patton)
 Functions...finally a topic that most of you must be familiar with. However here, we will
not study derivatives or integrals, but rather the notions of one-to-one and onto (or
injective and surjective), how to compose functions, and when they are invertible.
 Let X and Y be sets. A function f from X to Y is a rule that assigns every element x of X to a
unique y in Y . We write f : X → Y and f(x) = y. Formally, using predicate logic: (∀x ∈ X, ∃y
∈ Y, y = f(x))∧(∀x1,x2 ∈ X, f(x1) 6= f(x2) → x1 6= x2). Then X is called the domain of f,
and Y is called the codomain of f. The element y is the image of x under f, while x is the
preimage of y under f. Finally, we call range the subset of Y with preimages.
Binary Operations
 Let S be a non-empty set. A function f from S S × to S is
called a binary operation on S i.e. f : S S S × → is a binary
operation on set S.
 Closure Property An operation * on a non-empty set S
is said to satisfy the closure property, if
 a S b S a b S ∈ ∈ ⇒ ∈ , * , ∀ a, b S ∈
 Also, in this case we say that S is closed for *. An
operation * on a non-empty set S, satisfying the closure
property is known as a binary operation.
Properties
(i) Generally binary operations are represented by the symbols * , ⊕, ... etc., instead of letters figure etc.
(ii) Addition is a binary operation on each one of the sets N, Z, Q, R and C of natural numbers, integers,
rationals, real and complex numbers, respectively. While addition on the set S of all irrationals is not a
binary operation.
(iii) Multiplication is a binary operation on each one of the sets N, Z, Q, R and C of natural numbers,
integers, rationals, real and complex numbers, respectively. While multiplication on the set S of all
irrationals is not a binary operation.
(iv) Subtraction is a binary operation on each one of the sets Z, Q, R and C of integers, rationals, real and
complex numbers, respectively. While subtraction on the set of natural numbers is not a binary operation.
(v) Let S be a non-empty set and P S ( ) be its power set. Then, the union, intersection and difference of
sets, on P S ( ) is a binary operation.
(vi) Division is not a binary operation on any of the sets N, Z, Q, R and C. However, it is not a binary
operation on the sets of all non-zero rational (real or complex) numbers.
(vii) Exponential operation (a, b)→ ab is a binary operation on set N of natural numbers while it is not a
binary operation on set Z of integers.
Types of Binary Operations

 Associative Law A binary operation * on a non-empty set S is said to

be associative, if (a * b) * c = a * (b * c), ∀ a, b, c ∈S. Let R be the set
of real numbers, then addition and multiplication on R satisfies the
associative law.
 Commutative Law A binary operation * on a non-empty set S is said
to be commutative, if a * b = b * a, ∀ a, b ∈S. Addition and
multiplication are commutative binary operations on Z but
subtraction not a commutative binary operation, since 2 3 3 2 − ≠ − .
Union and intersection are commutative binary operations on the
power set P S ( )of all subsets of set S. But difference of sets is not a
commutative binary operation on P S ( ).
 Distributive Law Let * and o be two binary operations on a non-empty sets.
We say that * is distributed over o., if a bo c a b o a c *( ) ( * ) ( * ) = ,∀ a, b,
c∈S also called (left distribution) and (b o c) * a = (b * a) o (c * a), ∀ a, b, c
∈S also called (right distribution). Let R be the set of all real numbers, then
multiplication distributes addition on R. Since, a b c a b a c ⋅ + = ⋅ + ⋅ ( ) , ∀
a, b, c ∈R.
 Identity Element Let * be a binary operation on a non-empty set S. An
element e ∈S, if it exist such that a*e = e*a = a, ∀ a ∈ S. is called an
identity elements of S, with respect to *. For addition on R, zero is the
identity elements in R. Since, a a a + = + = 0 0 , ∀ a R ∈ For multiplication
on R, 1 is the identity element in R. Since, a a a × = × = 1 1 ,∀ a R ∈ Let P
(S) be the power set of a non-empty set S. Then, φ is the identity element
for union on P (S) as A A A ∪ = ∪ = φ φ ,∀ A P S ∈ ( ) Also, S is the identity
element for intersection on P S ( ). Since, A S A S A ∩ = ∩ = , ∀ A P S ∈ ( ).
For addition on N the identity element does not exist. But for multiplication
on N the identity element is 1.
 Inverse of an Element Let * be a binary operation on a non-empty set S and let e
be the identity element. Let a S ∈ we say that a−1 is invertible, if there exists an
element b S ∈ such that a b b a e * * = = Also, in this case, b is called the inverse
of a and we write, a b − = 1 Addition on N has no identity element and accordingly
N has no invertible element. Multiplication on N has 1 as the identity element and
no element other than 1 is invertible. Let S be a finite set containing n elements.
Then, the total number of binary operations on S in nn 2. Let S be a finite set
containing n elements. Then, the total number of commutative binary operation
on S is n
 n n ( ) +1 2 .