Metraipolis › archive › dc_07dbe5bd5938

Singular matrix — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Singular_matrix
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T19:43:52.344Z
SHA-256 of the archived text
f61de6bd36b822d8d2e8b6c51a681243ddda62e0f5132d691e92aea2becc919b
Stable URL of this page
https://metraipolis.com/documento/dc_07dbe5bd5938

How to cite

Singular matrix — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Singular_matrix (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_07dbe5bd5938 (Metraipolis archive dc_07dbe5bd5938, sha256 f61de6bd36b822d8d2e8b6c51a681243ddda62e0f5132d691e92aea2becc919b)
BibTeX
@misc{dc07dbe5bd5938,
  title = {Singular matrix — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Singular_matrix},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_07dbe5bd5938; sha256 f61de6bd36b822d8d2e8b6c51a681243ddda62e0f5132d691e92aea2becc919b},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Singular_matrix. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A singular matrix is a square matrix that is not invertible, unlike non-singular matrices which are invertible. Equivalently, an n {\displaystyle n} -by- n {\displaystyle n} matrix A {\displaystyle A} is singular if and only if its determinant, det ( A ) = 0 {\displaystyle \det(A)=0} . In classical linear algebra, a matrix is called non-singular (or invertible) when it has an inverse; by definition, a matrix that fails this criterion is singular. In more algebraic terms, an n {\displaystyle n} -by- n {\displaystyle n} matrix A is singular exactly when its columns (and rows) are linearly dependent, so that the linear map x ↦ A x {\displaystyle x\mapsto Ax} is not one-to-one. In this case the kernel (null space) of A is non-trivial (has dimension ≥1), and the homogeneous system A x = 0 {\displaystyle Ax=0} admits non-zero solutions. These characterizations follow from standard rank-nullity and invertibility theorems: for a square matrix A, det ( A ) ≠ 0 {\displaystyle \det(A)\neq 0} if and only if rank ( A ) = n {\displaystyle \operatorname {rank} (A)=n} , and det ( A ) = 0 {\displaystyle \det(A)=0} if and only if rank ( A ) < n {\displaystyle \operatorname {rank} (A)<n} .

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Linear algebra»).
Fonte: Wikipedia in inglese, voce «Singular matrix» — https://en.wikipedia.org/wiki/Singular_matrix
Wikidata Q1970975 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1970975
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Singular_matrix?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1372131238, consultata il 2026-10-07T19:04:52.680Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 573d563a4ca2e3973138c9bb6313a185cb64f67c73cb07873a50189c0a2b10dc