Book contents
- Frontmatter
- Contents
- List of exercises
- Preface to the Series
- Preface
- 1 Vectors
- 2 Matrices
- 3 Vector spaces
- 4 Rank, inverse, and determinant
- 5 Partitioned matrices
- 6 Systems of equations
- 7 Eigenvalues, eigenvectors, and factorizations
- 8 Positive (semi)definite and idempotent matrices
- 9 Matrix functions
- 10 Kronecker product, vec-operator, and Moore-Penrose inverse
- 11 Patterned matrices: commutation- and duplication matrix
- 12 Matrix inequalities
- 13 Matrix calculus
- Appendix A Some mathematical tools
- Appendix B Notation
- Bibliography
- Index
Appendix A - Some mathematical tools
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- List of exercises
- Preface to the Series
- Preface
- 1 Vectors
- 2 Matrices
- 3 Vector spaces
- 4 Rank, inverse, and determinant
- 5 Partitioned matrices
- 6 Systems of equations
- 7 Eigenvalues, eigenvectors, and factorizations
- 8 Positive (semi)definite and idempotent matrices
- 9 Matrix functions
- 10 Kronecker product, vec-operator, and Moore-Penrose inverse
- 11 Patterned matrices: commutation- and duplication matrix
- 12 Matrix inequalities
- 13 Matrix calculus
- Appendix A Some mathematical tools
- Appendix B Notation
- Bibliography
- Index
Summary
This appendix collects mathematical tools that are needed in the main text. In addition, it gives a brief description of some essential background topics. It is assumed that the reader knows elementary calculus. The topics are grouped in four sections. First, we consider some useful methods of indirect proofs. Second, we introduce elementary results for complex numbers and polynomials. The third topic concerns series expansions. Finally, some further calculus is presented.
Some methods of indirect proof
Perhaps the most fundamental of all mathematical tools is the construction of a proof. When a direct proof is hard to obtain, there are indirect methods that can often help. In this section, we will denote a statement by p (such as “I like this book”), and another by q (such as “matrix algebra is interesting”). The negation of p will be denoted by ¬p. The statement “p and q” is denoted by p ∧ q, and the statement “p or q (or both)” is denoted by p ∨ q. The statements ¬(p ∨ q) and ¬p ∧ ¬q are equivalent: the negation transforms p, q into ¬p, ¬q and ∨ into ∧. This is the equivalent of De Morgan's law for sets, where p and q would be sets, ¬p the complement of p, q ∨ q the union of the sets, and p ∧ q their intersection.
- Type
- Chapter
- Information
- Matrix Algebra , pp. 397 - 414Publisher: Cambridge University PressPrint publication year: 2005