How to Calculate Symmetric Relations in Set Theory?

In summary, there are a total of 7 possible symmetric relations on A that contain exactly four ordered pairs, 35 possible relations that contain exactly five ordered pairs, and 21 possible relations that contain exactly seven or eight ordered pairs.
  • #1
jwxie
281
0
Hi.

Let A = 1,2,3,4,5,6,7
How many symmetric relations on A contain exactly (a) four ordered pairs, (b) 5 , (c) seven and (d) eight

The book has solutions to the first two, which I didn't understand at all.

Please look the pic below
scymv4.png


Can someone guide me through how to approach the problem?

Thanks
 
Physics news on Phys.org
  • #2
jwxie said:
Hi.

Let A = 1,2,3,4,5,6,7
How many symmetric relations on A contain exactly (a) four ordered pairs, (b) 5 , (c) seven and (d) eight

The book has solutions to the first two, which I didn't understand at all.

Please look the pic below
scymv4.png


Can someone guide me through how to approach the problem?

Thanks
You can imagine any relation a a table with 7 rows and 7 columns, where you indicate in each position whether the corresponding elements belong to the relation. (This is basically the same as working with the graph of this relation.)

A relation is symmetric if and only if this graph/table is symmetric with respect to the main diagonal. Hence, a symmetric relation is uniquely determined by the pairs on and above the main diagonal.
You have 7 positions on diagonal and 21=6+5+4+3+2+1 positions above the diagonal.
If you put a elements above the diagonal, then there are also a elements bellow it, by the symmetry. So, by putting a elements above the diagonal and b elements on the diagonal, you obtain a relation consisting of 2a+b pairs.

Now, if you want to have 4 elements you have these possibilities:
all 4 elements are on the diagonal [tex]\binom{7}{4}[/tex];
2 elements on the diagonal and 1 above it [tex]\binom72\binom{21}1[/tex];
no element on the diagonal and 2 above it [tex]\binom{21}2[/tex].

For 5 elements you have the following possibilieites:
All 5 elements on the diagonal [tex]\binom75[/tex];
3 elements on the diagonal and 1 above it [tex]\binom73+\binom{21}1[/tex];
1 element on the diagonal and 2 above it [tex]\binom71+\binom{21}2[/tex].
 

Related to How to Calculate Symmetric Relations in Set Theory?

1. How do you determine the number of symmetric relations?

To determine the number of symmetric relations, you can use the formula 2^(n(n+1)/2) where n is the number of elements in the set. This formula is based on the fact that each element in the set can either be related to itself or not, resulting in 2 possible outcomes. Therefore, for a set with n elements, there are 2^n possible relations. However, since symmetric relations are reflexive (each element is related to itself), we divide by 2 to eliminate duplicate relations, resulting in 2^(n(n+1)/2).

2. Can the number of symmetric relations be infinite?

No, the number of symmetric relations is always finite. As mentioned in the previous answer, for a set with n elements, there are 2^(n(n+1)/2) possible relations. However, as the number of elements in the set increases, the number of possible relations also increases exponentially and can become very large.

3. Are all symmetric relations reflexive?

Yes, all symmetric relations are reflexive. This means that for any element in the set, it will be related to itself in the symmetric relation. For example, in a set {a, b, c}, a symmetric relation could be {(a,a), (b,b), (c,c), (a,b), (b,a), (b,c), (c,b), (a,c), (c,a)}, where each element is related to itself and can also be related to other elements in the set.

4. Can a symmetric relation be anti-symmetric?

No, a symmetric relation cannot be anti-symmetric. An anti-symmetric relation is one where if (a,b) is in the relation, then (b,a) cannot be in the relation. However, in a symmetric relation, if (a,b) is in the relation, then (b,a) must also be in the relation. Therefore, a relation cannot be both symmetric and anti-symmetric.

5. How does the number of symmetric relations compare to the number of asymmetric relations?

The number of symmetric relations is always greater than the number of asymmetric relations. This is because asymmetric relations do not include the reflexive property, meaning there are fewer possible combinations. The formula for the number of asymmetric relations is 2^n - 2^(n(n-1)/2), which is always smaller than the formula for the number of symmetric relations, 2^(n(n+1)/2).

Similar threads

  • Set Theory, Logic, Probability, Statistics
2
Replies
35
Views
764
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
13
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
14
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
3K
  • Quantum Interpretations and Foundations
Replies
7
Views
823
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
3K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
2K
Back
Top