T.S. Blyth – författare

Most of the introductory courses on linear algebra develop the basic theory of finite­ dimensional vector spaces, and in so doing relate the notion of a linear mapping to that of a matrix. Generally speaking, such courses culminate in the diagonalisation of certain matrices and the application of this process to various situations. Such is the case, for example, in our previous SUMS volume Basic Linear Algebra. The present text is a continuation of that volume, and has the objective of introducing the reader to more advanced properties of vector spaces and linear mappings, and consequently of matrices. For readers who are not familiar with the contents of Basic Linear Algebra we provide an introductory chapter that consists of a compact summary of the prerequisites for the present volume. In order to consolidate the student''s understanding we have included a large num­ ber of illustrative and worked examples, as well as many exercises that are strategi­ cally placed throughout the text. Solutions to the exercises are also provided. Many applications of linear algebra require careful, and at times rather tedious, calculations by hand. Very often these are subject to error, so the assistance of a com­ puter is welcome. As far as computation in algebra is concerned, there are several packages available. Here we include, in the spirit of a tutorial, a chapter that gives 1 a brief introduction to the use of MAPLE in dealing with numerical and algebraic problems in linear algebra.

Basic Linear Algebra is a text for first year students leading from concrete examples to abstract theorems, via tutorial-type exercises. More exercises (of the kind a student may expect in examination papers) are grouped at the end of each section. The book covers the most important basics of any first course on linear algebra, explaining the algebra of matrices with applications to analytic geometry, systems of linear equations, difference equations and complex numbers. Linear equations are treated via Hermite normal forms which provides a successful and concrete explanation of the notion of linear independence. Another important highlight is the connection between linear mappings and matrices leading to the change of basis theorem which opens the door to the notion of similarity. This new and revised edition features additional exercises and coverage of Cramer''s rule (omitted from the first edition). However, it is the new, extra chapter on computer assistance that will be ofparticular interest to readers: this will take the form of a tutorial on the use of the "LinearAlgebra" package in MAPLE 7 and will deal with all the aspects of linear algebra developed within the book.

The notion of an order plays an important role ˆ not only throughout mat- maticsbutalsoinadjacentdisciplinessuchaslogicandcomputerscience. The purpose of the present text is to provide a basic introduction to the theory of ordered structures. Taken as a whole, the material is mainly designed for a postgraduate course. However, since prerequisites are minimal, selected parts of it may easily be considered suitable to broaden the horizon of the advanced undergraduate. Indeed, this has been the author’s practice over many years. A basic tool in analysis is the notion of a continuous function, namely a mapping which has the property that the inverse image of an open set is an open set. In the theory of ordered sets there is the corresponding concept of a residuated mapping, this being a mapping which has the property that the inverse image of a principal down-set is a principal down-set. It comes the- fore as no surprise that residuated mappings are important as far as ordered structures are concerned. Indeed, albeit beyond the scope of the present - position, the naturality of residuated mappings can perhaps best be exhibited using categorical concepts. If we regard an ordered set as a small category then an order-preserving mapping f : A? B becomes a functor. Then f is + + residuated if and only if there exists a functor f : B? A such that (f,f ) is an adjoint pair.

The notion of an order plays an important role ˆ not only throughout mat- maticsbutalsoinadjacentdisciplinessuchaslogicandcomputerscience. The purpose of the present text is to provide a basic introduction to the theory of ordered structures. Taken as a whole, the material is mainly designed for a postgraduate course. However, since prerequisites are minimal, selected parts of it may easily be considered suitable to broaden the horizon of the advanced undergraduate. Indeed, this has been the author’s practice over many years. A basic tool in analysis is the notion of a continuous function, namely a mapping which has the property that the inverse image of an open set is an open set. In the theory of ordered sets there is the corresponding concept of a residuated mapping, this being a mapping which has the property that the inverse image of a principal down-set is a principal down-set. It comes the- fore as no surprise that residuated mappings are important as far as ordered structures are concerned. Indeed, albeit beyond the scope of the present - position, the naturality of residuated mappings can perhaps best be exhibited using categorical concepts. If we regard an ordered set as a small category then an order-preserving mapping f : A? B becomes a functor. Then f is + + residuated if and only if there exists a functor f : B? A such that (f,f ) is an adjoint pair.

Most of the introductory courses on linear algebra develop the basic theory of finite­ dimensional vector spaces, and in so doing relate the notion of a linear mapping to that of a matrix. Generally speaking, such courses culminate in the diagonalisation of certain matrices and the application of this process to various situations. Such is the case, for example, in our previous SUMS volume Basic Linear Algebra. The present text is a continuation of that volume, and has the objective of introducing the reader to more advanced properties of vector spaces and linear mappings, and consequently of matrices. For readers who are not familiar with the contents of Basic Linear Algebra we provide an introductory chapter that consists of a compact summary of the prerequisites for the present volume. In order to consolidate the student's understanding we have included a large num­ ber of illustrative and worked examples, as well as many exercises that are strategi­ cally placed throughout the text. Solutions to the exercises are also provided. Many applications of linear algebra require careful, and at times rather tedious, calculations by hand. Very often these are subject to error, so the assistance of a com­ puter is welcome. As far as computation in algebra is concerned, there are several packages available. Here we include, in the spirit of a tutorial, a chapter that gives 1 a brief introduction to the use of MAPLE in dealing with numerical and algebraic problems in linear algebra.

Basic Linear Algebra is a text for first year students leading from concrete examples to abstract theorems, via tutorial-type exercises. More exercises (of the kind a student may expect in examination papers) are grouped at the end of each section. The book covers the most important basics of any first course on linear algebra, explaining the algebra of matrices with applications to analytic geometry, systems of linear equations, difference equations and complex numbers. Linear equations are treated via Hermite normal forms which provides a successful and concrete explanation of the notion of linear independence. Another important highlight is the connection between linear mappings and matrices leading to the change of basis theorem which opens the door to the notion of similarity. This new and revised edition features additional exercises and coverage of Cramer's rule (omitted from the first edition). However, it is the new, extra chapter on computer assistance that will be ofparticular interest to readers: this will take the form of a tutorial on the use of the "LinearAlgebra" package in MAPLE 7 and will deal with all the aspects of linear algebra developed within the book.