Canonical Forms for Similarity推荐.pdfVIP

Chapter 2 Canonical Forms for Similarity 2.1 Strict Equivalence of Pencils Definition 2.1.1 A matrix A(x) ∈ D [x]m ×n is a pencil if A(x) = A + xA , A , A ∈ Dm ×n . (2.1.1) 0 1 0 1 A pencil A(x) is regular if m = n and det A(x) = 0. Otherwise A(x) is a singular pencil. Two pencils A(x), B(x) ∈ D [x]m ×n are strictly equivalent if s A(x)∼B (x) ⇐⇒ B (x) = QA(x)P, P ∈ GL(n, D), Q ∈ GL(m, D). (2.1.2) The classical works of Weierstrass [Wei67] and Kronecker [Kro90] classify the equivalence classes of pencils under the strict equivalence relation in the case D is a field F. We give a short account of their main results. First note that the strict equivalence of A(x), B(x) implies the equivalence of A(x), B(x) over the domain D [x]. Furthermore let B (x) = B + xB . (2.1.3) 0 1 75 76 Matrices Then the condition (2.1.2) is equivalent to B = QA P, B = QA P, P ∈ GL(n, D), Q ∈ GL(m, D). 0 0 1 1 (2.1.4) Thus we can interchange A0 with A1 and B0 with B1 without affect- ing the strict equivalence relation. Hence, it is natural to consider a homogeneous pencil A(x , x ) = x A + x A . (2.1.5) 0 1 0 0 1 1 Assume that D is D . Then D [x , x ] is also D (Problem 1.4.6) U U 0 1 U In particular D [x , x ] is D . Let δ (x , x ), i (x , x ) be the