DOCSLIB.ORG

A Rough Guide to Linear Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Rough Guide to Linear Algebra A rough guide to linear algbera Dongryul Kim Version of April 18, 2020 ii Contents Preface v 1 Sets 1 1.1 Sets and maps . .1 1.2 Products, coproducts, and sets of maps . .4 1.3 Fun with diagrams . .7 1.4 Equivalence classes . .9 2 Vector spaces 13 2.1 Fields . 13 2.2 Vector spaces . 15 2.3 Matrices . 18 2.4 Products and direct sums . 21 2.5 Subspaces and quotients . 27 2.6 Vector spaces from linear maps . 29 2.7 Bases and dimension . 34 2.8 Dual spaces . 44 2.9 Linear algebra in combinatorics . 50 3 Multilinear algebra 55 3.1 Bilinear maps and tensor products . 55 3.2 Symmetric and exterior algebras . 62 3.3 The determinant . 68 3.4 Computing the inverse matrix . 72 4 Linear algebra without division 79 4.1 Commutative rings . 79 4.2 Modules . 82 4.3 Classification of finitely generated modules over a PID . 86 4.4 Frobenius and Jordan normal form . 97 4.5 Eigenvalues and eigenvectors . 103 iii iv CONTENTS 5 Linear algebra over R and C 109 5.1 A bit of analysis . 109 5.2 Inner products . 112 5.3 Operators on Hilbert spaces . 118 5.4 The spectral theorem . 121 5.5 Positivity of operators . 125 5.6 Duality in linear programming . 130 Epilogue 131 Preface At a certain point, one adopts a mode of learning mathematics. Then at a later point, after progressing through various styles of teaching and writing, one develops one's own point of view for how mathematics is to be taught. This book is an arrogant attempt to reassemble linear algebra according to the author's pedagogy. About this book There are countless (seriously, too many) books on linear algebra, and it is necessary to ask why we need another. Most of these books are designed for a first course in linear algebra for college students, which possibly include an emphasis in proof writing. However, there is a definite discrepancy between the presentation of linear algebra in such textbooks and how mathematicians understand the theory. Almost every professional mathematician has a natural functorial picture of linear algebra, but this is rarely written down in textbooks. Hence in reality, one acquires the functorial understanding while learning more advanced mathematics, such as commutative algebra or vector bundles. The philosophy of this book is that the determined reader can benefit from being directly introduced to the abstract development of linear algebra. Hence this book will be most suitable to a reader who is (1) planning to pursue a career in mathematics, and (2) is already comfortable with rigorous presentations of mathematics. I believe it can also be used for a second course in linear algebra. The audience I had in mind when writing the book are students who had experience in mathematical competitions wanting to learn college-level mathematics. There are minimal prerequisites for reading this book, aside from fluency in mathematical communications, i.e., reading and writing proofs. I tried to minimize the material dealt in this book. My conception of the book is that it is the bare bones of linear algebra. Most mathematicians, working in all fields, will be familiar with all the material in this book. Linear algebra arguably is the main tool for studying mathematical objects. On the other hand, the book will serve as a solid background for learning other parts of mathematics. I have tried to explain some of the applications of linear algebra in the epilogue. v vi CONTENTS Organization In Chapter 1, we introduce na¨ıve set theory. Set theory provides the foundation of modern mathematics, and it is necessary that the reader is familiar with sets and the basic operations. We have also included a first taste of category theory, introducing the concept of commutative diagrams and universal properties. In Chapter 2, we introduce the theory of vector spaces. Linear algebra is, and should be, the study of vector spaces and linear maps, not of matrices. Matrices are a good tool for computations, but abstraction is necessary for a solid conceptual picture. During the first half of the chapter, we carefully develop various constructions in the category of vector spaces, e.g., products, direct sum, subspaces, quotient spaces, kernel, cokernel, image, internal hom, etc. In the second half, we prove the theorem that every vector space has a basis, and discuss applications of this fact. We will not ignore infinite-dimensional spaces. There is also a section on applications of linear algebra in combinatorics, for students with a competition mathematics background. In Chapter 3, we introduce tensor products, the symmetric algebra, and the exterior algebra. We discuss the universal properties of these vector spaces as a motivation. The determinant is defined using the exterior algebra, as it should be. Using this definition, we prove Cramer's rule and discuss Gaussian elimination. In Chapter 4, we introduce modules over a commutative ring. Modules are important objects in commutative algebra, but our main goal in this chapter is study the different possible ways a linear map can act on a vector space. We prove the classification theorem of finitely generated modules over a principal ideal domain, and use this to discuss Frobenius normal form, Jordan normal form, eigenvectors, eigenspaces, and generalized eigenspaces. In Chapter 5, we do linear algebra combined with analysis. We define inner product structures and finite-dimensional Hilbert spaces, and lead up to proving the spectral theorem on finite-dimensional spaces. There is a more algebraic proof in the finite-dimensional case, using the Jordan normal form for instance, but we use an analytic argument that applies also to compact operators on infinite-dimensional Hilbert spaces. There are plenty of exercises. I have tried to meld the exercise with the text so that they appear in context. Some of the exercises will be used in later proofs, and some of them will be used implicitly throughout the book. Others will be unimportant from a theoretical perspective, but nonetheless helpful in properly understanding the material. Abstraction can be a double-edged sword, as the abstract loses meaning when disconnected from the concrete. By doing the exercises, the reader is expected to train moving between the two worlds. Acknowledgements This project started with a small series of lectures delivered to the Korean team for the 2017 International Mathematical Olympiad, a group of six high school students. The course was aborted due to lack of time, but the idea of writing CONTENTS vii a set of linear algebra notes remained. I would like to thank everyone who had attended my ill-prepared lectures, as well as those who were beside me when I was working on the book. The current text is a draft, and will be updated occasionally. I beg ev- eryone to send me typos, grammatical errors, mathematical errors, sugges- tions, comments, criticisms, anything about the book. You can reach me at [email protected]. The latest version of this book can be obtained at my website http://dongryulkim.wordpress.com. Happy reading! April, 2020 Dongryul Kim Here, I keep a list of chores I need to do. The draft will be a final draft once the list is empty. • Probably expand the chapter \Preface" once I indicate optional/required material • Do we move where we discuss Gaussian elimination? Maybe matrices and algorithms deserve a separate section? • Write about the LU decomposition • Include somewhere a discussion Cayley{Hamilton • Fill in the section \Duality in linear programming" • Introduce functional calculus for self-adjoint operators • Check which are optional, which are required • Rank exercises by difficulty? • Give hints for exercises? • Add references at the end of each chapter? viii CONTENTS Chapter 1 Sets Most of mathematics is grounded on the notion of sets. In this chapter, we quickly review the basic set theory we use throughout the book, assuming that the reader is familiar with most of the material. 1.1 Sets and maps In standard mathematics, that is, Zermelo{Fraenkel set theory, literally every mathematical object is a set. Each of the numbers 0; 1; 2;::: is actually a set: 0 = ; = fg; 1 = f;g = ffgg; 2 = f;; f;gg = ffg; ffggg;:::: But because the notion of sets provides a foundation for mathematics, it does not make sense to mathematically define what a set is. Instead, people take the notion as granted and assume that sets satisfy certain axioms. But we are not going to worry to much about these issues and the following definition will be good for us. Definition 1.1.1. A set is a well-defined collection of objects. If an object x is inside the set X, we say that x is an element of X and write x 2 X. Example 1.1.2. The set of natural numbers Z≥0 = f0; 1; 2;:::g is a set. The set of integers Z = f:::; −1; 0; 1;:::g is a set. The set of even integers 2Z = f:::; −2; 0; 2; 4;:::g = f2x : x 2 Zg is a set. An issue arises when one tries to look at the set of all sets. In fact, in Zermelo{Fraenkel set theory, it is possible to prove that there is no set that contains all sets. But again, we are going to ignore such issues. Definition 1.1.3. Given two sets X and Y , if x 2 Y implies x 2 X, we say that Y is a subset of X and write Y ⊆ X. Equivalently, we say that X is a superset of Y and write X ⊇ Y . For instance, f1; 3g ⊆ f1; 2; 3g.
Load more

Recommended publications
  • The Geometry of Syzygies
    The Geometry of Syzygies A second course in Commutative Algebra and Algebraic Geometry David Eisenbud University of California, Berkeley with the collaboration of Freddy Bonnin, Clement´ Caubel and Hel´ ene` Maugendre For a current version of this manuscript-in-progress, see www.msri.org/people/staff/de/ready.pdf Copyright David Eisenbud, 2002 ii Contents 0 Preface: Algebra and Geometry xi 0A What are syzygies? . xii 0B The Geometric Content of Syzygies . xiii 0C What does it mean to solve linear equations? . xiv 0D Experiment and Computation . xvi 0E What’s In This Book? . xvii 0F Prerequisites . xix 0G How did this book come about? . xix 0H Other Books . 1 0I Thanks . 1 0J Notation . 1 1 Free resolutions and Hilbert functions 3 1A Hilbert’s contributions . 3 1A.1 The generation of invariants . 3 1A.2 The study of syzygies . 5 1A.3 The Hilbert function becomes polynomial . 7 iii iv CONTENTS 1B Minimal free resolutions . 8 1B.1 Describing resolutions: Betti diagrams . 11 1B.2 Properties of the graded Betti numbers . 12 1B.3 The information in the Hilbert function . 13 1C Exercises . 14 2 First Examples of Free Resolutions 19 2A Monomial ideals and simplicial complexes . 19 2A.1 Syzygies of monomial ideals . 23 2A.2 Examples . 25 2A.3 Bounds on Betti numbers and proof of Hilbert’s Syzygy Theorem . 26 2B Geometry from syzygies: seven points in P3 .......... 29 2B.1 The Hilbert polynomial and function. 29 2B.2 . and other information in the resolution . 31 2C Exercises . 34 3 Points in P2 39 3A The ideal of a finite set of points .
    [Show full text]
  • LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
    LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students.
    [Show full text]
  • On Finding Multiplicities of Characteristic Polynomial Factors Of
    On finding multiplicities of characteristic polynomial factors of black-box matrices∗. Jean-Guillaume Dumas† Cl´ement Pernet‡ B. David Saunders§ November 2, 2018 Abstract We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is rep- resented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to matrices either over the integers or over a large enough finite field. Experiments show that these methods perform efficiently in practice. Combined in an adaptive strategy, these algorithms reach significant speedups in practice for some integer matrices arising in an application from graph theory. Keywords: Characteristic polynomial ; black-box matrix ; finite field. 1 Introduction Computing the characteristic polynomial of an integer matrix is a classical math- ematical problem. It is closely related to the computation of the Frobenius nor- mal form which can be used to test two matrices for similarity, or computing invariant subspaces under the action of the matrix. Although the Frobenius normal form contains more information on the matrix than the characteristic arXiv:0901.4747v2 [cs.SC] 18 May 2009 polynomial, most algorithms to compute it are based on computations of char- acteristic polynomials (see for example [25, 9.7]). Several matrix representations are used in§ computational linear algebra. In the dense representation, a m n matrix is considered as the array of all the m n coefficients. The sparse representation× only considers non-zero coefficients using× different possible data structures. In the black-box representation, the matrix ∗Saunders supported by National Science Foundation Grants CCF-0515197, CCF-0830130.
    [Show full text]
  • Geometric Engineering of (Framed) Bps States
    GEOMETRIC ENGINEERING OF (FRAMED) BPS STATES WU-YEN CHUANG1, DUILIU-EMANUEL DIACONESCU2, JAN MANSCHOT3;4, GREGORY W. MOORE5, YAN SOIBELMAN6 Abstract. BPS quivers for N = 2 SU(N) gauge theories are derived via geometric engineering from derived categories of toric Calabi-Yau threefolds. While the outcome is in agreement of previous low energy constructions, the geometric approach leads to several new results. An absence of walls conjecture is formulated for all values of N, relating the field theory BPS spectrum to large radius D-brane bound states. Supporting evidence is presented as explicit computations of BPS degeneracies in some examples. These computations also prove the existence of BPS states of arbitrarily high spin and infinitely many marginal stability walls at weak coupling. Moreover, framed quiver models for framed BPS states are naturally derived from this formalism, as well as a mathematical formulation of framed and unframed BPS degeneracies in terms of motivic and cohomological Donaldson-Thomas invariants. We verify the conjectured absence of BPS states with \exotic" SU(2)R quantum numbers using motivic DT invariants. This application is based in particular on a complete recursive algorithm which determines the unframed BPS spectrum at any point on the Coulomb branch in terms of noncommutative Donaldson- Thomas invariants for framed quiver representations. Contents 1. Introduction 2 1.1. A (short) summary for mathematicians 7 1.2. BPS categories and mirror symmetry 9 2. Geometric engineering, exceptional collections, and quivers 11 2.1. Exceptional collections and fractional branes 14 2.2. Orbifold quivers 18 2.3. Field theory limit A 19 2.4.
    [Show full text]
  • THE RESULTANT of TWO POLYNOMIALS Case of Two
    THE RESULTANT OF TWO POLYNOMIALS PIERRE-LOÏC MÉLIOT Abstract. We introduce the notion of resultant of two polynomials, and we explain its use for the computation of the intersection of two algebraic curves. Case of two polynomials in one variable. Consider an algebraically closed field k (say, k = C), and let P and Q be two polynomials in k[X]: r r−1 P (X) = arX + ar−1X + ··· + a1X + a0; s s−1 Q(X) = bsX + bs−1X + ··· + b1X + b0: We want a simple criterion to decide whether P and Q have a common root α. Note that if this is the case, then P (X) = (X − α) P1(X); Q(X) = (X − α) Q1(X) and P1Q − Q1P = 0. Therefore, there is a linear relation between the polynomials P (X);XP (X);:::;Xs−1P (X);Q(X);XQ(X);:::;Xr−1Q(X): Conversely, such a relation yields a common multiple P1Q = Q1P of P and Q with degree strictly smaller than deg P + deg Q, so P and Q are not coprime and they have a common root. If one writes in the basis 1; X; : : : ; Xr+s−1 the coefficients of the non-independent family of polynomials, then the existence of a linear relation is equivalent to the vanishing of the following determinant of size (r + s) × (r + s): a a ··· a r r−1 0 ar ar−1 ··· a0 .. .. .. a a ··· a r r−1 0 Res(P; Q) = ; bs bs−1 ··· b0 b b ··· b s s−1 0 . .. .. .. bs bs−1 ··· b0 with s lines with coefficients ai and r lines with coefficients bj.
    [Show full text]
  • MATH 210A, FALL 2017 Question 1. Consider a Short Exact Sequence 0
    MATH 210A, FALL 2017 HW 3 SOLUTIONS WRITTEN BY DAN DORE, EDITS BY PROF.CHURCH (If you find any errors, please email [email protected]) α β Question 1. Consider a short exact sequence 0 ! A −! B −! C ! 0. Prove that the following are equivalent. (A) There exists a homomorphism σ : C ! B such that β ◦ σ = idC . (B) There exists a homomorphism τ : B ! A such that τ ◦ α = idA. (C) There exists an isomorphism ': B ! A ⊕ C under which α corresponds to the inclusion A,! A ⊕ C and β corresponds to the projection A ⊕ C C. α β When these equivalent conditions hold, we say the short exact sequence 0 ! A −! B −! C ! 0 splits. We can also equivalently say “β : B ! C splits” (since by (i) this only depends on β) or “α: A ! B splits” (by (ii)). Solution. (A) =) (B): Let σ : C ! B be such that β ◦ σ = idC . Then we can define a homomorphism P : B ! B by P = idB −σ ◦ β. We should think of this as a projection onto A, in that P maps B into the submodule A and it is the identity on A (which is exactly what we’re trying to prove). Equivalently, we must show P ◦ P = P and im(P ) = A. It’s often useful to recognize the fact that a submodule A ⊆ B is a direct summand iff there is such a projection. Now, let’s prove that P is a projection. We have β ◦ P = β − β ◦ σ ◦ β = β − idC ◦β = 0. Thus, by the universal property of the kernel (as developed in HW2), P factors through the kernel α: A ! B.
    [Show full text]
  • Basic Vocabulary 2 Generators and Relations for an R-Module
    Modules as given by matrices November 23 Material covered in Artin Ed 1: Chapter 12 section 1-6; and Artin Ed 2: 14.1-14.8; and also more generally covered in Dummit and Foote Abstract Algebra. 1 Recall modules; set up conventions; basic vocabulary We will work with commutative rings with unit R. The category of R-modules. If U; V are R- modules we have the direct sum U ⊕ V as an R-module, and HomR(U; V ). Some basic vocabulary, some of which we have introduced, and some of which we will be introducing shortly. • submodule, quotient module • finitely generated • cyclic R-modules and Ideals in R • free • \short" exact sequence of R-modules 0 ! U ! V ! W ! 0: • split \short" exact sequence of R-modules • vector spaces; dimensions, ranks. 2 Generators and relations for an R-module; presentations Recall that our rings are commutative with unit, and we're talking about modules over such rings. Recall what it means for a set of elements fx1; x2; : : : ; xng ⊂ M to be a \a system of generators" for M over R: it means that any element of M is a linear combo of these elements with coefficients in R. Definition 1 If M is an R-module and fx1; x2; : : : ; xng ⊂ M a subset of elements that has the property that any linear relation of the form n Σi=1rixi = 0 in the ring R is trivial in the sense that all the ri's are 0, we'll say that the elements fx1; x2; : : : ; xng are linearly independent over R.
    [Show full text]
  • Observavility Brunovsky Normal Form: Multi-Output Linear Dynamical Systems Driss Boutat, Frédéric Kratz, Jean-Pierre Barbot
    Observavility Brunovsky Normal Form: Multi-Output Linear Dynamical Systems Driss Boutat, Frédéric Kratz, Jean-Pierre Barbot To cite this version: Driss Boutat, Frédéric Kratz, Jean-Pierre Barbot. Observavility Brunovsky Normal Form: Multi- Output Linear Dynamical Systems. American Control Conference, ACC09, IEEE, Jun 2009, St. Louis, MO, United States. hal-00772281 HAL Id: hal-00772281 https://hal.inria.fr/hal-00772281 Submitted on 10 Jan 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Observavility Brunovsky Normal Form: Multi-Output Linear Dynamical Systems Driss Boutat, Fred´ eric´ Kratz and Jean-Pierre Barbot Abstract— This paper gives the sufficient and necessary II. NOTATION AND PROBLEM STATEMENT conditions to guarantee the existence of a linear change of co- ordinates to transform a multi-output linear dynamical system (modulo a nonlinear term depending on inputs and outputs) in the observability Brunovsky canonical form. Consider the following multi-output dynamical system: I. INTRODUCTION x˙ = Ax + γ(y, u) (1) y = Cx (2) For a single output dynamical linear system the observability rank condition is a necessary and sufficient condition to transform it into the Brunovsky observability where: normal form. In this last form, it is possible to use classical observer such that [8] observer and, [5] observer.
    [Show full text]
  • Geometry of Syzygies Edward Pearce Mathematics Institute
    Geometry of Syzygies by Edward Pearce MA4K9 Research Project Submitted to The University of Warwick Mathematics Institute April, 2016 Geometry of Syzygies Edward Pearce 1203384 30th May 2016 Contents 1 Introduction 2 2 Free Resolutions 2 2.1 Graded Rings . .2 2.2 Construction of a free resolution . .3 2.3 Application - The Hilbert Function and Polynomial . .4 2.4 Minimal Free Resolutions and Hilbert Syzygy Theorem . .6 2.5 Graded Betti Numbers and Betti Diagrams . 11 3 Proof of Hilbert's Syzygy Theorem 14 3.1 Monomial Ideals and Simplicial Complexes . 14 3.2 Syzygies of Monomial Ideals . 18 3.3 Taylor and Koszul complexes . 21 3.4 Hilbert's Syzygy Theorem - a strengthening . 23 4 Castelnuovo-Mumford Regularity 25 4.1 Denition and rst applications . 25 4.2 The Regularity of a Cohen-Macaulay Module . 27 5 Toric Ideals 31 6 Eisenbud-Goto Conjecture 33 6.1 A General Regularity Conjecture . 33 6.2 Examples using Macaulay 2 . 34 A Additional Macaulay2 Code 36 1 1 Introduction In this project we introduce several important and useful concepts and techniques from commutative and homological algebra which can prove fruitful in the study of projective geometry through means of calculating numerical invariants and convey- ing other algebraic and geometric information about ideals and their corresponding varieties. There is also some interplay with combinatorics along the way. We build our toolkit in order to consider a conjectural connection which states that under particular assumptions on a projective variety we may bound the degree of the min- imal homogeneous generators of its associated ideal in terms of geometric data.
    [Show full text]
  • On the Generalized Nullspace of M-Matrices and Z-Matrices*
    On the Generalized Nullspace of M-Matrices and Z-Matrices* Daniel Hershkowitz Department of Mathematics Technion - lsrael Institute of Technology Haifa, 32000 Israel and Hans Schneider Mathematics Department University of Wisconsin -Madison Madison, Wisconsin 53706 Submitted by Richard A. Bxualdi ABSTRACT A proof is given for the preferred basis theorem for the generalized nullspace of a given M-matrix. The theorem is then generalized and extended to the case of a Z-matrix. 1. INTRODUCTION In this paper we give a proof for a known result, namely, the preferred basis theorem for the generalized nullspace of a given M-matrix. We then generalize and extend the theorem to the case of a Z-matrix. Let A be a Zmatrix. A preferred set is an ordered set of semipositive vectors such that the image of each vector under - A is a nonnegative linear combination of the subsequent vectors. Furthermore, the positivity of the *The research of both authors was supported by their joint grant No. 8500153 from the United States-Israel Binational Science Foundation (BSF), J erusalem, Israel. The second author was supported also by NSF grant DMS8521521 and by ONR grant NOOO14-85K-1613. LINEAR ALGEBRA AND ITS APPLICATlONS 10&S-23 (1988) 5 0 Elsevier Science Publishing Co., Inc., 1988 52 Vanderbilt Ave., New York, NY 10017 0024-3795/88/$3.50 6 DANIEL HERSHKOWITZ AND HANS SCHNEIDER entries of the vectors and the coefficients in the linear combinations depends entirely on the graph structure of A in a specified manner. The preferred basis theorem asserts that the generalized nullspace E(A) of an M-matrix A has a basis which is a preferred set.
    [Show full text]
  • Efficient Computation of the Characteristic Polynomial
    Efficient Computation of the Characteristic Polynomial Jean-Guillaume Dumas∗ and Cl´ement Pernet∗and Zhendong Wan† August 18, 2016 Abstract This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian elimination. We compare it to an improvement of the second algorithm of Keller-Gehrig. Then we show that a generalization of Keller-Gehrig’s third algorithm could improve both complexity and computational time. We use these results as a basis for the computation of the characteristic polynomial of integer matrices. We first use early termination and Chinese remaindering for dense matrices. Then a probabilistic approach, based on integer minimal polynomial and Hensel factorization, is particularly well suited to sparse and/or structured matrices. 1 Introduction Computing the characteristic polynomial of an integer matrix is a classical mathematical problem. It is closely related to the computation of the Frobenius normal form which can be used to test two matrices for similarity. Although the Frobenius normal form contains more information on the matrix than the characteristic polynomial, most algorithms to compute it are based on computations of characteristic polynomial (see for example [23, 9.7] ). Using classic matrix multiplication, the algebraic time complexity§ of the computation of the characteristic polynomial is nowadays optimal. Indeed, many algorithms have a (n3) algebraic time complexity ( to our knowledge the older one is due to Danilevski, describedO in [13, 24]). The fact that the computation of the determinant is proven to be as hard as matrix multiplication§ [2] ensures this optimality.
    [Show full text]
  • 3. Modules 27
    3. Modules 27 3. Modules In linear algebra, the most important structure is that of a vector space over a field. For commutative algebra it is therefore useful to consider the generalization of this concept to the case where the underlying space of scalars is a commutative ring R instead of a field. The resulting structure is called a module; we will introduce and study it in this chapter. In fact, there is another more subtle reason why modules are very powerful: they unify many other structures that you already know. For example, when you first heard about quotient rings you were probably surprised that in order to obtain a quotient ring R=I one needs an ideal I of R, i. e. a structure somewhat different from that of a (sub-)ring. In contrast, we will see in Example 3.4 (a) that ideals as well as quotient rings of R are just special cases of modules over R, so that one can deal with both these structures in the same way. Even more unexpectedly, it turns out that modules over certain rings allow a special interpretation: modules over Z are nothing but Abelian groups, whereas a module over the polynomial ring K[x] over a field K is exactly the same as a K-vector space V together with a linear map j : V ! V (see Examples 3.2 (d) and 3.8, respectively). Consequently, general results on modules will have numerous consequences in many different setups. So let us now start with the definition of modules. In principle, their theory that we will then quickly discuss in this chapter is entirely analogous to that of vector spaces [G2, Chapters 13 to 18].
    [Show full text]