We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

Size: px
Start display at page:

Download "We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors"

Transcription

1 We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,500 08,000.7 M Open access books available International authors and editors Downloads Our authors are among the 5 Countries delivered to TOP % most cited scientists 2.2% Contributors from top 500 universities Selection of our books indexed in the Book Citation Index in Web of Science Core Collection (BKCI) Interested in publishing with us? Contact book.department@intechopen.com Numbers displayed above are based on latest data collected. For more information visit

2 Provisional chapter An Interpretation of Rosenbrock's Theorem Via Local Rings A. Amparan, S. Marcaida and I. Zaballa Additional information is available at the end of the chapter Introduction Consider a linear time invariant system ẋ(t) = Ax(t) + Bu(t) (id) to be identified with the pair of matrices (A, B) where A n n, B n m and = R or C the fields of the real or complex numbers. If state-feedback u(t) = Fx(t) + v(t) is applied to system ( ), Rosenbrock's Theorem on pole assignment (see []) characterizes for the closedloop system ẋ(t) = (A + BF )x(t) + Bv(t), (id2) the invariant factors of its state-space matrix A + BF. This result can be seen as the solution of an inverse problem; that of finding a non-singular polynomial matrix with prescribed invariant factors and left Wiener Hopf factorization indices at infinity. To see this we recall that the invariant factors form a complete system of invariants for the finite equivalence of polynomial matrices (this equivalence relation will be revisited in Section ) and it will be seen in Section that any polynomial matrix is left Wiener Hopf equivalent at infinity to a diagonal matrix Diag( s k,..., s k m), where the non-negative integers k,..., k m (that can be assumed in non-increasing order) form a complete system of invariants for the left Wiener Hopf equivalence at infinity. Consider now the transfer function matrix G = (si - (A + BF )) - B of ( ). This is a rational matrix that can be written as an irreducible matrix fraction description G = N P -, where N and P are right coprime polyno 202 Amparan et al.; licensee InTech. This is an open access article distributed under the terms of the Creative Commons Attribution License ( which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

3 2 Linear Algebra mial matrices. In the terminology of [2], P is a polynomial matrix representation of ( ), concept that is closely related to that of polynomial model introduced by Fuhrmann (see for example [3] and the references therein). It turns out that all polynomial matrix representations of a system are right equivalent (see [2], [3]), that is, if P and P 2 are polynomial matrix representations of the same system there exists a unimodular matrix U such that P 2 = P U. Therefore all polynomial matrix representations of ( ) have the same invariant factors, which are the invariant factors of si n - (A + BF ) except for some trivial ones. Furthermore, all polynomial matrix representations also have the same left Wiener Hopf factorization indices at infinity, which are equal to the controllability indices of ( ) and ( ), because the controllability indices are invariant under feedback. With all this in mind it is not hard to see that Rosenbrock's Theorem on pole assignment is equivalent to finding necessary and sufficient conditions for the existence of a non-singular polynomial matrix with prescribed invariant factors and left Wiener Hopf factorization indices at infinity. This result will be precisely stated in Section once all the elements that appear are properly defined. In addition, there is a similar result to Rosenbrock's Theorem on pole assignment but involving the infinite structure (see [4]). Our goal is to generalize both results (the finite and infinite versions of Rosenbrock's Theorem) for rational matrices defined on arbitrary fields via local rings. This will be done in Section and an extension to arbitrary fields of the concept of Wiener Hopf equivalence will be needed. This concept is very well established for complex valued rational matrix functions (see for example [5], [6]). Originally it requires a closed contour, γ, that divides the extended complex plane (C { }) into two parts: the inner domain (Ω + ) and the region outside γ (Ω - ), which contains the point at infinity. Then two non-singular m m complex rational matrices T and T 2, with no poles and no zeros in γ, are said to be left Wiener Hopf equivalent with respect to γ if there are m m matrices U - and U + with no poles and no zeros in Ω - γ and Ω + γ, respectively, such that T 2 = U - T U +. (id3) It can be seen, then, that any non-singular m m complex rational matrix T is left Wiener Hopf equivalent with respect to γ to a diagonal matrix Diag((s - z 0 ) k,..., (s - z 0 ) k m) (id4) where z 0 is any complex number in Ω + and k k m are integers uniquely determined by T. They are called the left Wiener Hopf factorization indices of T with respect to γ (see again [5], [6]). The generalization to arbitrary fields relies on the following idea: We can identify Ω + γ and (Ω - γ) { } with two sets M and M ', respectively, of maximal ideals of C s. In fact, to each z 0 C we associate the ideal generated by s - z 0, which is a maximal ideal of C s. Notice that s - z 0 is also a prime polynomial of C s but M and M ', as defined,

4 An Interpretation of Rosenbrock's Theorem Via Local Rings 3 cannot contain the zero ideal, which is prime. Thus we are led to consider the set Specm(C s ) of maximal ideals of C s. y using this identification we define the left Wiener Hopf equivalence of rational matrices over an arbitrary field with respect to a subset M of Specm( s ), the set of all maximal ideals of s. In this study local rings play a fundamental role. They will be introduced in Section. Localization techniques have been used previously in the algebraic theory of linear systems (see, for example, [7]). In Section the algebraic structure of the rings of proper rational functions with prescribed finite poles is studied (i.e., for a fixed M Specm( s ) the ring of proper rational functions p q with gcd (g, π) = for all (π) M ). It will be shown that if there is an ideal generated by a linear polynomial outside M then the set of proper rational functions with no poles in M is an Euclidean domain and all rational matrices can be classified according to their Smith McMillan invariants. In this case, two types of invariants live together for any non-singular rational matrix and any set M Specm( s ) : its Smith McMillan and left Wiener Hopf invariants. In Section we show that a Rosenbrock-like Theorem holds true that completely characterizes the relationship between these two types of invariants. 2. Preliminaries In the sequel s will denote the ring of polynomials with coefficients in an arbitrary field and Specm( s ) the set of all maximal ideals of s, that is, Specm( s ) = {( π ( s )) : π ( s ) s, irreducible, monic, different from }. (id5) Let π( s ) s be a monic irreducible non-constant polynomial. Let S = s ( π ( s )) be the multiplicative subset of s whose elements are coprime with π. We denote by π the quotient ring of s by S; i.e., S - s : π ( s) = { p q : p, q s, gcd (q, π) = }. (id6) This is the localization of s at (π) (see [8]). The units of π are the rational functions u = p q such that gcd ( p, π) = and gcd (q, π) =. Consequentially, π ( s) = { u π d : u is a unit and d 0} {0}. (id7) For any M Specm( s ), let

5 4 Linear Algebra M ( s) = (π) M π ( s) = { p q : p, q s, gcd (q, π) = (π) M }. (id8) This is a ring whose units are the rational functions u = p q such that for all ideals (π) M, gcd ( p, π) = and gcd (q, π) =. Notice that, in particular, if M = Specm( s ) then M = s and if M = then M =, the field of rational functions. Moreover, if α( s ) s is a non-constant polynomial whose prime factorization, α = kα d α m d m, satisfies the condition that (α i ) M for all i, we will say that α factorizes in M or α has all its zeros in M. We will consider that the only polynomials that factorize in M = are the constants. We say that a non-zero rational function factorizes in M if both its numerator and denominator factorize in M. In this case we will say that the rational function has all its zeros and poles in M. Similarly, we will say that p q has no poles in M if p 0 and gcd (q, π) = for all ideals (π) M. nd it has no zeros in M if gcd (p, π) = for all ideals (π) M. In other words, it is equivalent that p q has no poles and no zeros in M and that p q is a unit of M. So, a non-zero rational function factorizes in M if and only if it is a unit in Specm ( s ) M ( s). Let M m m denote the set of m m matrices with elements in M. matrix is invertible in M ( s) m m if all its elements are in M and its determinant is a unit in M. We denote by Gl m ( M ) the group of units of M m m. Remark Let M, M 2 Specm( s ). Notice that. If M M 2 then M M 2 and Gl m ( M ) Gl m ( M 2 ). 2. M M 2 = M M 2 and Gl m ( M M 2 ) = Gl m ( M ) Gl m ( M 2 ). For any M Specm( s ) the ring M is a principal ideal domain (see [9]) and its field of fractions is ( s ). Two matrices T, T 2 m m are equivalent with respect to M if there exist matrices U, V Gl m ( M ) such that T 2 = U T V. Since M is a principal ideal domain, for all non-singular G M m m U, V Gl m ( M ) such that (see [0]) there exist matrices G = U Diag(α,..., α m )V (id0)

6 An Interpretation of Rosenbrock's Theorem Via Local Rings 5 with α α m ( stands for divisibility) monic polynomials factorizing in M, unique up to multiplication by units of M. The diagonal matrix is the Smith normal form of G with respect to M and α,..., α m are called the invariant factors of G with respect to M. Now we introduce the Smith McMillan form with respect to M. ssume that T m m is a non-singular rational matrix. Then T = G d with G M m m and d( s ) s monic, factorizing in M. Let G = U Diag(α,..., α m )V be the Smith normal form with respect to M of G, i.e., U, V invertible in M m m α α m monic polynomials factorizing in M. Then and T = U Diag( ( s) ψ,..., m ( s) )V (id) where i ( s) are irreducible rational functions, which are the result of dividing α i by d and canceling the common factors. They satisfy that m, ψ are monic polynomials factorizing in M. The diagonal matrix in ( ) is the Smith McMillan form with respect to M. The rational functions i( s), i =,..., m, are called the invariant rational functions of T with respect to M and constitute a complete system of invariants of the equivalence with respect to M for rational matrices. In particular, if M = Specm( s ) then Specm ( s ) ( s) = s, the matrices U, V Gl m ( s ) are unimodular matrices, ( ) is the global Smith McMillan form of a rational matrix (see [] or [] when = R or C) and i( s) are the global invariant rational functions of T. From now on rational matrices will be assumed to be non-singular unless the opposite is specified. Given any M Specm( s ) we say that an m m non-singular rational matrix has no zeros and no poles in M if its global invariant rational functions are units of M. If its global invariant rational functions factorize in M, the matrix has its global finite structure localized in M and we say that the matrix has all zeros and poles in M. The former means that T Gl m ( M ) and the latter that T Gl m ( Specm ( s ) M ( s)) because det T = det U det V ψ and det U, det V are non-zero constants. The ( s) m following result clarifies the relationship between the global finite structure of any rational matrix and its local structure with respect to any M Specm( s ). Proposition 2 Let M Specm( s ). Let T m m be non-singular with α ( s) β,..., global invariant rational functions and let ( s) ψ,..., α m β m its m ( s) be irreducible rational functions such that m, ψ are monic polynomials factorizing in M. The following properties are equivalent:

7 6 Linear Algebra There exist T L, T R m m such that the global invariant rational functions of T L are ( s) ψ,..., m ( s), T R Gl m ( M ) and T = T L T R. There exist matrices U, U 2 invertible in M m m such that T = U Diag( ( s) ψ,..., m ( s) )U 2, (id5) i.e., ( s) ψ,..., m ( s) are the invariant rational functions of T with respect to M. αi = i i ' and β i = ' with i ', ' s units of M, for i =,..., m. Proof.- 2. Since the global invariant rational functions of T L are there exist W, W 2 Gl m ( s ) such that T L = W Diag( ( s) ψ,..., ( s) ψ,..., m ( s), m ( s) )W 2. s Specm( s ) ( s) = s, by Remark., W, W 2 Gl m ( M ). Therefore, putting U = W and U 2 = W 2 T R it follows that U and U 2 are invertible in M m m T = U Diag( ( s) ψ,..., m ( s) )U There exist unimodular matrices V, V 2 s m m such that and T = V Diag( α ( s) β,..., α m β m )V 2 (id7) with α i ( s) β i irreducible rational functions such that α α m and β m β are monic polynomials. Write α i ( s) factorize in Specm( s ) M. Then β i = p ( i s) p ' i q i q i' such that p i ( s), q i factorize in M and p i ', q i ' T = V Diag( p ( s) q,..., p m q m )Diag( p ' q ',..., p ' m q ' )V m 2 (id8) with V and Diag( p ' q ',..., p ' m q m' )V 2 invertible in M m m. Since the Smith McMillan form with respect to M is unique we get that p i ( s) q i = i( s). 3. Write ( ) as

8 An Interpretation of Rosenbrock's Theorem Via Local Rings 7 T = V Diag( ( s) ψ,..., m ( s) )Diag( ' ψ ',..., m ' ψ ' )V m 2. (id9) It follows that T = T L T R with T L = V Diag( ( s) ψ,..., Diag( ' ψ ',..., ' m ' )V 2 Gl m ( M ). Corollary 3 Let T m m M M 2 =. If M i, i =, 2, then m 2 m 2 are the invariant rational functions of T with respect to M M 2. i,..., 2 ψ ψ 2,...,.08 Proof.- Let α ( s) β,..., m ( s) ) and T R = be non-singular and M, M 2 Specm( s ) such that m i i are the invariant rational functions of T with respect to α m β m be the global invariant rational functions of T. y Proposition, α i = i n i, β i = d i, with n i, d i s units of M. On the other hand α i = i 2 n i 2, β i = 2 d i 2, with n i 2, d i 2 s units of i n i = i 2 n i 2 or equivalently n i = i2 n i2 i, n 2 i = i n i i 2 M 2. So,. The polynomials i, i 2 are coprime because i factorizes in M, i 2 factorizes in M 2 and M M 2 =. In consequence i n i 2 and i 2 n i. Therefore, there exist polynomials a, unit of M 2, and a ', unit of M, such that n i 2 = i a, n i = i 2 a '. Since α i = i n i = i i 2 a ' and α i = i 2 n i 2 = i 2 i a. This implies that a = a ' unit of M M 2 = M M 2. Following the same ideas we can prove that β i = 2 b with b a unit of M M 2. y Proposition the invariant rational functions of T with respect to M M 2. 2 ψ ψ 2,..., m 2 m 2 are Corollary 4 Let M, M 2 Specm( s ). Two non-singular matrices are equivalent with respect to M M 2 if and only if they are equivalent with respect to M and with respect to M 2. Proof.- Notice that by Remark.2 two matrices T, T 2 m m are equivalent with respect to M M 2 if and only if there exist U, U 2 invertible in M m m M 2 m m such that T 2 = U T U 2. Since U and U 2 are invertible in both M m m M 2 m m then T and T 2 are equivalent with respect to M and with respect to M 2. Conversely, if T and T 2 are equivalent with respect to M and with respect to M 2 then, by the necessity of this result, they are equivalent with respect to M (M M 2 ), with re and

9 8 Linear Algebra spect to M 2 (M M 2 ) and with respect to M M 2. Let ψ,..., be the invariant rational functions of T and T 2 with respect to M (M M 2 ), m 2 ψ 2,..., m 2 2 be the invariant rational functions of T and T 2 with respect to M 2 (M M 2 ) and 3 ψ 3,..., m 3 3 be the invariant rational functions of T ( s) and T 2 with respect to M M 2. y Corollary ψ 2 ψ 2 3 ψ 3,..., m m 2 2 m 3 3 must be the invariant rational functions of T and T 2 with respect to M M 2. Therefore, T and T 2 are equivalent with respect to M M 2. Let pr be the ring of proper rational functions, that is, rational functions with the degree of the numerator at most the degree of the denominator. The units in this ring are the rational functions whose numerators and denominators have the same degree. They are called biproper rational functions. matrix B pr m m is said to be biproper if it is a unit in pr ( s) m m or, what is the same, if its determinant is a biproper rational function. Recall that a rational function t has a pole (zero) at if t( s ) has a pole (zero) at 0. Following this idea, we can define the local ring at as the set of rational functions, t, such that t( s ) does not have 0 as a pole, that is, = { t : t( s ) s }. If t = p q with p = a t s t + a t+ s t+ + + a p s p, a p 0, q = b r s r + b r+ s r+ + + b q s q, b q 0, p = d(p), q = d(q), where d( ) stands for degree of, then t( s ) = a t s t + a t+ s t+ + + a p s p b r s r + b r+ s r+ + + b q s q = a t s p-t + a t+ s p-t- + + a p b r s q-r + b r+ s q-r- + + b q s q- p = f g s q- p. (id22) s s = { f g s d : f (0) 0, g(0) 0 and d 0} {0}, then ( s) = { p q : d(q) d(p)}. (id23) Thus, this set is the ring of proper rational functions, pr. Two rational matrices T, T 2 m m are equivalent at infinity if there exist biproper matrices B, B 2 Gl m ( pr ) such that T 2 = B T B 2. Given a non-singular rational matrix T m m (see []) there always exist B, B 2 Gl m ( pr ) such that

10 An Interpretation of Rosenbrock's Theorem Via Local Rings 9 T = B Diag( s q,..., s q m) B2 (id24) where q q m are integers. They are called the invariant orders of T at infinity and the rational functions s q,..., s q m are called the invariant rational functions of T at infinity Structure of the ring of proper rational functions with prescribed finite poles Let M ' Specm( s ). ny non-zero rational function t can be uniquely written as t = n n ' d d ' where n d is an irreducible rational function factorizing in M ' and n ' d ' is a unit of M '. Define the following function over ( s ) { 0 } (see [], [2]): δ : ( s ) { 0 } Z t d( d ' ) - d ( n ' ). (id25) This mapping is not a discrete valuation of ( s ) if M ' : Given two non-zero elements t, t 2 it is clear that δ(t t 2 ) = δ(t ) + δ(t 2 ); but it may not satisfy that δ(t + t 2 ) min (δ(t ), δ(t 2 )). For example, let M ' = {(s - a) Specm(R s ) : a - 2, - }. Put t = s s +.5 and t 2 ( s) = s s +.5. We have that δ(t ) = d(s +.5) - d() =, δ(t 2 ) = d(s +.5) - d() = but δ(t + t 2 ) = δ(2) = 0. However, if M ' = and t = n d where n( s ), d ( s ) s, d 0, the map δ : Z { + } (id26) defined via δ (t) = d(d) - d(n) if t 0 and δ (t) = + if t = 0 is a discrete valuation of ( s ). Consider the subset of ( s ), M ' pr, consisting of all proper rational functions with poles in Specm( s ) M ', that is, the elements of M ' pr are proper rational functions whose denominators are coprime with all the polynomials π such that (π) M '. Notice that g M ' pr if and only if g = n n ' d ' where: (a)(b)(c) n( s ) s is a polynomial factorizing in M ',

11 0 Linear Algebra n ' d ' is an irreducible rational function and a unit of M ', δ(g) - d(n) 0 or equivalently δ (g) 0. In particular (c) implies that n ' d ' pr. The units in M ' pr are biproper rational functions n ' d ', that is d ( n ' ) = d ( d ' ), with n ', d ' factorizing in Specm( s ) M '. Furthermore, M ' pr is an integral domain whose field of fractions is ( s ) provided that M ' Specm( s ) (see, for example, Prop.5.22[]). Notice that for M ' = Specm( s ), M ' pr = s pr =. ssume that there are ideals in Specm( s ) M ' generated by linear polynomials and let (s - a) be any of them. The elements of M ' pr can be written as g = nu (s - a) d where n( s ) s factorizes in M ', u is a unit in M ' pr and d = δ(g) d(n). If is algebraically closed, for example = C, and M ' Specm( s ) the previous condition is always fulfilled. The divisibility in M ' pr is characterized in the following lemma. Lemma 5 Let M ' Specm( s ). Let g, g 2 M ' pr be such that g = n n ' d ' and g 2 = n 2 n ' 2 d 2' with n ( s), n 2 s factorizing in M ' and n ' d ', n ' 2 d 2' irreducible rational functions, units of M '. Then g divides g 2 in M ' pr if and only if n n 2 in s (id3) δ(g ) - d(n ) δ(g 2 ) - d(n 2 ). (id32) Proof.- If g g 2 then there exists g = n n ' d ' M ' pr, with n( s ) s factorizing in M ' and n ', d ' s coprime, factorizing in Specm( s ) M ', such that g 2 = gg. Equivalently, n 2 n ' 2 d 2' = n n ' d ' n ( s) n ' d ' = nn n ' n ' d ' d '. n 2 = nn and δ(g 2 ) - d(n 2 ) = δ(g) - d(n) + δ(g ) - d(n ). Moreover, as g is a proper rational function, δ(g) - d(n) 0 and δ(g 2 ) - d(n 2 ) δ(g ) - d(n ). Conversely, if n n 2 then there is n( s ) s, factorizing in M ', such that n 2 = nn. Write g = n n ' d ' where n ' d ' n 2' d ' d 2' n ', i.e., n ' and d ' = n ' 2 d ' So is an irreducible fraction representation of d 2' n ' after canceling possible common factors. Thus n 2 ' d 2' = n ' n ' d ' d '

12 An Interpretation of Rosenbrock's Theorem Via Local Rings δ(g) - d(n) = d( d ' ) - d ( n ' ) - d (n) = d(d 2 ' ) + d(n ' ) - d(n 2 ' ) - d(d ' ) - d(n 2 ) + d(n ) = δ(g 2 ) - d(n 2 ) - (δ(g ) - d(n )) 0. (id33) Then g M ' pr and g 2 = gg. Notice that condition ( ) means that g g 2 in M ' and condition ( ) means that g g 2 in pr. So, g g 2 in M ' pr if and only if g g 2 simultaneously in M ' and pr. Lemma 6 Let M ' Specm( s ). Let g, g 2 M ' pr be such that g = n n ' d ' and g 2 = n 2 n ' 2 d 2' as in Lemma. If n ( s) and n 2 are coprime in s and either δ(g ) = d(n ) or δ(g 2 ) = d(n 2 ) then g and g 2 are coprime in M ' pr. Proof.- Suppose that g and g 2 are not coprime. Then there exists a non-unit g = n n ' d ' M ' pr such that g g and g g 2. s g is not a unit, n is not a constant or δ(g) > 0. If n is not a constant then n n and n n 2 which is impossible because n and n 2 are coprime. Otherwise, if n is a constant then δ(g) > 0 and we have that δ(g) δ(g ) - d(n ) and δ(g) δ(g 2 ) - d(n 2 ). ut this is again impossible. It follows from this Lemma that if g, g 2 are coprime in both rings M ' and pr then g, g 2 are coprime in M ' pr. The following example shows that the converse is not true in general. Example 7 Suppose that = R and M ' = Specm(R s ) {( s 2 + )}. It is not difficult to prove that g = s 2 s 2 + and g 2 ( s) = s s 2 + there exists a non-unit g = n n ' are coprime elements in R M ' R pr. ssume that d ' R M ' R pr such that g g and g g 2. Then n s 2, n s and δ(g) - d(n) = 0. Since g is not a unit, n cannot be a constant. Hence, n = cs, c 0, and δ(g) =, but this is impossible because d ' and n ' are powers of s 2 +. Therefore g and g 2 must be coprime. However n = s 2 and n 2 = s are not coprime. Now, we have the following property when there are ideals in Specm( s ) M ', M ' Specm( s ), generated by linear polynomials. Lemma 8 Let M ' Specm( s ). ssume that there are ideals in Specm ( s ) M ' generated by linear polynomials and let (s - a) be any of them. Let g, g 2 M ' pr be such

13 2 Linear Algebra that g = n u and g (s - a) d 2 ( s) = n 2 u 2. If g (s - a) d 2 ( s) and g 2 are coprime in M ' pr then n and n 2 are coprime in s and either d = d(n ) or d 2 = d(n 2 ). Proof.- Suppose that n and n 2 are not coprime in s. Then there exists a non-constant n( s ) s such that n n and n n 2. Let d = d(n). Then g = n is not a (s - a) d unit in M ' pr and divides g and g 2 because 0 = d - d(n) d - d(n ) and 0 = d - d(n) d 2 - d(n 2 ). This is impossible, so n and n 2 must be coprime. Now suppose that d > d(n ) and d 2 > d(n 2 ). Let d = min {d - d(n ), d 2 - d(n 2 )}. We have that d > 0. Thus g = (s - a) d is not a unit in M ' pr and divides g and g 2 because d d - d(n ) and d d 2 - d(n 2 ). This is again impossible and either d = d(n ) or d 2 = d(n 2 ). The above lemmas yield a characterization of coprimeness of elements in M ' pr when M ' excludes at least one ideal generated by a linear polynomial. Following the same steps as in p. [2] and p. 27[] we get the following result. Lemma 9 Let M ' Specm( s ) and assume that there is at least an ideal in Specm( s ) M ' generated by a linear polynomial. Then M ' pr is a Euclidean domain. The following examples show that if all ideals generated by polynomials of degree one are in M ', the ring M ' pr may not be a ezout domain. Thus, it may not be a Euclidean domain. Even more, it may not be a greatest common divisor domain. Example 0 Let = R and M ' = Specm(R s ) {( s 2 + )}. Let s g = 2, g s ( s s) = R R s 2 + M ' pr. We have seen, in the previous example, that g, g 2 are coprime. We show now that the ezout identity is not fulfilled, that is, there are not a, b R M ' R pr such that ag + bg 2 = u, with u a unit in R M ' R pr. Elements in R M ' R pr are of the form n ( s 2 + ) d with n relatively prime with s 2 + and 2d d(n) and the units in R M ' R pr are non-zero constants. We will see that there are not elements a = n ( s 2 + ) d, b = n ' ( s 2 + ) d ' with n and n ' coprime with s 2 +, 2d d(n) and 2d ' d( n ' ) such that ag + bg 2 = c, with c nonzero constant. ssume that n ( s 2 + ) d s 2 s c( s 2 + ) d ' + is a multiple of s, which is impossible. n ' ( s 2 + ) d ' s s 2 + = c. We conclude that c ( s 2 + ) d + or

14 An Interpretation of Rosenbrock's Theorem Via Local Rings 3 Example Let = R and M ' = Specm(R s ) {( s 2 + )}. fraction g = g = n ( s 2 + ) d R M ' R pr if and only if 2d - d(n) 0. Let s 2 (, g s 2 + ) 3 2 = s (s + ) ( R s 2 + ) 4 M ' R pr. y Lemma : g g n s 2 and 0 2d - d(n) 6-2 = 4 g g 2 n s(s + ) and 0 2d - d(n) 8-2 = 6. If n s 2 and n s(s + ) then n = c or n = cs with c a non-zero constant. Then g g and g g 2 if and only if n = c and d 2 or n = cs and 2d 5. So, the list of common divisors of g and g 2 is: {c, c s 2 +, c ( s 2 + ) 2, cs s 2 +, cs ( s 2 + ) 2 : c, c 0 }. (id42) If there would be a greatest common divisor, say n ( s 2 + ) d, then n = cs because n must be a multiple of c and cs. Thus such a greatest common divisor should be either cs ( s 2 + ) 2, but c ( s 2 + ) 2 does not divide neither of them because c cs 4 = δ( ( s ) 2 + ) 2 - d(c) > max{δ( ) s d (cs), δ( Thus, g and g 2 do not have greatest common divisor. cs cs s 2 + or ( s 2 + ) 2 ) - d(cs)} = 3. (id43) 3.. Smith McMillan form matrix U is invertible in M ' m m pr m m if U M ' m m pr m m and its determinant is a unit in both rings, M ' and pr, i.e., U Gl m ( M ' pr ) if and only if U Gl m ( M ') Gl m ( pr ). Two matrices G, G 2 M ' m m pr m m are equivalent in M ' pr if there exist U, U 2 invertible in M ' m m pr m m such that G 2 = U G U 2. (id45) If there are ideals in Specm( s ) M ' generated by linear polynomials then M ' pr is an Euclidean ring and any matrix with elements in M ' pr admits a Smith normal form

15 4 Linear Algebra (see [0], [] or [2]). earing in mind the characterization of divisibility in M ' pr given in Lemma we have Theorem 2 (Smith normal form in M ' pr ) Let M ' Specm( s ). ssume that there are ideals in Specm( s ) M ' generated by linear polynomials and let (s - a) be one of them. Let G M ' m m pr m m be non-singular. Then there exist U, U 2 invertible in m m M ' pr m m such that G = U Diag(n (s - a) d,..., n m ( s) (s - a) d )U m 2 (id47) with n n m monic polynomials factorizing in M ' and d,..., d m integers such that 0 d - d(n ) d m - d(n m ). Under the hypothesis of the last theorem n,..., n (s - a) d m ( s) (s - a) d m form a complete system of invariants for the equivalence in M ' pr and are called the invariant rational functions of G in M ' pr. Notice that 0 d d m because n i divides n i+. Recall that the field of fractions of M ' pr is ( s ) when M ' Specm( s ). Thus we can talk about equivalence of matrix rational functions. Two rational matrices T, T 2 m m are equivalent in M ' pr if there are U, U 2 invertible in M ' m m pr m m such that T 2 = U T U 2. (id48) When all ideals generated by linear polynomials are not in M ', each rational matrix admits a reduction to Smith McMillan form with respect to M ' pr. Theorem 3 (Smith McMillan form in M ' pr ) Let M ' Specm( s ). ssume that there are ideals in Specm( s ) M ' generated by linear polynomials and let (s - a) be any of them. Let T m m be a non-singular matrix. Then there exist U, U 2 invertible in m m M ' pr m m such that T = U Diag( ( s) (s - a) n ψ,..., m ( s) (s - a) n m )U 2 (id50) (s - a) d (s - a) d m

16 An Interpretation of Rosenbrock's Theorem Via Local Rings 5 with i ( s) (s - a) n i, (s - a) d i M ' pr coprime for all i such that i, are monic polynomials factorizing in M ', for i = 2,..., m. i ( s) (s - a) n i divides i+ ( s) for i =,..., m - while divides (s - a) n i + (s - a) d i - (s - a) d i - i ( s) The elements (s - a) n i (s - a) d i of the diagonal matrix, satisfying the conditions of the previous theorem, constitute a complete system of invariant for the equivalence in M ' pr of rational matrices. However, this system of invariants is not minimal. smaller one can be obtained by substituting each pair of positive integers (n i, d i ) by its difference l i = n i - d i. Theorem 4 Under the conditions of Theorem, i ( s) (s - a) l i with i, monic and coprime polynomials factorizing in M ', i i+ while - and l,..., l m integers such that l + d(ψ ) - d( ) l m + d( ) - d( m ) also constitute a complete system of invariants for the equivalence in M ' pr. Proof.- We only have to show that from the system conditions of Theorem, the system i ( s) (s - a) n i i ( s) (s - a) l i, i =,..., m, satisfying the, i =,..., n, can be constructed satisfying the conditions of Theorem. (s - a) d i Suppose that i, are monic and coprime polynomials factorizing in M ' such that i ( s) i+ and -. nd suppose also that l,..., l m are integers such that l + d(ψ ) - d( ) l m + d( ) - d( m ). If l i + d( ) - d( i ) 0 for all i, we define non-negative integers n i = d( i ) and d i = d( i ) - l i for i =,..., m. If l i + d( ) - d( i ) > 0 for all i, we define n i = l i + d( ) and d i = d( ). Otherwise there is an index k {2,..., m} such that l k - + d(ψ k - ) - d( k - ) 0 < l k + d(ψ k ) - d( k ). (id52) Define now the non-negative integers n i, d i as follows: n i = { d( i ( s)) l i + d( ) if i < k if i k d i = { d( i ( s)) - l i d( ) if i < k if i k (id53) Notice that l i = n i - d i. Moreover,

17 6 Linear Algebra n i - d( i ) = { 0 l i + d( ) - d( i ) if i < k if i k (id54) d i - d( ) = { -l i - d( ( s)) + d( i ) if i < k 0 if i k (id55) and using ( ), ( ) n - d( ) = = n k - - d( k - ) = 0 < n k - d( k ) n m - d( m ) (id56) d - d(ψ ) d k - - d(ψ k - ) 0 = d k - d(ψ k ) = = d m - d( ). (id57) In any case i ( s) (s - a) n i and (s - a) d i are elements of M ' pr. Now, on the one hand i, are coprime and n i - d( i ) = 0 or d i - d( ) = 0. This means (Lemma ) that i ( s) (s - a) n i, (s - a) d i are coprime for all i. On the other hand i i+ and 0 n i - d( i ) n i+ - d( i+ ). Then (Lemma ) i ( s) (s - a) n i divides i+ ( s) 0 d i - d( ) d i- - d(- ), it follows that We call i( s) (s - a) n i +. Similarly, since ( s) - and (s - a) d i divides - (s - a) d i -. (s - a) l i, i =,..., m, the invariant rational functions of T in M ' pr. There is a particular case worth considering: If M ' = then pr = pr and Specm( s ) M ' = Specm( s ). In this case, we obtain the invariant rational functions of T at infinity (recall ( )). 4. Wiener Hopf equivalence The left Wiener Hopf equivalence of rational matrices with respect to a closed contour in the complex plane has been extensively studied ([5] or [6]). Now we present the generalization to arbitrary fields ([3]). Definition 5 Let M and M ' be subsets of Specm( s ) such that M M ' = Specm( s ). Let T, T 2 m m be two non-singular rational matrices with no zeros and no poles in M M '. The matrices T, T 2 are said to be left Wiener Hopf equivalent with respect to ( M, M ') if there exist both U invertible in M ' m m pr m m and U 2 invertible in M ( s) m m such that

18 An Interpretation of Rosenbrock's Theorem Via Local Rings 7 T 2 = U T U 2. (id59) This is, in fact, an equivalence relation as it is easily seen. It would be an equivalence relation even if no condition about the union and intersection of M and M ' were imposed. It will be seen later on that these conditions are natural assumptions for the existence of unique diagonal representatives in each class. The right Wiener Hopf equivalence with respect to ( M, M ') is defined in a similar manner: There are invertible matrices U in M ' m m pr m m and U 2 in M m m such that T 2 = U 2 T U. (id60) In the following only the left Wiener Hopf equivalence will be considered, but, by transposition, all results hold for the right Wiener Hopf equivalence as well. The aim of this section is to obtain a complete system of invariants for the Wiener Hopf equivalence with respect to ( M, M ') of rational matrices, and to obtain, if possible, a canonical form. There is a particular case that is worth-considering: If M = Specm( s ) and M ' =, the invertible matrices in m m pr m m are the biproper matrices and the invertible matrices in Specm ( s ) ( s) m m are the unimodular matrices. In this case, the left Wiener Hopf equivalence with respect to ( M, M ') = ( Specm ( s ), ) is the so-called left Wiener Hopf equivalence at infinity (see [4]). It is known that any non-singular rational matrix is left Wiener Hopf equivalent at infinity to a diagonal matrix Diag( s g,..., s g m) where g,..., g m are integers, that is, for any non-singular T m m there exist both a biproper matrix B Gl m ( pr ) and a unimodular matrix U Gl m ( s ) such that T = BDiag( s g,..., s g m) U (id6) where g g m are integers uniquely determined by T. They are called the left Wiener Hopf factorization indices at infinity and form a complete system of invariants for the left Wiener Hopf equivalence at infinity. These are the basic objects that will produce the complete system of invariants for the left Wiener Hopf equivalence with respect to ( M, M '). For polynomial matrices, their left Wiener Hopf factorization indices at infinity are the column degrees of any right equivalent (by a unimodular matrix) column proper matrix. Namely, a polynomial matrix is column proper if it can be written as P c Diag( s g,..., s g m) + L with P c m m non-singular, g,..., g m non-negative integers and L a polynomial matrix such that the degree of the ith column of L smaller than g i, i m. Let P s m m be non-singular polynomial. There exists a unimodular matrix

19 8 Linear Algebra V s m m such that PV is column proper. The column degrees of PV are uniquely determined by P, although V is not (see [4], p. 388[5], [6]). Since PV is column proper, it can be written as PV = P c D + L with P c non-singular, D = Diag( s g,..., s g m) and the degree of the ith column of L smaller than g i, i m. Then PV = (P c + L D - )D. Put B = P c + L D -. Since P c is non-singular and L D - is a strictly proper matrix, B is biproper, and P = BDU where U = V -. The left Wiener Hopf factorization indices at infinity can be used to associate a sequence of integers with every non-singular rational matrix and every M Specm( s ). This is done as follows: If T m m then it can always be written as T = T L T R such that the global invariant rational functions of T L factorize in M and T R Gl m ( M ) or, equivalently, the global invariant rational functions of T R factorize in Specm( s ) M (see Proposition ). There may be many factorizations of this type, but it turns out (see Proposition 3.2[4] for the polynomial case) that the left factors in all of them are right equivalent. This means that if T = T L T R = T L 2 T R2 with the global invariant rational functions of T L and T L 2 factorizing in M and the global invariant rational functions of T R and T R2 factorizing in Specm( s ) M then there is a unimodular matrix U such that T L = T L 2 U. In particular, T L and T L 2 have the same left Wiener Hopf factorization indices at infinity. Thus the following definition makes sense: Definition 6 Let T m m be a non-singular rational matrix and M Specm( s ). Let T L, T R m m such that i)ii)iii) T = T L T R, the global invariant rational functions of T L factorize in M, and the global invariant rational functions of T R factorize in Specm( s ) M. Then the left Wiener Hopf factorization indices of T with respect to M are defined to be the left Wiener Hopf factorization indices of T L at infinity. In the particular case that M = Specm( s ), we can put TL = T and T R = I m. Therefore, the left Wiener Hopf factorization indices of T with respect to Specm( s ) are the left Wiener Hopf factorization indices of T at infinity. We prove now that the left Wiener Hopf equivalence with respect to ( M, M ') can be characterized through the left Wiener Hopf factorization indices with respect to M. Theorem 7 Let M, M ' Specm( s ) be such that M M ' = Specm( s ). Let T, T 2 m m be two non-singular rational matrices with no zeros and no poles in M M '.

20 An Interpretation of Rosenbrock's Theorem Via Local Rings 9 The matrices T and T 2 are left Wiener Hopf equivalent with respect to ( M, M ') if and only if T and T 2 have the same left Wiener Hopf factorization indices with respect to M. Proof.- y Proposition we can write T = T L T R, T 2 = T L 2 T R2 with the global invariant rational functions of T L and of T L 2 factorizing in M M ' (recall that T and T 2 have no zeros and no poles in M M ' ) and the global invariant rational functions of T R and of T R2 factorizing in M ' M. ssume that T, T 2 have the same left Wiener Hopf factorization indices with respect to M. y definition, T and T 2 have the same left Wiener Hopf factorization indices with respect to M if T L and T L 2 have the same left Wiener Hopf factorization indices at infinity. This means that there exist matrices B Gl m ( pr ) and U Gl m ( s ) such that T L 2 = BT L U. We have that T 2 = T L 2 T R2 = BT L U T R2 = BT (T R - U T R2 ). We aim to prove that B = T L 2 U - T L - is invertible in M ' m m and T R - U T R2 Gl m ( M ). Since the global invariant rational functions of T L 2 and T L factorize in M M ', T L 2, T L M ' m m det B is a unit in M ' m m and B M ' m m. Moreover, as desired. Now, T R - U T R2 Gl m ( M ) because T R, T R2 M m m and det T R and det T R2 factorize in M ' M. Therefore T and T 2 are left Wiener Hopf equivalent with respect to ( M, M '). Conversely, let U Gl m ( M ') Gl m ( pr ) and U 2 Gl m ( M ) such that T = U T 2 U 2. Hence, T = T L T R = U T L 2 T R2 U 2. Put T L 2 ( s) = U T L 2 and T R2 ( s) = T R2 U 2. Therefore, (i)(ii)(iii) T = T L T R = T L 2 ( s)t R2 ( s), the global invariant rational functions of T L and of T L 2 ( s) factorize in M, and the global invariant rational functions of T R and of T R2 ( s) factorize in Specm( s ) M. Then T L and T L 2 ( s) are right equivalent (see the remark previous to Definition ). So, there exists U Gl m ( s ) such that T L = T L 2 ( s)u. Thus, T L = U T L 2 U. Since U is biproper and U is unimodular T L, T L 2 have the same left Wiener Hopf factorization indices at infinity. Consequentially, T and T 2 have the same left Wiener Hopf factorization indices with respect to M. In conclusion, for non-singular rational matrices with no zeros and no poles in M M ' the left Wiener Hopf factorization indices with respect to M form a complete system of invari

21 20 Linear Algebra ants for the left Wiener Hopf equivalence with respect to ( M, M ') with M M ' = Specm( s ). straightforward consequence of the above theorem is the following Corollary Corollary 8 Let M, M ' Specm( s ) be such that M M ' = Specm( s ). Let T, T 2 m m be non-singular with no zeros and no poles in M M '. Then T and T 2 are left Wiener Hopf equivalent with respect to ( M, M ') if and only if for any factorizations T = T L T R and T 2 = T L 2 T R2 satisfying the conditions (i) (iii) of Definition, T L and T L 2 are left Wiener Hopf equivalent at infinity. Next we deal with the problem of factorizing or reducing a rational matrix to diagonal form by Wiener Hopf equivalence. It will be shown that if there exists in M an ideal generated by a monic irreducible polynomial of degree equal to which is not in M ', then any non-singular rational matrix, with no zeros and no poles in M M ' admits a factorization with respect to ( M, M '). fterwards, some examples will be given in which these conditions on M and M ' are removed and factorization fails to exist. Theorem 9 Let M, M ' Specm( s ) be such that M M ' = Specm( s ). ssume that there are ideals in M M ' generated by linear polynomials. Let (s - a) be any of them and T m m a non-singular matrix with no zeros and no poles in M M '. There exist both U invertible in M ' m m pr m m and U 2 invertible in M m m such that T = U Diag( ( s - a) k,..., (s - a) k m) U2, (id72) where k k m are integers uniquely determined by T. Moreover, they are the left Wiener Hopf factorization indices of T with respect to M. Proof.- The matrix T can be written (see Proposition ) as T = T L T R with the global invariant rational functions of T L factorizing in M M ' and the global invariant rational functions of T R factorizing in Specm( s ) M = M ' M. s k,..., k m are the left Wiener Hopf factorization indices of T L at infinity, there exist matrices U Gl m ( s ) and B Gl m ( pr ) such that T L = BD U with D = Diag( s k,..., s k m). Put D = Diag( ( s - a) k,..., (s - a) k s m) and U = BDiag( k k,..., s m ). Then (s - a) k (s - a) k m T L = U DU. If U 2 = U T R then this matrix is invertible in M m m and T = U Diag( ( s - a) k,..., (s - a) k m) U2. We only have to prove that U is invertible in M ' m m pr m m. It is clear that U is in pr m m and biproper. Moreover, the global invariant rational functions of T L U = T L (DU ) - factorize in M M '. Therefore, U is invertible in M ' m m.

22 An Interpretation of Rosenbrock's Theorem Via Local Rings 2 We prove now the uniqueness of the factorization. ssume that T also factorizes as T = Ũ Diag( ( s - a) k,..., (s - a) k m) Ũ 2, (id73) with k k m integers. Then, Diag( ( s - a) k,..., (s - a) k m) = Ũ - U Diag( ( s - a) k,..., (s - a) k m) U2 Ũ 2 -. (id74) The diagonal matrices have no zeros and no poles in M M ' (because (s - a) M M ' ) and they are left Wiener Hopf equivalent with respect to ( M, M '). y Theorem, they have the same left Wiener Hopf factorization indices with respect to M. Thus, k i = k i for all i =,..., m. Following [5] we could call left Wiener Hopf factorization indices with respect to ( M, M ') the exponents k k m appearing in the diagonal matrix of Theorem. They are, actually, the left Wiener Hopf factorization indices with respect to M. Several examples follow that exhibit some remarkable features about the results that have been proved so far. The first two examples show that if no assumption is made on the intersection and/or union of M and M ' then existence and/or uniqueness of diagonal factorization may fail to exist. Example 20 If P is a polynomial matrix with zeros in M M ' then the existence of invertible matrices U Gl m ( M ') Gl m ( pr ) and U 2 Gl m ( M ) such that P = U Diag( ( s - a) k,..., (s - a) k m) U2 with (s - a) M M ' may fail. In fact, suppose that M = {, (s + )}, M ' = Specm s {}. Therefore, M M ' = {(s + )} and M M '. Consider p = s +. ssume that s + = u s k u 2 with u a unit in M ' pr and u 2 a unit in M. Thus, u = c a nonzero constant and u 2 = c M ( s). s + s k which is not a unit in Example 2 If M M ' Specm s then the factorization indices with respect to ( M, M ') may be not unique. Suppose that (β) M M ', (π) M M ' with d(π) = and p = u π k u 2, with u a unit in M ' pr and u 2 a unit in M. Then p can also be factorized as p = ũ π k -d (β) ũ 2 with ũ = u π d (β) β a unit in M ' pr and ũ 2 = βu 2 a unit in M. The following example shows that if all ideals generated by polynomials of degree equal to one are in M ' M then a factorization as in Theorem may not exist.

23 22 Linear Algebra Example 22 Suppose that = R. Consider M = {( s 2 + )} Specm (R s ) and M ' = Specm(R s ) {( s 2 + )}. Let P = s 0 -s 2 ( s 2 + ) 2. (id78) Notice that P has no zeros and no poles in M M ' =. We will see that it is not possible to find invertible matrices U R M ' 2 2 R pr 2 2 and U 2 R M 2 2 such that U PU 2 = Diag( ( p / q) c, (p / q) c 2). (id79) We can write p q = u( s 2 + ) a with u a unit in R M and a Z. Therefore, Diag( ( p / q) c, (p / q) c 2) = Diag (( s 2 + ) ac, ( s 2 + ) ac 2) Diag ( u c, u c 2). (id80) Diag( u c, u c 2) is invertible in R M 2 2 and P is also left Wiener Hopf equivalent with respect to ( M, M ') to the diagonal matrix Diag(( s 2 + ) ac, ( s 2 + ) ac 2). ssume that there exist invertible matrices U R M ' 2 2 R pr 2 2 and U 2 R M 2 2 such that U PU 2 = Diag(( s 2 + ) d, ( s 2 + ) d 2), with d d 2 integers. Notice first that det U is a nonzero constant and since det P = s( s 2 + ) 2 and det U 2 is a rational function with numerator and denominator relatively prime with s 2 +, it follows that cs( s 2 + ) 2 det U 2 = ( s 2 + ) d +d 2. Thus, d + d 2 = 2. Let U - = b b 2 b 2 b 22, U 2 ( s) = u u 2 u 2 u 22. (id8) From PU 2 = U - Diag(( s 2 + ) d, ( s 2 + ) d 2) we get su = b ( s 2 + ) d, (id82) -s 2 u + ( s 2 + ) 2 u 2 = b 2 ( s 2 + ) d, (id83) su 2 = b 2 ( s 2 + ) d 2, (id84)

24 An Interpretation of Rosenbrock's Theorem Via Local Rings s 2 u 2 + ( s 2 + ) 2 u 22 = b 22 ( s 2 + ) d 2. (id85) s u R M and b R M ' R pr, we can write u = f ( s) g and b = h ( s 2 + ) q with f, g, h R s, gcd (g, s 2 + ) = and d(h ) 2q. Therefore, by ( ), s f ( s) g = h ( s 2 + ) q ( s 2 + ) d. Hence, u = f or u = f ( s) s. In the same way and using ( ), u 2 = f 2 or u 2 = f ( 2 s) s with f 2 a polynomial. Moreover, by ( ), d 2 must be non-negative. Hence, d d 2 0. Using now ( ) and ( ) and bearing in mind again that u 2, u 22 R M and b 2, b 22 R M ' R pr, we conclude that u 2 and u 22 are polynomials. We can distinguish two cases: d = 2, d 2 = 0 and d = d 2 =. If d = 2 and d 2 = 0, by ( ), b 2 is a polynomial and since b 2 is proper, it is constant: b 2 = c. Thus u 2 = c s. y ( ), b 22 = - c s + ( s 2 + ) 2 u 22. Since u 22 is polynomial and b 22 is proper, b 22 is also constant and then u 22 = 0 and c = 0. Consequentially, b 22 = 0, and b 2 = 0. This is impossible because U is invertible. If d = d 2 = then, using ( ), b 2 = -s 2 u + ( s 2 + ) 2 u 2 -s b 2 ( s) ( s s 2 + ) + ( s 2 + ) 2 u 2 s 2 = + s 2 + h = -sb + ( s 2 + ) u2 = - s ( s 2 + ) q + ( s 2 + ) u2 (id86) = -sh + ( s 2 + ) q + u 2 ( s 2 + ) q. Notice that d( - sh ) + 2q and d(( s 2 + ) q + u 2 ) = 2(q + ) + d(u 2 ) 2q + 2 unless u 2 = 0. Hence, if u 2 0, d( - sh + ( s 2 + ) q + u 2 ) 2q + 2 which is greater than d(( s 2 + ) q ) = 2q. This cannot happen because b 2 is proper. Thus, u 2 = 0. In the same way and reasoning with ( ) we get that u 22 is also zero. This is again impossible because U 2 is invertible. Therefore no left Wiener Hopf factorization of P with respect to ( M, M ') exits. We end this section with an example where the left Wiener Hopf factorization indices of the matrix polynomial in the previous example are computed. Then an ideal generated by a pol

25 24 Linear Algebra ynomial of degree is added to M and the Wiener Hopf factorization indices of the same matrix are obtained in two different cases. Example 23 Let = R and M = {( s 2 + )}. Consider the matrix P = s 0 -s 2 ( s 2 + ) 2, (id88) which has a zero at 0. It can be written as P = P P 2 with P = 0 -s ( s 2 + ) 2, P 2 ( s) = s 0 0, (id89) where the global invariant factors of P are powers of s 2 + and the global invariant factors of P 2 are relatively prime with s 2 +. Moreover, the left Wiener Hopf factorization indices of P at infinity are 3, (add the first column multiplied by s 3 + 2s to the second column; the result is a column proper matrix with column degrees and 3). Therefore, the left Wiener Hopf factorization indices of P with respect to M are 3,. Consider now M = {( s 2 + ), } and M ' = Specm(R s ) M. There is a unimodular matrix U = s 2 + 2, invertible in R 0 M 2 2, such that PU = with column degrees 3 and 2. We can write s s 3 + 2s -s 2 is column proper PU = 0-0 s s 3 + s 2s 0 = B s s 3, (id90) where B is the following biproper matrix B = s 2s 0 s s -3 = s - s s 2 s 3. (id9) Moreover, the denominators of its entries are powers of s and det B = ( s 2 + ) 2. Therefore, B is invertible in R M ' 2 2 R pr 2 2. Since B - PU = Diag( s 2, s 3 ), the left Wiener Hopf factorization indices of P with respect to M are 3, 2. If M = {( s 2 + ), (s - )}, for example, a similar procedure shows that P has 3, as left Wiener Hopf factorization indices with respect to M ; the same indices as with respect to M. The s 4

26 An Interpretation of Rosenbrock's Theorem Via Local Rings 25 reason is that s - is not a divisor of det P and so P = P P 2 with P and P 2 as in ( ) and P factorizing in M. Remark 24 It must be noticed that a procedure has been given to compute, at least theoretically, the left Wiener Hopf factorization indices of any rational matrix with respect to any subset M of Specm( s ). In fact, given a rational matrix T and M, write T = T L T R with the global invariant rational functions of T L factorizing in M, and the global invariant rational functions of T R factorizing in Specm( s ) M (for example, using the global Smith McMillan form of T ). We need to compute the left Wiener Hopf factorization indices at infinity of the rational matrix T L. The idea is as follows: Let d be the monic least common denominator of all the elements of T L. The matrix T L can be written as T L = P d, with P polynomial. The left Wiener Hopf factorization indices of P at infinity are the column degrees of any column proper matrix right equivalent to P. If k,..., k m are the left Wiener Hopf factorization indices at infinity of P then k + d,..., k m + d are the left Wiener Hopf factorization indices of T L, where d = d(d) (see [4]). Free and commercial software exists that compute such column degrees. 5. Rosenbrock's Theorem via local rings s said in the Introduction, Rosenbrock's Theorem ([]) on pole assignment by state feedback provides, in its polynomial formulation, a complete characterization of the relationship between the invariant factors and the left Wiener Hopf factorization indices at infinity of any non-singular matrix polynomial. The precise statement of this result is the following theorem: Theorem 25 Let g g m and α α m be non-negative integers and monic polynomials, respectively. Then there exists a non-singular matrix P s m m with α,..., α m as invariant factors and g,..., g m as left Wiener Hopf factorization indices at infinity if and only if the following relation holds: (g,..., g m ) (d(α m ),..., d(α )). (id94) Symbol appearing in ( ) is the majorization symbol (see [7]) and it is defined as follows: If (a,..., a m ) and (b,..., b m ) are two finite sequences of real numbers and a a m and b b m are the given sequences arranged in non-increasing order then (a,..., a m ) (b,..., b m ) if j a i= i j b, j m - i (id95) i=

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

More information

SMITH MCMILLAN FORMS

SMITH MCMILLAN FORMS Appendix B SMITH MCMILLAN FORMS B. Introduction Smith McMillan forms correspond to the underlying structures of natural MIMO transfer-function matrices. The key ideas are summarized below. B.2 Polynomial

More information

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc. 1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a

More information

Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field

Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Complexity, Article ID 6235649, 9 pages https://doi.org/10.1155/2018/6235649 Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Jinwang Liu, Dongmei

More information

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going

More information

Math 121 Homework 5: Notes on Selected Problems

Math 121 Homework 5: Notes on Selected Problems Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements

More information

Finite and Infinite Elementary Divisors of Matrix Polynomials: A Global Approach. Zaballa, Ion and Tisseur, Francoise. MIMS EPrint: 2012.

Finite and Infinite Elementary Divisors of Matrix Polynomials: A Global Approach. Zaballa, Ion and Tisseur, Francoise. MIMS EPrint: 2012. Finite and Infinite Elementary Divisors of Matrix Polynomials: A Global Approach Zaballa, Ion and Tisseur, Francoise 2012 MIMS EPrint: 201278 Manchester Institute for Mathematical Sciences School of Mathematics

More information

g(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.

g(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series. 6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral

More information

Chapter 5: The Integers

Chapter 5: The Integers c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)

More information

A connection between number theory and linear algebra

A connection between number theory and linear algebra A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.

More information

Algebra Homework, Edition 2 9 September 2010

Algebra Homework, Edition 2 9 September 2010 Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

More information

4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups 4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

More information

Solutions of exercise sheet 8

Solutions of exercise sheet 8 D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

More information

DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS

DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS H.L. TRENTELMAN AND S.V. GOTTIMUKKALA Abstract. In this paper we study notions of distance between behaviors of linear differential systems. We introduce

More information

Factorization in Polynomial Rings

Factorization in Polynomial Rings Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,

More information

32 Divisibility Theory in Integral Domains

32 Divisibility Theory in Integral Domains 3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible

More information

1. Factorization Divisibility in Z.

1. Factorization Divisibility in Z. 8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

MTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1

MTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1 MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use

More information

Introduction Non-uniqueness of factorization in A[x]... 66

Introduction Non-uniqueness of factorization in A[x]... 66 Abstract In this work, we study the factorization in A[x], where A is an Artinian local principal ideal ring (briefly SPIR), whose maximal ideal, (t), has nilpotency h: this is not a Unique Factorization

More information

Part IX. Factorization

Part IX. Factorization IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect

More information

Factorization of integer-valued polynomials with square-free denominator

Factorization of integer-valued polynomials with square-free denominator accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday

More information

9. Integral Ring Extensions

9. Integral Ring Extensions 80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications

More information

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

More information

Example: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)

Example: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x) Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative

More information

Algebraic function fields

Algebraic function fields Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which

More information

2. THE EUCLIDEAN ALGORITHM More ring essentials

2. THE EUCLIDEAN ALGORITHM More ring essentials 2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there

More information

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d

(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers

More information

M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium

M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium MATRIX RATIONAL INTERPOLATION WITH POLES AS INTERPOLATION POINTS M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium B. BECKERMANN Institut für Angewandte

More information

Splitting sets and weakly Matlis domains

Splitting sets and weakly Matlis domains Commutative Algebra and Applications, 1 8 de Gruyter 2009 Splitting sets and weakly Matlis domains D. D. Anderson and Muhammad Zafrullah Abstract. An integral domain D is weakly Matlis if the intersection

More information

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization. ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary

More information

Refined Inertia of Matrix Patterns

Refined Inertia of Matrix Patterns Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even. 1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and

More information

Chapter 14: Divisibility and factorization

Chapter 14: Divisibility and factorization Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter

More information

0.1 Rational Canonical Forms

0.1 Rational Canonical Forms We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best

More information

RINGS: SUMMARY OF MATERIAL

RINGS: SUMMARY OF MATERIAL RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered

More information

Triangularizing matrix polynomials. Taslaman, Leo and Tisseur, Francoise and Zaballa, Ion. MIMS EPrint:

Triangularizing matrix polynomials. Taslaman, Leo and Tisseur, Francoise and Zaballa, Ion. MIMS EPrint: Triangularizing matrix polynomials Taslaman, Leo and Tisseur, Francoise and Zaballa, Ion 2012 MIMS EPrint: 2012.77 Manchester Institute for Mathematical Sciences School of Mathematics The University of

More information

Infinite elementary divisor structure-preserving transformations for polynomial matrices

Infinite elementary divisor structure-preserving transformations for polynomial matrices Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki

More information

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12 MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f

More information

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence

More information

In Theorem 2.2.4, we generalized a result about field extensions to rings. Here is another variation.

In Theorem 2.2.4, we generalized a result about field extensions to rings. Here is another variation. Chapter 3 Valuation Rings The results of this chapter come into play when analyzing the behavior of a rational function defined in the neighborhood of a point on an algebraic curve. 3.1 Extension Theorems

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

TC10 / 3. Finite fields S. Xambó

TC10 / 3. Finite fields S. Xambó TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the

More information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

More information

5: The Integers (An introduction to Number Theory)

5: The Integers (An introduction to Number Theory) c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset

More information

Polynomials, Ideals, and Gröbner Bases

Polynomials, Ideals, and Gröbner Bases Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

AP-DOMAINS AND UNIQUE FACTORIZATION

AP-DOMAINS AND UNIQUE FACTORIZATION AP-DOMAINS AND UNIQUE FACTORIZATION JIM COYKENDALL AND MUHAMMAD ZAFRULLAH Abstract. In this paper we generalize the standard notion of unique factorization domains (UFDs) to the the nonatomic situation.

More information

HILBERT l-class FIELD TOWERS OF. Hwanyup Jung

HILBERT l-class FIELD TOWERS OF. Hwanyup Jung Korean J. Math. 20 (2012), No. 4, pp. 477 483 http://dx.doi.org/10.11568/kjm.2012.20.4.477 HILBERT l-class FIELD TOWERS OF IMAGINARY l-cyclic FUNCTION FIELDS Hwanyup Jung Abstract. In this paper we study

More information

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism 1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty

More information

Lecture 7.5: Euclidean domains and algebraic integers

Lecture 7.5: Euclidean domains and algebraic integers Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley

More information

However another possibility is

However another possibility is 19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b

More information

2. Intersection Multiplicities

2. Intersection Multiplicities 2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.

More information

120A LECTURE OUTLINES

120A LECTURE OUTLINES 120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication

More information

Skew-Symmetric Matrix Polynomials and their Smith Forms

Skew-Symmetric Matrix Polynomials and their Smith Forms Skew-Symmetric Matrix Polynomials and their Smith Forms D. Steven Mackey Niloufer Mackey Christian Mehl Volker Mehrmann March 23, 2013 Abstract Two canonical forms for skew-symmetric matrix polynomials

More information

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.

More information

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R. Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

More information

Places of Number Fields and Function Fields MATH 681, Spring 2018

Places of Number Fields and Function Fields MATH 681, Spring 2018 Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote

More information

5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting 5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

More information

Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:

Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:

More information

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations. POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems

More information

JORDAN AND RATIONAL CANONICAL FORMS

JORDAN AND RATIONAL CANONICAL FORMS JORDAN AND RATIONAL CANONICAL FORMS MATH 551 Throughout this note, let V be a n-dimensional vector space over a field k, and let φ: V V be a linear map Let B = {e 1,, e n } be a basis for V, and let A

More information

Representations and Linear Actions

Representations and Linear Actions Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category

More information

CHAPTER 10: POLYNOMIALS (DRAFT)

CHAPTER 10: POLYNOMIALS (DRAFT) CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously

More information

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings. i=0. i=0. n+m. i=0. k=0 Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

More information

Simplifying Rational Expressions and Functions

Simplifying Rational Expressions and Functions Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written

More information

18. Cyclotomic polynomials II

18. Cyclotomic polynomials II 18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients

More information

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

More information

(Rgs) Rings Math 683L (Summer 2003)

(Rgs) Rings Math 683L (Summer 2003) (Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that

More information

GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

More information

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,900 116,000 120M Open access books available International authors and editors Downloads Our

More information

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998 CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic

More information

Linearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition

Linearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition Linearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition Kyle Curlett Maribel Bueno Cachadina, Advisor March, 2012 Department of Mathematics Abstract Strong linearizations of a matrix

More information

Finitely Generated Modules over a PID, I

Finitely Generated Modules over a PID, I Finitely Generated Modules over a PID, I A will throughout be a fixed PID. We will develop the structure theory for finitely generated A-modules. Lemma 1 Any submodule M F of a free A-module is itself

More information

FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS

FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic

More information

ALGEBRAIC GROUPS J. WARNER

ALGEBRAIC GROUPS J. WARNER ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic

More information

Exercises for algebraic curves

Exercises for algebraic curves Exercises for algebraic curves Christophe Ritzenthaler February 18, 2019 1 Exercise Lecture 1 1.1 Exercise Show that V = {(x, y) C 2 s.t. y = sin x} is not an algebraic set. Solutions. Let us assume that

More information

Robust Control 2 Controllability, Observability & Transfer Functions

Robust Control 2 Controllability, Observability & Transfer Functions Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable

More information

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques

More information

On Siegel s lemma outside of a union of varieties. Lenny Fukshansky Claremont McKenna College & IHES

On Siegel s lemma outside of a union of varieties. Lenny Fukshansky Claremont McKenna College & IHES On Siegel s lemma outside of a union of varieties Lenny Fukshansky Claremont McKenna College & IHES Universität Magdeburg November 9, 2010 1 Thue and Siegel Let Ax = 0 (1) be an M N linear system of rank

More information

Linear and Bilinear Algebra (2WF04) Jan Draisma

Linear and Bilinear Algebra (2WF04) Jan Draisma Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 3 The minimal polynomial and nilpotent maps 3.1. Minimal polynomial Throughout this chapter, V is a finite-dimensional vector space of dimension

More information

2. Prime and Maximal Ideals

2. Prime and Maximal Ideals 18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let

More information

Mathematics for Cryptography

Mathematics for Cryptography Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

More information

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3... Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2

More information

1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields 1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative

More information

Representations. 1 Basic definitions

Representations. 1 Basic definitions Representations 1 Basic definitions If V is a k-vector space, we denote by Aut V the group of k-linear isomorphisms F : V V and by End V the k-vector space of k-linear maps F : V V. Thus, if V = k n, then

More information

Citation for published version (APA): Ruíz Duarte, E. An invitation to algebraic number theory and class field theory

Citation for published version (APA): Ruíz Duarte, E. An invitation to algebraic number theory and class field theory University of Groningen An invitation to algebraic number theory and class field theory Ruíz Duarte, Eduardo IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013 As usual, all the rings we consider are commutative rings with an identity element. 18.1 Regular local rings Consider a local

More information

Jordan Structures of Alternating Matrix Polynomials

Jordan Structures of Alternating Matrix Polynomials Jordan Structures of Alternating Matrix Polynomials D. Steven Mackey Niloufer Mackey Christian Mehl Volker Mehrmann August 17, 2009 Abstract Alternating matrix polynomials, that is, polynomials whose coefficients

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

More information

Public-key Cryptography: Theory and Practice

Public-key Cryptography: Theory and Practice Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

Algebraic Number Theory and Representation Theory

Algebraic Number Theory and Representation Theory Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number

More information

Multivariable Control. Lecture 05. Multivariable Poles and Zeros. John T. Wen. September 14, 2006

Multivariable Control. Lecture 05. Multivariable Poles and Zeros. John T. Wen. September 14, 2006 Multivariable Control Lecture 05 Multivariable Poles and Zeros John T. Wen September 4, 2006 SISO poles/zeros SISO transfer function: G(s) = n(s) d(s) (no common factors between n(s) and d(s)). Poles:

More information