17.3. Asymmetric Relations

Now the next special relation is the asymmetric relation and the condition here is, if you have (a, b) present in the relation, then you demand that b should not be related to a. And again this is an implication that means this should hold only if (a, b) is present in the relation at the first place, if (a, b) is not present in the relation, vacuously this statement will be true.

An asymmetric relation is defined by the property that if element 'a' is related to element 'b', then element 'b' cannot be related back to element 'a'. To put it simply, the relationship is one-directional. For example, if we have the relation (1, 2), then having (2, 1) would contradict the definition of asymmetry. This property only needs to be verified when the relation (a, b) exists; if it does not exist, the condition is automatically satisfied.

Think about a one-way street: if you can only drive from 'A' to 'B', then you cannot drive from 'B' back to 'A'. Similarly, if (a, b) is an entry in an asymmetric relation, it’s like saying you can go from point A to point B, but there’s no way to return directly from B back to A.

So, in terms of matrix notation the property of matrix for an asymmetric relation will be as follows. You take any i, jth entry, ith row and jth column, you can have at most one of the entries i, j or j, i being 1 in the matrix. You cannot have both entry number i, j 1 as well as j, i also 1. Because that will mean that you have (a, b) present in R, and (b, a) also present in the R.

In a matrix representation of an asymmetric relation, each entry corresponds to whether a relationship exists between two elements. For example, if we have element 'a' related to element 'b', that entry in the matrix will be marked as 1. However, according to the definition of asymmetric relations, you can't have the entry both marked for (a, b) and (b, a). This implies that if (1, 2) exists in the matrix, (2, 1) must not.

Imagine a hotel check-in process where guests can only check into their rooms. If guest A checks into room 1, then room 1 cannot be checked by guest A again to serve as a check-out. This reflects how entries in a matrix of asymmetric relations must be structured—either one check-in or none, but not both ways.

In terms of graph representation, if you take any pair of nodes (a, b) then either you can have at most one edge, that means you can have either the edge from a to b or from b to a or no edge between a or b.

As in the matrix, the graph representation of asymmetric relations visually displays relationships through directed edges (arrows). If there is a directed edge from node 'a' to 'b', there will be no edge going back from 'b' to 'a'. This graphical representation allows us to understand the flow of relationships, emphasizing that they are not reciprocated.

Imagine a one-way street where cars can only drive in one direction. The street represents a node pair, and the traffic flows only one way: from a to b. This visual helps us see that the relationship is unidirectional—cars (or relationships) can move from point A to point B but cannot return directly.

So, again, here I am taking A and B to be the same sets and I have given you some relations. So, let us see which of these relations are asymmetric. The first relation is not asymmetric because you have (a, b) as well as (b, a), only (1, 1) being present in this relation which serves as both (a,b) as well as (b, a). Due to the same reason R is also not an asymmetric relation because you have both (a, b) as well as (b, a) present here.

In analyzing various examples of relations, we determine whether they are asymmetric by checking for the presence of both (a, b) and (b, a). If both entries exist, the relation fails to meet the asymmetry condition. For instance, if we find (1, 2) and (2, 1) in a relation, it cannot be classified as asymmetric because it violates the requirement for one-directionality.

Consider a relationship where only one individual can tell the other they are friends, such that if A claims friendship with B, B cannot reciprocate that acknowledgment in a different context (like social media statuses). If one person posts about their friendship but the other doesn’t express that status back, it mirrors the asymmetric relation definition.

Because if you have (a, a) present in the R, then that violates the universal quantification here, that serves as a counter example...

When discussing asymmetry, it's important to note that if there is no relation at all present, or if we have entries like (a, a) which would signify self-referential relationships, these do not contradict the definition of asymmetry. In logic, if a condition cannot be applied due to the lack of any relationship to consider, we say the condition is vacuously true.

Think of a situation where there are no friends at a party. If there are no relationships to measure (or perhaps no friendships exactly identified), it’s like saying the rule about not being able to be both friend and not friend does not apply because there are no connections to assess. This vacuous truth helps us understand that lack of relationships can satisfy conditions.

--