Unit 1: Set Theory

1. Basic Set Concepts

Introduction to Sets

Core Concept: A set is a well-defined collection of distinct objects, considered as a

single entity. These objects are called elements or members of the set. Understanding
sets is fundamental to set theory and many areas of mathematics.

Sets are typically denoted by uppercase letters (e.g., 𝐴, 𝐵, 𝐶), while elements are denoted
by lowercase letters (e.g., 𝑎, 𝑏, 𝑐).

Representing Sets

There are two common ways to represent sets:

1. Roster Form (Tabular Method):

2. List all elements of the set within braces {}, separated by commas.

3. Example: The set of even numbers less than 10 is {2, 4, 6, 8}.

4. This method is best suited for finite sets where all elements can be easily
listed.

5. Set-Builder Form:

6. Define the set by specifying a property that all its elements share.
 7. The general form is {𝑥: 𝑃(𝑥)}, which reads as “the set of all 𝑥 such that 𝑃(𝑥) is
true,” where 𝑃(𝑥) is a condition or property.

8. Example: 𝐴 = {𝑥: 𝑥 is an even number, 𝑥 < 10}

9. Set-builder form is particularly useful for defining infinite sets or sets with a
large number of elements.

Types of Sets

1. Finite Set:

2. A set with a finite (countable) number of elements.

3. Example: {1, 2, 3, 4, 5}

4. Infinite Set:

5. A set with an unlimited number of elements that cannot be counted in a

finite amount of time.

6. Examples: The set of natural numbers (ℕ = {1, 2, 3, ...}) and the set of real
numbers (ℝ).

7. Singleton Set:

8. A set containing exactly one element.

9. Example: {𝑎}

10. Null Set (Empty Set):

11. A set containing no elements.

12. Denoted by {} or ∅.
13. The null set is a unique and fundamental set in set theory.

14. Universal Set:

15. The set containing all elements under consideration in a given context.

16. Denoted as U.
2. Set Operations

Set Operations: Combining and Comparing Sets

Set operations allow us to combine and compare sets, creating new sets based on the
relationships between existing ones. Here’s an overview of common set operations and
relationships:

Basic Definitions

• Definition of Equal Sets: Two sets are considered equal if and only if they contain
exactly the same elements.

• Definition of Equivalent Sets: Two sets are equivalent if they have the same
number of elements (same cardinality). Note that equivalent sets do not need to
contain the same elements; they only need to have the same quantity of elements.

• Definition of Subsets: A set 𝐴 is a subset of a set 𝐵, denoted as 𝐴 ⊆ 𝐵, if every

element of 𝐴 is also an element of 𝐵.

• Definition of Proper Subset: A set 𝐴 is a proper subset of a set 𝐵, denoted as 𝐴 ⊂ 𝐵

, if 𝐴 ⊆ 𝐵 and 𝐴 ≠ 𝐵. In other words, all elements of 𝐴 are in 𝐵, but 𝐵 contains at
least one element that is not in 𝐴.

• Disjoint Sets Definition: Two sets 𝐴 and 𝐵 are disjoint if they have no elements in
common.

Set Operations

• Union of Sets: The union of two sets 𝐴 and 𝐵, denoted as 𝐴 ∪ 𝐵, is the set
containing all elements that are in 𝐴 or in 𝐵 (or in both). Formally:
∪
𝐴 𝐵 = {𝑥: 𝑥 ∈ 𝐴 or 𝑥 ∈ 𝐵}
 • Intersection of Sets: The intersection of two sets 𝐴 and 𝐵, denoted as 𝐴 ∩ 𝐵, is the
set containing all elements that are common to both 𝐴 and 𝐵. Formally:
∩
𝐴 𝐵 = {𝑥: 𝑥 ∈
𝐴 and 𝑥 𝐵} ∈
• Set Difference: The difference of two sets 𝐴 and 𝐵, denoted as 𝐴 − 𝐵, is the set of
all elements that are in 𝐴 but not in 𝐵. Formally:
𝐴 − 𝐵 = {𝑥 𝑥 ∣ ∈
𝐴 and 𝑥 ∉ 𝐵}

• Complement of a Set: The complement of a set 𝐴, denoted as 𝐴′, is the set

containing all elements in the universal set 𝑈 that are not in 𝐴. Formally:
𝐴′ = {𝑥: 𝑥 ∈ 𝑈 and 𝑥 ∉ 𝐴}
• The universal set 𝑈 is the set of all possible elements under consideration.

These set operations and relationships provide a foundation for more advanced topics
in set theory and discrete mathematics.

3. Venn Diagrams and Cartesian Products

Venn Diagrams and Set Relationships

Core Concept: Venn diagrams are visual representations of sets and their relationships.
A universal set is depicted as a rectangle, while individual sets within it are represented
by circles.

Venn diagrams are useful for illustrating set operations like union, intersection, and
complement, making abstract concepts more intuitive.

Set Operations and Venn Diagrams

• Union (𝐴 ∪ 𝐵): Represents all elements in set A or set B (or both). In a Venn
diagram, this is the area covered by both circles.

• Intersection (𝐴 ∩ 𝐵): Represents elements common to both set A and set B. In a

Venn diagram, this is the overlapping area of the circles.
 • Complement (𝐴′): Represents all elements in the universal set that are not in set A.
In a Venn diagram, this is the area outside the circle representing A but still within
the rectangle (universal set).

De Morgan’s Laws

De Morgan’s Laws provide a way to simplify the complements of unions and

intersections:

1. The complement of the union of two sets is equal to the intersection of their
complements:
(𝐴 ∪ 𝐵)′ = 𝐴′ ∩ 𝐵′
2. The complement of the intersection of two sets is equal to the union of their
complements:
(𝐴 ∩ 𝐵)′ = 𝐴′ ∪ 𝐵′
These laws are crucial in simplifying logical expressions and set operations, allowing
for easier manipulation and understanding of complex relationships.

Distributive Laws

Distributive laws describe how union and intersection interact with each other:

1. Union distributes over intersection:

∪ ∩ ∪ ∩ ∪
𝐴 (𝐵 𝐶) = (𝐴 𝐵) (𝐴 𝐶)
This means that taking the union of A with the intersection of B and C is the same
as taking the intersection of the union of A and B with the union of A and C.

2. Intersection distributes over union:

∩ ∪ ∩ ∪ ∩
𝐴 (𝐵 𝐶) = (𝐴 𝐵) (𝐴 𝐶)
This means that taking the intersection of A with the union of B and C is the same
as taking the union of the intersection of A and B with the intersection of A and C.

Understanding these distributive laws is essential for manipulating and simplifying set
expressions.
Idempotent and Complement Laws

• Idempotent Laws: Applying the same set in a union or intersection operation

results in the same set:

• 𝐴∪𝐴=𝐴
• 𝐴∩𝐴=𝐴
These laws highlight that repeating a set in these operations does not change
the result.

• Complement Laws: The union of a set and its complement is the universal set,
and the intersection of a set and its complement is the empty set:

• 𝐴 ∪ 𝐴′ = 𝑈
• 𝐴 ∩ 𝐴′ = ∅
These laws define the relationship between a set and its negation, illustrating
fundamental properties of set theory.

Commutative and Associative Properties

These properties define how the order and grouping of sets affect operations, providing
flexibility in manipulating set expressions.

• Commutative Property: The order of sets in a union or intersection does not

affect the result:

• 𝐴∪𝐵=𝐵∪𝐴
• 𝐴∩𝐵=𝐵∩𝐴
This means you can swap the order of sets in these operations without
changing the outcome.

• Associative Property: The grouping of sets in multiple unions or intersections

does not affect the result:
• (𝐴 ∪ 𝐵) ∪ 𝐶 = 𝐴 ∪ (𝐵 ∪ 𝐶)
• (𝐴 ∩ 𝐵) ∩ 𝐶 = 𝐴 ∩ (𝐵 ∩ 𝐶)
This means you can change the order in which you perform multiple unions
or intersections without affecting the final result.
Power Set

Definition: The power set of a set A, denoted as 𝑃(𝐴), is the set of all possible subsets of
A, including the empty set and A itself. It represents all the different ways you can select
elements from A to form new sets.

Size: If a set A has 𝑛 elements, then its power set 𝑃(𝐴) contains 2𝑛 elements. This
exponential relationship demonstrates how quickly the number of subsets grows as the
size of the original set increases.

Cartesian Product

Definition: The Cartesian product of two sets A and B, denoted as 𝐴 × 𝐵, is the set of all
possible ordered pairs (𝑎, 𝑏), where 𝑎 is an element of A and 𝑏 is an element of B. The
order of elements in each pair matters.

𝐴 × 𝐵 = {(𝑎, 𝑏): 𝑎 ∈ 𝐴 and 𝑏 ∈ 𝐵}

Example: If 𝐴 = {1, 2} and 𝐵 = {𝑥, 𝑦}, then 𝐴 × 𝐵 = {(1, 𝑥), (1, 𝑦), (2, 𝑥), (2, 𝑦)}. The Cartesian
product is fundamental in defining relations and functions between sets.

Unit 2: Logic and Propositional Calculus

1. Basic Logic

Basic Logic: Foundations of Propositional Calculus

Definition of a Statement (Proposition)

Core Concept: In mathematical logic, a statement (or proposition) is a declarative
sentence that can be definitively classified as either true or false, but not both
simultaneously. Propositions are the fundamental building blocks of logical arguments
and are typically represented by lowercase letters such as 𝑝, 𝑞, 𝑟.

Compound Propositions

Core Concept: A compound proposition is formed by combining simple propositions

using logical connectives. Understanding how these connectives affect the truth value
of compound propositions is crucial for logical reasoning.

Logical Connectives

1. Negation (∼)

2. Definition: The negation of a proposition 𝑝, denoted as ∼𝑝, reverses its truth

value. If 𝑝 is true, then ∼𝑝 is false, and vice versa.

3. Truth Table:

𝑝 ∼𝑝

T F

F T

4. Conjunction ( ) ∧
5. Definition: The conjunction of two propositions 𝑝 and 𝑞, denoted as 𝑝 ∧ 𝑞, is
true only if both 𝑝 and 𝑞 are true; otherwise, it is false.

6. Truth Table:

𝑝 𝑞 𝑝 ∧𝑞
T T T
 𝑝 𝑞 𝑝 ∧𝑞
T F F

F T F

F F F

Truth Tables

Core Concept: A truth table is a mathematical table used in logic to systematically

display all possible truth values for a proposition or a logical expression. It provides a
comprehensive view of how the truth value of a compound proposition depends on the
truth values of its constituent propositions.

Logical Equivalence

Core Concept: Two propositions are logically equivalent if they have the same truth
value in all possible cases. In other words, their truth tables are identical. Logical
equivalence is a fundamental concept for simplifying and manipulating logical
expressions.

Tautologies, Contradictions, and Contingencies

1. Tautology

2. Definition: A tautology is a proposition that is always true, regardless of

the truth values of its constituent propositions. It represents a logical truth.

3. Contradiction

4. Definition: A contradiction is a proposition that is always false, regardless

of the truth values of its constituent propositions. It represents a logical
impossibility.

5. Contingency
 6. Definition: A contingency is a proposition that can be either true or false,
depending on the truth values of its constituent propositions. Its truth value
is not fixed but varies with different scenarios.

2. Logical Connectives

Logical Connectives in Propositional Logic

Logical connectives are used to form compound propositions from simpler ones.
Understanding their truth conditions and relationships is crucial for logical reasoning.

Basic Connectives

1. ∧
Conjunction ( ): Represents ‘and’.

2. ∧ 𝑞 is true only if both 𝑝 and 𝑞 are true; otherwise, it is false.

𝑝

3. Disjunction (∨): Represents ‘or’.

4. 𝑝 ∨ 𝑞 is true if either 𝑝 or 𝑞 (or both) are true; it is false only if both are false.

5. Conditional ( → ): Represents ‘if…then…’.

6. 𝑝 → 𝑞 (If 𝑝 then 𝑞) is false only if 𝑝 is true and 𝑞 is false; otherwise, it is true.

This can be counterintuitive, but it’s a convention in logic.

7. Biconditional ( ↔ ): Represents ‘if and only if’.

8. 𝑝 ↔ 𝑞 is true if 𝑝 and 𝑞 have the same truth value (both true or both false).

Negating Compound Statements

1. Negation of a Conjunction:
 2. The negation of 𝑝 ∧ 𝑞 is logically equivalent to ∼𝑝∨ ∼ 𝑞. This is expressed as:
∼(𝑝 ∧ 𝑞) ≡ ∼ 𝑝∨ ∼ 𝑞
3. In simpler terms, to deny that both 𝑝 and 𝑞 are true, you must show that
either 𝑝 is false or 𝑞 is false (or both).

4. Negation of a Conditional Statement:

5. The negation of 𝑝 → 𝑞 is logically equivalent to 𝑝∧ ∼ 𝑞.

∼(𝑝 → 𝑞) ≡ 𝑝∧ ∼ 𝑞
6. This means that to deny “if 𝑝 then 𝑞”, you must show that 𝑝 is true, but 𝑞 is
false.

7. Negation of a Biconditional Statement:

8. ∧
The negation of 𝑝 ↔ 𝑞 is logically equivalent to (𝑝 ∼ 𝑞) ∨ (𝑞∧ ∼ 𝑝).
≡ ∧ ∨ ∧
∼(𝑝 ↔ 𝑞) (𝑝 ∼ 𝑞) (𝑞 ∼ 𝑝)
9. This means 𝑝 and 𝑞 do not have the same truth values; one is true while the
other is false.

Related Conditional Statements

Given a conditional statement 𝑝 → 𝑞 (If 𝑝 then 𝑞), we can form related statements:
1. Converse: Formed by reversing the premise and conclusion.

2. The converse of 𝑝 → 𝑞 is 𝑞 → 𝑝.
3. Inverse: Formed by negating both the premise and the conclusion.

4. The inverse of 𝑝 → 𝑞 is ∼𝑝 → ∼ 𝑞.
5. Contrapositive: Formed by both reversing and negating the premise and
conclusion.

6. The contrapositive of 𝑝 → 𝑞 is ∼𝑞 → ∼ 𝑝.
Important Note: A conditional statement and its contrapositive are logically
equivalent. Similarly, the converse and inverse are logically equivalent.
3. Logic Laws and Switching Circuits

Fundamental Logic Laws

Commutative Laws

Core Concept: The commutative laws state that the order of operands does not affect
the result of a logical operation. This means you can swap the order of propositions in
an OR or AND operation without changing the truth value.

• (1) p ∨q≡q∨ p

• (2) p ∧q≡q∧ p

Associative Laws

Core Concept: The associative laws state that the grouping of propositions in a series of
identical logical operations (all ORs or all ANDs) does not alter the overall logical
equivalence. This allows you to rearrange parentheses in a chain of ORs or ANDs.

• (1) (p ∨ q) ∨r≡p∨ (q ∨ r)

• (2) (p ∧ q) ∧r≡p∧ (q ∧ r)

Distributive Laws

Core Concept: The distributive laws describe how logical operations interact when
combining AND and OR. They allow you to distribute one operation over another,
similar to distribution in algebra.

• (1) p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)

• (2) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Identity Laws

Core Concept: The identity laws define the behavior of propositions when combined
with true ( t ) or false ( f ) values. These laws help simplify expressions by identifying
elements that do not change the truth value.

• (1) p ∨ f ≡ p

• (2) p ∧ t ≡ p

• (3) p ∨ t ≡ t

• (4) p ∧ f ≡ f

Involution Law

Core Concept: The involution law, also known as the law of double negation, states that
negating a proposition twice returns the original proposition. This is a fundamental
property of negation.

• ¬(¬p) ≡ p

De Morgan’s Laws

Core Concept: De Morgan’s Laws provide a way to simplify the negation of complex
logical expressions. They describe how to distribute a negation over OR and AND
operations.

• (1) ¬(p ∨ q) ≡ ¬p ∧ ¬q

• (2) ¬(p ∧ q) ≡ ¬p ∨ ¬q

Logic Laws and Switching Circuits

Representing Switches with Logical Connectives

 • Parallel Switches: Switches connected in parallel correspond to the logical
connective of disjunction ( ∨ ). If either switch is closed (true), the circuit is
complete (true).

• Series Switches: Switches connected in series correspond to the logical connective

of conjunction ( ∧ ). Both switches must be closed (true) for the circuit to be
complete (true).

This mapping is fundamental for translating physical circuits into logical expressions,
which is essential for the analysis and design of digital logic gates and systems.

Euler Graphs

Definition: An Euler graph is a connected graph that has an Euler circuit, which is a
closed walk that traverses each edge exactly once. A connected graph is Eulerian if and
only if every vertex has an even degree.

• Important in problems requiring traversal of all connections exactly once, such as

route optimization or network inspection.

Unit 3: Group Theory

1. Group Fundamentals

Introduction to Groups

Core Concept: A group is a fundamental algebraic structure that formalizes the

properties of operations like addition and multiplication. It provides a framework for
studying mathematical objects and their symmetries.
Building Blocks

Before diving into groups, let’s define some essential preliminary concepts:

1. Groupoid:

2. A groupoid is the most basic structure. It consists of a set combined with a

binary operation defined on that set.

3. Binary Operation:

4. A binary operation on a set G is a function that takes two elements from

G and combines them to produce another element that is also in G . This is
also known as the closure property.

5. In mathematical notation: For all a, b \in G , a * b \in G .

6. Semigroup:

7. A semigroup is a set with a binary operation that satisfies the closure

property and the associativity axiom.

8. Associativity means that the order in which you perform the operation on
three elements doesn’t matter: For all a, b, c \in G , (a * b) * c = a
* (b * c) .

9. Monoid:

10. A monoid is a semigroup that also includes an identity element.

Group Axioms

For an algebraic system (G, *) to be a group, it must satisfy the following four
axioms:

1. Closure:

2. For all a, b \in G , a * b \in G . The binary operation * applied to

any two elements in G results in an element that is also in G .
 3. Associativity:

4. For all a, b, c \in G , (a * b) * c = a * (b * c) . The order in

which the binary operation is applied does not affect the result when
operating on three or more elements.

5. Identity Element:

6. There exists an element e \in G such that for all a \in G , a * e = e

* a = a.

7. The identity element e leaves any element unchanged when combined

with it using the binary operation.

8. Inverse Element:

9. For each a \in G , there exists an element a^{-1} \in G such that a *
a^{-1} = a^{-1} * a = e , where e is the identity element.

10. The inverse element a^{-1}

2. Types of Groups

Types of Groups

Basic Definitions

1. Group Order: The order of a group is the number of elements it contains. A

group can be either finite or infinite based on its order.

2. Finite Group: A group with a finite number of elements. The order of the group,
denoted by $$|G|$$ , is the number of elements in the group.

3. Infinite Group: A group with an infinite number of elements.

 4. Element Order: The order of an element $$a$$ in a group $$G$$ is the
smallest positive integer $$n$$ such that $$a^n = e$$ , where $$e$$ is the
identity element. If no such $$n$$ exists, the order of $$a$$ is infinite.
Understanding the order of elements helps characterize the group’s structure.

5. Graph: A graph consists of vertices (nodes) and edges that connect these vertices.
It is denoted as $$G = (V, E)$$ , where $$V$$ is the set of vertices and
$$E$$ is the set of edges. Graphs are fundamental mathematical structures for
modeling relationships between objects.

6. Complete Graph: A graph where every pair of vertices is connected by an edge;

denoted as $$K_n$$ where $$n$$ is the number of vertices.

Cyclic Groups

Definition: A group $$G$$ is cyclic if there exists an element $$a \in G$$ such that
every element of $$G$$ can be written as $$a^n$$ for some integer $$n$$ . We
denote this as $$G = \langle a \rangle$$ . In simpler terms, a cyclic group is
generated by a single element.

Subgroups

Definition: A subgroup $$H$$ of a group $$G$$ is a subset of $$G$$ that is itself a

group under the same operation as $$G$$ . Not every subset of a group is a subgroup;
it must satisfy specific properties to be considered a subgroup.

Properties of Subgroups:

To verify that a subset $$H$$ of a group $$G$$ is indeed a subgroup, the following
properties must hold:

1. The identity element of $$G$$ is also the identity element of $$H$$ .

2. If $$a \in H$$ , then the inverse of $$a$$ in $$G$$ is also in $$H$$ . These
properties ensure that $$H$$ satisfies the group axioms.
These properties are crucial for efficiently verifying whether a given subset is a
subgroup without checking all group axioms. They are necessary conditions implied by
the subgroup definition.

3. Graph Theory

Fundamental Concepts

Core Idea: Graph theory is the study of graphs, which are mathematical structures used
to model pairwise relations between objects. A graph consists of vertices (nodes) and
edges (lines) that connect these vertices.

• Vertex (Node): A fundamental unit representing an object or entity. Vertices are

depicted as points or circles.

• Edge (Line): A connection between two vertices. These connections represent

relationships or interactions between the entities (vertices) in the graph.

• Order of a Graph: The number of vertices in the graph. This metric provides a
basic measure of the graph’s complexity or the number of entities it represents.

• Size of a Graph: The number of edges in the graph. This metric provides a basic
measure of the graph’s connectivity or the number of relationships it represents.

• Degree of a Vertex: The number of edges connected to a vertex, with loops

counted twice. This is a measure of the connectivity of a vertex.

Types of Graphs

Simple Graph

A simple graph is a graph that does not contain self-loops (edges connecting a vertex to
itself) or parallel edges (multiple edges connecting the same pair of vertices).
Multigraph

A multigraph is a graph that may contain parallel edges. This allows for modeling
scenarios where multiple distinct relationships can exist between the same two entities.

Bipartite Graph

Definition: A bipartite graph has its vertices divided into two disjoint sets. Edges only
connect vertices from different sets; no edges connect vertices within the same set.

Bipartite graphs are used to model relationships between two distinct groups of entities,
such as students and subjects, or clients and services.

Complete Bipartite Graph

Definition: A bipartite graph where every vertex in one set is connected to every vertex
in the other set. It is denoted as 𝐾𝑚, 𝑛 , where 𝑚 and 𝑛 are the sizes of the two sets.

In a complete bipartite graph, the relationship between the two sets of vertices is fully
connected, meaning every possible connection exists.

Unit 4: Descriptive Statistics

1. Data and Distributions

Understanding Data and Distributions

Definition of Data
Key Fact: Data is a collection of facts, figures, symbols, and observations that can be
processed or analyzed to produce meaningful information. It serves as the raw input
for analysis and interpretation.

Definition of a Variable

Core Concept: A variable is a characteristic that can take on different values. Variables
are essential for distinguishing between different types of information being collected
and analyzed.

Variables can be classified into two main types:

1. Discrete Variable: A discrete variable assumes a finite or countable number of

possible values and is usually obtained by counting (e.g., number of students in a
class).

2. Continuous Variable: A continuous variable can assume any value within a

defined range and is usually obtained by measuring (e.g., height of a student).

Frequency Distribution

Core Concept: A frequency distribution is a table that displays how many data points
fall within specific, predefined intervals or classes. It provides a structured overview of
data dispersion, making it easier to interpret the distribution of values in a dataset.

Graphical Representations of Frequency Distributions

1. Histogram: A histogram is a graphical representation of a frequency distribution

using rectangles. The height of each rectangle corresponds to the frequency of
the data points within that interval or class.

2. Frequency Polygon: A frequency polygon is a line graph that visually represents

a frequency distribution by connecting midpoints of histogram rectangles with
straight lines. It provides a smooth representation of the distribution.
 3. Frequency Curve: A frequency curve is a smooth curve that approximates the
shape of a frequency polygon. It is used to visualize the overall pattern of the
distribution.

4. Ogive Curve (Cumulative Frequency Curve): The curve resulting from

graphing the cumulative frequencies of a distribution. It shows the cumulative
frequency for each class interval, allowing for easy determination of percentiles
and other cumulative measures.

2. Measures of Central Tendency

Measures of Central Tendency

Measures of central tendency are used to describe the ‘center’ of a dataset. The three
most common measures are the mean, median, and mode.

Definitions

• Mean: The average of all values in a dataset. It is calculated by summing all the
values and dividing by the number of values.

• Median: The middle value in a dataset when the data is ordered from least to
greatest.

• Mode: The value that appears most frequently in a dataset.

Calculating the Mean

Ungrouped Data

The mean (
𝑥‾
) for ungrouped data is calculated using the following formula:
 ∑𝑥
𝑥‾ = 𝑛 𝑖
where:

• ∑ 𝑥𝑖
is the sum of all data points.

• 𝑛
is the number of data points.

Grouped Data

The mean (
𝑥‾
) for grouped data is calculated using the following formula:
∑ 𝑓𝑖 𝑥𝑖
𝑥‾ =
∑ 𝑓𝑖
where:

• 𝑓𝑖
is the frequency of the 𝑖-th class.

• 𝑥𝑖
is the midpoint of the 𝑖-th class.

Finding the Median

The median is the middle value in an ordered dataset. The method for finding the
median depends on whether the data is grouped or ungrouped, and whether the
number of data points is even or odd.

Ungrouped Data

1. Order the data: Arrange the data points from least to greatest.

2. Determine if n is even or odd:

3. If 𝑛 is odd, the median is the

th
(n + 1)
2
 observation. For example, if you have 7 data points, the median is the
(7+1)/2 = 4th data point in the ordered list.

4. If 𝑛 is even, the median is the average of the

𝑛 th
( )
2
and
( 𝑛 + 1)
th
2
observations. For example, if you have 8 data points, the median is the
average of the 8/2 = 4th and the (8/2)+1 = 5th data points in the ordered list.

Grouped Data

To find the median from grouped data, use the following formula:
𝑁 − 𝑐𝑓
Median = 𝐿 + 2 ×ℎ
𝑓
where:

• 𝐿
is the lower boundary of the median class. This is the smallest value that falls into
the median class.

• 𝑁
is the total frequency. This is the sum of the frequencies of all classes.

• 𝑐𝑓
is the cumulative frequency of the class preceding the median class. This is the
sum of the frequencies of all classes before the median class.

• 𝑓
is the frequency of the median class. This is the number of data points that fall into
the median class.

• ℎ
is the class width. This is the range of values that fall into the median class.

Identifying the Mode

Ungrouped Data
The mode for ungrouped data is the value that appears most often in the dataset. To
find the mode, simply count the occurrences of each value and identify the value with
the highest frequency. A dataset can have one mode (unimodal), more than one mode
(multimodal), or no mode if all values occur with the same frequency.

3. Measures of Dispersion and Skewness

Measures of Dispersion and Skewness

Core Concept: Measures of dispersion and skewness are statistical tools used to
describe the spread and shape of a dataset. Dispersion measures quantify how much
the data points vary from a central value, while skewness measures the asymmetry of
the data distribution.

Measures of Dispersion

1. Range

Definition: The range is the simplest measure of dispersion, calculated as the difference
between the largest and smallest values in a dataset.

Formula: Range = Maximum value - Minimum value

2. Mean Deviation

Definition: Mean Deviation (M.D.) is the average of the absolute deviations from a
measure of central tendency (usually the mean or median).

Formulas:

• Ungrouped Data: $M.D.~= \frac{\sum |x_i - A|}{n}$

 • Grouped Data: $M.D.~= \frac{\sum f_i |x_i - A|}{\sum f_i}$ , where
$A$ is the mean or median.

3. Quartile Deviation

Definition: Quartile Deviation (Q.D.), also known as the semi-interquartile range,

measures the spread of the middle 50% of the data.

Formula: $Q.D. = \frac{Q_{3} - Q_{1}}{2}$ , where $Q_{1}$ is the first

quartile and $Q_{3}$ is the third quartile.

4. Variance

Definition: Variance ( $\sigma^2$ ) measures the average of the squared differences

from the mean.

Note: Variance is the square of the standard deviation and is a fundamental component
for calculating standard deviation.

5. Standard Deviation

Definition: Standard deviation ( $\sigma$ ) is a widely used measure of dispersion

that indicates how much data points deviate from the average (mean).

Formulas:

• Ungrouped Data: $\sigma = \sqrt{\frac{\sum (x_i - \bar{x})^2}{n}}$

or $\sigma = \sqrt{\frac{\sum x_i^2}{n} - (\bar{x})^2}$

• Grouped Data: $\sigma = \sqrt{\frac{\sum f_i (x_i - \bar{x})^2}

{N}}$ or $\sigma = \sqrt{\frac{\sum f_i x_i^2}{N} - (\bar{x})^2}$

6. Coefficient of Variation
Definition: The Coefficient of Variation (C.V.) is a measure of relative variability,
expressing the standard deviation as a percentage of the mean.

Formula: $C.V. = \frac{\sigma}{\bar{x}} \times 100$

Usefulness: Allows for the comparison of variability between datasets with different
units or vastly different means.

Measures of Skewness

1. Skewness

Definition: Skewness measures the asymmetry of a probability distribution.

2. Bowley’s Coefficient of Skewness

Definition: Bowley’s coefficient of skewness is based on quartiles.

Formula: $Skewness = \frac{Q_3 + Q_1 - 2Q_2}{Q_3 - Q_1}$ , where $Q_1$ is

the first quartile, $Q_2$ is the second quartile (median), and $Q_3$ is the third
quartile.

Mode Calculation from Grouped Data

To find the mode from grouped data, use the following formula:

$Mode = L + \frac{f_1 - f_0}{2f_1 - f_0 - f_2} \times h$

Where:

• $L$ is the lower boundary of the modal class

• $f_1$ is the frequency of the modal class

• $f_0$ is the frequency of the class preceding the modal class

 • $f_2$ is the frequency of the class succeeding the modal class

• $h$ is the class width

Unit 5: Matrices

1. Matrix Fundamentals

Definition of a Matrix

Core Concept: A matrix is a rectangular array of numbers, symbols, or expressions

arranged in rows and columns. Matrices are fundamental to linear algebra and have
wide applications in various fields.

Dimensions of a Matrix

• A matrix of size 𝑚 × 𝑛 is called an 𝑚 × 𝑛 (read “𝑚-by-𝑛”) matrix, where:

• 𝑚 represents the number of rows.

• 𝑛 represents the number of columns.

Types of Matrices

Square Matrix

• Definition: A matrix with the same number of rows and columns.

• Importance: Square matrices are essential in many matrix operations, such as

finding determinants and inverses.
Rectangular Matrix

• Definition: A matrix where the number of rows does not equal the number of
columns.

• Characteristic: Has dimensions 𝑚 × 𝑛 where 𝑚 ≠ 𝑛.

Row Matrix

• Definition: A matrix consisting of a single row.

• Dimensions: A row matrix has dimensions 1 × 𝑛, where 𝑛 is the number of

columns.

Column Matrix

• Definition: A matrix with a single column.

• Dimensions: A column matrix has dimensions 𝑚 × 1, where 𝑚 is the number of

rows.

Null Matrix

• Definition: A matrix where all elements are zero.

• Notation: Often denoted as 𝑂.

Matrix Operations

Matrix addition and subtraction can only be performed on matrices of the same
dimensions.

Matrix Addition
 • Process: Performed by adding corresponding elements of two matrices that have
the same dimensions.

• Condition: Matrices must have the same number of rows and columns.

Matrix Subtraction

• Process: Matrix Subtraction involves subtracting corresponding elements of two

matrices of the same size.

• Condition: Matrices must have the same number of rows and columns.

2. Matrix Types

Types of Matrices

Matrices are fundamental mathematical objects, and certain types of matrices have
special properties and applications. Here’s an overview of some key matrix types:

Key Property: All the matrix types described below are square matrices.

1. Identity Matrix

Definition: An identity matrix (𝐼) is a diagonal matrix with all diagonal elements equal
to 1. It acts as the multiplicative identity for matrices.

Property: For any matrix 𝐴, 𝐴𝐼 = 𝐴 and 𝐼𝐴 = 𝐴.

Example:
𝐼=[ 1 0 00 1 00 0 1 ]

2. Diagonal Matrix
Definition: A square matrix where all entries are zero except for the entries on the
main diagonal.

Example:
𝐷=[ 𝑎 0 00 𝑏 00 0 𝑐 ]

3. Scalar Matrix

Definition: A diagonal matrix with all diagonal elements equal.

Example:
𝑆 = [ 𝑘 0 0 0 𝑘 0 0 0 𝑘 ] = 𝑘𝐼

4. Upper Triangular Matrix

Definition: A square matrix in which all elements below the main diagonal are zero.

Example:
𝑈=[ 𝑎 𝑏 𝑐0 𝑑 𝑒0 0 𝑓 ]

5. Lower Triangular Matrix

Definition: A square matrix in which all elements above the main diagonal are zero.

Example:
𝐿=[ 𝑎 0 0𝑏 𝑐 0𝑑 𝑒 𝑓 ]

6. Symmetric Matrix

𝑇
Definition: A square matrix that is equal to its transpose (i.e., 𝐴 = 𝐴 ). This means that
the element in the i-th row and j-th column is equal to the element in the j-th row and i-
th column.

Example:
𝐴=[ 𝑎 𝑏 𝑐𝑏 𝑑 𝑒𝑐 𝑒 𝑓 ]
7. Skew-Symmetric Matrix

𝑇
Definition: A square matrix that is equal to the negative of its transpose (i.e., 𝐴 = −𝐴 ).
The diagonal elements of a skew-symmetric matrix are always zero.

Example:
𝐴 = [ 0 𝑏 𝑐 − 𝑏 0 𝑒 − 𝑐 −𝑒 0 ]

8. Singular Matrix

Definition: A square matrix with a determinant of 0.

Property: Singular matrices are not invertible, which has implications for the
solvability of linear systems.

9. Non-Singular Matrix

Definition: A non-singular matrix is a square matrix with a non-zero determinant.

Property: A non-singular matrix is invertible.

3. Matrix Operations and Properties

Matrix Operations and Properties

Matrix Transpose

Definition: The transpose of a matrix, denoted as A^T , is formed by interchanging the

rows and columns of the original matrix A . If A is an m x n matrix, then A^T is an
n x m matrix.
Scalar Multiplication

Definition: Scalar multiplication involves multiplying a matrix by a scalar (a constant

value). To perform scalar multiplication, multiply each element of the matrix by the
scalar. If A is a matrix and c is a scalar, then cA is obtained by multiplying every
element of A by c .

Matrix Multiplication

Definition: Matrix multiplication involves multiplying two matrices A and B . For the
multiplication to be valid, the number of columns of A must be equal to the number of
rows of B . If A is an m x n matrix and B is an n x p matrix, the resulting matrix
C = AB will be an m x p matrix.

Rank of a Matrix

Definition: The rank of a matrix A is defined as the order of the largest non-zero
minor of A . The rank provides information about the number of linearly independent
rows or columns in the matrix.