Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let A be the set of all functions $f: \mathbf{Z} \rightarrow \mathbf{Z}$ and R be a relation on A such that $\mathrm{R}=\{(\mathrm{f}, \mathrm{g}): f(0)=\mathrm{g}(1)$ and $f(1)=\mathrm{g}(0)\}$. Then R is :
Step 1: Reflexivity would require f(0)=f(1) for every integer-valued function f, which is false. Swapping the two equations shows symmetry.
Step 2: For transitivity, choose functions whose value pairs (f(0),f(1)), (g(0),g(1)), and (h(0),h(1)) are respectively (0,1),(1,0),(0,1). Then fRg and gRh, but f is not related to h because f(0)≠h(1).
Step 3: The relation is symmetric but neither reflexive nor transitive, option B.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.