| 1 |
%%% ==================================================================== |
| 2 |
%%% filename = testmath.tex |
| 3 |
%%% version = 2.0a |
| 4 |
%%% date = 2023/08/24 |
| 5 |
%%% author = American Mathematical Society |
| 6 |
%%% copyright = Copyright 1995, 1999 American Mathematical Society |
| 7 |
%%% 2023 LaTeX Project. |
| 8 |
%%% License = https://www.latex-project.org/lppl/lppl-1-3c |
| 9 |
%%% keywords = latex, amsmath, examples, documentation |
| 10 |
%%% abstract = This is a test file containing extensive examples of |
| 11 |
%%% mathematical constructs supported by the amsmath |
| 12 |
%%% package." |
| 13 |
%%% ==================================================================== |
| 14 |
\NeedsTeXFormat{LaTeX2e}% LaTeX 2.09 can't be used (nor non-LaTeX) |
| 15 |
[1994/12/01]% LaTeX date must December 1994 or later |
| 16 |
\documentclass[draft]{article} |
| 17 |
\pagestyle{headings} |
| 18 |
|
| 19 |
\title{Sample Paper for the \pkg{amsmath} Package\\ |
| 20 |
File name: \fn{testmath.tex}} |
| 21 |
\author{American Mathematical Society} |
| 22 |
\date{Version 2.0a, 2023/08/24} |
| 23 |
|
| 24 |
\usepackage{amsmath,amsthm} |
| 25 |
|
| 26 |
% Some definitions useful in producing this sort of documentation: |
| 27 |
\chardef\bslash=`\\ % p. 424, TeXbook |
| 28 |
% Normalized (nonbold, nonitalic) tt font, to avoid font |
| 29 |
% substitution warning messages if tt is used inside section |
| 30 |
% headings and other places where odd font combinations might |
| 31 |
% result. |
| 32 |
\newcommand{\ntt}{\normalfont\ttfamily} |
| 33 |
% command name |
| 34 |
\newcommand{\cn}[1]{{\protect\ntt\bslash#1}} |
| 35 |
% LaTeX package name |
| 36 |
\newcommand{\pkg}[1]{{\protect\ntt#1}} |
| 37 |
% File name |
| 38 |
\newcommand{\fn}[1]{{\protect\ntt#1}} |
| 39 |
% environment name |
| 40 |
\newcommand{\env}[1]{{\protect\ntt#1}} |
| 41 |
\hfuzz1pc % Don't bother to report overfull boxes if overage is < 1pc |
| 42 |
|
| 43 |
% Theorem environments |
| 44 |
|
| 45 |
%% \theoremstyle{plain} %% This is the default |
| 46 |
\newtheorem{thm}{Theorem}[section] |
| 47 |
\newtheorem{cor}[thm]{Corollary} |
| 48 |
\newtheorem{lem}[thm]{Lemma} |
| 49 |
\newtheorem{prop}[thm]{Proposition} |
| 50 |
\newtheorem{ax}{Axiom} |
| 51 |
|
| 52 |
\theoremstyle{definition} |
| 53 |
\newtheorem{defn}{Definition}[section] |
| 54 |
|
| 55 |
\theoremstyle{remark} |
| 56 |
\newtheorem{rem}{Remark}[section] |
| 57 |
\newtheorem*{notation}{Notation} |
| 58 |
|
| 59 |
%\numberwithin{equation}{section} |
| 60 |
|
| 61 |
\newcommand{\thmref}[1]{Theorem~\ref{#1}} |
| 62 |
\newcommand{\secref}[1]{\S\ref{#1}} |
| 63 |
\newcommand{\lemref}[1]{Lemma~\ref{#1}} |
| 64 |
|
| 65 |
\newcommand{\bysame}{\mbox{\rule{3em}{.4pt}}\,} |
| 66 |
|
| 67 |
% Math definitions |
| 68 |
|
| 69 |
\newcommand{\A}{\mathcal{A}} |
| 70 |
\newcommand{\B}{\mathcal{B}} |
| 71 |
\newcommand{\st}{\sigma} |
| 72 |
\newcommand{\XcY}{{(X,Y)}} |
| 73 |
\newcommand{\SX}{{S_X}} |
| 74 |
\newcommand{\SY}{{S_Y}} |
| 75 |
\newcommand{\SXY}{{S_{X,Y}}} |
| 76 |
\newcommand{\SXgYy}{{S_{X|Y}(y)}} |
| 77 |
\newcommand{\Cw}[1]{{\hat C_#1(X|Y)}} |
| 78 |
\newcommand{\G}{{G(X|Y)}} |
| 79 |
\newcommand{\PY}{{P_{\mathcal{Y}}}} |
| 80 |
\newcommand{\X}{\mathcal{X}} |
| 81 |
\newcommand{\wt}{\widetilde} |
| 82 |
\newcommand{\wh}{\widehat} |
| 83 |
|
| 84 |
\DeclareMathOperator{\per}{per} |
| 85 |
\DeclareMathOperator{\cov}{cov} |
| 86 |
\DeclareMathOperator{\non}{non} |
| 87 |
\DeclareMathOperator{\cf}{cf} |
| 88 |
\DeclareMathOperator{\add}{add} |
| 89 |
\DeclareMathOperator{\Cham}{Cham} |
| 90 |
\DeclareMathOperator{\IM}{Im} |
| 91 |
\DeclareMathOperator{\esssup}{ess\,sup} |
| 92 |
\DeclareMathOperator{\meas}{meas} |
| 93 |
\DeclareMathOperator{\seg}{seg} |
| 94 |
|
| 95 |
% \interval is used to provide better spacing after a [ that |
| 96 |
% is used as a closing delimiter. |
| 97 |
\newcommand{\interval}[1]{\mathinner{#1}} |
| 98 |
|
| 99 |
% Notation for an expression evaluated at a particular condition. The |
| 100 |
% optional argument can be used to override automatic sizing of the |
| 101 |
% right vert bar, e.g. \eval[\biggr]{...}_{...} |
| 102 |
\newcommand{\eval}[2][\right]{\relax |
| 103 |
\ifx#1\right\relax \left.\fi#2#1\rvert} |
| 104 |
|
| 105 |
% Enclose the argument in vert-bar delimiters: |
| 106 |
\newcommand{\envert}[1]{\left\lvert#1\right\rvert} |
| 107 |
\let\abs=\envert |
| 108 |
|
| 109 |
% Enclose the argument in double-vert-bar delimiters: |
| 110 |
\newcommand{\enVert}[1]{\left\lVert#1\right\rVert} |
| 111 |
\let\norm=\enVert |
| 112 |
|
| 113 |
\begin{document} |
| 114 |
\maketitle |
| 115 |
\markboth{Sample paper for the {\protect\ntt\lowercase{amsmath}} package} |
| 116 |
{Sample paper for the {\protect\ntt\lowercase{amsmath}} package} |
| 117 |
\renewcommand{\sectionmark}[1]{} |
| 118 |
|
| 119 |
\section{Introduction} |
| 120 |
|
| 121 |
This paper contains examples of various features from \AmS-\LaTeX{}. |
| 122 |
|
| 123 |
\section{Enumeration of Hamiltonian paths in a graph} |
| 124 |
|
| 125 |
Let $\mathbf{A}=(a_{ij})$ be the adjacency matrix of graph $G$. The |
| 126 |
corresponding Kirchhoff matrix $\mathbf{K}=(k_{ij})$ is obtained from |
| 127 |
$\mathbf{A}$ by replacing in $-\mathbf{A}$ each diagonal entry by the |
| 128 |
degree of its corresponding vertex; i.e., the $i$th diagonal entry is |
| 129 |
identified with the degree of the $i$th vertex. It is well known that |
| 130 |
\begin{equation} |
| 131 |
\det\mathbf{K}(i|i)=\text{ the number of spanning trees of $G$}, |
| 132 |
\quad i=1,\dots,n |
| 133 |
\end{equation} |
| 134 |
where $\mathbf{K}(i|i)$ is the $i$th principal submatrix of |
| 135 |
$\mathbf{K}$. |
| 136 |
\begin{verbatim} |
| 137 |
\det\mathbf{K}(i|i)=\text{ the number of spanning trees of $G$}, |
| 138 |
\end{verbatim} |
| 139 |
|
| 140 |
Let $C_{i(j)}$ be the set of graphs obtained from $G$ by attaching edge |
| 141 |
$(v_iv_j)$ to each spanning tree of $G$. Denote by $C_i=\bigcup_j |
| 142 |
C_{i(j)}$. It is obvious that the collection of Hamiltonian cycles is a |
| 143 |
subset of $C_i$. Note that the cardinality of $C_i$ is $k_{ii}\det |
| 144 |
\mathbf{K}(i|i)$. Let $\wh X=\{\hat x_1,\dots,\hat x_n\}$. |
| 145 |
\begin{verbatim} |
| 146 |
$\wh X=\{\hat x_1,\dots,\hat x_n\}$ |
| 147 |
\end{verbatim} |
| 148 |
Define multiplication for the elements of $\wh X$ by |
| 149 |
\begin{equation}\label{multdef} |
| 150 |
\hat x_i\hat x_j=\hat x_j\hat x_i,\quad \hat x^2_i=0,\quad |
| 151 |
i,j=1,\dots,n. |
| 152 |
\end{equation} |
| 153 |
Let $\hat k_{ij}=k_{ij}\hat x_j$ and $\hat k_{ij}=-\sum_{j\not=i} \hat |
| 154 |
k_{ij}$. Then the number of Hamiltonian cycles $H_c$ is given by the |
| 155 |
relation \cite{liuchow:formalsum} |
| 156 |
\begin{equation}\label{H-cycles} |
| 157 |
\biggl(\prod^n_{\,j=1}\hat x_j\biggr)H_c=\frac{1}{2}\hat k_{ij}\det |
| 158 |
\wh{\mathbf{K}}(i|i),\qquad i=1,\dots,n. |
| 159 |
\end{equation} |
| 160 |
The task here is to express \eqref{H-cycles} |
| 161 |
in a form free of any $\hat x_i$, |
| 162 |
$i=1,\dots,n$. The result also leads to the resolution of enumeration of |
| 163 |
Hamiltonian paths in a graph. |
| 164 |
|
| 165 |
It is well known that the enumeration of Hamiltonian cycles and paths in |
| 166 |
a complete graph $K_n$ and in a complete bipartite graph $K_{n_1n_2}$ |
| 167 |
can only be found from \textit{first combinatorial principles} |
| 168 |
\cite{hapa:graphenum}. One wonders if there exists a formula which can |
| 169 |
be used very efficiently to produce $K_n$ and $K_{n_1n_2}$. Recently, |
| 170 |
using Lagrangian methods, Goulden and Jackson have shown that $H_c$ can |
| 171 |
be expressed in terms of the determinant and permanent of the adjacency |
| 172 |
matrix \cite{gouja:lagrmeth}. However, the formula of Goulden and |
| 173 |
Jackson determines neither $K_n$ nor $K_{n_1n_2}$ effectively. In this |
| 174 |
paper, using an algebraic method, we parametrize the adjacency matrix. |
| 175 |
The resulting formula also involves the determinant and permanent, but |
| 176 |
it can easily be applied to $K_n$ and $K_{n_1n_2}$. In addition, we |
| 177 |
eliminate the permanent from $H_c$ and show that $H_c$ can be |
| 178 |
represented by a determinantal function of multivariables, each variable |
| 179 |
with domain $\{0,1\}$. Furthermore, we show that $H_c$ can be written by |
| 180 |
number of spanning trees of subgraphs. Finally, we apply the formulas to |
| 181 |
a complete multigraph $K_{n_1\dots n_p}$. |
| 182 |
|
| 183 |
The conditions $a_{ij}=a_{ji}$, $i,j=1,\dots,n$, are not required in |
| 184 |
this paper. All formulas can be extended to a digraph simply by |
| 185 |
multiplying $H_c$ by 2. |
| 186 |
|
| 187 |
\section{Main Theorem} |
| 188 |
\label{s:mt} |
| 189 |
|
| 190 |
\begin{notation} For $p,q\in P$ and $n\in\omega$ we write |
| 191 |
$(q,n)\le(p,n)$ if $q\le p$ and $A_{q,n}=A_{p,n}$. |
| 192 |
\begin{verbatim} |
| 193 |
\begin{notation} For $p,q\in P$ and $n\in\omega$ |
| 194 |
... |
| 195 |
\end{notation} |
| 196 |
\end{verbatim} |
| 197 |
\end{notation} |
| 198 |
|
| 199 |
Let $\mathbf{B}=(b_{ij})$ be an $n\times n$ matrix. Let $\mathbf{n}=\{1, |
| 200 |
\dots,n\}$. Using the properties of \eqref{multdef}, it is readily seen |
| 201 |
that |
| 202 |
|
| 203 |
\begin{lem}\label{lem-per} |
| 204 |
\begin{equation} |
| 205 |
\prod_{i\in\mathbf{n}} |
| 206 |
\biggl(\sum_{\,j\in\mathbf{n}}b_{ij}\hat x_i\biggr) |
| 207 |
=\biggl(\prod_{\,i\in\mathbf{n}}\hat x_i\biggr)\per \mathbf{B} |
| 208 |
\end{equation} |
| 209 |
where $\per \mathbf{B}$ is the permanent of $\mathbf{B}$. |
| 210 |
\end{lem} |
| 211 |
|
| 212 |
Let $\wh Y=\{\hat y_1,\dots,\hat y_n\}$. Define multiplication |
| 213 |
for the elements of $\wh Y$ by |
| 214 |
\begin{equation} |
| 215 |
\hat y_i\hat y_j+\hat y_j\hat y_i=0,\quad i,j=1,\dots,n. |
| 216 |
\end{equation} |
| 217 |
Then, it follows that |
| 218 |
\begin{lem}\label{lem-det} |
| 219 |
\begin{equation}\label{detprod} |
| 220 |
\prod_{i\in\mathbf{n}} |
| 221 |
\biggl(\sum_{\,j\in\mathbf{n}}b_{ij}\hat y_j\biggr) |
| 222 |
=\biggl(\prod_{\,i\in\mathbf{n}}\hat y_i\biggr)\det\mathbf{B}. |
| 223 |
\end{equation} |
| 224 |
\end{lem} |
| 225 |
|
| 226 |
Note that all basic properties of determinants are direct consequences |
| 227 |
of Lemma~\ref{lem-det}. Write |
| 228 |
\begin{equation}\label{sum-bij} |
| 229 |
\sum_{j\in\mathbf{n}}b_{ij}\hat y_j=\sum_{j\in\mathbf{n}}b^{(\lambda)} |
| 230 |
_{ij}\hat y_j+(b_{ii}-\lambda_i)\hat y_i\hat y |
| 231 |
\end{equation} |
| 232 |
where |
| 233 |
\begin{equation} |
| 234 |
b^{(\lambda)}_{ii}=\lambda_i,\quad b^{(\lambda)}_{ij}=b_{ij}, |
| 235 |
\quad i\not=j. |
| 236 |
\end{equation} |
| 237 |
Let $\mathbf{B}^{(\lambda)}=(b^{(\lambda)}_{ij})$. By \eqref{detprod} |
| 238 |
and \eqref{sum-bij}, it is |
| 239 |
straightforward to show the following |
| 240 |
result: |
| 241 |
\begin{thm}\label{thm-main} |
| 242 |
\begin{equation}\label{detB} |
| 243 |
\det\mathbf{B}= |
| 244 |
\sum^n_{l =0}\sum_{I_l \subseteq n} |
| 245 |
\prod_{i\in I_l}(b_{ii}-\lambda_i) |
| 246 |
\det\mathbf{B}^{(\lambda)}(I_l |I_l ), |
| 247 |
\end{equation} |
| 248 |
where $I_l =\{i_1,\dots,i_l \}$ and $\mathbf{B}^{(\lambda)}(I_l |I_l )$ |
| 249 |
is the principal submatrix obtained from $\mathbf{B}^{(\lambda)}$ |
| 250 |
by deleting its $i_1,\dots,i_l $ rows and columns. |
| 251 |
\end{thm} |
| 252 |
|
| 253 |
\begin{rem} |
| 254 |
Let $\mathbf{M}$ be an $n\times n$ matrix. The convention |
| 255 |
$\mathbf{M}(\mathbf{n}|\mathbf{n})=1$ has been used in \eqref{detB} and |
| 256 |
hereafter. |
| 257 |
\end{rem} |
| 258 |
|
| 259 |
Before proceeding with our discussion, we pause to note that |
| 260 |
\thmref{thm-main} yields immediately a fundamental formula which can be |
| 261 |
used to compute the coefficients of a characteristic polynomial |
| 262 |
\cite{mami:matrixth}: |
| 263 |
\begin{cor}\label{BI} |
| 264 |
Write $\det(\mathbf{B}-x\mathbf{I})=\sum^n_{l =0}(-1) |
| 265 |
^l b_l x^l $. Then |
| 266 |
\begin{equation}\label{bl-sum} |
| 267 |
b_l =\sum_{I_l \subseteq\mathbf{n}}\det\mathbf{B}(I_l |I_l ). |
| 268 |
\end{equation} |
| 269 |
\end{cor} |
| 270 |
Let |
| 271 |
\begin{equation} |
| 272 |
\mathbf{K}(t,t_1,\dots,t_n) |
| 273 |
=\begin{pmatrix} D_1t&-a_{12}t_2&\dots&-a_{1n}t_n\\ |
| 274 |
-a_{21}t_1&D_2t&\dots&-a_{2n}t_n\\ |
| 275 |
\hdotsfor[2]{4}\\ |
| 276 |
-a_{n1}t_1&-a_{n2}t_2&\dots&D_nt\end{pmatrix}, |
| 277 |
\end{equation} |
| 278 |
\begin{verbatim} |
| 279 |
\begin{pmatrix} D_1t&-a_{12}t_2&\dots&-a_{1n}t_n\\ |
| 280 |
-a_{21}t_1&D_2t&\dots&-a_{2n}t_n\\ |
| 281 |
\hdotsfor[2]{4}\\ |
| 282 |
-a_{n1}t_1&-a_{n2}t_2&\dots&D_nt\end{pmatrix} |
| 283 |
\end{verbatim} |
| 284 |
where |
| 285 |
\begin{equation} |
| 286 |
D_i=\sum_{j\in\mathbf{n}}a_{ij}t_j,\quad i=1,\dots,n. |
| 287 |
\end{equation} |
| 288 |
|
| 289 |
Set |
| 290 |
\begin{equation*} |
| 291 |
D(t_1,\dots,t_n)=\frac{\delta}{\delta t}\eval{\det\mathbf{K}(t,t_1,\dots,t_n) |
| 292 |
}_{t=1}. |
| 293 |
\end{equation*} |
| 294 |
Then |
| 295 |
\begin{equation}\label{sum-Di} |
| 296 |
D(t_1,\dots,t_n) |
| 297 |
=\sum_{i\in\mathbf{n}}D_i\det\mathbf{K}(t=1,t_1,\dots,t_n; i|i), |
| 298 |
\end{equation} |
| 299 |
where $\mathbf{K}(t=1,t_1,\dots,t_n; i|i)$ is the $i$th principal |
| 300 |
submatrix of $\mathbf{K}(t=1,t_1,\dots,t_n)$. |
| 301 |
|
| 302 |
Theorem~\ref{thm-main} leads to |
| 303 |
\begin{equation}\label{detK1} |
| 304 |
\det\mathbf{K}(t_1,t_1,\dots,t_n) |
| 305 |
=\sum_{I\in\mathbf{n}}(-1)^{\envert{I}}t^{n-\envert{I}} |
| 306 |
\prod_{i\in I}t_i\prod_{j\in I}(D_j+\lambda_jt_j)\det\mathbf{A} |
| 307 |
^{(\lambda t)}(\overline{I}|\overline I). |
| 308 |
\end{equation} |
| 309 |
Note that |
| 310 |
\begin{equation}\label{detK2} |
| 311 |
\det\mathbf{K}(t=1,t_1,\dots,t_n)=\sum_{I\in\mathbf{n}}(-1)^{\envert{I}} |
| 312 |
\prod_{i\in I}t_i\prod_{j\in I}(D_j+\lambda_jt_j)\det\mathbf{A} |
| 313 |
^{(\lambda)}(\overline{I}|\overline{I})=0. |
| 314 |
\end{equation} |
| 315 |
|
| 316 |
Let $t_i=\hat x_i,i=1,\dots,n$. Lemma~\ref{lem-per} yields |
| 317 |
\begin{multline} |
| 318 |
\biggl(\sum_{\,i\in\mathbf{n}}a_{l _i}x_i\biggr) |
| 319 |
\det\mathbf{K}(t=1,x_1,\dots,x_n;l |l )\\ |
| 320 |
=\biggl(\prod_{\,i\in\mathbf{n}}\hat x_i\biggr) |
| 321 |
\sum_{I\subseteq\mathbf{n}-\{l \}} |
| 322 |
(-1)^{\envert{I}}\per\mathbf{A}^{(\lambda)}(I|I) |
| 323 |
\det\mathbf{A}^{(\lambda)} |
| 324 |
(\overline I\cup\{l \}|\overline I\cup\{l \}). |
| 325 |
\label{sum-ali} |
| 326 |
\end{multline} |
| 327 |
\begin{verbatim} |
| 328 |
\begin{multline} |
| 329 |
\biggl(\sum_{\,i\in\mathbf{n}}a_{l _i}x_i\biggr) |
| 330 |
\det\mathbf{K}(t=1,x_1,\dots,x_n;l |l )\\ |
| 331 |
=\biggl(\prod_{\,i\in\mathbf{n}}\hat x_i\biggr) |
| 332 |
\sum_{I\subseteq\mathbf{n}-\{l \}} |
| 333 |
(-1)^{\envert{I}}\per\mathbf{A}^{(\lambda)}(I|I) |
| 334 |
\det\mathbf{A}^{(\lambda)} |
| 335 |
(\overline I\cup\{l \}|\overline I\cup\{l \}). |
| 336 |
\label{sum-ali} |
| 337 |
\end{multline} |
| 338 |
\end{verbatim} |
| 339 |
|
| 340 |
By \eqref{H-cycles}, \eqref{detprod}, and \eqref{sum-bij}, we have |
| 341 |
\begin{prop}\label{prop:eg} |
| 342 |
\begin{equation} |
| 343 |
H_c=\frac1{2n}\sum^n_{l =0}(-1)^{l} |
| 344 |
D_{l}, |
| 345 |
\end{equation} |
| 346 |
where |
| 347 |
\begin{equation}\label{delta-l} |
| 348 |
D_{l}=\eval[2]{\sum_{I_{l}\subseteq \mathbf{n}} |
| 349 |
D(t_1,\dots,t_n)}_{t_i=\left\{\begin{smallmatrix} |
| 350 |
0,& \text{if }i\in I_{l}\quad\\% \quad added for centering |
| 351 |
1,& \text{otherwise}\end{smallmatrix}\right.\;,\;\; i=1,\dots,n}. |
| 352 |
\end{equation} |
| 353 |
\end{prop} |
| 354 |
|
| 355 |
\section{Application} |
| 356 |
\label{lincomp} |
| 357 |
|
| 358 |
We consider here the applications of Theorems~\ref{th-info-ow-ow} |
| 359 |
and~\ref{th-weak-ske-owf} to a complete |
| 360 |
multipartite graph $K_{n_1\dots n_p}$. It can be shown that the |
| 361 |
number of spanning trees of $K_{n_1\dots n_p}$ |
| 362 |
may be written |
| 363 |
\begin{equation}\label{e:st} |
| 364 |
T=n^{p-2}\prod^p_{i=1} |
| 365 |
(n-n_i)^{n_i-1} |
| 366 |
\end{equation} |
| 367 |
where |
| 368 |
\begin{equation} |
| 369 |
n=n_1+\dots+n_p. |
| 370 |
\end{equation} |
| 371 |
|
| 372 |
It follows from Theorems~\ref{th-info-ow-ow} and~\ref{th-weak-ske-owf} that |
| 373 |
\begin{equation}\label{e:barwq} |
| 374 |
\begin{split} |
| 375 |
H_c&=\frac1{2n} |
| 376 |
\sum^n_{{l}=0}(-1)^{l}(n-{l})^{p-2} |
| 377 |
\sum_{l _1+\dots+l _p=l}\prod^p_{i=1} |
| 378 |
\binom{n_i}{l _i}\\ |
| 379 |
&\quad\cdot[(n-l )-(n_i-l _i)]^{n_i-l _i}\cdot |
| 380 |
\biggl[(n-l )^2-\sum^p_{j=1}(n_i-l _i)^2\biggr].\end{split} |
| 381 |
\end{equation} |
| 382 |
\begin{verbatim} |
| 383 |
... \binom{n_i}{l _i}\\ |
| 384 |
\end{verbatim} |
| 385 |
and |
| 386 |
\begin{equation}\label{joe} |
| 387 |
\begin{split} |
| 388 |
H_c&=\frac12\sum^{n-1}_{l =0} |
| 389 |
(-1)^{l}(n-l )^{p-2} |
| 390 |
\sum_{l _1+\dots+l _p=l} |
| 391 |
\prod^p_{i=1}\binom{n_i}{l _i}\\ |
| 392 |
&\quad\cdot[(n-l )-(n_i-l _i)]^{n_i-l _i} |
| 393 |
\left(1-\frac{l _p}{n_p}\right) |
| 394 |
[(n-l )-(n_p-l _p)]. |
| 395 |
\end{split} |
| 396 |
\end{equation} |
| 397 |
|
| 398 |
The enumeration of $H_c$ in a $K_{n_1\dotsm n_p}$ graph can also be |
| 399 |
carried out by Theorem~\ref{thm-H-param} or~\ref{thm-asym} |
| 400 |
together with the algebraic method of \eqref{multdef}. |
| 401 |
Some elegant representations may be obtained. For example, $H_c$ in |
| 402 |
a $K_{n_1n_2n_3}$ graph may be written |
| 403 |
\begin{equation}\label{j:mark} |
| 404 |
\begin{split} |
| 405 |
H_c=& |
| 406 |
\frac{n_1!\,n_2!\,n_3!} |
| 407 |
{n_1+n_2+n_3}\sum_i\left[\binom{n_1}{i} |
| 408 |
\binom{n_2}{n_3-n_1+i}\binom{n_3}{n_3-n_2+i}\right.\\ |
| 409 |
&+\left.\binom{n_1-1}{i} |
| 410 |
\binom{n_2-1}{n_3-n_1+i} |
| 411 |
\binom{n_3-1}{n_3-n_2+i}\right].\end{split} |
| 412 |
\end{equation} |
| 413 |
|
| 414 |
\section{Secret Key Exchanges} |
| 415 |
\label{SKE} |
| 416 |
|
| 417 |
Modern cryptography is fundamentally concerned with the problem of |
| 418 |
secure private communication. A Secret Key Exchange is a protocol |
| 419 |
where Alice and Bob, having no secret information in common to start, |
| 420 |
are able to agree on a common secret key, conversing over a public |
| 421 |
channel. The notion of a Secret Key Exchange protocol was first |
| 422 |
introduced in the seminal paper of Diffie and Hellman |
| 423 |
\cite{dihe:newdir}. \cite{dihe:newdir} presented a concrete |
| 424 |
implementation of a Secret Key Exchange protocol, dependent on a |
| 425 |
specific assumption (a variant on the discrete log), specially |
| 426 |
tailored to yield Secret Key Exchange. Secret Key Exchange is of |
| 427 |
course trivial if trapdoor permutations exist. However, there is no |
| 428 |
known implementation based on a weaker general assumption. |
| 429 |
|
| 430 |
The concept of an informationally one-way function was introduced |
| 431 |
in \cite{imlelu:oneway}. We give only an informal definition here: |
| 432 |
|
| 433 |
\begin{defn} A polynomial time |
| 434 |
computable function $f = \{f_k\}$ is informationally |
| 435 |
one-way if there is no probabilistic polynomial time algorithm which |
| 436 |
(with probability of the form $1 - k^{-e}$ for some $e > 0$) |
| 437 |
returns on input $y \in \{0,1\}^{k}$ a random element of $f^{-1}(y)$. |
| 438 |
\end{defn} |
| 439 |
In the non-uniform setting \cite{imlelu:oneway} show that these are not |
| 440 |
weaker than one-way functions: |
| 441 |
\begin{thm}[\cite{imlelu:oneway} (non-uniform)] |
| 442 |
\label{th-info-ow-ow} |
| 443 |
The existence of informationally one-way functions |
| 444 |
implies the existence of one-way functions. |
| 445 |
\end{thm} |
| 446 |
We will stick to the convention introduced above of saying |
| 447 |
``non-uniform'' before the theorem statement when the theorem |
| 448 |
makes use of non-uniformity. It should be understood that |
| 449 |
if nothing is said then the result holds for both the uniform and |
| 450 |
the non-uniform models. |
| 451 |
|
| 452 |
It now follows from \thmref{th-info-ow-ow} that |
| 453 |
|
| 454 |
\begin{thm}[non-uniform]\label{th-weak-ske-owf} Weak SKE |
| 455 |
implies the existence of a one-way function. |
| 456 |
\end{thm} |
| 457 |
|
| 458 |
More recently, the polynomial-time, interior point algorithms for linear |
| 459 |
programming have been extended to the case of convex quadratic programs |
| 460 |
\cite{moad:quadpro,ye:intalg}, certain linear complementarity problems |
| 461 |
\cite{komiyo:lincomp,miyoki:lincomp}, and the nonlinear complementarity |
| 462 |
problem \cite{komiyo:unipfunc}. The connection between these algorithms |
| 463 |
and the classical Newton method for nonlinear equations is well |
| 464 |
explained in \cite{komiyo:lincomp}. |
| 465 |
|
| 466 |
\section{Review} |
| 467 |
\label{computation} |
| 468 |
|
| 469 |
We begin our discussion with the following definition: |
| 470 |
|
| 471 |
\begin{defn} |
| 472 |
|
| 473 |
A function $H\colon \Re^n \to \Re^n$ is said to be |
| 474 |
\emph{B-differentiable} at the point $z$ if (i)~$H$ is Lipschitz |
| 475 |
continuous in a neighborhood of $z$, and (ii)~there exists a positive |
| 476 |
homogeneous function $BH(z)\colon \Re^n \to \Re^n$, called the |
| 477 |
\emph{B-derivative} of $H$ at $z$, such that |
| 478 |
\[ \lim_{v \to 0} \frac{H(z+v) - H(z) - BH(z)v}{\enVert{v}} = 0. \] |
| 479 |
The function $H$ is \textit{B-differentiable in set $S$} if it is |
| 480 |
B-differentiable at every point in $S$. The B-derivative $BH(z)$ is said |
| 481 |
to be \textit{strong} if |
| 482 |
\[ \lim_{(v,v') \to (0,0)} \frac{H(z+v) - H(z+v') - BH(z)(v |
| 483 |
-v')}{\enVert{v - v'}} = 0. \] |
| 484 |
\end{defn} |
| 485 |
|
| 486 |
|
| 487 |
\begin{lem}\label{limbog} There exists a smooth function $\psi_0(z)$ |
| 488 |
defined for $\abs{z}>1-2a$ satisfying the following properties\textup{:} |
| 489 |
\begin{enumerate} |
| 490 |
\renewcommand{\labelenumi}{(\roman{enumi})} |
| 491 |
\item $\psi_0(z)$ is bounded above and below by positive constants |
| 492 |
$c_1\leq \psi_0(z)\leq c_2$. |
| 493 |
\item If $\abs{z}>1$, then $\psi_0(z)=1$. |
| 494 |
\item For all $z$ in the domain of $\psi_0$, $\Delta_0\ln \psi_0\geq 0$. |
| 495 |
\item If $1-2a<\abs{z}<1-a$, then $\Delta_0\ln \psi_0\geq |
| 496 |
c_3>0$. |
| 497 |
\end{enumerate} |
| 498 |
\end{lem} |
| 499 |
|
| 500 |
\begin{proof} |
| 501 |
We choose $\psi_0(z)$ to be a radial function depending only on $r=\abs{z}$. |
| 502 |
Let $h(r)\geq 0$ be a suitable smooth function satisfying $h(r)\geq c_3$ |
| 503 |
for $1-2a<\abs{z}<1-a$, and $h(r)=0$ for $\abs{z}>1-\tfrac a2$. The radial |
| 504 |
Laplacian |
| 505 |
\[\Delta_0\ln\psi_0(r)=\left(\frac {d^2}{dr^2}+\frac |
| 506 |
1r\frac d{dr}\right)\ln\psi_0(r)\] |
| 507 |
has smooth coefficients for $r>1-2a$. Therefore, we may |
| 508 |
apply the existence and uniqueness theory for ordinary differential |
| 509 |
equations. Simply let $\ln \psi_0(r)$ be the solution of the differential |
| 510 |
equation |
| 511 |
\[\left(\frac{d^2}{dr^2}+\frac 1r\frac d{dr}\right)\ln \psi_0(r)=h(r)\] |
| 512 |
with initial conditions given by $\ln \psi_0(1)=0$ and |
| 513 |
$\ln\psi_0'(1)=0$. |
| 514 |
|
| 515 |
Next, let $D_\nu$ be a finite collection of pairwise disjoint disks, |
| 516 |
all of which are contained in the unit disk centered at the origin in |
| 517 |
$C$. We assume that $D_\nu=\{z\mid \abs{z-z_\nu}<\delta\}$. Suppose that |
| 518 |
$D_\nu(a)$ denotes the smaller concentric disk $D_\nu(a)=\{z\mid |
| 519 |
\abs{z-z_\nu}\leq (1-2a)\delta\}$. We define a smooth weight function |
| 520 |
$\Phi_0(z)$ for $z\in C-\bigcup_\nu D_\nu(a)$ by setting $\Phi_ |
| 521 |
0(z)=1$ when $z\notin \bigcup_\nu D_\nu$ and $\Phi_ |
| 522 |
0(z)=\psi_0((z-z_\nu)/\delta)$ when $z$ is an element of $D_\nu$. It |
| 523 |
follows from \lemref{limbog} that $\Phi_ 0$ satisfies the properties: |
| 524 |
\begin{enumerate} |
| 525 |
\renewcommand{\labelenumi}{(\roman{enumi})} |
| 526 |
\item \label{boundab}$\Phi_ 0(z)$ is bounded above and below by |
| 527 |
positive constants $c_1\leq \Phi_ 0(z)\leq c_2$. |
| 528 |
\item \label{d:over}$\Delta_0\ln\Phi_ 0\geq 0$ for all |
| 529 |
$z\in C-\bigcup_\nu D_\nu(a)$, |
| 530 |
the domain where the function $\Phi_ 0$ is defined. |
| 531 |
\item \label{d:ad}$\Delta_0\ln\Phi_ 0\geq c_3\delta^{-2}$ |
| 532 |
when $(1-2a)\delta<\abs{z-z_\nu}<(1-a)\delta$. |
| 533 |
\end{enumerate} |
| 534 |
Let $A_\nu$ denote the annulus $A_\nu=\{(1-2a)\delta<\abs{z-z_\nu}<(1-a) |
| 535 |
\delta \}$, and set $A=\bigcup_\nu A_\nu$. The |
| 536 |
properties (\ref{d:over}) and (\ref{d:ad}) of $\Phi_ 0$ |
| 537 |
may be summarized as $\Delta_0\ln \Phi_ 0\geq c_3\delta^{-2}\chi_A$, |
| 538 |
where $\chi _A$ is the characteristic function of $A$. |
| 539 |
\end{proof} |
| 540 |
|
| 541 |
Suppose that $\alpha$ is a nonnegative real constant. We apply |
| 542 |
Proposition~\ref{prop:eg} with $\Phi(z)=\Phi_ 0(z) e^{\alpha\abs{z}^2}$. If |
| 543 |
$u\in C^\infty_0(R^2-\bigcup_\nu D_\nu(a))$, assume that $\mathcal{D}$ |
| 544 |
is a bounded domain containing the support of $u$ and $A\subset |
| 545 |
\mathcal{D}\subset R^2-\bigcup_\nu D_\nu(a)$. A calculation gives |
| 546 |
\[\int_{\mathcal{D}}\abs{\overline\partial u}^2\Phi_ 0(z) e^{\alpha\abs{z}^2} |
| 547 |
\geq c_4\alpha\int_{\mathcal{D}}\abs{u}^2\Phi_ 0e^{\alpha\abs{z}^2} |
| 548 |
+c_5\delta^{-2}\int_ A\abs{u}^2\Phi_ 0e^{\alpha\abs{z}^2}.\] |
| 549 |
|
| 550 |
The boundedness, property (\ref{boundab}) of $\Phi_ 0$, then yields |
| 551 |
\[\int_{\mathcal{D}}\abs{\overline\partial u}^2e^{\alpha\abs{z}^2}\geq c_6\alpha |
| 552 |
\int_{\mathcal{D}}\abs{u}^2e^{\alpha\abs{z}^2} |
| 553 |
+c_7\delta^{-2}\int_ A\abs{u}^2e^{\alpha\abs{z}^2}.\] |
| 554 |
|
| 555 |
Let $B(X)$ be the set of blocks of $\Lambda_{X}$ |
| 556 |
and let $b(X) = \abs{B(X)}$. If $\phi \in Q_{X}$ then |
| 557 |
$\phi$ is constant on the blocks of $\Lambda_{X}$. |
| 558 |
\begin{equation}\label{far-d} |
| 559 |
P_{X} = \{ \phi \in M \mid \Lambda_{\phi} = \Lambda_{X} \}, |
| 560 |
\qquad |
| 561 |
Q_{X} = \{\phi \in M \mid \Lambda_{\phi} \geq \Lambda_{X} \}. |
| 562 |
\end{equation} |
| 563 |
If $\Lambda_{\phi} \geq \Lambda_{X}$ then |
| 564 |
$\Lambda_{\phi} = \Lambda_{Y}$ for some $Y \geq X$ so that |
| 565 |
\[ Q_{X} = \bigcup_{Y \geq X} P_{Y}. \] |
| 566 |
Thus by M\"obius inversion |
| 567 |
\[ \abs{P_{Y}}= \sum_{X\geq Y} \mu (Y,X)\abs{Q_{X}}.\] |
| 568 |
Thus there is a bijection from $Q_{X}$ to $W^{B(X)}$. |
| 569 |
In particular $\abs{Q_{X}} = w^{b(X)}$. |
| 570 |
|
| 571 |
Next note that $b(X)=\dim X$. We see this by choosing a |
| 572 |
basis for $X$ consisting of vectors $v^{k}$ defined by |
| 573 |
\[v^{k}_{i}= |
| 574 |
\begin{cases} 1 & \text{if $i \in \Lambda_{k}$},\\ |
| 575 |
0 &\text{otherwise.} \end{cases} |
| 576 |
\] |
| 577 |
\begin{verbatim} |
| 578 |
\[v^{k}_{i}= |
| 579 |
\begin{cases} 1 & \text{if $i \in \Lambda_{k}$},\\ |
| 580 |
0 &\text{otherwise.} \end{cases} |
| 581 |
\] |
| 582 |
\end{verbatim} |
| 583 |
|
| 584 |
\begin{lem}\label{p0201} |
| 585 |
Let $\A$ be an arrangement. Then |
| 586 |
\[ \chi (\A,t) = \sum_{\B \subseteq \A} |
| 587 |
(-1)^{\abs{\B}} t^{\dim T(\B)}. \] |
| 588 |
\end{lem} |
| 589 |
|
| 590 |
In order to compute $R''$ recall the definition |
| 591 |
of $S(X,Y)$ from \lemref{lem-per}. Since $H \in \B$, |
| 592 |
$\A_{H} \subseteq \B$. Thus if $T(\B) = Y$ then |
| 593 |
$\B \in S(H,Y)$. Let $L'' = L(\A'')$. Then |
| 594 |
\begin{equation}\label{E_SXgYy} |
| 595 |
\begin{split} |
| 596 |
R''&= \sum_{H\in \B \subseteq \A} (-1)^{\abs{\B}} |
| 597 |
t^{\dim T(\B)}\\ |
| 598 |
&= \sum_{Y \in L''} \sum_{\B \in S(H,Y)} |
| 599 |
(-1)^{\abs{\B}}t^{\dim Y} \\ |
| 600 |
&= -\sum_{Y \in L''} \sum_{\B \in S(H,Y)} (-1)^ |
| 601 |
{\abs{\B - \A_{H}}} t^{\dim Y} \\ |
| 602 |
&= -\sum_{Y \in L''} \mu (H,Y)t^{\dim Y} \\ |
| 603 |
&= -\chi (\A '',t). |
| 604 |
\end{split} |
| 605 |
\end{equation} |
| 606 |
|
| 607 |
\begin{cor}\label{tripleA} |
| 608 |
Let $(\A,\A',\A'')$ be a triple of arrangements. Then |
| 609 |
\[ \pi (\A,t) = \pi (\A',t) + t \pi (\A'',t). \] |
| 610 |
\end{cor} |
| 611 |
|
| 612 |
\begin{defn} |
| 613 |
Let $(\A,\A',\A'')$ be a triple with respect to |
| 614 |
the hyperplane $H \in \A$. Call $H$ a \textit{separator} |
| 615 |
if $T(\A) \not\in L(\A')$. |
| 616 |
\end{defn} |
| 617 |
|
| 618 |
\begin{cor}\label{nsep} |
| 619 |
Let $(\A,\A',\A'')$ be a triple with respect to $H \in \A$. |
| 620 |
\begin{enumerate} |
| 621 |
\renewcommand{\labelenumi}{(\roman{enumi})} |
| 622 |
\item |
| 623 |
If $H$ is a separator then |
| 624 |
\[ \mu (\A) = - \mu (\A'') \] |
| 625 |
and hence |
| 626 |
\[ \abs{\mu (\A)} = \abs{ \mu (\A'')}. \] |
| 627 |
|
| 628 |
\item If $H$ is not a separator then |
| 629 |
\[\mu (\A) = \mu (\A') - \mu (\A'') \] |
| 630 |
and |
| 631 |
\[ \abs{\mu (\A)} = \abs{\mu (\A')} + \abs{\mu (\A'')}. \] |
| 632 |
\end{enumerate} |
| 633 |
\end{cor} |
| 634 |
|
| 635 |
\begin{proof} |
| 636 |
It follows from \thmref{th-info-ow-ow} that $\pi(\A,t)$ |
| 637 |
has leading term |
| 638 |
\[(-1)^{r(\A)}\mu (\A)t^{r(\A)}.\] |
| 639 |
The conclusion |
| 640 |
follows by comparing coefficients of the leading |
| 641 |
terms on both sides of the equation in |
| 642 |
Corollary~\ref{tripleA}. If $H$ is a separator then |
| 643 |
$r(\A') < r(\A)$ and there is no contribution |
| 644 |
from $\pi (\A',t)$. |
| 645 |
\end{proof} |
| 646 |
|
| 647 |
The Poincar\'e polynomial of an arrangement |
| 648 |
will appear repeatedly |
| 649 |
in these notes. It will be shown to equal the |
| 650 |
Poincar\'e polynomial |
| 651 |
of the graded algebras which we are going to |
| 652 |
associate with $\A$. It is also the Poincar\'e |
| 653 |
polynomial of the complement $M(\A)$ for a |
| 654 |
complex arrangement. Here we prove |
| 655 |
that the Poincar\'e polynomial is the chamber |
| 656 |
counting function for a real arrangement. The |
| 657 |
complement $M(\A)$ is a disjoint union of chambers |
| 658 |
\[M(\A) = \bigcup_{C \in \Cham(\A)} C.\] |
| 659 |
The number |
| 660 |
of chambers is determined by the Poincar\'e |
| 661 |
polynomial as follows. |
| 662 |
|
| 663 |
\begin{thm}\label{th-realarr} |
| 664 |
Let $\A_{\mathbf{R}}$ be a real arrangement. Then |
| 665 |
\[ \abs{\Cham(\A_{\mathbf{R}})} = \pi (\A_{\mathbf{R}},1). \] |
| 666 |
\end{thm} |
| 667 |
|
| 668 |
\begin{proof} |
| 669 |
We check the properties required in Corollary~\ref{nsep}: |
| 670 |
(i) follows from $\pi (\Phi_{ l},t) = 1$, and (ii) is a |
| 671 |
consequence of Corollary~\ref{BI}. |
| 672 |
\end{proof} |
| 673 |
|
| 674 |
\begin{figure} |
| 675 |
\vspace{5cm} |
| 676 |
\caption[]{$Q(\A_{1}) = xyz(x-z)(x+z)(y-z)(y+z)$} |
| 677 |
\end{figure} |
| 678 |
|
| 679 |
\begin{figure} |
| 680 |
\vspace{5cm} |
| 681 |
\caption[]{$Q(\A_{2})= xyz(x+y+z)(x+y-z)(x-y+z)(x-y-z)$} |
| 682 |
\end{figure} |
| 683 |
|
| 684 |
|
| 685 |
\begin{thm} |
| 686 |
\label{T_first_the_int} |
| 687 |
Let $\phi$ be a protocol for a random pair $\XcY$. |
| 688 |
If one of $\st_\phi(x',y)$ and $\st_\phi(x,y')$ is a prefix of the other |
| 689 |
and $(x,y)\in\SXY$, then |
| 690 |
\[ |
| 691 |
\langle \st_j(x',y)\rangle_{j=1}^\infty |
| 692 |
=\langle \st_j(x,y)\rangle_{j=1}^\infty |
| 693 |
=\langle \st_j(x,y')\rangle_{j=1}^\infty . |
| 694 |
\] |
| 695 |
\end{thm} |
| 696 |
\begin{proof} |
| 697 |
We show by induction on $i$ that |
| 698 |
\[ |
| 699 |
\langle \st_j(x',y)\rangle_{j=1}^i |
| 700 |
=\langle \st_j(x,y)\rangle_{j=1}^i |
| 701 |
=\langle \st_j(x,y')\rangle_{j=1}^i. |
| 702 |
\] |
| 703 |
The induction hypothesis holds vacuously for $i=0$. Assume it holds for |
| 704 |
$i-1$, in particular |
| 705 |
$[\st_j(x',y)]_{j=1}^{i-1}=[\st_j(x,y')]_{j=1}^{i-1}$. Then one of |
| 706 |
$[\st_j(x',y)]_{j=i}^{\infty}$ and $[\st_j(x,y')]_{j=i}^{\infty}$ is a |
| 707 |
prefix of the other which implies that one of $\st_i(x',y)$ and |
| 708 |
$\st_i(x,y')$ is a prefix of the other. If the $i$th message is |
| 709 |
transmitted by $P_\X$ then, by the separate-transmissions property and |
| 710 |
the induction hypothesis, $\st_i(x,y)=\st_i(x,y')$, hence one of |
| 711 |
$\st_i(x,y)$ and $\st_i(x',y)$ is a prefix of the other. By the |
| 712 |
implicit-termination property, neither $\st_i(x,y)$ nor $\st_i(x',y)$ |
| 713 |
can be a proper prefix of the other, hence they must be the same and |
| 714 |
$\st_i(x',y)=\st_i(x,y)=\st_i(x,y')$. If the $i$th message is |
| 715 |
transmitted by $\PY$ then, symmetrically, $\st_i(x,y)=\st_i(x',y)$ by |
| 716 |
the induction hypothesis and the separate-transmissions property, and, |
| 717 |
then, $\st_i(x,y)=\st_i(x,y')$ by the implicit-termination property, |
| 718 |
proving the induction step. |
| 719 |
\end{proof} |
| 720 |
|
| 721 |
If $\phi$ is a protocol for $(X,Y)$, and $(x,y)$, $(x',y)$ are distinct |
| 722 |
inputs in $\SXY$, then, by the correct-decision property, |
| 723 |
$\langle\st_j(x,y)\rangle_{j=1}^\infty\ne\langle |
| 724 |
\st_j(x',y)\rangle_{j=1}^\infty$. |
| 725 |
|
| 726 |
Equation~(\ref{E_SXgYy}) defined $\PY$'s ambiguity set $\SXgYy$ |
| 727 |
to be the set of possible $X$ values when $Y=y$. |
| 728 |
The last corollary implies that for all $y\in\SY$, |
| 729 |
the multiset% |
| 730 |
\footnote{A multiset allows multiplicity of elements. |
| 731 |
Hence, $\{0,01,01\}$ is prefix free as a set, but not as a multiset.} |
| 732 |
of codewords $\{\st_\phi(x,y):x\in\SXgYy\}$ is prefix free. |
| 733 |
|
| 734 |
\section{One-Way Complexity} |
| 735 |
\label{S_Cp1} |
| 736 |
|
| 737 |
$\Cw1$, the one-way complexity of a random pair $\XcY$, |
| 738 |
is the number of bits $P_\X$ must transmit in the worst case |
| 739 |
when $\PY$ is not permitted to transmit any feedback messages. |
| 740 |
Starting with $\SXY$, the support set of $\XcY$, we define $\G$, |
| 741 |
the \textit{characteristic hypergraph} of $\XcY$, and show that |
| 742 |
\[ |
| 743 |
\Cw1=\lceil\,\log\chi(\G)\rceil\ . |
| 744 |
\] |
| 745 |
|
| 746 |
Let $\XcY$ be a random pair. For each $y$ in $\SY$, the support set of |
| 747 |
$Y$, Equation~(\ref{E_SXgYy}) defined $\SXgYy$ to be the set of possible |
| 748 |
$x$ values when $Y=y$. The \textit{characteristic hypergraph} $\G$ of |
| 749 |
$\XcY$ has $\SX$ as its vertex set and the hyperedge $\SXgYy$ for each |
| 750 |
$y\in\SY$. |
| 751 |
|
| 752 |
|
| 753 |
We can now prove a continuity theorem. |
| 754 |
\begin{thm}\label{t:conl} |
| 755 |
Let $\Omega \subset\mathbf{R}^n$ be an open set, let |
| 756 |
$u\in BV(\Omega ;\mathbf{R}^m)$, and let |
| 757 |
\begin{equation}\label{quts} |
| 758 |
T^u_x=\left\{y\in\mathbf{R}^m: |
| 759 |
y=\tilde u(x)+\left\langle \frac{Du}{\abs{Du}}(x),z |
| 760 |
\right\rangle \text{ for some }z\in\mathbf{R}^n\right\} |
| 761 |
\end{equation} |
| 762 |
for every $x\in\Omega \backslash S_u$. Let $f\colon \mathbf{R}^m\to |
| 763 |
\mathbf{R}^k$ be a Lipschitz continuous function such that $f(0)=0$, and |
| 764 |
let $v=f(u)\colon \Omega \to \mathbf{R}^k$. Then $v\in BV(\Omega |
| 765 |
;\mathbf{R}^k)$ and |
| 766 |
\begin{equation} |
| 767 |
Jv=\eval{(f(u^+)-f(u^-))\otimes \nu_u\cdot\, |
| 768 |
\mathcal{H}_{n-1}}_{S_u}. |
| 769 |
\end{equation} |
| 770 |
In addition, for $\abs{\wt{D}u}$-almost every $x\in\Omega $ the |
| 771 |
restriction of the function $f$ to $T^u_x$ is differentiable at $\tilde |
| 772 |
u(x)$ and |
| 773 |
\begin{equation} |
| 774 |
\wt{D}v=\nabla (\eval{f}_{T^u_x})(\tilde u) |
| 775 |
\frac{\wt{D}u}{\abs{\wt{D}u}}\cdot\abs{\wt{D}u}.\end{equation} |
| 776 |
\end{thm} |
| 777 |
|
| 778 |
Before proving the theorem, we state without proof three elementary |
| 779 |
remarks which will be useful in the sequel. |
| 780 |
\begin{rem}\label{r:omb} |
| 781 |
Let $\omega\colon \left]0,+\infty\right[\to \left]0,+\infty\right[$ |
| 782 |
be a continuous function such that $\omega (t)\to 0$ as $t\to |
| 783 |
0$. Then |
| 784 |
\[\lim_{h\to 0^+}g(\omega(h))=L\Leftrightarrow\lim_{h\to |
| 785 |
0^+}g(h)=L\] |
| 786 |
for any function $g\colon \left]0,+\infty\right[\to \mathbf{R}$. |
| 787 |
\end{rem} |
| 788 |
\begin{rem}\label{r:dif} |
| 789 |
Let $g \colon \mathbf{R}^n\to \mathbf{R}$ be a Lipschitz |
| 790 |
continuous function and assume that |
| 791 |
\[L(z)=\lim_{h\to 0^+}\frac{g(hz)-g(0)}h\] |
| 792 |
exists for every $z\in\mathbf{Q}^n$ and that $L$ is a linear function of |
| 793 |
$z$. Then $g$ is differentiable at 0. |
| 794 |
\end{rem} |
| 795 |
\begin{rem}\label{r:dif0} |
| 796 |
Let $A \colon \mathbf{R}^n\to \mathbf{R}^m$ be a linear function, and |
| 797 |
let $f \colon \mathbf{R}^m\to \mathbf{R}$ be a function. Then the |
| 798 |
restriction of $f$ to the range of $A$ is differentiable at 0 if and |
| 799 |
only if $f(A)\colon \mathbf{R}^n\to \mathbf{R}$ is differentiable at 0 |
| 800 |
and |
| 801 |
\[\nabla(\eval{f}_{\IM(A)})(0)A=\nabla (f(A))(0).\] |
| 802 |
\end{rem} |
| 803 |
|
| 804 |
\begin{proof} |
| 805 |
We begin by showing that $v\in BV(\Omega;\mathbf{R}^k)$ and |
| 806 |
\begin{equation}\label{e:bomb} |
| 807 |
\abs{Dv}(B)\le K\abs{Du}(B)\qquad\forall B\in\mathbf{B}(\Omega ), |
| 808 |
\end{equation} |
| 809 |
where $K>0$ is the Lipschitz constant of $f$. By \eqref{sum-Di} and by |
| 810 |
the approximation result quoted in \secref{s:mt}, it is possible to find |
| 811 |
a sequence $(u_h)\subset C^1(\Omega ;\mathbf{R}^m)$ converging to $u$ in |
| 812 |
$L^1(\Omega ;\mathbf{R}^m)$ and such that |
| 813 |
\[\lim_{h\to +\infty}\int_\Omega \abs{\nabla u_h}\,dx=\abs{Du}(\Omega ).\] |
| 814 |
The functions $v_h=f(u_h)$ are locally Lipschitz continuous in $\Omega |
| 815 |
$, and the definition of differential implies that $\abs{\nabla v_h}\le |
| 816 |
K\abs{\nabla u_h}$ almost everywhere in $\Omega $. The lower semicontinuity |
| 817 |
of the total variation and \eqref{sum-Di} yield |
| 818 |
\begin{equation} |
| 819 |
\begin{split} |
| 820 |
\abs{Dv}(\Omega )\le\liminf_{h\to +\infty}\abs{Dv_h}(\Omega) & |
| 821 |
=\liminf_{h\to +\infty}\int_\Omega \abs{\nabla v_h}\,dx\\ |
| 822 |
&\le K\liminf_{h\to +\infty}\int_\Omega |
| 823 |
\abs{\nabla u_h}\,dx=K\abs{Du}(\Omega). |
| 824 |
\end{split}\end{equation} |
| 825 |
Since $f(0)=0$, we have also |
| 826 |
\[\int_\Omega \abs{v}\,dx\le K\int_\Omega \abs{u}\,dx;\] |
| 827 |
therefore $u\in BV(\Omega ;\mathbf{R}^k)$. Repeating the same argument |
| 828 |
for every open set $A\subset\Omega $, we get \eqref{e:bomb} for every |
| 829 |
$B\in\mathbf{B}(\Omega)$, because $\abs{Dv}$, $\abs{Du}$ are Radon measures. To |
| 830 |
prove \lemref{limbog}, first we observe that |
| 831 |
\begin{equation}\label{e:SS} |
| 832 |
S_v\subset S_u,\qquad\tilde v(x)=f(\tilde u(x))\qquad \forall x\in\Omega |
| 833 |
\backslash S_u.\end{equation} |
| 834 |
In fact, for every $\varepsilon >0$ we have |
| 835 |
\[\{y\in B_\rho(x): \abs{v(y)-f(\tilde u(x))}>\varepsilon \}\subset \{y\in |
| 836 |
B_\rho(x): \abs{u(y)-\tilde u(x)}>\varepsilon /K\},\] |
| 837 |
hence |
| 838 |
\[\lim_{\rho\to 0^+}\frac{\abs{\{y\in B_\rho(x): \abs{v(y)-f(\tilde u(x))}> |
| 839 |
\varepsilon \}}}{\rho^n}=0\] |
| 840 |
whenever $x\in\Omega \backslash S_u$. By a similar argument, if $x\in |
| 841 |
S_u$ is a point such that there exists a triplet $(u^+,u^-,\nu_u)$ |
| 842 |
satisfying \eqref{detK1}, \eqref{detK2}, then |
| 843 |
\[ |
| 844 |
(v^+(x)-v^-(x))\otimes \nu_v=(f(u^+(x))-f(u^-(x)))\otimes\nu_u\quad |
| 845 |
\text{if }x\in S_v |
| 846 |
\] |
| 847 |
and $f(u^-(x))=f(u^+(x))$ if $x\in S_u\backslash S_v$. Hence, by (1.8) |
| 848 |
we get |
| 849 |
\begin{equation*}\begin{split} |
| 850 |
Jv(B)=\int_{B\cap S_v}(v^+-v^-)\otimes \nu_v\,d\mathcal{H}_{n-1}&= |
| 851 |
\int_{B\cap S_v}(f(u^+)-f(u^-))\otimes \nu_u\,d\mathcal{H}_{n-1}\\ |
| 852 |
&=\int_{B\cap S_u}(f(u^+)-f(u^-))\otimes \nu_u\,d\mathcal{H}_{n-1} |
| 853 |
\end{split}\end{equation*} |
| 854 |
and \lemref{limbog} is proved. |
| 855 |
\end{proof} |
| 856 |
|
| 857 |
To prove \eqref{e:SS}, it is not restrictive to assume that $k=1$. |
| 858 |
Moreover, to simplify our notation, from now on we shall assume that |
| 859 |
$\Omega = \mathbf{R}^n$. The proof of \eqref{e:SS} is divided into two |
| 860 |
steps. In the first step we prove the statement in the one-dimensional |
| 861 |
case $(n=1)$, using \thmref{th-weak-ske-owf}. In the second step we |
| 862 |
achieve the general result using \thmref{t:conl}. |
| 863 |
|
| 864 |
\subsection*{Step 1} |
| 865 |
Assume that $n=1$. Since $S_u$ is at most countable, \eqref{sum-bij} |
| 866 |
yields that $\abs{\wt{D}v}(S_u\backslash S_v)=0$, so that |
| 867 |
\eqref{e:st} and \eqref{e:barwq} imply that $Dv=\wt{D}v+Jv$ is |
| 868 |
the Radon-Nikod\'ym decomposition of $Dv$ in absolutely continuous and |
| 869 |
singular part with respect to $\abs{\wt{D} u}$. By |
| 870 |
\thmref{th-weak-ske-owf}, we have |
| 871 |
\begin{equation*} |
| 872 |
\frac{\wt{D}v}{\abs{\wt{D}u}}(t)=\lim_{s\to t^+} |
| 873 |
\frac{Dv(\interval{\left[t,s\right[})} |
| 874 |
{\abs{\wt{D}u}(\interval{\left[t,s\right[})},\qquad |
| 875 |
\frac{\wt{D}u}{\abs{\wt{D}u}}(t)=\lim_{s\to t^+} |
| 876 |
\frac{Du(\interval{\left[t,s\right[})} |
| 877 |
{\abs{\wt{D}u}(\interval{\left[t,s\right[})} |
| 878 |
\end{equation*} |
| 879 |
$\abs{\wt{D}u}$-almost everywhere in $\mathbf{R}$. It is well known |
| 880 |
(see, for instance, \cite[2.5.16]{ste:sint}) that every one-dimensional |
| 881 |
function of bounded variation $w$ has a unique left continuous |
| 882 |
representative, i.e., a function $\hat w$ such that $\hat w=w$ almost |
| 883 |
everywhere and $\lim_{s\to t^-}\hat w(s)=\hat w(t)$ for every $t\in |
| 884 |
\mathbf{R}$. These conditions imply |
| 885 |
\begin{equation} |
| 886 |
\hat u(t)=Du(\interval{\left]-\infty,t\right[}), |
| 887 |
\qquad \hat v(t)=Dv(\interval{\left]-\infty,t\right[})\qquad |
| 888 |
\forall t\in\mathbf{R} |
| 889 |
\end{equation} |
| 890 |
and |
| 891 |
\begin{equation}\label{alimo} |
| 892 |
\hat v(t)=f(\hat u(t))\qquad\forall t\in\mathbf{R}.\end{equation} |
| 893 |
Let $t\in\mathbf{R}$ be such that |
| 894 |
$\abs{\wt{D}u}(\interval{\left[t,s\right[})>0$ for every $s>t$ and |
| 895 |
assume that the limits in \eqref{joe} exist. By \eqref{j:mark} and |
| 896 |
\eqref{far-d} we get |
| 897 |
\begin{equation*}\begin{split} |
| 898 |
\frac{\hat v(s)-\hat |
| 899 |
v(t)}{\abs{\wt{D}u}(\interval{\left[t,s\right[})}&=\frac {f(\hat |
| 900 |
u(s))-f(\hat u(t))}{\abs{\wt{D}u}(\interval{\left[t,s\right[})}\\ |
| 901 |
&=\frac{f(\hat u(s))-f(\hat |
| 902 |
u(t)+\dfrac{\wt{D}u}{\abs{\wt{D}u}}(t)\abs{\wt{D}u |
| 903 |
}(\interval{\left[t,s\right[}))}% |
| 904 |
{\abs{\wt{D}u}(\interval{\left[t,s\right[})}\\ |
| 905 |
&+\frac |
| 906 |
{f(\hat u(t)+\dfrac{\wt{D}u}{\abs{\wt{D}u}}(t)\abs{\wt{D} |
| 907 |
u}(\interval{\left[t,s\right[}))-f(\hat |
| 908 |
u(t))}{\abs{\wt{D}u}(\interval{\left[t,s\right[})} |
| 909 |
\end{split}\end{equation*} |
| 910 |
for every $s>t$. Using the Lipschitz condition on $f$ we find |
| 911 |
{\setlength{\multlinegap}{0pt} |
| 912 |
\begin{multline*} |
| 913 |
\left\lvert\frac{\hat v(s)-\hat |
| 914 |
v(t)}{\abs{\wt{D}u}(\interval{\left[t,s\right[})} -\frac{f(\hat |
| 915 |
u(t)+\dfrac{\wt{D}u}{\abs{\wt{D}u}}(t) |
| 916 |
\abs{\wt{D}u}(\interval{\left[t,s\right[}))-f(\hat |
| 917 |
u(t))}{\abs{\wt{D}u}(\interval{\left[t,s\right[})}\right\rvert\\ |
| 918 |
\le K\left\lvert |
| 919 |
\frac{\hat u(s)-\hat u(t)} |
| 920 |
{\abs{\wt{D}u}(\interval{\left[t,s\right[})} |
| 921 |
-\frac{\wt{D}u}{\abs{ |
| 922 |
\wt{D}u}}(t)\right\rvert.\end{multline*} |
| 923 |
}% end of group with \multlinegap=0pt |
| 924 |
By \eqref{e:bomb}, the function $s\to |
| 925 |
\abs{\wt{D}u}(\interval{\left[t,s\right[})$ is continuous and |
| 926 |
converges to 0 as $s\downarrow t$. Therefore Remark~\ref{r:omb} and the |
| 927 |
previous inequality imply |
| 928 |
\[\frac{\wt{D}v}{\abs{\wt{D}u}}(t)=\lim_{h\to 0^+} |
| 929 |
\frac{f(\hat u(t)+h\dfrac{\wt{D}u}{\abs{\wt{D}u}} |
| 930 |
(t))-f(\hat u(t))}h\quad\abs{\wt{D}u}\text{-a.e. in }\mathbf{R}.\] |
| 931 |
By \eqref{joe}, $\hat u(x)=\tilde u(x)$ for every |
| 932 |
$x\in\mathbf{R}\backslash S_u$; moreover, applying the same argument to |
| 933 |
the functions $u'(t)=u(-t)$, $v'(t)=f(u'(t))=v(-t)$, we get |
| 934 |
\[\frac{\wt{D}v}{\abs{\wt{D}u}}(t)=\lim_{h\to 0} |
| 935 |
\frac{f(\tilde u(t) |
| 936 |
+h\dfrac{\wt{D}u}{\abs{\wt{D}u}}(t))-f(\tilde u(t))}{h} |
| 937 |
\qquad\abs{\wt{D}u}\text{-a.e. in }\mathbf{R}\] |
| 938 |
and our statement is proved. |
| 939 |
|
| 940 |
\subsection*{Step 2} |
| 941 |
|
| 942 |
Let us consider now the general case $n>1$. Let $\nu\in \mathbf{R}^n$ be |
| 943 |
such that $\abs{\nu}=1$, and let $\pi_\nu=\{y\in\mathbf{R}^n: \langle |
| 944 |
y,\nu\rangle =0\}$. In the following, we shall identify $\mathbf{R}^n$ |
| 945 |
with $\pi_\nu\times\mathbf{R}$, and we shall denote by $y$ the variable |
| 946 |
ranging in $\pi_\nu$ and by $t$ the variable ranging in $\mathbf{R}$. By |
| 947 |
the just proven one-dimensional result, and by \thmref{thm-main}, we get |
| 948 |
\[\lim_{h\to 0}\frac{f(\tilde u(y+t\nu)+h\dfrac{\wt{D}u_y}{\abs{ |
| 949 |
\wt{D}u_y}}(t))-f(\tilde u(y+t\nu))}h=\frac{\wt{D}v_y}{\abs{ |
| 950 |
\wt{D}u_y}}(t)\qquad\abs{\wt{D}u_y}\text{-a.e. in }\mathbf{R}\] |
| 951 |
for $\mathcal{H}_{n-1}$-almost every $y\in \pi_\nu$. We claim that |
| 952 |
\begin{equation} |
| 953 |
\frac{\langle \wt{D}u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle |
| 954 |
}}(y+t\nu)=\frac{\wt{D}u_y} |
| 955 |
{\abs{\wt{D}u_y}}(t)\qquad\abs{\wt{D}u_y}\text{-a.e. in }\mathbf{R} |
| 956 |
\end{equation} |
| 957 |
for $\mathcal{H}_{n-1}$-almost every $y\in\pi_\nu$. In fact, by |
| 958 |
\eqref{sum-ali} and \eqref{delta-l} we get |
| 959 |
\begin{multline*} |
| 960 |
\int_{\pi_\nu}\frac{\wt{D}u_y}{\abs{\wt{D}u_y}}\cdot\abs{\wt{D}u_y |
| 961 |
}\,d\mathcal{H}_{n-1}(y)=\int_{\pi_\nu}\wt{D}u_y\,d\mathcal{H}_{n-1}(y)\\ |
| 962 |
=\langle \wt{D}u,\nu\rangle =\frac |
| 963 |
{\langle \wt{D}u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle}}\cdot |
| 964 |
\abs{\langle \wt{D}u,\nu\rangle }=\int_{\pi_\nu}\frac{ |
| 965 |
\langle \wt{D}u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle }} |
| 966 |
(y+\cdot \nu)\cdot\abs{\wt{D}u_y}\,d\mathcal{H}_{n-1}(y) |
| 967 |
\end{multline*} |
| 968 |
and \eqref{far-d} follows from \eqref{sum-Di}. By the same argument it |
| 969 |
is possible to prove that |
| 970 |
\begin{equation} |
| 971 |
\frac{\langle \wt{D}v,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle |
| 972 |
}}(y+t\nu)=\frac{\wt{D}v_y}{\abs{\wt{D}u_y}}(t)\qquad\abs{ |
| 973 |
\wt{D}u_y}\text{-a.e. in }\mathbf{R}\end{equation} |
| 974 |
for $\mathcal{H}_{n-1}$-almost every $y\in \pi_\nu$. By \eqref{far-d} |
| 975 |
and \eqref{E_SXgYy} we get |
| 976 |
\[ |
| 977 |
\lim_{h\to 0}\frac{f(\tilde u(y+t\nu)+h\dfrac{\langle \wt{D} |
| 978 |
u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle }}(y+t\nu))-f(\tilde |
| 979 |
u(y+t\nu))}{h} |
| 980 |
=\frac{\langle \wt{D}v,\nu\rangle }{\abs{\langle |
| 981 |
\wt{D}u,\nu\rangle }}(y+t\nu)\] |
| 982 |
for $\mathcal{H}_{n-1}$-almost every $y\in\pi_\nu$, and using again |
| 983 |
\eqref{detK1}, \eqref{detK2} we get |
| 984 |
\[ |
| 985 |
\lim_{h\to 0}\frac{f(\tilde u(x)+h\dfrac{\langle |
| 986 |
\wt{D}u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle }}(x))-f(\tilde |
| 987 |
u(x))}{h}=\frac{\langle \wt{D}v,\nu\rangle }{\abs{\langle \wt{D}u,\nu |
| 988 |
\rangle }}(x) |
| 989 |
\] |
| 990 |
$\abs{\langle \wt{D}u,\nu\rangle}$-a.e. in $\mathbf{R}^n$. |
| 991 |
|
| 992 |
Since the function $\abs{\langle \wt{D}u,\nu\rangle }/\abs{\wt{D}u}$ |
| 993 |
is strictly positive $\abs{\langle \wt{D}u,\nu\rangle }$-almost everywhere, |
| 994 |
we obtain also |
| 995 |
\begin{multline*} |
| 996 |
\lim_{h\to 0}\frac{f(\tilde u(x)+h\dfrac{\abs{\langle |
| 997 |
\wt{D}u,\nu\rangle }}{\abs{\wt{D}u}}(x)\dfrac{\langle \wt{D} |
| 998 |
u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle }}(x))-f(\tilde u(x))}{h}\\ |
| 999 |
=\frac{\abs{\langle \wt{D}u,\nu\rangle }}{\abs{\wt{D}u}}(x)\frac |
| 1000 |
{\langle \wt{D}v,\nu\rangle }{\abs{\langle |
| 1001 |
\wt{D}u,\nu\rangle }}(x) |
| 1002 |
\end{multline*} |
| 1003 |
$\abs{\langle \wt{D}u,\nu\rangle }$-almost everywhere in $\mathbf{R}^n$. |
| 1004 |
|
| 1005 |
Finally, since |
| 1006 |
\begin{align*} |
| 1007 |
&\frac{\abs{\langle \wt{D}u,\nu\rangle }}{\abs{\wt{D}u}} |
| 1008 |
\frac{\langle \wt{D}u,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle}} |
| 1009 |
=\frac{\langle \wt{D}u,\nu\rangle }{\abs{\wt{D}u}} |
| 1010 |
=\left\langle \frac{\wt{D}u}{\abs{\wt{D}u}},\nu\right\rangle |
| 1011 |
\qquad\abs{\wt{D}u}\text{-a.e. in }\mathbf{R}^n\\ |
| 1012 |
&\frac{\abs{\langle \wt{D}u,\nu\rangle }}{\abs{\wt{D}u}} |
| 1013 |
\frac{\langle \wt{D}v,\nu\rangle }{\abs{\langle \wt{D}u,\nu\rangle}} |
| 1014 |
=\frac{\langle \wt{D}v,\nu\rangle }{\abs{\wt{D}u}} |
| 1015 |
=\left\langle \frac{\wt{D}v}{\abs{\wt{D}u}},\nu\right\rangle |
| 1016 |
\qquad\abs{\wt{D}u}\text{-a.e. in }\mathbf{R}^n |
| 1017 |
\end{align*} |
| 1018 |
and since both sides of \eqref{alimo} |
| 1019 |
are zero $\abs{\wt{D}u}$-almost everywhere |
| 1020 |
on $\abs{\langle \wt{D}u,\nu\rangle }$-negligible sets, we conclude that |
| 1021 |
\[ |
| 1022 |
\lim_{h\to 0}\frac{f\left( |
| 1023 |
\tilde u(x)+h\left\langle \dfrac{\wt{D} |
| 1024 |
u}{\abs{\wt{D}u}}(x),\nu\right\rangle \right)-f(\tilde u(x))}h |
| 1025 |
=\left\langle \frac{\wt{D}v}{\abs{\wt{D}u}}(x),\nu\right\rangle, |
| 1026 |
\] |
| 1027 |
$\abs{\wt{D}u}$-a.e. in $\mathbf{R}^n$. |
| 1028 |
Since $\nu$ is arbitrary, by Remarks \ref{r:dif} and~\ref{r:dif0} |
| 1029 |
the restriction of $f$ to |
| 1030 |
the affine space $T^u_x$ is differentiable at $\tilde u(x)$ for $\abs{\wt{D} |
| 1031 |
u}$-almost every $x\in \mathbf{R}^n$ and \eqref{quts} holds.\qed |
| 1032 |
|
| 1033 |
It follows from \eqref{sum-Di}, \eqref{detK1}, and \eqref{detK2} that |
| 1034 |
\begin{equation}\label{Dt} |
| 1035 |
D(t_1,\dots,t_n)=\sum_{I\in\mathbf{n}}(-1)^{\abs{I}-1}\abs{I} |
| 1036 |
\prod_{i\in I}t_i\prod_{j\in I}(D_j+\lambda_jt_j)\det\mathbf{A}^{(\lambda)} |
| 1037 |
(\overline I|\overline I). |
| 1038 |
\end{equation} |
| 1039 |
Let $t_i=\hat x_i$, $i=1,\dots,n$. Lemma 1 leads to |
| 1040 |
\begin{equation}\label{Dx} |
| 1041 |
D(\hat x_1,\dots,\hat x_n)=\prod_{i\in\mathbf{n}}\hat x_i |
| 1042 |
\sum_{I\in\mathbf{n}}(-1)^{\abs{I}-1}\abs{I}\per \mathbf{A} |
| 1043 |
^{(\lambda)}(I|I)\det\mathbf{A}^{(\lambda)}(\overline I|\overline I). |
| 1044 |
\end{equation} |
| 1045 |
By \eqref{H-cycles}, \eqref{sum-Di}, and \eqref{Dx}, |
| 1046 |
we have the following result: |
| 1047 |
\begin{thm}\label{thm-H-param} |
| 1048 |
\begin{equation}\label{H-param} |
| 1049 |
H_c=\frac{1}{2n}\sum^n_{l =1}l (-1)^{l -1}A_{l} |
| 1050 |
^{(\lambda)}, |
| 1051 |
\end{equation} |
| 1052 |
where |
| 1053 |
\begin{equation}\label{A-l-lambda} |
| 1054 |
A^{(\lambda)}_l =\sum_{I_l \subseteq\mathbf{n}}\per \mathbf{A} |
| 1055 |
^{(\lambda)}(I_l |I_l )\det\mathbf{A}^{(\lambda)} |
| 1056 |
(\overline I_{l}|\overline I_l ),\abs{I_{l}}=l . |
| 1057 |
\end{equation} |
| 1058 |
\end{thm} |
| 1059 |
|
| 1060 |
It is worth noting that $A_l ^{(\lambda)}$ of \eqref{A-l-lambda} is |
| 1061 |
similar to the coefficients $b_l $ of the characteristic polynomial of |
| 1062 |
\eqref{bl-sum}. It is well known in graph theory that the coefficients |
| 1063 |
$b_l $ can be expressed as a sum over certain subgraphs. It is |
| 1064 |
interesting to see whether $A_l $, $\lambda=0$, structural properties |
| 1065 |
of a graph. |
| 1066 |
|
| 1067 |
We may call \eqref{H-param} a parametric representation of $H_c$. In |
| 1068 |
computation, the parameter $\lambda_i$ plays very important roles. The |
| 1069 |
choice of the parameter usually depends on the properties of the given |
| 1070 |
graph. For a complete graph $K_n$, let $\lambda_i=1$, $i=1,\dots,n$. |
| 1071 |
It follows from \eqref{A-l-lambda} that |
| 1072 |
\begin{equation}\label{compl-gr} |
| 1073 |
A^{(1)}_l =\begin{cases} n!,&\text{if }l =1\\ |
| 1074 |
0,&\text{otherwise}.\end{cases} |
| 1075 |
\end{equation} |
| 1076 |
By \eqref{H-param} |
| 1077 |
\begin{equation} |
| 1078 |
H_c=\frac 12(n-1)!. |
| 1079 |
\end{equation} |
| 1080 |
For a complete bipartite graph $K_{n_1n_2}$, let $\lambda_i=0$, $i=1,\dots,n$. |
| 1081 |
By \eqref{A-l-lambda}, |
| 1082 |
\begin{equation} |
| 1083 |
A_l = |
| 1084 |
\begin{cases} -n_1!n_2!\delta_{n_1n_2},&\text{if }l =2\\ |
| 1085 |
0,&\text{otherwise }.\end{cases} |
| 1086 |
\label{compl-bip-gr} |
| 1087 |
\end{equation} |
| 1088 |
Theorem~\ref{thm-H-param} |
| 1089 |
leads to |
| 1090 |
\begin{equation} |
| 1091 |
H_c=\frac1{n_1+n_2}n_1!n_2!\delta_{n_1n_2}. |
| 1092 |
\end{equation} |
| 1093 |
|
| 1094 |
Now, we consider an asymmetrical approach. Theorem \ref{thm-main} leads to |
| 1095 |
\begin{multline} |
| 1096 |
\det\mathbf{K}(t=1,t_1,\dots,t_n;l |l )\\ |
| 1097 |
=\sum_{I\subseteq\mathbf{n}-\{l \}} |
| 1098 |
(-1)^{\abs{I}}\prod_{i\in I}t_i\prod_{j\in I} |
| 1099 |
(D_j+\lambda_jt_j)\det\mathbf{A}^{(\lambda)} |
| 1100 |
(\overline I\cup\{l \}|\overline I\cup\{l \}). |
| 1101 |
\end{multline} |
| 1102 |
|
| 1103 |
By \eqref{H-cycles} and \eqref{sum-ali} we have the following asymmetrical |
| 1104 |
result: |
| 1105 |
\begin{thm}\label{thm-asym} |
| 1106 |
\begin{equation} |
| 1107 |
H_c=\frac12\sum_{I\subseteq\mathbf{n}-\{l \}} |
| 1108 |
(-1)^{\abs{I}}\per\mathbf{A}^{(\lambda)}(I|I)\det |
| 1109 |
\mathbf{A}^{(\lambda)} |
| 1110 |
(\overline I\cup\{l \}|\overline I\cup\{l \}) |
| 1111 |
\end{equation} |
| 1112 |
which reduces to Goulden--Jackson's formula when $\lambda_i=0,i=1,\dots,n$ |
| 1113 |
\cite{mami:matrixth}. |
| 1114 |
\end{thm} |
| 1115 |
|
| 1116 |
\section{Various font features of the \pkg{amsmath} package} |
| 1117 |
\label{s:font} |
| 1118 |
\subsection{Bold versions of special symbols} |
| 1119 |
|
| 1120 |
In the \pkg{amsmath} package \cn{boldsymbol} is used for getting |
| 1121 |
individual bold math symbols and bold Greek letters---everything in |
| 1122 |
math except for letters of the Latin alphabet, |
| 1123 |
where you'd use \cn{mathbf}. For example, |
| 1124 |
\begin{verbatim} |
| 1125 |
A_\infty + \pi A_0 \sim |
| 1126 |
\mathbf{A}_{\boldsymbol{\infty}} \boldsymbol{+} |
| 1127 |
\boldsymbol{\pi} \mathbf{A}_{\boldsymbol{0}} |
| 1128 |
\end{verbatim} |
| 1129 |
looks like this: |
| 1130 |
\[A_\infty + \pi A_0 \sim \mathbf{A}_{\boldsymbol{\infty}} |
| 1131 |
\boldsymbol{+} \boldsymbol{\pi} \mathbf{A}_{\boldsymbol{0}}\] |
| 1132 |
|
| 1133 |
\subsection{``Poor man's bold''} |
| 1134 |
If a bold version of a particular symbol doesn't exist in the |
| 1135 |
available fonts, |
| 1136 |
then \cn{boldsymbol} can't be used to make that symbol bold. |
| 1137 |
At the present time, this means that |
| 1138 |
\cn{boldsymbol} can't be used with symbols from |
| 1139 |
the \fn{msam} and \fn{msbm} fonts, among others. |
| 1140 |
In some cases, poor man's bold (\cn{pmb}) can be used instead |
| 1141 |
of \cn{boldsymbol}: |
| 1142 |
% Can't show example from msam or msbm because this document is |
| 1143 |
% supposed to be TeXable even if the user doesn't have |
| 1144 |
% AMSFonts. MJD 5-JUL-1990 |
| 1145 |
\[\frac{\partial x}{\partial y} |
| 1146 |
\pmb{\bigg\vert} |
| 1147 |
\frac{\partial y}{\partial z}\] |
| 1148 |
\begin{verbatim} |
| 1149 |
\[\frac{\partial x}{\partial y} |
| 1150 |
\pmb{\bigg\vert} |
| 1151 |
\frac{\partial y}{\partial z}\] |
| 1152 |
\end{verbatim} |
| 1153 |
So-called ``large operator'' symbols such as $\sum$ and $\prod$ |
| 1154 |
require an additional command, \cn{mathop}, |
| 1155 |
to produce proper spacing and limits when \cn{pmb} is used. |
| 1156 |
For further details see \textit{The \TeX book}. |
| 1157 |
\[\sum_{\substack{i<B\\\text{$i$ odd}}} |
| 1158 |
\prod_\kappa \kappa F(r_i)\qquad |
| 1159 |
\mathop{\pmb{\sum}}_{\substack{i<B\\\text{$i$ odd}}} |
| 1160 |
\mathop{\pmb{\prod}}_\kappa \kappa(r_i) |
| 1161 |
\] |
| 1162 |
\begin{verbatim} |
| 1163 |
\[\sum_{\substack{i<B\\\text{$i$ odd}}} |
| 1164 |
\prod_\kappa \kappa F(r_i)\qquad |
| 1165 |
\mathop{\pmb{\sum}}_{\substack{i<B\\\text{$i$ odd}}} |
| 1166 |
\mathop{\pmb{\prod}}_\kappa \kappa(r_i) |
| 1167 |
\] |
| 1168 |
\end{verbatim} |
| 1169 |
|
| 1170 |
\section{Compound symbols and other features} |
| 1171 |
\label{s:comp} |
| 1172 |
\subsection{Multiple integral signs} |
| 1173 |
|
| 1174 |
\cn{iint}, \cn{iiint}, and \cn{iiiint} give multiple integral signs |
| 1175 |
with the spacing between them nicely adjusted, in both text and |
| 1176 |
display style. \cn{idotsint} gives two integral signs with dots |
| 1177 |
between them. |
| 1178 |
\begin{gather} |
| 1179 |
\iint\limits_A f(x,y)\,dx\,dy\qquad\iiint\limits_A |
| 1180 |
f(x,y,z)\,dx\,dy\,dz\\ |
| 1181 |
\iiiint\limits_A |
| 1182 |
f(w,x,y,z)\,dw\,dx\,dy\,dz\qquad\idotsint\limits_A f(x_1,\dots,x_k) |
| 1183 |
\end{gather} |
| 1184 |
|
| 1185 |
\subsection{Over and under arrows} |
| 1186 |
|
| 1187 |
Some extra over and under arrow operations are provided in |
| 1188 |
the \pkg{amsmath} package. (Basic \LaTeX\ provides |
| 1189 |
\cn{overrightarrow} and \cn{overleftarrow}). |
| 1190 |
\begin{align*} |
| 1191 |
\overrightarrow{\psi_\delta(t) E_t h}& |
| 1192 |
=\underrightarrow{\psi_\delta(t) E_t h}\\ |
| 1193 |
\overleftarrow{\psi_\delta(t) E_t h}& |
| 1194 |
=\underleftarrow{\psi_\delta(t) E_t h}\\ |
| 1195 |
\overleftrightarrow{\psi_\delta(t) E_t h}& |
| 1196 |
=\underleftrightarrow{\psi_\delta(t) E_t h} |
| 1197 |
\end{align*} |
| 1198 |
\begin{verbatim} |
| 1199 |
\begin{align*} |
| 1200 |
\overrightarrow{\psi_\delta(t) E_t h}& |
| 1201 |
=\underrightarrow{\psi_\delta(t) E_t h}\\ |
| 1202 |
\overleftarrow{\psi_\delta(t) E_t h}& |
| 1203 |
=\underleftarrow{\psi_\delta(t) E_t h}\\ |
| 1204 |
\overleftrightarrow{\psi_\delta(t) E_t h}& |
| 1205 |
=\underleftrightarrow{\psi_\delta(t) E_t h} |
| 1206 |
\end{align*} |
| 1207 |
\end{verbatim} |
| 1208 |
These all scale properly in subscript sizes: |
| 1209 |
\[\int_{\overrightarrow{AB}} ax\,dx\] |
| 1210 |
\begin{verbatim} |
| 1211 |
\[\int_{\overrightarrow{AB}} ax\,dx\] |
| 1212 |
\end{verbatim} |
| 1213 |
|
| 1214 |
\subsection{Dots} |
| 1215 |
|
| 1216 |
Normally you need only type \cn{dots} for ellipsis dots in a |
| 1217 |
math formula. The main exception is when the dots |
| 1218 |
fall at the end of the formula; then you need to |
| 1219 |
specify one of \cn{dotsc} (series dots, after a comma), |
| 1220 |
\cn{dotsb} (binary dots, for binary relations or operators), |
| 1221 |
\cn{dotsm} (multiplication dots), or \cn{dotsi} (dots after |
| 1222 |
an integral). For example, the input |
| 1223 |
\begin{verbatim} |
| 1224 |
Then we have the series $A_1,A_2,\dotsc$, |
| 1225 |
the regional sum $A_1+A_2+\dotsb$, |
| 1226 |
the orthogonal product $A_1A_2\dotsm$, |
| 1227 |
and the infinite integral |
| 1228 |
\[\int_{A_1}\int_{A_2}\dotsi\]. |
| 1229 |
\end{verbatim} |
| 1230 |
produces |
| 1231 |
\begin{quotation} |
| 1232 |
Then we have the series $A_1,A_2,\dotsc$, |
| 1233 |
the regional sum $A_1+A_2+\dotsb$, |
| 1234 |
the orthogonal product $A_1A_2\dotsm$, |
| 1235 |
and the infinite integral |
| 1236 |
\[\int_{A_1}\int_{A_2}\dotsi\] |
| 1237 |
\end{quotation} |
| 1238 |
|
| 1239 |
\subsection{Accents in math} |
| 1240 |
|
| 1241 |
Double accents: |
| 1242 |
\[\Hat{\Hat{H}}\quad\Check{\Check{C}}\quad |
| 1243 |
\Tilde{\Tilde{T}}\quad\Acute{\Acute{A}}\quad |
| 1244 |
\Grave{\Grave{G}}\quad\Dot{\Dot{D}}\quad |
| 1245 |
\Ddot{\Ddot{D}}\quad\Breve{\Breve{B}}\quad |
| 1246 |
\Bar{\Bar{B}}\quad\Vec{\Vec{V}}\] |
| 1247 |
\begin{verbatim} |
| 1248 |
\[\Hat{\Hat{H}}\quad\Check{\Check{C}}\quad |
| 1249 |
\Tilde{\Tilde{T}}\quad\Acute{\Acute{A}}\quad |
| 1250 |
\Grave{\Grave{G}}\quad\Dot{\Dot{D}}\quad |
| 1251 |
\Ddot{\Ddot{D}}\quad\Breve{\Breve{B}}\quad |
| 1252 |
\Bar{\Bar{B}}\quad\Vec{\Vec{V}}\] |
| 1253 |
\end{verbatim} |
| 1254 |
This double accent operation is complicated |
| 1255 |
and tends to slow down the processing of a \LaTeX\ file. |
| 1256 |
|
| 1257 |
|
| 1258 |
\subsection{Dot accents} |
| 1259 |
\cn{dddot} and \cn{ddddot} are available to |
| 1260 |
produce triple and quadruple dot accents |
| 1261 |
in addition to the \cn{dot} and \cn{ddot} accents already available |
| 1262 |
in \LaTeX: |
| 1263 |
\[\dddot{Q}\qquad\ddddot{R}\] |
| 1264 |
\begin{verbatim} |
| 1265 |
\[\dddot{Q}\qquad\ddddot{R}\] |
| 1266 |
\end{verbatim} |
| 1267 |
|
| 1268 |
\subsection{Roots} |
| 1269 |
|
| 1270 |
In the \pkg{amsmath} package \cn{leftroot} and \cn{uproot} allow you to adjust |
| 1271 |
the position of the root index of a radical: |
| 1272 |
\begin{verbatim} |
| 1273 |
\sqrt[\leftroot{-2}\uproot{2}\beta]{k} |
| 1274 |
\end{verbatim} |
| 1275 |
gives good positioning of the $\beta$: |
| 1276 |
\[\sqrt[\leftroot{-2}\uproot{2}\beta]{k}\] |
| 1277 |
|
| 1278 |
\subsection{Boxed formulas} The command \cn{boxed} puts a box around its |
| 1279 |
argument, like \cn{fbox} except that the contents are in math mode: |
| 1280 |
\begin{verbatim} |
| 1281 |
\boxed{W_t-F\subseteq V(P_i)\subseteq W_t} |
| 1282 |
\end{verbatim} |
| 1283 |
\[\boxed{W_t-F\subseteq V(P_i)\subseteq W_t}.\] |
| 1284 |
|
| 1285 |
\subsection{Extensible arrows} |
| 1286 |
\cn{xleftarrow} and \cn{xrightarrow} produce |
| 1287 |
arrows that extend automatically to accommodate unusually wide |
| 1288 |
subscripts or superscripts. The text of the subscript or superscript |
| 1289 |
are given as an optional resp.\@ mandatory argument: |
| 1290 |
Example: |
| 1291 |
\[0 \xleftarrow[\zeta]{\alpha} F\times\triangle[n-1] |
| 1292 |
\xrightarrow{\partial_0\alpha(b)} E^{\partial_0b}\] |
| 1293 |
\begin{verbatim} |
| 1294 |
\[0 \xleftarrow[\zeta]{\alpha} F\times\triangle[n-1] |
| 1295 |
\xrightarrow{\partial_0\alpha(b)} E^{\partial_0b}\] |
| 1296 |
\end{verbatim} |
| 1297 |
|
| 1298 |
\subsection{\cn{overset}, \cn{underset}, and \cn{sideset}} |
| 1299 |
Examples: |
| 1300 |
\[\overset{*}{X}\qquad\underset{*}{X}\qquad |
| 1301 |
\overset{a}{\underset{b}{X}}\] |
| 1302 |
\begin{verbatim} |
| 1303 |
\[\overset{*}{X}\qquad\underset{*}{X}\qquad |
| 1304 |
\overset{a}{\underset{b}{X}}\] |
| 1305 |
\end{verbatim} |
| 1306 |
|
| 1307 |
The command \cn{sideset} is for a rather special |
| 1308 |
purpose: putting symbols at the subscript and superscript |
| 1309 |
corners of a large operator symbol such as $\sum$ or $\prod$, |
| 1310 |
without affecting the placement of limits. |
| 1311 |
Examples: |
| 1312 |
\[\sideset{_*^*}{_*^*}\prod_k\qquad |
| 1313 |
\sideset{}{'}\sum_{0\le i\le m} E_i\beta x |
| 1314 |
\] |
| 1315 |
\begin{verbatim} |
| 1316 |
\[\sideset{_*^*}{_*^*}\prod_k\qquad |
| 1317 |
\sideset{}{'}\sum_{0\le i\le m} E_i\beta x |
| 1318 |
\] |
| 1319 |
\end{verbatim} |
| 1320 |
|
| 1321 |
\subsection{The \cn{text} command} |
| 1322 |
The main use of the command \cn{text} is for words or phrases in a |
| 1323 |
display: |
| 1324 |
\[\mathbf{y}=\mathbf{y}'\quad\text{if and only if}\quad |
| 1325 |
y'_k=\delta_k y_{\tau(k)}\] |
| 1326 |
\begin{verbatim} |
| 1327 |
\[\mathbf{y}=\mathbf{y}'\quad\text{if and only if}\quad |
| 1328 |
y'_k=\delta_k y_{\tau(k)}\] |
| 1329 |
\end{verbatim} |
| 1330 |
|
| 1331 |
\subsection{Operator names} |
| 1332 |
The more common math functions such as $\log$, $\sin$, and $\lim$ |
| 1333 |
have predefined control sequences: \verb=\log=, \verb=\sin=, |
| 1334 |
\verb=\lim=. |
| 1335 |
The \pkg{amsmath} package provides \cn{DeclareMathOperator} and |
| 1336 |
\cn{DeclareMathOperator*} |
| 1337 |
for producing new function names that will have the |
| 1338 |
same typographical treatment. |
| 1339 |
Examples: |
| 1340 |
\[\norm{f}_\infty= |
| 1341 |
\esssup_{x\in R^n}\abs{f(x)}\] |
| 1342 |
\begin{verbatim} |
| 1343 |
\[\norm{f}_\infty= |
| 1344 |
\esssup_{x\in R^n}\abs{f(x)}\] |
| 1345 |
\end{verbatim} |
| 1346 |
\[\meas_1\{u\in R_+^1\colon f^*(u)>\alpha\} |
| 1347 |
=\meas_n\{x\in R^n\colon \abs{f(x)}\geq\alpha\} |
| 1348 |
\quad \forall\alpha>0.\] |
| 1349 |
\begin{verbatim} |
| 1350 |
\[\meas_1\{u\in R_+^1\colon f^*(u)>\alpha\} |
| 1351 |
=\meas_n\{x\in R^n\colon \abs{f(x)}\geq\alpha\} |
| 1352 |
\quad \forall\alpha>0.\] |
| 1353 |
\end{verbatim} |
| 1354 |
\cn{esssup} and \cn{meas} would be defined in the document preamble as |
| 1355 |
\begin{verbatim} |
| 1356 |
\DeclareMathOperator*{\esssup}{ess\,sup} |
| 1357 |
\DeclareMathOperator{\meas}{meas} |
| 1358 |
\end{verbatim} |
| 1359 |
|
| 1360 |
The following special operator names are predefined in the \pkg{amsmath} |
| 1361 |
package: \cn{varlimsup}, \cn{varliminf}, \cn{varinjlim}, and |
| 1362 |
\cn{varprojlim}. Here's what they look like in use: |
| 1363 |
\begin{align} |
| 1364 |
&\varlimsup_{n\rightarrow\infty} |
| 1365 |
\mathcal{Q}(u_n,u_n-u^{\#})\le0\\ |
| 1366 |
&\varliminf_{n\rightarrow\infty} |
| 1367 |
\left\lvert a_{n+1}\right\rvert/\left\lvert a_n\right\rvert=0\\ |
| 1368 |
&\varinjlim (m_i^\lambda\cdot)^*\le0\\ |
| 1369 |
&\varprojlim_{p\in S(A)}A_p\le0 |
| 1370 |
\end{align} |
| 1371 |
\begin{verbatim} |
| 1372 |
\begin{align} |
| 1373 |
&\varlimsup_{n\rightarrow\infty} |
| 1374 |
\mathcal{Q}(u_n,u_n-u^{\#})\le0\\ |
| 1375 |
&\varliminf_{n\rightarrow\infty} |
| 1376 |
\left\lvert a_{n+1}\right\rvert/\left\lvert a_n\right\rvert=0\\ |
| 1377 |
&\varinjlim (m_i^\lambda\cdot)^*\le0\\ |
| 1378 |
&\varprojlim_{p\in S(A)}A_p\le0 |
| 1379 |
\end{align} |
| 1380 |
\end{verbatim} |
| 1381 |
|
| 1382 |
\subsection{\cn{mod} and its relatives} |
| 1383 |
The commands \cn{mod} and \cn{pod} are variants of |
| 1384 |
\cn{pmod} preferred by some authors; \cn{mod} omits the parentheses, |
| 1385 |
whereas \cn{pod} omits the `mod' and retains the parentheses. |
| 1386 |
Examples: |
| 1387 |
\begin{align} |
| 1388 |
x&\equiv y+1\pmod{m^2}\\ |
| 1389 |
x&\equiv y+1\mod{m^2}\\ |
| 1390 |
x&\equiv y+1\pod{m^2} |
| 1391 |
\end{align} |
| 1392 |
\begin{verbatim} |
| 1393 |
\begin{align} |
| 1394 |
x&\equiv y+1\pmod{m^2}\\ |
| 1395 |
x&\equiv y+1\mod{m^2}\\ |
| 1396 |
x&\equiv y+1\pod{m^2} |
| 1397 |
\end{align} |
| 1398 |
\end{verbatim} |
| 1399 |
|
| 1400 |
\subsection{Fractions and related constructions} |
| 1401 |
\label{fracs} |
| 1402 |
|
| 1403 |
The usual notation for binomials is similar to the fraction concept, |
| 1404 |
so it has a similar command \cn{binom} with two arguments. Example: |
| 1405 |
\begin{equation} |
| 1406 |
\begin{split} |
| 1407 |
\sum_{\gamma\in\Gamma_C} I_\gamma& |
| 1408 |
=2^k-\binom{k}{1}2^{k-1}+\binom{k}{2}2^{k-2}\\ |
| 1409 |
&\quad+\dots+(-1)^l\binom{k}{l}2^{k-l} |
| 1410 |
+\dots+(-1)^k\\ |
| 1411 |
&=(2-1)^k=1 |
| 1412 |
\end{split} |
| 1413 |
\end{equation} |
| 1414 |
\begin{verbatim} |
| 1415 |
\begin{equation} |
| 1416 |
\begin{split} |
| 1417 |
[\sum_{\gamma\in\Gamma_C} I_\gamma& |
| 1418 |
=2^k-\binom{k}{1}2^{k-1}+\binom{k}{2}2^{k-2}\\ |
| 1419 |
&\quad+\dots+(-1)^l\binom{k}{l}2^{k-l} |
| 1420 |
+\dots+(-1)^k\\ |
| 1421 |
&=(2-1)^k=1 |
| 1422 |
\end{split} |
| 1423 |
\end{equation} |
| 1424 |
\end{verbatim} |
| 1425 |
There are also abbreviations |
| 1426 |
\begin{verbatim} |
| 1427 |
\dfrac \dbinom |
| 1428 |
\tfrac \tbinom |
| 1429 |
\end{verbatim} |
| 1430 |
for the commonly needed constructions |
| 1431 |
\begin{verbatim} |
| 1432 |
{\displaystyle\frac ... } {\displaystyle\binom ... } |
| 1433 |
{\textstyle\frac ... } {\textstyle\binom ... } |
| 1434 |
\end{verbatim} |
| 1435 |
|
| 1436 |
The generalized fraction command \cn{genfrac} provides full access to |
| 1437 |
the six \TeX{} fraction primitives: |
| 1438 |
\begin{align} |
| 1439 |
\text{\cn{over}: }&\genfrac{}{}{}{}{n+1}{2}& |
| 1440 |
\text{\cn{overwithdelims}: }& |
| 1441 |
\genfrac{\langle}{\rangle}{}{}{n+1}{2}\\ |
| 1442 |
\text{\cn{atop}: }&\genfrac{}{}{0pt}{}{n+1}{2}& |
| 1443 |
\text{\cn{atopwithdelims}: }& |
| 1444 |
\genfrac{(}{)}{0pt}{}{n+1}{2}\\ |
| 1445 |
\text{\cn{above}: }&\genfrac{}{}{1pt}{}{n+1}{2}& |
| 1446 |
\text{\cn{abovewithdelims}: }& |
| 1447 |
\genfrac{[}{]}{1pt}{}{n+1}{2} |
| 1448 |
\end{align} |
| 1449 |
\begin{verbatim} |
| 1450 |
\text{\cn{over}: }&\genfrac{}{}{}{}{n+1}{2}& |
| 1451 |
\text{\cn{overwithdelims}: }& |
| 1452 |
\genfrac{\langle}{\rangle}{}{}{n+1}{2}\\ |
| 1453 |
\text{\cn{atop}: }&\genfrac{}{}{0pt}{}{n+1}{2}& |
| 1454 |
\text{\cn{atopwithdelims}: }& |
| 1455 |
\genfrac{(}{)}{0pt}{}{n+1}{2}\\ |
| 1456 |
\text{\cn{above}: }&\genfrac{}{}{1pt}{}{n+1}{2}& |
| 1457 |
\text{\cn{abovewithdelims}: }& |
| 1458 |
\genfrac{[}{]}{1pt}{}{n+1}{2} |
| 1459 |
\end{verbatim} |
| 1460 |
|
| 1461 |
\subsection{Continued fractions} |
| 1462 |
The continued fraction |
| 1463 |
\begin{equation} |
| 1464 |
\cfrac{1}{\sqrt{2}+ |
| 1465 |
\cfrac{1}{\sqrt{2}+ |
| 1466 |
\cfrac{1}{\sqrt{2}+ |
| 1467 |
\cfrac{1}{\sqrt{2}+ |
| 1468 |
\cfrac{1}{\sqrt{2}+\dotsb |
| 1469 |
}}}}} |
| 1470 |
\end{equation} |
| 1471 |
can be obtained by typing |
| 1472 |
\begin{verbatim} |
| 1473 |
\cfrac{1}{\sqrt{2}+ |
| 1474 |
\cfrac{1}{\sqrt{2}+ |
| 1475 |
\cfrac{1}{\sqrt{2}+ |
| 1476 |
\cfrac{1}{\sqrt{2}+ |
| 1477 |
\cfrac{1}{\sqrt{2}+\dotsb |
| 1478 |
}}}}} |
| 1479 |
\end{verbatim} |
| 1480 |
Left or right placement of any of the numerators is accomplished by using |
| 1481 |
\cn{cfrac[l]} or \cn{cfrac[r]} instead of \cn{cfrac}. |
| 1482 |
|
| 1483 |
\subsection{Smash} |
| 1484 |
|
| 1485 |
In \pkg{amsmath} there are optional arguments \verb"t" and \verb"b" for |
| 1486 |
the plain \TeX\ command \cn{smash}, because sometimes it is advantageous |
| 1487 |
to be able to `smash' only the top or only the bottom of something while |
| 1488 |
retaining the natural depth or height. In the formula |
| 1489 |
$X_j=(1/\sqrt{\smash[b]{\lambda_j}})X_j'$ \cn{smash}\verb=[b]= has been |
| 1490 |
used to limit the size of the radical symbol. |
| 1491 |
\begin{verbatim} |
| 1492 |
$X_j=(1/\sqrt{\smash[b]{\lambda_j}})X_j'$ |
| 1493 |
\end{verbatim} |
| 1494 |
Without the use of \cn{smash}\verb=[b]= the formula would have appeared |
| 1495 |
thus: $X_j=(1/\sqrt{\lambda_j})X_j'$, with the radical extending to |
| 1496 |
encompass the depth of the subscript $j$. |
| 1497 |
|
| 1498 |
\subsection{The `cases' environment} |
| 1499 |
`Cases' constructions like the following can be produced using |
| 1500 |
the \env{cases} environment. |
| 1501 |
\begin{equation} |
| 1502 |
P_{r-j}= |
| 1503 |
\begin{cases} |
| 1504 |
0& \text{if $r-j$ is odd},\\ |
| 1505 |
r!\,(-1)^{(r-j)/2}& \text{if $r-j$ is even}. |
| 1506 |
\end{cases} |
| 1507 |
\end{equation} |
| 1508 |
\begin{verbatim} |
| 1509 |
\begin{equation} P_{r-j}= |
| 1510 |
\begin{cases} |
| 1511 |
0& \text{if $r-j$ is odd},\\ |
| 1512 |
r!\,(-1)^{(r-j)/2}& \text{if $r-j$ is even}. |
| 1513 |
\end{cases} |
| 1514 |
\end{equation} |
| 1515 |
\end{verbatim} |
| 1516 |
Notice the use of \cn{text} and the embedded math. |
| 1517 |
|
| 1518 |
\subsection{Matrix} |
| 1519 |
|
| 1520 |
Here are samples of the matrix environments, |
| 1521 |
\cn{matrix}, \cn{pmatrix}, \cn{bmatrix}, \cn{Bmatrix}, \cn{vmatrix} |
| 1522 |
and \cn{Vmatrix}: |
| 1523 |
\begin{equation} |
| 1524 |
\begin{matrix} |
| 1525 |
\vartheta& \varrho\\\varphi& \varpi |
| 1526 |
\end{matrix}\quad |
| 1527 |
\begin{pmatrix} |
| 1528 |
\vartheta& \varrho\\\varphi& \varpi |
| 1529 |
\end{pmatrix}\quad |
| 1530 |
\begin{bmatrix} |
| 1531 |
\vartheta& \varrho\\\varphi& \varpi |
| 1532 |
\end{bmatrix}\quad |
| 1533 |
\begin{Bmatrix} |
| 1534 |
\vartheta& \varrho\\\varphi& \varpi |
| 1535 |
\end{Bmatrix}\quad |
| 1536 |
\begin{vmatrix} |
| 1537 |
\vartheta& \varrho\\\varphi& \varpi |
| 1538 |
\end{vmatrix}\quad |
| 1539 |
\begin{Vmatrix} |
| 1540 |
\vartheta& \varrho\\\varphi& \varpi |
| 1541 |
\end{Vmatrix} |
| 1542 |
\end{equation} |
| 1543 |
% |
| 1544 |
\begin{verbatim} |
| 1545 |
\begin{matrix} |
| 1546 |
\vartheta& \varrho\\\varphi& \varpi |
| 1547 |
\end{matrix}\quad |
| 1548 |
\begin{pmatrix} |
| 1549 |
\vartheta& \varrho\\\varphi& \varpi |
| 1550 |
\end{pmatrix}\quad |
| 1551 |
\begin{bmatrix} |
| 1552 |
\vartheta& \varrho\\\varphi& \varpi |
| 1553 |
\end{bmatrix}\quad |
| 1554 |
\begin{Bmatrix} |
| 1555 |
\vartheta& \varrho\\\varphi& \varpi |
| 1556 |
\end{Bmatrix}\quad |
| 1557 |
\begin{vmatrix} |
| 1558 |
\vartheta& \varrho\\\varphi& \varpi |
| 1559 |
\end{vmatrix}\quad |
| 1560 |
\begin{Vmatrix} |
| 1561 |
\vartheta& \varrho\\\varphi& \varpi |
| 1562 |
\end{Vmatrix} |
| 1563 |
\end{verbatim} |
| 1564 |
|
| 1565 |
To produce a small matrix suitable for use in text, use the |
| 1566 |
\env{smallmatrix} environment. |
| 1567 |
\begin{verbatim} |
| 1568 |
\begin{math} |
| 1569 |
\bigl( \begin{smallmatrix} |
| 1570 |
a&b\\ c&d |
| 1571 |
\end{smallmatrix} \bigr) |
| 1572 |
\end{math} |
| 1573 |
\end{verbatim} |
| 1574 |
To show |
| 1575 |
the effect of the matrix on the surrounding lines of |
| 1576 |
a paragraph, we put it here: \begin{math} |
| 1577 |
\bigl( \begin{smallmatrix} |
| 1578 |
a&b\\ c&d |
| 1579 |
\end{smallmatrix} \bigr) |
| 1580 |
\end{math} |
| 1581 |
and follow it with enough text to ensure that there will |
| 1582 |
be at least one full line below the matrix. |
| 1583 |
|
| 1584 |
\cn{hdotsfor}\verb"{"\textit{number}\verb"}" produces a row of dots in a matrix |
| 1585 |
spanning the given number of columns: |
| 1586 |
\[W(\Phi)= \begin{Vmatrix} |
| 1587 |
\dfrac\varphi{(\varphi_1,\varepsilon_1)}&0&\dots&0\\ |
| 1588 |
\dfrac{\varphi k_{n2}}{(\varphi_2,\varepsilon_1)}& |
| 1589 |
\dfrac\varphi{(\varphi_2,\varepsilon_2)}&\dots&0\\ |
| 1590 |
\hdotsfor{5}\\ |
| 1591 |
\dfrac{\varphi k_{n1}}{(\varphi_n,\varepsilon_1)}& |
| 1592 |
\dfrac{\varphi k_{n2}}{(\varphi_n,\varepsilon_2)}&\dots& |
| 1593 |
\dfrac{\varphi k_{n\,n-1}}{(\varphi_n,\varepsilon_{n-1})}& |
| 1594 |
\dfrac{\varphi}{(\varphi_n,\varepsilon_n)} |
| 1595 |
\end{Vmatrix}\] |
| 1596 |
\begin{verbatim} |
| 1597 |
\[W(\Phi)= \begin{Vmatrix} |
| 1598 |
\dfrac\varphi{(\varphi_1,\varepsilon_1)}&0&\dots&0\\ |
| 1599 |
\dfrac{\varphi k_{n2}}{(\varphi_2,\varepsilon_1)}& |
| 1600 |
\dfrac\varphi{(\varphi_2,\varepsilon_2)}&\dots&0\\ |
| 1601 |
\hdotsfor{5}\\ |
| 1602 |
\dfrac{\varphi k_{n1}}{(\varphi_n,\varepsilon_1)}& |
| 1603 |
\dfrac{\varphi k_{n2}}{(\varphi_n,\varepsilon_2)}&\dots& |
| 1604 |
\dfrac{\varphi k_{n\,n-1}}{(\varphi_n,\varepsilon_{n-1})}& |
| 1605 |
\dfrac{\varphi}{(\varphi_n,\varepsilon_n)} |
| 1606 |
\end{Vmatrix}\] |
| 1607 |
\end{verbatim} |
| 1608 |
The spacing of the dots can be varied through use of a square-bracket |
| 1609 |
option, for example, \verb"\hdotsfor[1.5]{3}". The number in square brackets |
| 1610 |
will be used as a multiplier; the normal value is 1. |
| 1611 |
|
| 1612 |
\subsection{The \cn{substack} command} |
| 1613 |
|
| 1614 |
The \cn{substack} command can be used to produce a multiline |
| 1615 |
subscript or superscript: |
| 1616 |
for example |
| 1617 |
\begin{verbatim} |
| 1618 |
\sum_{\substack{0\le i\le m\\ 0<j<n}} P(i,j) |
| 1619 |
\end{verbatim} |
| 1620 |
produces a two-line subscript underneath the sum: |
| 1621 |
\begin{equation} |
| 1622 |
\sum_{\substack{0\le i\le m\\ 0<j<n}} P(i,j) |
| 1623 |
\end{equation} |
| 1624 |
A slightly more generalized form is the \env{subarray} environment which |
| 1625 |
allows you to specify that each line should be left-aligned instead of |
| 1626 |
centered, as here: |
| 1627 |
\begin{equation} |
| 1628 |
\sum_{\begin{subarray}{l} |
| 1629 |
0\le i\le m\\ 0<j<n |
| 1630 |
\end{subarray}} |
| 1631 |
P(i,j) |
| 1632 |
\end{equation} |
| 1633 |
\begin{verbatim} |
| 1634 |
\sum_{\begin{subarray}{l} |
| 1635 |
0\le i\le m\\ 0<j<n |
| 1636 |
\end{subarray}} |
| 1637 |
P(i,j) |
| 1638 |
\end{verbatim} |
| 1639 |
|
| 1640 |
|
| 1641 |
\subsection{Big-g-g delimiters} |
| 1642 |
Here are some big delimiters, first in \cn{normalsize}: |
| 1643 |
\[\biggl(\mathbf{E}_{y} |
| 1644 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1645 |
\biggr) |
| 1646 |
\] |
| 1647 |
\begin{verbatim} |
| 1648 |
\[\biggl(\mathbf{E}_{y} |
| 1649 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1650 |
\biggr) |
| 1651 |
\] |
| 1652 |
\end{verbatim} |
| 1653 |
and now in \cn{Large} size: |
| 1654 |
{\Large |
| 1655 |
\[\biggl(\mathbf{E}_{y} |
| 1656 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1657 |
\biggr) |
| 1658 |
\]} |
| 1659 |
\begin{verbatim} |
| 1660 |
{\Large |
| 1661 |
\[\biggl(\mathbf{E}_{y} |
| 1662 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1663 |
\biggr) |
| 1664 |
\]} |
| 1665 |
\end{verbatim} |
| 1666 |
|
| 1667 |
\newpage |
| 1668 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1669 |
\makeatletter |
| 1670 |
|
| 1671 |
%% This turns on vertical rules at the right and left margins, to |
| 1672 |
%% better illustrate the spacing for certain multiple-line equation |
| 1673 |
%% structures. |
| 1674 |
\def\@makecol{\ifvoid\footins \setbox\@outputbox\box\@cclv |
| 1675 |
\else\setbox\@outputbox |
| 1676 |
\vbox{\boxmaxdepth \maxdepth |
| 1677 |
\unvbox\@cclv\vskip\skip\footins\footnoterule\unvbox\footins}\fi |
| 1678 |
\xdef\@freelist{\@freelist\@midlist}\gdef\@midlist{}\@combinefloats |
| 1679 |
\setbox\@outputbox\hbox{\vrule width\marginrulewidth |
| 1680 |
\vbox to\@colht{\boxmaxdepth\maxdepth |
| 1681 |
\@texttop\dimen128=\dp\@outputbox\unvbox\@outputbox |
| 1682 |
\vskip-\dimen128\@textbottom}% |
| 1683 |
\vrule width\marginrulewidth}% |
| 1684 |
\global\maxdepth\@maxdepth} |
| 1685 |
\newdimen\marginrulewidth |
| 1686 |
\setlength{\marginrulewidth}{.1pt} |
| 1687 |
\makeatother |
| 1688 |
|
| 1689 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1690 |
|
| 1691 |
\appendix |
| 1692 |
\section{Examples of multiple-line equation structures} |
| 1693 |
\label{s:eq} |
| 1694 |
|
| 1695 |
\textbf{\large Note: Starting on this page, vertical rules are |
| 1696 |
added at the margins so that the positioning of various display elements |
| 1697 |
with respect to the margins can be seen more clearly.} |
| 1698 |
|
| 1699 |
\subsection{Split} |
| 1700 |
The \env{split} environment is not an independent environment |
| 1701 |
but should be used inside something else such as \env{equation} |
| 1702 |
or \env{align}. |
| 1703 |
|
| 1704 |
If there is not enough room for it, the equation number for a |
| 1705 |
\env{split} will be shifted to the previous line, when equation numbers are |
| 1706 |
on the left; the number shifts down to the next line when numbers are on |
| 1707 |
the right. |
| 1708 |
\begin{equation} |
| 1709 |
\begin{split} |
| 1710 |
f_{h,\varepsilon}(x,y) |
| 1711 |
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1712 |
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\ |
| 1713 |
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\ |
| 1714 |
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y} |
| 1715 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1716 |
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\ |
| 1717 |
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon} |
| 1718 |
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)} |
| 1719 |
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1720 |
L_{x,y_\varepsilon(\varepsilon s)} |
| 1721 |
\varphi(x)\,ds\biggr)\biggr]\\ |
| 1722 |
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y), |
| 1723 |
\end{split} |
| 1724 |
\end{equation} |
| 1725 |
Some text after to test the below-display spacing. |
| 1726 |
|
| 1727 |
\begin{verbatim} |
| 1728 |
\begin{equation} |
| 1729 |
\begin{split} |
| 1730 |
f_{h,\varepsilon}(x,y) |
| 1731 |
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1732 |
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\ |
| 1733 |
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\ |
| 1734 |
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y} |
| 1735 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1736 |
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\ |
| 1737 |
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon} |
| 1738 |
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)} |
| 1739 |
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1740 |
L_{x,y_\varepsilon(\varepsilon s)} |
| 1741 |
\varphi(x)\,ds\biggr)\biggr]\\ |
| 1742 |
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y), |
| 1743 |
\end{split} |
| 1744 |
\end{equation} |
| 1745 |
\end{verbatim} |
| 1746 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1747 |
|
| 1748 |
\newpage |
| 1749 |
Unnumbered version: |
| 1750 |
\begin{equation*} |
| 1751 |
\begin{split} |
| 1752 |
f_{h,\varepsilon}(x,y) |
| 1753 |
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1754 |
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\ |
| 1755 |
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\ |
| 1756 |
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y} |
| 1757 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1758 |
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\ |
| 1759 |
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon} |
| 1760 |
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)} |
| 1761 |
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1762 |
L_{x,y_\varepsilon(\varepsilon s)} |
| 1763 |
\varphi(x)\,ds\biggr)\biggr]\\ |
| 1764 |
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y), |
| 1765 |
\end{split} |
| 1766 |
\end{equation*} |
| 1767 |
Some text after to test the below-display spacing. |
| 1768 |
|
| 1769 |
\begin{verbatim} |
| 1770 |
\begin{equation*} |
| 1771 |
\begin{split} |
| 1772 |
f_{h,\varepsilon}(x,y) |
| 1773 |
&=\varepsilon\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1774 |
L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\ |
| 1775 |
&= h\int L_{x,z}\varphi(x)\rho_x(dz)\\ |
| 1776 |
&\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y} |
| 1777 |
\int_0^{t_\varepsilon}L_{x,y^x(s)}\varphi(x)\,ds |
| 1778 |
-t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\ |
| 1779 |
&\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon} |
| 1780 |
\biggl(\mathbf{E}_{y}\int_0^{t_\varepsilon}L_{x,y^x(s)} |
| 1781 |
\varphi(x)\,ds -\mathbf{E}_{x,y}\int_0^{t_\varepsilon} |
| 1782 |
L_{x,y_\varepsilon(\varepsilon s)} |
| 1783 |
\varphi(x)\,ds\biggr)\biggr]\\ |
| 1784 |
&=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y), |
| 1785 |
\end{split} |
| 1786 |
\end{equation*} |
| 1787 |
\end{verbatim} |
| 1788 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1789 |
|
| 1790 |
\newpage |
| 1791 |
If the option \env{centertags} is included in the options |
| 1792 |
list of the \pkg{amsmath} package, |
| 1793 |
the equation numbers for \env{split} environments will be |
| 1794 |
centered vertically on the height |
| 1795 |
of the \env{split}: |
| 1796 |
{\makeatletter\ctagsplit@true |
| 1797 |
\begin{equation} |
| 1798 |
\begin{split} |
| 1799 |
\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t)-\int_{\gamma(t)}^a |
| 1800 |
\frac{d\theta}{k(\theta,t)} |
| 1801 |
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\ |
| 1802 |
&\le C_6\left\lvert \left\lvert f\int_\Omega\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1803 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1804 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1805 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1806 |
\end{split} |
| 1807 |
\end{equation}}% |
| 1808 |
Some text after to test the below-display spacing. |
| 1809 |
|
| 1810 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1811 |
|
| 1812 |
\newpage |
| 1813 |
Use of \env{split} within \env{align}: |
| 1814 |
{\delimiterfactor750 |
| 1815 |
\begin{align} |
| 1816 |
\begin{split}\abs{I_1} |
| 1817 |
&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\ |
| 1818 |
&\le C_3\left[\int_\Omega\left(\int_{a}^x |
| 1819 |
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\ |
| 1820 |
&\quad\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k} |
| 1821 |
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\} |
| 1822 |
c\Omega\right]^{1/2}\\ |
| 1823 |
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1824 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1825 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1826 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1827 |
\end{split}\label{eq:A}\\ |
| 1828 |
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t) |
| 1829 |
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)} |
| 1830 |
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\ |
| 1831 |
&\le C_6\left\lvert \left\lvert f\int_\Omega |
| 1832 |
\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1833 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1834 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1835 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1836 |
\end{split} |
| 1837 |
\end{align}}% |
| 1838 |
Some text after to test the below-display spacing. |
| 1839 |
|
| 1840 |
\begin{verbatim} |
| 1841 |
\begin{align} |
| 1842 |
\begin{split}\abs{I_1} |
| 1843 |
&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\ |
| 1844 |
&\le C_3\left[\int_\Omega\left(\int_{a}^x |
| 1845 |
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\ |
| 1846 |
&\quad\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k} |
| 1847 |
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\} |
| 1848 |
c\Omega\right]^{1/2}\\ |
| 1849 |
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1850 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1851 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1852 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1853 |
\end{split}\label{eq:A}\\ |
| 1854 |
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t) |
| 1855 |
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)} |
| 1856 |
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\ |
| 1857 |
&\le C_6\left\lvert \left\lvert f\int_\Omega |
| 1858 |
\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1859 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1860 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1861 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1862 |
\end{split} |
| 1863 |
\end{align} |
| 1864 |
\end{verbatim} |
| 1865 |
|
| 1866 |
%%%%%%%%%%%%%%%%%% |
| 1867 |
|
| 1868 |
\newpage |
| 1869 |
Unnumbered \env{align}, with a number on the second \env{split}: |
| 1870 |
\begin{align*} |
| 1871 |
\begin{split}\abs{I_1}&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\ |
| 1872 |
&\le C_3\left[\int_\Omega\left(\int_{a}^x |
| 1873 |
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\ |
| 1874 |
&\phantom{=}\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k} |
| 1875 |
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\} |
| 1876 |
c\Omega\right]^{1/2}\\ |
| 1877 |
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1878 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1879 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1880 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1881 |
\end{split}\\ |
| 1882 |
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t) |
| 1883 |
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)} |
| 1884 |
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\ |
| 1885 |
&\le C_6\left\lvert \left\lvert f\int_\Omega |
| 1886 |
\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1887 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1888 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1889 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1890 |
\end{split}\tag{\theequation$'$} |
| 1891 |
\end{align*} |
| 1892 |
Some text after to test the below-display spacing. |
| 1893 |
|
| 1894 |
\begin{verbatim} |
| 1895 |
\begin{align*} |
| 1896 |
\begin{split}\abs{I_1}&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\ |
| 1897 |
&\le C_3\left[\int_\Omega\left(\int_{a}^x |
| 1898 |
g(\xi,t)\,d\xi\right)^2d\Omega\right]^{1/2}\\ |
| 1899 |
&\phantom{=}\times \left[\int_\Omega\left\{u^2_x+\frac{1}{k} |
| 1900 |
\left(\int_{a}^x cu_t\,d\xi\right)^2\right\} |
| 1901 |
c\Omega\right]^{1/2}\\ |
| 1902 |
&\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1903 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1904 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1905 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1906 |
\end{split}\\ |
| 1907 |
\begin{split}\abs{I_2}&=\left\lvert \int_{0}^T \psi(t)\left\{u(a,t) |
| 1908 |
-\int_{\gamma(t)}^a\frac{d\theta}{k(\theta,t)} |
| 1909 |
\int_{a}^\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\ |
| 1910 |
&\le C_6\left\lvert \left\lvert f\int_\Omega |
| 1911 |
\left\lvert \wt{S}^{-1,0}_{a,-} |
| 1912 |
W_2(\Omega,\Gamma_l)\right\rvert\right\rvert |
| 1913 |
\left\lvert \abs{u}\overset{\circ}\to W_2^{\wt{A}} |
| 1914 |
(\Omega;\Gamma_r,T)\right\rvert\right\rvert. |
| 1915 |
\end{split}\tag{\theequation$'$} |
| 1916 |
\end{align*} |
| 1917 |
\end{verbatim} |
| 1918 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1919 |
|
| 1920 |
\newpage |
| 1921 |
\subsection{Multline} |
| 1922 |
Numbered version: |
| 1923 |
\begin{multline}\label{eq:E} |
| 1924 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1925 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1926 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1927 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1928 |
\end{multline} |
| 1929 |
To test the use of \verb=\label= and |
| 1930 |
\verb=\ref=, we refer to the number of this |
| 1931 |
equation here: (\ref{eq:E}). |
| 1932 |
|
| 1933 |
\begin{verbatim} |
| 1934 |
\begin{multline}\label{eq:E} |
| 1935 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1936 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1937 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1938 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1939 |
\end{multline} |
| 1940 |
\end{verbatim} |
| 1941 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1942 |
|
| 1943 |
Unnumbered version: |
| 1944 |
\begin{multline*} |
| 1945 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1946 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1947 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1948 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1949 |
\end{multline*} |
| 1950 |
Some text after to test the below-display spacing. |
| 1951 |
|
| 1952 |
\begin{verbatim} |
| 1953 |
\begin{multline*} |
| 1954 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1955 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1956 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1957 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1958 |
\end{multline*} |
| 1959 |
\end{verbatim} |
| 1960 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1961 |
|
| 1962 |
\iffalse % bugfix needed, error message "Multiple \tag" |
| 1963 |
% [mjd,24-Jan-1995] |
| 1964 |
\newpage |
| 1965 |
And now an ``unnumbered'' version numbered with a literal tag: |
| 1966 |
\begin{multline*}\tag*{[a]} |
| 1967 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1968 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1969 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1970 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1971 |
\end{multline*} |
| 1972 |
Some text after to test the below-display spacing. |
| 1973 |
|
| 1974 |
\begin{verbatim} |
| 1975 |
\begin{multline*}\tag*{[a]} |
| 1976 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1977 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1978 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1979 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1980 |
\end{multline*} |
| 1981 |
\end{verbatim} |
| 1982 |
|
| 1983 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 1984 |
|
| 1985 |
The same display with \verb=\multlinegap= set to zero. |
| 1986 |
Notice that the space on the left in |
| 1987 |
the first line does not change, because of the equation number, while |
| 1988 |
the second line is pushed over to the right margin. |
| 1989 |
{\setlength{\multlinegap}{0pt} |
| 1990 |
\begin{multline*}\tag*{[a]} |
| 1991 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 1992 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 1993 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 1994 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 1995 |
\end{multline*}}% |
| 1996 |
Some text after to test the below-display spacing. |
| 1997 |
|
| 1998 |
\begin{verbatim} |
| 1999 |
{\setlength{\multlinegap}{0pt} |
| 2000 |
\begin{multline*}\tag*{[a]} |
| 2001 |
\int_a^b\biggl\{\int_a^b[f(x)^2g(y)^2+f(y)^2g(x)^2] |
| 2002 |
-2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\ |
| 2003 |
=\int_a^b\biggl\{g(y)^2\int_a^bf^2+f(y)^2 |
| 2004 |
\int_a^b g^2-2f(y)g(y)\int_a^b fg\biggr\}\,dy |
| 2005 |
\end{multline*}} |
| 2006 |
\end{verbatim} |
| 2007 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2008 |
\fi % matches \iffalse above [mjd,24-Jan-1995] |
| 2009 |
|
| 2010 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2011 |
|
| 2012 |
\newpage |
| 2013 |
\subsection{Gather} |
| 2014 |
Numbered version with \verb;\notag; on the second line: |
| 2015 |
\begin{gather} |
| 2016 |
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\ |
| 2017 |
\seg(a,r)\equiv\{z\in\mathbf{C}\colon |
| 2018 |
\Im z= \Im a,\ \abs{z-a}<r\},\notag\\ |
| 2019 |
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C} |
| 2020 |
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\ |
| 2021 |
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r). |
| 2022 |
\end{gather} |
| 2023 |
\begin{verbatim} |
| 2024 |
\begin{gather} |
| 2025 |
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\ |
| 2026 |
\seg(a,r)\equiv\{z\in\mathbf{C}\colon |
| 2027 |
\Im z= \Im a,\ \abs{z-a}<r\},\notag\\ |
| 2028 |
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C} |
| 2029 |
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\ |
| 2030 |
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r). |
| 2031 |
\end{gather} |
| 2032 |
\end{verbatim} |
| 2033 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2034 |
|
| 2035 |
Unnumbered version. |
| 2036 |
\begin{gather*} |
| 2037 |
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\ |
| 2038 |
\seg (a,r)\equiv\{z\in\mathbf{C}\colon |
| 2039 |
\Im z= \Im a,\ \abs{z-a}<r\},\\ |
| 2040 |
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C} |
| 2041 |
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\ |
| 2042 |
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r). |
| 2043 |
\end{gather*} |
| 2044 |
Some text after to test the below-display spacing. |
| 2045 |
\begin{verbatim} |
| 2046 |
\begin{gather*} |
| 2047 |
D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\ |
| 2048 |
\seg (a,r)\equiv\{z\in\mathbf{C}\colon |
| 2049 |
\Im z= \Im a,\ \abs{z-a}<r\},\\ |
| 2050 |
c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C} |
| 2051 |
\colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\ |
| 2052 |
C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r). |
| 2053 |
\end{gather*} |
| 2054 |
\end{verbatim} |
| 2055 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2056 |
|
| 2057 |
\newpage |
| 2058 |
\subsection{Align} |
| 2059 |
Numbered version: |
| 2060 |
\begin{align} |
| 2061 |
\gamma_x(t)&=(\cos tu+\sin tx,v),\\ |
| 2062 |
\gamma_y(t)&=(u,\cos tv+\sin ty),\\ |
| 2063 |
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv, |
| 2064 |
-\frac\beta\alpha\sin tu+\cos tv\right). |
| 2065 |
\end{align} |
| 2066 |
Some text after to test the below-display spacing. |
| 2067 |
|
| 2068 |
\begin{verbatim} |
| 2069 |
\begin{align} |
| 2070 |
\gamma_x(t)&=(\cos tu+\sin tx,v),\\ |
| 2071 |
\gamma_y(t)&=(u,\cos tv+\sin ty),\\ |
| 2072 |
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv, |
| 2073 |
-\frac\beta\alpha\sin tu+\cos tv\right). |
| 2074 |
\end{align} |
| 2075 |
\end{verbatim} |
| 2076 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2077 |
|
| 2078 |
Unnumbered version: |
| 2079 |
\begin{align*} |
| 2080 |
\gamma_x(t)&=(\cos tu+\sin tx,v),\\ |
| 2081 |
\gamma_y(t)&=(u,\cos tv+\sin ty),\\ |
| 2082 |
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv, |
| 2083 |
-\frac\beta\alpha\sin tu+\cos tv\right). |
| 2084 |
\end{align*} |
| 2085 |
Some text after to test the below-display spacing. |
| 2086 |
|
| 2087 |
\begin{verbatim} |
| 2088 |
\begin{align*} |
| 2089 |
\gamma_x(t)&=(\cos tu+\sin tx,v),\\ |
| 2090 |
\gamma_y(t)&=(u,\cos tv+\sin ty),\\ |
| 2091 |
\gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv, |
| 2092 |
-\frac\beta\alpha\sin tu+\cos tv\right). |
| 2093 |
\end{align*} |
| 2094 |
\end{verbatim} |
| 2095 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2096 |
|
| 2097 |
A variation: |
| 2098 |
\begin{align} |
| 2099 |
x& =y && \text {by (\ref{eq:C})}\\ |
| 2100 |
x'& = y' && \text {by (\ref{eq:D})}\\ |
| 2101 |
x+x' & = y+y' && \text {by Axiom 1.} |
| 2102 |
\end{align} |
| 2103 |
Some text after to test the below-display spacing. |
| 2104 |
|
| 2105 |
\begin{verbatim} |
| 2106 |
\begin{align} |
| 2107 |
x& =y && \text {by (\ref{eq:C})}\\ |
| 2108 |
x'& = y' && \text {by (\ref{eq:D})}\\ |
| 2109 |
x+x' & = y+y' && \text {by Axiom 1.} |
| 2110 |
\end{align} |
| 2111 |
\end{verbatim} |
| 2112 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2113 |
|
| 2114 |
\newpage |
| 2115 |
\subsection{Align and split within gather} |
| 2116 |
When using the \env{align} environment within the \env{gather} |
| 2117 |
environment, one or the other, or both, should be unnumbered (using the |
| 2118 |
\verb"*" form); numbering both the outer and inner environment would |
| 2119 |
cause a conflict. |
| 2120 |
|
| 2121 |
Automatically numbered \env{gather} with \env{split} and \env{align*}: |
| 2122 |
\begin{gather} |
| 2123 |
\begin{split} \varphi(x,z) |
| 2124 |
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\ |
| 2125 |
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n |
| 2126 |
\end{split}\\[6pt] |
| 2127 |
\begin{align*} |
| 2128 |
\zeta^0 &=(\xi^0)^2,\\ |
| 2129 |
\zeta^1 &=\xi^0\xi^1,\\ |
| 2130 |
\zeta^2 &=(\xi^1)^2, |
| 2131 |
\end{align*} |
| 2132 |
\end{gather} |
| 2133 |
Here the \env{split} environment gets a number from the outer |
| 2134 |
\env{gather} environment; numbers for individual lines of the |
| 2135 |
\env{align*} are suppressed because of the star. |
| 2136 |
|
| 2137 |
\begin{verbatim} |
| 2138 |
\begin{gather} |
| 2139 |
\begin{split} \varphi(x,z) |
| 2140 |
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\ |
| 2141 |
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n |
| 2142 |
\end{split}\\[6pt] |
| 2143 |
\begin{align*} |
| 2144 |
\zeta^0 &=(\xi^0)^2,\\ |
| 2145 |
\zeta^1 &=\xi^0\xi^1,\\ |
| 2146 |
\zeta^2 &=(\xi^1)^2, |
| 2147 |
\end{align*} |
| 2148 |
\end{gather} |
| 2149 |
\end{verbatim} |
| 2150 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2151 |
|
| 2152 |
The \verb"*"-ed form of \env{gather} with the non-\verb"*"-ed form of |
| 2153 |
\env{align}. |
| 2154 |
\begin{gather*} |
| 2155 |
\begin{split} \varphi(x,z) |
| 2156 |
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\ |
| 2157 |
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n |
| 2158 |
\end{split}\\[6pt] |
| 2159 |
\begin{align} \zeta^0&=(\xi^0)^2,\\ |
| 2160 |
\zeta^1 &=\xi^0\xi^1,\\ |
| 2161 |
\zeta^2 &=(\xi^1)^2, |
| 2162 |
\end{align} |
| 2163 |
\end{gather*} |
| 2164 |
Some text after to test the below-display spacing. |
| 2165 |
|
| 2166 |
\begin{verbatim} |
| 2167 |
\begin{gather*} |
| 2168 |
\begin{split} \varphi(x,z) |
| 2169 |
&=z-\gamma_{10}x-\gamma_{mn}x^mz^n\\ |
| 2170 |
&=z-Mr^{-1}x-Mr^{-(m+n)}x^mz^n |
| 2171 |
\end{split}\\[6pt] |
| 2172 |
\begin{align} \zeta^0&=(\xi^0)^2,\\ |
| 2173 |
\zeta^1 &=\xi^0\xi^1,\\ |
| 2174 |
\zeta^2 &=(\xi^1)^2, |
| 2175 |
\end{align} |
| 2176 |
\end{gather*} |
| 2177 |
\end{verbatim} |
| 2178 |
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2179 |
|
| 2180 |
\newpage |
| 2181 |
\subsection{Alignat} |
| 2182 |
Numbered version: |
| 2183 |
\begin{alignat}{3} |
| 2184 |
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j, |
| 2185 |
& \qquad U_i & = u_i, |
| 2186 |
\qquad \text{for $i\ne j$;}\label{eq:B}\\ |
| 2187 |
V_j & = v_j, & \qquad X_j & = x_j, |
| 2188 |
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i. |
| 2189 |
\end{alignat} |
| 2190 |
Some text after to test the below-display spacing. |
| 2191 |
|
| 2192 |
\begin{verbatim} |
| 2193 |
\begin{alignat}{3} |
| 2194 |
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j, |
| 2195 |
& \qquad U_i & = u_i, |
| 2196 |
\qquad \text{for $i\ne j$;}\label{eq:B}\\ |
| 2197 |
V_j & = v_j, & \qquad X_j & = x_j, |
| 2198 |
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i. |
| 2199 |
\end{alignat} |
| 2200 |
\end{verbatim} |
| 2201 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2202 |
|
| 2203 |
Unnumbered version: |
| 2204 |
\begin{alignat*}3 |
| 2205 |
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j, |
| 2206 |
& \qquad U_i & = u_i, |
| 2207 |
\qquad \text{for $i\ne j$;} \\ |
| 2208 |
V_j & = v_j, & \qquad X_j & = x_j, |
| 2209 |
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i. |
| 2210 |
\end{alignat*} |
| 2211 |
Some text after to test the below-display spacing. |
| 2212 |
|
| 2213 |
\begin{verbatim} |
| 2214 |
\begin{alignat*}3 |
| 2215 |
V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j, |
| 2216 |
& \qquad U_i & = u_i, |
| 2217 |
\qquad \text{for $i\ne j$;} \\ |
| 2218 |
V_j & = v_j, & \qquad X_j & = x_j, |
| 2219 |
& \qquad U_j & u_j + \sum_{i\ne j} q_i u_i. |
| 2220 |
\end{alignat*} |
| 2221 |
\end{verbatim} |
| 2222 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2223 |
|
| 2224 |
\newpage |
| 2225 |
The most common use for \env{alignat} is for things like |
| 2226 |
\begin{alignat}{2} |
| 2227 |
x& =y && \qquad \text {by (\ref{eq:A})}\label{eq:C}\\ |
| 2228 |
x'& = y' && \qquad \text {by (\ref{eq:B})}\label{eq:D}\\ |
| 2229 |
x+x' & = y+y' && \qquad \text {by Axiom 1.} |
| 2230 |
\end{alignat} |
| 2231 |
Some text after to test the below-display spacing. |
| 2232 |
|
| 2233 |
\begin{verbatim} |
| 2234 |
\begin{alignat}{2} |
| 2235 |
x& =y && \qquad \text {by (\ref{eq:A})}\label{eq:C}\\ |
| 2236 |
x'& = y' && \qquad \text {by (\ref{eq:B})}\label{eq:D}\\ |
| 2237 |
x+x' & = y+y' && \qquad \text {by Axiom 1.} |
| 2238 |
\end{alignat} |
| 2239 |
\end{verbatim} |
| 2240 |
%%%%%%%%%%%%%%%%%%%%%%%%%%% |
| 2241 |
|
| 2242 |
\newpage |
| 2243 |
\setlength{\marginrulewidth}{0pt} |
| 2244 |
|
| 2245 |
\begin{thebibliography}{10} |
| 2246 |
|
| 2247 |
\bibitem{dihe:newdir} |
| 2248 |
W.~Diffie and E.~Hellman, \emph{New directions in cryptography}, IEEE |
| 2249 |
Transactions on Information Theory \textbf{22} (1976), no.~5, 644--654. |
| 2250 |
|
| 2251 |
\bibitem{fre:cichon} |
| 2252 |
D.~H. Fremlin, \emph{Cichon's diagram}, 1983/1984, presented at the |
| 2253 |
S{\'e}minaire Initiation {\`a} l'Analyse, G. Choquet, M. Rogalski, J. |
| 2254 |
Saint Raymond, at the Universit{\'e} Pierre et Marie Curie, Paris, 23e |
| 2255 |
ann{\'e}e. |
| 2256 |
|
| 2257 |
\bibitem{gouja:lagrmeth} |
| 2258 |
I.~P. Goulden and D.~M. Jackson, \emph{The enumeration of directed |
| 2259 |
closed {E}uler trails and directed {H}amiltonian circuits by |
| 2260 |
{L}angrangian methods}, European J. Combin. \textbf{2} (1981), 131--212. |
| 2261 |
|
| 2262 |
\bibitem{hapa:graphenum} |
| 2263 |
F.~Harary and E.~M. Palmer, \emph{Graphical enumeration}, Academic |
| 2264 |
Press, 1973. |
| 2265 |
|
| 2266 |
\bibitem{imlelu:oneway} |
| 2267 |
R.~Impagliazzo, L.~Levin, and M.~Luby, \emph{Pseudo-random generation |
| 2268 |
from one-way functions}, Proc. 21st STOC (1989), ACM, New York, |
| 2269 |
pp.~12--24. |
| 2270 |
|
| 2271 |
\bibitem{komiyo:unipfunc} |
| 2272 |
M.~Kojima, S.~Mizuno, and A.~Yoshise, \emph{A new continuation method |
| 2273 |
for complementarity problems with uniform p-functions}, Tech. Report |
| 2274 |
B-194, Tokyo Inst. of Technology, Tokyo, 1987, Dept. of Information |
| 2275 |
Sciences. |
| 2276 |
|
| 2277 |
\bibitem{komiyo:lincomp} |
| 2278 |
\bysame, \emph{A polynomial-time algorithm for a class of linear |
| 2279 |
complementarity problems}, Tech. Report B-193, Tokyo Inst. of |
| 2280 |
Technology, Tokyo, 1987, Dept. of Information Sciences. |
| 2281 |
|
| 2282 |
\bibitem{liuchow:formalsum} |
| 2283 |
C.~J. Liu and Yutze Chow, \emph{On operator and formal sum methods for |
| 2284 |
graph enumeration problems}, SIAM J. Algorithms Discrete Methods |
| 2285 |
\textbf{5} (1984), 384--438. |
| 2286 |
|
| 2287 |
\bibitem{mami:matrixth} |
| 2288 |
M.~Marcus and H.~Minc, \emph{A survey of matrix theory and matrix |
| 2289 |
inequalities}, Complementary Series in Math. \textbf{14} (1964), 21--48. |
| 2290 |
|
| 2291 |
\bibitem{miyoki:lincomp} |
| 2292 |
S.~Mizuno, A.~Yoshise, and T.~Kikuchi, \emph{Practical polynomial time |
| 2293 |
algorithms for linear complementarity problems}, Tech. Report~13, Tokyo |
| 2294 |
Inst. of Technology, Tokyo, April 1988, Dept. of Industrial Engineering |
| 2295 |
and Management. |
| 2296 |
|
| 2297 |
\bibitem{moad:quadpro} |
| 2298 |
R.~D. Monteiro and I.~Adler, \emph{Interior path following primal-dual |
| 2299 |
algorithms, part {II}: Quadratic programming}, August 1987, Working |
| 2300 |
paper, Dept. of Industrial Engineering and Operations Research. |
| 2301 |
|
| 2302 |
\bibitem{ste:sint} |
| 2303 |
E.~M. Stein, \emph{Singular integrals and differentiability properties |
| 2304 |
of functions}, Princeton Univ. Press, Princeton, N.J., 1970. |
| 2305 |
|
| 2306 |
\bibitem{ye:intalg} |
| 2307 |
Y.~Ye, \emph{Interior algorithms for linear, quadratic and linearly |
| 2308 |
constrained convex programming}, Ph.D. thesis, Stanford Univ., Palo |
| 2309 |
Alto, Calif., July 1987, Dept. of Engineering--Economic Systems, |
| 2310 |
unpublished. |
| 2311 |
|
| 2312 |
\end{thebibliography} |
| 2313 |
|
| 2314 |
\end{document} |
| 2315 |
\endinput |