> For the complete documentation index, see [llms.txt](https://julienbeaulieu.gitbook.io/wiki/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://julienbeaulieu.gitbook.io/wiki/sciences/math/linear-algebra/operations/inverses-and-transpose-and-permutations.md).

# Inverses and Transpose and permutations

### Transpose <a href="#transpose" id="transpose"></a>

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-LevxysOwZ3MOpG39RBV%2Fimage.png?alt=media\&token=1a22095a-40f8-4319-81b2-d7ef5363b037)

Example:

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-LevyVjSots-jASs3B47%2Fimage.png?alt=media\&token=73e128a5-7426-449c-9ed7-4d875653c39d)

For symmetric matrices, A^T = A, so they are unaffected by transposes.&#x20;

Also R transpose x R is always symetric.&#x20;

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-LevygbME8roe7FA1KNo%2Fimage.png?alt=media\&token=c2505a85-5da2-4f54-86fb-7426ee28b4e7)

Why? Well let's take the transpose and see if they are the same. (R^T R)^T = R^T x R^TT = R^T x R

Also

![](blob:https://app.gitbook.com/e864b8e6-5bf9-4084-945e-04abc22dab0e)

Brilliant.org:

### Transpose a matrix

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-LeYY4QtuY_3sZTsfqYF%2F-LeYY5eTCWeRXcrg5a_2%2Fimage.png?alt=media\&token=afd1ddbf-4df6-4021-bb23-7b7eb23db45c)

Exercise

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-LeYY4QtuY_3sZTsfqYF%2F-LeYfJbxXkNGOr_oQFTp%2Fimage.png?alt=media\&token=4eb86f5a-cd4a-4ae6-9cab-f54f809604c3)

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-LeYY4QtuY_3sZTsfqYF%2F-LeYfO3R-xfwNf1-1yvT%2Fimage.png?alt=media\&token=9adac9e5-319a-4f1a-a097-7c8aaeb7e676)

### Permutations <a href="#transpose" id="transpose"></a>

Permutations P execute row exchanges. P is the identity matrix with reordered rows.&#x20;

When you want to make row operations, multiply on the left hand side:

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-Lesiwq8f4PvhXv_G3_4%2Fimage.png?alt=media\&token=e63571fb-8c2a-4741-be13-58422deb2ea9)

When you want to do column operations, multiply on the right:&#x20;

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-LeskA4enYUBvtldogS_%2Fimage.png?alt=media\&token=b6d06019-ded4-49f2-97dc-2fd91eada50b)

**3x3 Permutations**

All the ways I can take the identity matrix and rearrange its rows. For 3x3 matrices there are 6 total permutation matrices. for nxn matrices, there will be n! permutation matrices. Also the inverses are the transposes : P-1 = P T or P T P = I (P transpose x P = Identity matrix).&#x20;

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-Levrjlp5LJ6mhExr_QF%2Fimage.png?alt=media\&token=89d9d0d5-a37d-4075-b096-061137ba3f00)

The first one changes row 1 and 2, the 2nd changes row 1 and 3. The 4th is a cycle, it puts row 2 in row 1 and row 3 in row 1.&#x20;

The description of elimination WITH row exchanges is PA = LU for any invertable A.&#x20;

![](https://846345873-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LagOeJ2nL90MQERwhxy%2F-Les_bNJt4mr4K_-rEub%2F-Levwh1JowhNSAdbh1Lh%2Fimage.png?alt=media\&token=6b04a247-d26b-4980-8b1c-aeb32840fac3)

Brilliant.org:
