Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points.

Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points.

play-rounded-fill play-rounded-outline play-sharp-fill play-sharp-outline
pause-sharp-outline pause-sharp-fill pause-rounded-outline pause-rounded-fill
00:00

Discrete Mathematics for CSE

Day 03 – Part 07: Finding Maximal, Minimal, Maximum, and Minimum Points

In Discrete Mathematics, finding maximal, minimal, maximum, and minimum points is essential in set theory, lattice theory, and optimization. Let’s break down these concepts:



1. Maximal and Minimal Elements

In a partially ordered set (poset) (S,≤)(S, \leq), elements are compared based on their ordering relation.

Maximal Element:

An element a∈Sa \in S is maximal if there is no element b∈Sb \in S such that a<ba < b.
Example: In the set S={1,3,5,7}S = \{1, 3, 5, 7\} ordered by divisibility, 7 is maximal (since no element is greater in divisibility order).

Minimal Element:

An element a∈Sa \in S is minimal if there is no element b∈Sb \in S such that b<ab < a.
Example: In the same set S={1,3,5,7}S = \{1, 3, 5, 7\}, 1 is minimal (since no element divides it except itself).

2. Maximum and Minimum Elements

If a maximal (or minimal) element is the greatest (or least) element of the set, it is called a maximum (or minimum).

Maximum Element:

An element mm is maximum if m≥xm \geq x for all x∈Sx \in S.
Example: In S={1,2,3,4,5}S = \{1, 2, 3, 4, 5\}, the maximum is 5.

Minimum Element:

An element mm is minimum if m≤xm \leq x for all x∈Sx \in S.
Example: In S={1,2,3,4,5}S = \{1, 2, 3, 4, 5\}, the minimum is 1.

Key Differences:

Concept Definition Uniqueness
Maximal No element is strictly greater May not be unique
Minimal No element is strictly smaller May not be unique
Maximum The greatest element in the set Unique if exists
Minimum The smallest element in the set Unique if exists

3. Example in a Partially Ordered Set

Consider the set S={2,4,6,8,10}S = \{2, 4, 6, 8, 10\} with divisibility as the order relation:

  • Minimal element: 22 (as nothing divides it except itself).
  • Maximal element: 1010 (as no number is divisible by it except itself).
  • Maximum: 1010 (since it is the greatest).
  • Minimum: 22 (since it is the smallest).

Would you like me to explain lattice theory applications or provide an algorithm to find these elements?

Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points.

TNS Theoretical and Natural Science – Advances in Engineering …

Mathematics for Computer Science – courses

Notes on Discrete Mathematics

Maxima and minima

Certainly! Here’s a well-structured explanation for:


📘 Day 03 Part 07 – Discrete Mathematics for CSE

🔹 Finding Maximal, Minimal, Maximum, and Minimum Elements in a Partially Ordered Set


🧠 Key Concepts – Poset (Partially Ordered Set)

A partially ordered set (poset) is a set P with a binary relation that is:

  • Reflexive: a ≤ a
  • Antisymmetric: If a ≤ b and b ≤ a, then a = b
  • Transitive: If a ≤ b and b ≤ c, then a ≤ c

🔍 Important Definitions

✅ 1. Maximal Element:

An element m ∈ P is called maximal if no other element is greater than m.

  • There can be multiple maximal elements.
  • Not necessarily the greatest in the set.

🔸 Formally:
There is no element x ∈ P such that m < x


✅ 2. Minimal Element:

An element m ∈ P is called minimal if no other element is less than m.

  • There can be multiple minimal elements.
  • Not necessarily the least in the set.

🔸 Formally:
There is no element x ∈ P such that x < m


✅ 3. Maximum Element:

An element M ∈ P is called the maximum if it is greater than or equal to all other elements in the set.

🔸 Formally:
For all x ∈ P, x ≤ M

✔️ There can be only one maximum.


✅ 4. Minimum Element:

An element m ∈ P is the minimum if it is less than or equal to all other elements in the set.

🔸 Formally:
For all x ∈ P, m ≤ x

✔️ There can be only one minimum.


📊 Visual Example: Hasse Diagram

Consider a poset P = {a, b, c, d} with the relation:

    a
   / \
  b   c
   \ /
    d

From this:

  • Maximal Elements: a (no one above it)
  • Minimal Elements: d (no one below it)
  • Maximum Element: ❌ Not unique (a is not greater than both b and c)
  • Minimum Element: ❌ Not unique

💡 Tip for GATE/University Exams:

  • Use Hasse Diagrams to easily visualize maximal/minimal points.
  • A maximal element is topmost in its branch.
  • A minimal element is bottommost in its branch.

🧪 Quick Practice:

Given: P = {1, 2, 3, 4}, with relation R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 3)}

🟢 Find:

  • Maximal elements = ?
  • Minimal elements = ?
  • Maximum = ?
  • Minimum = ?

✅ Answer:

  • Maximal = {4, 3}
  • Minimal = {1, 4}
  • Maximum = ❌
  • Minimum = ❌

Would you like:

  • 🖼️ Hasse diagram visuals?
  • 📝 PDF notes or MCQs?
  • 🎥 Hindi/English video explanation?

Let me know and I’ll send them your way!



Leave a Reply

Your email address will not be published. Required fields are marked *

error: