X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo-common.tex;h=5971547ed7ddacd1cc7e7739f40d08a32ce632d3;hb=6759e3a5bd5fd13bd239ee851c66d1eac83a7c1b;hp=61ea7c48e7cd8fe0d6ead881d37c5275330b6a0a;hpb=5f2d44683ba6cb73b45d572724e827f70641660d;p=mjotex.git

diff --git a/mjo-common.tex b/mjo-common.tex
index 61ea7c4..5971547 100644
--- a/mjo-common.tex
+++ b/mjo-common.tex
@@ -1,48 +1,66 @@
 %
 % Only the most commonly-used macros. Needed by everything else.
 %
+\ifx\havemjocommon\undefined
+\def\havemjocommon{1}
 
-% Needed for \mathbb.
-\usepackage{amsfonts}
 
-% Place the argument in matching left/right parntheses.
-\providecommand*{\of}[1]{ \left({#1}\right) }
+\input{mjo-font} % amsfonts and \mathpzc
+
+\ifx\bigtimes\undefined
+  \usepackage{mathtools}
+\fi
+
+% Place the argument in matching left/right parentheses.
+\newcommand*{\of}[1]{ \left({#1}\right) }
 
 % Group terms using parentheses.
-\providecommand*{\qty}[1]{ \left({#1}\right) }
+\newcommand*{\qty}[1]{ \left({#1}\right) }
 
 % Group terms using square brackets.
-\providecommand*{\sqty}[1]{ \left[{#1}\right] }
+\newcommand*{\sqty}[1]{ \left[{#1}\right] }
 
 % Create a set from the given elements
-\providecommand*{\set}[1]{\left\lbrace{#1}\right\rbrace}
+\newcommand*{\set}[1]{\left\lbrace{#1}\right\rbrace}
 
 % A set comprehension, where the ``such that...'' bar is added
 % automatically. The bar was chosen over a colon to avoid ambiguity
 % with the L : V -> V notation. We can't leverage \set here because \middle
 % needs \left and \right present.
-\providecommand*{\setc}[2]{\left\lbrace{#1}\ \middle|\ {#2} \right\rbrace}
+\newcommand*{\setc}[2]{\left\lbrace{#1}\ \middle|\ {#2} \right\rbrace}
 
 % A pair of things.
-\providecommand*{\pair}[2]{ \left({#1},{#2}\right) }
+\newcommand*{\pair}[2]{ \left({#1},{#2}\right) }
 
 % A triple of things.
-\providecommand*{\triple}[3]{ \left({#1},{#2},{#3}\right) }
+\newcommand*{\triple}[3]{ \left({#1},{#2},{#3}\right) }
+
+% A four-tuple of things.
+\newcommand*{\quadruple}[4]{ \left({#1},{#2},{#3},{#4}\right) }
+
+% A five-tuple of things.
+\newcommand*{\quintuple}[5]{ \left({#1},{#2},{#3},{#4},{#5}\right) }
+
+% A six-tuple of things.
+\newcommand*{\sextuple}[6]{ \left({#1},{#2},{#3},{#4},{#5},{#6}\right) }
+
+% A seven-tuple of things.
+\newcommand*{\septuple}[7]{ \left({#1},{#2},{#3},{#4},{#5},{#6},{#7}\right) }
 
 % The Cartesian product of two things.
-\providecommand*{\cartprod}[2]{ {#1}\times{#2} }
+\newcommand*{\cartprod}[2]{ {#1}\times{#2} }
 
 % The Cartesian product of three things.
-\providecommand*{\cartprodthree}[3]{ \cartprod{{#1}}{\cartprod{{#2}}{{#3}}} }
+\newcommand*{\cartprodthree}[3]{ \cartprod{{#1}}{\cartprod{{#2}}{{#3}}} }
 
 % The direct sum of two things.
-\providecommand*{\directsum}[2]{ {#1}\oplus{#2} }
+\newcommand*{\directsum}[2]{ {#1}\oplus{#2} }
 
 % The direct sum of three things.
-\providecommand*{\directsumthree}[3]{ \directsum{#1}{\directsum{#2}{#3}} }
+\newcommand*{\directsumthree}[3]{ \directsum{#1}{\directsum{#2}{#3}} }
 
 % The factorial operator.
-\providecommand*{\factorial}[1]{ {#1}! }
+\newcommand*{\factorial}[1]{ {#1}! }
 
 %
 % Product spaces
@@ -54,46 +72,112 @@
 %
 
 % The natural n-space, N x N x N x ... x N.
-\providecommand*{\Nn}[1][n]{
+\newcommand*{\Nn}[1][n]{
   \mathbb{N}\if\detokenize{#1}\detokenize{1}{}\else^{#1}\fi
 }
 
+\ifdefined\newglossaryentry
+  \newglossaryentry{N}{
+    name={\ensuremath{\Nn[1]}},
+    description={the set of natural numbers},
+    sort=N
+  }
+\fi
+
 % The integral n-space, Z x Z x Z x ... x Z.
-\providecommand*{\Zn}[1][n]{
+\newcommand*{\Zn}[1][n]{
   \mathbb{Z}\if\detokenize{#1}\detokenize{1}{}\else^{#1}\fi
 }
 
+\ifdefined\newglossaryentry
+  \newglossaryentry{Z}{
+    name={\ensuremath{\Zn[1]}},
+    description={the ring of integers},
+    sort=Z
+  }
+\fi
+
 % The rational n-space, Q x Q x Q x ... x Q.
-\providecommand*{\Qn}[1][n]{
+\newcommand*{\Qn}[1][n]{
   \mathbb{Q}\if\detokenize{#1}\detokenize{1}{}\else^{#1}\fi
 }
 
+\ifdefined\newglossaryentry
+  \newglossaryentry{Q}{
+    name={\ensuremath{\Qn[1]}},
+    description={the field of rational numbers},
+    sort=Q
+  }
+\fi
+
 % The real n-space, R x R x R x ... x R.
-\providecommand*{\Rn}[1][n]{
+\newcommand*{\Rn}[1][n]{
   \mathbb{R}\if\detokenize{#1}\detokenize{1}{}\else^{#1}\fi
 }
 
+\ifdefined\newglossaryentry
+  \newglossaryentry{R}{
+    name={\ensuremath{\Rn[1]}},
+    description={the field of real numbers},
+    sort=R
+  }
+\fi
+
+
 % The complex n-space, C x C x C x ... x C.
-\providecommand*{\Cn}[1][n]{
+\newcommand*{\Cn}[1][n]{
   \mathbb{C}\if\detokenize{#1}\detokenize{1}{}\else^{#1}\fi
 }
 
+\ifdefined\newglossaryentry
+  \newglossaryentry{C}{
+    name={\ensuremath{\Cn[1]}},
+    description={the field of complex numbers},
+    sort=C
+  }
+\fi
+
+
+% 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
+
 
 %
 % Basic set operations
 %
 
 % The union of its two arguments.
-\providecommand*{\union}[2]{ {#1}\cup{#2} }
+\newcommand*{\union}[2]{ {#1}\cup{#2} }
 
 % A three-argument union.
-\providecommand*{\unionthree}[3]{ \union{\union{#1}{#2}}{#3} }
+\newcommand*{\unionthree}[3]{ \union{\union{#1}{#2}}{#3} }
 
 % The intersection of its two arguments.
-\providecommand*{\intersect}[2]{ {#1}\cap{#2} }
+\newcommand*{\intersect}[2]{ {#1}\cap{#2} }
 
 % A three-argument intersection.
-\providecommand*{\intersectthree}[3]{ \intersect{\intersect{#1}{#2}}{#3} }
+\newcommand*{\intersectthree}[3]{ \intersect{\intersect{#1}{#2}}{#3} }
 
 % An indexed arbitrary binary operation such as the union or
 % intersection of an infinite number of sets. The first argument is
@@ -101,12 +185,33 @@
 % argument is the lower index, for example k=1. The third argument is
 % the upper index, such as \infty. Finally the fourth argument should
 % contain the things (e.g. indexed sets) to be operated on.
-\providecommand*{\binopmany}[4]{
+\newcommand*{\binopmany}[4]{
   \mathchoice{ \underset{#2}{\overset{#3}{#1}}{#4} }
              { {#1}_{#2}^{#3}{#4} }
              { {#1}_{#2}^{#3}{#4} }
              { {#1}_{#2}^{#3}{#4} }
 }
 
-\providecommand*{\unionmany}[3]{ \binopmany{\cup}{#1}{#2}{#3} }
-\providecommand*{\intersectmany}[3]{ \binopmany{\cap}{#1}{#2}{#3} }
+\newcommand*{\intersectmany}[3]{ \binopmany{\bigcap}{#1}{#2}{#3} }
+\newcommand*{\cartprodmany}[3]{ \binopmany{\bigtimes}{#1}{#2}{#3} }
+\newcommand*{\directsummany}[3]{ \binopmany{\bigoplus}{#1}{#2}{#3} }
+\newcommand*{\unionmany}[3]{ \binopmany{\bigcup}{#1}{#2}{#3} }
+
+\newcommand*{\powerset}[1]{\mathpzc{P}\of{{#1}}}
+\ifdefined\newglossaryentry
+  \newglossaryentry{powerset}{
+    name={\ensuremath{\powerset{X}}},
+    description={the ``powerset,'' or set of all subsets of $X$},
+    sort=p
+  }
+\fi
+
+% The four standard (UNLESS YOU'RE FRENCH) types of intervals along
+% the real line.
+\newcommand*{\intervaloo}[2]{ \left({#1},{#2}\right) } % open-open
+\newcommand*{\intervaloc}[2]{ \left({#1},{#2}\right] } % open-closed
+\newcommand*{\intervalco}[2]{ \left[{#1},{#2}\right) } % closed-open
+\newcommand*{\intervalcc}[2]{ \left[{#1},{#2}\right] } % closed-closed
+
+
+\fi