21.4.2. Part B: Anti-Symmetric Relations

In this section, we define anti-symmetric relations as follows: If both (a, b) and (b, a) are present in the relation, then it is only allowed if a is equal to b. If a is not equal to b, then both pairs cannot be present simultaneously in the relation.

Anti-symmetric relations focus on the relationship between pairs of elements. Specifically, if we have two different elements a and b, the relationship allows either one of the pairs (a, b) or (b, a) but not both. If we have a situation where a is equal to b, then including both (a, b) and (b, a) is permitted because they are effectively the same. This property helps in distinguishing relationships that exhibit a form of order.

Imagine a leaderboard for a game where participants can be ranked. If Player A is ranked above Player B, it cannot happen that Player B is also ranked above Player A unless they are in the same position (i.e., they have the same score). This reflects the essential nature of anti-symmetric relationships.

To count the number of anti-symmetric relations, we start with n elements in the set S. Along the diagonal, which contains pairs of the form (i, i) where i refers to an element in S, we can either include or exclude these pairs. Hence, for each of these n diagonal pairs, we have 2 choices.

For an anti-symmetric relation, we have n diagonal pairs from the set S. We can choose to include any or all of these pairs. However, we also need to handle pairs of the form (i, j) and (j, i) where i is not equal to j. For these pairs, if we include (i, j) in our relation, we cannot include (j, i) as well, otherwise we'd violate the anti-symmetry property. Therefore, for each distinct pair (i, j), we have three options: include neither (i, j) nor (j, i), include (i, j) but exclude (j, i), or include (j, i) but exclude (i, j). If we have (n² - n)/2 such distinct pairs, this impacts our total count significantly.

Think of a ranking system in a competition where participants can have their positions. Participants can occupy a rank by themselves or can be ranked equally with others but cannot rank oppositely. Thus, for every direct matchup, you have limited options on what to record, similar to our count of the pairs in an anti-symmetric relation.

The total number of anti-symmetric relations can be calculated as: 2^n * 3^((n² - n)/2). Here, the first part represents the number of ways we can choose diagonal pairs, and the second part accounts for the distinct pairs as discussed.

The formula compiles our choices in a structured way. The term 2^n arises because there are n diagonal elements, each with 2 choices. The term 3^((n² - n)/2) arises because we have (n² - n)/2 distinct pairs, giving rise to three choices per distinct pair. This calculation represents a comprehensive understanding of how many different configurations are possible under the restriction of anti-symmetry.

Returning to our ranking analogy, this is akin to evaluating all possible configurations across the leaderboard where we can either show a player having their rank or having them be ranked equally with others. This captures the essence of the variety of anti-symmetric relationships possible.

--