Math 2.0

Linear and multilinear algebra; matrix theory Proposition

Transpose of a product

Builds on TransposeMatrix multiplication

Statement

Let RR be a commutative ring. Let AA be an m×nm \times n matrix and BB an n×pn \times p matrix over RR. Then (AB)T=BTAT(AB)^T = B^T A^T, where T^T denotes the transpose.

Remarks

The order of the factors reverses. The proof compares entries: both sides have entry (k,i)(k, i) equal to ∑jaijbjk\sum_{j} a_{ij} b_{jk}. By induction, (A1A2⋯Ak)T=AkT⋯A2TA1T(A_1 A_2 \cdots A_k)^T = A_k^T \cdots A_2^T A_1^T. If RR is not commutative, the identity can fail.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Matrix definition
  2. Matrix multiplication definition
  3. Transpose definition
  4. Transpose of a product statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Transpose, Properties
About this page
Tag09GK5PS824
URIm2://09GK5PS824
Kindstatement, proposition
WritingW0 stub
MSC15A99
StatusThis copy of the site has no build data. Run m2 status 09GK5PS824.
UsesTranspose, Matrix multiplication

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.