Show that each of the relation R in the set A = { x ∈ Z : 0 ≤ x ≤ 12}, given by
I. R={(a,b):Ia-bI is a multiple of 4}
II. R={(a,b):a=b}
is an equivalence relation. Find the set of all elements related to 1 in each case.
A={ x ∈ Z : 0≤ x ≤ 12}={0,1,2,3,4,5,6,7,8,9,10,11,12}
(i) R={(a,b):Ia-bI is a multiple of 4}
For any element a ∈A, we have (a, a) ∈ R as is a multiple of 4.
∴R is reflexive.
Now, let (a, b) ∈ R ⇒ is a multiple of 4.
\(\Rightarrow\)I-(a-b)I=Ib-aI is a multiple of 4.
\(\Rightarrow\) (b, a) ∈ R
∴R is symmetric.
Now, let (a, b), (b, c) ∈ R.
\(\Rightarrow\)Ia-bI is a multiple of 4 and Ib-cI is a multiple of 4.
\(\Rightarrow\)(a-b) is a multiple of 4 and (b-c) is a multiple of 4.
\(\Rightarrow\)(a-c)=(a-b)+(b-c) is a multiple of 4.
\(\Rightarrow\)Ia-cI is a multiple of 4.
\(\Rightarrow\) (a, c) ∈R
∴ R is transitive.
Hence, R is an equivalence relation.
The set of elements related to 1 is {1, 5, 9} since I1-1I=0 is a multiple of 4,
I5-1I=4 is a multiple of 4,and
I9-1I=8 is a multiple of 4.
(ii) R = {(a, b): a = b}
For any element a ∈A, we have (a, a) ∈ R, since a = a.
∴R is reflexive.
Now, let (a, b) ∈ R.
⇒ a = b
⇒ b = a
⇒ (b, a) ∈ R
∴R is symmetric.
Now, let (a, b) ∈ R and (b, c) ∈ R.
⇒ a = b and b = c
⇒ a = c
⇒ (a, c) ∈ R
∴ R is transitive.
Hence, R is an equivalence relation.
The elements in R that are related to 1 will be those elements from set A which are equal to 1.
Hence, the set of elements related to 1 is {1}.
A carpenter needs to make a wooden cuboidal box, closed from all sides, which has a square base and fixed volume. Since he is short of the paint required to paint the box on completion, he wants the surface area to be minimum.
On the basis of the above information, answer the following questions :
Find a relation between \( x \) and \( y \) such that the surface area \( S \) is minimum.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
During the festival season, a mela was organized by the Resident Welfare Association at a park near the society. The main attraction of the mela was a huge swing, which traced the path of a parabola given by the equation:\[ x^2 = y \quad \text{or} \quad f(x) = x^2 \]

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 = Φ.
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.
Every element of set A is related to itself only then the relation is identity 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
If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.
A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A
A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.