Analyzing the Setup
We are given a 3×3 non-singular matrix A. The condition that A is non-singular implies that its determinant is non-zero and its inverse, A−1, exists.
We are also provided with the condition AA′=A′A. This identifies A as a Normal Matrix, which serves as the foundational constraint for our derivation. Our objective is to determine the product BB′ where B=A−1A′.
Phase 1
The Transpose Reversal Law
To evaluate
BB′, we first determine the expression for
B′. Given
B=A−1A′, we take the transpose of both sides:
B′=(A−1A′)′
Applying the
Transpose Reversal Law, which states that
(XY)′=Y′X′, we obtain:
B′=(A′)′(A−1)′
Since the transpose of a transpose returns the original matrix,
(A′)′=A. Furthermore, the transpose of an inverse is the inverse of the transpose, meaning
(A−1)′=(A′)−1. Thus, our expression simplifies to:
B′=A(A′)−1
Phase 2
The Associative Symphony
Now, we construct the product
BB′ using our derived expressions:
BB′=(A−1A′)(A(A′)−1)
Matrix multiplication is associative, allowing us to regroup the terms without changing their order. We focus on the central terms:
BB′=A−1(A′A)(A′)−1
We now utilize the "golden ticket" provided in the problem statement: A′A=AA′. Substituting this into our equation allows us to rearrange the matrices to facilitate cancellation.
Phase 3
The Grand Finale
Substituting the condition
A′A=AA′ into the expression, we get:
BB′=A−1(AA′)(A′)−1
By applying the associative property once more, we group the terms as follows:
BB′=(A−1A)(A′(A′)−1)
Recognizing the definition of the Identity matrix
I, where
A−1A=I and
A′(A′)−1=I, the expression simplifies to:
BB′=I⋅I
The final result is:
BB′=I
This result demonstrates that B is an orthogonal matrix. The logical progression confirms that the structural properties of A dictate the behavior of B throughout the transformation.