Namespaces
Variants
Actions

Difference between revisions of "Symmetric matrix"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(TeX)
 
Line 1: Line 1:
A square matrix in which any two elements symmetrically positioned with respect to the main diagonal are equal to each other, that is, a matrix <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916801.png" /> that is equal to its transpose:
+
{{TEX|done}}
 +
A square matrix in which any two elements symmetrically positioned with respect to the main diagonal are equal to each other, that is, a matrix $A=\|a_{ik}\|_1^n$ that is equal to its transpose:
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916802.png" /></td> </tr></table>
+
$$a_{ik}=a_{ki},\quad i,k=1,\dots,n.$$
  
A real symmetric matrix of order <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916803.png" /> has exactly <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916804.png" /> real eigenvalues (counted with multiplicity). If <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916805.png" /> is a symmetric matrix, then so are <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916806.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916807.png" />, and if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916808.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s0916809.png" /> are symmetric matrices of the same order, then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168010.png" /> is a symmetric matrix, while <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168011.png" /> is symmetric if and only if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168012.png" />.
+
A real symmetric matrix of order $n$ has exactly $n$ real eigenvalues (counted with multiplicity). If $A$ is a symmetric matrix, then so are $A^{-1}$ and $A^p$, and if $A$ and $B$ are symmetric matrices of the same order, then $A+B$ is a symmetric matrix, while $AB$ is symmetric if and only if $AB=BA$.
  
  
  
 
====Comments====
 
====Comments====
Every square complex matrix is similar to a symmetric matrix. A real <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168013.png" />-matrix is symmetric if and only if the associated operator <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168014.png" /> (with respect to the standard basis) is self-adjoint (with respect to the standard inner product). A [[Polar decomposition|polar decomposition]] factors a matrix <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168015.png" /> into a product <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168016.png" /> of a symmetric and an orthogonal matrix.
+
Every square complex matrix is similar to a symmetric matrix. A real $(n\times n)$-matrix is symmetric if and only if the associated operator $\mathbf R^n\to\mathbf R^n$ (with respect to the standard basis) is self-adjoint (with respect to the standard inner product). A [[Polar decomposition|polar decomposition]] factors a matrix $A$ into a product $SQ$ of a symmetric and an orthogonal matrix.
  
Let <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168017.png" /> be a bilinear form on a vector space <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168018.png" /> (cf. [[Bilinear mapping|Bilinear mapping]]). Then the matrix of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168019.png" /> (with respect to the same basis in the two factors <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168020.png" />) is symmetric if and only if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168021.png" /> is a symmetric bilinear form, i.e. <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091680/s09168022.png" />.
+
Let $B\colon V\times V\to k$ be a bilinear form on a vector space $V$ (cf. [[Bilinear mapping|Bilinear mapping]]). Then the matrix of $B$ (with respect to the same basis in the two factors $V$) is symmetric if and only if $B$ is a symmetric bilinear form, i.e. $B(u,v)=B(v,u)$.
  
 
====References====
 
====References====
 
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  F.R. [F.R. Gantmakher] Gantmacher,  "The theory of matrices" , '''1''' , Chelsea, reprint  (1959–1960)  pp. Vol. 1, Chapt. IX; Vol. 2, Chapt. XI  (Translated from Russian)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  W. Noll,  "Finite dimensional spaces" , M. Nijhoff  (1987)  pp. Sect. 2.7</TD></TR></table>
 
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  F.R. [F.R. Gantmakher] Gantmacher,  "The theory of matrices" , '''1''' , Chelsea, reprint  (1959–1960)  pp. Vol. 1, Chapt. IX; Vol. 2, Chapt. XI  (Translated from Russian)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  W. Noll,  "Finite dimensional spaces" , M. Nijhoff  (1987)  pp. Sect. 2.7</TD></TR></table>

Latest revision as of 22:15, 30 November 2018

A square matrix in which any two elements symmetrically positioned with respect to the main diagonal are equal to each other, that is, a matrix $A=\|a_{ik}\|_1^n$ that is equal to its transpose:

$$a_{ik}=a_{ki},\quad i,k=1,\dots,n.$$

A real symmetric matrix of order $n$ has exactly $n$ real eigenvalues (counted with multiplicity). If $A$ is a symmetric matrix, then so are $A^{-1}$ and $A^p$, and if $A$ and $B$ are symmetric matrices of the same order, then $A+B$ is a symmetric matrix, while $AB$ is symmetric if and only if $AB=BA$.


Comments

Every square complex matrix is similar to a symmetric matrix. A real $(n\times n)$-matrix is symmetric if and only if the associated operator $\mathbf R^n\to\mathbf R^n$ (with respect to the standard basis) is self-adjoint (with respect to the standard inner product). A polar decomposition factors a matrix $A$ into a product $SQ$ of a symmetric and an orthogonal matrix.

Let $B\colon V\times V\to k$ be a bilinear form on a vector space $V$ (cf. Bilinear mapping). Then the matrix of $B$ (with respect to the same basis in the two factors $V$) is symmetric if and only if $B$ is a symmetric bilinear form, i.e. $B(u,v)=B(v,u)$.

References

[a1] F.R. [F.R. Gantmakher] Gantmacher, "The theory of matrices" , 1 , Chelsea, reprint (1959–1960) pp. Vol. 1, Chapt. IX; Vol. 2, Chapt. XI (Translated from Russian)
[a2] W. Noll, "Finite dimensional spaces" , M. Nijhoff (1987) pp. Sect. 2.7
How to Cite This Entry:
Symmetric matrix. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Symmetric_matrix&oldid=16470
This article was adapted from an original article by T.S. Pigolkina (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article