Abstract
This paper is devoted to some selected topics of the theory of special orthogonal group SO(3). First, we discuss the trace of orthogonal matrices and its relation to the characteristic polynomial; on this basis, the partition of SO(3) formed by conjugation classes is described by trace mapping. Second, we show that every special orthogonal matrix can be expressed as the product of three elementary special orthogonal matrices. Explicit formulas for the decomposition as needed for applications in differential geometry and physics as symmetry transformations are given.
MSC:
15B10; 50E40; 70H33; 83C40
1. Introduction
Our objective in this paper is a well-known classical subject: the special orthogonal group . We search for innovations needed for new applications of as a transformation group on topological and smooth manifolds.
As a set, SO(3) carries several mathematical structures. Its basic algebraic structure (the group structure) is induced by the Euclidean scalar product on . The canonical topological structure of is induced by the Euclidean topology of . Clearly, also has smooth manifold and Lie group structures. Indeed, these structures are all compatible. We wish to revisit and summarize properties of these structures in a coherent way suitable for various applications.
Standard and modern topics and problems related to applications of do not need a broad introduction. -symmetry appears in elementary analysis, geometry and invariance theory. As a fundamental concept, appears in classical mechanics (e.g., the Kepler problem) and in general relativity and field theory (e.g., gravitational fields with spherical symmetry, the Schwarzschild solution of the Einstein equations and the Birkhoff theorem). In variational geometry, invariance implies conservation laws for solutions of the Euler-Lagrange equations. Geometric and topological problems include a classification of manifolds endowed with a group action.
Indeed, some of these problems still need a more exact formulation of basic theorems and their proofs. Exact assertions are also needed for new applications. In general, we are interested in two questions: (a) the decomposition theorems of in terms of its subgroups isomorphic to the special orthogonal group ; and (b) orbit structure of continuous actions of on topological spaces.
We wish to consider in this paper the underlying algebraic part of the theory. In the proofs, only the group structure of is used. In particular, we do not need an interpretation of as a rotation group. It should be pointed out that in accordance with motivations included in work by Krupka and Brajerčík [1], basic algebraic theory will be extended to the topological and smooth structures of in subsequent articles.
Section 2 is devoted to standard general definitions and the notation as needed in proofs (e.g., Alperin, Bell [2] and Kurosh [3]), and a version of the orbit stabilizer theorem is presented (Bui, [4]).
In Section 3, is studied. We prefer a direct, straightforward approach based on its algebraic and geometric origin. As usual, special orthogonal matrices are introduced by the orthogonality conditions and the determinant condition. Sometimes, we also apply an equivalent definition based on the cross-product of vectors in the Euclidean vector space .
Within this framework, innovations in this article include:
- the trace properties of special orthogonal matrices (relationship of the trace and the characteristic polynomial, explicit form of the partition of associated to the trace mapping, simple description of stable points),
- a canonical decomposition formula for any special orthogonal matrix in terms of elementary special orthogonal matrices canonically identified with elements of .
The text and the notation also provide a coherent, self-contained basis for the discussion of the topological and smooth structures of . Because of the lack of space, we will discuss these concepts elsewhere.
Everywhere in this paper denotes the field of real numbers and is the Euclidean vector space of dimension n endowed with the Euclidean scalar product.
2. Group Actions: Orbit Stabilizer Theorem
2.1. Groups, Subgroups, Coset Partitions
In this section, is a group. The group multiplication is denoted as a mapping . is the identity element of , and is the inverse of .
For any two subsets and of a group we define the group product of and to be the subset of . If is a one-point set, , we write instead of .
Consider a special case when and are subgroups of .
Lemma 1.
The group product of subgroups and of a group is a subgroup of if and only if
Proof.
Only sufficiency of condition (1) needs proof., which is straightforward. □
For any subgroup of and any the set is called the left coset of in generated by . Since contains the identity element, always belongs to .
Lemma 2.
Let be a group and let be a subgroup of .
(a) Two left cosets , coincide if and only if .
(b) Given a left coset , then for any two elements ,
(c) Left cosets form a partition of the group .
Proof.
(a) Suppose that . Then for some hence . Conversely if for some , then for any formula yields .
(b) Let be a left coset, let be two points belonging to . Then and for some . Hence and . Then by (a), . Replacing by we also have proving (2).
(c) Formula (2) implies that a left coset is generated by any of its elements. Thus, two left cosets are either identical or disjoint. □
The partition of formed by left cosets is the left partition of by the subgroup and is denoted by . The corresponding quotient projection is the mapping .
Similar construction arises when we use the right cosets generated by instead of . The canonical (one-to-one) correspondence between right and left cosets is given by
Lemma 3.
Let be a group and let be a subgroup of .
(a) Two right cosets , coincide if and only if .
(b) Given a right coset , then for any two elements ,
(c) Right cosets form a partition of the group .
Proof.
See Lemma 2. □
The partition of formed by right cosets is the right partition of by . The corresponding quotient projection is the mapping . Formula (3) shows that the right partition differs from the left partition by a canonical bijection.
2.2. Group Actions
Let be a group and let be a set. Recall that a right action of on is a mapping such that for all and for all and all . A set endowed with a right action of is called a right G-set.
A mapping of a right G-set into a right G-set is said to be G-equivariant, if for all and .
A right action of on is transitive, if for any two points there exists such that . A right action is free, if for any equation has a unique solution ; equivalently we also say that acts on without fixed points.
The G-orbit of a point in a right G-set , or just an orbit of , is the set . Clearly, a G-orbit of is a right G-set and the restriction of the right action of to is transitive.
The stabilizer of a point is the subgroup of . It is easily seen that for all ; in particular, the stabilizers of the points of along a G-orbit are canonically isomorphic.
G-orbits can be considered as equivalence classes of the equivalence relation on “ if there exists a point such that ”. The corresponding quotient set denoted by consists of different orbits and is called the orbit set. The quotient projection assigns to the G-orbit .
Set for every point and every
This formula defines the G-orbit mapping at the point , . Restricting the range of we get a surjective mapping of the group onto the G-orbit . Since for any , satisfies
In particular, is G-equivariant.
A left action of on is a mapping such that for all and for all and all . A set endowed with a left action of is called a left G-set.
The concepts like a stabilizer, a G-equivariant mapping of left G-sets, a transitive and a free left action, the orbit and the orbit set of a right action extend in an obvious way to the left actions. Note, however, that
2.3. Orbit Stabilizer Theorem
Let be a left G-set, let be a subgroup of . Setting for any left coset and any
We get a left action of on the set of left cosets . With this action becomes a left G-set. For any we have the diagram
The following is a version of the Orbit stabilizer theorem for the G-orbit mapping (cf. e.g., Hong Thien An Bui [4], Theorem 8.1).
Theorem 1.
Let be a left G-set. For any point there exists a mapping such that the diagram
commutes. is unique and is a G-equivariant isomorphism of and the G-orbit .
Proof.
Fix and consider the G-orbit mapping and the stabilizer of . We know that two left cosets , are equal if and only if . Consider a class and choose . Then hence and that is . Consequently, the point depends on the class only. Thus, formula
defines a mapping . This proves the existence of completing the diagram (4) to the commutative diagram (5). The uniqueness of is obvious: If then and if then ; then however, and .
If and , then
proving that is G-equivariant.
We show that is bijective. To prove injectivity, suppose that that is, , then hence, ; this implies that the left cosets and are equal, thus, is injective. To prove surjectivity, since we already have the commutative diagram (5), it is sufficient to verify that the orbit mapping is surjective, but this is obviously true since is the G-orbit. □
3. Special Orthogonal Group SO(3)
3.1. SO(2)
A -matrix with real entries
is said to be special orthogonal if its row vectors , satisfy the orthogonality conditions
and the determinant condition
The set of special orthogonal matrices (6) together with the matrix multiplication is a group called the special orthogonal group (in two dimensions) and is denoted by .
Clearly, orthogonality conditions state that the rows of a special orthogonal matrix constitute an orthonormal basis of the vector space .
Let denote the transpose of the matrix . Identity
together with orthogonality and determinant conditions (7) and (8) show that is special orthogonal if and only if
The following is an immediate consequence of the definition.
Lemma 4.
The following conditions are equivalent:
(a) is special orthogonal.
(b) is of the form
where
(c) has exactly one of the following two expressions
where is a number such that .
Remark 1.
The mapping
is a bijection, the canonical bijection of and the circle .
3.2. SO(3)
A -matrix with real entries
is said to be special orthogonal, if its entries satisfy the orthogonality conditions
and the determinant condition
The set of special orthogonal matrices of the form (9) endowed with the matrix multiplication is called the special orthogonal group (in three dimensions) and is denoted by .
The orthogonality conditions show that the rows of a special orthogonal matrix constitute an orthonormal basis of the vector space .
First examples of special orthogonal matrices are
Let be the transpose of the matrix . Identity
shows that is special orthogonal if and only if is invertible and
In the following two remarks we give an example of a finite subgroup of the special orthogonal group and an example of a subgroup homomorphic with the special orthogonal group .
Remark 2 (Cyclic permutation matrices).
Recall that a permutation matrix is a square matrix with real entries that has exactly one entry 1 in every column and every row and all other entries are 0. In there are exactly three permutation matrices, namely the cyclic permutation matrices
These cyclic matrices form a subgroup of . Each permutation matrix defines a cyclic permutation of the rows of the matrices (6):
If for example
then
Remark 3.
A matrix of the form
is special orthogonal if and only if its submatrix
is special orthogonal. Special orthogonal matrices of the form (12) constitute a subgroup of isomorphic with .
3.3. Cross-Product
Recall that the cross-product of two vectors and in is defined to be the vector
The matrix
is called the cross-product matrix of and .
Note that assigns to the pair of column vectors , the column vector ; in this case the cross-product matrix
represents the canonical counterclockwise orthonormal frame of .
Lemma 5.
The cross-product matrix of two vectors , forming an orthonormal system is special orthogonal.
Proof 1.
Suppose that the vectors , form an orthonormal system, that is,
Then
proving that the first column in (1) is of length 1. Identities
then shows that the matrix (13) satisfies the orthogonality conditions. The determinant condition can be verified by a direct calculation. □
We show that the cross-product is surjective.
Lemma 6.
For any unit vector in there exist unit vectors and such that the matrix
is special orthogonal.
Proof.
Lemma 6 just says that every unit vector can be completed to an orthonormal basis. □
The cross-product is unique way how to construct special orthogonal matrices:
Lemma 7.
Suppose that we have two special orthogonal matrices of the form
Then
Proof.
By hypothesis matrices (14) satisfy the orthogonality conditions and the determinant condition; thus,
and
We claim that these equations force the identity (15).
Suppose the opposite. Then we have two vectors , , satisfying (16) and (17) such that . From (16) we conclude that , , , , ,, or, equivalently,
and
If , then the first equation yields . Then Equations (18) and (19) transforms to
hence
Then, Equations (19) and (20) contradict the determinant conditions (17). Consequently as required.
The same contradictions arise when we suppose that or .□
Theorem 2.
Every special orthogonal matrix is a cross-product matrix of two vectors forming an orthonormal system,
Proof.
Let be any special orthogonal matrix,
and let be the cross-product matrix of the column vectors and ,
Then, by Lemma 7, as desired. □
Clearly, Theorem 2 holds mutatis mutandis whenever the first column in a special orthogonal matrix is replaced by any of its columns and similarly for the rows. Consequently, we obtain the following useful identities for the entries of special orthogonal matrices.
Theorem 3.
Let be a matrix expressed as
and suppose
The following two conditions are equivalent:
(a) The entries of satisfy the conditions (2), Section 3.2.
(b) The entries of satisfy
Proof.
1. Since cyclic permutations of columns do not change special orthogonality, we can write
proving (23).
2. Suppose that we have a matrix whose entries satisfy (10) and (11). Then by a direct calculation
Similar calculations yield
□
3.4. Traces of Special Orthogonal Matrices
Recall that the trace of a matrix
is the number
The real-valued function is the trace function.
Set for any two -matrices and
Calculating the trace of this matrix product we easily obtain
In particular,
Consequently, for any nonsingular matrix the trace of the conjugate matrix is
This formula says that the trace function is constant on the conjugacy classes of square -matrices .
Properties (25) and (26) hold for any -matrices and where n is a positive integer.
If is special orthogonal, we have the identities (23)
showing that the trace can also be calculated from the formula
Lemma 8.
For any special orthogonal matrix ,
Proof.
For Formula (24) yields
Substituting for the determinants from Formula (23), we have
as required. □
Lemma 9.
(a) The trace of any special orthogonal matrix satisfies
The endpoints and of the interval are achieved by the special orthogonal matrices
(b) The trace function is surjective.
Proof.
(a) Since the product is special orthogonal, then and Formula (28) implies
Since then equivalently
The case has no solution. The same is true if . The case , is solved by any such that .
(b) Given any number we can always find a special orthogonal matrix such that . Indeed, set
Obviously, this matrix is well defined because by assumption always . Clearly satisfies the orthogonality conditions,
and the determinant condition
Thus, . The trace of is
as required. □
Lemma 10.
A special orthogonal matrix is symmetric if and only if or .
Proof.
If is symmetric, then hence by (28)
hence . Then necessarily or .
The inverse follows from Lemma 9, (a). □
3.5. Characteristic Polynomial
In this section we show that the characteristic polynomial of a special orthogonal matrix
is completely determined by the trace of . A partition of special orthogonal matrices is constructed on this basis, which can be considered as a classification of special orthogonal matrices by the trace mapping.
Lemma 11.
Any matrix satisfies the identity
Proof.
Determinant (30) can be calculated as follows:
But
hence . □
Lemma 11 says that the number is a characteristic root of the matrix . To find the other characteristic roots we express the characteristic polynomial (29) explicitly. Standard calculations yield
But, the last row in this expression is and the coefficient at is (27); thus
On the other hand, according to Lemma 11, the characteristic polynomial is also expressible as
Comparing the coefficients we find , , and hence , and hence
The corresponding characteristic equation
includes the trace as a parameter.
Theorem 4.
(a) The image of the trace mapping is the closed interval .
(b) The family of subsets of labelled by ,
is a partition of formed by conjugacy classes of special orthogonal matrices
Proof.
(a) See Lemma 9.
(b) We shall determine the characteristic roots solving the quadratic equation
Since in this equation is a special orthogonal matrix, it is always supposed that (Lemma 6).
Solutions to Equation (32) are classified by its discriminant
Consider separately the following three complementary cases: (b1) , (b2) , and (b3) .
(b1) . Then either and , or and ; there are no special orthogonal matrices satisfying these inequalities.
(b2) . In this case either or ; in both cases .
If , then has a double characteristic root
In this case belongs to special orthogonal matrices of the form
satisfying an additional condition
There is a unique matrix whose trace is maximal (equal to 3), namely
If , then we have a double characteristic root
In this case belongs to special orthogonal matrices of the form
satisfying
This condition is obviously satisfied by the special orthogonal matrix
and by all special orthogonal matrices belonging to the conjugacy class of , . Two examples of such matrices are
(b3) . Then since by (33) , we have either , or , . Thus, condition implies
and the characteristic polynomial of has two complex conjugate roots
A matrix whose trace is can be constructed for any as in the proof of Lemma 6, (b). We have
The set of all matrices with characteristic roots (6) is now given as the conjugacy class .
Note that Formula (7) is also valid for and .□
Remark 4.
The matrix in Theorem 4 can be replaced by one of the following two matrices
Indeed, these matrices are obtained by cyclic permutations of the rows and columns in which preserve both orthogonality and determinant conditions.
3.6. Stable Points
Since every has an eigenvalue equal to 1, equation for stable points of in ,
has always a nontrivial solution. Solutions of this equation determine the stable points by explicit formulas.
If and are conjugate, that is, , then hence
Thus, a stable point u of already determines a stable point of . It is therefore sufficient to find solutions to Equation (37) for special orthogonal matrices (31), where ,
In particular,
In the following theorem we write
Theorem 5.
(a) If then any vector of length 1
is a stable point of .
(b) Let . Then for every there is a unique stable eigenvector of length 1 of the matrix . This eigenvector is given by
Proof.
(a) Obvious.
(b) Let . For every the eigenvector of is necessarily of the form
Now, we apply Formula (2). □
Remark 5.
The matrix in Theorem 5 can be replaced by one of the matrices (36). These replacements will cause some obvious changes in parts (b) and (c) of Theorem 5.
3.7. Canonical Decomposition
In this section the following decomposability problem is considered. Given a special orthogonal matrix expressed as
we ask whether there exist three elementary special orthogonal matrices
such that
Expression (40) is called the canonical decomposition of .
Note that the submatrices of the matrices (39)
are necessarily special orthogonal; thus, by Lemma 4, for constructing decomposition (40) we always suppose that
Since the matrix product has an expression
condition (40) induces the decomposability equation for the unknowns
The constraints are the orthogonality condition (10) and the determinant condition (11) satisfied by the matrix on the left-hand side and the orthogonality conditions and conditions (41) satisfied by the right-hand side.
The following compatibility lemma is a direct consequence of the group structure of . A simple direct proof can also be given.
Lemma 12.
The matrix
whose entries satisfy conditions (3), is special orthogonal.
Proof.
Orthogonality and determinant conditions (10) and (11) can be verified by straightforward calculation. □
Remark 6.
Clearly, if (43) is special orthogonal, then replacing by any of the pairs , , we also get a special orthogonal matrix; and analogously for and .
Now we are in a position to find solutions to the decomposability Equation (42).
Theorem 6.
(a) For every there exist elementary special orthogonal matrices such that
(b) If , then
where is arbitrary.
If , then
where is arbitrary.
If , then admits exactly 2 decompositions
and
Proof.
It is sufficient to prove assertion (b). We consider the following three complementary cases (b1) , (b2) and (b3) separately.
(b1) . Orthogonality conditions (2), Section 3.2, yield
Clearly, we have analogous conditions for the transposed matrix . Then , , , and the remaining components of satisfy
In particular, the matrix
is special orthogonal and by Lemma 4
where . Thus, our assumption restricts the matrix on the left-hand side of decomposition equation (44) to the matrices of the form
where
For these matrices, the decomposability equation becomes
where it is understood that . Solving this system in the set where , , , we have
and , . In a matrix form
Then by orthogonality
hence
that is, and . We conclude that in the matrix (45) has a decomposition , where
A direct verification shows that is special orthogonal:
(b2) . In this case orthogonality conditions (10) yield
Then , ,, , thus
The remaining components of satisfy
which implies that the upper right corner -submatrix is orthogonal. The determinant condition (23) requires
that is,
Consequently, the matrix
is special orthogonal hence by Lemma 4
and . Substitution and in (46) yields
Summarizing, we can say that our assumption (b2) restricts the special orthogonal matrices on the left-hand side of decomposition Equation (42) to matrices of the form (47), where
For these matrices, the decomposability Equation (44) reads
where it is understood that
Solving this system in the set where , , , we have
and , . In a matrix form
Then by orthogonality
hence
that is, and . We conclude that in this case the matrix (47) has a decomposition , where
A direct verification shows that is special orthogonal:
(b3) . Equation (44) now implies
and by (41) is one of the following two non-zero numbers
Then again, from (41)
Thus, we get two solutions:
and
The corresponding , , are given by
or
respectively. This concludes the proof of (b3). □
Author Contributions
Both authors contributed to the conceptualization, methodology, original draft preparation and preparation of comments on reviews of the paper equally. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding authors.
Acknowledgments
This work was supported by the Transilvania Fellowship Program for Visiting Professors. The first author (D.K.) highly appreciates excellent research conditions extended to him by the Department of Mathematics and Computer Science of the Transilvania University in Brasov, Romania.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Krupka, D.; Brajerčík, J. Schwarzschild spacetimes: Topology. Axioms 2022, 11, 693. [Google Scholar] [CrossRef]
- Alperin, J.L.; Bell, R.B. Groups and Representations; Graduate Texts in Mathematics 162; Springer: Berlin/Heidelberg, Germany, 1995. [Google Scholar]
- Kurosh, A. Higher Algebra; Mir Publishers: Moscow, Russia, 1980. [Google Scholar]
- Bui, H.T.A. Classifying the Finite Subgroups of SO(3); Unpublished work; The University of Chicago, Department of Mathematics: Chicago, IL, USA, 2020. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).