Class 12 Maths, Worked in Full Past papersGet updates
Chapter 3 · Matrices

Miscellaneous · Q2: B′ABB'AB symmetric or skew symmetric

Miscellaneous ExerciseSymmetric and skew symmetric matrices · Section 3.6
The question

Show that the matrix B′AB is symmetric or skew symmetric according as A is symmetric or skew symmetric.

Exam answer

Let AA be of order nn and BB of order n×mn\times m⁠. Then B′ABB'AB is a square matrix of order mm⁠.

Using (XYZ)′=Z′Y′X′(XYZ)' = Z'Y'X' and (B′)′=B(B')' = B⁠,

(B′AB)′=B′A′(B′)′=B′A′B…(i)\begin{aligned} (B'AB)' &= B'A'(B')' \\ &= B'A'B \quad\ldots(\text{i}) \end{aligned}

Case 1. AA is symmetric, so A′=AA' = A⁠. By (i),

(B′AB)′=B′AB(B'AB)' = B'AB

So B′ABB'AB is symmetric.

Case 2. AA is skew symmetric, so A′=−AA' = -A⁠. By (i),

(B′AB)′=B′(−A)B=−(B′AB)\begin{aligned} (B'AB)' &= B'(-A)B \\ &= -(B'AB) \end{aligned}

So B′ABB'AB is skew symmetric.

Hence B′ABB'AB is symmetric or skew symmetric according as AA is symmetric or skew symmetric.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

Transpose the whole product B′ABB'AB⁠. The reversal rule turns it into B′A′(B′)′B'A'(B')'⁠, and (B′)′=B(B')' = B⁠, so the outer factors B′B' and BB come back exactly where they were. Only the middle factor changes, from A to A′A'⁠. So whatever A does under transposing (stays the same, or changes sign), B′ABB'AB does too.

Given, to show, and the plan
Given
A is a square matrix, say n×nn\times n (symmetric and skew symmetric matrices are square). B is any matrix for which B′ABB'AB is defined.
To show
(a) If A′=AA' = A⁠, then (B′AB)′=B′AB(B'AB)' = B'AB⁠. (b) If A′=−AA' = -A⁠, then (B′AB)′=−B′AB(B'AB)' = -B'AB⁠.
Plan
(1) Work out the order of B and of B′ABB'AB⁠. (2) Extend the rule (XY)′=Y′X′(XY)' = Y'X' to three factors. (3) Transpose B′ABB'AB once, for any A. (4) Put in A′=AA' = A⁠, then A′=−AA' = -A⁠. (5) Check with numbers.

Basics you need

1Transpose and its rules

(A′)′=A(A')' = A⁠, (kA)′=kA′(kA)' = kA'⁠, and (AB)′=B′A′(AB)' = B'A'⁠: the transpose of a product is the product of the transposes in reverse order. Lesson: transpose

2Symmetric and skew symmetric

Square matrix with A′=AA' = A (symmetric) or A′=−AA' = -A (skew symmetric). Lesson: symmetric and skew symmetric matrices

3Associativity

(XY)Z=X(YZ)(XY)Z = X(YZ) whenever both sides are defined, so a product of three matrices can be written XYZXYZ without brackets. Lesson: properties of the operations

4Orders in a product

(m×n)(n×p)(m\times n)(n\times p) is defined and gives m×pm\times p⁠. Basics: pair up, multiply, add

Solution

  1. Orders: what B can be, and what B′ABB'AB is

    Let A be n×nn\times n and B be n×mn\times m for some mm⁠. Then B′B' is m×nm\times n⁠, and:

    • B′AB'A⁠: (m×n)(n×n)(m\times n)(n\times n)⁠, defined, order m×nm\times n⁠;
    • (B′A)B(B'A)B⁠: (m×n)(n×m)(m\times n)(n\times m)⁠, defined, order m×mm\times m⁠.

    So B′ABB'AB is a square matrix of order mm⁠, and B itself need not be square. (If B had a number of rows other than nn⁠, the product ABAB would not exist.)

    Symmetric and skew symmetric are only defined for square matrices, so before we can ask whether B′ABB'AB is one of them, we must know it is square. The order count shows it always is: the mm rows come from B′B' and the mm columns from B.
    Order of a product: rows of the first factor by columns of the last. Basics: pair up, multiply, add
  2. The reversal rule for three factors

    For matrices X, Y, Z whose product is defined, group the product as (XY)Z(XY)Z and apply (PQ)′=Q′P′(PQ)' = Q'P' twice:

    (XYZ)′=((XY)Z)′=Z′(XY)′=Z′Y′X′.\begin{aligned} (XYZ)' &= \big((XY)Z\big)' \\ &= Z'(XY)' \\ &= Z'Y'X'. \end{aligned}
    The book states the rule only for two factors. The first use treats XYXY as a single matrix P and Z as Q; the second applies the rule to XYXY itself. Associativity lets us drop the brackets at the end. The pattern is the same as taking off socks and shoes: the last thing put on is the first taken off.
    Property (iv) of Section 3.5.1, and the associative law of Section 3.4.6. Lesson: properties of the operations
  3. Transpose B′ABB'AB once, for any square A

    Use Step 2 with X=B′X = B'⁠, Y=AY = A⁠, Z=BZ = B⁠:

    (B′AB)′=B′A′(B′)′=B′A′B.\begin{aligned} (B'AB)' &= B'A'(B')' \\ &= B'A'B. \end{aligned}
    In the first line, Z′=B′Z' = B' goes in front, Y′=A′Y' = A' stays in the middle, and X′=(B′)′X' = (B')' goes at the back. The second line uses (B′)′=B(B')' = B⁠: transposing twice turns rows into columns and back again. This one identity covers both halves of the question, because so far we have used nothing about A.
    Property (i) of Section 3.5.1: (A′)′=A(A')' = A⁠. Lesson: transpose
  4. Case 1: A is symmetric

    If A′=AA' = A⁠, substitute into Step 3:

    (B′AB)′=B′A′B=B′AB.(B'AB)' = B'A'B = B'AB.

    B′ABB'AB is square (Step 1) and equals its own transpose, so B′ABB'AB is symmetric.

    Only the middle letter changed under transposing, and for a symmetric A that change does nothing.
  5. Case 2: A is skew symmetric

    If A′=−AA' = -A⁠, substitute into Step 3:

    (B′AB)′=B′(−A)B=−(B′AB).\begin{aligned} (B'AB)' &= B'(-A)B \\ &= -(B'AB). \end{aligned}

    B′ABB'AB is square and its transpose is its negative, so B′ABB'AB is skew symmetric.

    A scalar factor can be moved to the front of a product: B′((−1)A)B=(−1) B′ABB'\big((-1)A\big)B = (-1)\,B'AB⁠, because each entry of the product is a sum of terms, each containing exactly one entry of the middle factor, so the factor −1-1 comes out of every term.
    Definition 5 (Section 3.6); k(XY)=(kX)Y=X(kY)k(XY) = (kX)Y = X(kY) for a scalar kk⁠. Lesson: symmetric and skew symmetric matrices
Result

For any B with B′ABB'AB defined, (B′AB)′=B′A′B(B'AB)' = B'A'B⁠. Hence B′ABB'AB is symmetric when A is symmetric, and skew symmetric when A is skew symmetric. (Proofs have no entry in the answer key.)

Check it with numbers

Take

B=[1201],B′=[1021]B = \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}, \quad B' = \begin{bmatrix} 1 & 0 \\ 2 & 1 \end{bmatrix}

Symmetric A. With the symmetric matrix below, the entries of B′AB'A are

A=[1223]A = \begin{bmatrix} 1 & 2 \\ 2 & 3 \end{bmatrix} (1,1):1⋅1+0⋅2=1(1,2):1⋅2+0⋅3=2(2,1):2⋅1+1⋅2=4(2,2):2⋅2+1⋅3=7\begin{aligned} (1,1) &: 1\cdot1 + 0\cdot2 = 1 \\ (1,2) &: 1\cdot2 + 0\cdot3 = 2 \\ (2,1) &: 2\cdot1 + 1\cdot2 = 4 \\ (2,2) &: 2\cdot2 + 1\cdot3 = 7 \end{aligned}

so B′AB'A has rows (1,2)(1, 2) and (4,7)(4, 7)⁠. Then the entries of (B′A)B(B'A)B are

(1,1):1⋅1+2⋅0=1(1,2):1⋅2+2⋅1=4(2,1):4⋅1+7⋅0=4(2,2):4⋅2+7⋅1=15\begin{aligned} (1,1) &: 1\cdot1 + 2\cdot0 = 1 \\ (1,2) &: 1\cdot2 + 2\cdot1 = 4 \\ (2,1) &: 4\cdot1 + 7\cdot0 = 4 \\ (2,2) &: 4\cdot2 + 7\cdot1 = 15 \end{aligned} B′AB=[14415],B'AB = \begin{bmatrix} 1 & 4 \\ 4 & 15 \end{bmatrix},

which is symmetric (4 opposite 4) ✓.

Skew symmetric A. With the skew symmetric matrix below, the entries of B′KB'K are

K=[01−10]K = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix} (1,1):1⋅0+0⋅(−1)=0(1,2):1⋅1+0⋅0=1(2,1):2⋅0+1⋅(−1)=−1(2,2):2⋅1+1⋅0=2\begin{aligned} (1,1) &: 1\cdot0 + 0\cdot(-1) = 0 \\ (1,2) &: 1\cdot1 + 0\cdot0 = 1 \\ (2,1) &: 2\cdot0 + 1\cdot(-1) = -1 \\ (2,2) &: 2\cdot1 + 1\cdot0 = 2 \end{aligned}

so B′KB'K has rows (0,1)(0, 1) and (−1,2)(-1, 2)⁠. Then the entries of (B′K)B(B'K)B are

(1,1):0⋅1+1⋅0=0(1,2):0⋅2+1⋅1=1(2,1):(−1)⋅1+2⋅0=−1(2,2):(−1)⋅2+2⋅1=0\begin{aligned} (1,1) &: 0\cdot1 + 1\cdot0 = 0 \\ (1,2) &: 0\cdot2 + 1\cdot1 = 1 \\ (2,1) &: (-1)\cdot1 + 2\cdot0 = -1 \\ (2,2) &: (-1)\cdot2 + 2\cdot1 = 0 \end{aligned} B′KB=[01−10],B'KB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix},

which is skew symmetric (zero diagonal, 1 opposite −1-1⁠) ✓. The verification script repeats this for 300 random cases, including non-square B (for example a 2×32\times3 B, which gives 3×33\times3 results).

Common mistakes
  1. Transposing without reversing, writing (B′AB)′=(B′)′A′B′=BA′B′(B'AB)' = (B')'A'B' = BA'B'⁠. That is a different matrix (often of a different order) and the argument collapses.
  2. Forgetting (B′)′=B(B')' = B, and leaving (B′)′(B')' in the answer, so the result does not visibly match B′ABB'AB⁠.
  3. Assuming B is square or symmetric. Nothing about B is needed beyond the product being defined.
  4. Proving only one case. The words "according as" ask for both: symmetric gives symmetric, skew gives skew.
What to take away
  1. (XYZ)′=Z′Y′X′(XYZ)' = Z'Y'X'⁠: the reversal rule extends to any number of factors.
  2. Sandwiching A between B′B' and B preserves its type. In particular B′B=B′IBB'B = B'IB is always symmetric, since I is symmetric.
  3. Do the transpose once for a general A, then substitute each case. That is shorter and clearer than two separate proofs.

Every fact used, and where it comes from

FactUsed inSource
Order of a productStep 1Section 3.4.5 (Lesson: matrix multiplication)
(A′)′=A(A')' = A⁠, (AB)′=B′A′(AB)' = B'A'Steps 2, 3Section 3.5.1, properties (i) and (iv) (Lesson: transpose)
Associative law (AB)C=A(BC)(AB)C = A(BC)Step 2Section 3.4.6 (Lesson: properties of the operations)
A scalar factor moves through a productStep 5Follows from the entry formula of Section 3.4.5
Definitions of symmetric and skew symmetricSteps 4, 5Definitions 4 and 5, Section 3.6 (Lesson: symmetric and skew symmetric)
All matrices in the check; random testsCheckRecomputed with sympy in the site's verification script
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →