Suppose that to reduce a matrix A to row echelon form are necessary n elementary operations E1,...,En. Suppose that En1,...,Enk are the permutation operations that are needed. How to prove that to reduce B=Enk⋯En1A to echelon form no row interchanges are needed?
(my linear algebra book says it, but doesn't demonstrate)
Thanks.
No comments:
Post a Comment