AXIOMS FOR INVARIANT FACTORS*



Similar documents
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

GREATEST COMMON DIVISOR

2 Polynomials over a field

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

Row Ideals and Fibers of Morphisms

Mathematics Course 111: Algebra I Part IV: Vector Spaces

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

Row Echelon Form and Reduced Row Echelon Form

Solving Linear Systems, Continued and The Inverse of a Matrix

Today s Topics. Primes & Greatest Common Divisors

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

Section Inner Products and Norms

11 Ideals Revisiting Z

Factorization Algorithms for Polynomials over Finite Fields

α = u v. In other words, Orthogonal Projection

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

6.2 Permutations continued

Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices

z 0 and y even had the form

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

1 Sets and Set Notation.

1 VECTOR SPACES AND SUBSPACES

THREE DIMENSIONAL GEOMETRY

26 Ideals and Quotient Rings

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

Continued Fractions and the Euclidean Algorithm

PROBLEM SET 6: POLYNOMIALS

Continuity of the Perron Root

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n

ADDITIVE GROUPS OF RINGS WITH IDENTITY

Unique Factorization

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

A characterization of trace zero symmetric nonnegative 5x5 matrices

T ( a i x i ) = a i T (x i ).

Orthogonal Diagonalization of Symmetric Matrices

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

it is easy to see that α = a

Factorization in Polynomial Rings

Matrix Representations of Linear Transformations and Changes of Coordinates

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Numerical Analysis Lecture Notes

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Lecture 3: Finding integer solutions to systems of linear equations

k, then n = p2α 1 1 pα k

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Notes on Determinant

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Math 4310 Handout - Quotient Vector Spaces

8 Divisibility and prime numbers

LINEAR ALGEBRA W W L CHEN

MA651 Topology. Lecture 6. Separation Axioms.

Systems of Linear Equations

3. INNER PRODUCT SPACES

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = i.

Algebra 3: algorithms in algebra

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

Inner Product Spaces

Factoring Polynomials

Math 550 Notes. Chapter 7. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010

The Australian Journal of Mathematical Analysis and Applications

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

The last three chapters introduced three major proof techniques: direct,

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, , UAE

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Prime power degree representations of the symmetric and alternating groups

DIVISIBILITY AND GREATEST COMMON DIVISORS

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

Factorization Theorems

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

Chapter 13: Basic ring theory

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CONTROLLABILITY. Chapter Reachable Set and Controllability. Suppose we have a linear system described by the state equation

3. Mathematical Induction

The Determinant: a Means to Calculate Volume

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

A note on companion matrices

A simple criterion on degree sequences of graphs

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

NOTES ON LINEAR TRANSFORMATIONS

Lecture Notes on Measure Theory and Functional Analysis

MAT188H1S Lec0101 Burbulla

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Similarity and Diagonalization. Similar Matrices

Handout NUMBER THEORY

160 CHAPTER 4. VECTOR SPACES

Geometrical Characterization of RN-operators between Locally Convex Vector Spaces

Transcription:

PORTUGALIAE MATHEMATICA Vol 54 Fasc 3 1997 AXIOMS FOR INVARIANT FACTORS* João Filipe Queiró Abstract: We show that the invariant factors of matrices over certain types of rings are characterized by a short list of very simple properties 1 Introduction An integral domain R is called an elementary divisor domain [3] if every matrix over R is equivalent to a Smith normal form, that is, there exist U and V invertible over R such that UAV = s 1 (A) s 2 (A) where s 1 (A) s 2 (A) The elements s 1 (A), s 2 (A), are the invariant factors of A and are uniquely determined (apart from units) by the matrix, as follows from the characterization s k (A) = d k(a) d k 1 (A), k = 1,, rank(a) (d k (A) the k-th determinantal divisor of A is the gcd of all k k minors of A, d 1) For convenience, we add a chain of s to the list of invariant factors Examples of elementary divisor domains are Euclidean domains (like Z and the rings F[λ], F a field) and, more generally, principal ideal domains One example of an elementary divisor domain which is not a principal ideal domain Received: January 22, 1996 * Research supported by CMUC/JNICT and project PBIC/C/CEN/1129/92 Representação de Grupos e Combinatória

264 JF QUEIRÓ is the ring H(Ω) of all complex functions holomorphic in an open connected set Ω C [2] The determinantal divisors (and hence also the invariant factors) are invariant under equivalence Therefore, over an elementary divisor domain, the invariant factors completely determine the equivalence orbits: two matrices are equivalent if and only if they have the same invariant factors The following properties of invariant factors are very simple to establish: (I) s 1 (ca) = cs 1 (A) for all c R; (II) gcd(s k (A), s 1 (B)) s k (A + B) for all k, whenever A + B exists; (III) s k (A) s k (P AQ) for all k, whenever P AQ exists; (IV) k > rank(a) s k (A) = ; (V) k n s k (ci n ) c for all c R Our main purpose in the present note is to show that this list of properties actually characterizes the chain of invariant factors 2 The main result Theorem Let R be an elementary divisor domain Suppose that to every matrix A over R we associate a sequence h 1 (A) h 2 (A) of elements of R so that the following properties are satisfied: (I) h 1 (ca) = ch 1 (A) for all c R; (II) gcd(h k (A), h 1 (B)) h k (A + B) for all k, whenever A + B exists; (III) h k (A) h k (P AQ) for all k, whenever P AQ exists; (IV) k > rank(a) h k (A) = ; (V) k n h k (ci n ) c for all c R Then h k (A) = s k (A) for all A and k Remark In condition (I) and in the conclusion of the theorem, equality means apart from units (and likewise in similar situations) The proof of the theorem consists of a sequence of claims

AXIOMS FOR INVARIANT FACTORS 265 Claim 1 If B is a submatrix of A, then h k (A) h k (B) for all k result There exist P and Q such that B = P AQ whence (III) gives the Claim 2 If A and B are equivalent then h k (A) = h k (B) for all k B = UAV gives h k (A) h k (B) A = U 1 BV 1 gives h k (B) h k (A) Claim 3 h 1 (A) = s 1 (A) A is equivalent to its Smith normal form s 1 (A) Σ = s 2 (A) = s 1 (A)D, where D = 1 s 2 (A) s 1 (A) s 3 (A) s 1 (A) Since 1 is a submatrix of D, we have h 1 (D) h 1 (1) = 1, whence h 1 (D) = 1 Therefore, h 1 (A) = h 1 (Σ) = h 1 (s 1 (A)D) = s 1 (A) h 1 (D) = s 1 (A) Claim 4 s k (A) h k (A) for all k X = By claim 2, we may assume A is in Smith normal form Let s 1 (A) sk 1(A) Clearly rank(x) < k, whence h k (X) = We have s 1 (A X) = h 1 (A X) = gcd(, h 1 (A X)) (with the size of A) = gcd(h k (X), h 1 (A X)) h k (X + A X) = h k (A),

266 JF QUEIRÓ where we have used claim 3 and (II) But obviously s 1 (A X) = s k (A) Claim 5 h k (A) s k (A) for all k such that Put It is enough to consider k rank(a) Clearly there exist P and Q P AQ = E = s k (A) s 1 (A) s 1 (A) s k (A) s k (A) s k 1 (A) 1 and write Q = QE Then P AQ = s k (A)I k whence, by (III) and (V), h k (A) h k (P AQ ) = h k (s k (A)I k ) s k (A) Claims 4 and 5 prove the theorem Remark 1 The inspiration for this theorem came from a characterization of singular values by Pietsch [6] In the language of matrices his result reads as follows: Suppose that to every matrix A over C we associate a sequence h 1 (A) h 2 (A) of nonnegative numbers so that the following properties are satisfied: (I) h 1 (A) = A ; (II) h k (A) + h 1 (B) h k (A + B) for all k, whenever A + B exists; (III) h 1 (P ) h k (A) h 1 (Q) h k (P AQ) for all k, whenever P AQ exists; (IV) k > rank(a) h k (A) = ; (V) k n h k (I n ) = 1 Then, for all A, h 1 (A), h 2 (A), are the singular values of A Remark 2 Condition (V) in our theorem cannot be replaced by k n h k (I n ) = 1, as the sequence of determinantal divisors would also satisfy the new axiom list

AXIOMS FOR INVARIANT FACTORS 267 3 Applications The theorem can be applied to obtain alternative characterizations of invariant factors Denote s 1 (= gcd) by µ Let A R m n Then, for all k, we have, among others, the following characterizations: (1) (2) (3) (4) { } s k (A) = lcm µ(a X): rank(x) < k, { s k (A) = gcd c R: P AQ = ci k, P R k m, Q R n k}, s k (A) = s k (A) = lcm E R n, dim E=n k+1 gcd E R n, dim E=k gcd µ(ax), x E, µ(x)=1 lcm µ(ax) x E, µ(x)=1 The first of these four characterizations appeared in [7] The third and fourth appeared in [1] All can be proved very easily by showing that the right-hand side satisfies properties (I) (V) of the theorem For this, one must assume beforehand that the indicated lcm s and gcd s actually exist This is automatic if R is, for example, a principal ideal domain (which was the situation considered in [1] and [7]) As noted in [1] with respect to (3) and (4), each of these characterizations provides a new proof of the fact that the invariant factors are uniquely determined by the matrix, a matter approached in [5] in a different way The alternative characterizations can in turn be used to obtain easy proofs of known results about invariant factors We list some of these Interlacing of invariant factors If A m n is a submatrix of A m n, then, for all k, s k (A) s k (A ) s k+(m m )+(n n )(A) (the so-called interlacing inequalities ) The proof is trivial using characterization (1) [7] (The original proof can be found in [8], [9]) Invariant factors of sums We have ( ) gcd s i (A), s j (B) s i+j 1 (A + B)

268 JF QUEIRÓ for all i, j Again the proof is trivial using characterization (1) [7] (For the original proof, valid only for principal ideal domains, see [1]) Invariant factors of products This is an extensively studied problem For n n A and B, known relations have the form (P) s i1 (A) s it (A) s j1 (B) s jt (B) s k1 (AB) s kt (AB), where 1 t n, 1 i 1 < < i t n, 1 j 1 < < j t n, 1 k 1 < < k t n The problem is to find all the right sequences i = (i 1,, i t ), j = (j 1,, j t ), k = (k 1,, k t ) A very general description of sequences i, j, k for which (P) holds is due to RC Thompson [11] In that work the ring must be a principal ideal domain An important corollary of Thompson s work is that (P) holds when k = i u + j u u, 1 u t: s i1 (A) s it (A) s j1 (B) s jt (B) s i1 +j 1 1(AB) s it+j t t(ab) (the standard inequalities) For t = 1, this gives the well-known relation s i (A) s j (B) s i+j 1 (AB) The standard inequalities can also be proved using the Carlson Sá characterizations (3) (4) [4] So they hold for matrices over elementary divisor domains REFERENCES [1] Carlson, D and Marques de Sá, E Generalized minimax and interlacing theorems, Linear and Multilinear Algebra, 15 (1984), 77 13 [2] Helmer, O The elementary divisor theorem for certain rings without chain condition, Bulletin AMS, 49 (1943), 225 236 [3] Kaplansky, I Elementary divisors and modules, Transactions AMS, 66 (1949), 464 491 [4] Martins, RA and Queiró, JF Spectral inequalities for generalized Rayleigh quotients, Linear Algebra and its Applications, 22 (1995), 311 32 [5] Newman, M Equivalence without determinantal divisors, Linear and Multilinear Algebra, 7 (1979), 17 19 [6] Pietsch, A s-numbers of operators in Banach spaces, Studia Mathematica, 51 (1974), 21 223 [7] Queiró, JF Invariant factors as approximation numbers, Linear Algebra and its Applications, 49 (1983), 131 136 [8] Marques de Sá, E Imbedding conditions for λ-matrices, Linear Algebra and its Applications, 24 (1979), 33 5

AXIOMS FOR INVARIANT FACTORS 269 [9] Thompson, RC Interlacing inequalities for invariant factors, Linear Algebra and its Applications, 24 (1979), 1 32 [1] Thompson, RC The Smith invariants of a matrix sum, Proceedings AMS, 78 (198), 162 164 [11] Thompson, RC Smith invariants of a product of integral matrices, in Linear Algebra and its Role in Systems Theory, Contemporary Mathematics, 47 (1985), 41 435 João Filipe Queiró, Departamento de Matemática, Universidade de Coimbra, Apartado 38, 3 Coimbra PORTUGAL