Difference between revisions of "Invertible matrix"

From Conservapedia
Jump to navigation Jump to search
(inverse)
(→‎top: Category)
 
(3 intermediate revisions by 3 users not shown)
Line 3: Line 3:
 
:''AB'' = ''BA'' = I (I: [[identity matrix]])
 
:''AB'' = ''BA'' = I (I: [[identity matrix]])
  
−
A matrix is invertible if and only if it has a nonzero determinant.  Only square matrices (''n'' x ''n'') are invertible.
+
A matrix is invertible if and only if it has a nonzero [[determinant]].  Only square matrices (''n'' x ''n'') are invertible.
  
 
It can be shown that, for any invertible matrix ''A'', there is only one matrix ''B'' such that ''AB'' = I; this unique matrix is called the [[inverse matrix]] of ''A'', and represented as ''A<sup>-1</sup>''.
 
It can be shown that, for any invertible matrix ''A'', there is only one matrix ''B'' such that ''AB'' = I; this unique matrix is called the [[inverse matrix]] of ''A'', and represented as ''A<sup>-1</sup>''.
  
−
[[Category:linear algebra]]
+
There are five conditions that are equivalent to a matrix ''A'' being invertible:
−
[[Category:mathematics]]
+
 
 +
# The determinant of ''A'' is not zero.
 +
# ''A'' is row equivalent to ''I''.
 +
# ''A''x = b has a unique solution, for all b.
 +
# ''A''x = 0 has only the trivial solution of x = 0.
 +
# ''A'' is row equivalent to an upper triangular matrix having non-zero diagonal entries.
 +
 
 +
[[Category:Linear Algebra]]
 +
[[Category:Mathematics]]

Latest revision as of 14:35, July 28, 2016

An invertible matrix A is one that has a corresponding matrix B such that:

AB = BA = I (I: identity matrix)

A matrix is invertible if and only if it has a nonzero determinant. Only square matrices (n x n) are invertible.

It can be shown that, for any invertible matrix A, there is only one matrix B such that AB = I; this unique matrix is called the inverse matrix of A, and represented as A-1.

There are five conditions that are equivalent to a matrix A being invertible:

  1. The determinant of A is not zero.
  2. A is row equivalent to I.
  3. Ax = b has a unique solution, for all b.
  4. Ax = 0 has only the trivial solution of x = 0.
  5. A is row equivalent to an upper triangular matrix having non-zero diagonal entries.