Skip to content
Back to exploration
Algebra / Chinese

Permute Matrix Rows, Rearrange the Inverse Columns

均一教育平台 Junyi Academy · YouTube · 2:04

Open original
READ & KEEP

The explanation, unpacked.

Reviewed learning material · Video analysis · English
Read the full overview

Given an invertible A and its inverse K, reorder the rows of A as3,1,2 to form N. Its inverse reorders the columns of K as3,1,2, rather than its rows, giving option5. The source explains row-column pairing; editorial permutation notation N=PA and N⁻¹=KP⁻¹ verifies the full product, beyond its diagonal. Primed lowercase letters are entries of the known inverse, not derivatives.

Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.

Chapters

0:00Problem Presentation and Solution Strategy0:20Analyzing Matrix Row Permutation Relationship0:40Deriving the Answer Using Inverse Matrix Definition1:02Problem and Inverse Matrix Criterion1:14Locking Option (5) with Row-Column Pairing1:32Verifying Remaining Row-Column Correspondences1:56Summary of Row Swaps and Column Swaps

Learning script

Generated from the video's visuals and explanation; not verbatim speech.

The problem gives K, the inverse of A. There is no need to recompute nine entries: use the row relationship between the new matrix N and A.

The rows of N are rows three, one and two of A. Editorial notation expresses that order as N=PA using a permutation matrix P.

Inverting a product reverses factor order: the inverse of N is K times P⁻¹ on the right. Right multiplication changes the columns of K, not its rows.

The first row of A is now the second row of N, so the first column of K must become the second column of the new inverse.

The remaining pairs agree: the first row g,h,i pairs with first column c′,f′,i′; the third row d,e,f pairs with third column b′,e′,h′.

The columns of K therefore appear as third, first and second, giving option five. The known inverse relationship makes off-diagonal pairings zero; three diagonal ones alone would not prove an inverse.

Knowledge cards

01

Matrices

The source gives A and K=AK=A⁻¹. Editorial names N and C denote the rearranged matrix and its inverse.

AK=KA=I3AK=KA=I_3
02

Row permutation

N uses the rows of A in order3,1,2; P is a permutation matrix, not a single elementary row swap.

N=PA,P=[001100010]N=PA,\quad P=\begin{bmatrix}0&0&1\\1&0&0\\0&1&0\end{bmatrix}
03

Inverse of a product

For invertible square factors, reverse their order when inverting.

N−1=(PA)−1=A−1P−1=KP−1N^{-1}=(PA)^{-1}=A^{-1}P^{-1}=KP^{-1}
04

Right multiplication permutes columns

K right-multiplied by P⁻¹ has old columns3,1,2 in that order.

KP−1=[c′a′b′f′d′e′i′g′h′]KP^{-1}=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
05

Use the known inverse

Exploit the given inverse and positional relation rather than calculating an adjugate.

06

Inverse criterion

Verify the whole identity product, including zero off-diagonal entries.

NC=CN=I3NC=CN=I_3
07

Row-by-column multiplication

One product entry is a row-column inner product.

(NC)rc=∑k=13NrkCkc(NC)_{rc}=\sum_{k=1}^{3}N_{rk}C_{kc}
08

Relocated row, relocated column

The original first row moves to row two; its inverse column moves to column two.

09

Option five

The actual final source selects option5 with this column ordering; all entries agree with KP⁻¹.

[c′a′b′f′d′e′i′g′h′]\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
10

Positions matter

Having the same symbols is insufficient: row and column positions determine the identity product.

11

Row permutation and inverse columns

For N=PA, the inverse is KP⁻¹. The specified factor side is essential.

NC=PAKP−1=I3,CN=KP−1PA=I3NC=PAKP^{-1}=I_3,\quad CN=KP^{-1}PA=I_3

Detailed learning notes

Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.

Symbols · 13

A

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen displays the 3×33\times 3 matrix [a b c; d e f; g h i]

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

A

Meaning

A3×3A 3\times 3 square matrix with elements a,b,c,d,e,f,g,h,i, whose inverse is known

Domain

3×33\times 3 square matrix

N

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen displays the 3×33\times 3 matrix [g h i; a b c; d e f]

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

N

Meaning

Editorial N uses rows3,1,2 of A to form a new3×3 matrix.

Domain

3×33\times 3 square matrix

A−1A^{-1}

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen displays [a' b' c'; d' e' f'; g' h' i'], and the audio explains that this is the inverse of A

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

A−1A^{-1}

Meaning

The inverse matrix of A, with elements denoted by primed variables a',b',c',d',e',f',g',h',i'

Domain

3×33\times 3 square matrix

I

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

I

Meaning

Identity matrix, the result of multiplying a matrix by its inverse in the definition

Domain

3×33\times 3 square matrix

A

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen shows the 3×33\times 3 matrix [abcdefghi]\begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix}, referred to as the "known matrix".

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

A

Meaning

The original matrix with elements a,b,c,d,e,f,g,h,ia,b,c,d,e,f,g,h,i.

Domain

3×33\times 3 matrix

K

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen shows [a′b′c′d′e′f′g′h′i′]\begin{bmatrix} a'&b'&c'\\ d'&e'&f'\\ g'&h'&i' \end{bmatrix} and states it is the inverse of AA.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

K

Meaning

The inverse matrix of AA, with elements a′,b′,c′,d′,e′,f′,g′,h′,i′a',b',c',d',e',f',g',h',i'.

Domain

3×33\times 3 matrix

I3I_3

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The right side of the screen displays [100010001]\begin{bmatrix} 1&0&0\\ 0&1&0\\ 0&0&1 \end{bmatrix}.

  2. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

I3I_3

Meaning

The 3rd-order identity matrix.

Domain

3×33\times 3 matrix

[a\ b\ c]

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The first row of the original matrix is [a b c][a\ b\ c], marked in green on the screen.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

[a\ b\ c]

Meaning

The first row of matrix AA.

Domain

Matrix row vector

[d\ e\ f]

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The second row of the original matrix is [d e f][d\ e\ f], marked in pink on the screen.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

[d\ e\ f]

Meaning

The second row of matrix AA.

Domain

Matrix row vector

[g\ h\ i]

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The third row of the original matrix is [g h i][g\ h\ i], marked in cyan on the screen.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

[g\ h\ i]

Meaning

The third row of matrix AA.

Domain

Matrix row vector

[a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The first column of the inverse matrix is [a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

[a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}

Meaning

The first column of matrix K=A−1K=A^{-1}.

Domain

Matrix column vector

[b′e′h′]\begin{bmatrix} b'\\ e'\\ h' \end{bmatrix}

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The second column of the inverse matrix is [b′e′h′]\begin{bmatrix} b'\\ e'\\ h' \end{bmatrix}.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Symbol

[b′e′h′]\begin{bmatrix} b'\\ e'\\ h' \end{bmatrix}

Meaning

The second column of matrix K=A−1K=A^{-1}.

Domain

Matrix column vector

Knowledge points · 5

Definition of Inverse Matrix

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Formula
    Observation

    The source gives A and its inverse K and uses the identity criterion; editorial notation is AK=KA=I₃ with explicit row and column orientation.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Definition
Explanation

The given K=AK=A⁻¹ satisfies AK=KA=I₃. The source uses row-column pairing for the new inverse; editorial names avoid conflicting segment labels.

Formula
AK=KA=I3AK=KA=I_3
Conditions
  1. A is an invertible square matrix

Row Permutation of Matrices

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    In the video, the speaker circles corresponding rows of A and N in green

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Method
Explanation

The rows of N are rows3,1,2 of A. Editorial notation is N=PA with a permutation matrix P. A three-cycle can be decomposed into two swaps and is not a single row-swap elementary matrix.

Formula
N=PA,P=[001100010]N=PA,\quad P=\begin{bmatrix}0&0&1\\1&0&0\\0&1&0\end{bmatrix}
Prerequisites
  1. Definition of Inverse Matrix

Product of Inverse and Original Matrix Yields Identity Matrix

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen states "The inverse of the known matrix [abcdefghi]\begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix} is [a′b′c′d′e′f′g′h′i′]\begin{bmatrix} a'&b'&c'\\ d'&e'&f'\\ g'&h'&i' \end{bmatrix}", and the right side shows =[100010001]=\begin{bmatrix}1&0&0\\0&1&0\\0&0&1\end{bmatrix}.

  2. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Definition
Explanation

The given K=AK=A⁻¹ satisfies AK=KA=I₃. The source uses row-column pairing for the new inverse; editorial names avoid conflicting segment labels.

Formula
AK=KA=I3AK=KA=I_3
Conditions
  1. A and K are both3×3 matrices with K=AK=A⁻¹

  2. Editorial notation uses AK=I₃ for the given inverse relationship.

"Row-Column Pairing" Rule for Matrix Multiplication

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    The screen uses different colors to circle the rows of the original matrix and columns of the inverse matrix, showing a one-to-one correspondence between rows and columns.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Method
Explanation

At position(r,c), pair row r of N with column c of candidate C and compare with the corresponding identity entry.

Formula
(NC)rc=∑k=13NrkCkc(NC)_{rc}=\sum_{k=1}^{3}N_{rk}C_{kc}
Conditions
  1. Applicable to element-wise verification of matrix multiplication

  2. In this problem, r,c∈{1,2,3}r,c\in\{1,2,3\}

Prerequisites
  1. Product of Inverse and Original Matrix Yields Identity Matrix

Row Swap in Original Matrix Corresponds to Column Swap in Inverse Matrix

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    In the screen, the column order of option (5) changes relative to the original inverse matrix, while the row order of the original matrix AA is also rearranged.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Method
Explanation

The video emphasizes a shortcut for solving: when the rows of the left matrix are swapped, the columns of the right matrix must be correspondingly swapped to maintain the identity matrix result after "row-column pairing". This problem utilizes this correspondence to quickly lock in the answer.

Formula
Conditions
  1. For N=PA, C=KP⁻¹; P is a row permutation matrix and K=AK=A⁻¹.

Prerequisites
  1. "Row-Column Pairing" Rule for Matrix Multiplication
Derivations and proofs · 3

Derivation of the Inverse of N

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    The screen shows the rows of A and N circled to indicate correspondence, and writes out the structure of A−1A^{-1}A=IA = I

Uncertainties
  1. P and the full product notation are editorial. The model prematurely read option3; the actual final source selects5.

Intuitive argument
Steps
  1. Expression
    N=[ghiabcdef],A=[abcdefghi]N=\begin{bmatrix}g&h&i\\a&b&c\\d&e&f\end{bmatrix},\quad A=\begin{bmatrix}a&b&c\\d&e&f\\g&h&i\end{bmatrix}
    Explanation

    Compare the given row ordering.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
  2. Expression
    N=PA,P=[001100010]N=PA,\quad P=\begin{bmatrix}0&0&1\\1&0&0\\0&1&0\end{bmatrix}
    Explanation

    P reorders rows3,1,2.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
  3. Expression
    N−1=A−1P−1=KP−1N^{-1}=A^{-1}P^{-1}=KP^{-1}
    Explanation

    Reverse the invertible factors; retain the right-side permutation.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
  4. Expression
    P−1=PT=[010001100]P^{-1}=P^T=\begin{bmatrix}0&1&0\\0&0&1\\1&0&0\end{bmatrix}
    Explanation

    Direct multiplication gives both identity products for P and its transpose.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
  5. Expression
    N−1=K[010001100]N^{-1}=K\begin{bmatrix}0&1&0\\0&0&1\\1&0&0\end{bmatrix}
    Explanation

    Right multiplication places the old columns3,1,2 in the new result.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
  6. Expression
    N−1=[c′a′b′f′d′e′i′g′h′]N^{-1}=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
    Explanation

    The actual complete source option is5.

    Justification

    Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.

    Supplementary explanation
Conclusion

The new inverse uses columns3,1,2 of K, giving option5.

Deducing Option (5) from Row Position Change

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    Editorial positional reading pairs the second row of N, [a b c], with the second column [a′ d′ g′]ᵀ of actual option5.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Intuitive argument
Steps
  1. Expression
    A=[a b c; d e f; g h i]⇒N=[g h i; a b c; d e f]A=[a\ b\ c;\ d\ e\ f;\ g\ h\ i]\quad\Rightarrow\quad N=[g\ h\ i;\ a\ b\ c;\ d\ e\ f]
    Explanation

    The left matrix in the problem has undergone row rearrangement relative to the original AA; the original first row [a b c][a\ b\ c] is now the second row.

    Justification

    The screen directly shows the difference in row order between the problem matrix and the original matrix.

    Supplementary explanation
  2. Expression
    (NC)22=[a b c][a′d′g′]=1(NC)_{22}=[a\ b\ c]\begin{bmatrix}a'\\d'\\g'\end{bmatrix}=1
    Explanation

    Row two of N pairs with column two of C, whose complete entries are a′,d′,g′.

    Justification

    The first diagonal pairing in AK moves to the second diagonal position.

    Supplementary explanation
  3. Expression
    [a b c]⋅[a′d′g′]=1[a\ b\ c]\cdot\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}=1
    Explanation

    Originally, [a b c][a\ b\ c] in AK=I3AK=I_3 pairs with [a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}; after the row moves to position2, this column also moves to position2.

    Justification

    Following the row-column pairing relationship of the original inverse matrix and applying the rule stated in the video that row swaps correspond to column swaps.

    Supplementary explanation
  4. Expression
    C=[c′a′b′f′d′e′i′g′h′]C=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
    Explanation

    The middle column of option (5) is exactly [a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}, which meets the above requirement.

    Justification

    All nine actual final option5 entries agree with the editorial KP⁻¹ computation.

    Supplementary explanation
Conclusion

Therefore, the answer to this problem should be (5).

Re-verifying Option (5) Using Remaining Row-Column Pairings

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    Editorial matching uses the actual N rows g,h,i; a,b,c; d,e,f and option5 columns c′f′i′; a′d′g′; b′e′h′.

Uncertainties
  1. Model transcription confused row positions; editorial correction uses the actual problem and final matrix, without alleging an author spoken error.

Intuitive argument
Steps
  1. Expression
    [d e f]⋅[b′e′h′]=1[d\ e\ f]\cdot\begin{bmatrix}b'\\e'\\h'\end{bmatrix}=1
    Explanation

    Row3 of N pairs with column3 of C, inheriting the corresponding diagonal entry of AK.

    Justification

    AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.

    Supplementary explanation
  2. Expression
    [g h i]⋅[c′f′i′]=1[g\ h\ i]\cdot\begin{bmatrix}c'\\f'\\i'\end{bmatrix}=1
    Explanation

    Row1 of N pairs with column1 of C, inheriting the corresponding diagonal entry of AK.

    Justification

    AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.

    Supplementary explanation
  3. Expression
    [a b c]⋅[a′d′g′]=1[a\ b\ c]\cdot\begin{bmatrix}a'\\d'\\g'\end{bmatrix}=1
    Explanation

    Row2 of N pairs with column2 of C, inheriting the corresponding diagonal entry of AK.

    Justification

    AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.

    Supplementary explanation
Conclusion

All three sets of row-column pairings are consistent with the requirements of the identity matrix, further supporting that option (5) is the correct inverse matrix.

Worked examples · 2

Matrix inverse row-rearrangement exercise (101, question4)

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen displays the complete problem: Given the inverse of A is A−1A^{-1}, find the inverse of N, listing five options

  2. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Problem

Given square matrix A = [a b c; d e f; g h i] and its inverse A−1A^{-1} = [a' b' c'; d' e' f'; g' h' i']. Which of the following options is the inverse of N = [g h i; a b c; d e f]?

Given
  1. A=[abcdefghi]A = \begin{bmatrix} a & b & c \\ d & e & f \\ g & h & i \end{bmatrix}

  2. A−1A^{-1} = [a′b′c′d′e′f′g′h′i′]\begin{bmatrix} a' & b' & c' \\ d' & e' & f' \\ g' & h' & i' \end{bmatrix}

  3. N=[ghiabcdef]N = \begin{bmatrix} g & h & i \\ a & b & c \\ d & e & f \end{bmatrix}

Goal

Find the inverse matrix N−1N^{-1}

Steps
  1. Expression
    N=PAN=PA
    Explanation

    The first row of N is the third row of A, the second row is the first row of A, and the third row is the second row of A.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  2. Expression
    N=PAN = PA
    Explanation

    Represent the row permutation as left-multiplication by an permutation matrix P.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  3. Expression
    N−1=A−1P−1N^{-1} = A^{-1}P^{-1}
    Explanation

    Expand using the multiplicative property of inverse matrices.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  4. Expression
    C=KP−1C=KP^{-1}
    Explanation

    Right multiplication by P⁻¹ reorders columns of K as3,1,2, not its rows.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  5. Expression
    C=[c′a′b′f′d′e′i′g′h′]C=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
    Explanation

    This is actual option5; the early model option3 is not the complete source conclusion.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
Answer

Option5: C=[c′a′b′f′d′e′i′g′h′]C=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}.

Verification

Editorial checks give NC=PAKP⁻¹=I₃ and CN=KP⁻¹PA=I₃, verifying every entry rather than only three diagonal1 entries.

Finding the Inverse After Row Rearrangement

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    The screen fully presents the problem: Given that the inverse of [abcdefghi]\begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix} is [a′b′c′d′e′f′g′h′i′]\begin{bmatrix} a'&b'&c'\\ d'&e'&f'\\ g'&h'&i' \end{bmatrix}, ask for the inverse of [ghiabcdef]\begin{bmatrix} g&h&i\\ a&b&c\\ d&e&f \end{bmatrix}, listing five options (1) to (5).

  2. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Problem

Given that the inverse of A=[abcdefghi]A=\begin{bmatrix} a&b&c\\ d&e&f\\ g&h&i \end{bmatrix} is A−1=[a′b′c′d′e′f′g′h′i′]A^{-1}=\begin{bmatrix} a'&b'&c'\\ d'&e'&f'\\ g'&h'&i' \end{bmatrix}, find the inverse of [ghiabcdef]\begin{bmatrix} g&h&i\\ a&b&c\\ d&e&f \end{bmatrix}.

Given
  1. A−1=[a′b′c′d′e′f′g′h′i′]A^{-1}=\begin{bmatrix} a'&b'&c'\\ d'&e'&f'\\ g'&h'&i' \end{bmatrix}

  2. The matrix to be found is [ghiabcdef]\begin{bmatrix} g&h&i\\ a&b&c\\ d&e&f \end{bmatrix}

  3. Actual option5 is[c′a′b′f′d′e′i′g′h′]\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}

Goal

Select the correct inverse matrix from the five candidates.

Steps
  1. Expression
    AA−1=I3A A^{-1}=I_3
    Explanation

    First use the known inverse matrix to determine the original row-column pairing relationships.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  2. Expression
    [a b c]↔[a′d′g′][a\ b\ c]\leftrightarrow\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}
    Explanation

    The first row of the original matrix [a b c][a\ b\ c] corresponds to the first column [a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix} in the original inverse matrix.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  3. Expression
    [g h i; a b c; d e f][g\ h\ i;\ a\ b\ c;\ d\ e\ f]
    Explanation

    The matrix to be found is obtained by rearranging the rows of the original matrix.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
  4. Expression
    [c′a′b′f′d′e′i′g′h′]\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}
    Explanation

    To maintain the same row-column pairing, the inverse matrix must also rearrange its columns accordingly; option (5) meets this requirement.

    Justification

    Check factor sides and the full identity relationship from the source row ordering and actual option5.

    Supplementary explanation
Answer

Option5: C=[c′a′b′f′d′e′i′g′h′]C=\begin{bmatrix}c'&a'&b'\\f'&d'&e'\\i'&g'&h'\end{bmatrix}.

Verification

Editorial checks give NC=PAKP⁻¹=I₃ and CN=KP⁻¹PA=I₃, verifying every entry rather than only three diagonal1 entries.

Visual events · 3

Circling and Marking Row Correspondence

Clear evidence
Supplementary explanation
Evidence
  1. Diagram
    Observation

    The speaker circles corresponding rows of A and N with a green pen and uses arrows to indicate the direction of row movement

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Objects
  1. Three rows of matrix A

  2. Three rows of matrix N

  3. Green circles

  4. Arrows

Changes
  1. The first row of A is circled and connected to the second row of N

  2. The second row of A is circled and connected to the third row of N

  3. The third row of A is circled and connected to the first row of N

Invariants
  1. The matrix elements themselves remain unchanged

  2. The internal order of the rows remains unchanged

Interpretation

Visually presents that N is obtained from A via cyclic row permutation, helping to understand the relationship between the two matrices.

Writing the Inverse Matrix Definition Equation

Clear evidence
Supplementary explanation
Evidence
  1. Diagram
    Observation

    The source gives A and its inverse K and uses the identity criterion; editorial notation is AK=KA=I₃ with explicit row and column orientation.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Objects
  1. Matrix A−1A^{-1}

  2. Matrix A

  3. Equals sign

  4. Identity matrix I

Changes
  1. Writes out the structure of A−1A^{-1}A=IA = I

Invariants
  1. The elements of A and A−1A^{-1} remain unchanged

Interpretation

Emphasizes the definition of the inverse matrix: the product of the two matrices is the identity matrix, laying the foundation for subsequent derivation.

Colors and Arrows Display Row-Column Correspondence

Clear evidence
Supplementary explanation
Evidence
  1. Diagram
    Observation

    The screen uses green, pink, and cyan to mark rows and columns in the original and inverse matrices respectively, connecting corresponding positions with arrows.

  2. Animation
    Observation

    As the speaker explains, circles and arrows appear gradually, first marking [a b c][a\ b\ c] and [a′d′g′]\begin{bmatrix} a'\\ d'\\ g' \end{bmatrix}, then marking other pairings.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Objects
  1. Original matrix AA

  2. Inverse matrix A−1A^{-1}

  3. Matrix to be found [ghiabcdef]\begin{bmatrix} g&h&i\\ a&b&c\\ d&e&f \end{bmatrix}

  4. Options (1) to (5)

Changes
  1. First circle the first row of the original matrix and the first column of the inverse matrix

  2. Then shift focus to the second row [a b c][a\ b\ c] of the matrix to be found

  3. Next use an arrow to connect it to the middle column of option (5)

  4. Finally supplement the other two sets of row-column correspondences

Invariants
  1. The matrix element symbols themselves remain unchanged

  2. What changes is the arrangement position of rows and columns

  3. The criterion remains that the product must equal the identity matrix

Interpretation

The visual focus is on transforming abstract matrix multiplication into visible "which row pairs with which column," making the correspondence between row swaps and column swaps clear at a glance.

Misconceptions · 3

Misconception that Hard Calculation is Required

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Misconception

Seeing a inverse matrix problem, the intuition is to use the adjugate matrix or Gaussian elimination to calculate it explicitly.

Clarification

This problem utilizes the structural characteristics of row permutations. One only needs to analyze the permutation relationship between the matrices, without performing complex inverse matrix calculations.

Misconception that Same Elements Imply Inverse Matrix

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

  2. Diagram
    Observation

    Multiple options contain identical symbols, but only the option with correct column positions passes the verification.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Misconception

Seeing the same symbols like a′,b′,c′,…a',b',c',\dots in the candidate matrix and assuming it must be the inverse matrix.

Clarification

The key to an inverse matrix is not having the same set of elements, but whether multiplying it with the original matrix yields the identity matrix; therefore, the correspondence positions of rows and columns must be checked.

Ignoring That Columns Must Move When Rows Move

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Misconception

After the rows of the original matrix are rearranged, still using the original column order of the inverse matrix for pairing.

Clarification

Once the row positions of the left matrix change, the corresponding column positions of the right matrix must also change, otherwise the product will not be the identity matrix.

Concept relations · 4

Definition of Inverse Matrix → Derivation of the Inverse of N

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Proof dependency
Explanation

When deriving the inverse of N, the core basis is the definition of the inverse matrix A−1A^{-1}A=IA=I, and the derived multiplicative property (PA)−1(PA)^{-1}=A−1P−1A^{-1}P^{-1}.

Row Permutation of Matrices → Derivation of the Inverse of N

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Application
Explanation

The concept of row permutation is applied to express N as PA, and then the properties of inverse matrices are used to find N−1N^{-1}.

Product of Inverse and Original Matrix Yields Identity Matrix → "Row-Column Pairing" Rule for Matrix Multiplication

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Application
Explanation

A matrix multiplied by its inverse gives the identity. Row-column inner products implement that criterion for checking a candidate inverse.

"Row-Column Pairing" Rule for Matrix Multiplication → Row Swap in Original Matrix Corresponds to Column Swap in Inverse Matrix

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Generalizes
Explanation

From single row-column pairing checks, generalize to a more common problem-solving rule: when rows of the left matrix are swapped, columns of the right matrix must be swapped.

Find an answer · 5

Given the inverse of one matrix, how to quickly find the inverse of another matrix obtained by row permutation?

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Knowledge points
  1. Definition of Inverse Matrix
  2. Row Permutation of Matrices
  3. Derivation of the Inverse of N
  4. Matrix inverse row-rearrangement exercise (101, question4)

Why does this inverse matrix problem not require actual calculation?

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Knowledge points
  1. Misconception that Hard Calculation is Required
  2. Row Permutation of Matrices

Why does swapping rows in the original matrix require swapping columns in the inverse matrix?

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Knowledge points
  1. Product of Inverse and Original Matrix Yields Identity Matrix
  2. "Row-Column Pairing" Rule for Matrix Multiplication
  3. Row Swap in Original Matrix Corresponds to Column Swap in Inverse Matrix

How to quickly verify if a matrix is the inverse of another using "row-column pairing"?

Clear evidence
Supplementary explanation
Evidence
  1. Formula
    Observation

    Editorial notation writes the source identity criterion as NC=I₃ when checking candidate C.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Knowledge points
  1. Product of Inverse and Original Matrix Yields Identity Matrix
  2. "Row-Column Pairing" Rule for Matrix Multiplication

Why is the answer to this problem option (5)?

Clear evidence
Supplementary explanation
Evidence
  1. Audio
    Observation

    The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.

Uncertainties
  1. Editorial checks use actual final option5, the given matrices and independent permutation multiplication. Early model option3 and column transcription errors are corrected without attributing an author error.

Knowledge points
  1. Deducing Option (5) from Row Position Change
  2. Re-verifying Option (5) Using Remaining Row-Column Pairings
  3. Finding the Inverse After Row Rearrangement
Coverage and review notes

Covered · The given matrix, its inverse and the row-rearrangement problem.

Covered · Observe the new matrix row order3,1,2.

Covered · Use the inverse and identity criterion, leading into the later pairings.

Covered · Use the inverse and identity criterion, leading into the later pairings.

Covered · Check actual option5 by row and column positions, retaining the complete identity relationship.

Covered · Check actual option5 by row and column positions, retaining the complete identity relationship.

Covered · Check actual option5 by row and column positions, retaining the complete identity relationship.

Explore the knowledge in this video

Open video knowledge graph →

  • Matrices ExplanationAt 0:40
    Why this connection?

    The source gives A and K=AK=A⁻¹. Editorial names N and C denote the rearranged matrix and its inverse.

Questions this video answers

Find a method

↗
Understand why

↗
Understand why

↗
Find a method

↗
Meet the concept

↗