Question:

Let \( A = \{1, 2, 3, 4, 5, 6, 7\} \). Then the relation \( R = \{(x, y) \in A \times A : x + y = 7\} \) is:

Show Hint

Check symmetry by verifying if \( (x, y) \in R \implies (y, x) \in R \). For reflexivity, \( (x, x) \in R \) must hold, and for transitivity, validate the chain condition.
Updated On: Mar 22, 2025
  • Symmetric but neither reflexive nor transitive

  • Transitive but neither symmetric nor reflexive

  • An equivalence relation

  •  Reflexive but neither symmetric nor transitive

Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

The relation \( R \) is defined as:

\[ R = \{(x, y) \in A \times A : x + y = 7\}. \]

By substitution, the pairs in \( R \) are:

\[ R = \{(1, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, 1)\}. \]

  1. Symmetry:
    • For \( (x, y) \in R \), \( x + y = 7 \).
    • Therefore, \( (y, x) \in R \) since \( y + x = 7 \).
    • Hence, \( R \) is symmetric.
  2. Reflexivity:
    • For \( R \) to be reflexive, \( (x, x) \in R \) for all \( x \in A \).
    • This is not true because \( x + x \neq 7 \) for any \( x \in A \).
    • Hence, \( R \) is not reflexive.
  3. Transitivity:
    • For \( R \) to be transitive, if \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \).
    • However, this is not satisfied as there are no such \( x, y, z \) in \( R \) to form a valid chain.
    • Hence, \( R \) is not transitive.

Thus, \( R \) is symmetric but neither reflexive nor transitive.

Was this answer helpful?
1
2

Concepts Used:

Types of Relation

TYPES OF RELATION

Empty Relation

Relation is said to be empty relation if no element of set X is related or mapped to any element of X i.e, R = Φ.

Universal Relation

A relation R in a set, say A is a universal relation if each element of A is related to every element of A.

R = A × A.

Identity Relation

Every element of set A is related to itself only then the relation is identity relation.

Inverse Relation

Let R be a relation from set A to set B i.e., R ∈ A × B. The relation R-1 is said to be an Inverse relation if R-1 from set B to A is denoted by R-1

Reflexive Relation

If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.

Symmetric Relation

A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.

Transitive Relation

A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A

Equivalence Relation

A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.