Two square matrices are congruent when for an invertible matrix . This is the transformation of the matrix of a bilinear form under change of basis, and also transforms a quadratic form under an invertible linear map on its coordinates. The matrices need not be symmetric. It differs from matrix similarity, which uses for a linear operator. For real symmetric matrices, completing the square diagonalizes the corresponding quadratic form by matrix congruence.
If is real symmetric positive definite and is real symmetric, let . The matrix is symmetric and has an orthonormal eigenbasis, represented by . Taking gives the two displayed congruences. The diagonal entries are determined by the generalized eigenvalue problem , since is diagonal with entries . Positive definiteness of the first form is essential to this construction.

Articles by others on the same topic (1)

Matrix congruence is a concept in linear algebra that relates to two matrices being similar in a specific way through the use of a non-singular matrix. Specifically, two square matrices \( A \) and \( B \) are said to be congruent if there exists a non-singular matrix \( P \) such that: \[ A = P^T B P \] Here, \( P^T \) denotes the transpose of the matrix \( P \).