JEE Challenger
More from Matrices

Nonzero Square of Matrix with Complex Cube Roots of Unity

Let ω\omega be a complex cube root of unity satisfying ω≠1\omega \neq 1, and let P=[pij]P = [p_{ij}] denote an n×nn \times n matrix where pij=ωi+jp_{ij} = \omega^{i+j}. Then P2≠0P^2 \neq 0 when nn equals:

Options

A

5757

B

5555

Correct
C

5858

Correct
D

5656

Correct

Step-by-Step Solution

To determine the values of nn for which P2≠0P^2 \neq 0, let us first calculate the entries of the matrix P2P^2.

The given matrix is P=[pij]n×nP = [p_{ij}]_{n \times n}, where: pij=ωi+jp_{ij} = \omega^{i+j} Here, ω\omega is a complex cube root of unity with ω≠1\omega \neq 1, which implies: ω3=1and1+ω+ω2=0\omega^3 = 1 \quad \text{and} \quad 1 + \omega + \omega^2 = 0

Let the product matrix be P2=[qik]n×nP^2 = [q_{ik}]_{n \times n}. The element in the ii-th row and kk-th column of P2P^2 is given by: qik=∑j=1npijpjk=∑j=1nωi+jωj+k=ωi+k∑j=1nω2jq_{ik} = \sum_{j=1}^{n} p_{ij} p_{jk} = \sum_{j=1}^{n} \omega^{i+j} \omega^{j+k} = \omega^{i+k} \sum_{j=1}^{n} \omega^{2j}

Since ωi+k≠0\omega^{i+k} \neq 0 for all i,ki, k, the matrix P2P^2 will be the zero matrix if and only if the scalar sum: S=∑j=1nω2j=ω2+ω4+ω6+⋯+ω2nS = \sum_{j=1}^{n} \omega^{2j} = \omega^2 + \omega^4 + \omega^6 + \dots + \omega^{2n} is equal to zero.

Using the property ω3=1\omega^3 = 1, the powers of ω2\omega^2 are periodic with period 3:

  • For j=1j = 1: ω2\omega^2
  • For j=2j = 2: ω4=ω\omega^4 = \omega
  • For j=3j = 3: ω6=1\omega^6 = 1

The sum of any three consecutive terms is: ω2+ω+1=0\omega^2 + \omega + 1 = 0

Therefore, the sum SS depends on the value of n(mod3)n \pmod 3:

  1. If n=3kn = 3k (nn is a multiple of 33): S=k(ω2+ω+1)=k(0)=0  ⟹  P2=0S = k(\omega^2 + \omega + 1) = k(0) = 0 \implies P^2 = 0

  2. If n=3k+1n = 3k + 1: S=0+ω2=ω2≠0  ⟹  P2≠0S = 0 + \omega^2 = \omega^2 \neq 0 \implies P^2 \neq 0

  3. If n=3k+2n = 3k + 2: S=0+ω2+ω=−1≠0  ⟹  P2≠0S = 0 + \omega^2 + \omega = -1 \neq 0 \implies P^2 \neq 0

Hence, P2≠0P^2 \neq 0 if and only if nn is not a multiple of 33 (n≢0(mod3)n \not\equiv 0 \pmod 3).

Now, evaluating the given options:

  • (A) n=57=3×19  ⟹  n≡0(mod3)  ⟹  P2=0n = 57 = 3 \times 19 \implies n \equiv 0 \pmod 3 \implies P^2 = 0
  • (B) n=55=3×18+1  ⟹  n≡1(mod3)  ⟹  P2≠0n = 55 = 3 \times 18 + 1 \implies n \equiv 1 \pmod 3 \implies P^2 \neq 0
  • (C) n=58=3×19+1  ⟹  n≡1(mod3)  ⟹  P2≠0n = 58 = 3 \times 19 + 1 \implies n \equiv 1 \pmod 3 \implies P^2 \neq 0
  • (D) n=56=3×18+2  ⟹  n≡2(mod3)  ⟹  P2≠0n = 56 = 3 \times 18 + 2 \implies n \equiv 2 \pmod 3 \implies P^2 \neq 0

Thus, P2≠0P^2 \neq 0 when nn equals 5555, 5858, or 5656.

Correct Options: B, C, D