Prove factorization conditions, verify row-permutation receipts and reuse exact factors without confusing singularity, free variables or arithmetic cost with numerical stability.
Open any lesson. Completion records participation; automatic practice checks and human judgment of written arguments are separate. This unit retains its own versioned requirements.
Readiness and preparation
Check your starting point
Try these short questions on paper, then compare your reasoning. They are optional self-checks, not a placement score or a navigation requirement. Use a targeted review when useful and return with your browser’s Back control.
Why must a row operation also act on the right-hand side?
A factorization records equivalent equations; a permutation receipt PA=LU requires the correspondingly permuted request Pb.
Compare reasoning and find a refresher
The operation replaces entire equations, including their constants. Applying it only to coefficients generally changes the solution set.
Does an invertible matrix necessarily have a nonzero first pivot without a row swap?
Unpivoted factorization needs stronger intermediate conditions than invertibility of the whole matrix.
Compare reasoning and find a refresher
No. The matrix with rows (0,1),(1,0) has determinant −1 and is invertible, but its upper-left entry is zero. A row permutation makes a valid first pivot available.