Symmetry of a relation has a beautiful visual signature. Draw the relation as arrows between dots, and symmetry means every arrow has a twin going the other way. Break that symmetry even once — by including (a, b) without (b, a) — and the relation is no longer symmetric. This article makes the check a glance.

The visual rule

Take a set A = \{1, 2, 3, 4\} and a relation R on A. Draw each ordered pair (a, b) \in R as a directed arrow from a to b. The relation is symmetric if, for every arrow you draw, the arrow going the opposite direction is also in the relation.

Checking symmetry is then purely mechanical: scan each arrow, ask "does the reverse exist?" and flag anything that fails.

Interactive slider for switching between six sample relationsA slider at the bottom moves between positions labelled 0 through 6, each naming a sample relation. Above the slider, four nodes labelled 1, 2, 3, 4 are arranged in a square. Arrows are drawn between nodes depending on which relation is selected. A readout at the top reports the current relation number and whether it is symmetric based on a summary in the caption. 0 3 6 drag to switch cases 1 2 3 4 (1,3)&(3,1) OK (2,4) no (4,2)!
A small relation on $\{1, 2, 3, 4\}$ with four arrows. The blue arrows $(1, 2)$, $(2, 1)$, $(1, 3)$, $(3, 1)$ all come in matched pairs — each has a twin pointing the other way. The red dashed arrow $(2, 4)$ is orphaned: $(4, 2) \notin R$. That single missing reverse arrow is enough to make the relation *not* symmetric. Drag the slider to see other cases discussed below.

Why: the definition of symmetric is universally quantified — "for every (a, b) \in R, (b, a) \in R." A single counter-example kills it. The visual version of that rule: if any arrow is drawn without its reverse twin, the relation fails symmetry.

Six cases to build the reflex

The slider scans through six prototypical relations on \{1, 2, 3, 4\}. Use each one to anchor your visual intuition.

Case 0 — The empty relation

No arrows at all. Symmetric by vacuous truth — there is no offending pair, because there is no pair at all. The statement "for every arrow, the reverse exists" is true when there are no arrows to check.

Case 1 — The identity relation

Arrows only from each node to itself: \{(1,1), (2,2), (3,3), (4,4)\}. Self-loops. Symmetric, because the reverse of a self-loop is the same self-loop. Every reverse is automatically present.

Case 2 — Two mutual pairs, no self-loops

R = \{(1, 2), (2, 1), (3, 4), (4, 3)\}. Every arrow has a visible twin going the other way. Symmetric. Notice that reflexivity fails (no self-loops), but symmetry is fine — the two properties are independent.

Case 3 — A mixed relation (the one shown in the figure)

R = \{(1, 2), (2, 1), (1, 3), (3, 1), (2, 4)\}. The first four arrows come in pairs. The last, (2, 4), is orphaned. Not symmetric — the red dashed arrow in the picture marks the missing reverse.

Case 4 — A chain

R = \{(1, 2), (2, 3), (3, 4)\}. Every arrow goes one direction. Not symmetric — every single arrow is missing its reverse. This is as anti-symmetric as it gets.

Case 5 — The full relation

R = A \times A — all 16 pairs. Every possible arrow is present, including every possible reverse. Symmetric. Also reflexive and transitive, so the full relation is an equivalence relation (albeit a trivial one — everyone is in one big class).

Case 6 — "Same parity"

R = \{(1, 1), (1, 3), (3, 1), (3, 3), (2, 2), (2, 4), (4, 2), (4, 4)\} — two elements are related if they have the same parity (both odd or both even). Every pairwise link between two odd numbers appears twice (once in each direction); same for even numbers. Symmetric. This one is also reflexive and transitive — it is a full equivalence relation, partitioning A into the odd class \{1, 3\} and the even class \{2, 4\}.

Training the pattern recognition

After staring at the six cases, a pattern emerges. In the picture:

The fastest mental check: look at the picture, scan for any arrow that is alone (not part of a paired round-trip), and if you find one, declare not-symmetric. If every non-self-loop arrow has a visible partner, declare symmetric.

The grid picture of symmetry

The same property shows up as a mirror symmetry on the grid. Plot the relation as filled cells on A \times A (rows are first coordinate, columns are second). Then the relation is symmetric if and only if the pattern of filled cells is symmetric about the main diagonal (the line from (1, 1) to (n, n)).

If you fold the grid along the diagonal, the filled cells should land on top of other filled cells. Any cell that has no partner across the fold signals a missing reverse.

Grid diagram of a symmetric relation on four elementsA 4 by 4 grid with rows and columns labelled 1 through 4. Filled red dots appear in cells symmetric about the main diagonal from top-left to bottom-right: the four diagonal cells (1,1), (2,2), (3,3), (4,4) all have dots; the cells (1,2) and (2,1) both have dots; the cells (3,4) and (4,3) both have dots. No unpaired cells are present. A dashed line marks the main diagonal, emphasising the mirror symmetry. b a 1 2 3 4 1 2 3 4 diagonal reflection symmetric ✓
The grid picture of a symmetric relation on $\{1, 2, 3, 4\}$. The filled cells form a pattern that is a mirror image of itself across the main diagonal (the dashed line). Every cell above the diagonal has a twin below, and every diagonal cell is filled. If any cell above the diagonal had no twin below, the relation would not be symmetric.

The reflex

When a question says "Is this relation symmetric?" or "Which of the following relations are symmetric?":

  1. Draw the relation as arrows between nodes, or as dots on the grid — whichever is faster.
  2. Scan for any arrow (or grid cell) without its reverse partner.
  3. One missing partner kills symmetry. No missing partners confirms symmetry.

The check is fast enough to do in your head for small sets. For larger sets, the grid picture is usually quicker than the arrow picture, because the visual "mirror symmetry about the diagonal" is an instant gestalt.

Once you have trained the pattern — the round-trip arrows, the grid mirror — symmetry stops being a definition you recite and becomes something you simply see.

Related: Relations · Equivalence Relations · Ordered-Pair Plotter · Set Operations