Determinant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations
|
|
- Cecil Dalton
- 5 years ago
- Views:
Transcription
1 MM Research Preprints, No. 19, Dec Beijing Determinant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations Ziming Li MMRC, Academy of Mathematics and Systems Science Chinese Academy of Sciences, Beijing , China Abstract. This paper describes the gap-structure of subresultants in an Ore polynomial module, and the geometric explanation of isolated subresultants, which are peculiar to inhomogenous equations. As an application of the gap-structure, we present three determinant formulas extending the determinant formulas for the greatest common right divisor (gcrd), least common left multiple (lclm), and Sylvester s resultant of two elements in an Ore polynomial ring. 1. Introduction Determinant formulas are useful in usual commutative polynomial algebras. Well-known examples are the Sylvester resultant and subresultants of two univariate polynomials [?,?,?]. Besides their theoretical interests, these determinant formulas are also useful in algorithmic aspects. For example, univariate subresultants describe the coefficient growth of polynomial remainder sequences of two polynomials, and the Sylvester resultants help us to prove that there are only a finite number of unlucky primes in modular gcd-algorithms. Ore polynomial rings [?,?] establish a general setting for linear homogeneous differential, difference and q-difference polynomials. A subresultant theory for Ore polynomials [?,?] is developed to manipulate Ore polynomials. The subresultant algorithm and determinant formulas for gcrd s, lclm s and resultants are useful to design efficient modular gcrd-algorithms, fraction-free lclm-algorithms, and to estimate the complexity of these algorithms. Ore polynomial modules extend Ore polynomial rings to describe linear inhomogeneous differential, difference and q-difference polynomials in one framework [?], in which the gapstructure of subresultants in an Ore polynomial module is given as a corollary of the subresultant theorem. But the proof of the subresultant theorem is very technical because we need to find precise recursive relations among leading coefficients of non-zero subresultants, whereas, the gap-structure has nothing to do with these complicated formulas. To reveal the simplicity of the gap-structure, we give a direct proof. It is worthwhile because the gap-structure has many interesting applications. We wish that the direct proof would split the subresultant theory [?] into two parts: a simple part describing the gap-structure of a subresultant chain; and a technical part calculating the linear dependence among subresultants precisely. Becasue of the presence of inhomogeneous components, the gap-structure of the subresultant chain of two elements in an Ore polynomial module may contain an isolated suresultant, which is defective and is linear independent with any regular subresultant. The presence of isolated subresultants is due to the fact that the solution space of an inhomogeneous linear operational equation is no logner a vector space (see Corollary??). We also
2 Determinants for Inhomogeneous Equations 113 generalize the notion of gcrd s, lclm s and resultants in Ore polynomial rings to Ore polynomial modules. The major difficulty for the generalization is that an Ore submodule may not be generated by one element. Recall that a left ideal of an Ore polynomial ring is always principal. We find that a right replacement of a gcrd of two elements in an Ore polynomial module is their last nonzero subresultant (see Propositions?? and??). The paper is organized as follows. Section?? recalls the definition of Ore polynomial modules. Section?? defines subresultants in an Ore polynomial module. Sesction?? is devoted to describing the gap-structure of a subresultant chain. Section?? presents some applications of the gap-structure. 2. Ore polynomial modules In this section we recall the definition of Ore polynomial modules. Because of the limit of space, the proofs of assertions made in the section are omitted. These proofs are all quite easy. The reader is refered to [?] for details. Throught the paper, let F be a commutative field and F [X] an Ore polynomial ring with conjugate operator σ and pseudo-derivation δ. Consider the left linear space F [X] F over F. We define the degree of an element A a of F [X] F to be the degree of A if A is nonzero. For nonzero a F, the degree of 0 a is set to be 1. The element 0 0 is of degree and denoted by 0 for brevity. An element A a of F [X] F is understood as where m = deg A a and the a s are in F. A a = a m X m + + a 1 X + a 0 X 0 + ax 1, Definition 2.1 An endomorphism Θ of the additive group F [X] F is said to be an Ore operator on F [X] F if the following hold: 1. Θ(X n ) = X n+1, for n N. 2. For every a F, deg Θ(aX 1 ) (Multiplicative rule) For every r F and A a F [X] F, Θ(r(A a)) = σ(r)θ(a a) + δ(r)(a a). (1) The quadruple (F [X] F, Θ, σ, δ) is called an Ore polynomial module. Example 2.2 Let F be C(t) and D = d dt. Define the Ore operator Θ on F [X] F to be such that Θ(rX n ) = rx n+1 + D(r)X n and Θ(rX 1 ) = D(r)X 1, for all r F and n N. The F -module (F [X] F, Θ, 1, D) models the C(t)-linear differential space consisting of inhomogeneous linear differential equations in one unknown. Example 2.3 Let F be Q(t) and E be the shift operator on F sending t = t + 1. Define the Ore operator Θ on F [X] F to be such that Θ(rX n ) = E(r)X n+1 and Θ(rX 1 ) = E(r)X 1, for all r F and n N. (F [X] F, Θ, E, 0) models the Q(t)-module of inhomogeneous shift equations in one unknown.
3 114 Z. Li In the rest of this paper, (F [X] F, Θ, σ, δ) is assumed to be an Ore polynomial module and simply denoted by F [X] F. If a submodule M of F [X] F has the property that Θ(M) M, then M is called an Ore submodule. If N is a subset of F [X] F, then the multiplicative rule (??) implies that the smallest Ore submodule containing N is the submodule [N ] generated by all the elements of Θ(N ), which we call the Θ-submodule generated by N. Two elements A and B of F [X] F are said to be compatible if [A, B] does not contain any element of degree 1. Let A and B be in F [X] F, with respective degrees m and n, where n 0. A remainder of A and B is defined to be either A, if m < n; or C F [X] F such that deg C < deg B and A = m n i=0 r iθ i B + C, where r i belongs to F, for i = 0, 1,..., m n. The remainder just defined can be computed by a process analogous to the algebraic division. As deg(θ i+1 B) = deg(θ i B) + 1, for all i N, the remainder of A and B is unique. We denote the remainder of A and B by rem(a, B). For A and B in F [X] F, define that A and B are similar if either both A and B are zero or A and B are nonzero and linearly dependent over F. The similarity is an equivalence relation and denoted by. For A 1, A 2 F [X] F with deg(a 1 ) deg(a 2 ) 0, let A 1, A 2,..., A k be a sequence of nonzero elements of F [X] F such that A i rem(a i 2, A i 1 ), for i = 3,... k, and either deg(a k ) = 1 or rem(a k 1, A k ) = 0. Such a sequence is called a polynomial remainder sequence (p.r.s.) of A 1 and A 2. Just as in the algebraic case, A 1 and A 2 are compatible if and only if deg(a k ) 0. Because of the existence of the Euclidean algorithm, an Ore submodule not containing any element of degree 1 can always be generated by one element. Hence, [A 1, A 2 ] is generated by one element if and only if A 1 and A 2 is compatible, and [A 1 ] [A 2 ] is always generated by one element. 3. Subresultants In this section, we define the subresultants of elements in an Ore polynomial module. Since an element of F [X] F may have an inhomogeneous component we need to extend the notion of determinant polynomials [?,?]. Definition 3.1 Let M be an r c matrix with entries in F. If r c, then the extended determinant polynomial of M is defined to be M = c r 1 i= 1 det(m i )X i, (2) where M i is the r r matrix whose first (r 1) columns are the first (r 1) columns of M and whose last column is the (c i 1)th column of M, for i = 1, 0,..., c r 1. The extended determinant polynomial of M just defined is the determinant polynomial of M multiplied by X 1 from the right-hand side. Note that M is (left) multi-linear and alternative w.r.t. its rows. Let A : A 1, A 2,..., A m be a sequence in F [X] F. We denote by deg A the maximum of the degrees of the members in A. Let deg A = n > 1. The matrix associated with A is defined to be the m (n + 2) matrix whose entry in the ith row and jth column is the coefficient of X n+1 j in A i, for i = 1,..., m, and j = 1,..., n + 2. This matrix is denoted
4 Determinants for Inhomogeneous Equations 115 by mat(a). If m n + 2, then the extended determinant polynomial of A is defined to be mat(a), which is simply denoted by A. Remark 3.2 Notice that A = m k=1 r k A k, where r k F. If A is nonzero, then A 1,..., A k are F -linearly independent. The proof is not difficult [?]. Definition 3.3 Let A and B be in F [X] F with respective degrees m and n, where m n 0. For n 1 j 1, the jth subresultant of A and B is defined to be sres j (A, B) = Θ n j 1 A,..., ΘA, A, Θ m j 1 B,..., ΘB, B, }{{}}{{} n j m j The nth subresultant of A and B is defined to be B. The sequence S(A, B) : A, B, sres n 1 (A, B),..., sres 1 (A, B) is called the subresultant sequence of A and B. The next lemma [?,?] records some properties of subresultants. Lemma 3.1 If A and B are in F [X] F with respective degrees m and n, where m n 0, then 1. sres j (A, B) [A, B], where n 1 j 1; 2. deg(sres j (A, B)) j, where n 1 j 1; 3. sres n 1 (A, B) rem(a, B). 4. Gap-structure of a subresultant sequence Notation To avoid endlessly repeating the same assumptions, in the rest of the paper we let A and B be in F [X] F, with respective degrees m and n, where m n 0. Let S n be B and S j be sres j (A, B), for j = n 1, n 2,..., 1. The subresultant sequence S(A, B) consists of S n+1 = A, S n = B, S n 1,..., S 0, S 1. The proof of the following lemma is the same as that of Lemmas 4.2 in [?]. Lemma 4.1 If B H and S n 1 (A, B) G, then, for n 1 j 1, S j Θ m j 1 H,..., H, Θ n j 1 G,..., G. (3) If deg S j = j, then S j is regular. Otherwise S j is defective. In particular, the nth subresultant S n is always regular. The next theorem is the main result. Theorem 4.2 If S j+1 is regular and S j has degree r, for some j with n 1 j 0, then the following hold: 1. If r 1, then S i = 0, (j 1 i 1). (4) 2. If r 0, then and S i = 0, (j 1 i r + 1), (5) S r S j, (6) S r 1 rem(s j+1, S j ). (7)
5 116 Z. Li Proof We proceed by induction on n, the degree of S n. If n = 0, then S 1 rem(s 1, S 0 ) by Lemma??. The theorem is true since i can only be 1. Suppose that the theorem holds if deg B < n. Consider the case deg B = n. Since S n 1 rem(s n+1, S n ) by Lemma??, Lemma?? implies that, for all i with n 1 i 1, S i R i, (8) where R i = Θ m 1 i S n,..., S n, Θ n 1 i S n 1,..., ΘS n 1, S n 1. There are two cases. First, j = n 1. If r 1, then the degrees of both ΘS n 1 and S n 1 are of degree 1. It follows from (??) that S i = 0 for n 2 i 1. Equation (??) holds for j = n 1. Assume now that r > 1. If n 2 i r +1, then deg S n > 1 + deg Θ n 1 i S n 1. Thus, S i = 0 by (??). If i = r, then deg S n = 1 + deg Θ n 1 i S n 1. Thus, R r S n 1, so that S r S n 1 by (??). If i = r 1 then deg S n = deg Θ n 1 i S n 1. Hence, R i sres r 1 (S n, S n 1 ), so S i sres r 1 (S n, S n 1 ) by (??) and S i rem(b, S n 1 ) by Lemma??. The theorem holds for j = n 1. It remains to consider the case j < n 1. Actually, j < r since S r is the regular subresultant next to S n. Equation (??) and the fact S n 1 S r just proved in the last paragraph imply that S i sres i (S n, S r ), for i = r 1, r 2,..., 1 because deg Θ r 1 i S n = Θ n 1 i S n 1. The theorem then follows from the induction hypothesis on the subresultant chain of S n and S r : S n, S r, sres r 1 (S n, S r ),..., sres 0 (S n, S r ), sres 1 (S n, S r ). The next definition is particular for elements in an Ore polynomial module. Definition 4.1 A defective subresultant of degree 1 is said to be isolated. The gap structure of S(A, B) is given in Figure 1. A B... Sj+1 is regular. S j is defective of degree r.. S i = 0 (j > i > r). S r is regular.... a regular subresultant a defective subresultant. zero subresultants a regular subresultant an isolated subres. if one exists. Fig. 1. The gap structure of S(A, B) Note that the gap-structure of S(A, B) is slightly more complicated than that of an algebraic subresultant sequence due to the possible presence of isolated subresultants.
6 Determinants for Inhomogeneous Equations 117 Now, we extend subresultant sequences of the first and second kinds and prove that subresultant sequences of the first kind are p.r.s s. Definition 4.2 The subresultant sequence of A and B of the first kind is the subsequence of S(A, B) that consists of A, B, and S j if S j+1 is regular and S j is nonzero. The subresultant sequence of A and B of the second kind is the subsequence of S(A, B) that consists of A, B and other regular subresultants of S(A, B). The subresultant sequences of A and B of the first and second kinds are denoted by S 1 (A, B) and S 2 (A, B), respectively. At last, we prove Theorem 4.3 S 1 (A, B) is a p.r.s.. Proof Set A = A 1 and B = A 2. Let A 1, A 2,..., A p be a p.r.s.. Let S 1 (A, B) consist of A 1 A 2 S j3,..., S jq. We show that p = q and S ji A i, for i = 3,..., p. First, we consider the special case p = 2. Since rem(a 1, A 2 ) = 0, S n 1 = 0 by Lemma??. Theorem?? then implies that S j = 0, for all j < n, so that S 1 (A, B) consists of A 1, A 2. The theorem is true. Second, we consider the case rem(a 1, A 2 ) 0. Since j 3 = n 1 by the definition of S 1 (A, B), S j3 = S n 1 A 3 by Lemma??. Assume that A i S ji, for all i < k. Since S jk rem ( ) S jk 1 +1, S jk 1 by (??), Sjk 1 +1 S jk 2 by (??), and S jk 2 A k 2 by the induction hypothesis, we conclude S jk A k. We have proved that S ji A i, for i = 3,..., p. It remains to show that q = p. If deg A p = 1, then deg S p = 1. Thus, S i = 0 for i < p, so p = q. Suppose now that rem(a p 1, A p ) = 0. Let d = deg A p. Applying Theorem?? to (S jp 1 +1, S jp 1 ) and (S jp+1, S jp ), respectively, we derive S jp 1 S jp+1, S i = 0 for j p 1 i d+1, and S d S jp. Since rem(s jp 1, S jp ) = 0, rem(s jp+1, S jp ) = 0. It follows from (??) that S d 1 = 0 Applying Theorem?? to (S d, S d 1 ) yields S i = 0 for d 2 i 1. Hence, S jp is a last member of S 1 (A, B). 5. Applications In addition to the notation convention made in the last section, we denote the last nonzero elements of S(A, B) by S d. First, we study the Ore submodule [A] + [B]. Proposition 5.1 If deg S d 0, then [A, B] = [S d ]. Otherwise, A and B are not compatible. Proof Denote by S l the last member of S 1 (A, B). If deg S d 0, then deg S l 0, so [A, B] = [S l ]. Hence, [A, B] = [S d ] since S d S l by Theorem?? (applied to (S l 1, S l )). If deg S d = 1, then d = l. It follows that A and B are not compatible. From Proposition?? we see that S d is a proper extension of the notion of gcrds when deg S d 0. If deg S d = 1, then [A, B] is generated by two elements S l 1 and S l. Next, we extend the notion of resultants to Ore polynomial modules. Corollary 5.2 Denote by r d the coefficient of X d in S d If d = 1, then [A, B] contains an element with degree 1. Assume that d 0. Then [A, B] is generated by S d if and only if r d 0.
7 118 Z. Li Proof If d = 1, then S 1 [A, B]. Suppose that d 0. If r d 0, then deg S d = d 0, so [A, B] = [S d ] by Proposition??. If r d = 0, then S d is isolated, for, otherwise, S d would not be the last nonzero one by Theorem??. Hence, A and B are not compatible. At last, we study [A] [B]. Since the degrees of A and B are both non-negative, [A] [B] is generated by one element, which is an extension of the notion of lclm s. Indeed, any nonzero element with lowest degree in [A] and [B] is a generator. Proposition 5.3 The degree of a generator of [A, B] is (m + n d). Proof Since S d 0, Θ n d 1 A,..., A, Θ m d 1 B,..., B are F -linearly independent. It follows that a generator of [A] [B] is of degree greater than (m + n d 1). So, the lowest degree of nonzero elements in [A] [B] is no less than (m + n d). We consider two cases. First, assume that deg S d 0. In this case S d is regular. Thus, deg S d = d. Since S d 1 = 0, expanding S d 1 by Remark?? yields s n d Θ n d A + + s 0 A + t m d Θ m d B + + B = 0, (9) where the s s and t s belongs to F and s n d is nonzero because S d is regular. Let L = s n d Θ n d A + + s 0 A. The degree of L is (m + n d). Since rem(l, B) = 0 by (??), L belongs to [A] [B]. Hence, [A] [B] = [L]. Second, assume that deg S d = 1. Expanding S d by Remark?? yields s n i Θ n i A + + s 0 A + t m i Θ m i B + + B = rx 1 (10) where the s s, t s and r belong to F, r is nonzero and s n i is nonzero, where d + 1 i n. Applying Θ to (??) yields u n i+1 Θ n i+1 A + + u 0 A + v m i+1 Θ m i+1 B + + B = wx 1 (11) where the u s, v s and w belong to F. In particular, u n i+1 is nonzero because it is equal to σ(s n i ) by (??). Cancelling the inhomogeneous components of (??) and (??), we find that ru n i+1 Θ n i+1 A + (ru n i ws n i )Θ n i A + + (ru 0 ws 0 )A +rv m i+1 Θ m i+1 B + (rv m i wt m i )Θ m i B + (rv 0 wt 0 )B = 0. As Θ n d 1 A,..., A, Θ m d 1 B,..., B are F -linearly independent, i must be equal to (d+1). Therefore, L = ru n d Θ n d + (ru n d 1 ws n d 1 )Θ n d 1 A + (ru 0 ws 0 )A is a generator of [A] [B]. A generator of [A] [B] is a proper extension of the notion of the lclm of two elements of an Ore polynomial ring. The equality where Ā, B F [X], is generalized to deg Ā + deg B = lclm(ā, B) + gcrd(ā, B), deg A + deg B = deg L + d
8 Determinants for Inhomogeneous Equations 119 where L is a generator of [A] [B]. The proof of Proposition?? points out how to express some generators of [A] [B] by determinants. At last, we describe a geometric meaning of isolated subresultant in differential case. Assume that F [X] F is given in Example??. For an element G F [X] F, the solution set of G in a differential closed field of F is denoted by V G. If deg G 0, then V G is a translation of a C-vector space with dimension deg G. If deg G = 1, then V G is empty. Hence, deg G has some geometric meaning. Corollary 5.4 Let L be a generator of [A] [B]. 1. S d is regular deg A + deg B = deg L + deg S d. 2. S d is isolated deg A + deg B > deg L + deg S d. Proof The first assertion is immediate from Proposition??. The second one follows from the fact that S d is isolated if and only if deg S d < d. References [1] Abbot, J., Bronstein, M., Mulder, T. (1999): Fast deterministic computation of determinants of dense matrices, in: Proceedings of ISSAC 99, Dooley, S., Ed., ACM Press, [2] Bronstein, M., Petkovsek, M. (1996): An introduction to pseudo linear algebra, Theoretical Computer Science, 157, [3] Brown, W.S. (1971): On Euclid s Algorithm and the Computation of Polynomial Greatest Common Divisors JACM 18, [4] Brown, W.S., Traub, J.F. (1971) On Euclid s Algorithm and the Theory of Subresultants. JACM 18, , [5] Collins, G.E. (1971) The Calculation of Multivariate Polynomial Resultants, JACM 18, [6] Collins, G.E. (1967): Subresultant and Reduced Polynomial Remainder Sequences, JACM 16, [7] Li, Z. (1998): A subresultant theory for Ore polynomials with applications, in: Proceedings of ISSAC 98, Gloor, O. Ed., ACM Press, [8] Li, Z. (1996): A Subresultant Theory for Ore Polynomials and its Applications. PhD Thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, A-4040, Austria. [9] Li, Z., Nemes, I. (1997): A modular algorithms for computing greatest common right divisors of Ore polynomials, in: Proceedings of ISSAC 97, Küchlin, W. Ed., ACM Press, [10] Loos, R. (1982) Generalized Polynomial Remainder Sequence, in Buchberger, B. Collins, G.E., and Loos, R. (eds.), Computer Algebra, Symbolic and Algebraic Computation, [11] Mishra, B. (1993) Algorithmic Algebra. Texts and Monographs in Computer Science, D. Gries D and Theory of Non-commutative Polynomials, Annals of Math., 34, [12] Ore, O. (1933): Theory of Non-commutative Polynomials, Annals of Math., 34,
A Subresultant Theory for Ore Polynomials with Applications 1)
MM Research Preprints,91 108 No. 17, Dec. 1998. Beijing 91 A Subresultant Theory for Ore Polynomials with Applications 1) Ziming Li Institute of Systems Science, Academia Sinica currently in GMD-SCAI D-53754
More informationA Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials 1)
MM Research Preprints, 69 88 No. 15, April 1997. Beijing 69 A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials 1) Ziming Li 2) and István Nemes 3) Abstract. This paper
More informationSylvester Matrix and GCD for Several Univariate Polynomials
Sylvester Matrix and GCD for Several Univariate Polynomials Manuela Wiesinger-Widi Doctoral Program Computational Mathematics Johannes Kepler University Linz 4040 Linz, Austria manuela.wiesinger@dk-compmath.jku.at
More informationAlgebra 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 informationPolynomials, 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 informationParametric euclidean algorithm
Theoretical Mathematics & Applications, vol.3, no.3, 2013, 13-21 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Parametric euclidean algorithm Ali Ayad 1, Ali Fares 2 and Youssef Ayyad
More informationMATH 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 informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationChapter 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 information2. 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 informationComputing with polynomials: Hensel constructions
Course Polynomials: Their Power and How to Use Them, JASS 07 Computing with polynomials: Hensel constructions Lukas Bulwahn March 28, 2007 Abstract To solve GCD calculations and factorization of polynomials
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More informationa + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:
5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.
More information32 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 informationAn elementary approach to subresultants theory
Journal of Symbolic Computation 35 (23) 281 292 www.elsevier.com/locate/jsc An elementary approach to subresultants theory M hammed El Kahoui Department of Mathematics, Faculty of Sciences Semlalia, Cadi
More informationNUMBER 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 informationSelf-dual skew codes and factorization of skew polynomials
Self-dual skew codes and factorization of skew polynomials Delphine Boucher, Félix Ulmer To cite this version: Delphine Boucher, Félix Ulmer. Self-dual skew codes and factorization of skew polynomials.
More information(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(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 informationA 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 informationMATH10040 Chapter 1: Integers and divisibility
MATH10040 Chapter 1: Integers and divisibility Recall the basic definition: 1. Divisibilty Definition 1.1. If a, b Z, we say that b divides a, or that a is a multiple of b and we write b a if there is
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationSummer Project. August 10, 2001
Summer Project Bhavana Nancherla David Drescher August 10, 2001 Over the summer we embarked on a brief introduction to various concepts in algebraic geometry. We used the text Ideals, Varieties, and Algorithms,
More informationCHAPTER 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 informationRational Univariate Reduction via Toric Resultants
Rational Univariate Reduction via Toric Resultants Koji Ouchi 1,2 John Keyser 1 Department of Computer Science, 3112 Texas A&M University, College Station, TX 77843-3112, USA Abstract We describe algorithms
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More informationCHAPTER 4: EXPLORING Z
CHAPTER 4: EXPLORING Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction In this chapter we continue the study of the ring Z. We begin with absolute values. The absolute value function Z N is the identity
More informationa 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.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More information4 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 informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationFinitely 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 informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationLECTURE 4: GOING-DOWN THEOREM AND NORMAL RINGS
LECTURE 4: GOING-DOWN THEOREM AND NORMAL RINGS Definition 0.1. Let R be a domain. We say that R is normal (integrally closed) if R equals the integral closure in its fraction field Q(R). Proposition 0.2.
More information5: 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 informationNOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS. Contents. 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4. 1.
NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS Contents 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4 1. Introduction These notes establish some basic results about linear algebra over
More informationNOTES 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 informationComputer Algebra: General Principles
Computer Algebra: General Principles For article on related subject see SYMBOL MANIPULATION. Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish
More informationThe Integers. Peter J. Kahn
Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More informationFinite 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 information2. Modules. Definition 2.1. Let R be a ring. Then a (unital) left R-module M is an additive abelian group together with an operation
2. Modules. The concept of a module includes: (1) any left ideal I of a ring R; (2) any abelian group (which will become a Z-module); (3) an n-dimensional C-vector space (which will become both a module
More information2 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 informationThe following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:
Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and
More informationDesingularization of Ore Operators
Desingularization of Ore Operators Shaoshi Chen 1 KLMM, AMSS Chinese Academy of Sciences 100190 Beijing, China Manuel Kauers 2 Institute for Algebra Johannes Kepler University Linz, Austria Michael F Singer
More informationEndomorphism rings generated using small numbers of elements arxiv:math/ v2 [math.ra] 10 Jun 2006
Endomorphism rings generated using small numbers of elements arxiv:math/0508637v2 [mathra] 10 Jun 2006 Zachary Mesyan February 2, 2008 Abstract Let R be a ring, M a nonzero left R-module, and Ω an infinite
More informationQuestionnaire for CSET Mathematics subset 1
Questionnaire for CSET Mathematics subset 1 Below is a preliminary questionnaire aimed at finding out your current readiness for the CSET Math subset 1 exam. This will serve as a baseline indicator for
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More information6.S897 Algebra and Computation February 27, Lecture 6
6.S897 Algebra and Computation February 7, 01 Lecture 6 Lecturer: Madhu Sudan Scribe: Mohmammad Bavarian 1 Overview Last lecture we saw how to use FFT to multiply f, g R[x] in nearly linear time. We also
More informationRings. Chapter Definitions and Examples
Chapter 5 Rings Nothing proves more clearly that the mind seeks truth, and nothing reflects more glory upon it, than the delight it takes, sometimes in spite of itself, in the driest and thorniest researches
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationDifferential Resultants and Subresultants
1 Differential Resultants and Subresultants Marc Chardin Équipe de Calcul Formel SDI du CNRS n 6176 Centre de Mathématiques et LIX École Polytechnique F-91128 Palaiseau (France) e-mail : chardin@polytechniquefr
More informationDefinitions. 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 information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More information0 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 informationJournal of Symbolic Computation
Journal of Symbolic Computation 74 (216) 617 626 Contents lists available at ScienceDirect Journal of Symbolic Computation wwwelseviercom/locate/jsc Desingularization of Ore operators Shaoshi Chen a,1,
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationCOMMUTATIVE RINGS. Definition 3: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition 1: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationOn a Theorem of Dedekind
On a Theorem of Dedekind Sudesh K. Khanduja, Munish Kumar Department of Mathematics, Panjab University, Chandigarh-160014, India. E-mail: skhand@pu.ac.in, msingla79@yahoo.com Abstract Let K = Q(θ) be an
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationDynamics of finite linear cellular automata over Z N
Dynamics of finite linear cellular automata over Z N F. Mendivil, D. Patterson September 9, 2009 Abstract We investigate the behaviour of linear cellular automata with state space Z N and only finitely
More informationExample: 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 information2.4 Algebra of polynomials
2.4 Algebra of polynomials ([1], p.136-142) In this section we will give a brief introduction to the algebraic properties of the polynomial algebra C[t]. In particular, we will see that C[t] admits many
More informationRINGS: 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 information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/32076 holds various files of this Leiden University dissertation Author: Junjiang Liu Title: On p-adic decomposable form inequalities Issue Date: 2015-03-05
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationOn some properties of elementary derivations in dimension six
Journal of Pure and Applied Algebra 56 (200) 69 79 www.elsevier.com/locate/jpaa On some properties of elementary derivations in dimension six Joseph Khoury Department of Mathematics, University of Ottawa,
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationCHAPTER 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 informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
More informationCANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES. D. Katz
CANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES D. Katz The purpose of this note is to present the rational canonical form and Jordan canonical form theorems for my M790 class. Throughout, we fix
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationGeneralized eigenspaces
Generalized eigenspaces November 30, 2012 Contents 1 Introduction 1 2 Polynomials 2 3 Calculating the characteristic polynomial 5 4 Projections 7 5 Generalized eigenvalues 10 6 Eigenpolynomials 15 1 Introduction
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More informationPublic-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 informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings
D-MATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n
More informationMath 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 informationSubsets of Euclidean domains possessing a unique division algorithm
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationRecursive definitions on surreal numbers
Recursive definitions on surreal numbers Antongiulio Fornasiero 19th July 2005 Abstract Let No be Conway s class of surreal numbers. I will make explicit the notion of a function f on No recursively defined
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationHowever 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 informationGroebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics
Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics Tan Tran Junior Major-Economics& Mathematics History Groebner bases were developed by Buchberger in 1965, who later named
More informationA Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group
A Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group Cyrus Hettle (cyrus.h@uky.edu) Robert P. Schneider (robert.schneider@uky.edu) University of Kentucky Abstract We define
More information