examples.tex: fix existing chktex problems.

[mjotex.git] / mjo-linear_algebra.tex

diff --git a/mjo-linear_algebra.tex b/mjo-linear_algebra.tex
index 172010c6a548e4c7dd77a29f67283941152ce356..d493b9cce5bd047eeb940a972128a6cf7198d261 100644 (file)
--- a/mjo-linear_algebra.tex
+++ b/mjo-linear_algebra.tex
@@ -1,13 +1,26 @@
 %
 % Standard operations from linear algebra.
 %
+\ifx\havemjolinearalgebra\undefined
+\def\havemjolinearalgebra{1}
 
-% Needed for \lvert, \rVert, etc. and \operatorname.
-\usepackage{amsmath}
 
-\input{mjo-common}
+\ifx\lvert\undefined
+  \usepackage{amsmath} % \lvert, \rVert, etc. and \operatorname.
+\fi
 
-% Absolute value (modulis) of a scalar.
+\ifx\ocircle\undefined
+  \usepackage{wasysym}
+\fi
+
+\ifx\clipbox\undefined
+  % Part of the adjustbox package; needed to clip the \perp sign.
+  \usepackage{trimclip}
+\fi
+
+\input{mjo-common} % for \of, at least
+
+% Absolute value (modulus) of a scalar.
 \newcommand*{\abs}[1]{\left\lvert{#1}\right\rvert}
 
 % Norm of a vector.
@@ -31,18 +44,46 @@
 % specialized to real matrices.
 \newcommand*{\transpose}[1]{ #1^{T} }
 
+% The Moore-Penrose (or any other, I guess) pseudo-inverse of its
+% sole argument.
+\newcommand*{\pseudoinverse}[1]{ #1^{+} }
+
+% The trace of an operator.
+\newcommand*{\trace}[1]{ \operatorname{trace}\of{{#1}} }
+
+
+% The "rank" of its argument, which is context-dependent. It can mean
+% any or all of,
+%
+%   * the rank of a matrix,
+%   * the rank of a power-associative algebra (particularly an EJA),
+%   * the rank of an element in a Euclidean Jordan algebra.
+%
+\newcommand*{\rank}[1]{ \operatorname{rank}\of{{#1}} }
+
+
 % The ``span of'' operator. The name \span is already taken.
 \newcommand*{\spanof}[1]{ \operatorname{span}\of{{#1}} }
 
 % The ``co-dimension of'' operator.
 \newcommand*{\codim}{ \operatorname{codim} }
 
-% The trace of an operator.
-\newcommand*{\trace}[1]{ \operatorname{trace}\of{{#1}} }
-
 % The orthogonal projection of its second argument onto the first.
 \newcommand*{\proj}[2] { \operatorname{proj}\of{#1, #2} }
 
+% The set of all eigenvalues of its argument, which should be either a
+% matrix or a linear operator. The sigma notation was chosen instead
+% of lambda so that lambda can be reserved to denote the ordered tuple
+% (largest to smallest) of eigenvalues.
+\newcommand*{\spectrum}[1]{\sigma\of{{#1}}}
+\ifdefined\newglossaryentry
+  \newglossaryentry{spectrum}{
+    name={\ensuremath{\spectrum{L}}},
+    description={the set of all eigenvalues of $L$},
+    sort=s
+  }
+\fi
+
 % The ``Automorphism group of'' operator.
 \newcommand*{\Aut}[1]{ \operatorname{Aut}\of{{#1}} }
 
@@ -56,7 +97,7 @@
 \newcommand*{\matricize}[1]{ \operatorname{mat}\of{{#1}} }
 
 % An inline column vector, with parentheses and a transpose operator.
-\newcommand*{\colvec}[1]{ \left({#1}\right)^{T} }
+\newcommand*{\colvec}[1]{ \transpose{\left({#1}\right)} }
 
 % Bounded linear operators on some space. The required argument is the
 % domain of those operators, and the optional argument is the
@@ -71,3 +112,49 @@
     \fi
   }
 }
+
+
+%
+% Orthogonal direct sum.
+%
+% First declare my ``perp in a circle'' operator, which is meant to be
+% like an \obot or an \operp except has the correct weight circle. It's
+% achieved by overlaying an \ocircle with a \perp, but only after we
+% clip off the top half of the \perp sign and shift it up.
+\DeclareMathOperator{\oplusperp}{\mathbin{
+  \ooalign{
+    $\ocircle$\cr
+    \raisebox{0.625\height}{$\clipbox{0pt 0pt 0pt 0.5\height}{$\perp$}$}\cr
+  }
+}}
+
+% Now declare an orthogonal direct sum in terms of \oplusperp.
+\newcommand*{\directsumperp}[2]{ {#1}\oplusperp{#2} }
+
+
+% The space of real symmetric n-by-n matrices. Does not reduce to
+% merely "S" when n=1 since S^{n} does not mean an n-fold cartesian
+% product of S^{1}.
+\newcommand*{\Sn}[1][n]{ \mathcal{S}^{#1} }
+\ifdefined\newglossaryentry
+  \newglossaryentry{Sn}{
+    name={\ensuremath{\Sn}},
+    description={the set of $n$-by-$n$ real symmetric matrices},
+    sort=Sn
+  }
+\fi
+
+% The space of complex Hermitian n-by-n matrices. Does not reduce to
+% merely "H" when n=1 since H^{n} does not mean an n-fold cartesian
+% product of H^{1}.
+\newcommand*{\Hn}[1][n]{ \mathcal{H}^{#1} }
+\ifdefined\newglossaryentry
+  \newglossaryentry{Hn}{
+    name={\ensuremath{\Hn}},
+    description={the set of $n$-by-$n$ complex Hermitian matrices},
+    sort=Hn
+  }
+\fi
+
+
+\fi