Misplaced Pages

Matrix congruence

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Congruent matrices)

In mathematics, two square matrices A and B over a field are called congruent if there exists an invertible matrix P over the same field such that

PAP = B

where "T" denotes the matrix transpose. Matrix congruence is an equivalence relation.

Matrix congruence arises when considering the effect of change of basis on the Gram matrix attached to a bilinear form or quadratic form on a finite-dimensional vector space: two matrices are congruent if and only if they represent the same bilinear form with respect to different bases.

Note that Halmos defines congruence in terms of conjugate transpose (with respect to a complex inner product space) rather than transpose, but this definition has not been adopted by most other authors.

Congruence over the reals

Sylvester's law of inertia states that two congruent symmetric matrices with real entries have the same numbers of positive, negative, and zero eigenvalues. That is, the number of eigenvalues of each sign is an invariant of the associated quadratic form.

See also

References

  1. Halmos, Paul R. (1958). Finite dimensional vector spaces. van Nostrand. p. 134.
  2. Sylvester, J J (1852). "A demonstration of the theorem that every homogeneous quadratic polynomial is reducible by real orthogonal substitutions to the form of a sum of positive and negative squares" (PDF). Philosophical Magazine. IV: 138–142. Retrieved 2007-12-30.
Matrix classes
Explicitly constrained entries
Constant
Conditions on eigenvalues or eigenvectors
Satisfying conditions on products or inverses
With specific applications
Used in statistics
Used in graph theory
Used in science and engineering
Related terms
Categories: