Let A = \(\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\), B = \(\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\) and P = \(\begin{pmatrix} 0 & 1 & 0 \\ x & 0 & 0 \\ 0 & 0 & y \end{pmatrix}\) be an orthogonal matrix such that B = PAP−1 holds. Then
x = 1 = y
The relation \(B = PAP^{-1}\) is equivalent to \(BP = PA\), which can be compared entry by entry; orthogonality of P further requires each row of P to be a unit vector.
Step 1 — Orthogonality: the rows (0, 1, 0), (x, 0, 0), (0, 0, y) must be unit vectors, so \(x^{2} = 1\) and \(y^{2} = 1\). This already rules out y = 0 and x = 0.
Step 2 — Compute \(PA\): row 1 of P picks row 2 of A, giving (1, 0, 0); row 2 gives x·(0, 0, 1) = (0, 0, x); row 3 gives y·(0, 0, 0). So \(PA = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 0 & x \\ 0 & 0 & 0 \end{pmatrix}\).
Step 3 — Compute \(BP\): row 1 of B picks row 2 of P, (x, 0, 0); row 2 picks row 3 of P, (0, 0, y); row 3 is zero. So \(BP = \begin{pmatrix} x & 0 & 0 \\ 0 & 0 & y \\ 0 & 0 & 0 \end{pmatrix}\).
Step 4 — Equating: x = 1 and y = x = 1.
Every pair containing y = 0 or x = 0 makes P singular, hence not orthogonal, and x = −1 contradicts the (1, 1) entries of BP and PA.
x = 1 = y option is correct.
A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then
If z1 and z2 are two complex numbers satisfying the equation \(\left|\dfrac{z_1 + z_2}{z_1 - z_2}\right| = 1\), then \(\dfrac{z_1}{z_2}\) may be
If R and R1 are equivalence relations on a set A, then so are the relations
Let a1, a2, a3, …, an be positive real numbers. Then the minimum value of
\(\dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \ldots + \dfrac{a_n}{a_1}\) is
Consider a quadratic equation ax2 + 2bx + c = 0 where a, b, c are positive real numbers. If the equation has no real root, then which of the following is true ?
Let ρ be a relation defined on set of natural numbers ℕ, as ρ = \(\{(x, y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 41\}\). Then domain A and range B are
Let P(n) = 32n + 1 + 2n + 2 where n ∈ ℕ. Then
Let A and B are orthogonal matrices and det A + det B = 0. Then
Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is
If one root of x2 + px − q2 = 0, p and q are real, be less than 2 and other be greater than 2, then
Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.
If $ \left(\frac{1}{^{15}C_0} + \frac{1}{^{15}C_1}\right)$ $\left(\frac{1}{^{15}C_1} + \frac{1}{^{15}C_2}\right)$ $\dots$ $ \left(\frac{1}{^{15}C_{12}} + \frac{1}{^{15}C_{13}}\right)$ = $\frac{\alpha^{13}}{^{14}C_0 ^{14}C_1 \dots ^{14}C_{12}} $, then $30\alpha$ is equal to __________.