Suppose that A and B are finite sets.Then we take a relation say R from A to B. From a rectangular array whose rows are labeled by the elements of A and whose columns are labeled by the elements of B. Put a 1 or 0 in each position of the array according as a belongs to A is or is not related to b belongs to B. This array is called the matrix of the relation. There are matrix relations of reflexive and symmetric relations. In reflexive relation, all the diagonal elements of relation should be equal to 1. For example if R = {(1,1), (1,3), (2,2), (3,2), (3,3)} defined on A = {1,2,3}. Then clearly R is reflexive. Simply in making matrix relation In the above example,as the defined set is A={1,2,3} so there are total three elements. Now we take 1, 2 and 3 horizontally and vertically.i.e we make a matrix from the relation R ,in the matrix you have now 3 columns and 3 rows. Now start to make the matrix ,as you have first order pair (1, 1) it means that 1 maps on itself and you write 1 in 1st row and in first column. 2nd order pair is (1, 3) it means that arrow goes from 1 to 3.Then you have to write 1 in 1st row and in 3rd column. (2, 2) means that arrow goes from 2 and ends itself. Here you have to write 1 in 2nd row and in 2nd column. (3,2) means arrow goes from 3 and ends at 2. Here you have to write 1 in 3rd row and in 2nd column. (3, 3) means that 3 maps on itself and you write 1 in 3rd row and in 3rd column. And where there is space empty or unfilled ,you have to write 0 there.
No comments:
Post a Comment