Matrices
The source gives A and ⁻¹. Editorial names N and C denote the rearranged matrix and its inverse.
均一教育平台 Junyi Academy · YouTube · 2:04
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.
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.
The source gives A and ⁻¹. Editorial names N and C denote the rearranged matrix and its inverse.
N uses the rows of A in order3,1,2; P is a permutation matrix, not a single elementary row swap.
For invertible square factors, reverse their order when inverting.
K right-multiplied by P⁻¹ has old columns3,1,2 in that order.
Exploit the given inverse and positional relation rather than calculating an adjugate.
Verify the whole identity product, including zero off-diagonal entries.
One product entry is a row-column inner product.
The original first row moves to row two; its inverse column moves to column two.
The actual final source selects option5 with this column ordering; all entries agree with KP⁻¹.
Having the same symbols is insufficient: row and column positions determine the identity product.
For N=PA, the inverse is KP⁻¹. The specified factor side is essential.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The screen displays the matrix [a b c; d e f; g h i]
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.
A
square matrix with elements a,b,c,d,e,f,g,h,i, whose inverse is known
square matrix
The screen displays the matrix [g h i; a b c; d e f]
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.
N
Editorial N uses rows3,1,2 of A to form a new3×3 matrix.
square matrix
The screen displays [a' b' c'; d' e' f'; g' h' i'], and the audio explains that this is the inverse of A
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.
The inverse matrix of A, with elements denoted by primed variables a',b',c',d',e',f',g',h',i'
square matrix
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
I
Identity matrix, the result of multiplying a matrix by its inverse in the definition
square matrix
The screen shows the matrix , referred to as the "known matrix".
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.
A
The original matrix with elements .
matrix
The screen shows and states it is the inverse of .
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.
K
The inverse matrix of , with elements .
matrix
The right side of the screen displays .
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
The 3rd-order identity matrix.
matrix
The first row of the original matrix is , marked in green on the screen.
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.
[a\ b\ c]
The first row of matrix .
Matrix row vector
The second row of the original matrix is , marked in pink on the screen.
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.
[d\ e\ f]
The second row of matrix .
Matrix row vector
The third row of the original matrix is , marked in cyan on the screen.
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.
[g\ h\ i]
The third row of matrix .
Matrix row vector
The first column of the inverse matrix is .
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.
The first column of matrix .
Matrix column vector
The second column of the inverse matrix is .
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.
The second column of matrix .
Matrix column vector
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
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.
The given ⁻¹ satisfies AK=KA=I₃. The source uses row-column pairing for the new inverse; editorial names avoid conflicting segment labels.
A is an invertible square matrix
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
In the video, the speaker circles corresponding rows of A and N in green
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.
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.
The screen states "The inverse of the known matrix is ", and the right side shows .
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
The given ⁻¹ satisfies AK=KA=I₃. The source uses row-column pairing for the new inverse; editorial names avoid conflicting segment labels.
A and K are both3×3 matrices with ⁻¹
Editorial notation uses AK=I₃ for the given inverse relationship.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
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.
At position(r,c), pair row r of N with column c of candidate C and compare with the corresponding identity entry.
Applicable to element-wise verification of matrix multiplication
In this problem,
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
In the screen, the column order of option (5) changes relative to the original inverse matrix, while the row order of the original matrix is also rearranged.
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.
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.
For N=PA, C=KP⁻¹; P is a row permutation matrix and ⁻¹.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
The screen shows the rows of A and N circled to indicate correspondence, and writes out the structure of
P and the full product notation are editorial. The model prematurely read option3; the actual final source selects5.
Compare the given row ordering.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
P reorders rows3,1,2.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
Reverse the invertible factors; retain the right-side permutation.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
Direct multiplication gives both identity products for P and its transpose.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
Right multiplication places the old columns3,1,2 in the new result.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
The actual complete source option is5.
Editorial permutation verification from the given A,K and actual final option5; the full P formulas are not attributed to the source.
The new inverse uses columns3,1,2 of K, giving option5.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
Editorial positional reading pairs the second row of N, [a b c], with the second column [a′ d′ g′]ᵀ of actual option5.
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.
The left matrix in the problem has undergone row rearrangement relative to the original ; the original first row is now the second row.
The screen directly shows the difference in row order between the problem matrix and the original matrix.
Row two of N pairs with column two of C, whose complete entries are a′,d′,g′.
The first diagonal pairing in AK moves to the second diagonal position.
Originally, in pairs with ; after the row moves to position2, this column also moves to position2.
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.
The middle column of option (5) is exactly , which meets the above requirement.
All nine actual final option5 entries agree with the editorial KP⁻¹ computation.
Therefore, the answer to this problem should be (5).
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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′.
Model transcription confused row positions; editorial correction uses the actual problem and final matrix, without alleging an author spoken error.
Row3 of N pairs with column3 of C, inheriting the corresponding diagonal entry of AK.
AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.
Row1 of N pairs with column1 of C, inheriting the corresponding diagonal entry of AK.
AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.
Row2 of N pairs with column2 of C, inheriting the corresponding diagonal entry of AK.
AK=I₃; the reordering preserves these diagonal pairings and makes the other pairings zero.
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.
The screen displays the complete problem: Given the inverse of A is , find the inverse of N, listing five options
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
Given square matrix A = [a b c; d e f; g h i] and its inverse = [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]?
=
Find the inverse matrix
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.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
Represent the row permutation as left-multiplication by an permutation matrix P.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
Expand using the multiplicative property of inverse matrices.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
Right multiplication by P⁻¹ reorders columns of K as3,1,2, not its rows.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
This is actual option5; the early model option3 is not the complete source conclusion.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
Option5: .
Editorial checks give NC=PAKP⁻¹=I₃ and CN=KP⁻¹PA=I₃, verifying every entry rather than only three diagonal1 entries.
The screen fully presents the problem: Given that the inverse of is , ask for the inverse of , listing five options (1) to (5).
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
Given that the inverse of is , find the inverse of .
The matrix to be found is
Actual option5 is
Select the correct inverse matrix from the five candidates.
First use the known inverse matrix to determine the original row-column pairing relationships.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
The first row of the original matrix corresponds to the first column in the original inverse matrix.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
The matrix to be found is obtained by rearranging the rows of the original matrix.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
To maintain the same row-column pairing, the inverse matrix must also rearrange its columns accordingly; option (5) meets this requirement.
Check factor sides and the full identity relationship from the source row ordering and actual option5.
Option5: .
Editorial checks give NC=PAKP⁻¹=I₃ and CN=KP⁻¹PA=I₃, verifying every entry rather than only three diagonal1 entries.
The speaker circles corresponding rows of A and N with a green pen and uses arrows to indicate the direction of row movement
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.
Three rows of matrix A
Three rows of matrix N
Green circles
Arrows
The first row of A is circled and connected to the second row of N
The second row of A is circled and connected to the third row of N
The third row of A is circled and connected to the first row of N
The matrix elements themselves remain unchanged
The internal order of the rows remains unchanged
Visually presents that N is obtained from A via cyclic row permutation, helping to understand the relationship between the two matrices.
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.
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.
Matrix
Matrix A
Equals sign
Identity matrix I
Writes out the structure of
The elements of A and remain unchanged
Emphasizes the definition of the inverse matrix: the product of the two matrices is the identity matrix, laying the foundation for subsequent derivation.
The screen uses green, pink, and cyan to mark rows and columns in the original and inverse matrices respectively, connecting corresponding positions with arrows.
As the speaker explains, circles and arrows appear gradually, first marking and , then marking other pairings.
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.
Original matrix
Inverse matrix
Matrix to be found
Options (1) to (5)
First circle the first row of the original matrix and the first column of the inverse matrix
Then shift focus to the second row of the matrix to be found
Next use an arrow to connect it to the middle column of option (5)
Finally supplement the other two sets of row-column correspondences
The matrix element symbols themselves remain unchanged
What changes is the arrangement position of rows and columns
The criterion remains that the product must equal the identity matrix
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
Seeing a inverse matrix problem, the intuition is to use the adjugate matrix or Gaussian elimination to calculate it explicitly.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
Multiple options contain identical symbols, but only the option with correct column positions passes the verification.
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.
Seeing the same symbols like in the candidate matrix and assuming it must be the inverse matrix.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
After the rows of the original matrix are rearranged, still using the original column order of the inverse matrix for pairing.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
When deriving the inverse of N, the core basis is the definition of the inverse matrix , and the derived multiplicative property =.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
The concept of row permutation is applied to express N as PA, and then the properties of inverse matrices are used to find .
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
A matrix multiplied by its inverse gives the identity. Row-column inner products implement that criterion for checking a candidate inverse.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
Editorial notation writes the source identity criterion as NC=I₃ when checking candidate C.
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.
The narration uses the original rows and corresponding inverse columns to identify the inverse after rearrangement.
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.
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.
To verify if a matrix is the inverse of another, check the inner product of each row of the first matrix with each column of the second matrix. The product of the -th row and -th column must equal 1 if (diagonal entries) and 0 if (off-diagonal entries).
Conditions: You are given two square matrices of the same dimension.; You need to verify if their product is the identity matrix.
Option (5) is the correct answer because it applies the exact column permutation required to offset the row permutation of the original matrix. The new matrix has its rows ordered as 3, 1, 2 relative to .
Conditions: The original matrix has inverse .; The new matrix is formed by permuting the rows of as 3, 1, 2.; The candidate matrices contain the elements of in various orders.
Swapping rows in the original matrix requires swapping the corresponding columns in the inverse matrix to maintain the identity matrix result after multiplication. Matrix multiplication relies on row-column pairing: the -th row of the left matrix pairs with the -th column of the right matrix to produce the entry of the product.
Conditions: The original matrix and its inverse satisfy the identity .; The rows of the original matrix are permuted to form a new matrix.; The goal is to find the inverse of the new matrix.
When the rows of a matrix are cyclically permuted, its inverse is found by applying the corresponding cyclic permutation to the columns of the original inverse matrix. This avoids complex calculations like Gaussian elimination or adjugate matrices.
Conditions: The original matrix is invertible.; The new matrix is formed by a cyclic permutation of the original matrix's rows.; The inverse of the original matrix is already known.
The cyclic row rearrangement where rows 3, 1, and 2 of the original matrix form the new matrix can be represented by left-multiplying the original matrix by a specific permutation matrix. This permutation matrix has a 1 in the , , and positions, and 0 elsewhere.
Conditions: The new matrix is formed by taking the 3rd, 1st, and 2nd rows of the original matrix in that order.; The permutation is applied via left-multiplication.