DIZNR INTERNATIONAL

Part 01-Discrete mathematics for gate-Partial Order Relations and it’s matrix representation

Part 01-Discrete mathematics for gate-Partial Order Relations and it’s matrix representation

https://www.gyanodhan.com/video/7B5.%20GATE%20CSEIT/Discrete%20Mathematics%202/523.%20Day%2003%20%20Part%2001-Discrete%20mathematics%20for%20gate-Partial%20Order%20Relations%20and%20it%27s%20matrix%20representation.mp4

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:

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:

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}

3. Hasse Diagram Representation
A Hasse diagram is a graphical representation of a poset where:

For the above example, the Hasse Diagram is:

3

2

1

4. Applications of Partial Order Relations

Would you like a detailed explanation or GATE-level problems on this topic?

Part 01-Discrete mathematics for gate-Partial Order Relations and it’s matrix representation

DIGITAL NOTES ON Discrete Mathematics B.TECH II YEAR

Discrete Mathematical Structures Unit-1