Download Linear codes. Groups, fields and vector spaces

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Fundamental theorem of algebra wikipedia , lookup

Hilbert space wikipedia , lookup

Determinant wikipedia , lookup

Non-negative matrix factorization wikipedia , lookup

Cross product wikipedia , lookup

Jordan normal form wikipedia , lookup

System of linear equations wikipedia , lookup

Eigenvalues and eigenvectors wikipedia , lookup

Exterior algebra wikipedia , lookup

Tensor operator wikipedia , lookup

Cayley–Hamilton theorem wikipedia , lookup

Singular-value decomposition wikipedia , lookup

Laplace–Runge–Lenz vector wikipedia , lookup

Geometric algebra wikipedia , lookup

Matrix multiplication wikipedia , lookup

Euclidean vector wikipedia , lookup

Vector space wikipedia , lookup

Dual space wikipedia , lookup

Covariance and contravariance of vectors wikipedia , lookup

Matrix calculus wikipedia , lookup

Linear algebra wikipedia , lookup

Cartesian tensor wikipedia , lookup

Four-vector wikipedia , lookup

Bra–ket notation wikipedia , lookup

Basis (linear algebra) wikipedia , lookup

Transcript
Vector spaces - matrix row-eschelon form
Lemma
If M is any matrix, then M can by applying elementary operations 1,2,3,4
it can be transformed into a matrix M in row echelon form.
Proof (sketch)
Proceed iteratively in steps 1...k as follows:
Step i
• Perform row permutation (if such exists) that places in i-th position
row with a non-zero element in i-th column. Let it be row v. If there
are no appropriate permutation, perform first column permutation that
places non-zero column in i-th position.
• Add to each of other rows vector av, where a is chosen such that after
the addition the row has value 0 in i-th position.