Self-adjoint Matrices are Equivariant
Michael Dellnitz

TL;DR
This paper proves that self-adjoint matrices are exactly those matrices that are equivariant under a specific group action, and explores applications in approximating higher order derivatives of smooth functions.
Contribution
It establishes a novel characterization of self-adjoint matrices via group equivariance and discusses potential applications in differential approximation.
Findings
Self-adjoint matrices are equivariant under a specific group action.
The result links matrix symmetry to group theory.
Applications include approximating higher order derivatives.
Abstract
In this short note we prove that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group which is isomorphic to . Moreover we discuss potential applications of this result, and we use it in particular for the approximation of higher order derivatives for smooth real valued functions of several variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Quantum chaos and dynamical systems · Advanced Optimization Algorithms Research
Self-adjoint Matrices are Equivariant
Michael Dellnitz
Department of Mathematics, Paderborn University, D-33095 Paderborn, Germany
Abstract
In this short note we prove that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group which is isomorphic to . Moreover we discuss potential applications of this result, and we use it in particular for the approximation of higher order derivatives for smooth real valued functions of several variables.
Key words: self-adjoint matrix, equivariance, symmetry, Taylor expansion
AMS subject classifications. 15B57, 15A24, 37G40, 41A58
1 Introduction
Within this short note we prove a characterization for a matrix being symmetric – in the sense of – by using the notion of equivariance. The proof of this fact is not difficult at all, but to the best of the knowledge of the author so far the related result cannot explicitly be found in the literature.
However, in several articles concerning the development of dynamical systems for the solution of certain optimization problems this underlying equivariance structure is implicitly present (e.g. [1, 2, 3]), and one would expect that this is also the case in other applications. The point of this note is to state this characterization of explicitly, and this is done in Section 2. In Section 3 we discuss potential applications in equivariant bifurcation theory, and we illustrate concretely how this result can be used for the construction of simple approximations of derivatives of higher order for real valued functions.
2 Main Result
Let be the abelian group consisting of the matrices
[TABLE]
Obviously for any diagonal matrix
[TABLE]
we have
[TABLE]
In fact, it is easy to verify that for an arbitrary matrix one has
[TABLE]
In this note we prove the following characterization:
Proposition 2.1**.**
A matrix is self-adjoint (i.e. ) if and only if there is an orthogonal matrix such that
[TABLE]
where the group is defined by
[TABLE]
Proof.
Suppose that . Then there is such that
[TABLE]
is a diagonal matrix. By (1) we have for all
[TABLE]
Therefore satisfies the equivariance condition (2).
Now suppose that (2) is satisfied for some . Then the matrix commutes with every , and by (1) it follows that is a diagonal matrix. Therefore
[TABLE]
as desired. ∎
Remarks 2.2**.**
- (a)
Observe that the implication ”” could also be proved by using the well know fact that two matrices and commute if there is an orthogonal transformation such that both and are diagonal.
- (b)
By construction all the eigenvalues of every are or . In particular for all . Moreover, by (a) the matrix and all possess the same set of eigenvectors.
- (c)
Obviously analogous results can be obtained for Hermitian or normal matrices: Using essentially the same proof as in Proposition 2.1 one can show that a matrix is normal (i.e. ) if and only if there is a unitary matrix such that
[TABLE]
where the group is defined by
[TABLE]
3 On Applications
Proposition 2.1 could be used to look at results for symmetric matrices in the light of the equivariance condition (2). For instance a result from [4] on the genericity of the structure of eigenspaces would imply the well known fact that generically eigenspaces of self-adjoint matrices are one-dimensional. (Simply observe that possesses only one-dimensional (absolutely) irreducible representations.)
A potentially more interesting application may be the analysis of symmetry breaking bifurcations for gradient systems since in this case the Jacobian would be equivariant according to (2). This could particularly be useful for bifurcation problems where the (symmetric) steady state solution does not depend on the bifurcation parameter. In fact, some time ago the author himself has co-authored an article on ”equivariant (and) self-adjoint matrices” [5], and it could be interesting to reconsider these results by taking the insight provided by Proposition 2.1 into account.
However, within this note let us focus concretely on one implication involving Taylor expansions. In this context the following immediate consequence of Proposition 2.1 strongly indicates that the result could, for instance, be used to develop a novel general approach for the construction of higher order stencils for real valued functions of several variables.
Suppose that is smooth in a neighborhood of . In the following we use Proposition 2.1 to construct a four-point-stencil which provides a second order approximation of evaluations of the fourth order derivative in . For convenience we write the Taylor expansion of in as
[TABLE]
where , , and is the Hessian matrix of at .
Corollary 3.1**.**
Denote by the group in Proposition 2.1 corresponding to the Hessian matrix . Then for all we have
[TABLE]
and therefore for all
[TABLE]
In particular, .
Proof.
For and we compute using (2) and the fact that
[TABLE]
Therefore
[TABLE]
and (3), (4) immediately follow. ∎
Obviously, if then this result is not useful. However, for all other choices of this leads to interesting approximations of the fourth order derivative as long as is not an eigenvector of ().
Example 3.2**.**
Let be defined by
[TABLE]
We choose and compute
[TABLE]
The choice of
[TABLE]
leads to
[TABLE]
For we obtain
[TABLE]
and for one computes
[TABLE]
as expected.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Schönemann. On two-sided orthogonal Procrustes problems. Psychometrika , 33(1):19–33, 1968.
- 2[2] R.W. Brockett. Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems. In Decision and Control, 1988., Proceedings of the 27th IEEE Conference on , pages 799–803. IEEE, 1988.
- 3[3] R.W. Brockett. Least squares matching problems. Linear Algebra and its Applications , 122:761–777, 1989.
- 4[4] M. Golubitsky, I. Stewart, and D. Schaeffer. Singularities and Groups in Bifurcation Theory . Springer, 1988.
- 5[5] M. Dellnitz and I. Melbourne. Generic movement of eigenvalues for equivariant self-adjoint matrices. Journal of Computational and Applied Mathematics , 55(3):249–259, 1994.
