fbpx
Wikipedia

Specht's theorem

In mathematics, Specht's theorem gives a necessary and sufficient condition for two complex matrices to be unitarily equivalent. It is named after Wilhelm Specht, who proved the theorem in 1940.[1]

Two matrices A and B with complex number entries are said to be unitarily equivalent if there exists a unitary matrix U such that B = U *AU.[2] Two matrices which are unitarily equivalent are also similar. Two similar matrices represent the same linear map, but with respect to a different basis; unitary equivalence corresponds to a change from an orthonormal basis to another orthonormal basis.

If A and B are unitarily equivalent, then tr AA* = tr BB*, where tr denotes the trace (in other words, the Frobenius norm is a unitary invariant). This follows from the cyclic invariance of the trace: if B = U *AU, then tr BB* = tr U *AUU *A*U = tr AUU *A*UU * = tr AA*, where the second equality is cyclic invariance.[3]

Thus, tr AA* = tr BB* is a necessary condition for unitary equivalence, but it is not sufficient. Specht's theorem gives infinitely many necessary conditions which together are also sufficient. The formulation of the theorem uses the following definition. A word in two variables, say x and y, is an expression of the form

where m1, n1, m2, n2, …, mp are non-negative integers. The degree of this word is

Specht's theorem: Two matrices A and B are unitarily equivalent if and only if tr W(A, A*) = tr W(B, B*) for all words W.[4]

The theorem gives an infinite number of trace identities, but it can be reduced to a finite subset. Let n denote the size of the matrices A and B. For the case n = 2, the following three conditions are sufficient:[5]

For n = 3, the following seven conditions are sufficient:

 [6]

For general n, it suffices to show that tr W(A, A*) = tr W(B, B*) for all words of degree at most

 [7]

It has been conjectured that this can be reduced to an expression linear in n.[8]

Notes edit

References edit

  • Đoković, Dragomir Ž.; Johnson, Charles R. (2007), "Unitarily achievable zero patterns and traces of words in A and A*", Linear Algebra and its Applications, 421 (1): 63–68, doi:10.1016/j.laa.2006.03.002, ISSN 0024-3795.
  • Freedman, Allen R.; Gupta, Ram Niwas; Guralnick, Robert M. (1997), "Shirshov's theorem and representations of semigroups", Pacific Journal of Mathematics, 181 (3): 159–176, doi:10.2140/pjm.1997.181.159, ISSN 0030-8730.
  • Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6.
  • Pappacena, Christopher J. (1997), "An upper bound for the length of a finite-dimensional algebra", Journal of Algebra, 197 (2): 535–545, doi:10.1006/jabr.1997.7140, ISSN 0021-8693.
  • Sibirskiǐ, K. S. (1976), Algebraic Invariants of Differential Equations and Matrices (in Russian), Izdat. "Štiinca", Kishinev.
  • Specht, Wilhelm (1940), "Zur Theorie der Matrizen. II", Jahresbericht der Deutschen Mathematiker-Vereinigung, 50: 19–23, ISSN 0012-0456.


specht, theorem, mathematics, gives, necessary, sufficient, condition, complex, matrices, unitarily, equivalent, named, after, wilhelm, specht, proved, theorem, 1940, matrices, with, complex, number, entries, said, unitarily, equivalent, there, exists, unitary. In mathematics Specht s theorem gives a necessary and sufficient condition for two complex matrices to be unitarily equivalent It is named after Wilhelm Specht who proved the theorem in 1940 1 Two matrices A and B with complex number entries are said to be unitarily equivalent if there exists a unitary matrix U such that B U AU 2 Two matrices which are unitarily equivalent are also similar Two similar matrices represent the same linear map but with respect to a different basis unitary equivalence corresponds to a change from an orthonormal basis to another orthonormal basis If A and B are unitarily equivalent then tr AA tr BB where tr denotes the trace in other words the Frobenius norm is a unitary invariant This follows from the cyclic invariance of the trace if B U AU then tr BB tr U AUU A U tr AUU A UU tr AA where the second equality is cyclic invariance 3 Thus tr AA tr BB is a necessary condition for unitary equivalence but it is not sufficient Specht s theorem gives infinitely many necessary conditions which together are also sufficient The formulation of the theorem uses the following definition A word in two variables say x and y is an expression of the form W x y xm1yn1xm2yn2 xmp displaystyle W x y x m 1 y n 1 x m 2 y n 2 cdots x m p where m1 n1 m2 n2 mp are non negative integers The degree of this word is m1 n1 m2 n2 mp displaystyle m 1 n 1 m 2 n 2 cdots m p Specht s theorem Two matrices A and B are unitarily equivalent if and only if tr W A A tr W B B for all words W 4 The theorem gives an infinite number of trace identities but it can be reduced to a finite subset Let n denote the size of the matrices A and B For the case n 2 the following three conditions are sufficient 5 trA trB trA2 trB2 andtrAA trBB displaystyle operatorname tr A operatorname tr B quad operatorname tr A 2 operatorname tr B 2 quad text and quad operatorname tr AA operatorname tr BB For n 3 the following seven conditions are sufficient trA trB trA2 trB2 trAA trBB trA3 trB3 trA2A trB2B trA2 A 2 trB2 B 2 andtrA2 A 2AA trB2 B 2BB displaystyle begin aligned amp operatorname tr A operatorname tr B quad operatorname tr A 2 operatorname tr B 2 quad operatorname tr AA operatorname tr BB quad operatorname tr A 3 operatorname tr B 3 amp operatorname tr A 2 A operatorname tr B 2 B quad operatorname tr A 2 A 2 operatorname tr B 2 B 2 quad text and quad operatorname tr A 2 A 2 AA operatorname tr B 2 B 2 BB end aligned 6 For general n it suffices to show that tr W A A tr W B B for all words of degree at most n2n2n 1 14 n2 2 displaystyle n sqrt frac 2n 2 n 1 frac 1 4 frac n 2 2 7 It has been conjectured that this can be reduced to an expression linear in n 8 Notes edit Specht 1940 Horn amp Johnson 1985 Definition 2 2 1 Horn amp Johnson 1985 Theorem 2 2 2 Horn amp Johnson 1985 Theorem 2 2 6 Horn amp Johnson 1985 Theorem 2 2 8 Sibirskiǐ 1976 p 260 quoted by Đokovic amp Johnson 2007 Pappacena 1997 Theorem 4 3 Freedman Gupta amp Guralnick 1997 p 160References editĐokovic Dragomir Z Johnson Charles R 2007 Unitarily achievable zero patterns and traces of words in A and A Linear Algebra and its Applications 421 1 63 68 doi 10 1016 j laa 2006 03 002 ISSN 0024 3795 Freedman Allen R Gupta Ram Niwas Guralnick Robert M 1997 Shirshov s theorem and representations of semigroups Pacific Journal of Mathematics 181 3 159 176 doi 10 2140 pjm 1997 181 159 ISSN 0030 8730 Horn Roger A Johnson Charles R 1985 Matrix Analysis Cambridge University Press ISBN 978 0 521 38632 6 Pappacena Christopher J 1997 An upper bound for the length of a finite dimensional algebra Journal of Algebra 197 2 535 545 doi 10 1006 jabr 1997 7140 ISSN 0021 8693 Sibirskiǐ K S 1976 Algebraic Invariants of Differential Equations and Matrices in Russian Izdat Stiinca Kishinev Specht Wilhelm 1940 Zur Theorie der Matrizen II Jahresbericht der Deutschen Mathematiker Vereinigung 50 19 23 ISSN 0012 0456 nbsp This article about matrices is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Specht 27s theorem amp oldid 1170021263, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.