Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
17.2.2. Examples of Symmetric Relations
Learn content
Interactive Audio Lesson
Unlock the classroom podcast
The transcript is free to read. A free account plays the conversation back.
Today we are going to learn about symmetric relations. Can anyone tell me what they think 'symmetric' means in relation terms?
Does it mean that both elements are connected in both directions?
Exactly! A relation is symmetric if whenever we have 'a' related to 'b', then 'b' must also be related to 'a'.
So, if I have a pair like (1, 2), I also need to have (2, 1) for it to be symmetric?
Correct! That is the essential property of symmetric relations. Let’s remember it with the acronym SYM: 'S' for 'Says Both Ways'!
Unlock the classroom podcast
The transcript is free to read. A free account plays the conversation back.
Now let’s discuss how we can represent these relationships using matrices. Who can explain what a symmetric matrix looks like?
Is it true that the entry at position (i, j) is the same as (j, i)?
Exactly! If our relation has (a, b) in it, then there must also be (b, a). This creates a symmetric matrix.
Could you show us an example of such a matrix?
"Of course! If we have a relation R with pairs {(1, 2), (2, 1)}, our matrix looks like this:
Unlock the classroom podcast
The transcript is free to read. A free account plays the conversation back.
Let’s visualize symmetric relations with directed graphs. Can anyone describe what that looks like?
We'd have arrows going both ways between the nodes?
Absolutely! If there's an edge from node a to b, a symmetric relation ensures an edge from b to a also exists.
What if there’s no connection at all?
No connection doesn’t affect symmetry. Remember that it only matters if an edge exists. If neither exists, it vacuously satisfies symmetry.
Unlock the classroom podcast
The transcript is free to read. A free account plays the conversation back.
Let's explore some examples. What makes the relation R = {(1, 2), (2, 1)} symmetric?
Because both pairs exist! And every unpaired relation would break the symmetry.
Correct! Now, what happens with the relation R = {(1, 2)}?
It’s not symmetric because we lack the pair (2, 1).
Good catch! Remember that having both pairs is vital for symmetry.
Overview
Short Summary
This section defines symmetric relations, explaining their properties, examples, and relationships with other types of relations.
Medium Summary
In this section, symmetric relations are introduced, characterized by the property that if an element 'a' is related to 'b', then 'b' must also be related to 'a'. Various examples are provided, and the discussion includes comparisons with reflexive, irreflexive, asymmetric, and antisymmetric relations.
Detailed Summary
Examples of Symmetric Relations
In this section, we define symmetric relations as those for which if an element a is related to an element b in a relation R, then b must also be related to a. This property can be observed through matrices, where the presence of an entry in the (i, j) position guarantees an identical entry in the (j, i) position of the matrix.
Definition and Properties
-
A relation
Rfrom a setAto a setBis symmetric if:
If(a, b) ∈ R, then(b, a) ∈ R.
This does not require all pairs(a, b)and(b, a)to be included inR, just that each relationship implies the reciprocal. -
The matrix representation of symmetric relations is itself symmetric, confirming that transposing the matrix yields the same values.
-
In graph terms, if there is a directed edge from
atob, then there must also be a directed edge frombtoa.
Examples
- The empty relation is trivially symmetric.
- A relation containing pairs like
R = {(1, 1), (2, 2), (1, 2), (2, 1)}is symmetric because for every(x, y)pair wherex ≠ y,(y, x)is also present. - Not symmetric examples include a relation like
R = {(1, 2)}without its reciprocal(2, 1). Both the matrix and graphical representations illustrate these examples and properties well.
This section ultimately shows how symmetry in relations is a fundamental concept that intersects with various other relations, providing groundwork for understanding more complex relationships in set theory.
Reference YouTube Videos
Audio Book
Unlock the audio lesson
The script is above and free to read. A free account plays it back, in the voice you pick.
Create a free accountNow let us define symmetric relations, so this relation can be defined from a set A to B where B is might be different from A. So, the relation is from A to B and we say it is symmetric, so as the name suggests symmetric we want here the following to hold, whenever a is related to b as per the relation R, we need that b also should be related to a.
Detailed Explanation
A symmetric relation is a special type of relation that is characterized by the following principle: if one element (a) is related to another element (b), then that second element (b) must also be related back to the first one (a). This property can apply whether the two elements are from the same set or different sets. In simpler terms, if a is friends with b, then b must also be friends with a for the friendship relation to be considered symmetric.
Examples & Analogies
Think of a friendship relationship: if you are friends with someone, they are also your friend. Therefore, the friendship relation is symmetric. If Person A is friends with Person B, then for the relation to be symmetric, Person B must also consider Person A a friend.
Unlock the audio lesson
The script is above and free to read. A free account plays it back, in the voice you pick.
Create a free accountSo, it is easy to see that the matrix for a symmetric relation will always be a symmetric matrix, because if you have a R b, that means the i, jth entry will be 1 and since my relation is symmetric, that means I will also have (b, a) to be present.
Detailed Explanation
In mathematical terms, a symmetric relation can be represented using a matrix. In this context, a matrix is constructed where rows and columns represent elements of the set. If there is a relation from element a (in position i) to element b (in position j), the matrix entry at (i, j) is marked with a 1. Because of the symmetry property, if (a, b) is present, then (b, a) must also be present, which means that the entry at (j, i) will also be 1. This results in a symmetric matrix, where the left side mirrors the right side along the diagonal.
Examples & Analogies
Imagine a map where certain cities have direct roads connecting them. If there's a road from City A to City B (indicating a connection in one direction), and for the relation to be symmetric, there must also be a road connecting City B back to City A. Hence, the layout of the roads can be represented symmetrically on a map.
Unlock the audio lesson
The script is above and free to read. A free account plays it back, in the voice you pick.
Create a free accountSo, again let us do this example, I have set A = {1, 2} and I am defining various binary relations from A to A itself. Now which of the following relations are symmetric.
Detailed Explanation
To identify if specific relations are symmetric, we can examine a set, A, such as {1, 2}, and define relationships among its elements. The process involves looking at each pair of elements; if the presence of a relation from one element to the other implies an inverse relation also exists, that pair is symmetric. For example, if we have pairs (1, 2) and (2, 1) both in our relation, we would consider it symmetric, as each element relates back to the other. However, if only one direction (e.g., (1, 2) without (2, 1)) exists, then the relation is not symmetric.
Examples & Analogies
Consider a sports team where players pass the ball to each other. If Player 1 passes the ball to Player 2, for the passing relationship to be considered symmetric, Player 2 must also pass the ball back to Player 1. If Player 2 does not return the pass, the relationship is asymmetrical.
Unlock the audio lesson
The script is above and free to read. A free account plays it back, in the voice you pick.
Create a free accountSo, here is a question for you, can I say that every reflexive relation is also a symmetric relation? So, remember reflexive relation means every element of the form (a, a) will represent in R.
Detailed Explanation
This section poses an important question regarding the relationship between reflexive and symmetric relations. A reflexive relation is one where every element relates to itself, such as (1, 1) and (2, 2). However, just because a relation is reflexive, it does not guarantee that it is also symmetric. For example, a reflexive relation can have an additional pair (1, 2) without the corresponding (2, 1), which means it fails to meet the symmetric condition.
Examples & Analogies
Imagine a teacher grading tests. The teacher grades their own test paper (reflexivity) but doesn’t grade the tests of their colleagues. This situation shows that reflexivity can exist without symmetry, as the teacher's action applies solely to their own work without reciprocation.
--
Key concepts
Core takeaways and short definitions to help you quickly recall the key ideas from this section.
- Symmetric Relation:
A property where relationships are reciprocal.
- Matrix Representation:
Shows relationships in a structured format.
- Directed Graph:
Visual representation of relations indicating connection direction.
Examples
Step-by-step examples to apply the section's ideas and test your understanding.
The empty relation is trivially symmetric.
A relation containing pairs like R = {(1, 1), (2, 2), (1, 2), (2, 1)} is symmetric because for every (x, y) pair where x ≠ y, (y, x) is also present.
Not symmetric examples include a relation like R = {(1, 2)} without its reciprocal (2, 1). Both the matrix and graphical representations illustrate these examples and properties well.
This section ultimately shows how symmetry in relations is a fundamental concept that intersects with various other relations, providing groundwork for understanding more complex relationships in set theory.
Memory aids
Two friends, Ed and Sam, share a secret handshake. If Ed initiates, Sam reciprocates, proving their friendship is symmetric.
Remember SYM: 'S' for 'Symmetric', 'Y' for 'You relate both ways', 'M' for 'Mutual connections'.
Flash Cards
Glossary
Symmetric Relation
A relation where if (a, b) is in R, then (b, a) must also be in R.
Matrix Representation
An array that represents the connections of a relation, indicating which pairs are related.
Directed Graph
A graphical representation of relations where arrows indicate the direction of the relationships.