Part 01-Discrete mathematics for gate-Partial Order Relations and it’s matrix representation
Contents
Partial Order Relations and Its Matrix Representation (Discrete Mathematics for GATE)
1. Introduction to Partial Order Relations
A partial order relation (poset) is a binary relation RR on a set SS that satisfies the following properties:
-
Reflexivity: aRaaRa for all a∈Sa \in S
-
Antisymmetry: If aRbaRb and bRabRa, then a=ba = b
-
Transitivity: If aRbaRb and bRcbRc, then aRcaRc
A set SS along with a partial order relation RR is called a partially ordered set (poset).
2. Matrix Representation of Partial Order Relations
The relation matrix of a partial order relation on a finite set is a square matrix MRM_R of size n×nn \times n, where:
-
Mij=1M_{ij} = 1 if aiRaja_i R a_j
-
Mij=0M_{ij} = 0 otherwise
Example:
Let S={1,2,3}S = \{1, 2, 3\} with a relation R={(1,1),(2,2),(3,3),(1,2),(2,3)}R = \{(1,1), (2,2), (3,3), (1,2), (2,3)\}.
The relation matrix MRM_R is:
MR=[110011001]M_R = \begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}
-
The diagonal elements are 1, ensuring reflexivity.
-
The matrix is not symmetric, proving antisymmetry.
-
The transitive closure can be found using the Warshall’s Algorithm.
3. Hasse Diagram Representation
A Hasse diagram is a graphical representation of a poset where:
-
Reflexive edges are omitted.
-
Transitive edges are removed for simplicity.
-
Elements are arranged hierarchically.
For the above example, the Hasse Diagram is:
4. Applications of Partial Order Relations
-
Scheduling Problems
-
Hierarchical Structures
-
Dependency Graphs in Computer Science
-
Data Organization in Databases
Would you like a detailed explanation or GATE-level problems on this topic?