Matrix congruence Created 2026-10-06 Updated 2026-10-14
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.
Matrix of a bilinear form 2026-10-14
Choose an ordered basis of a finite-dimensional vector space. The matrix of a bilinear form records all pairings of basis vectors, with . Writing and , separate linearity giveswhere the last expression uses the coordinate vectors of . Conversely, every matrix defines a bilinear form by this formula.[ref]
For a concrete bilinear form on , takeThen but : a bilinear form need not be a symmetric bilinear form. For and , first compute , then . Reversing the inputs gives and .
Under change of basis, let the columns of an invertible matrix be the new basis vectors in old coordinates. Thus and , soThis is matrix congruence, rather than the matrix similarity for an endomorphism. Both inputs have changed coordinates, which explains the two factors of . For the displayed and , direct multiplication gives ; its entry is .[ref]
Past exam of the mathematics course of the University of Cambridge 2001 ib Paper 3 9B Solution Created 2026-09-24 Updated 2026-10-14
Use completing the square in the Hermitian form , rather than unitary diagonalization of a normal matrix. The first pivot is one, soA second square completion givesTherefore one answer isThe diagonal entries of are rational, , and the displayed identity for every proves .
If were a unitary matrix, this matrix congruence would also be a similarity transformation, so the diagonal entries of would be the eigenvalues of . Its characteristic polynomial isThus its eigenvalues are , two of which are irrational. A unitary factor cannot give a rational diagonal here. Alternatively, the permitted rational root theorem implies that three rational eigenvalues would all be integers, whereas the quadratic factor has no integer roots.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 16 1 1 Solution Created 2026-10-03 Updated 2026-10-14
The three handle attachments give : there are no one-handles or three-handles. Use the capped core disks of handles as the homology basis, ordered by the framing labels . The surgery linking matrix gives the intersection form. Orient the three components so that the outer components have linking number and the middle component has linking number with each outer component. There are six crossings between the outer components, and two crossings between the middle component and each outer component; counting their signs gives these linking numbers. Reversing a component changes the corresponding row and column signs and does not change the invariants.
Thus the intersection form isAn exact matrix congruence diagonalizes this intersection form toConsequently its signature is , and .
The long exact sequence in relative homology and Poincare-Lefschetz duality identifywith the intersection form matrix, and identify with its cokernel, since . The Smith normal form has first invariant factor , because the entries have greatest common divisor , and second invariant factor , because the upper-left two-by-two matrix minor has determinant . The last invariant factor is . Hence
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 16 7 Solution Created 2026-10-03 Updated 2026-10-07
Orient as the boundary of . Push the interior of an oriented Seifert surface slightly into , and let be the double branched covering of over this pushed-in surface. Its boundary is the two-fold branched cover of a knot. Define the knot signature byThe signature of a possibly degenerate intersection form means the number of positive eigenvalues minus the number of negative eigenvalues; its radical contributes zero.
Here is why the definition is independent of . Given two choices , glue their branched covers along the common boundary to obtainThis is the double branched covering of over the closed oriented surface obtained by gluing the pushed-in to . Every closed oriented surface in admits a Seifert hypersurface: its complement has an integral meridional class, represent it by a map to the circle, and take a regular value. Near the surface choose the angular map in its trivial normal disk bundle. The closure of a suitable regular fiber is a compact oriented three-manifold bounding the surface. Its trivial normal framing can be chosen to match this construction.
Push the interior of this Seifert hypersurface into . The double branched covering of over the resulting properly embedded three-manifold has boundary . The existence of the cover follows from the meridian homomorphism to ; smoothness near the branch set is the local map . By the hypothesis about boundaries of five-manifolds, . Novikov additivity for gluing along an entire closed three-dimensional boundary givesThus the knot signature is independent of the Seifert surface. An isotopy of the knot carries the construction to an equivalent one, so it is also a knot invariant.
To calculate its intersection form, express as a disk with bands. The double branched covering of over the pushed-in disk is again . Each band lifts to a two-handle. The capped lifted cores give a basis of corresponding to the band-core basis of . The framing of the th lifted attaching circle is . For distinct bands, the two sheets contribute the two push-off linkings and , so the mutual linking number is . HenceA different integral basis changes this matrix by matrix congruence and leaves its signature unchanged.
In Figure 7 the upper knot is a connected sum of knots , while the lower one is , where is the positive trefoil knot. Both knot groups have the same presentationTo see this, the Seifert-van Kampen theorem expresses the knot group of a connected sum of knots as the amalgamated free product of the two summand knot groups, amalgamating their meridians of a knot. A trefoil knot has presentation with a meridian. Reflection gives the same abstract group for the mirror. If it reverses the chosen meridian, send both generators to their inverses; the inverse braid relation is again the same relation. Thus the meridian amalgamation yields the displayed group presentation in both cases.
A band basis for the positive trefoil knot giveswhose symmetrization is negative definite. Therefore and . Boundary-connected-summing Seifert surfaces makes the Seifert matrix block diagonal, so the knot signature is additive under connected sum of knots. ConsequentlyThe upper knot and lower knot are therefore not isotopic, even though their knot groups are isomorphic. With the opposite global knot signature convention the first value is , and the distinction is unchanged.
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 4 1E Solution Created 2026-09-24 Updated 2026-10-07
A quadratic form on a finite-dimensional real vector space is a function for a symmetric bilinear form . Conversely recovers that bilinear form. Two quadratic forms are congruent if a linear isomorphism satisfies ; in coordinates this is matrix congruence, , with invertible.
Sylvester's law of inertia says that a real quadratic form admits coordinates in whichand the numbers of positive, negative and zero squares, , are independent of the coordinates. Here ; and are the maximal dimensions of subspaces on which the quadratic form is positive definite and negative definite, while is the dimension of its radical of a bilinear form. These numbers are the inertia of a bilinear form. The rank of a quadratic form is , and the signature of a quadratic form, in the signed-difference convention, is .
Completing squares givesThe change of coordinates is invertible, so the inertia is and the signature is . If signature is recorded as an ordered pair instead, that pair is .
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 1F Solution Created 2026-09-24 Updated 2026-10-06
Use completing the square rather than computing the eigenvalues of the symmetric matrix. Successively removing the mixed terms givesThus one suitable invertible linear change of coordinates isThe coordinate matrix is upper triangular with determinant one, so the change is an invertible linear map. Its inverse is , , . Hence the diagonal coefficients can be taken as . This is a matrix congruence of a quadratic form; an orthogonal transformation was not required.
Past exam of the mathematics course of the year 1 of the natural sciences course of the University of Cambridge 2005 Paper 1 2 c Solution Created 2026-10-18 Updated 2026-10-20
True. Set . Exchange , interchange the dummy indices , and use :Thus the matrix congruence preserves symmetry, even when is singular.
Use Einstein notation, with repeated suffixes summed. The matrix multiplication and transpose giveInterchange the free indices, then relabel the dummy indices :The negative sign uses . Therefore is skew-symmetric. No orthogonality of is needed for this part: matrix congruence preserves skew-symmetry.
Similarity and the coordinate metric 2026-10-14
For real matrices, orthogonal similarity is the special case with an orthogonal matrix. Then a symmetric matrix remains symmetric, because . The expression describes the reverse conversion and has the same property. An orthonormal basis retains the ordinary dot product formula for its coordinate vectors.
An arbitrary change of basis need not preserve entrywise symmetry. In the opening example, is a symmetric matrix but is not. The geometric inner product has not disappeared: in the new coordinates it is represented by the Gram matrixFor with new coordinate vector , the squared Euclidean norm is , agreeing with . The naive coordinate sum would use the wrong inner product.
If , direct multiplication givesThis is self-adjointness expressed in the new inner product, rather than entrywise symmetry relative to the identity matrix. For the example, both products equal . Thus arbitrary matrix similarity preserves the linear operator, while its geometric interpretation requires transforming the Gram matrix as well. Matrix congruence supplies the corresponding rule for a bilinear form and should be distinguished from matrix similarity.
Special linear congruence action on symmetric matrices Created 2026-10-06 Updated 2026-10-07
The special linear group acts on determinant-one real symmetric matrices by matrix congruence. Symmetry and determinant are preserved, and signatures are preserved by Sylvester's law of inertia. The determinant-one set is a regular level set of dimension , with tangent directions satisfying . Its infinitesimal left-action fields are ; converting them to a Lie algebra representation requires the infinitesimal left-action sign convention.
Symmetric bilinear form Created 2026-10-03 Updated 2026-10-14
A bilinear form is symmetric when for every pair of vectors . Equivalently, its matrix of a bilinear form in any basis is a symmetric matrix, since . Symmetry makes the relation reciprocal, giving the bilinear orthogonal complement a geometric interpretation.
Over the real numbers, set . The polarization identityrecovers the symmetric bilinear form from its quadratic form: expand and use symmetry to combine the two cross terms. For , take and . Then , , and , so . The same formula works whenever the characteristic is not two.[ref]
https://www.ma.imperial.ac.uk/~anskor/LINEAR.PDF. Skorobogatov, Linear Algebra and Matrices, p. 12: recovering a symmetric form from the diagonal
Three real diagonal matrices show how much variety symmetry allows. The identity matrix gives the positive-definite bilinear form . The matrix gives and is nondegenerate despite the isotropic vector . The matrix gives and is a degenerate bilinear form with radical of a bilinear form . Their level sets make the distinction visible: a circle, two branches of a hyperbola, and two parallel lines for .
Unit and zero level sets distinguish positive, indefinite nondegenerate, and degenerate symmetric forms
. Details. The inertia of a bilinear form records the numbers of positive, negative, and zero directions after matrix congruence diagonalization. By Sylvester's law of inertia, these counts survive change of basis; the three examples have inertia of a bilinear form , , and . Historically, Sylvester stated this invariance in an 1852 paper on reducing real quadratic forms to sums of positive and negative squares. Ghys and Ranicki reproduce his statement and distinguish it from his subsequent 1853 proof.[ref]
https://arxiv.org/pdf/1512.09258. Étienne Ghys and Andrew Ranicki, Signatures in algebra, topology and dynamics, §1.2: Sylvester's statement and proof
Symmetric positive-definite preconditioning 2026-10-18
Let and be real symmetric positive-definite matrices. The principal square root of a positive semidefinite matrix construction gives an invertible matrix for each. SetThen is equivalent to . This is a matrix congruence, and is a symmetric positive-definite matrix: , and for every nonzero vector ,since . This short proof establishes both requirements for applying the Conjugate gradient method to the transformed linear system.
The left transformed matrix has the same eigenvalues becauseIts correct geometry uses the weighted inner product : . Thus it is symmetric in this inner product, even when it is not a symmetric matrix in ordinary coordinates. The spectral condition number governing the transformed symmetric problem is , not generally .
The Preconditioned conjugate gradient method realizes this transformation using auxiliary solves , without constructing or its matrix inverse. With fixed , initialize and ; while , usethen solve and setStop at a zero linear-system residual before forming another ratio. Positive definiteness makes the denominators positive before termination.[ref]
Notes for Ma221 Lecture 15, Dec 1, 2023. Math 221, Matrix Computations, Fall 2023; Notes for Ma221 Lecture 15, Dec 1, 2023; PDF p. 1, equivalent symmetric system and Preconditioned CG algorithm
An invertible matrix alone is insufficient: with and , the left transformed matrix has eigenvalues , and has no real symmetric positive-definite matrix square root. Even a valid symmetric positive-definite matrix can worsen conditioning if its scaling is unsuitable, as the next worked example shows.

