Matrices of order relations

Lecture



The order relation corresponds to matrices in which the main diagonal is filled with units (reflexivity). For each pair of unit elements, one of which is located in the Ith column and the Jth row, and the second in the Jth column and the Kth row, there is necessarily a single element in the Ith column and Kth row ( transitivity). In addition, no single element has a symmetric with respect to the main diagonal (antisymmetry).

The matrix of strict order relations is different in that all elements of the main diagonal are zero (anti-reflexivity).

For example : The matrix of the relation “to be a divisor” on the set M = {1, 2, 3, 4, 6, 7, 12, 14} has the form:

Xi

Xj

one

2

3

four

6

7

12

14

one

one

2

one

one

3

one

one

four

one

one

one

6

one

one

one

one

7

one

one

12

one

one

one

one

one

one

14

one

one

one

one

The matrix of relations “to be larger” on the set M = {1, 4, 2, 6, 3, 7, 8, 10} has the form:

Xi

Xj

one

four

2

6

3

7

eight

ten

one

four

one

one

one

2

one

6

one

one

one

one

3

one

one

7

one

one

one

one

one

eight

one

one

one

one

one

one

ten

one

one

one

one

one

one

one

· If a set of a completely strict order is set on the set M , i.e. M = {1, 2, 3, 4, 6, 7, 8, 10}, then the “be bigger” ratio matrix on this set has units in all cells located below the main diagonal, and zeros in all cells located above the main diagonal.

created: 2015-01-06
updated: 2021-03-13
132859



Rating 9 of 10. count vote: 2
Are you satisfied?:



Comments


To leave a comment
If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Discrete Math. Set theory. Graph theory. Combinatorics.

Terms: Discrete Math. Set theory. Graph theory. Combinatorics.