Sample Paper for the amsmath Package File name: testmath.tex
Date: 2001-02-28 17:11:00

## Sample Paper for the amsmath Package
File name: testmath.tex

American Mathematical Society
Version 2.0, 1999/11/15

### 1 Introduction

This paper contains examples of various features from AM S-LATEX.

### 2 Enumeration of Hamiltonian paths in a graph

Let A = (a i j) be the adjacency matrix of graph G. The corresponding Kirchhoff matrix K = (k i j) is obtained from A by replacing in −A each diagonal entry by the degree of its corresponding vertex; i.e., the ith diagonal entry is identified with the degree of the ith vertex. It is well known that

det K(i∣i) = the number of spanning trees of G, i = 1, …, n | (1)

where K(i∣i) is the ith principal submatrix of K.

     \det\mathbf{K}(i|i)=\text{ the number of spanning trees of $G$},

Let C i(j) be the set of graphs obtained from G by attaching edge (v i v j) to each spanning tree of G. Denote by C i = ⋃ j C i(j). It is obvious that the collection of Hamiltonian cycles is a subset of C i. Note that the cardinality of C i is k i i det K(i∣i). Let X = {x̂1, …, x̂n}.

     $\wh X=\{\hat x_1,\dots,\hat x_n\}$

Define multiplication for the elements of X by

x̂i x̂j = x̂j x̂i, x̂i 2 = 0, i, j = 1, …, n. | (2)

Let k̂i j = k i j x̂j and k̂ i j = − ∑ j/=i k̂i j. Then the number of Hamiltonian cycles H c is given by the relation [8]

( ∏ j = 1 n x̂j) H c = 1 2 k̂i j det K(i∣i), i = 1, …, n. | (3)

The task here is to express (3) in a form free of any x̂ i, i = 1, …, n. The result also leads to the resolution of enumeration of Hamiltonian paths in a graph.

It is well known that the enumeration of Hamiltonian cycles and paths in a complete graph K n and in a complete bipartite graph K n 1 n 2 can only be found from first combinatorial principles [4]. One wonders if there exists a formula which can be used very efficiently to produce K n and K n 1 n 2. Recently, using Lagrangian methods, Goulden and Jackson have shown that H c can be expressed in terms of the determinant and permanent of the adjacency matrix [3]. However, the formula of Goulden and Jackson determines neither K n nor K n 1 n 2 effectively. In this paper, using an algebraic method, we parametrize the adjacency matrix. The resulting formula also involves the determinant and permanent, but it can easily be applied to K n and K n 1 n 2. In addition, we eliminate the permanent from H c and show that H c can be represented by a determinantal function of multivariables, each variable with domain {0, 1}. Furthermore, we show that H c can be written by number of spanning trees of subgraphs. Finally, we apply the formulas to a complete multigraph K n 1…n p.

The conditions a i j = a j i, i, j = 1, …, n, are not required in this paper. All formulas can be extended to a digraph simply by multiplying H c by 2.

### 3 Main Theorem

Notation. For p, q ∈ P and n ∈ ω we write (q, n) ≤ (p, n) if q ≤ p and A q, n = A p, n.

     \begin{notation} For $p,q\in P$ and $n\in\omega$
     ...
     \end{notation}

Let B = (b i j) be an n × n matrix. Let n = {1, …, n}. Using the properties of (2), it is readily seen that

Lemma 3.1.

∏ i∈n( ∑ j∈n b i j x̂i) =( ∏ i∈n x̂i) per B | (4)

where per B is the permanent of B.

Let Y = {ŷ 1, …, ŷ n}. Define multiplication for the elements of Y by

ŷ i ŷ j + ŷ j ŷ i = 0, i, j = 1, …, n. | (5)

Then, it follows that

Lemma 3.2.

∏ i∈n( ∑ j∈n b i j ŷ j) =( ∏ i∈n ŷ i) det B. | (6)

Note that all basic properties of determinants are direct consequences of Lemma 3.2. Write

∑ j∈n b i j ŷ j = ∑ j∈n b i j(λ)ŷ j + (b i i − λ i)ŷ i ŷ | (7)

where

b i i(λ) = λ i, b i j(λ) = b i j, i /= j. | (8)

Let B(λ) = (b i j(λ)). By (6) and (7), it is straightforward to show the following result:

Theorem 3.3.

det B = ∑ l = 0 n ∑ I l⊆n ∏ i∈I l(b i i − λ i) det B(λ)(I l∣I l), | (9)

where I l = {i 1, …, i l} and B(λ)(I l∣I l) is the principal submatrix obtained from B(λ) by deleting its i 1, …, i l rows and columns.

Remark 3.1. Let M be an n × n matrix. The convention M(n∣n) = 1 has been used in (9) and hereafter.

Before proceeding with our discussion, we pause to note that Theorem 3.3 yields immediately a fundamental formula which can be used to compute the coefficients of a characteristic polynomial [9]:

Corollary 3.4. Write det(B − x I) = ∑ l = 0 n(−1)l b l x l. Then

b l = ∑ I l⊆n det B(I l∣I l). | (10)

Let

K(t, t 1, …, t n) = D 1 t −a 1 2 t 2 … −a 1 n t n −a 2 1 t 1 D 2 t … −a 2 n t n . . . . . . . . . . . . . . . −a n 1 t 1−a n 2 t 2… D n t , | (11)

     \begin{pmatrix} D_1t&-a_{12}t_2&\dots&-a_{1n}t_n\\
     -a_{21}t_1&D_2t&\dots&-a_{2n}t_n\\
     \hdotsfor[2]{4}\\
     -a_{n1}t_1&-a_{n2}t_2&\dots&D_nt\end{pmatrix}

where

D i = ∑ j∈n a i j t j, i = 1, …, n. | (12)

Set

D(t 1, …, t n) = δ δ t det K(t, t 1, …, t n) t=1.

Then

D(t 1, …, t n) = ∑ i∈n D i det K(t = 1, t 1, …, t n; i∣i), | (13)

where K(t = 1, t 1, …, t n; i∣i) is the ith principal submatrix of K(t = 1, t 1, …, t n).

Theorem 3.3 leads to

det K(t 1, t 1, …, t n) = ∑ I∈n(−1)I t n− I ∏ i∈I t i ∏ j∈I(D j + λ j t j) det A(λ t)(I‾∣I‾). | (14)

Note that

det K(t = 1, t 1, …, t n) = ∑ I∈n(−1)I ∏ i∈I t i ∏ j∈I(D j + λ j t j) det A(λ)(I‾∣I‾) = 0. | (15)

Let t i = x̂i, i = 1, …, n. Lemma 3.1 yields

( ∑ i∈n a l i x i) det K(t = 1, x 1, …, x n; l∣l) =( ∏ i∈n x̂i) ∑ I⊆n−{l}(−1)I per A(λ)(I∣I) det A(λ)(I‾ ∪ {l}∣I‾ ∪ {l}).(1 6)

     \begin{multline}
     \biggl(\sum_{\,i\in\mathbf{n}}a_{l _i}x_i\biggr)
     \det\mathbf{K}(t=1,x_1,\dots,x_n;l |l )\\
     =\biggl(\prod_{\,i\in\mathbf{n}}\hat x_i\biggr)
     \sum_{I\subseteq\mathbf{n}-\{l \}}
     (-1)ˆ{\envert{I}}\per\mathbf{A}ˆ{(\lambda)}(I|I)
     \det\mathbf{A}ˆ{(\lambda)}
     (\overline I\cup\{l \}|\overline I\cup\{l \}).
     \label{sum-ali}
     \end{multline}

By (3), (6), and (7), we have

Proposition 3.5.

H c = 1 2 n ∑ l = 0 n(−1)l D l, | (17)

where

D l = ∑ I l⊆n D(t 1, …, t n)2∣ t i= 0, if i∈I l 1, otherwise , i=1,…,n. | (18)

### 4 Application

We consider here the applications of Theorems 5.1 and 5.2 to a complete multipartite graph K n 1…n p. It can be shown that the number of spanning trees of K n 1…n p may be written

T = n p−2 ∏ i = 1 p(n − n i)n i−1 | (19)

where

n = n 1 + ⋯ + n p. | (20)

It follows from Theorems 5.1 and 5.2 that

H c = 1 2 n ∑ l = 0 n(−1)l(n − l)p−2 ∑ l 1+⋯+l p=l ∏ i = 1 p n i l i · [(n − l) − (n i − l i)]n i−l i ·[ (n − l)2 − ∑ j = 1 p(n i − l i)2] . | (21)

     ... \binom{n_i}{l _i}\\

and

H c = 1 2 ∑ l = 0 n − 1(−1)l(n − l)p−2 ∑ l 1+⋯+l p=l ∏ i = 1 p n i l i · [(n − l) − (n i − l i)]n i−l i 1 − l p n p [(n − l) − (n p − l p)]. | (22)

The enumeration of H c in a K n 1⋯n p graph can also be carried out by Theorem 7.2 or 7.3 together with the algebraic method of (2). Some elegant representations may be obtained. For example, H c in a K n 1 n 2 n 3 graph may be written

H c = n 1! n 2! n 3! n 1 + n 2 + n 3 ∑ i n 1 i n 2 n 3 − n 1 + i n 3 n 3 − n 2 + i + n 1 − 1 i n 2 − 1 n 3 − n 1 + i n 3 − 1 n 3 − n 2 + i . | (23)

### 5 Secret Key Exchanges

Modern cryptography is fundamentally concerned with the problem of secure private communication. A Secret Key Exchange is a protocol where Alice and Bob, having no secret information in common to start, are able to agree on a common secret key, conversing over a public channel. The notion of a Secret Key Exchange protocol was first introduced in the seminal paper of Diffie and Hellman [1]. [1] presented a concrete implementation of a Secret Key Exchange protocol, dependent on a specific assumption (a variant on the discrete log), specially tailored to yield Secret Key Exchange. Secret Key Exchange is of course trivial if trapdoor permutations exist. However, there is no known implementation based on a weaker general assumption.

The concept of an informationally one-way function was introduced in [5]. We give only an informal definition here:

Definition 5.1. A polynomial time computable function f = {f k} is informationally one-way if there is no probabilistic polynomial time algorithm which (with probability of the form 1 − k−e for some e > 0) returns on input y ∈ {0, 1}k a random element of f−1(y).

In the non-uniform setting [5] show that these are not weaker than one-way functions:

Theorem 5.1 ([5] (non-uniform)). The existence of informationally one-way functions implies the existence of one-way functions.

We will stick to the convention introduced above of saying “non-uniform” before the theorem statement when the theorem makes use of non-uniformity. It should be understood that if nothing is said then the result holds for both the uniform and the non-uniform models.

It now follows from Theorem 5.1 that

Theorem 5.2 (non-uniform). Weak SKE implies the existence of a one-way function.

More recently, the polynomial-time, interior point algorithms for linear programming have been extended to the case of convex quadratic programs [11, 13], certain linear complementarity problems [7, 10], and the nonlinear complementarity problem [6]. The connection between these algorithms and the classical Newton method for nonlinear equations is well explained in [7].

### 6 Review

We begin our discussion with the following definition:

Definition 6.1.

A function H : ℜ n → ℜ n is said to be B-differentiable at the point z if (i) H is Lipschitz continuous in a neighborhood of z, and (ii) there exists a positive homogeneous function B H(z): ℜ n → ℜ n, called the B-derivative of H at z, such that lim v→0 H(z + v) − H(z) − B H(z)v v = 0. The function H is B-differentiable in set S if it is B-differentiable at every point in S. The B-derivative B H(z) is said to be strong if lim (v, v′)→(0, 0)H(z + v) − H(z + v′) − B H(z)(v − v′) v − v′ = 0.

Lemma 6.1. There exists a smooth function ψ 0(z) defined for z > 1 − 2 a satisfying the following properties:

1. ψ 0(z) is bounded above and below by positive constants c 1 ≤ ψ 0(z) ≤ c 2.
2. If z > 1, then ψ 0(z) = 1.
3. For all z in the domain of ψ 0, Δ 0 ln ψ 0 ≥ 0.
4. If 1 − 2 a < z < 1 − a, then Δ 0 ln ψ 0 ≥ c 3 > 0.

Proof. We choose ψ 0(z) to be a radial function depending only on r = z. Let h(r) ≥ 0 be a suitable smooth function satisfying h(r) ≥ c 3 for 1 − 2 a < z < 1 − a, and h(r) = 0 for z > 1 − a 2. The radial Laplacian Δ 0 ln ψ 0(r) = d 2 d r 2 + 1 r d d r ln ψ 0(r) has smooth coefficients for r > 1 − 2 a. Therefore, we may apply the existence and uniqueness theory for ordinary differential equations. Simply let ln ψ 0(r) be the solution of the differential equation d 2 d r 2 + 1 r d d r ln ψ 0(r) = h(r) with initial conditions given by ln ψ 0(1) = 0 and ln ψ 0′(1) = 0.

Next, let D ν be a finite collection of pairwise disjoint disks, all of which are contained in the unit disk centered at the origin in C. We assume that D ν = {z ∣ z − z ν < δ}. Suppose that D ν(a) denotes the smaller concentric disk D ν(a) = {z ∣ z − z ν ≤ (1 − 2 a)δ}. We define a smooth weight function Φ 0(z) for z ∈ C − ⋃ ν D ν(a) by setting Φ 0(z) = 1 when z∉ ⋃ ν D ν and Φ 0(z) = ψ 0((z − z ν)/δ) when z is an element of D ν. It follows from Lemma 6.1 that Φ 0 satisfies the properties:

1. Φ 0(z) is bounded above and below by positive constants c 1 ≤ Φ 0(z) ≤ c 2.
2. Δ 0 ln Φ 0 ≥ 0 for all z ∈ C − ⋃ ν D ν(a), the domain where the function Φ 0 is defined.
3. Δ 0 ln Φ 0 ≥ c 3 δ−2 when (1 − 2 a)δ < z − z ν < (1 − a)δ.

Let A ν denote the annulus A ν = {(1 − 2 a)δ < z − z ν < (1 − a)δ}, and set A = ⋃ ν A ν. The properties (2) and (3) of Φ 0 may be summarized as Δ 0 ln Φ 0 ≥ c 3 δ−2 χ A, where χ A is the characteristic function of A.

□

Suppose that α is a nonnegative real constant. We apply Proposition 3.5 with Φ(z) = Φ 0(z)e α z 2 . If u ∈ C 0∞(R 2 − ⋃ ν D ν(a)), assume that D is a bounded domain containing the support of u and A ⊂ D ⊂ R 2 − ⋃ ν D ν(a). A calculation gives ∫ D ∂‾u 2 Φ 0(z)e α z 2 ≥ c 4 α ∫ D u 2 Φ 0 e α z 2 + c 5 δ−2 ∫ A u 2 Φ 0 e α z 2 .

The boundedness, property (1) of Φ 0, then yields ∫ D ∂‾u 2 e α z 2 ≥ c 6 α ∫ D u 2 e α z 2 + c 7 δ−2 ∫ A u 2 e α z 2 .

Let B(X) be the set of blocks of Λ X and let b(X) = B(X). If φ ∈ Q X then φ is constant on the blocks of Λ X.

P X = {φ ∈ M ∣ Λ φ = Λ X}, Q X = {φ ∈ M ∣ Λ φ ≥ Λ X}. | (24)

If Λ φ ≥ Λ X then Λ φ = Λ Y for some Y ≥ X so that Q X = ⋃ Y ≥X P Y . Thus by Möbius inversion P Y = ∑ X≥Y μ(Y, X) Q X . Thus there is a bijection from Q X to W B(X). In particular Q X = w b(X).

Next note that b(X) = dim X. We see this by choosing a basis for X consisting of vectors v k defined by v i k = 1 if i ∈ Λ k, 0 otherwise.

     \[vˆ{k}_{i}=
     \begin{cases} 1 & \text{if $i \in \Lambda_{k}$},\\
     0 &\text{otherwise.} \end{cases}
     \]

Lemma 6.2. Let A be an arrangement. Then χ(A, t) = ∑ B⊆A(−1)B t dim T(B).

In order to compute R′′ recall the definition of S(X, Y ) from Lemma 3.1. Since H ∈ B, A H ⊆ B. Thus if T(B) = Y then B ∈ S(H, Y ). Let L′′ = L(A′′). Then

R′′ = ∑ H∈B⊆A(−1)B t dim T(B) = ∑ Y ∈L′′ ∑ B∈S(H, Y )(−1)B t dim Y = − ∑ Y ∈L′′ ∑ B∈S(H, Y )(−1)B−A H t dim Y = − ∑ Y ∈L′′ μ(H, Y )t dim Y = −χ(A′′, t). | (25)

Corollary 6.3. Let (A, A′, A′′) be a triple of arrangements. Then π(A, t) = π(A′, t) + t π(A′′, t).

Definition 6.2. Let (A, A′, A′′) be a triple with respect to the hyperplane H ∈ A. Call H a separator if T(A) /∈ L(A′).

Corollary 6.4. Let (A, A′, A′′) be a triple with respect to H ∈ A.

1. If H is a separator then μ(A) = −μ(A′′) and hence μ(A) = μ(A′′) .
2. If H is not a separator then μ(A) = μ(A′) − μ(A′′) and μ(A) = μ(A′) + μ(A′′) .

Proof. It follows from Theorem 5.1 that π(A, t) has leading term (−1)r(A)μ(A)t r(A). The conclusion follows by comparing coefficients of the leading terms on both sides of the equation in Corollary 6.3. If H is a separator then r(A′) < r(A) and there is no contribution from π(A′, t).
□

The Poincaré polynomial of an arrangement will appear repeatedly in these notes. It will be shown to equal the Poincaré polynomial of the graded algebras which we are going to associate with A. It is also the Poincaré polynomial of the complement M(A) for a complex arrangement. Here we prove that the Poincaré polynomial is the chamber counting function for a real arrangement. The complement M(A) is a disjoint union of chambers M(A) = ⋃ C∈Cham(A)C. The number of chambers is determined by the Poincaré polynomial as follows.

Theorem 6.5. Let A R be a real arrangement. Then Cham(A R) = π(A R, 1).

Proof. We check the properties required in Corollary 6.4: (i) follows from π(Φ l, t) = 1, and (ii) is a consequence of Corollary 3.4.
□

Figure 1: | Q(A 1) = x y z(x − z)(x + z)(y − z)(y + z)

Figure 2: | Q(A 2) = x y z(x + y + z)(x + y − z)(x − y + z)(x − y − z)

Theorem 6.6. Let φ be a protocol for a random pair (X, Y ). If one of σ φ(x′, y) and σ φ(x, y′) is a prefix of the other and (x, y) ∈ S X, Y , then 〈σ j(x′, y)〉j = 1∞ = 〈σ j(x, y)〉j = 1∞ = 〈σ j(x, y′)〉j = 1∞.

Proof. We show by induction on i that 〈σ j(x′, y)〉j = 1 i = 〈σ j(x, y)〉j = 1 i = 〈σ j(x, y′)〉j = 1 i. The induction hypothesis holds vacuously for i = 0. Assume it holds for i − 1, in particular [σ j(x′, y)]j = 1 i − 1 = [σ j(x, y′)]j = 1 i − 1. Then one of [σ j(x′, y)]j = i∞ and [σ j(x, y′)]j = i∞ is a prefix of the other which implies that one of σ i(x′, y) and σ i(x, y′) is a prefix of the other. If the ith message is transmitted by P X then, by the separate-transmissions property and the induction hypothesis, σ i(x, y) = σ i(x, y′), hence one of σ i(x, y) and σ i(x′, y) is a prefix of the other. By the implicit-termination property, neither σ i(x, y) nor σ i(x′, y) can be a proper prefix of the other, hence they must be the same and σ i(x′, y) = σ i(x, y) = σ i(x, y′). If the ith message is transmitted by P Y then, symmetrically, σ i(x, y) = σ i(x′, y) by the induction hypothesis and the separate-transmissions property, and, then, σ i(x, y) = σ i(x, y′) by the implicit-termination property, proving the induction step.
□

If φ is a protocol for (X, Y ), and (x, y), (x′, y) are distinct inputs in S X, Y , then, by the correct-decision property, 〈σ j(x, y)〉j = 1∞≠〈σ j(x′, y)〉j = 1∞.

Equation (25) defined P Y’s ambiguity set S X∣Y (y) to be the set of possible X values when Y = y. The last corollary implies that for all y ∈ S Y , the multiset1 of codewords {σ φ(x, y) : x ∈ S X∣Y (y)} is prefix free.

### 7 One-Way Complexity

Ĉ 1(X∣Y ), the one-way complexity of a random pair (X, Y ), is the number of bits P X must transmit in the worst case when P Y is not permitted to transmit any feedback messages. Starting with S X, Y , the support set of (X, Y ), we define G(X∣Y ), the characteristic hypergraph of (X, Y ), and show that Ĉ 1(X∣Y ) = ⌈ log χ(G(X∣Y ))⌉.

Let (X, Y ) be a random pair. For each y in S Y , the support set of Y , Equation (25) defined S X∣Y (y) to be the set of possible x values when Y = y. The characteristic hypergraph G(X∣Y ) of (X, Y ) has S X as its vertex set and the hyperedge S X∣Y (y) for each y ∈ S Y .

We can now prove a continuity theorem.

Theorem 7.1. Let Ω ⊂ R n be an open set, let u ∈ B V (Ω; R m), and let

T x u = y ∈ R m : y = ũ(x) + D u D u (x), z for some z ∈ R n | (26)

for every x ∈ Ω∖S u. Let f : R m → R k be a Lipschitz continuous function such that f(0) = 0, and let v = f(u): Ω → R k. Then v ∈ B V (Ω; R k) and

J v = (f(u+) − f(u−)) ⊗ ν u · H n−1 S u. | (27)

In addition, for D u-almost every x ∈ Ω the restriction of the function f to T x u is differentiable at ũ(x) and

D v = ∇(f T x u)(ũ) D u D u · D u . | (28)

Before proving the theorem, we state without proof three elementary remarks which will be useful in the sequel.

Remark 7.1. Let ω: 0, +∞ → 0, +∞ be a continuous function such that ω(t) → 0 as t → 0. Then lim h→0+g(ω(h)) = L ⇔ lim h→0+g(h) = L for any function g: 0, +∞ → R.

Remark 7.2. Let g: R n → R be a Lipschitz continuous function and assume that L(z) = lim h→0+ g(h z) − g(0) h exists for every z ∈ Q n and that L is a linear function of z. Then g is differentiable at 0.

Remark 7.3. Let A: R n → R m be a linear function, and let f : R m → R be a function. Then the restriction of f to the range of A is differentiable at 0 if and only if f(A): R n → R is differentiable at 0 and ∇(f Im(A))(0)A = ∇(f(A))(0).

Proof. We begin by showing that v ∈ B V (Ω; R k) and

D v (B) ≤ K D u (B)∀B ∈ B(Ω), | (29)

where K > 0 is the Lipschitz constant of f. By (13) and by the approximation result quoted in §3, it is possible to find a sequence (u h) ⊂ C 1(Ω; R m) converging to u in L 1(Ω; R m) and such that lim h→+∞ ∫ Ω ∇u h d x = D u (Ω). The functions v h = f(u h) are locally Lipschitz continuous in Ω, and the definition of differential implies that ∇v h ≤ K ∇u h almost everywhere in Ω. The lower semicontinuity of the total variation and (13) yield

D v (Ω) ≤ lim inf h→+∞ D v h (Ω) = lim inf h→+∞ ∫ Ω ∇v h d x ≤ K lim inf h→+∞ ∫ Ω ∇u h d x = K D u (Ω). | (30)

Since f(0) = 0, we have also ∫ Ω v d x ≤ K ∫ Ω u d x; therefore u ∈ B V (Ω; R k). Repeating the same argument for every open set A ⊂ Ω, we get (29) for every B ∈ B(Ω), because D v, D u are Radon measures. To prove Lemma 6.1, first we observe that

S v ⊂ S u, ṽ(x) = f(ũ(x))∀x ∈ Ω∖S u. | (31)

In fact, for every ɛ > 0 we have {y ∈ B ρ(x) : v(y) − f(ũ(x)) > ɛ} ⊂ {y ∈ B ρ(x) : u(y) − ũ(x) > ɛ/K}, hence lim ρ→0+ {y ∈ B ρ(x) : v(y) − f(ũ(x)) > ɛ} ρ n = 0 whenever x ∈ Ω∖S u. By a similar argument, if x ∈ S u is a point such that there exists a triplet (u+, u−, ν u) satisfying (14), (15), then (v+(x) − v−(x)) ⊗ ν v = (f(u+(x)) − f(u−(x))) ⊗ ν u if x ∈ S v and f(u−(x)) = f(u+(x)) if x ∈ S u∖S v. Hence, by (1.8) we get

J v(B) = ∫ B∩S v(v+ − v−) ⊗ ν v d H n−1 = ∫ B∩S v(f(u+) − f(u−)) ⊗ ν u d H n−1 = ∫ B∩S u(f(u+) − f(u−)) ⊗ ν u d H n−1

and Lemma 6.1 is proved.
□

To prove (31), it is not restrictive to assume that k = 1. Moreover, to simplify our notation, from now on we shall assume that Ω = R n. The proof of (31) is divided into two steps. In the first step we prove the statement in the one-dimensional case (n = 1), using Theorem 5.2. In the second step we achieve the general result using Theorem 7.1.

#### Step 1

Assume that n = 1. Since S u is at most countable, (7) yields that D v (S u∖S v) = 0, so that (19) and (21) imply that D v = D v + J v is the Radon-Nikodým decomposition of D v in absolutely continuous and singular part with respect to D u. By Theorem 5.2, we have

D v D u (t) = lim s→t+ D v( t, s ) D u ( t, s ), D u D u (t) = lim s→t+ D u( t, s ) D u ( t, s )

D u-almost everywhere in R. It is well known (see, for instance, [12, 2.5.16]) that every one-dimensional function of bounded variation w has a unique left continuous representative, i.e., a function ŵ such that ŵ = w almost everywhere and lim s→t−ŵ(s) = ŵ(t) for every t ∈ R. These conditions imply

û(t) = D u( −∞, t ), v̂(t) = D v( −∞, t )∀t ∈ R | (32)

and

v̂(t) = f(û(t))∀t ∈ R. | (33)

Let t ∈ R be such that D u ( t, s ) > 0 for every s > t and assume that the limits in (22) exist. By (23) and (24) we get

v̂(s) − v̂(t) D u ( t, s ) = f(û(s)) − f(û(t)) D u ( t, s ) = f(û(s)) − f(û(t) + D u D u(t) D u ( t, s )) D u ( t, s ) + f(û(t) + D u D u(t) D u ( t, s )) − f(û(t)) D u ( t, s )

for every s > t. Using the Lipschitz condition on f we find v̂(s) − v̂(t) D u ( t, s ) − f(û(t) + D u D u(t) D u ( t, s )) − f(û(t)) D u ( t, s ) ≤ K û(s) − û(t) D u ( t, s ) − D u D u (t) .

By (29), the function s → D u ( t, s ) is continuous and converges to 0 as s ↓ t. Therefore Remark 7.1 and the previous inequality imply D v D u (t) = lim h→0+ f(û(t) + h D u D u(t)) − f(û(t)) h D u -a.e. in R. By (22), û(x) = ũ(x) for every x ∈ R∖S u; moreover, applying the same argument to the functions u′(t) = u(−t), v′(t) = f(u′(t)) = v(−t), we get D v D u (t) = lim h→0 f(ũ(t) + h D u D u(t)) − f(ũ(t)) h D u -a.e. in R and our statement is proved.

#### Step 2

Let us consider now the general case n > 1. Let ν ∈ R n be such that ν = 1, and let π ν = {y ∈ R n : 〈y, ν〉 = 0}. In the following, we shall identify R n with π ν × R, and we shall denote by y the variable ranging in π ν and by t the variable ranging in R. By the just proven one-dimensional result, and by Theorem 3.3, we get lim h→0 f(ũ(y + t ν) + h D u y D u y (t)) − f(ũ(y + t ν)) h = D v y D u y (t) D u y -a.e. in R for H n−1-almost every y ∈ π ν. We claim that

〈D u, ν〉 〈D u, ν〉 (y + t ν) = D u y D u y (t) D u y -a.e. in R | (34)

for H n−1-almost every y ∈ π ν. In fact, by (16) and (18) we get ∫ π ν D u y D u y · D u y d H n−1(y) = ∫ π ν D u y d H n−1(y) = 〈D u, ν〉 = 〈D u, ν〉 〈D u, ν〉 · 〈D u, ν〉 = ∫ π ν 〈D u, ν〉 〈D u, ν〉 (y + ·ν) · D u y d H n−1(y)

and (24) follows from (13). By the same argument it is possible to prove that

〈D v, ν〉 〈D u, ν〉 (y + t ν) = D v y D u y (t) D u y -a.e. in R | (35)

for H n−1-almost every y ∈ π ν. By (24) and (25) we get lim h→0 f(ũ(y + t ν) + h〈D u, ν〉〈D u, ν〉(y + t ν)) − f(ũ(y + t ν)) h = 〈D v, ν〉 〈D u, ν〉 (y+t ν) for H n−1-almost every y ∈ π ν, and using again (14), (15) we get lim h→0 f(ũ(x) + h〈D u, ν〉〈D u, ν〉(x)) − f(ũ(x)) h = 〈D v, ν〉 〈D u, ν〉 (x) 〈D u, ν〉-a.e. in R n.

Since the function 〈D u, ν〉 / D u is strictly positive 〈D u, ν〉-almost everywhere, we obtain also

lim h→0 f(ũ(x) + h〈D u, ν〉D u(x)〈D u, ν〉〈D u, ν〉(x)) − f(ũ(x)) h = 〈D u, ν〉 D u (x) 〈D v, ν〉 〈D u, ν〉 (x)

〈D u, ν〉-almost everywhere in R n.

Finally, since

〈D u, ν〉 D u 〈D u, ν〉 〈D u, ν〉 = 〈D u, ν〉 D u = D u D u , ν D u -a.e. in R n 〈D u, ν〉 D u 〈D v, ν〉 〈D u, ν〉 = 〈D v, ν〉 D u = D v D u , ν D u -a.e. in R n and since both sides of (33) are zero D u-almost everywhere on 〈D u, ν〉-negligible sets, we conclude that lim h→0 f ũ(x) + h D u D u(x), ν − f(ũ(x)) h = D v D u (x), ν , D u-a.e. in R n. Since ν is arbitrary, by Remarks 7.2 and 7.3 the restriction of f to the affine space T x u is differentiable at ũ(x) for D u-almost every x ∈ R n and (26) holds. □ It follows from (13), (14), and (15) that

D(t 1, …, t n) = ∑ I∈n(−1)I −1 I ∏ i∈I t i ∏ j∈I(D j + λ j t j) det A(λ)(I‾∣I‾). | (36)

Let t i = x̂i, i = 1, …, n. Lemma 1 leads to

D(x̂1, …, x̂n) = ∏ i∈n x̂i ∑ I∈n(−1)I −1 I per A(λ)(I∣I) det A(λ)(I‾∣I‾). | (37)

By (3), (13), and (37), we have the following result:

Theorem 7.2.

H c = 1 2 n ∑ l = 1 n l(−1)l−1 A l(λ), | (38)

where

A l(λ) = ∑ I l⊆n per A(λ)(I l∣I l) det A(λ)(I‾ l∣I‾l), I l = l. | (39)

It is worth noting that A l(λ) of (39) is similar to the coefficients b l of the characteristic polynomial of (10). It is well known in graph theory that the coefficients b l can be expressed as a sum over certain subgraphs. It is interesting to see whether A l, λ = 0, structural properties of a graph.

We may call (38) a parametric representation of H c. In computation, the parameter λ i plays very important roles. The choice of the parameter usually depends on the properties of the given graph. For a complete graph K n, let λ i = 1, i = 1, …, n. It follows from (39) that

A l(1) = n!,if l = 1 0, otherwise. | (40)

By (38)

H c = 1 2(n − 1)!. | (41)

For a complete bipartite graph K n 1 n 2, let λ i = 0, i = 1, …, n. By (39),

A l = −n 1! n 2! δ n 1 n 2, if l = 2 0, otherwise . | (42)

Theorem 7.2 leads to

H c = 1 n 1 + n 2 n 1! n 2! δ n 1 n 2. | (43)

Now, we consider an asymmetrical approach. Theorem 3.3 leads to

det K(t = 1, t 1, …, t n; l∣l) = ∑ I⊆n−{l}(−1)I ∏ i∈I t i ∏ j∈I(D j + λ j t j) det A(λ)(I‾ ∪ {l}∣I‾ ∪ {l}).(4 4)

By (3) and (16) we have the following asymmetrical result:

Theorem 7.3.

H c = 1 2 ∑ I⊆n−{l}(−1)I per A(λ)(I∣I) det A(λ)(I‾ ∪ {l}∣I‾ ∪ {l}) | (45)

which reduces to Goulden Jackson’s formula when λ i = 0, i = 1, …, n [9].

### 8 Various font features of the amsmath package

#### 8.1 Bold versions of special symbols

In the amsmath package \boldsymbol is used for getting individual bold math symbols and bold Greek letters everything in math except for letters of the Latin alphabet, where you’d use \mathbf. For example,

     A_\infty + \pi A_0 \sim
     \mathbf{A}_{\boldsymbol{\infty}} \boldsymbol{+}
     \boldsymbol{\pi} \mathbf{A}_{\boldsymbol{0}}

looks like this: A∞ + π A 0 ∼ A∞ + π A 0

#### 8.2 “Poor man’s bold”

If a bold version of a particular symbol doesn’t exist in the available fonts, then \boldsymbol can’t be used to make that symbol bold. At the present time, this means that \boldsymbol can’t be used with symbols from the msam and msbm fonts, among others. In some cases, poor man’s bold (\pmb) can be used instead of \boldsymbol: ∂x ∂y∂y ∂z

     \[\frac{\partial x}{\partial y}
     \pmb{\bigg\vert}
     \frac{\partial y}{\partial z}\]

So-called “large operator” symbols such as ∑ and ∏ require an additional command, \mathop, to produce proper spacing and limits when \pmb is used. For further details see The TEXbook. ∑ i<B i odd ∏ κ κ F(r i)∑ ∑ ∑ i<B i odd ∏ ∏ ∏ κ κ(r i)

     \[\sum_{\substack{i<B\\\text{$i$ odd}}}
     \prod_\kappa \kappa F(r_i)\qquad
     \mathop{\pmb{\sum}}_{\substack{i<B\\\text{$i$ odd}}}
     \mathop{\pmb{\prod}}_\kappa \kappa(r_i)
     \]

### 9 Compound symbols and other features

#### 9.1 Multiple integral signs

\iint, \iiint, and \iiiint give multiple integral signs with the spacing between them nicely adjusted, in both text and display style. \idotsint gives two integral signs with dots between them.

∬ A f(x, y) d x d y ∭ A f(x, y, z) d x d y d z (4 6) ∬ ∬ A f(w, x, y, z) d w d x d y d z ∫ · · · ∫ A f(x 1, …, x k) (4 7)

#### 9.2 Over and under arrows

Some extra over and under arrow operations are provided in the amsmath package. (Basic LATEX provides \overrightarrow and \overleftarrow).

→ ψ δ(t)E t h = → ← ψ δ(t)E t h = ← ↔ ψ δ(t)E t h = ↔

     \begin{align*}
     \overrightarrow{\psi_\delta(t) E_t h}&
     =\underrightarrow{\psi_\delta(t) E_t h}\\
     \overleftarrow{\psi_\delta(t) E_t h}&
     =\underleftarrow{\psi_\delta(t) E_t h}\\
     \overleftrightarrow{\psi_\delta(t) E_t h}&
     =\underleftrightarrow{\psi_\delta(t) E_t h}
     \end{align*}

These all scale properly in subscript sizes: ∫ →A B a x d x

     \[\int_{\overrightarrow{AB}} ax\,dx\]

#### 9.3 Dots

Normally you need only type \dots for ellipsis dots in a math formula. The main exception is when the dots fall at the end of the formula; then you need to specify one of \dotsc (series dots, after a comma), \dotsb (binary dots, for binary relations or operators), \dotsm (multiplication dots), or \dotsi (dots after an integral). For example, the input

     Then we have the series $A_1,A_2,\dotsc$,
     the regional sum $A_1+A_2+\dotsb$,
     the orthogonal product $A_1A_2\dotsm$,
     and the infinite integral
     \[\int_{A_1}\int_{A_2}\dotsi\].

produces

Then we have the series A 1, A 2, …, the regional sum A 1 + A 2 + ⋯, the orthogonal product A 1 A 2⋯, and the infinite integral ∫ A 1 ∫ A 2 ⋯

#### 9.4 Accents in math

Double accents: Ĥ̂Č̌T̃̃Á́G̀̀Ḋ. D̈̈B˘˘B̄̄V →→

     \[\Hat{\Hat{H}}\quad\Check{\Check{C}}\quad
     \Tilde{\Tilde{T}}\quad\Acute{\Acute{A}}\quad
     \Grave{\Grave{G}}\quad\Dot{\Dot{D}}\quad
     \Ddot{\Ddot{D}}\quad\Breve{\Breve{B}}\quad
     \Bar{\Bar{B}}\quad\Vec{\Vec{V}}\]

This double accent operation is complicated and tends to slow down the processing of a LATEX file.

#### 9.5 Dot accents

\dddot and \ddddot are available to produce triple and quadruple dot accents in addition to the \dot and \ddot accents already available in LATEX: Q...R....

     \[\dddot{Q}\qquad\ddddot{R}\]

#### 9.6 Roots

In the amsmath package \leftroot and \uproot allow you to adjust the position of the root index of a radical:

     \sqrt[\leftroot{-2}\uproot{2}\beta]{k}

gives good positioning of the β: β k

#### 9.7 Boxed formulas

The command \boxed puts a box around its argument, like \fbox except that the contents are in math mode:

     \boxed{W_t-F\subseteq V(P_i)\subseteq W_t}

W t − F ⊆ V (P i) ⊆ W t .

#### 9.8 Extensible arrows

\xleftarrow and \xrightarrow produce arrows that extend automatically to accommodate unusually wide subscripts or superscripts. The text of the subscript or superscript are given as an optional resp. mandatory argument: Example: 0 ζ ← α F × △[n − 1] → ∂0 α(b)E∂0 b

     \[0 \xleftarrow[\zeta]{\alpha} F\times\triangle[n-1]
       \xrightarrow{\partial_0\alpha(b)} Eˆ{\partial_0b}\]

#### 9.9 \overset, \underset, and \sideset

Examples: ∗ X ∗ X a b X

     \[\overset{*}{X}\qquad\underset{*}{X}\qquad
     \overset{a}{\underset{b}{X}}\]

The command \sideset is for a rather special purpose: putting symbols at the subscript and superscript corners of a large operator symbol such as ∑ or ∏ , without affecting the placement of limits. Examples: ∗ ∗ ∏ ∗ ∗ k∑ ′ 0≤i≤m E i β x

     \[\sideset{_*ˆ*}{_*ˆ*}\prod_k\qquad
     \sideset{}{’}\sum_{0\le i\le m} E_i\beta x
     \]

#### 9.10 The \text command

The main use of the command \text is for words or phrases in a display: y = y′if and only if y′ k = δ k y τ(k)

     \[\mathbf{y}=\mathbf{y}’\quad\text{if and only if}\quad
     y’_k=\delta_k y_{\tau(k)}\]

#### 9.11 Operator names

The more common math functions such as log, sin, and lim have predefined control sequences: \log, \sin, \lim. The amsmath package provides \DeclareMathOperator and \DeclareMathOperator* for producing new function names that will have the same typographical treatment. Examples: f ∞ = ess sup x∈R n f(x)

     \[\norm{f}_\infty=
     \esssup_{x\in Rˆn}\abs{f(x)}\]

meas 1{u ∈ R + 1: f∗(u) > α} = meas n{x ∈ R n: f(x) ≥ α}∀α > 0.

     \[\meas_1\{u\in R_+ˆ1\colon fˆ*(u)>\alpha\}
     =\meas_n\{x\in Rˆn\colon \abs{f(x)}\geq\alpha\}
     \quad \forall\alpha>0.\]

\esssup and \meas would be defined in the document preamble as

     \DeclareMathOperator*{\esssup}{ess\,sup}
     \DeclareMathOperator{\meas}{meas}

The following special operator names are predefined in the amsmath package: \varlimsup, \varliminf, \varinjlim, and \varprojlim. Here’s what they look like in use:

lim‾n→∞Q(u n, u n − u#) ≤ 0 (4 8) ‾lim n→∞ a n+1 / a n = 0 (4 9) → (m i λ·)∗ ≤ 0 (5 0) ← p∈S(A)A p ≤ 0 (5 1)

     \begin{align}
     &\varlimsup_{n\rightarrow\infty}
            \mathcal{Q}(u_n,u_n-uˆ{\#})\le0\\
     &\varliminf_{n\rightarrow\infty}
       \left\lvert a_{n+1}\right\rvert/\left\lvert a_n\right\rvert=0\\
     &\varinjlim (m_iˆ\lambda\cdot)ˆ*\le0\\
     &\varprojlim_{p\in S(A)}A_p\le0
     \end{align}

#### 9.12 \mod and its relatives

The commands \mod and \pod are variants of \pmod preferred by some authors; \mod omits the parentheses, whereas \pod omits the ‘mod’ and retains the parentheses. Examples: x ≡ y + 1 (m o d m 2) (5 2) x ≡ y + 1 m o d m 2 (5 3) x ≡ y + 1 (m 2) (5 4)

     \begin{align}
     x&\equiv y+1\pmod{mˆ2}\\
     x&\equiv y+1\mod{mˆ2}\\
     x&\equiv y+1\pod{mˆ2}
     \end{align}

#### 9.13 Fractions and related constructions

The usual notation for binomials is similar to the fraction concept, so it has a similar command \binom with two arguments. Example:

∑ γ∈Γ C I γ = 2 k − k 1 2 k−1 + k 2 2 k−2 + ⋯ + (−1)l k l 2 k−l + ⋯ + (−1)k = (2 − 1)k = 1 | (55)

     \begin{equation}
     \begin{split}
     [\sum_{\gamma\in\Gamma_C} I_\gamma&
     =2ˆk-\binom{k}{1}2ˆ{k-1}+\binom{k}{2}2ˆ{k-2}\\
     &\quad+\dots+(-1)ˆl\binom{k}{l}2ˆ{k-l}
     +\dots+(-1)ˆk\\
     &=(2-1)ˆk=1
     \end{split}
     \end{equation}

There are also abbreviations

     \dfrac        \dbinom
     \tfrac        \tbinom

for the commonly needed constructions

     {\displaystyle\frac ... }   {\displaystyle\binom ... }
     {\textstyle\frac ... }      {\textstyle\binom ... }

The generalized fraction command \genfrac provides full access to the six TEX fraction primitives:

\over: n + 1 2 \overwithdelims: n + 1 2 (5 6) \atop: n + 1 2 \atopwithdelims: n + 1 2 (5 7) \above: n + 1 2 \abovewithdelims: n + 1 2 (5 8)

     \text{\cn{over}: }&\genfrac{}{}{}{}{n+1}{2}&
     \text{\cn{overwithdelims}: }&
       \genfrac{\langle}{\rangle}{}{}{n+1}{2}\\
     \text{\cn{atop}: }&\genfrac{}{}{0pt}{}{n+1}{2}&
     \text{\cn{atopwithdelims}: }&
       \genfrac{(}{)}{0pt}{}{n+1}{2}\\
     \text{\cn{above}: }&\genfrac{}{}{1pt}{}{n+1}{2}&
     \text{\cn{abovewithdelims}: }&
       \genfrac{[}{]}{1pt}{}{n+1}{2}

#### 9.14 Continued fractions

The continued fraction

1 2 + 1 2 + 1 2 + 1 2 + 1 2 + ⋯ | (59)

can be obtained by typing

     \cfrac{1}{\sqrt{2}+
      \cfrac{1}{\sqrt{2}+
       \cfrac{1}{\sqrt{2}+
        \cfrac{1}{\sqrt{2}+
         \cfrac{1}{\sqrt{2}+\dotsb
     }}}}}

Left or right placement of any of the numerators is accomplished by using \cfrac[l] or \cfrac[r] instead of \cfrac.

#### 9.15 Smash

In amsmath there are optional arguments t and b for the plain TEX command \smash, because sometimes it is advantageous to be able to ‘smash’ only the top or only the bottom of something while retaining the natural depth or height. In the formula X j = (1/λ j)X j′ \smash[b] has been used to limit the size of the radical symbol.

     $X_j=(1/\sqrt{\smash[b]{\lambda_j}})X_j’$

Without the use of \smash[b] the formula would have appeared thus: X j = (1/λ j)X j′, with the radical extending to encompass the depth of the subscript j.

#### 9.16 The ‘cases’ environment

‘Cases’ constructions like the following can be produced using the cases environment.

P r−j = 0 if r − j is odd, r! (−1)(r−j)/2 if r − j is even. | (60)

     \begin{equation} P_{r-j}=
       \begin{cases}
         0&  \text{if $r-j$ is odd},\\
         r!\,(-1)ˆ{(r-j)/2}&  \text{if $r-j$ is even}.
       \end{cases}
     \end{equation}

Notice the use of \text and the embedded math.

#### 9.17 Matrix

Here are samples of the matrix environments, \matrix, \pmatrix, \bmatrix, \Bmatrix, \vmatrix and \Vmatrix:

ϑ ϱ ϕ ϖ ϑ ϱ ϕ ϖ ϑ ϱ ϕ ϖ ϑ ϱ ϕ ϖ ϑ ϱ ϕ ϖ ϑ ϱ ϕ ϖ | (61)

     \begin{matrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{matrix}\quad
     \begin{pmatrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{pmatrix}\quad
     \begin{bmatrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{bmatrix}\quad
     \begin{Bmatrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{Bmatrix}\quad
     \begin{vmatrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{vmatrix}\quad
     \begin{Vmatrix}
     \vartheta& \varrho\\\varphi& \varpi
     \end{Vmatrix}

To produce a small matrix suitable for use in text, use the smallmatrix environment.

     \begin{math}
       \bigl( \begin{smallmatrix}
           a&b\\ c&d
         \end{smallmatrix} \bigr)
     \end{math}

To show the effect of the matrix on the surrounding lines of a paragraph, we put it here: ( a b c d ) and follow it with enough text to ensure that there will be at least one full line below the matrix.

\hdotsfor{number} produces a row of dots in a matrix spanning the given number of columns: W(Φ) = ϕ(ϕ 1, ɛ 1) 0 … 0 ϕ k n 2(ϕ 2, ɛ 1) ϕ(ϕ 2, ɛ 2) … 0 . ................................................... ϕ k n 1(ϕ n, ɛ 1)ϕ k n 2(ϕ n, ɛ 2)… ϕ k n n−1(ϕ n, ɛ n−1)ϕ(ϕ n, ɛ n)

     \[W(\Phi)= \begin{Vmatrix}
     \dfrac\varphi{(\varphi_1,\varepsilon_1)}&0&\dots&0\\
     \dfrac{\varphi k_{n2}}{(\varphi_2,\varepsilon_1)}&
     \dfrac\varphi{(\varphi_2,\varepsilon_2)}&\dots&0\\
     \hdotsfor{5}\\
     \dfrac{\varphi k_{n1}}{(\varphi_n,\varepsilon_1)}&
     \dfrac{\varphi k_{n2}}{(\varphi_n,\varepsilon_2)}&\dots&
     \dfrac{\varphi k_{n\,n-1}}{(\varphi_n,\varepsilon_{n-1})}&
     \dfrac{\varphi}{(\varphi_n,\varepsilon_n)}
     \end{Vmatrix}\]

The spacing of the dots can be varied through use of a square-bracket option, for example, \hdotsfor[1.5]{3}. The number in square brackets will be used as a multiplier; the normal value is 1.

#### 9.18 The \substack command

The \substack command can be used to produce a multiline subscript or superscript: for example

     \sum_{\substack{0\le i\le m\\ 0<j<n}} P(i,j)

produces a two-line subscript underneath the sum:

∑ 0≤i≤m 0<j<n P(i, j) | (62)

A slightly more generalized form is the subarray environment which allows you to specify that each line should be left-aligned instead of centered, as here:

∑ 0≤i≤m 0<j<n P(i, j) | (63)

     \sum_{\begin{subarray}{l}
             0\le i\le m\\ 0<j<n
           \end{subarray}}
      P(i,j)

#### 9.19 Big-g-g delimiters

Here are some big delimiters, first in \normalsize: ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s)

     \[\biggl(\mathbf{E}_{y}
       \int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}\varphi(x)\,ds
       \biggr)
     \]

and now in \Large size: ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s)

     {\Large
     \[\biggl(\mathbf{E}_{y}
       \int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}\varphi(x)\,ds
       \biggr)
     \]}

### A Examples of multiple-line equation structures

Note: Starting on this page, vertical rules are added at the margins so that the positioning of various display elements with respect to the margins can be seen more clearly.

#### A.1 Split

The split environment is not an independent environment but should be used inside something else such as equation or align.

If there is not enough room for it, the equation number for a split will be shifted to the previous line, when equation numbers are on the left; the number shifts down to the next line when numbers are on the right.

f h, ɛ(x, y) = ɛ E x, y ∫ 0 t ɛ L x, y ɛ(ɛ u)ϕ(x) d u = h ∫ L x, z ϕ(x)ρ x(d z) + h[ 1 t ɛ ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s − t ɛ ∫ L x, z ϕ(x)ρ x(d z)) + 1 t ɛ ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s − E x, y ∫ 0 t ɛ L x, y ɛ(ɛ s)ϕ(x) d s) ] = h L x ϕ(x) + h θ ɛ(x, y), | (64)

Some text after to test the below-display spacing.

     \begin{equation}
     \begin{split}
     f_{h,\varepsilon}(x,y)
     &=\varepsilon\mathbf{E}_{x,y}\int_0ˆ{t_\varepsilon}
     L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\
     &= h\int L_{x,z}\varphi(x)\rho_x(dz)\\
     &\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y}
       \int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}\varphi(x)\,ds
       -t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\
     &\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon}
       \biggl(\mathbf{E}_{y}\int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}
         \varphi(x)\,ds -\mathbf{E}_{x,y}\int_0ˆ{t_\varepsilon}
        L_{x,y_\varepsilon(\varepsilon s)}
        \varphi(x)\,ds\biggr)\biggr]\\
     &=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y),
     \end{split}
     \end{equation}

Unnumbered version:

f h, ɛ(x, y) = ɛ E x, y ∫ 0 t ɛ L x, y ɛ(ɛ u)ϕ(x) d u = h ∫ L x, z ϕ(x)ρ x(d z) + h[ 1 t ɛ ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s − t ɛ ∫ L x, z ϕ(x)ρ x(d z)) + 1 t ɛ ( E y ∫ 0 t ɛ L x, y x(s)ϕ(x) d s − E x, y ∫ 0 t ɛ L x, y ɛ(ɛ s)ϕ(x) d s) ] = h L x ϕ(x) + h θ ɛ(x, y),

Some text after to test the below-display spacing.

     \begin{equation*}
     \begin{split}
     f_{h,\varepsilon}(x,y)
     &=\varepsilon\mathbf{E}_{x,y}\int_0ˆ{t_\varepsilon}
     L_{x,y_\varepsilon(\varepsilon u)}\varphi(x)\,du\\
     &= h\int L_{x,z}\varphi(x)\rho_x(dz)\\
     &\quad+h\biggl[\frac{1}{t_\varepsilon}\biggl(\mathbf{E}_{y}
       \int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}\varphi(x)\,ds
       -t_\varepsilon\int L_{x,z}\varphi(x)\rho_x(dz)\biggr)\\
     &\phantom{{=}+h\biggl[}+\frac{1}{t_\varepsilon}
       \biggl(\mathbf{E}_{y}\int_0ˆ{t_\varepsilon}L_{x,yˆx(s)}
         \varphi(x)\,ds -\mathbf{E}_{x,y}\int_0ˆ{t_\varepsilon}
        L_{x,y_\varepsilon(\varepsilon s)}
        \varphi(x)\,ds\biggr)\biggr]\\
     &=h\wh{L}_x\varphi(x)+h\theta_\varepsilon(x,y),
     \end{split}
     \end{equation*}

If the option centertags is included in the options list of the amsmath package, the equation numbers for split environments will be centered vertically on the height of the split:

I 2 = ∫ 0 T ψ(t) u(a, t) − ∫ γ(t)a d θ k(θ, t) ∫ a θ c(ξ)u t(ξ, t) d ξ d t ≤ C 6 f ∫ Ω S a, − − 1, 0 W 2(Ω, Γ l) u ◦ → W 2 A(Ω; Γ r, T) . | (65)

Some text after to test the below-display spacing.

Use of split within align:

I 1 = ∫ Ω g R u d Ω ≤ C 3 ∫ Ω ∫ a x g(ξ, t) d ξ 2 d Ω 1/2 × ∫ Ω u x 2 + 1 k ∫ a x c u t d ξ 2 c Ω 1/2 ≤ C 4 f S a, − − 1, 0 W 2(Ω, Γ l) u ◦ → W 2 A(Ω; Γ r, T) . (6 6) I 2 = ∫ 0 T ψ(t) u(a, t) − ∫ γ(t)a d θ k(θ, t) ∫ a θ c(ξ)u t(ξ, t) d ξ d t ≤ C 6 f ∫ Ω S a, − − 1, 0 W 2(Ω, Γ l) u ◦ → W 2 A(Ω; Γ r, T) . (6 7) Some text after to test the below-display spacing.

     \begin{align}
     \begin{split}\abs{I_1}
       &=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\
     &\le C_3\left[\int_\Omega\left(\int_{a}ˆx
       g(\xi,t)\,d\xi\right)ˆ2d\Omega\right]ˆ{1/2}\\
     &\quad\times \left[\int_\Omega\left\{uˆ2_x+\frac{1}{k}
       \left(\int_{a}ˆx cu_t\,d\xi\right)ˆ2\right\}
       c\Omega\right]ˆ{1/2}\\
     &\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}ˆ{-1,0}_{a,-}
       W_2(\Omega,\Gamma_l)\right\rvert\right\rvert
       \left\lvert \abs{u}\overset{\circ}\to W_2ˆ{\wt{A}}
       (\Omega;\Gamma_r,T)\right\rvert\right\rvert.
     \end{split}\label{eq:A}\\
     \begin{split}\abs{I_2}&=\left\lvert \int_{0}ˆT \psi(t)\left\{u(a,t)
       -\int_{\gamma(t)}ˆa\frac{d\theta}{k(\theta,t)}
       \int_{a}ˆ\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\
     &\le C_6\left\lvert \left\lvert f\int_\Omega
       \left\lvert \wt{S}ˆ{-1,0}_{a,-}
       W_2(\Omega,\Gamma_l)\right\rvert\right\rvert
       \left\lvert \abs{u}\overset{\circ}\to W_2ˆ{\wt{A}}
       (\Omega;\Gamma_r,T)\right\rvert\right\rvert.
     \end{split}
     \end{align}

Unnumbered align, with a number on the second split:

I 1 = ∫ Ω g R u d Ω ≤ C 3 ∫ Ω ∫ a x g(ξ, t) d ξ 2 d Ω 1/2 × ∫ Ω u x 2 + 1 k ∫ a x c u t d ξ 2 c Ω 1/2 ≤ C 4 f S a, − − 1, 0 W 2(Ω, Γ l) u ◦ → W 2 A(Ω; Γ r, T) . I 2 = ∫ 0 T ψ(t) u(a, t) − ∫ γ(t)a d θ k(θ, t) ∫ a θ c(ξ)u t(ξ, t) d ξ d t ≤ C 6 f ∫ Ω S a, − − 1, 0 W 2(Ω, Γ l) u ◦ → W 2 A(Ω; Γ r, T) . (6 7′) Some text after to test the below-display spacing.

     \begin{align*}
     \begin{split}\abs{I_1}&=\left\lvert \int_\Omega gRu\,d\Omega\right\rvert\\
       &\le C_3\left[\int_\Omega\left(\int_{a}ˆx
       g(\xi,t)\,d\xi\right)ˆ2d\Omega\right]ˆ{1/2}\\
     &\phantom{=}\times \left[\int_\Omega\left\{uˆ2_x+\frac{1}{k}
       \left(\int_{a}ˆx cu_t\,d\xi\right)ˆ2\right\}
       c\Omega\right]ˆ{1/2}\\
     &\le C_4\left\lvert \left\lvert f\left\lvert \wt{S}ˆ{-1,0}_{a,-}
       W_2(\Omega,\Gamma_l)\right\rvert\right\rvert
       \left\lvert \abs{u}\overset{\circ}\to W_2ˆ{\wt{A}}
       (\Omega;\Gamma_r,T)\right\rvert\right\rvert.
     \end{split}\\
     \begin{split}\abs{I_2}&=\left\lvert \int_{0}ˆT \psi(t)\left\{u(a,t)
       -\int_{\gamma(t)}ˆa\frac{d\theta}{k(\theta,t)}
       \int_{a}ˆ\theta c(\xi)u_t(\xi,t)\,d\xi\right\}dt\right\rvert\\
     &\le C_6\left\lvert \left\lvert f\int_\Omega
       \left\lvert \wt{S}ˆ{-1,0}_{a,-}
       W_2(\Omega,\Gamma_l)\right\rvert\right\rvert
       \left\lvert \abs{u}\overset{\circ}\to W_2ˆ{\wt{A}}
       (\Omega;\Gamma_r,T)\right\rvert\right\rvert.
     \end{split}\tag{\theequation$’$}
     \end{align*}

#### A.2 Multline

Numbered version: ∫ a b{ ∫ a b[f(x)2 g(y)2 + f(y)2 g(x)2] − 2 f(x)g(x)f(y)g(y) d x} d y = ∫ a b{ g(y)2 ∫ a b f 2 + f(y)2 ∫ a b g 2 − 2 f(y)g(y) ∫ a b f g} d y(6 8)

To test the use of \label and \ref, we refer to the number of this equation here: (68).

     \begin{multline}\label{eq:E}
     \int_aˆb\biggl\{\int_aˆb[f(x)ˆ2g(y)ˆ2+f(y)ˆ2g(x)ˆ2]
      -2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\
      =\int_aˆb\biggl\{g(y)ˆ2\int_aˆbfˆ2+f(y)ˆ2
       \int_aˆb gˆ2-2f(y)g(y)\int_aˆb fg\biggr\}\,dy
     \end{multline}

Unnumbered version:

∫ a b{ ∫ a b[f(x)2 g(y)2 + f(y)2 g(x)2] − 2 f(x)g(x)f(y)g(y) d x} d y = ∫ a b{ g(y)2 ∫ a b f 2 + f(y)2 ∫ a b g 2 − 2 f(y)g(y) ∫ a b f g} d y

Some text after to test the below-display spacing.

     \begin{multline*}
     \int_aˆb\biggl\{\int_aˆb[f(x)ˆ2g(y)ˆ2+f(y)ˆ2g(x)ˆ2]
      -2f(x)g(x)f(y)g(y)\,dx\biggr\}\,dy \\
      =\int_aˆb\biggl\{g(y)ˆ2\int_aˆbfˆ2+f(y)ˆ2
       \int_aˆb gˆ2-2f(y)g(y)\int_aˆb fg\biggr\}\,dy
     \end{multline*}

#### A.3 Gather

Numbered version with \notag on the second line: D(a, r) ≡ {z ∈ C: z − a < r}, (6 9) seg(a, r) ≡ {z ∈ C: ℑ z = ℑ a, z − a < r}, c(e, θ, r) ≡ {(x, y) ∈ C: x − e < y tan θ, 0 < y < r}, (7 0) C(E, θ, r) ≡ ⋃ e∈E c(e, θ, r). (7 1)

     \begin{gather}
     D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\
     \seg(a,r)\equiv\{z\in\mathbf{C}\colon
     \Im z= \Im a,\ \abs{z-a}<r\},\notag\\
     c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C}
     \colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\
     C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r).
     \end{gather}

Unnumbered version.

D(a, r) ≡ {z ∈ C: z − a < r}, seg(a, r) ≡ {z ∈ C: ℑ z = ℑ a, z − a < r}, c(e, θ, r) ≡ {(x, y) ∈ C: x − e < y tan θ, 0 < y < r}, C(E, θ, r) ≡ ⋃ e∈E c(e, θ, r).

Some text after to test the below-display spacing.

     \begin{gather*}
     D(a,r)\equiv\{z\in\mathbf{C}\colon \abs{z-a}<r\},\\
     \seg (a,r)\equiv\{z\in\mathbf{C}\colon
     \Im z= \Im a,\ \abs{z-a}<r\},\\
     c(e,\theta,r)\equiv\{(x,y)\in\mathbf{C}
      \colon \abs{x-e}<y\tan\theta,\ 0<y<r\},\\
     C(E,\theta,r)\equiv\bigcup_{e\in E}c(e,\theta,r).
     \end{gather*}

#### A.4 Align

Numbered version: γ x(t) = (cos t u + sin t x, v), (7 2) γ y(t) = (u, cos t v + sin t y), (7 3) γ z(t) = cos t u + α β sin t v, −β α sin t u + cos t v . (7 4) Some text after to test the below-display spacing.

     \begin{align}
     \gamma_x(t)&=(\cos tu+\sin tx,v),\\
     \gamma_y(t)&=(u,\cos tv+\sin ty),\\
     \gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv,
       -\frac\beta\alpha\sin tu+\cos tv\right).
     \end{align}

Unnumbered version:

γ x(t) = (cos t u + sin t x, v), γ y(t) = (u, cos t v + sin t y), γ z(t) = cos t u + α β sin t v, −β α sin t u + cos t v . Some text after to test the below-display spacing.

     \begin{align*}
     \gamma_x(t)&=(\cos tu+\sin tx,v),\\
     \gamma_y(t)&=(u,\cos tv+\sin ty),\\
     \gamma_z(t)&=\left(\cos tu+\frac\alpha\beta\sin tv,
       -\frac\beta\alpha\sin tu+\cos tv\right).
     \end{align*}

A variation:

x = y by (84) (7 5) x′ = y′ by (85) (7 6) x + x′ = y + y′ by Axiom 1. (7 7) Some text after to test the below-display spacing.

     \begin{align}
     x& =y && \text {by (\ref{eq:C})}\\
     x’& = y’ && \text {by (\ref{eq:D})}\\
     x+x’ & = y+y’ && \text {by Axiom 1.}
     \end{align}

#### A.5 Align and split within gather

When using the align environment within the gather environment, one or the other, or both, should be unnumbered (using the * form); numbering both the outer and inner environment would cause a conflict.

Automatically numbered gather with split and align*:

ϕ(x, z) = z − γ 1 0 x − γ m n x m z n = z − M r−1 x − M r−(m+n)x m z n (7 8) ζ 0 = (ξ 0)2, ζ 1 = ξ 0 ξ 1, ζ 2 = (ξ 1)2,

Here the split environment gets a number from the outer gather environment; numbers for individual lines of the align* are suppressed because of the star.

     \begin{gather}
     \begin{split} \varphi(x,z)
     &=z-\gamma_{10}x-\gamma_{mn}xˆmzˆn\\
     &=z-Mrˆ{-1}x-Mrˆ{-(m+n)}xˆmzˆn
     \end{split}\\[6pt]
     \begin{align*}
     \zetaˆ0 &=(\xiˆ0)ˆ2,\\
     \zetaˆ1 &=\xiˆ0\xiˆ1,\\
     \zetaˆ2 &=(\xiˆ1)ˆ2,
     \end{align*}
     \end{gather}

The *-ed form of gather with the non-*-ed form of align.

ϕ(x, z) = z − γ 1 0 x − γ m n x m z n = z − M r−1 x − M r−(m+n)x m z n ζ 0 = (ξ 0)2, (7 9) ζ 1 = ξ 0 ξ 1, (8 0) ζ 2 = (ξ 1)2, (8 1)

Some text after to test the below-display spacing.

     \begin{gather*}
     \begin{split} \varphi(x,z)
     &=z-\gamma_{10}x-\gamma_{mn}xˆmzˆn\\
     &=z-Mrˆ{-1}x-Mrˆ{-(m+n)}xˆmzˆn
     \end{split}\\[6pt]
     \begin{align} \zetaˆ0&=(\xiˆ0)ˆ2,\\
     \zetaˆ1 &=\xiˆ0\xiˆ1,\\
     \zetaˆ2 &=(\xiˆ1)ˆ2,
     \end{align}
     \end{gather*}

#### A.6 Alignat

Numbered version: V i = v i − q i v j, X i = x i − q i x j, U i = u i, for i≠j; (8 2) V j = v j, X j = x j, U j u j + ∑ i≠j q i u i. (8 3) Some text after to test the below-display spacing.

     \begin{alignat}{3}
     V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j,
      & \qquad U_i & = u_i,
      \qquad \text{for $i\ne j$;}\label{eq:B}\\
     V_j & = v_j, & \qquad X_j & = x_j,
       & \qquad U_j & u_j + \sum_{i\ne j} q_i u_i.
     \end{alignat}

Unnumbered version:

V i = v i − q i v j, X i = x i − q i x j, U i = u i, for i≠j; V j = v j, X j = x j, U j u j + ∑ i≠j q i u i. Some text after to test the below-display spacing.

     \begin{alignat*}3
     V_i & =v_i - q_i v_j, & \qquad X_i & = x_i - q_i x_j,
      & \qquad U_i & = u_i,
      \qquad \text{for $i\ne j$;} \\
     V_j & = v_j, & \qquad X_j & = x_j,
       & \qquad U_j & u_j + \sum_{i\ne j} q_i u_i.
     \end{alignat*}

The most common use for alignat is for things like

x = y by (66) (8 4) x′ = y′ by (82) (8 5) x + x′ = y + y′ by Axiom 1. (8 6) Some text after to test the below-display spacing.

     \begin{alignat}{2}
     x& =y && \qquad \text {by (\ref{eq:A})}\label{eq:C}\\
     x’& = y’ && \qquad \text {by (\ref{eq:B})}\label{eq:D}\\
     x+x’ & = y+y’ && \qquad \text {by Axiom 1.}
     \end{alignat}

### References

[1] W. Diffie and E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1976), no. 5, 644 654.

[2] D. H. Fremlin, Cichon’s diagram, 1983/1984, presented at the Séminaire Initiation à l’Analyse, G. Choquet, M. Rogalski, J. Saint Raymond, at the Université Pierre et Marie Curie, Paris, 23e année.

[3] I. P. Goulden and D. M. Jackson, The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Langrangian methods, European J. Combin. 2 (1981), 131 212.

[4] F. Harary and E. M. Palmer, Graphical enumeration, Academic Press, 1973.

[5] R. Impagliazzo, L. Levin, and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st STOC (1989), ACM, New York, pp. 12 24.

[6] M. Kojima, S. Mizuno, and A. Yoshise, A new continuation method for complementarity problems with uniform p-functions, Tech. Report B-194, Tokyo Inst. of Technology, Tokyo, 1987, Dept. of Information Sciences.

[7] ______ , A polynomial-time algorithm for a class of linear complementarity problems, Tech. Report B-193, Tokyo Inst. of Technology, Tokyo, 1987, Dept. of Information Sciences.

[8] C. J. Liu and Yutze Chow, On operator and formal sum methods for graph enumeration problems, SIAM J. Algorithms Discrete Methods 5 (1984), 384 438.

[9] M. Marcus and H. Minc, A survey of matrix theory and matrix inequalities, Complementary Series in Math. 14 (1964), 21 48.

[10] S. Mizuno, A. Yoshise, and T. Kikuchi, Practical polynomial time algorithms for linear complementarity problems, Tech. Report 13, Tokyo Inst. of Technology, Tokyo, April 1988, Dept. of Industrial Engineering and Management.

[11] R. D. Monteiro and I. Adler, Interior path following primal-dual algorithms, part II: Quadratic programming, August 1987, Working paper, Dept. of Industrial Engineering and Operations Research.

[12] E. M. Stein, Singular integrals and differentiability properties of functions, Princeton Univ. Press, Princeton, N.J., 1970.

[13] Y. Ye, Interior algorithms for linear, quadratic and linearly constrained convex programming, Ph.D. thesis, Stanford Univ., Palo Alto, Calif., July 1987, Dept. of Engineering Economic Systems, unpublished.