Exercise 3.3 · Q7: Show one matrix is symmetric and another skew symmetric
(i) Show that the matrix
is a symmetric matrix.
(ii) Show that the matrix
is a skew symmetric matrix.
(i)
, so is a symmetric matrix.
(ii)
, so is a skew symmetric matrix.
Want the reason behind every step, the basics and the checks?
Picture the main diagonal as a mirror. Transposing swaps each entry with its mirror image across that diagonal. A matrix is symmetric when every entry equals its mirror image (), so transposing changes nothing: . It is skew symmetric when every entry is the negative of its mirror image (), so transposing flips every sign: . In that case each diagonal entry must equal its own negative, so the diagonal is all zeros.
- Given
- Two (square) matrices.
- To show
- (i) ; (ii) .
- Plan
- For each: (1) write by turning rows into columns; (2) compare it with (or with ) entry by entry; (3) state the conclusion using the definition.
Basics you need
: rows become columns, and each entry moves to its mirror position across the main diagonal. Basics: mirror patterns
A square matrix is symmetric if , that is for all . It is skew symmetric if , that is for all ; then , so . Lesson: symmetric and skew symmetric
: change the sign of every entry. Basics: scalar multiples
Part (i): the symmetric matrix
(i) Write
is , so it is square and the question of symmetry makes sense. Its rows are ; ; . Writing them as columns:
Symmetric and skew symmetric are defined only for square matrices, because must have the same order as for to be possible.Transpose, Definition 3 (Basic 1). Lesson: transpose(i) Compare with , pair by pair
The diagonal entries 1, 2, 3 are unchanged by transposing. The three mirror pairs are
- and : equal;
- and : equal;
- and : equal.
So every entry of equals the corresponding entry of , and .
A matrix has 3 diagonal entries and 3 mirror pairs off the diagonal. Checking all three pairs covers every position, which is what "for all " requires here.(i) Conclude
is square and , so by Definition 4 is a symmetric matrix.
Definition 4, Section 3.6 (Basic 2). Lesson: symmetric matrices
Part (ii): the skew symmetric matrix
(ii) Write and
The rows of , ; ; , become columns:
Changing the sign of every entry of :
To test we need both matrices written out. Note that , so the zero diagonal stays zero., Section 3.4.2 (Basic 3).(ii) Compare, pair by pair
- Diagonal: , as a skew symmetric matrix requires.
- and : opposite.
- and : opposite.
- and : opposite.
Hence every entry of equals the corresponding entry of : .
The condition must hold for every and , including , where it forces . Here all three diagonal entries are 0 and all three off-diagonal pairs are opposite, so every case is covered.(ii) Conclude
is square and , so by Definition 5 is a skew symmetric matrix. (It is not symmetric, since : for example but .)
Definition 5, Section 3.6. Lesson: skew symmetric matrices
(i) , so is symmetric. (ii) , so is skew symmetric.
Add a matrix to its transpose. In (i), , whose (1,3) entry is . ✓ In (ii), should be the zero matrix: (1,2) entry , (1,3) entry , (2,3) entry , diagonal . ✓
- Checking only one pair. All three off-diagonal pairs (and, for skew symmetric, the diagonal) must be checked.
- Thinking a skew symmetric matrix can have a nonzero diagonal. forces .
- Comparing rows with rows. Symmetry compares row with column : row 1 of (i), , equals column 1, .
- Symmetric: , mirror pairs equal. Skew symmetric: , mirror pairs opposite, diagonal zero.
- For a matrix there are exactly three mirror pairs to check.
- Row of a symmetric matrix reads the same as column .
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Transpose | Part (i), Step 1; Part (ii), Step 1 | Definition 3, Section 3.5 (Lesson: transpose) |
| Symmetric: square and | Part (i), Step 3 | Definition 4, Section 3.6 (Lesson) |
| Skew symmetric: square and ; diagonal entries zero | Part (ii), Steps 2–3 | Definition 5, Section 3.6 |
| Negative of a matrix | Part (ii), Step 1 | Section 3.4.2 |
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 →