Commun. Math. Phys. 198, 1 – 45 (1998)
Communications in
Mathematical Physics © Springer-Verlag 1998
Renormalization and Localization Expansions. II. Expectation Values of the “Fluctuation” Measures Tadeusz Balaban Rutgers University, Department of Mathematics, 110 Frelinghuysen Rd, Piscataway, NJ 08854-8019, USA Received: 19 December 1997 / Accepted: 12 February 1998
Abstract: This paper is a continuation of [5]. The k+1−st renormalization transformation applied to a density ρk is studied further, the new contributions to the effective action obtained in [5] are renormalized, and their localization expansions are constructed. This completes proofs of Theorems 1 and 4 in [5]. 1. Introduction In the previous paper [5] we have given an inductive description of the space of densities generated by k renormalization transformations, and we have started the analysis of the k + 1 − st transformation S (k) T (k) applied to a density ρk from the space. A result of this analysis is given in the final formula (3.18) of that paper. This formula describes the “new” density S (k) T (k) ρk in terms of the “old” density, the new integral operators T0(k) , and the new contributions to the effective action described in Propositions 3.1–3.4 [5]. The new density has a general form required by the inductive hypotheses (H.1)–(H.7) [5], but it does not yet have all the properties required by them, in particular the new contributions are not renormalized. In this paper we continue the analysis of [5] and we complete the proofs of Theorems 1 and 4. Let us recall the simplified formulations of those theorems. The first describes the renormalization transformation S (k) T (k) as a ¯ They are defined by (1.42) mapping between corresponding spaces Rk (β, a, λ, ν; B, ν). [5] as spaces of densities ρk satisfying the inductive hypotheses (H.1)–(H.7) [5], which include also the hypotheses (H.1)–(H.7) [4]. The theorem can be formulated in the following way. Theorem 1. Under the assumptions of Theorem 1 [4], i.e. under the appropriate as¯ in particular for sumptions on the constants determining the space Rk (β, a, λ, ν; B, ν), ν¯ ≤ βk−1 ≤ 78 L−2 , which implies k ≤ k0 , the transformation S (k) T (k) maps this space ¯ 2 ), but with into a space defined in the same way as the space Rk+1 (β, a, λ, ν; BLd−2 , νL the following changes. For the hypothesis (H.6) the sharp inequality “>” in (1.32) [5]
2
T. Balaban
is replaced by the weaker inequality “≥”. For the new contributions in the exponentials, i.e. the contributions with the superscript j = k+1, the hypotheses (H.2)–(H.4), (H.7) are satisfied with an improved constant 23 κ instead of κ. The transformation S (k) T (k) determines uniquely the transformation S (k) T (k) defined on the extended spaces of effective actions (1.6) [4]. It satisfies all the conclusions of Theorem 2 [4], i.e. it establishes the mapping (1.7) [4] between the appropriate extended spaces, which satisfies Eqs. (1.8), (1.9) [4] with ck+1 = 0, dk+1 = bk+1 , and the inequalities (1.10) [4]. Let us recall that we apply the above theorem in the case k < k0 , and all the background configurations in the inductive description are determined by the variational problems without the external field term, that is we put νk = 0 in them. We discuss the cases k ≥ k0 below. The results of the previous paper [5] described in the formula (3.18) [5] go quite a long way towards establishing the above theorem. The density S (k) T (k) ρk has a general form required by the inductive hypotheses, and satisfies most of them. The only missing important properties are the renormalization conditions in (H.2) [5] for the new contributions to the effective action corresponding to j = k + 1. The renormalization of the new contributions has been described in [4], and we use here all the constructions and the results of that paper, with proper modifications and additions. We need also to c , and small field domains determined by the introduce the final small field regions Zk+1 characteristic functions χk+1 . All these issues are discussed in the Sect. 2. This section completes the construction of the small field densities which satisfy the conditions in Theorem 1, in particular it yields the construction of the transformation S (k) T (k) satisfying these conditions. It remains to analyze the resulting large field parts ρ0k of the new effective densities, and this is done in Sect. 3. We obtain there in a simple and natural way inductive definitions of the mult-indices Ak+1 , the integral operators T(k) , Tk+1 , the functions κk+1 , etc., and we prove that the densities ρ0k satisfy all the conditions in the inductive hypotheses, with the possible exception of the inequality (1.32) [5] connected with (H.6) [5]. We obtain instead the weaker inequality, and this completes the proof of Theorem 1. For k < k0 we need to improve the inequality and to obtain the full hypothesis (H.6). This leads to the large field renormalization operation, which will be constructed in the next paper. Once we reach the density ρk0 satisfying all the inductive hypotheses we do not need anymore to improve the weaker inequalities obtained in Theorem 1, and replacing (1.32) [5], the hypothesis (H.6) for ρk0 is enough to control all the remaining steps. We define the remaining densities by (1.44) [5], i.e. by ρk = S (k−1) T (k−1) ρk−1 =
k0 Y
S (j) T (j) ρk0 ,
(1.1)
j=k−1
) where νk0 > 78 L−d βk−1 . Thus we do not starting with ρk0 ∈ Rk0 (β, a, λ, ν; B, βk−1 0 0 perform the large field renormalization operations anymore, and we include the external field term in the variational problems determining the background configurations in the representations of the sequence of the effective densities ρk , starting with k = k0 + 1. Properties of these densities are described in the following theorem. Theorem 4. The densities ρk given by (1.1) satisfy all the inductive hypotheses (H.1)– (H.5), (H.7) [5], and the integral operators Tk (Z, Ak ∩ Z) satisfy the inequality (1.31) [5] with ` = 1, as long as νk ≤ 1.
Renormalization and Localization Expansions
3
A proof of this theorem follows from the proof of Theorem 1, only one additional bound is needed here, and it is given also in Sect. 3. These proofs are based on Propositions 3.1–3.4 [5], and also on Propositions 2.1–2.3 in Sect. 2. These are statements on the existence of localization expansions of various expressions appearing in the course of constructions, expansions satisfying appropriate conditions, and they form an important technical part of any renormalization group method. We construct these expansions in the last section, and the construction is based on the results of the earlier paper [3], where the expansions of local functions of the background configurations were constructed. Here we have to construct expansions of expectation values with respect to the “fluctuation” measures described in Proposition 3.1–3.4 [5], and this is done by a form of a “cluster expansion”. Actually the expansions are constructed in an elementary way, and the cluster expansion of a form discussed in [8, 10] is used only for bounds. Let us remark that each of the renormalization group methods applied until now, for example the ones in [8, 10–12], has its own restrictions on the way the corresponding localizations are constructed. The method applied here has probably the strongest restrictions, because of the non-linear nature of the leading term −βk Ak in the effective action, in particular it demands a complete localization in the sense that a term localized in some domain X depends on other expressions, including covariances, background configurations, etc., all localized in subdomains of X. This is stressed quite explicitly in formulations of the above propositions. The constructions of Sect. 4 cover also expansions which we will need in the next paper on the large field renormalization.
2. The Renormalization of the Effective Actions The renormalization is based on the crucial property stressed several times in the last ˜ ψ) section, namely that localizations of the effective actions E00(k+1) (Zkc , k+1 , 00k+1 ; θ, to subdomains of 00k+1 are equal to localizations to the same subdomains of the effective action E00(k+1) (θ) constructed on the whole torus. Notice that the torus is one of the possible subdomains 00k+1 . Thus we have the functions E00(k+1) (θ), Ek (ψu(k) (θ)), βk+1,u Ak+1,u (θ, φk+1,u (θ)) defined on the whole torus, and we apply the renormalization procedure of Sects. 4,5 [4]. These functions determine the renormalization constants ζk+1 , bk+1 , ck+1 , dk+1 , ek+1 through Eqs. (5.5), (5.14) [4]. Let us recall that in Sect. 5 [4] we have mentioned several simple forms of the supplementary renormalization equations. Now it is convenient to choose the one discussed after the inductive hypotheses in Sect. 1 of [5], see in particular the formulas (1.40), (1.41) [5]. Let us recall also that we have to take the “thermodynamic” limits of the pre-localized functions, the limits as the torus goes to the whole space. For the renormalization constants we have the results formulated in Proposition 5.1 [4], in particular the inequalities (5.31) [4], which are important for future bounds. The constants in turn determine the new renormalized coefficients βk+1 , ak+1 , λk+1 , νk+1 through Eqs. (4.1) [4]. Having the coefficients we can construct renormalized background functions for various generating sets. Let us recall that the first equation in (4.1) [4] is θ = zk+1 ψk+1 , so now ψk+1 is the new spin variable on the lattice T1(k+1) . The renormalization is performed on the actions restricted to a small field domain c , but at first we have to determine this domain. Among the renormalized background Zk+1 functions we have the ones determined by the generating sets Bk+1 (0∼2 ), 0 ∈ πk+1 , and we define the functions χk+1 (0 ) by the formula (1.19) [5] with k replaced by k + 1.
4
T. Balaban
∼3 c We denote for simplicity 00∼−3 = ((00c k ) ) , and we introduce the decomposition of k+1 unity X X c (χk+1 (0 ) + χck+1 (0 )) = χck+1 (Sk+1 )χk+1 (Sk+1 ∩ 00∼−3 1= k+1 ) 0 ⊂00∼−3 k+1
Sk+1 ⊂00∼−3 k+1
(2.1) before the exponential in (3.18) [5]. A term in the last decomposition is determined by a new large field region Sk+1 , the last one in the procedure. We have the following simple modification of Lemma 2.1: χ0k+1 (0 )χk+1 (0 ) = χk+1 (0 ).
(2.2)
From this it follows that in the corresponding term in (3.18) [5] the only functions ∼3 ∪ Sk+1 . On the χ0k+1 (0 ) left on the domain 00k+1 are the ones with 0 ⊂ (00c k+1 ) 00∼−3 complement of the last domain restricted to k+1 there are the functions χk+1 (0 ) only. They give the final restrictions on the new variable ψk+1 , in agreement with the c , inductive hypotheses. Thus we can define the last small field domain Zk+1 [ c 0 ∼4 ∼ = {00 ∈ πk+1 : distk+1 (00 , (00c ∪ Sk+1 ) > 2M Rk + M }. (2.3) Zk+1 k+1 ) We can write it again as ∼ L−1 2 c ∼4 ∼ ∼2[Rk ]+2+ L−1 2 )c Zk+1 = (((00c ) ∪ S ) , hence, k+1 k+1 ∼4 ∼ ∪ Sk+1 (00c k+1 )
∼2[Rk ]+2
By the definition the domain c ) (Zk+1
so on the domain denote as before
∼ Wk+1
∼4 ∼ ⊂ Zk+1 ⊂ (00c ∪ Sk+1 k+1 )
(2.4)
∼2[Rk ]+2+ L−1 2
.
(2.5)
c Zk+1
≈2 ∼
has the property that ∼3 ∩ (00c ∪ Sk+1 = ∅, k+1 )
(2.6) 0
there are only the small field functions χk+1 ( ), where we c ≈ )≈2 , Uk+1 = Zk+1 . Wk+1 = (Zk+1
(2.7)
c Having finally the small field domain Zk+1
we can decompose the new contributions c , and boundary in the exponential in (3.18) [5] into expressions localized properly in Zk+1 0(k+1) terms. Let us start with the function E0 . We take the localization expansions discussed in Proposition 3.4 [5], and we define E0(k+1) (z, Y ; ψk+1 ) = E00(k+1) (z, Y, (Zkc , k+1 , 00k+1 ); zk+1 ψk+1 ) for Y ⊂ 00k+1 , X X c E0(k+1) (Zk+1 ; ψk+1 ) = E (k+1) (z, Y ; ψk+1 ).
(2.8) (2.9)
c ∩T (k+1) Y ∈Dk+1 :z∈Y ⊂(Z c )≈ z∈Zk+1 k+1 1
By the crucial property discussed at the beginning of this section the function (2.9) is c of the function E0(k+1) (ψk+1 ) = E00(k+1) (zk+1 ψk+1 ) the localization to the domain Zk+1 defined on the whole torus. The remaining part of the localization expansion of ˜ ψ) can be written in the form (3.3) [5], after resumming over E00(k+1) (Zkc , k+1 , 00k+1 ; θ, points z, with domains Y ∈ Dk+1 (modck+1 ) satisfying the condition Y ∩ Zk+1 6= ∅. Terms of this sum depend on Zk+1 because of the resummation, and we add the sum to the boundary terms B 00(k+1) . Let us change the notations in agreement with the notations
Renormalization and Localization Expansions
5
used in the inductive hypotheses. We denote again by ψ the spin configuration defined on Bk+1 and such that ψ 3j = ψj , j = 0, 1, . . . , k, k + 1. The fluctuation variable on 0 B(3k+1 ) ∩ 00c k+1 , denoted before by ψ, we denote now by ψk . The obtained boundary 00 00(k+1) 0 terms are denoted by B (Ak , k+1 , k+1 , Zk+1 ; ψ, ψk ). Of course they depend also on h, g and the previous fluctuation variables ψj0 . We apply the definitions and decompositions as above to the remaining expressions in (3.18) [5], with some obvious modifications. For F00(k+1) we use the representation (2.52) [4] in terms of M0(k+1) , and we write D E ˜ ψk0 ) = χZ c ∩Z g, M0(k+1) (Zkc , k+1 , 00k+1 ; θ, ˜ ψk0 ) F00(k+1) (Zkc , k+1 , 00k+1 ; θ, k+1 0 k 1 D E 0(k+1) c 00 0 ˜ c g, M + χZk+1 (Zk , k+1 , k+1 ; θ, ψk ) . 0 1 (2.10) The localization expansion of the first term on the right-hand side is added to the boundary terms B 00(k+1) . The localization expansion of the second term is divided into two parts. The first part is the sum over localization domains which are not contained c )≈ , and this part is added to B 00(k+1) also. The second part is the remaining in (Zk+1 c )≈ . For terms of this sum we use sum over localization domains contained in (Zk+1 again the crucial property that they are corresponding localizations of the function F0(k+1) (ψk+1 , g) = F00(k+1) (zk+1 ψk+1 g) defined on the whole torus. This sum is the restricc tion of the function F0(k+1) (ψk+1 , g) to the domain Zk+1 , in agreement with the definition c (1.12) [5] of the hypothesis (H.3) [5], therefore it is denoted by F0(k+1) (Zk+1 ; ψk+1 , g). 0(k+1) Similarly for the function Rn , n = 1, . . . , m, we divide the localization expansion of Rn0(k+1) into two parts. The first part is the sum over localization domains which intersect Zk+1 , and this sum is added to B 00(k+1) . The second part is the sum over domains which c . Terms of this sum are corresponding localizations of the funcare contained in Zk+1 (k+1) tion Rn (ψk+1 ) = Rn0(k+1) (zk+1 ψk+1 ) defined on the whole torus, and we denote the c sum by R(k+1) (Zk+1 ; ψk+1 ), in agreement with the definition (1.17) [5] of the hypothesis n (H.4) [5]. This is the final definition of these functions for n < m, but not for n = m. There will be another important contribution coming from the large filed renormalization operation. For this reason we still keep the “prime” in the notation, i.e. we have 0(k+1) c (Zk+1 ; ψk+1 ). To finish the discussion of these functions let us recall that their Rm localization expansions satisfy the bounds discussed in Propositions 3.2, 3.3 [5], with the constants const. βk−n−1 . According to the inductive hypothesis (H.4) [5] we have to −n . We have replace them by βk+1 n const.βk−n−1 βk+1
= const.
βk+1 βk
n
βk−1 = const.(γk+1 Ld−2 )n βk−1
≤ const.Lm(d−1) βk−1 = const.M d−1 βk−1 ≤
1 for βk large enough, 2
so we obtain certainly the required bounds, with the additional factor 21 we will use yet in the case n = m. After the above decompositions and definitions we obtain the expressions in the exponentials which have the same form as in (3.18) [5], but the functions E00(k+1) , c c c F00(k+1) , Rn0(k+1) there are replaced by E0(k+1) (Zk+1 ), F0(k+1) (Zk+1 ), R(k+1) (Zk+1 ) for n < n
6
T. Balaban
0(k+1) c m, Rm (Zk+1 ). Of course the boundary terms B 00(k+1) are changed, with all the new contributions added, but this is reflected only in bounds, which we will discuss later on. Consider now the first three terms in the exponential in (3.18) [5]. We would like c and boundary terms. to decompose them into a sum of terms properly localized in Zk+1 We start with the main action, and at first we write the decomposition
A∗k+1,u (Zkc , Bk+1 ; θ, φ0k+1,u (θ˜0 )) = A∗k+1,u (Zkc ∩ Zk+1 , Bk+1 ; θ, φ0k+1,u (θ˜0 )) c + A∗k+1,u (Zk+1 ; θ, φ0k+1,u (θ˜0 )).
(2.11)
We have changed slightly the notation here, we denote φ0k+1,u (θ˜0 ) = φ(B0k+1 ; θ˜0 ), where B0k+1 = (Bk (Wk ) ∩ ck+1 ) ∪ 3k+1 . We consider the second term on the right-hand side above, and we apply the expansion ˜ φ0k+1,u (θ˜0 ) = φ(Bk+1 (Wk+1 ); ψ(Bk+1 (Wk+1 ), B0k+1 ; θ˜0 )) = φ(Bk+1 (Wk+1 ); θ) (2.12) ˜ = φk+1,u (θ) ˜ + δφk+1,u (δψ 0 ). + δφ(Bk+1 (Wk+1 ); ψ(Bk+1 (Wk+1 ), B0k+1 ; θ˜0 ) − θ) The configuration δψ 0 inside the function δφk+1,u is equal to 0 on the domain Wk+1 , and ˜ c (Wk∼ ∩ Bk+1 ; δ, ε) we have |δψ 0 | < K4 δ otherwise small, for example on the space 9 by Proposition 2.3 [3] and the representation (4.21) [2], for suitable δ, ε satisfying the assumptions of Propositions 2.1–2.3 [3]. Then 1 c )∼ , |δφ0k+1,u (δψ 0 )| < K3 K4 δ exp(− γ0 (2M Rk − M − 2M1 )) < exp(−Rk ) on (Zk+1 4 (2.13) and the same bounds for derivative, Laplace operator, etc. of this function. We apply now the formula (2.23) [5] and we obtain c c ˜ ; θ, φ0k+1,u (θ˜0 )) = A∗k+1,u (Zk+1 ; θ, φk+1,u (θ)) A∗k+1,u (Zk+1
∗ c ˜ − h c + δAk+1,u (Zk+1 ; 0, δφk+1,u ) + νk+1,u δφk+1,u , φk+1,u (θ) Z k+1 1 ˜ (δφk+1,u )+ + (δφk+1,u )− , ∂φk+1,u (θ) . + 2 st(Z c )
(2.14)
k+1
Of course the second term on the right-hand side is missing if the external field is included in the variational problem. The bound (2.13) shows that the three terms above are very small, even after multiplying by βk+1,u = βk Ld−2 . We construct their localization expansions using Propositions 2.1–2.3, 4.3 [3], after preliminary pre-localizations in cubes of πk+1 . Terms of these expansions corresponding to localization domains not c are equal to 0, thus we include the expansion into the boundary terms intersecting Wk+1 00(k+1) B . These are small contributions, the bounds hold with constants smaller than any power of βk−1 . We consider similar expressions, but more complicated and containing more terms, later on in more detail, in connection with the renormalization of the main action on the right-hand side of (2.14). We refer the reader to that discussion, if the above statements are too sketchy. We construct a similar expansion for the first term on the right-hand side of (2.11). We define the generating set Bk+1 (∂k+1 ) = (Bk (Wk ) ∩ ck+1 ) ∪ (Bk+1 (Uk+1 ) ∩ k+1 ),
(2.15)
˜ = φk+1,u (∂k+1 ; θ). ˜ We want to and the corresponding function φ(Bk+1 (∂k+1 ); θ) expand the first term around this function. We have
Renormalization and Localization Expansions
7
˜ φ0k+1,u (θ˜0 ) = φ(Bk+1 (∂k+1 ); ψ(Bk+1 (∂k+1 ), B0k+1 ; θ˜0 )) = φ(Bk+1 (∂k+1 ); θ) 0 0 ˜ = φk+1,u (∂k+1 ; θ) ˜ (2.16) + δφ(Bk+1 (∂k+1 ); ψ(Bk+1 (∂k+1 ), Bk+1 ; θ˜ ) − θ) + δφk+1,u (∂k+1 ); δψ 00 ),
and the configuration δψ 00 inside the function δφk+1,u is equal to 0 on the domain Wk ∩ Uk+1 , hence this function satisfies the bounds (2.13) on the domain Zkc ∩ Zk+1 . We apply again the formula (2.23) [5] and we obtain an equality analogous to (2.14), with obvious changes. The last three terms in it have localization expansions with similar properties to the above ones. We include them again into the boundary terms, although this time they contribute to both terms, B 0(k) and B 00(k+1) because some localization domains may be contained in Wk∼ ∩ ck+1 . Thus we have transformed the main action into the following sum ˜ βk+1,u A∗k+1,u (Zkc ∩ Zk+1 , Bk+1 ; θ, φk+1,u (∂k+1 ; θ)) c ˜ + βk+1,u A∗k+1,u (Zk+1 ; θ, φk+1,u (θ)),
(2.17)
with the new contributions to the boundary terms. Now we consider the “old” effective action in (3.18) [5], which is now written as Ek (Zkc ; ψu0(k) (θ˜0 )). It is the sum of terms described in (H.2) [5], and we decompose it into two parts, analogously to (2.11). To the first part we include the terms either with localization points y ∈ Zkc ∩Zk+1 and all possible localization domains, i.e. domains X ⊂ c , but with localization domains intersecting (Zkc )≈ , or with localization points y ∈ Zk+1 c )≈ )c . This includes also the corresponding “counterterms” in (1.8) [5], with the ((Zk+1 condition on the localization domains replaced by the condition on the points x ∈ c )≈ . We denote this part by Ek0 (Zkc ∩ Zk+1 ; ψ 0(k) (θ˜0 )). To the second part (Zkc )≈ \(Zk+1 c ; ψu0(k) (θ˜0 )), we include remaining terms, and it is easy to see that it is equal to Ek (Zk+1 c c th as defined in (H.2) [5], for the domain Zk+1 instead of Zk . j term of this function 0(j) depends on the background configuration ψk+1,u (θ˜0 ), and we would like to replace it by the configuration localized in Bk+1 (Wk+1 ). Using the same notation as in (2.12) we have on the domain Wk+1 , 0(j) (θ˜0 ) = ψ(Bj (Wk ), B0k+1 ; θ˜0 ) ψk+1,u
= ψ(Bj (Wk+1 ), Bk+1 (Wk+1 ); ψ(Bk+1 (Wk+1 ), B0k+1 ; θ˜0 )) ˜ = ψ(Bj (Wk+1 ), Bk+1 (Wk+1 ); θ) + δψ(Bj (Wk+1 ), Bk+1 (Wk+1 ); ψ(Bk+1 (Wk+1 ), B0k+1 ; θ˜0 ) (j) ˜ + δψ (j) (δψ 0 ), (θ) = ψk+1,u k+1,u
(2.18) ˜ − θ)
where the configuration δψ 0 is the same as in (2.12), so it is equal to 0 on Wk+1 ∩ T1(k+1) . (j) A localization expansion of the function δψk+1,u (δψ 0 ) has all terms corresponding to localization domains contained in Wk+1 equal to 0. Using the above decompositions we 0(j) (j) c ˜ up to the expand the actions E (j) (Zk+1 ; ψk+1,u (θ˜0 )) around the configurations ψk+1,u (θ) first order. Combining the previous decomposition with this expansion we obtain c ˜ + Ek0 (Zkc ∩ Zk+1 ; ψu0(k) (θ˜0 )) Ek (Zkc ; ψu0(k) (θ˜0 )) = Ek (Zk+1 ; ψu(k) (θ)) k Z 1 X d (j) c ˜ + δψ (j) (tδψ 0 )). dt E (j) (Zk+1 ; ψk+1,u (θ) + k+1,u dt 0 j=1
(2.19)
8
T. Balaban
The second term and the sum on the right-hand side contribute to the boundary terms only, because of their localization properties. We construct localization expansions of these expressions in a more direct way than in the previous section, using the procedure of the proof of Proposition 4.1 [3] only, but there are also some additional problems now. A localization expansion of the second term on the right-hand side above has terms with localization domains contained in Wk∼ ∩ck+1 . We would like to obtain their exponential decay bounds in terms of the function dk . A part of a decay bound comes from the bounds of the functions E (j) (y, X), which are expressed in terms of dj (X), and dj (X) “pseudo-scales” with a factor ≥ L for j < k, but not for j = k. Fortunately for j = k and X ⊂ ck+1 these functions do not depend on ψu0(k) (θ˜0 ), they are already localized in X, so they go unchanged into the localization expansions, and we still obtain the right bounds. Thus we construct the localization expansions using Bk (Wk ) and the η-scale as the basis of the construction for terms with j < k, and then we perform proper resummations. For j = k we treat the whole domain (Zkc )≈ as a part of k+1 , for example we take 0k+1 = (((Zkc )≈ )0 )∼ , where ((Zkc )≈ )0 is a union of all cubes from πk+1 intersecting (Zkc )≈ , and we take the generating set (Bk (Wk ) ∩ 0k+1 ) ∪ 30k+1 , 30k+1 = (0k+1 )(k+1) . We construct the expansions using this generating set and the L−1 η-scale as the basis, and we perform resummations again. In this case we obtain terms of the expansions with localization domains belonging to Dk+1 (modck+1 ) only. These remarks should justify the following proposition. Proposition 2.1. The sum of the second term and the sum over j on the right-hand side of (2.19) has a localization expansion of the form X X∈Dk :X⊂Wk∼ ∩ck+1
+
E 00(k) (X, Zkc ; ψk )
X
E 00(k+1) (Y, Zkc , k+1 , Zk+1 ; θ),
(2.20)
Y ∈Dk+1 (modck+1 ):Y ∩Zk+1 6=∅
with the terms having the properties described in (H.7) [5], and satisfying the bounds there with const. E0 exp(−(κ − 1)dk (X)) on the right-hand sides for the terms of the first sum, and with const. E0 exp(−(2κ − κ0 − 1)dk+1 (Y modck+1 )) on the right-hand sides for the terms of the second sum. Let us remark again that the constant in the bounds can be written explicitly in terms of the previously introduced constants, actually it is almost the same as the constant in the bound (3.131) [1]. We include the expansion (2.20) into the boundary terms, the first sum is included into B 0(k) , and actually into the part of it with localization domains disjoint with ck , which is important for proving the inductive hypotheses, the second sum is included into B 00(k+1) . Consider finally the “old” generating functional Fk (Zkc ; ψu0(k) (θ˜0 ), g) in (3.18) [5]. We decompose it in exactly the same way as in (2.19), using the linearity property in the factor χZkc g as in (2.10), and we construct localization expansions of the corresponding terms in the decomposition. We obtain Proposition 2.2. The terms of the decomposition of the generating functional, the decomposition corresponding to (2.19), have localization expansions of the form (2.20), with E replaced by F, with an additional dependence on g, and the same properties and bounds, but with the constant E0 replaced by 2.
Renormalization and Localization Expansions
9
We include the two sums in the expansion into B 0(k) , B 00(k+1) correspondingly. After all these preparatory operations we have obtained the expression in the exponential in (3.18) [5] transformed into the following form: c c c ˜ + Ek (Zk+1 ˜ + E (k+1) (Zk+1 ; θ, φk+1,u (θ)) ; ψu(k) (θ)) ; ψk+1 ) − βk+1,u A∗k+1,u (Zk+1 0 (k+1) c (k) ˜ c (Zk+1 ; ψk+1 , g) + Fk (Zk+1 ; ψu (θ), g) + F 0
+
m−1 X
c 0(k+1) c R(k+1) (Zk+1 ; ψk+1 , g) + Rm (Zk+1 ; ψk+1 , g) n
n=1
˜ + B 0(k) (Ak , ck+1 ; ψ, ψ 0 , g) − βk+1,u A∗k+1,u (Zkc ∩ Zk+1 , Bk+1 ; θ, φk+1,u (∂k+1 ; θ)) c ; ψ, ψ 0 , g) − Ek Ld |Zkc \k+1 | + B 00(k+1) (Ak , k+1 , 00k+1 , Zk+1
− Ek00 Ld |k+1 \00k+1 | − Ek000 Ld |00k+1 |.
(2.21) Now we are prepared to perform the renormalization of the effective action. It involves the first five terms above, as in Sect. 4 [4]. We perform the same operations as in that c . This causes section, but for the expressions restricted to the small field region Zk+1 some minor changes, so we discuss the main points in these operations, giving more details only if the changes are more substantial. The first operation, and the one which requires a more detailed discussion, is an expansion of the “old” main action around the “new” one determined by the renormalized coefficients. It is a simple generalization of the expansions (4.2), (4.3), (4.13), (4.14) [4]. At first we use Eqs. (4.1) [4] in the special case when ck+1 = 0, dk+1 = bk+1 , and we decompose the first term in (2.21), or rather the corresponding function in the variational problem in (4.2) [4], into a sum of this function with the renormalized coefficients, and a remainder with the renormalization constants. Using the first equality in (4.1) [4] we write θ = ψ + δψ, δψ = χ3k+1 ζk+1 ψk+1 , and we expand the expressions on the right-hand side of the obtained equality around the renormalized configurations. Let us write the corresponding formulas in the case k = k0 , in which we have to expand the configurations φk+1,u , αk+1,u independent of νk+1,u = νk L2 , around the renormalized configurations φk+1 , αk+1 dependent on νk+1 . These configurations are determined by the variational problem for the function Ak+1 (Bk+1 (Wk+1 ); ψ˜ k+1 , φ) with the external field term. In other cases the formulas are basically the same as in Sect. 4 [4], but we will discuss modifications in these cases anyway. Writing φk+1,u = φk+1 + δφk+1 , αk+1,u = αk+1 + δαk+1 and using the formula (2.23) [5] we obtain c c βk+1,u A∗k+1,u (Zk+1 ; θ, φk+1,u ) = βk+1 A∗k+1 (Zk+1 ; ψk+1 , φk+1 ) 1 −1 bk+1 k∂φk+1 k2Z c∗ + βk+1 ak+1 ζk+1 hψk+1 , ψk+1 − Qk+1 φk+1 iZ c ∩3k+1 + βk+1 k+1 k+1 2 β −1 bk+1 1 −1 + k+1 kαk+1 k2Z c + νk+1 βk+1 ek+1 kφk+1 − hk2Z c k+1 k+1 2λk+1 2 c + βk+1 δA∗k+1,u (Zk+1 ; δψ, δφk+1 , δαk+1 ) −1 bk+1 hδφk+1 , −1φk+1 + αk+1 φk+1 iZ c + βk+1 k+1 −1 + νk+1 βk+1 ek+1 hδφk+1 , φk+1 − hiZ c k+1
10
T. Balaban
1 (δφk+1 )+ + (δφk+1 )− , ∂φk+1 + βk+1,u 2 st(Z c
k+1
c βk+1 A∗k+1 (Zk+1 ; ψk+1 , φk+1 )
(k+1)
+ βk+1 C 1 (δφk+1 )+ + (δφk+1 )− , ∂φk+1 + βk+1,u 2 st(Z c =
)
c (Zk+1 ; δψ, δφk+1 , δαk+1 )
(2.22)
,
) k+1
where 1 c ; δψ, δφ, δα) = hδψ − Qk+1 δφ, ak+1 (δψ − Qk+1 δφ)iZ c ∩3k+1 δA∗k+1,u (Zk+1 k+1 2 1 1 −1 (2.23) + (1 + βk+1 bk+1 ) k∂δφk2Z c∗ + hδφ, αk+1 δφiZ c + kδαk2Z c k+1 k+1 k+1 2 λk+1 1 −1 ek+1 )kδφk2Z c . + νk+1 (1 + βk+1 k+1 2 Let us recall that the norms, scalar products and derivatives in all formulas in this section are taken in the L−1 η-scale. In the case considered here the functions δφk+1 δαk+1 satisfy the following variational equations: a a ∗ D Q − 11 + αk+1 + δα δφ = Q∗ δψ − δαφk+1 + f0 , Q −1 −1 1 + βk+1 bk+1 1 + βk+1 bk+1 f0 =
−1 −βk+1 bk+1 νk+1 (−1φk+1 + αk+1 φk+1 ) + (φk+1 − h) −1 −1 1 + βk+1 bk+1 1 + βk+1 bk+1
−1 1 + 2βk+1 bk+1 νk+1 (φk+1 − h), −1 1+ 1 + βk+1 bk+1 1 1 1 (2φk+1 · δφ + |δφ|2 ) = (|φk+1 + δφ|2 − |φk+1 |2 ) = δα, on 1 , 2 2 λk+1 −1 = βk+1 bk+1 Q∗
a
−1 βk+1 bk+1
(Qφk+1 − ψ˜ k+1 ) +
(2.24) where Q denotes the averaging operator determined by the generating set Bk+1 (Wk+1 ), 1 = 1 (Wk+1 ) is the first domain determined by this set, and the last equality in the definition of f0 follows from the variational Eq. (1.10)[2] for the configuration φk+1 . These equations are of the form (3.20) [2], and we can apply to them all the relevant results of [2, 3]. In particular Proposition 3.1 [2] yields the unique solutions δφk+1 δαk+1 . They are analytic functions of φk+1 , αk+1 ; δψ, f0 defined on the spaces (3.21) [2] and satisfying the bounds (3.47)[2]. In variables δψ, f0 they are of first order at least, so if δψ = 0, f0 = 0, then δφk+1 = 0, δαk+1 = 0. We will use this property in future expansions, as in Sect. 4 of [4]. Let us compare Eqs. (2.24) with the corresponding variational Eqs. (4.4), (4.5) [4]. The only essential difference is in the last term of the function f0 in (2.24), which has the coefficient νk+1 , whereas the corresponding term in (4.4) [4] has the coefficient −1 ek+1 . That term has been bounded by 23 εk+1 ε in (4.10) [4], and we would like to νk+1 βk+1 have the same bound here, so we assume that νk+1 < 16 εk+1 ε. In [4] we have taken finally ε = r0 , where r0 has been defined after (5.26)[4], so the assumption is νk+1 < 16 εk+1 r0 . −1 By the remark following (1.9) [5] we have νk+1 = νk0 +1 < 98 Ld βk−1 = 98 Ld βk+1 , so 0 +1 −1 −1 d L β ε ≤ r . We have assumed the the assumption follows from the inequality 27 0 k+1 k+1 4 condition (5.27) [4], which is much stronger than this inequality, so the above assumption is satisfied also. We obtain from it that the configurations δψ, f0 , δφk+1 , δαk+1 satisfy the bounds (4.10), (4.11) [4], hence also the remaining bounds in [4].
Renormalization and Localization Expansions
11
c We consider the function C (k+1) (Zk+1 ) defined by the second equality in (2.23). This definition looks different than the definition (4.14) [4], but in fact one can be obtained from another by using the variational equations. The function is pre-localized c , and we decompose it into a sum of functions pre-localized in cubes 1k+1 (z), z ∈ in Zk+1 c Zk+1 ∩ T1(k+1) , as in (4.15) [4]. They are analytic functions of (ψk+1 , h) defined on a quite large space determined by the assumptions in Propositions 1.1, 3.1 [2], 2.1, 2.2 [3], but we consider them on the space 4ck+1 (Bk+1 (Wk+1 ); εk+1 ). They satisfy the bounds −1 3C4 B6 K5 , |C (k+1) (1k+1 (z); δψ, δφk+1 , δαk+1 )| < βk+1
(2.25)
which are the same as in Proposition 4.1 [4], but we have used the bounds (5.31) [4] for the renormalization constants. The bounds hold on the above space, and for the functions analytically extended in localization parameters. We construct their localization expansions using the procedure of Proposition 4.1 [3], which can be applied without any modifications in this case, and we obtain all the conclusions of this proposition. We can treat in a similar way the surface term, the last term in (2.23). The set c ) can be identified as the set of bonds of the lattice TL−1 η intersectof bonds st(Zk+1 c , with proper directions. We decompose the surface into a union ing the surface ∂Zk+1 of d-1-dimensional M -cubes, which are walls of cubes from πk . This decomposition determines a decomposition of the surface term in (2.23) into a sum over the walls of the terms corresponding to bonds intersecting a wall. A surface term in this sum −1 1 −1 = βk+1 0(1)B6 K3 K42 K5 . We construct can be bounded by 0(1)K3 K42 ε2k+1 B6 K5 βk+1 ε2k+1 localization expansions of these terms as above, and all localization domains in these ∼ and intersect Zk+1 . After proper resummations we expansions are contained in Wk+1 include the obtained expansion into the boundary term B 00(k+1) . Let us make a remark on the basic renormalization group Eqs. (5.5), (5.14), or (5.21) [4] in the considered case k = k0 . For those equations not only bounds are important, we have taken care of that, but also their structure. It differs slightly from the one in [4] in that is now not necessarily of second order in the renormalization variables the function c(k+1) 2 ξ, because of the term with the coefficient νk+1 in f0 . Thus this function contributes also to the terms of zeroth and first order in ξ. Fortunately these contributions are very small, −1 ), and they do not change anything in the analysis they are proportional to νk+1 = O(βk+1 of Sect. 5 [4]. Let us make some comments on the remaining two cases. If k < k0 , then there is no term with νk+1 in the variational equations (2.24), but instead there is the additional c ). The above remark applies to term νk+1 hδφk+1 , φk+1 − hi in the function C (k+1) (Zk+1 this case also. If k > k0 , then we have the same equations and the function as in [4], with obvious changes connected with the generating set and the special renormalization group equations for ck+1 , dk+1 . Finally, let us remark that, for greater clarity, we could divide the operations in the case k = k0 into two steps. In the first step we would include the external field term into the variational problem for the background configurations, without the renormalization. This means that we would write the decomposition (2.22) with ζk+1 = bk+1 = ek+1 = 0, and where δφk+1,u , δαk+1,u are the solutions of the Eqs. (2.24) with f0 = νk+1,u (φk+1,u − −1 h). These solutions are of the order 0(βk+1,u ), and we would include the new term (k+1) c c ) into the function E0 (Zk+1 ). In the second step we would perform −βk+1,u C (k+1) (Zk+1 the usual renormalization operation, as in the case k > k0 , i.e. as in [4]. The next operation is an expansion of the effective action Ek and the generating functional Fk in (2.21) around the renormalized background configurations. It is the
12
T. Balaban
same as in [4]; we use the decompositions (j) ˜ = ψ (j) (ψ˜ k+1 ) + δψ (j) , δψ (j) = δψ (j) (δψ, f0 ), ψk+1,u (θ) k+1 k+1 k+1 k+1
(2.26)
where the last function is given by an obvious generalization of the second formula in (4.16) [4]. We expand the functions Ek , Fk , and we define the new contributions Eu0(k+1) , F 0(k+1) by the formulas (4.17), (4.18) [4], with obvious changes in notations. We define a pre-localized decomposition of the function Eu0(k+1) in the same way as in (3.17) c [5], we take for z ∈ Zk+1 ∩ T1(k+1) , c c Eu0(k+1) (z, Zk+1 ; ψk+1 ) = E (k+1) (z, (Zk+1 )≈ ; ψk+1 ) k Z 1 X d (j) ˜ (j) c dt E (j) (1k+1 (z), (Zk+1 )≈ ; ψk+1 (ψk+1 ) + δψk+1 (tδψ, tf0 )), + dt 0
(2.27)
j=1
c c )≈ ) denotes the sum of terms from E (j) (Zk+1 ) where the symbol E (j) (1k+1 (z), (Zk+1 c with localization points y ∈ 1k+1 (z), and localization domains contained in (Zk+1 )≈ , c )≈ , and the symbol including the counterterms in (1.8) [5] with y ∈ 1k+1 (z), x ∈ (Zk+1 (k+1) c E0 (z, (Zk+1 )≈ ) denotes the sum of terms (2.8) with the given point z and localization c )≈ , i.e. the second sum in (2.9). The function (2.27), more precisely domains Y ⊂ (Zk+1 the sum on the right-hand side, is a non-local function of ψk+1 , and we construct its localization expansion applying the procedure of Proposition 4.1 [3]. We discuss it below together with other expansions. Now we complete the renormalization defining c ; ψk+1 ) E 0(k+1) (z, Zk+1 c = Eu0(k+1) (z, Zk+1 ; ψk+1 ) − βk+1 C (k+1 (1k+1 (z); δψ, δφk+1 , δαk+1 ) − E (k+1) (z), (2.28) where E (k+1) (z) is defined as in (4.21) [4] by the expressions considered on the whole c ) we have to construct lattice. To define a final renormalized contribution E (k+1) (Zk+1 localization expansions of the above functions, and to take terms with proper localization domains. We discuss the localization expansions in the following proposition. c ∩ T1(k+1) has a localization expansion Proposition 2.3. The function (2.28) for z ∈ Zk+1 of the form X c E 0(k+1) (z, Y, Zk+1 ; ψk+1 ) (2.29) ∼ Y ∈Dk+1 :z∈Y ⊂Wk+1
with the terms having the properties described in (H.2) [5], and satisfying the bounds with the constant (N Ld B5 + 1 + const.E0 β −1 L−2γ(k+1) + 3B6 C4 K5 )(1 + K0 ) ≤ (N Ld B5 + 2 + 3B6 C4 K5 )(1 + K0 ), which is determined by the absolute constants introduced before and independent of E0 c for β large enough. If a localization domain Y is contained in (Zk+1 )≈ , then the term of the expansion (2.29) is equal to the corresponding term of the expansion of the function c ; ψk+1 , g) (2.28) defined on the whole lattice. Similarly, the functions M0(k+1) (x, Zk+1 defined by the formula (4.18) [4] have localization expansions of the same general form c (2.29), but with z replaced by x ∈ Zk+1 ∩ TL−1 η , and the constant in the bounds equal to
Renormalization and Localization Expansions
1 −1 β 4 + const.β −1 L−(k+1)α1 2
13
(L−1 η)
d−2 2 +γ−α1
≤ c9 (L−1 η)
d−2 2 +γ−α1
.
c )≈ is equal to the corresponding Again, a term with a localization domain Y ⊂ (Zk+1 term of the localization expansion of the function defined on the whole lattice.
Let us make a remark concerning definition (2.27). It gives a form of the prelocalization, which is an alternative to the definitions (2.57), (4.20) [4], but it requires including the counterterms into the corresponding functions, as in (1.8) [5]. The prelocalized functions defined by (2.27) are generally different from the ones defined by (4.20) [4], but their sums over the points z are of course equal; they are equal to the globally defined new contribution on the whole lattice. Therefore the renormalization equations and the renormalization constants defined by them are also equal. We divide expansion (2.29) into two parts, the first is the sum over localization doc )≈ , the second is the remaining sum over domains intersecting mains contained in (Zk+1 c ≈ c ((Zk+1 ) ) . The second sum is included into the boundary terms B 00(k+1) , after resumc . The first sum is the part of the localization expansion of mations over z ∈ Y ∩ Zk+1 function (2.28) defined on the whole lattice, which is equal to the part contained in c ). The function (2.28) on the whole lattice definition (1.8) [5] of the function E (k+1) (Zk+1 (k+1) (k+1) determines also the functions v1 , v2 , hence the second part, the “counterterm” in definition (1.8) [5]. We subtract and add the counterterm, and the sum with the subtracted c ) to the effective action. It counterterm defines finally the new contribution E (k+1) (Zk+1 satisfies the required properties and bounds, as was discussed at the end of Sect. 5 [4]. c ) to the generating In the same way we construct the final new contribution F (k+1) (Zk+1 functional, but without any counterterms now, and it satisfies also the required properties and bounds. Consider now the added counterterm. It is easy to see, by the antisymmetry of the expression under the double sum, that it is equal to the sum with “minus” sign, the c c )≈ ∩ Zk+1 ∩ T1(k+1) , y ∈ Zk+1 ∩ T1(k+1) . Using the localization summations over z ∈ (Zk+1 expansions of v1(k+1) , v2(k+1) we can write it in the form X
−
X
(k+1) Y ∈Dk+1 :z∈Y c )≈ ∩Z z∈(Zk+1 k+1 ∩T1
D +
v2(k+1) (z, ·, Y
D E 1 (k+1) 2 2 c (ψ v1 (z, ·, Y ), χZk+1 (·) − ψ (z)) k+1 k+1 2
c (νk+1 h · (ψk+1 (·))0 − νk+1 h · (ψk+1 (z))0 ) ), χZk+1
E .
(2.30) The above sum is obviously included into the boundary terms B 00(k+1) , after changing the order of the sums and performing proper resummations. Bounds are given in (3.77), (3.80) [1]. The last operation of this section is the renormalization of the previous main action pre-localized on the domain Zkc ∩ Zk+1 , i.e. of the first term in (2.17). This means simply an expansion of the form (2.22). We need this operation really only in the case k ≤ k0 , but we may do it in all cases as well. A difference in comparison with (2.22)–(2.24) is that now we do not change the dependence of the background configurations on the external field, even in the case k = k0 , so for k ≤ k0 the configurations are independent of the external field before and after the operation. Thus we write
14
T. Balaban
˜ βk+1,u A∗k+1,u (Zkc ∩ Zk+1 , Bk+1 ; θ, φk+1,u (∂k+1 ; θ)) ˜ = βk+1 A∗k+1 (Zkc ∩ Zk+1 , Bk+1 ; ψ, φk+1 (∂k+1 ; ψ)) + βk+1 C (k+1) (Zkc ∩ Zk+1 , Bk+1 ; δψ, δφk+1 (∂k+1 ), δαk+1 (∂k+1 )) 1 ˜ (δφk+1 (∂k+1 ))+ + (δφk+1 (∂k+1 ))− , ∂φk+1 (∂k+1 ; ψ) , + βk+1,u 2 st(Zkc ∩Zk+1 ) (2.31)
˜ −h c where we include the term νk+1 δφk+1 (∂k+1 ), φk+1 (∂k+1 ; ψ) Z ∩Z k
k+1
into the
∩ Zk+1 , Bk+1 ) for k ≤ k0 , and for k > k0 the function is the function C same as in (2.22), with obvious notational changes connected with the different domain and the generating set. For k ≤ k0 the functions δφk+1 (∂k+1 ), δαk+1 (∂k+1 ) satisfy the variational Eqs. (2.24) determined by the generating set Bk+1 (∂k+1 ), where 1 (∂k+1 ) is the first domain determined by the set, and where f0 does not have the term with νk+1 , but has the additional term χ1 (∂k+1 ) 1χc1 (∂k+1 )∩k+1 Q∗k+1 δψ. For k > k0 they satisfy the above described equations, with the additional term νk+1,u added to the operator in the square brackets in the first equation. In both cases we can apply Proposition 3.1 [2] and we obtain the bounds (3.47)[2], from which we conclude the bounds (2.25) for the function C (k+1) (1(y), Bk+1 ), where 1(y) = 1k (y) for y ∈ Zkc ∩ Z k+1 ∩ 3k , and 1(y) = 1k+1 (z) for y = z ∈ Zkc ∩ Zk+1 ∩ 3k+1 . Thus the second term on the right-hand side of (2.31) can be bounded by const. (|Zkc ∩ ck+1 |η + |Zk+1 ∩ k+1 |). The surface term in (2.31) can be estimated in the same way as discussed after (2.25), and we can obtain a bound expressed either in terms of areas of the surfaces ∂Zkc , ∂Zk+1 , or as above. Thus the sum of the last two terms in (2.31) can be estimated by the bound written above. All the terms on the right-hand ∼ , so we do not need to side of (2.31) depend on the variables ψ restricted to Wk∼ ∩ Uk+1 construct localization expansions for the last two terms, and we include them into the boundary terms. We have completed all operations connected with the renormalization of the effective action, and we have transformed the expression in the exponential in (3.18) [5] into an expression in which almost all terms have the form required by the inductive hypotheses, c c c c , Ek+1 (Zk+1 ), Fk+1 (Zk+1 ), R(k+1) (Zk+1 ), all have more precisely the main action on Zk+1 the required form. We divide the sum of all boundary terms into two parts in a way different than the division into B 0(k) , B 00(k+1) . To the first part we include the whole B 0(k) , the sum of terms from B 00(k+1) with localization domains contained in Zk+1 , and the sum of the two last terms in (2.31). The obtained sum is denoted by B (k) (Zkc ∩ c Zk+1 , (Ak , k+1 , 00k+1 , Zk+1 ); ψ, ψ 0 , g), or simply by B (k) (Zkc ∩ Zk+1 ), or B (k) . The sum 00(k+1) c of the remaining terms in B , with localization domains intersecting Zk+1 and Zk+1 , 00 (k+1) c 0 (k+1) (k+1) is denoted by B (Zk+1 , (Ak , k+1 , k+1 , Zk+1 ); ψ, ψ , g), or B (Zk+1 ), or B . We conclude this section with the following proposition. (k+1)
(Zkc
Proposition 2.4. The renormalization operation described in this section has transformed the expression in the exponential in (3.18) [5] into the following one
Renormalization and Localization Expansions
c c Ak+1 (Zk+1 ) + Fk+1 (Zk+1 )+
− −
m−1 X
15
c 0(k+1) c R(k+1) (Zk+1 ) + Rm (Zk+1 ) n
n=1 ∗ c ˜ + B (k) (Zkc ∩ Zk+1 ) βk+1 Ak+1 (Zk ∩ Zk+1 , Bk+1 ; ψ, φk+1 (∂k+1 ; ψ)) Ek Ld |Zkc \k+1 | − Ek00 Ld |k+1 \00k+1 | − Ek000 Ld |00k+1 ∩ Zk+1 |
(2.32)
+ B (k+1) (Zk+1 ). Terms of the above expression satisfy the corresponding inductive hypotheses, and the term B (k) , for which a localization representation is not important anymore, depends on ∼ , and satisfies the bound the variables restricted to the domain Uk+1 |B (k) (Zkc ∩ Zk+1 )| < const.B0 (|Zkc ∩ ck+1 |η + |Zk+1 ∩ k+1 |),
(2.33)
in addition to the analyticity and symmetry properties. We have discussed already almost all statements of the above proposition, except bounds for terms of B (k+1) . We have seen in this section and in the previous paper, that contributions to B (k+1) constructed in various operations have bounds independent of B0 . Summing the bounds for terms with the same localization domain we obtain bounds with the common constant independent of B0 . To finish the analysis of the transformation S (k) T (k) acting on the effective density ρk we have to discuss the large field density obtained as a result of the operations performed in the last three sections. We will do it in the next section. 3. A Definition and Properties of the Large Field Density ρ0k+1 (Zk+1 ) Let us start with a definition of a new multi-index Ak+1 . In this case it is determined by a sequence of domains, so it is defined in purely geometric terms as follows: c }. Ak+1 = Ak ∪ {Pk+1 , Qk+1 , Rk+1 , Sk+1 , k+1 , 00k+1 , Zk+1
(3.1)
Notice that all the new domains are either contained in Zkc ∩ Zk+1 , like the large field regions Pk+1 , Qk+1 , Rk+1 , Sk+1 , or their boundaries are contained in it, like ∂k+1 , ∂00k+1 , ∂Zkc = ∂Zk , so all the new elements of the geometric structure are “localized” in this sense in Zkc ∩ Zk+1 . For this reason we denote by Ak+1 ∩ (Zkc ∩ Zk+1 ) the new sequence of domains added to Ak . If Z is a union of connected components of Zk+1 , then we denote by Ak+1 ∩ (Zkc ∩ Z) the intersections of the new domains, or their boundaries, with the domain Z. This yields in the considered case a precise inductive definition of the symbol Ak ∩ Z used in Sect. 1 [5]. The most important new contribuc . The domain k+1 joins the sequence tions to Ak+1 are the domains k+1 , 00k+1 , Zk+1 determined by the generating set Bk , and defines the new generating set Bk+1 . We have c joins the already made extensive use of this set in the preceding papers. The domain Zk+1 sequence Ck and defines the new sequence Ck+1 . Let us notice also that the expression (2.32) in the exponential depends on the part of the multi-index Ak+1 determined by the c only. domains k+1 , 00k+1 , Zk+1 With the above definition we write now the final form of the new contribution to the large field integral operator. We define
16
T. Balaban
T(k) (Zk+1 , Ak+1 ∩ (Zkc ∩ Zk+1 )) = T0(k) (Zkc , Pk+1 , Qk+1 , Rk+1 , k+1 , 00c k+1 ) · ∼3 c ∩ Sk+1 ))χck+1 (Sk+1 )χk+1 (00∼−3 ∩ Sk+1 ∩ Zk+1 ) · · χ0k+1 (00k+1 ∩ ((00c k+1 ) k+1 ˜ · exp −βk+1 A∗k+1 (Zkc ∩ Zk+1 , Bk+1 ; ψ, φk+1 (Bk+1 (∂k+1 ); ψ)) d c 00 d 00 000 d 00 − Ek L |Zk \k+1 | − Ek L |k+1 \k+1 | − Ek L |k+1 ∩ Zk+1 | .
(3.2)
The definition (2.47) [5] and the above one give a complete and explicit definition of this integral operator. It has obviously all the properties formulated in hypothesis (H.5) ∼ . Integrations in [5], in particular its kernel depends on ψk+1 , ψk , ψk0 restricted to Uk+1 0 this operator are with respect to the variables ψk , ψk restricted to ck+1 , k+1 ∩ 00c k+1 ∼ correspondingly and these domains are disjoint with Wk+1 , so the operator commutes with the small field part of the effective density. Now we define Tk+1 (Zk+1 , Ak+1 ) = T(k) (Zk+1 , Ak+1 ∩ (Zkc ∩ Zk+1 ))Tk (Zk , Ak ) exp B (k) (Zkc ∩ Zk+1 ). (3.3) This is a part of the inductive definition of the integral operators, the part determined by the procedure connected with the transformation S (k) T (k) , and described before in (1.23) [5]. The operator (3.3) has also all the properties formulated in (H.5) [5], together with the ones formulated above. One of the most important properties of the integral operators are the bounds (1.26) [5]. We would like to obtain now a similar, but explicit bound for the operator (3.2), and to obtain this way simultaneously a new contribution to the exponent in (1.26) [5], hence an inductive definition of the function κk . The integral operator (2.2) act on functions ∼ , ψk0 k+1 ∩ 00c F of the variables ψk ck+1 , ψk+1 k+1 ∩ Uk+1 k+1 , and we obtain easily the following preliminary bound, in which we estimate the Gaussian integrations in (2.47) [5]: Z dψk+1 Zk+1 |T(k) (Zk+1 , Ak+1 ∩ (Zkc ∩ Zk+1 ))F | ≤ 1 1 1 |Pk+1 | + (d log M + N log 2) d |Pk+1 |) · Md 2 M 1 1 1 1 · exp(− p21 (βk ) d |Rk+1 | + (d log LM + N log 2) d |Rk+1 |) · 4 M 2 M Z Z ≤ exp(−aLd−2 p20 (βk )
· sup 0 ψk
dψk ck+1
c dψk+1 k+1 ∩Zk+1 χ(Zkc ∩ Zk+1 )χ0c k+1 (Qk+1 )χk+1 (Sk+1 ) ·
(3.4)
˜ · exp −βk+1 A∗k+1 (Zkc ∩ Zk+1 , Bk+1 ; ψ, φk+1 (Bk+1 (∂k+1 ); ψ)) + (O(1) log βk + const.E0 )|Zkc ∩ Zk+1 | |F |. The characteristic function χ(Zkc ∩ Zk+1 ) describes the part of the space (1.24) [5] restricted to the domain Zkc ∩Zk+1 . All other characteristic functions, except the two “large field” functions, have been bounded by 1. To estimate further the above expression we have to use bounds for the main action. We formulate them in the following proposition. Proposition 3.1. Assume that the coefficients βk+1 , ak+1 , λk+1 , νk+1 satisfy the conditions (H.1) [4], and X is a domain such that X ∩ (j \j+1 ) is a union of unit cubes
Renormalization and Localization Expansions
17
in the ξ-scale, determined by points of the lattice T (j) . There exists an absolute positive constant γ0 , i.e. a constant depending on d only, such that βk+1 A∗k+1 (X, Bk+1 ; ψ, φ)
≥ γ0
X k+1
βj
j=0
+
k X j=0
1 βj+1 2
X
1 2
X
|(∂ 1 ψj )(b)|2
b⊂3j ∩X
|ψj+1 (b+ ) − (Qψj )(b− )|
(3.5)
2
,
b∈st(cj+1 ∩T (j+1) )∩X
for arbitrary configurations ψ, φ, ψ defined on Bk+1 ∩X and ψ = ψj on 3j . If they satisfy 2 the conditions ||ψ| − 1| < c5 , νj (1 − h · (ψ)0 ) < c5 on 3j ∩ X, |α| = | λk+1 2 (|φ| − 1)| < j−1 2 c0 (L η) on (j \j+1 ) ∩ X, then we also have βk+1 A∗k+1 (X, Bk+1 ; ψ, φ) ≥ γ0
k+1 X j=0
βj
X 1 (|ψj (y)| − 1)2 2
y∈3j ∩X
(3.6)
+ νj (1 − h · (ψj (y))0 ) . Let us recall that the coefficients βj , λj , νj in the above proposition are connected with βk+1 , λk+1 , νk+1 by the canonical scaling only, i.e. βj = βk+1 (Lj−1 η)d−2 , λj = λk+1 (Lj−1 η)2 , νj = νk+1 (Lj−1 η)2 . The above inequalities are very simple, they have been proved several times before in various places, sometimes as elements of proofs, without formulating them explicitly, for example in Sect. 4 of [6a], in the proof of Lemma 3.1 in [1], in Proposition 2.2 of [2]. In the second inequality (3.6) we could replace the expression in the square brackets by the effective potential Vj (ψj (y), h): in fact it is obvious with the effective potentials, and then we use the bounds of Proposition 2.2 [2] on them. Let us notice that by analyzing the proofs a bit more carefully we could 1 for example, but it is still far from really good bounds. If X is a union take γ0 = 7d+4 of two neighbouring cubes in a proper scale, then we could take γ0 = 13 . This case is usually enough to obtain locally some small factors from large field restrictions, but it is convenient to formulate the inequalities in the general case. They will be used also in the next section. Finally, let us remark that the above mentioned proofs of (3.5), (3.6) are based on trivial and rather universal inequalities, and this is a reason that we have obtained a small constant γ0 . We can obtain an optimal constant γ0 if we take a proper minimal configuration instead of φ and use the results of the renormalization analysis discussed in [1] and Sects. 4,5 of [4]. The analysis yields a precisely defined expansion of the action in terms of the basic “scaling expressions”, which are the expressions on the right-hand sides of the inequalities. Coefficients at leading terms of the expansion, which can be explicitly calculated as in Sect. 5 [4], determine almost uniquely the optimal constant. Now we estimate further the expression on the right-hand side of (3.4). The integrations on Zkc ∩ Zk+1 are restricted by the characteristic function χ(Zkc ∩ Zk+1 ) to a small neighbourhood of the unit sphere in RN , so we bound them by a supremum of the underintegral function with respect to the corresponding ψk , ψk+1 , multiplied by exp O(1)|Zkc ∩ Zk+1 |. Obviously it is a rough bound, we could do much better using the inequalities (3.5), (3.6) to estimate the integral, and then cancel some terms with the factor log βk in the exponential, but it is not important. We use the inequalities to obtain
18
T. Balaban
some small factors for the large field characteristic functions in (3.4). Consider a function 0 0∼3 ˜ ; δ), or the slightly weaker assumption χ0c k+1 ( ). If we assume that ψ ∈ 9(Bk+1 ∩ ˜ satisfies the conditions ˜ k+1 ∩ 0∼2 ; δ), then φk+1,u (Bk+1 (k+1 ∩ 0∼2 , 0∼2 ); θ) ψ˜ ∈ 9(B 9 9 1 (1.15), (1.16) [2] with 8 K1 δ, and if we take 8 K1 δ ≤ 2 δk , then χ0k+1 (0 ) = 1. This means that not all conditions defining the above space are satisfied, and the inequalities yield the factor γ0 1 2 2 1 1 βk δ 2 , βk+1 δ 2 , βk+1 δ 2 , βk+1 δ 2 ) p0 (βk ) . ≤ exp − ( exp −γ0 min 2 2 2 9K1 Taking into account overlap properties of the domains for the above spaces considered for all 0 ⊂ Qk+1 , we obtain the factor 1 8γ0 2 p (βk ) d |Qk+1 | (3.7) exp − d 6 (9K1 )2 0 M for the characteristic function χ0c k+1 (Qk+1 ). By an almost identical, but a slightly simpler reasoning we obtain the factor 1 γ0 2 p (β ) |S | (3.8) exp − k+1 k+1 Md 2 · 6d K12 0 for the function χck+1 (Sk+1 ). Combining the above bounds with (3.4) yields finally Z dψk+1 Zk+1 |T(k) (Zk+1 , Ak+1 ∩ (Zkc ∩ Zk+1 ))F | ≤ 1 ≤ exp −A3 (log βk )2p0 d (|Pk+1 | + |Qk+1 | + |Rk+1 | + |Sk+1 |) M Z c + (O(1) log βk + const.)|Zk ∩ Zk+1 | sup sup dψk Zk χ(Zkc ∩ Zk+1 )|F |, ∼ 0 ψZkc ∩Uk+1 ψk
(3.9) o n 8γ0 2 1 2 , and we have taken p A , A = p . where A3 = min 6d (9K 1 0 2 0 8 1 1) We estimate also the exponential factor in (3.3), which in principle is connected with the operator T(k) , using the bound (2.33), and we include the bound in the above exponential; it changes only the constant. Notice that all the above volumes are measured in the L−1 η-scale. Let us denote the expression in the exponential by −κ(k) (Ak+1 ∩ (Zkc ∩ Zk+1 )). We have written the above bounds on the whole domain Zkc ∩ Zk+1 , but obviously they have the same form if we restrict all the expressions to a union of connected components, in particular the function κ(k) is a sum of its values on the components. From (3.5), (3.3) and (1.26) [5] we obtain the corresponding inequality (1.26) [5] for the operators with the index k + 1, where κk+1 (Z, Ak+1 ∩ Z) = κk (Z ∩ Zk , Ak ∩ (Z ∩ Zk )) + κ(k) (Ak+1 ∩ (Zkc ∩ Z)),
(3.10)
Z is a connected component of Zk+1 . This gives the inductive definition of the function κk+1 . From this definition it is clear that the functions κk are quite universal. They are the same for many classes of models; for example the same functions have been used in the papers [6b,c,d] on lattice gauge field theory, the only difference is in different “running” constants used to express the smallness of the exponential factors (3.7), (3.8),
Renormalization and Localization Expansions
19
etc. We have analyzed these functions extensively in [6d], and we will use the results obtained there. Consider now the second element of the bounds (1.29)–(1.31) [5], the combinatoric factors C(Ak ∩ Z). It is very easy to determine a relation between C(Ak+1 ∩ Z) and C(Ak ∩ Z), Z is a connected component of Zk+1 . There are the new sums over the regions Zk , Pk+1 , Qk+1 , Rk+1 , Sk+1 , k+1 , 00k+1 , or rather their intersections with fixed Z. Forgetting almost everything about the intricate geometric relations between the −d regions we can bound the sum over Zk ∩Z by 2M |Z|η , and the sums over the remaining −d c regions by 26(LM ) |Zk ∩Z|η . The last number can be improved if we use a part of the exponential factor in (3.9). We could replace 6 by a small number, but it is unimportant. Estimating these factors in a simple way we can take C(Ak+1 ∩ Z) = C(Ak ∩ Z) exp(
1 5 1 |Zk ∩ Z|η + |Z c ∩ Z|η ). Md 4 Md k
(3.11)
This inductive definition of the combinatoric factors allows us to write them explicitly, which is unimportant, but implies also easily the inequality (1.28) [5]. Another important definition is that of the function K(Z, Ak ∩Z). We have introduced it sketchily in Sect. 1. Now we would like to give it a more explicit and convenient form. Consider the expression on the left-hand side of the inequality (1.30) [5] multiplied by exp Hk |Z|η . For simplicity of notations let us assume in this paragraph that Z is the only component of Zk , so Z = Zk and Ak ∩ Z = Ak . The inequality (1.30) [5] can be now written in the form C(Ak ) exp(−κk (Zk , Ak ) + Hk |Zk |η ) < exp(−`p2 (βk )).
(3.12)
Consider the expression on the left hand side for the index k + 1, i.e for the multi-index obtained by the above inductive construction. Analyzing the definition of the function κ(k) , and the definitions of all the regions involved, it is easy to see that the expression has the largest possible value if all the large field regions Pk+1 , Qk+1 , Rk+1 , Sk+1 are empty. Thus from the point of view of the bounds (3.12) it is enough to consider the case when no large field regions are created. This leads to the following definitions and notations. For Z ∈ D we define S(Z) = Zk+1 determined by the definitions in Sects. 2,4 under the assumption that Zk = Z and all the large field regions are empty.
(3.13)
In principle the operation S should have an index indicating the scale for which we perform the geometric constructions, but we omit it for simplicity. The domain S(Z) can be determined using the operation “∼”, but we write only a simple inclusion following from (2.4), (2.9), (2.46) [5], and (2.5), S(Z) ⊂ (Z ∼[Rk+1 ]+1 )0∼9+L+3[Rk ] ⊂ Z ∼[Rk+1 ]+10L+L
⊂ Z ∼4L[Rk ] .
(3.14)
diamk+1 (S(Z)) ≤ diamk+1 (Z) + 8M [Rk ] = L−1 diamk (Z) + 8M [Rk ].
(3.15)
2
+3L[Rk ]
From this we obtain the inequality
The operation S can be iterated, and we denote by Sn the composition of n operations on successive scales. The domain Sn (Z) is considered on the scale L−n η, and we have
20
T. Balaban
diamk+n (Sn (Z)) < L−n diamk (Z) +
n X
L−(n−p) 8M [Rk+p−1 ]
p=1
(3.16)
< L−n diamk (Z) + 12M [Rk+n−1 ]. It is clear that for sufficiently large n the domains Sn (Z) shrink to a domain with a diameter smaller than some universal size, for example by (3.15) or (3.16) this size may be taken as equal to 12M [Rk+n−1 ]. When the diameters reach this size, then the next applications of the operation S do not change essentially the sizes of the domains; they keep them almost constant, a bit smaller than the “critical size” 12M [Rk+n−1 ], but greater than 6M [Rk+n−1 ]. Let us denote by A0k+n the multi-indices obtained from Ak under the assumption 0 that there are no new large field regions, then Zk+n = Sn (Zk ). Consider the expression on the left hand side of (3.12) for the above multi-indices. For simplicity of notations in the following formulas we take n = 1. Applying (3.10), (3.11) we obtain 0 0 , A0k+1 ) + Hk+1 |Zk+1 |L−1 η ) C(A0k+1 ) exp(−κk+1 (Zk+1 1 = C(Ak ) exp(−κk (Zk , Ak ) + d |Zk |η + Hk+1 L−d |Zk |η M d 5 L 0 0 0 − κ(k) (A0k+1 ∩ (Zkc ∩ Zk+1 )) + |Zkc ∩ Zk+1 |L−1 η + Hk+1 |Zkc ∩ Zk+1 |L−1 η ). 4 M (3.17) The function κ(k) above is equal to the last term in the exponential (3.9). We combine it L d + H0 log βk+1 with the last two terms above, and we bound O(1) log βk + const. + 45 M by const. log βk+1 . The constant can be written explicitly in terms of the previous basic constants, like L, M, K0 , K1 , etc. For the second and third terms in the last exponential above we use the bound
1 (d − 2) log L 1 1 1 + H0 L−d log βk+1 a = d + + d H0 log βk a < 1 + Hk < Hk , d d M M L L 27 and we obtain the inequality 0 0 , A0k+1 ) + Hk+1 |Zk+1 |L−1 η ) C(A0k+1 ) exp(−κk+1 (Zk+1 0 |L−1 η ). < C(Ak ) exp(−κk (Zk , Ak ) + Hk |Zk |η + const. log βk+1 |Zkc ∩ Zk+1
(3.18)
Obviously it holds for k replaced by k + p − 1, hence we have 0 0 , A0k+1 ) + Hk+n |Zk+n |L−n η ) C(A0k+n ) exp(−κk+n (Zk+n < C(Ak ) exp −κk (Zk , Ak ) + Hk |Z|η
+
n X
(3.19)
const. log βk+p |(Sp−1 (Zk ))c ∩ Sp (Zk )|L−p η = exp(−κk,n (Zk , Ak )),
p=1
where the last equality is a definition of the function κk,n . The sequence κk,n (Zk , Ak ) is decreasing in n, the sequence p2 (βk+n ) is increasing. Hence κk,n (Zk , Ak ) − `p2 (βk+n ) is decreasing and there is an exactly one index K such that the terms of the last sequence are positive for n ≤ K, and non-positive for n > K. Obviously it depends on ` also, but we consider the two values ` = 1, 2 only, and all the statements below are valid
Renormalization and Localization Expansions
21
for both of them. We say then that Ak = Ak ∩ Zk controls K steps, and we define the function K(Zk , Ak ) as equal to the index K. We take ` = 2 for the function used in the formulation of the hypothesis (H.6) [5]. This definition has been formulated in the case when Zk is connected, but in a general case for a connected component Z of Zk we replace Zk , Ak by Z, Ak ∩ Z in all the above formulas and definitions. The function has been considered in [6d], and we formulate below a proposition following from the results obtained there. Let us remark again that this part of the method is completely model-independent, and the results of [6d] hold without changes. Proposition 3.2. (i) If a component Z of Zk has a diameter greater than the critical size in the η-scale, then there is an index K < K(Z, Ak ∩ Z) such that Sk (Z) has a diameter smaller than the critical size in the L−K η-scale, and K + log βk+K a < K(Z, Ak ∩ Z). (ii) If K(Z, Ak ∩ Z) = 0, then there exists an index k1 < k such that for all indices j, k1 ≤ j ≤ k, the domains Zj ∩ Z have diameters smaller than the critical sizes in the Lj η-scales, the corresponding multi-indices Aj ∩ Z = Ak ∩ Zj ∩ Z control at least k − j steps, there are no large field regions in Zkc1 ∩ Z, and n1 = k − k1 > log βk1 a.
(3.20)
(iii) If K(Z, Ak ∩ Z) > 0, Ak+1 is obtained as in (5.1), and Z 0 is a component of Zk+1 containing Z, then K(Z 0 , Ak+1 ∩ Z 0 ) ≥ K(Z, Ak ∩ Z) − 1.
(3.21)
A proof of this proposition is quite simple, although rather lengthy and awkward. Details can be found in [6d], on pp. 383–387 in particular. The proposition will be used in the next paper in a construction of the operation R(k) . Let us remark that this construction creates its own multi-indices, but they have basically the same structure as the above ones, in fact a bit simpler, and all the above considerations and results can be applied to them also. Finally we can conclude the proofs of Theorems 1,4. Proof of Theorem 1. Of course we have been proving this theorem starting with Sect. 2 [5]. We want only to make some final comments. The definitions (3.1)–(3.3) provided the last elements of the inductive description, and combined with (2.47), (3.18) [5], Proposition 2.4, yield the effective density satisfying the inductive hypotheses (H.1)–(H.5), (H.7) [5]. The hypothesis (H.6) [5] may not be satisfied. Instead we have a weaker condition K(Z, Ak+1 ∩ Z) ≥ 0, where Z is a component of Zk+1 , and for some components we may have the equality. This remark ends the proof of the theorem. Proof of Theorem 4. In the same way as above we obtain that the densities ρk given by (1.1) satisfy the inductive hypotheses (H.1)–(H.5), (H.7) [5], so it remains to prove that the integral operators satisfy the inequality (1.31) [5] with ` = 1. The hypothesis (H.6) [5] is satisfied for ρk0 , hence K(Z, Ak0 ∩ Z) > 0 for the admissible multi-indices and components of Zk0 . If we change the condition defining the function K replacing ` = 2 by ` = 1, then we obtain a function K 0 with the same properties as K, except that the corresponding inequalities hold with ` = 1. Using the definition (3.19) of κk,n , the definition of K, Proposition 3.2 and the estimate of the critical size we obtain
22
T. Balaban
κk,n (Z, Ak ∩ Z) > κk,K (Z, Ak ∩ Z) − const.
n X
log βk+p (12M Rk+p )d
p=K+1
> 2p2 (βk+K ) − const.(12M R0 )d
n X
(log βk+p a)2d+1
p=K+1 0
> 2p2 (βk+K ) − const. (log βk+K a)2d+2 > p2 (βk+n ), if n ≤ K + log βk+K a, p2 ≥ 2d + 2 and A2 is sufficiently large. Bounds of the above type will be analyzed in more generality and detail in the next paper, so here we have written only conclusions. From the above inequality we obtain that K 0 (Z, Ak ∩ Z) > K(Z, Ak ∩ Z) + log βk a. Taking k = k0 we conclude that K 0 (Z, Ak0 ∩ Z) is greater than the total number of the remaining steps, so this function is positive for all admissible multi-indices occurring in the densities (1.1). Therefore the integral operators satisfy (1.31) [5] with ` = 1. In the next paper we construct the operation R(k) , and we finally restore the condition (1.32) [5] in the hypothesis (H.6) [5], proving in this way Theorem 2 [5]. To simplify a bit the construction we introduce a modification of the definition of the large field domain Zk+1 . If a component of this domain has a diameter smaller than the critical size, then we replace it by a smallest rectangular parallelepiped containing it. Of course it is a uniquely defined domain in Dk+1 . This way all the large field domains Zj ∩ Z described in Proposition 3.2 are rectangular parallelepipeds also. This condition makes geometric considerations in the next paper much simpler.
4. The Localization Expansions In this section we construct various localization expansions discussed and used in this paper and in [4,5]. There is quite a large number of them, but fortunately they are almost identical, so we discuss more extensively a most important and difficult case, and then we discuss briefly some variations in other cases. This is one of the most technical sections in this sequence of papers. It relies heavily on results and methods of [3], which are combined with some new results, and the results of [7,9], to yield required statements on localization expansions. We refer frequently even to small technical details in [3], and we use many constants and bounds defined and discussed there. We do not repeat even the most important definitions and constructions, because it would increase substantially this already large section. Most important and difficult is a class of the localization expansions connected with fluctuation integrals considered in Sect. 3 of the last paper [5], with their special cases considered in Sect. 2 of [4]. We devote most of this section to a construction of these expansions. Basically we discuss a generic case covering all of them, but we have to consider particularly carefully the most important new contributions (3.14), (3.15) [5] to the effective action and the generating functional. Thus we start with a detailed analysis of the measure (3.16) [5] and the corresponding expectation values (3.14), (3.15) [5], and then we work backwards analyzing the contributions to the measures in (3.11), (3.9), (3.2) [5], and the corresponding expectation values. Our first goal is to construct a localization expansion of the “interaction potential” in the exponential (3.16) [5]. To see clearly properties and bounds of this expression − 21
we expand its terms in βk
up to proper orders, so that we obtain an overall factor
Renormalization and Localization Expansions
23
−1
−1
βk 2 . To study the analyticity properties in βk 2 it is convenient to introduce the rescaled −1
−1
coefficient βk 2 σ in place of βk 2 in the obtained expression. Thus we define the function −1
1
(k) (Zkc ; βk 2 σ, C (k) 2 ψ) Ut,u Z 1 1 ∂3 − 21 1 −1 0 0 2 = −βk σ dt (1 − t ) ( 0 0 0 V (k) )(Zkc ; βk 2 σC (k) 2 t0 tψ), 2 0 ∂ψ ∂ψ ∂ψ (k) 21 (k) 21 (k) 21 C tψ, C tψ, C tψ
Z
−1
+βk 2 σ − 21
dt 0
dt0 (
0 1
Z
+βk σ
1
0
1 ∂ ˜ + β − 2 σC (k) 21 t0 tψ), C (k) 21 tψ Ek )(Zkc ; ψ (k) (θ) k 0 ∂ψ
(4.1)
∂ − 21 c (k) ˜ (k) 21 0 (k) 21 ( 0 Fk )(Zk ; ψ (θ) + βk σC t uψ), C uψ . ∂ψ
For σ = 1 it is equal to the “interaction potential” in the measure (3.16) [5], for σ = 0 it is obviously equal to 0. It is a function of ψ, (θ, h), g, and we want to localize in all these variables. We construct the expansions successively for the three terms in (4.1). Consider the first term and write the function V (k) (Zkc ; ψ 0 ) as the sum (2.30) [5]. A term V (k) (z; ψ 0 ), z ∈ TL(k+1) ∩ Zkc , is given by the formula (2.30) [5] in which the scalar products are restricted to the block Bk+1 (z). It is defined in terms of the functions (1) (1) (1) δφ(1) k , δφk,2 = δφk − δφk , δαk , δαk,2 = δαk − δαk . In Sect. 2 of [3], Proposition 2.1, we have constructed the analytic extensions δφk (s), δαk (s) considered as functions of ψ 0 , φk+1 , αk+1 , s. Here we take the large cube 0 from the partition πk+1 containing the block Bk+1 (z), and X0 = 0∼ , X1 = 0∼L−1 . We construct the extensions for the generating set (Bk (Wk ) ∩ (((Zkc )≈ )0 )c ) ∪ (((Zkc )≈ )0 )(k+1) . The reason for this slight departure from the construction of Sect. 4 [3] is that we want to have X1 contained in the k +1st domain. As it has been noted before the difference is unessential, it means that we take cubes by one scale larger on the domain ((Zkc )≈ )0 ∩ck+1 . Because of the localization in (θ, h) we take also the analytic extensions φk+1 (s), αk+1 (s), see Proposition 2.2 [3], and we consider the functions δφk (ψ 0 , φk+1 (s), αk+1 (s), s), δαk (ψ 0 , φk+1 (s), αk+1 (s), s), which we denote for simplicity again by δφk (s), δαk (s) . They are analytic functions of (θ, h), ψ 0 , s, defined on the spaces ˜ ck+1 (Bk+1 ∩ Wk∼ ; δ, ε) × {ψ 0 : |ψ 0 | < δ1 } × {s : |s| < eκ1 }, 9
(4.2)
where δ ≤ c7 , ε ≤ c0 , νk L2 ε ≤ δ, 4B1 K4 δ ≤ 18 , B3 δ1 ≤ 21 c6 . All these constants have been defined in [3] and they appear in the formulations of Propositions 2.1, 2.2 [3]. The functions satisfy the bounds (2.54)[3], from which we conclude the following ones: |δφk (s)|, |∂ η δφk (s)|, |1η δφk (s)|, |δαk (s)| ≤ K3 |ψ 0 | on Zkc .
(4.3)
(1) 1 0 0 The function δφ(1) k can be defined by the equality δφk (ψ ) = lim t→0 t δφk (tψ ), hence we define
1 lim δφk (tψ 0 , s), δφk,2 (s) = δφk (s) − δφ(1) δφ(1) k (s) = t→0 k (s). t The above functions satisfy the bounds (4.3) also, the second with the factor 2K3 instead of K3 . This is not enough, because δφk,2 (ψ 0 , s) is at least of second order in ψ 0 . We get an improved bound using the analyticity with respect to ψ 0 and writing
24
T. Balaban
δφk,2 (ψ 0 , s) =
2 2πi
Z
Z
1
dt(1 − t) 0
dτ |τ |=r
1 δφk (τ ψ 0 , s), (τ − t)3
with r > 1. The same formula holds for δαk,2 (ψ 0 , s). For simplicity we replace the bound 21 B3−1 c6 on δ1 by C3 c7 , which is ≤ 21 B3−1 c6 . We take r = C|ψ3 c0 |7 above, and we assume that |ψ 0 | < 16 C3 c7 . Simple estimates of the above formula yield the bounds |δφk,2 (s)|, |∂ η δφk,2 (s)|, |1η δφk,2 (s)|, |δαk,2 (s)| ≤ 2K3 (C3 c7 )−1 |ψ 0 |2 on Zkc . (4.4) (1) Substituting the analytically extended functions δφ(1) k (s), δφk,2 (s), δαk (s), δαk,2 (s) into the formula (2.27)[4] for V (k) (z) we obtain an analytic function V (k) (z; s) satisfying the bound (4.5) |V (k) (z; ψ 0 , s)| ≤ 9Ld K32 (C3 c7 )−1 |ψ 0 |3
on the spaces (4.2) with δ1 ≤ 16 C3 c7 . The third order derivative of this function satisfies then the bound 3 d ∂3 (k) 0 0 0 0 (k) 0 0 V , s), δψ , δψ , δψ V (z; ψ + tδψ , s)| (z; ψ = t=0 0 0 0 3 ∂ψ ∂ψ ∂ψ dt Z 3! dτ (k) 0 0 ≤ 6 · 36Ld K32 (C3 c7 )−1 |δψ 0 |3 = V (z; ψ + τ δψ , s) 4 2πi |τ |=r τ (4.6) C3 c 7 1 C3 c7 and r = 9|δψ for arbitrary δψ 0 , if |ψ 0 | < 18 0 | . Finally, we consider the first term on the right-hand side of (4.1). It is the sum of such expressions with V (k) replaced by V (k) (z). These we extend analytically in the way described above, extending also 1 the operators C (k) 2 in s, and the parameter σ to a complex disc. Let us recall that the 1 operator C (k) 2 is extended in the same way as the functions δφk , δαk . The variables φ0 , α0 are replaced by φk+1 (s), αk+1 (s). Thus we obtain the function 3 Z 1 1 ∂ − 21 1 0 0 2 0 −2 (k) (k) 21 3 (k) 21 dt (1 − t ) V (s)ψ, s), ⊗ tC (s)ψ . (z; t tβk σC −βk σ 2 0 ∂ψ 03 (4.7) 1 C3 c7 . The constant C3 is rather large, It is analytic on the spaces (4.2) with δ1 ≤ 18 for simplicity we assume that C3 ≥ 36, and the condition on δ1 can be replaced by the stronger one δ1 ≤ 2c7 . By (4.6) and Proposition 3.1 [3] the function (4.7) can be bounded by −1
βk 2 |σ|K32 Ld
1 3 3 1 −1 B |ψ| < βk 2 p31 (βk )|σ|B53 K32 Ld . c7 5 c7
Now we can construct a localization expansion of the function (4.7) for s = 1 following the proof of Proposition 4.3[3], with a slight modification again. We write the expansion (4.41)[3], or (4.43)[3] with the definition (4.42)[3], but we perform the resummation (4.45)[3] for a different domain Y . Now the part of the generating set contained in the boundary layer Wkc ∩ Wk∼ , i.e. the part Bk (Wk ) ∩ Wkc ∩ Wk∼ , has been introduced for an auxiliary technical reason, as a way of introducing Dirichlet type boundary conditions for the background configurations, so it is completely unimportant for the expansion. We define a generating set B0k+1 as the set obtained from Bk+1 by taking 0k+1 = (Wk∼ )0 instead of k+1 , and we take the set of localization domains Dk+1 (0k+1 ) = {Y ∈ Dk+1 : Y ⊂ 0k+1 }. A domain Y1 in (4.43)[3] determines uniquely a domain Y in Dk+1 (0k+1 ),
Renormalization and Localization Expansions
25
and we perform the resummations (4.45)[3] for these domains Y . It is easy to check that all the remaining considerations of Sect. 4[3] hold for d˜k+1 replaced by dk+1 , and we obtain the corresponding modified Proposition 4.3[3] with the localization expansion X V (k) (z, Y ), (4.8) ((4.7) for s = 1) = Y ∈Dk+1 (0k+1 ):z∈Y
where a term V (k) (z, Y ) is an analytic function of (θ, h) restricted to the domain Y , and satisfying the bound −1
|V (k) (z, Y )| < βk 2 p31 (βk )|σ|B53 K32 Ld −1
1 exp(−2κdk+1 (Y )), c7
(4.9)
−1
if |t0 tβk 2 σC (k) 2 (s)ψ| < βk 2 p1 (βk )|σ|B5 ≤ 2c7 . 1
It is also an analytic function of σ defined on the disc determined by the last condition. In the future we will have to assume that the constant in front of the exponential above is sufficiently small, which yields a much stronger condition than the last one. For a given Y we resum also over all points z ∈ TL(k+1) ∩ Zkc ∩ Y , hence we obtain X X (the first term in the definition (4.1)) = V (k) (z, Y ) . Y ∈Dk+1 (0k+1 )
(k+1) z∈TL ∩Zkc ∩Y
(4.10) This is the desired localization expansion; a term of this expansion is given by the sum in the last parentheses. To estimate this sum we prove at first the following general inequality holding for localization domains X ∈ Dk , for an arbitrary k, |X| ≤ ((2L + 3)M )d (1 + dk (X)) ≤ (3LM )d (1 + dk (X)).
(4.11)
To prove it we take a tree graph 0 in the definition (2.27)[1] and we prove the inequality 1 |0|. Take a vertex v1 ∈ 0 and consider all paths starting (4.11) with dk (X) replaced by M at v1 and ending at some vertex of 0. Take the longest one and denote it by 01 . Assume that |01 | ≥ M , the case |01 | < M is simple and will be discussed at the end of the proof. We choose an orientation of the path 01 considering v1 as an initial point, and we choose a sequence of points x1,0 = v1 , x1,1 , . . . , x1,n(1) ∈ 01 such, that the part of the path contained between two successive points x1,j , x1,j+1 , and denoted by 01 (x1,j , x1,j+1 ) has a length equal to M , i.e. |01 (x1,j , x1,j+1 )| = M, j = 0, 1, . . . , n(1) − 1. The part of the path between the point x1,n(1) and the end-point of 01 has a length < M . For each point x1,j in the sequence, 1 ≤ j ≤ n(1), take a cube 1,j of the size (2L + 1)M , which is a union of large cubes, and which contains the point x1,j in its central large cube. Then the part 01 (x1,j−1 , x1,j ) ∪ 01 (x1,j , x1,j+1 ) of the path is contained in the cube of the size 3M in the center of 1,j and any LM -cube, which is a union of large cubes and which intersects this part of the path, is contained in 1,j . We write this conclusion as follows: n(1) [ [ 1,j , and { : is an LM-cube intersecting 01 } ⊂ j=1
26
T. Balaban
|
[
{ : is an LM-cube intersecting 01 }| ≤
n(1) X
|1,j |
j=1 n(1) X 1 1 = ((2L + 1)M ) |01 (x1,j−1 , x1,j )| ≤ ((2L + 1)M )d |01 |. M M d
j=1
Consider now all vertices of the graph 01 , and all paths of the graph 0 starting at these vertices and disjoint with 01 (more precisely intersecting 01 at the starting point only). Let 02 be a path of maximal length, starting at some vertex v2 . We assume again that |02 | ≥ M , and we repeat the above construction for 02 . Then we consider all vertices of the graph 01 ∪02 and all paths of 0 starting at these vertices and disjoint with 01 ∪02 . We choose again a path of maximal length. The induction should be clear now. After p steps we obtain p paths 01 , 02 , . . . , 0p such that 0i intersects others at most at some vertices, and |0i | ≥ M . On each 0i we have a sequence of points vi = xi,0 , xi,1 , . . . , xi,n(i) , and cubes i,1 , . . . , i,n(i) , with properties described in the case i = 1, such that [
{ : is an LM-cube intersecting
p [
0i } ⊂
i=1
|
[
{ : is an LM-cube intersecting
p [ i=1
= ((2L + 1)M )d
p n(i) [ [
i,j , and
i=1 j=1
0i }| ≤
p X n(i) X
|i,j |
i=1 j=1
p p X n(i) X 1 1 [ |0i (xi,j−1 , xi,j )| ≤ ((2L + 1)M )d | 0i |. M M
Sp
i=1 j=1
i=1
Moreover, the graph i=1 0i is contained in a union of cubes of the size Sp 3M with centers at the centers of the cubes i,j . Take again all vertices of the graph i=1 0i and all paths of 0 starting at the vertices and disjoint with the graph. The construction is finished when there are no paths of a length ≥ SpM . Each point of the graph 0 can be connected by a path with a point in the graph i=1 0i , and a length of this path is < M . Hence each point of 0 belongs to a cube of the size 5M and with a center at a center of one of the cubes i,j . Thus if we take an LM-cube intersecting 0, then it is contained in one of ∼ a union the cubes ∼ i,j . Let us recall that for a localization domain Y we denote by Y of all large cubes contained in Y , or touching Y . The above discussion does not cover the case p = 0, i.e. when at the beginning we have |01 | < M . Then the whole graph 0 is contained in a cube of the size 3M and containing the vertex v1 in the central large cube. By definition the domain X is a union of LM-cubes, and each of these cubes intersect 0. Thus we have X⊂
[
{ : is an LM-cube intersecting 0} ⊂ 0 ∪
p n(i) [ [
∼ i,j ,
i=1 j=1
1 1 [ | 0i | < ((2L + 3)M )d (1 + |0|). M M p
|X| ≤ ((2L + 1)M )d + ((2L + 3)M )d
i=1
Taking the infimum over the tree graphs 0 we obtain the desired inequality (4.11). Notice also that it cannot be essentially improved. We can construct arbitrarily large domains
Renormalization and Localization Expansions
27
for which we have almost the equality in (4.11) modulo an unimportant constant, in fact it can be easily seen that we have the inequality M −d |X| ≥ dk (X) holding quite generally. The inequality (4.11) and the bounds (4.9) yield a bound of a term of the localization expansion. We would like to write it in terms of powers of β and η, using the inductive hypothesis (H.6)[4]. We have the bound pn1 (β) ≤ An1 c2 (np1 , α)β α holding for any α > 0 and β large enough, e.g. β ≥ eA0 . It is easy to find a formula for c2 (np1 , α), 1 np1 1 np1 , or to ( np , but it is unimportant. for example we can take it as equal to ( 2np eα ) α ) Using this bound and the inductive assumption (H.6)[4] with c8 small enough we obtain the bounds X α1 1 − 1 +α1 d−2 −α1 (k) ) β 2 η 2 V (z, Y ) < 2 · 3d A31 B53 K32 L2d M d c2 (3p1 , |σ|. d − 2 c7 c z∈Y ∩Zk
(4.12) · exp(−(2κ − 1)dk+1 (Y )) = const.β
− 21 +α1
η
d−2 2 −α1
|σ| exp(−(2κ − 1)dk+1 (Y )), c
˜ k+1 (Bk+1 ∩ Y ; δ, ε), where α1 can be chosen arbitrarily small. They hold on the spaces 9 where δ ≤ min{c7 , (32B1 K4 )−1 }, ≤ c0 , νk L2 ≤ δ, on the domain {ψ : |ψ| < 1 α1 ) c17 β − 2 +α1 p1 (βk )} of the characteristic function χ(k) and on the disc {σ : B5 c2 (p1 , d−2 d−2 2 −α1
|σ| ≤ 1}. Notice that if we demand that the expression in front of the exponential in (4.12) is ≤ 1, then this is a much stronger condition than the one defining the disc, so σ certainly belongs to the disc. Actually we will have to assume that the expression is sufficiently small. We will discuss later the corresponding restrictions again. Notice also that by the assumption νk ≤ ν ≤ 78 L−2 of Theorem 1 we have νk L2 ≤ 78 < 1. Hence the ˜ ck+1 (Bk+1 ∩ Y ; δ2 , δ2 ), where δ2 = min{c7 , (32B1 K4 )−1 }, satisfy the conditions spaces 9 formulated above. This means that they are the admissible analyticity domains, on which the bounds (4.12) hold. We have the inclusions η
c
c
˜ k+1 (Bk+1 ∩ Y ; 3εk , 3k ) ⊂ 9 ˜ k+1 (Bk+1 ∩ Y ; δ2 , δ2 ), if 3εk ≤ δ2 , 4c (Y, Bk+1 ; {εj }) ⊂ 9 discussed in Sect. 3 [1], so the spaces 4c (Y, Bk+1 {εj }) are also the admissible analyticity domains if εk ≤ 13 δ2 . Consider the second term in (4.1). A most important part of a construction of its localization expansion is covered again by Proposition 4.3 [3]. In order to apply it we have to reconsider Proposition 3.10 and Corollary 3.11 in [1]. The point is that we do not have the action Ek on the whole lattice, but the restricted action Ek (Zkc ) given by the formulas (1.7), (1.8) [5] in (H.2) [5]. In deriving the representations (3.126), (3.127) [1] we have used the fact that some terms are cancelled because of symmetries valid on the whole lattice. Now they are not, and we have to check if we can still interpret them as “irrelevant” terms which can be included into the sum in (3.127)[1]. Lemma 3.8[1] is again a basis of the analysis. We take a term E (j) (y, X; ψj ) in the sum (1.8) [5] and we apply the lemma with σ = C0 Lj η, ε = εk , assuming that j ≤ k − n1 . Let us recall that n1 was defined in [1] as a smallest integer satisfying the inequality (3.62)[1]. We obtain the representation (3.104)[1], and we sum these representations over the domains X ∈ Dj , X ⊂ (Zkc )≈ , y ∈ X, dj (X) ≤ d(ρ) = 2dC0Kα1 Lα M L(k+1)(1+α) . Then we add to both sides the sum over the remaining domains in (1.8) [5]. We obtain the following formula corresponding to (3.109)[1]:
28
T. Balaban
X
E (j) (y, X; ψj ) = V (j) (ψj (y))
X∈Dj :y∈X⊂(Zkc )≈
X
−
E (j) (y, X 0 ; ψj (y))
X∈Dj (ξZd ):dj (X 0 )>d(ρ) or X 0 ∩((Zkc )≈ )c 6=∅
X 1 (j) (j) 2 2 + V (y, x)(ψj (x)−ψj (y))+V2 (y, x)(νj h · (ψj (x))0 −νj h · (ψj (y))0 ) 2 1 x∈(Zkc )≈ D E X 1 V1(j) (y, ·, X), χ(Zkc )≈ (ψj2 (·) − ψj2 (y)) − 2 X∈Dj :y∈X,dj (X)>d(ρ) or X∩((Zkc )≈ )c 6=∅ D E (j) + V2 (y, ·, X), χ(Zkc )≈ (νj h · (ψj (·))0 − νj h · (ψj (y)0 )) 2 d d X X 1 (j,∞) (j,∞) (j,∞) −1 − V1 + ν j V2 ) ψ )(y) (∂ + (V0 µ j 2 2 µ=1 µ,ν=1 D E X V0(j) (y, ·, ·, X 0 ), x1,µ − yµ , x2,ν − yν X 0 ∈Dj (ξZd ):y∈X 0 ,dj (X 0 )>d(ρ) or X 0 ∩((Zkc )≈ )c 6=∅
−
D
V1(j) (y, ·, X 0 )
−
νj V2(j) (y, ·, X 0 ), (xµ
+
E
− yµ )(xν − yν )
X
(∂µ ψj )(y) · (∂ν ψj )(y)
(j) Eirrel (y, X; ψj )
X∈Dj :y∈X⊂(Zkc )≈ ,dj (X)≤d(ρ)
+
X
E (j) (y, X; ψj ).
X∈Dj :y∈X⊂(Zkc )≈ ,dj (X)>d(ρ)
(4.13) By the equality (3.125)[1] the fifth term on the right-hand side is equal to 0, and the third term is cancelled by the corresponding term in the difference (1.8) [5]. Terms of the third sum on the right-hand side with X ⊂ (Zkc )≈ are combined with the corresponding terms of the last sum, as in (3.116)[1], and their sums, or rather differences in this case, satisfy the same bounds as the “irrelevant” terms in the fifth sum, i.e. the bounds (3.105)[1] or (3.128)[1]. We denote them in the same way as the terms of the fifth sum, and we combine the two sums, as in (3.120)[1]. There are still some terms left in the third sum, we obtain the sum over all domains X ∈ Dj such that y ∈ X and X ∩ ((Zkc )≈ )c 6= ∅. Because of this the terms contribute to the boundary terms, and also the exponential factors in the bounds (3.77),(3.80)[1] yield arbitrarily high powers of βk−1 and Lj η, as it follows from the bounds dj (X) ≥ (Lj η)−1 (Rk − 2(L − 1)) > (Lj η)−1 + (log βk a)2 . The first term on the right-hand side of (4.13) is an irrelevant local term, V (j) (ψj (y)) = (j) Virrel (ψj (y)), by Proposition 3.4[1]. The function V (j) , like the renormalized coefficients, is defined independently of any local geometric structure. It is defined globally by the corresponding effective action on the whole lattice, so we combine this term with the L−1 (j) term Eirrel (y, 0 ; ψj ), where 0 = ∼ 2 , ∈ πj , y ∈ . Finally we consider the first and fifth sums. They are sums over domains in the whole lattice, and therefore the condition X 0 ∩ ((Zkc )≈ )c 6= 0 demands an explanation, the domain Zkc is in the torus T . We simply take the domain X 0 and “wrap” it around the torus starting at the point y. We obtain a domain X = projT (X 0 ) in the torus, and we assume that the above condition is
Renormalization and Localization Expansions
29
satisfied for this domain. The considered sums define also local functions of ψj , more precisely functions depending on ψj restricted to st(y), but this time they depend on the geometric structure determined by Ak , more precisely on the large field region Zk , so we (j) cannot combine them with the term Eirrel (y, 0 ; ψj ). Terms of the sums can be obviously bounded by arbitrary powers of Lj η, or βk−1 , or both, so they are irrelevant. We resum them over domains determining a fixed X ∈ Dj , and for X ⊂ (Zkc )≈ we combine the sum with the corresponding term in one of the last two sums in (4.13). For X such that X ∩ ((Zkc )≈ )c 6= ∅ we combine the sum with the corresponding term of the third sum on the right-hand side of (4.13). After all these definitions we obtain the representation X X 1 (j) V1 (y, x)(ψj2 (x) − ψj2 (y)) E (j) (y, X; ψj ) − 2 c X∈Dj :y∈X⊂(Zk )≈ x∈T (j) ∩(Zkc )≈ (4.14) X (j) (j) +V2 (y, x)(νj h · (ψj (x))0 − νj h · (ψj (y))0 ) = Eirrel (y, X; ψj ), X∈Dj :y∈X
where the terms on the right-hand side are analytic functions on the space 9cj (C0 Lj η, εk ) with the additional condition (3.107)[1]. The term corresponding to a domain X depends on ψj , h restricted to X ∩ (Zkc )≈ , and for X ⊂ (Zkc )≈ it satisfies the fundamental bound (3.128)[1]. For X such that X ∩ ((Zkc )≈ )c 6= ∅ it satisfies a much better bound, with a constant in front of the exponential which can be chosen smaller than any power of Lj η and βk−1 for βk large enough. For example we can take it as equal to (Lj η)d+1 βk−1 . The above statements on the representations and the bounds hold for j ≤ k − n1 , but they obviously hold also for k − n1 < j ≤ k, as in the inequality (3.131)[1], using the definition of n1 and the localization expansions of the functions V1(j) , V2(j) . Applying the representations (4.14) we write the second term in (4.1) as a sum of terms Z Z 1 1 dτ (j) −1 ˜ + ψ 0 )), dt0 E (y, X; ψk(j) (ψ (k) (θ) βk 2 σ 2 irrel 2πi τ |τ |=r 0 (4.15) −1
−1
ψ 0 = βk 2 σt0 tC (k) 2 ψ + τ tC (k) 2 ψ = (βk 2 σt0 + τ )tC (k) 2 ψ, 1
1
1
the sum over j = 1, . . . , k, y ∈ T (j) ∩ Zkc , X ∈ Dj such that y ∈ X. The functions (j) Eirrel (y, X; ψj , h) are analytic on the spaces {(ψ, h) : (ψ, h) ∈ 9cj (X ∩ (Zkc )≈ ; C0 Lj η, εk ), |∂ 2 ψ| < K1 Cα1 (Lj η)2−α1 εk } for j ≤ k − n1 , and they satisfy the bounds (3.128)[1]. For j > k − n1 , they are analytic on the spaces 4cj (Bj (X); 1, j ), and they satisfy the bounds in (H.4)[4]. Now we apply Proposition 4.3[3] to the function (4.15), or rather to the underintegral function, with a slight modification. To be in the framework of this proposition we use again the generating set (Bk (Wk ) ∩ (((Zkc )≈ )0 )c ) ∪ (((Zkc )≈ )0 )(k+1) as the basis of the construction of the localization extension. This is much more important here than in the case of the term V (k) (Zkc ), we need the inclusions X ⊂ X1 ⊂ (k + 1st domain) for the exponential decay property (4.52)[3], otherwise we would not have the improved factor 2κ in front 1 of the function dk+1 . This operator C (k) 2 remains unchanged. We use the fact that its construction and bounds are uniform with respect to k+1 . Also the configuration θ is defined on the set Bk+1 . Lemma 4.2[3] holds for the function in (4.15) with a slight modification. The first space in (4.33)[3] is replaced by the space 4c (Wk∼ , Bk+1 ; {εj }).
30
T. Balaban
This is connected again with the fact that X is not contained in k+1 generally. It may intersect ck+1 and we need slightly stronger conditions on θ restricted to a proper neighborhood of ∂k+1 . This modification of the lemma follows from a proof of a more general result of this type given in the next paper, see Lemma 2.5 there. The configuration −1
ψ 0 in (4.15) can be bounded by (βk 2 |σ| + r)B5 p1 (βk ) = δ1 , and the modified lemma holds if this δ1 satisfies the condition (4.38)[3]. Hence if the following two conditions are satisfied: 16B5 K2 K3 Lα
1 − 21 1 βk |σ|p1 (βk ) ≤ η α , 16B5 K2 K3 Lα p1 (βk )r = η α , αα0 αα0
(4.16)
the last equality determines the radius r in (4.15). Using again the bound p1 (β) ≤ c2 (p1 , α)β α and the inductive assumption (H.6)[4] with c8 small enough we obtain that the above inequality is satisfied if 32B5 K2 K3 Lα c2 (p1 ,
1 − 1 +α1 γ−α1 α1 ) β 2 η |σ| ≤ 1. d − 2 αα0
(4.17)
This condition yields restrictions on β and |σ|. We can use a fraction of the negative power of β to make the constant in front smaller than 1, and then the condition takes on a simpler form involving powers of β and η together with |σ|. From this we determine a restriction on |σ|. We will discuss it again later, when we will have all conditions on β and |σ|. Now we assume (4.17) and we apply the proof of Proposition 4.3[3] in the same way as in the construction of the expansion (4.8), with the same resummation (4.45)[3] over the domains Y1 determining a fixed domain Y ∈ Dk+1 (0k+1 ). We obtain a localization expansion of the function (4.15) of the form X E (j) (y, X, Y ; θ, h, ψ), (4.18) (4.15) = Y ∈Dk+1 (0k+1 ):X1 ⊂Y
The terms of this expansion are analytic functions of (θ, h) on the spaces 4c (Y, Bk+1 ; {εj }). They depend on θ, h, ψ restricted to Y , and they satisfy the bounds 1 p1 (βk )η −α E αα0 · exp(−κ0 dj (X) − 2κdk+1 (Y )), −1
|E (j) (y, X, Y ; θ, h, ψ)| < βk 2 |σ|16B5 K2 K3 Lα
(4.19)
where E is a bound of the function inside the integral in (4.15). This bound is equal either to Kα,α1 (Lj η)d+α3 E0 for j ≤ k − n1 , where Kα,α1 is given by (3.129)[1], or to E0 for j > k − n1 . Let us recall also that X1 is a domain in Dk+1 containing the 0 domain X. It is defined as a union of L2 M -cubes from the cover πk+1 , containing an j 0 LM L η-cube from the cover πj contained in X. To get a localization expansion of the second term in (4.1) we sum up all the localization expansions (4.18), and then we do the partial resummation of the terms with a fixed localization domain Y ∈ Dk+1 (0k+1 ). We obtain the sum k X
X
X
j=1 y∈Y
∩T (j) ∩Zkc X∈Dj :y∈X,X⊂(Zkc )≈ ,X1 ⊂Y
E (j) (y, X, Y ; θ, h, ψ),
(4.20)
which is equal to the term of the localization expansion corresponding to the domain Y . It is an analytic function of (θ, h) on the space 4c (Y, Bk+1 (Y ); {εj }), and of ψ on the
Renormalization and Localization Expansions
31
domain {ψ : |ψ| < p1 (βk )} and it depends on θ, h, ψ restricted to Y . We can estimate it in the same way as in (3.131)[1], using (4.19) and the bounds leading to (4.17), and we obtain the bound 1 1 α1 α 2d d ) Kα,α1 32B5 K0 K2 K3 L L (3M ) c2 (p1 , d − 2 αα0 α3 1 1 (4.21) +2(4dC0 K1 L1+α M )d β − 2 +α1 η γ−α1 |σ|E0 exp(−(2κ − 1)dk+1 (Y )) α = const.β − 2 +α1 η γ−α1 |σ|E0 exp(−(2κ − 1)dk+1 (Y )). 1
Later we will have to assume that the constant in front of the exponential is sufficiently small, and this will be the most restrictive condition on β and |σ|, much more restrictive than (4.17). Let us finish at first the discussion of the localization expansion for (4.1). The third term there can be dealt with in exactly the same way as the second term. We represent Fk by the sums in (H.3) [5], and we write each term in the form (4.15). There are two types of terms connected with the functions g(x) · ψ0 (x), g(x) · M(j) (x, X; ψj , h, g),
(4.22)
and the sum is over x ∈ j = 1, . . . , k, X ∈ Dj such that x ∈ Xand X ⊂ (Zkc )≈ . We apply Proposition 4.3[3] as above, assuming (4.17), and we obtain localization expansions of the form (4.18), which we resum as in (4.20), the sum over y in (4.20) replaced by a sum over x ∈ Y ∩ T1 . The resummation yields a localization expansion of the third term in (4.1), and the term of this expansion corresponding to the domain Y is an analytic function of (θ, h), ψ defined on the same space as the expression (4.20), and of g defined on the space {g : g is defined on T1 ∩ Y and has values in Cn , kgk`1 < 1}. This term can be bounded by T1 ∩Zkc ,
32B5 K2 K3 Lα c2 (p1 ,
1 − 1 +α1 γ−α1 α1 3 ) β 2 η |σ|( + 2K0 c9 ) exp(−2κdk+1 (Y )) d − 2 αα0 2
= const.β − 2 +α1 η γ−α1 |σ| exp(−2κdk+1 (Y )), 1
(4.23) and this bound has again the same general form as the bound (4.21). We combine the three localization expansions and we obtain a localization expansion of the function (4.1). We write it as X 1 −1 (k) (k) (Zkc ; βk 2 σ, C (k) 2 ψ) = Ut,u (Y ; ψ), (4.24) Ut,u Y ∈Dk+1 (0k+1 ):Y ∩k+1 6=∅
and the term of this expansion corresponding to a localization domain Y is an analytic function of (θ, h), ψ, g on the space 4c (Y, Bk+1 ; {εj }) × {ψ : |ψ| < p1 (βk )} × {g : kgk`1 < 1},
(4.25)
depending on these variables restricted to the domain Y . It satisfies the bound (k) (Y ; ψ)| < const.β − 2 +α1 η γ−α1 |σ| exp(−(2κ − 1)dk+1 (Y )) |Ut,u 1
(4.26)
with a constant which is a sum of the constants in (4.12),(4.21),(4.23). The positive number α1 above can be chosen as arbitrarily small. The above bound holds under the assumption (4.17), but now we assume that the expression in front of the exponential
32
T. Balaban
above is sufficiently small. A simple way to assure this is to take β and σ satisfying the conditions const.β − 4 +α1 ≤ 1, β − 8 η γ−α1 |σ| ≤ 1. 1
1
(4.27)
Then the expansion can be bounded by β − 8 , which is obviously arbitrarily small for β large enough. The above conditions are stronger than any condition formulated previously in this section, in particular (4.17). Let us remark that there is nothing special about the powers of β above. We could divide the power in (4.26) in many other ways among the three factors. We formulate the obtained localization results in the lemma. 1
−1
1
(k) (Zkc ; βk 2 σ, C (k) 2 ψ) given by the formula (4.1) has the Lemma 4.1. The function Ut,u localization expansion (4.24), whose terms can be extended to analytic functions of 1 (θ, h), ψ, g and σ, defined on the spaces (4.25) and on the disc {σ : β − 8 η γ−α1 |σ| ≤ 1}, depending on (θ, h), ψ, g restricted to the corresponding localization domains Y , and satisfying the bounds
(k) (Y ; ψ)| < ε exp(−(2κ − 1)dk+1 (Y )), |Ut,u
(4.28)
where ε > 0 can be chosen arbitrarily small. For example we can take ε = β − 8 and assume that β is large enough. 1
Let us discuss briefly constructions of localization expansions of the other expression defining the remaining measures in Sect. 3 [5]. In (3.10) [5] we have the sums of terms − 21 (k) 1 (k) ˜ C 2 ψ, h, g) over X ∈ Dk , X ⊂ Z c , and p ≤ n, where n ≤ m. R(k) p (X; ψ (θ) + β k
k
Notice that now we do not have the differences δR(k) p , but it does not matter because these terms are small anyway by (H.4) [5]. Notice also that for X ⊂ ck+1 they are equal to R(k) p (X; ψk ), so they do not depend on the fluctuation variable ψ and can be separated from the expectation value (3.11) [5]. We construct localization expansions for the remaining terms in exactly the same way as for (4.15); we use the same localization extension and the proof of Proposition 4.3[3]. We obtain expansions of the form (4.18) with terms satisfying the bounds (4.19), but with the constant in front of the exponential replaced by βk−p−1 . Actually the construction and the conditions are simpler now. We −1
do not introduce the parameter σ, so we take δ1 = βk 2 B5 p1 (βk ) and we have (4.16), (4.17) with |σ| replaced by 21 . They both hold because we assume the much stronger condition (4.27) on β. We resum the expansions over X and p, with a fixed domain Y , and we obtain a localization expansion of the form (4.24) satisfying Lemma 4.1, where −p− 21
the bounds (4.28) hold with the constant mK0 (3L2 )d βk−p−1 < βk ε=
, so we can take
−p− 1 βk 2 .
The measure in the expectation value (3.9) [5] has a most complicated form. The expression in the exponential is the sum of the expression analyzed above, with t = u = 1 and n = m, and the expression inside the expectation value in (3.9) [5] multiplied by the parameter u. This expression can be written in the following form:
Renormalization and Localization Expansions
33
D E 1 1 −1 V (k) (Zkc ; ψ) = βk2 ψ, C (k) 2 (aL−2 Q∗ Q + 1(k) )δ0(k) (βk 2 ψ) E 1 D −1 −1 − βk δ0(k) (βk 2 ψ), (aL−2 Q∗ Q + 1(k) )δ0(k) (βk 2 ψ) 2 Z Z 1 1 dτ (k) c − 21 (k) 1 − 21 2 ψ + (−t + τ β )δ0(k) (β dt V (Z ; β C ψ)) + k k k k 2πi |τ |=r1 τ 2 0 Z Z 1 1 dτ − 21 (k) 1 − 21 ˜ 2 ψ−(t + τ )δ0(k) (β dt (Ek +Fk +R(k) )(Zkc ; ψ (k) (θ)+β + k C k ψ)). 2 2πi |τ |=r τ 0 (4.29) We have used here the formulas (3.5), (3.6) [5]. The above expression differs only in some obvious details from the expression (4.1), and it is clear that its localization expansion can be constructed in exactly the same way. We need to discuss only these 1 small differences, and they are connected mainly with the function δ0(k) (βk2 ψ). Let us recall that it is given by the last equality in (2.36) [5], that is by 1 − 21 (k) − 2 (k) 21 (k) 21 0 (k) ˜ (k) 0 −C ( , 0) βk ψ+ ψ (θ)−ψ ( , 0; θ) on 0 , (4.30) δ0 (βk ψ) = C hence it can be bounded by any power of βk−1 for βk large enough, as it has been noticed in Sect. 2 [5]. We introduce the localization parameters into the expressions in (4.29) as before. The extension of the above function is constructed in the obvious way: we take 1 ˜ and the same extensions but with s = 0 outside the usual extensions for C (k) 2 , ψ (k) (θ), 1 the domain Rk+1 (0 ) for C (k) 2 (0 , 0), ψ (k) (0 , 0; θ). For the extended function (4.30) we have the bound (k) − 1 δ0 (β 2 ψ, s) < β −m−4 , (4.31) k k and we take r1 = βkm+2 , r = βkm+3 in (4.29). We construct the localization expansions of the expressions in (4.29) in the same way as before, even with some simplifications because we do not introduce the parameter σ and we have some bounds smaller. For −1
example, the configurations ψ 0 (s) in (4.29) can be bounded by βk 2 B5 p1 (βk ) + (1 + −1
βkm+3 )βk−m−4 < 2B5 βk 2 p1 (βk ) = δ1 , and the corresponding conditions on δ1 are now weaker than in the case of (4.1). Terms of the localization expansions satisfy stronger −1
bounds now, (4.9) holds with βk 2 |σ| replaced by 8βk−m−2 , and the corresponding change for (4.12), (4.19) holds with the whole constant in front of the exponential replaced by βk−m−3 E, and the corresponding change in the bound (4.21), similarly for (4.23). Localization expansions of the first two expressions on the right-hand side of (4.29) can be constructed in the same way as for V (k) , and they satisfy the same bounds. Thus we obtain Lemma 4.2. The function V (k) (Zkc ; ψ) given the formula (4.29) has the localization expansion of the form (4.24), whose terms V (k) (Y ; ψ) have analytic extensions onto the spaces (4.25), depend on (θ, h), ψ, g restricted to Y , and satisfy the bounds (4.28) with −m− 23
ε = const.βk−m−2 , or with ε = βk
.
Finally we consider the expectation value (3.2) [5]. The measure is determined by the exponential on the left-hand side of (3.1) [5], in which the term B 00(k) is multiplied by the parameter u. The expression in the exponential is equal to the sum of the expressions analyzed above and the expression
34
T. Balaban
1
δψ, 1(k) (1 (Wk ) ∩ Zk )δψ 2 1 η ˜ − βk (δφk (δψ))+ + (δφk (δψ))− , ∂ φk+1 (θ) 2 st(Z c )
βk
k
+ uB
− 1 (k) 1 (k) (Zk , Ak ; ψloc (θ) + βk 2 Cloc 2 ψ), − 1 (k) 1 ˜ δψ (k) (θ) ˜ δψ = βk 2 Cloc 2 ψ − δψ (k) (θ),
00(k)
˜ − ψ (k) (θ) on B(3k+1 ). = ψ (k) (θ) loc (4.32) Let us recall that B 00(k) is the sum of the boundary terms in the expansion (1.34) [5] of the inductive hypothesis (H.7) [5] with localization domains X ∈ Dk (modck ), X∩Zk 6= ∅, X ∩ k+1 6= ∅. It is again obvious how to construct localization expansions for the first two terms in (4.32). We pre-localize the first term in cubes 0 ∈ πk+1 , 0 ⊂ k+1 , for example, by multiplying the first factor δψ by χ0 , the second term in the intersections 0∗ ∩ st(Zkc ), we introduce the same localization extensions as before, we apply Proposition 4.3 [3] and perform proper resummations. We obtain localization expansions of the same form (4.24) but with the domains Y satisfying the conditions Y ∩ k+1 6= ∅, Y ∩ Zk 6= ∅. Therefore terms of the expansions can be bounded by arbitrarily large powers of βk−1 using the exponential decay factors. We need to discuss a localization expansion of the last term in (4.32) in more detail, because it is slightly (k) (θ) + different from the previous expansions. Take a boundary term B (k) (X, Ak ; ψloc where
−1
(k) 1
βk 2 Cloc 2 ψ) in the sum defining B 00(k) in (4.32). We have displayed the dependence on the spin variable restricted to B(3k+1 ), but it depends also on all spin variables corresponding to the multi-index Ak and restricted to X ∩ ck+1 , and on h, g restricted to X. By the definition the domain X satisfies the conditions X ∩ k+1 6= ∅, X ∩ Zk 6= ∅, so the exponential factor exp(−dk (Xmod ck )) can be bounded by exp(−Rk ), hence by a large power of βk−1 , and the boundary term can be bounded, for example, by βk−2 exp(−(κ−1)dk (Xmod ck )). At first we consider this term as localized in X ∩k+1 , we introduce the same localization extension as before, and we apply the proof of Proposition 4.3[3]. The domain X ∩ k+1 may be not connected now, it may have several components, but the proof applies without changes, except that the domains Y1 may have also several components, each of them containing at least one component of X ∩ k+1 . To each Y1 we assign the corresponding domain Y ∈ Dk+1 (modck+1 ) determined as in (4.44)[3]. We perform the same resummation (4.45)[3] controlled by the inequality (4.50)[3]. The inequalities (4.48), (4.49)[3] hold with dj (X), d˜k+1 (Y ) replaced by dk (Xmodck ), dk+1 (Y modck+1 ), and we obtain the localization expansion of the above boundary term over the domains Y containing X. Terms of this expansion are analytic functions on appropriate spaces described in (H.7) [5], and can be bounded by βk−2 exp(−κ0 dk (Xmodck ) − 2κdk+1 (Y modck+1 )). We sum up all these expansions for the boundary terms in B 00(k) , and for a fixed Y we resum over the domains X. This contributes the factor K0 M1 d |Y ∩ k+1 | ≤ K0 (3L2 )d (1 + dk+1 (Y ∩ k+1 )) < K0 (3L2 )d exp dk+1 (Y modck+1 ). Thus we have constructed the localization expansion X B 00(k) (Y, Ak ; ψ), (4.33) (4.32) = Y ∈Dk+1 (modck+1 )
whose terms satisfy the above analyticity properties, and the bounds 3 00(k) B (Y, Ak ; ψ) < β − 2 exp(−(2κ − 1)dk+1 (Y modck+1 )). k
(4.34)
Renormalization and Localization Expansions
35
We have finished the constructions of the localization expansions and we have represented the “interaction potentials” of the measures in (3.15), (3.14), (3.11), (3.9) [5] in the form (4.24), with terms satisfying the bounds (4.28). For the measure in (3.2) [5] this “potential” is a sum of two expressions, the first of the form (4.24), the second of the form (4.33), with terms satisfying the corresponding bounds (4.28), (4.34). This yields the most important parts of constructions of the complete localization expansion discussed in the propositions of Sect.3 [5]. The remaining parts are quite universal and are obtained by applying a form of a “cluster expansion”, see [7,9] for a general discussion. Proof of Proposition 3.4 [5]. We start again with the most important, and most difficult expectation values (3.14), (3.15) [5], which we discuss in detail, and then we discuss briefly the remaining ones. We simplify the notations in Sect.3 [5] omitting the domains k+1 , 00k+1 , the spin variables and the “primes”. For example, we write E1k+1 (z) instead of E10(k+1) (1k+1 (z), k+1 , 00k+1 ; θ, ψ) in (3.17) [5]. The statements of Proposition 3.4 [5] concerning the functions E10(k+1) (Zkc ∩ ck+1 ), E00(k+1) (z) follow from the corresponding statements for E1(k+1) (z), z ∈ Zkc ∩ T (k+1) , and from the results of Sect. 3[3] on the function D(k) , so we consider now E1(k+1) (z). It can be written as the expectation value Z E1(k+1) (z) =
Z
1
ds 0
−1
1
(k) dµs,0 (ψ)Us,0 (z; βk 2 , C (k) 2 ψ),
(4.35)
where −1
1
(k) (z; βk 2 σ, C (k) 2 ψ) Us,0 Z 1 ∂3 − 21 − 21 0 0 (k) 0 (k) 21 = βk σ 1 dt (1 − t ) V (z); β σt sC ψ , k+1 k ∂ψ 0 ∂ψ 0 ∂ψ 0 0 1 1 1 sC (k) 2 ψ, sC (k) 2 ψ, C (k) 2 ψ ∂ − 21 − 21 (k) ˜ (k) 21 (k) 21 +βk σ Ek ψ ,C ψ . 1k+1 (z); ψ (θ) + βk σsC ∂ψ 0
(4.36)
−1
1
(k) (Zkc ; βk 2 σ, C (k) 2 ψ) This function differs only insignificantly from the function Us,0 given by (4.1). The main difference is that it is localized in the cube 1k+1 (z) instead of Zkc . A localization expansion for this function is constructed in the same way as for the function (4.1). Basically it is the same expansion with some obvious minor changes, like that the domains Y must contain the cube 1k+1 (z). Thus we have the expansion of the form X 1 −1 (k) (k) (z; βk 2 σ, C (k) 2 ψ) = Us,0 (z, Y ; ψ), D0 = Dk+1 (0k+1 ), (4.37) Us,0 Y ∈D 0 :z∈Y
whose terms satisfy all the conditions of Lemma 4.1, including the bounds (4.28). Now we are ready to construct a localization expansion for the function E1(k+1) (z). We substitute the expansion (3.37) [5] into the formula (3.35) [5], and we obtain X Z 1 Z (k+1) (k) ds dµs,0 (ψ)Us,0 (z, Y ; ψ). (4.38) E1 (z) = Y ∈D 0 :z∈Y
0
36
T. Balaban
Consider the term of the above sum corresponding to a localization domain Y0 . The expectation value with respect to the measure dµs,0 is not a localized function of (θ, h), because the “interaction potential” (4.1) of the measure depends on (θ, h) on the whole domain Wk∼ . We write a localization expansion of this expectation value by expanding with respect to the terms of the sum in (4.24). We obtain Z X Y Z 1 ∂ (k) (k) (z, Y0 ; ψ) = dtY (Zs,0 (t))−1 . dµs,0 (ψ)Us,0 ∂t Y 0 D⊂D 0 Y ∈D " # (4.39) Z X 1 (k) (k) (k) 2 · dψχ exp − kψk + tY Us,0 (Y ; ψ) Us,0 (z, Y0 ; ψ). 2 Y ∈D
(k) (t) is given by the integral with respect to Let us recall that the normalization factor Zs,0 (k) ψ above, with the function Us,0 (z, Y0 ; ψ) replaced by 1, and the integration is restricted also to the domain 00k+1 , which we do not write explicitly. Let us define a domain Z by the equality [ Y ∪ Y0 . (4.40) Z= Y ∈D
Generally it is not connected, so we may write it as a union of connected components Z = Z0 ∪ Z1 ∪ . . . ∪ Zn , where Z0 is the component containing the domain Y0 . It is easy to see that the integral with respect to ψ factorizes into a product of integrals with integrations restricted to the components of Z, and the integral of the “free” Gaussian factor χ(k) exp[− 21 kψk2 ] over the complement Z c . The same is true for the normalization (k) (t), and the integrals restricted to the domains Z1 , . . . , Zn and Z c are equal factor Zs,0 to the corresponding integrals for the numerator. Thus these integrals cancel, and the integrations in the expectation value on the right-hand side of (4.39) are restricted to the domain Z0 . This means that this expectation value does not depend on parameters tY for Y ⊂ Z1 ∪ . . . ∪ Zn , so if there are components of Z other than Z0 , then the corresponding term in (4.39) vanishes, because of the derivatives ∂t∂Y . Therefore we restrict the sum in (4.39) to subfamilies D such that the domains Z given by (4.40) are connected. Then they are also localization domains from D0 . The terms in (4.39) corresponding to a domain Z depend on (θ, h) restricted to Z, so the sum has the basic property of a localization expansion. It can be written as a sum over domains Z ⊃ Y0 , and for a fixed Z as a sum over subfamilies D determining the domain Z through (4.40). The last sum defines the term of the localization expansion corresponding to the domain Z, thus we have Z 1 Z X (k) ds dµs,0 (ψ)Us,0 (z; Y0 ; ψ) = E1(k+1) (z, Z, Y0 ), (4.41) 0
Z∈D 0 :Y0 ⊂Z
where E1(k+1) (z, Z, Y0 ) Z 1 1 1 1 ds dtY dτY (Z (k) (Z, τ ))−1 = 2πi |τY |=rY (τY − tY )2 s,0 0 0 0 D⊂D Y ∈D " # Z X 1 (k) (k) · dψ Z χ(k) (Z) exp − kψk2Z + τY Us,0 (Y ; ψ) Us,0 (z, Y0 ; ψ), 2 X 0Z
Y Z
Y ∈D
(4.42)
Renormalization and Localization Expansions
37
and the “prime” over the first sum above means that the summation is restricted to the all subfamilies D determining the domain Z by the equality (4.40). We take the radii 1 rY = ε− 2 exp((2κ − 1 − 5κ0 )dk+1 (Y )) and we obtain the bounds 1
(k) (Y ; ψ)| < ε 2 exp(−5κ0 dk+1 (Y )). |τY Us,0
(4.43)
Now we estimate the function (4.42). We have X
Y 3 1 ε 2 exp(−(2κ − 1 − 5κ0 )dk+1 (Y )). 2 D⊂D 0 Y ∈D " # X 1 ·ε exp(−(2κ − 1)dk+1 (Y0 )) exp ε 2 exp(−5κ0 dk+1 (Y ))
|E1(k+1) (z, Z, Y0 )| ≤
Z ·
0
(4.44)
Y ∈D
1 (k) 2 dψ Z χ (Z) exp − kψkZ sup |Zs,0 (Z, τ )|−1 . 2 D,τ (k)
Consider the product over Y ∈ D of the exponential factors above, and take a graph whose vertices are domains of the set D ∪ {Y0 }, and whose edges are pairs of the 00 00 domains {Y 0 , Y } such that their intersections are non-empty, Y 0 ∩ Y 6= ∅. It is a connected graph, because the domain Z is connected. Take a connected subgraph of this graph, which is a tree graph, and which has the same set of vertices D ∪ {Y0 }. Choose one vertex as an initial vertex, for example take Y0 . This determines an order among vertices of each branch of the tree graph beginning at Y0 , so the edges may be replaced 00 by ordered edges. Take such an ordered edge (Y 0 , Y ) and two admissible tree graphs 00 00 1 1 00 , 0 contained in the corresponding domains, and such that M |00 |, M |0 | are close enough to dk+1 (Y 0 ), dk+1 (Y 00 ). Errors may be chosen to be arbitrarily small. The lengths 00 here are taken in the L−1 η-scale. The intersection Y 0 ∩ Y is non-empty, so it contains 00 a cube from the partition πk+1 , and this cube is contained in two cubes 0 , from 00 00 0 0 0 the cover πk+1 , such that ⊂ Y , ⊂ Y . By the definition of admissible graphs, 00 00 00 see (2.27)[1], 00 intersects 0 and 0 intersects . We choose some points x0 , x in the corresponding intersections, and connect them by one of the shortest paths 0x0 ,x00 . For the length in the L−1 η-scale of this path we certainly have |0x,x0 | < 2dLM , hence 00 0 1 00 00 M |0x0 ,x | < 2dL. We connect the graphs 0 , 0 by the path 0x0 ,x , obtaining the 00
00
connected graph 00 ∪ 0x0 ,x00 ∪ 0 , and we assign the number 2dL to the vertex Y . Doing this for all edges of the considered tree graph we obtain a connected graph 0 0 contained in Z. We can choose a subgraph intersecting every cube from the cover πk+1 of 0 which has the same property, and which is a connected tree graph, so we have dk+1 (Z) ≤
X 1 |0| < (dk+1 (Y ) + 2dL) + dk+1 (Y0 ) + (error) M Y ∈D
(the error may be arbitrarily small). From this we can bound the product of the exponential factors in (4.44) by Y 3 1 e4dLκ ε 2 exp(−κ0 dk+1 (Y )) · ε exp(−6κ0 dk+1 (Y0 )) exp(−(2κ − 1 − 6κ0 )dk+1 (Z)). 2
Y ∈D
38
T. Balaban
The third exponential in (4.44) can be bounded by exp K0 ε 2 M −d |Z|, the volume |Z| taken in the L−1 η-scale. This bound is independent of D, so the sum over D in (4.44) is controlled by the product over Y ∈ D of the exponential factors above. We have X0 Y ε0 exp(−κ0 dk+1 (Y )) 1
D ∞ X 1 ≤ n! n=0
X
n Y
Y ∈D
ε0 exp(−κ0 dk+1 (Yi )) = exp
(Y1 ,... ,Yn ):Yi ⊂Z i=1
X
ε0 exp(−κ0 dk+1 (Y ))
Y ⊂Z
(4.45) 1 ≤ exp K0 ε0 d |Z|, M 1
and we take ε0 = 23 e4dLκ ε 2 in the above bound. Using the inequality (4.11) we can 1 bound further the last exponential by exp 23 K0 e4dLκ (3L)d ε 2 (1 + dk+1 (Z)). The previous 1 exponential can be bounded by exp K0 (3L)d ε 2 (1 + dk+1 (Z)), so combining the two 1 bounds we obtain, for example, the bound exp 2K0 e4dLκ (3L)d ε 2 (1 + dk+1 (Z)). We 1 assume that ε is so small that the constant in the exponent is ≤ 1, i.e. 2K0 e4dLκ (3L)d ε 2 ≤ 1. Then the bound is exp(1 + dk+1 (Z)). Combining the above bounds we obtain the inequality (4.44) with the right-hand side replaced by eε exp(−6κ0 dk+1 (Y0 )) exp(−(2κ − 2 − 6κ0 )dk+1 (Z)) multiplied by the last two expressions. It is not so easy to estimate the last expression, (k) because it means that we have to obtain a lower bound for |Zs,0 (Z, τ )|. It seems that the simplest way to obtain such a bound is to use a cluster expansion to represent the (k) (Z, τ ) in an exponential form. We write “partition function” Zs,0 Z
−1 1 (k) dψ Z χ(k) (Z) exp − kψk2Z Zs,0 (Z, τ ) 2 " # Z X 1 −1 (k) 2 = Z0 (Z) dψ Z χ (Z) exp − kψkZ + U0 (Y ; ψ) , 2
(4.46)
Y ⊂Z
(k) (Y ; ψ), and we put τY = 0 for Y ⊂ Z, Y 6∈ D. Thus the where U0 (Y ; ψ) = τY Us,0 functions U0 (Y ; ψ) satisfy the bounds 1
|U0 (Y ; ψ)| < ε 2 exp(−5κ0 dk+1 (Y )).
(4.47)
We use the cluster expansion in a “polymer” form described in many places, for example in [7,9]. It is now completely standard, and we mention only a few main points, and some conclusions. A first step is the expansion (4.39), which is now much simpler, and the derivatives can be calculated explicitly. After a resummation we obtain a “polymer” expansion X U(Z1 ) · . . . · U(Zn ), (4.48) (4.46) = {Z1 ,... ,Zn }
where the sum is over sets of disjoint localization domains {Z1 , . . . , Zn } such that Z1 ∪ . . . ∪ Zn ⊂ Z. The functions U(Z 0 ) are given by simple explicit formulas and satisfy the bounds
Renormalization and Localization Expansions
39
|U(Z 0 )| < 2 · 3d eK0 Ld ε 2 exp(−(4κ0 − 1)dk+1 (Z 0 )). 1
(4.49)
These bounds assure that we can exponentiate the expansion (4.48) ∞ X 1 (4.46) = exp n! n=1
X
ρT (Z1 , . . . , Zn )U (Z1 ) · . . . · U(Zn ),
(4.50)
(Z1 ,... ,Zn )
and the series in the exponent is convergent. See one of the references [7,9] for a defi1 nition of the functions ρT . In our case the series can be bounded by O(1)ε 2 M −d |Z| < 1 O(1)(3L)d ε 2 (1 + dk+1 (Z)), and for ε sufficiently small we conclude that |(4.46)| > e−1 exp(−dk+1 (Z)).
(4.51)
This completes the estimate of the function E1(k+1) (z, Z, Y0 ), and we obtain |E1(k+1) (z, Z, Y0 )| < e2 ε exp(−6κ0 dk+1 (Y0 )) exp(−(2κ − 3 − 6κ0 )dk+1 (Z)).
(4.52)
The last step is to combine the expansions (4.38),(4.41), which gives us the localization expansion X E1(k+1) (z, Z), where E1(k+1) (z) = Z∈Dk+1 (0k+1 ):z∈Z
E1(k+1) (z, Z) =
X
(4.53)
E1(k+1) (z, Z, Y0 ).
Y0 ∈Dk+1 :z∈Y0 ⊂Z
The functions E1(k+1) (z, Z) satisfy all the conditions of Lemma 4.1. In particular they are analytic functions on the spaces (4.25) properly restricted, and with Y replaced by Z, and they satisfy the bounds |E1(k+1) (z, Z)| < e2 K0 ε exp(−(2κ − 3 − 6κ0 )dk+1 (Z)).
(4.54)
Let us notice that the constant e2 K0 ε is already quite small by all the assumptions on ε we have introduced. In fact it can be arbitrarily small for β large enough. Let us recall 1 also that these functions are analytic functions of σ on the disc {σ : |σ| ≤ β 8 η −γ+α1 }, and they are equal to 0 for σ = 0. From this we can obtain the additional small factor 1 2β − 8 η γ−α1 in the bound (4.54). Actually, by the formulas (4.1), (4.36), we should have −1
a constant proportional to βk 2 , or even to βk−1 , in (4.54), but proving this would require −1
“clearing out” the first few orders of a perturbation expansion in βk 2 for the function E1(k+1) . Consider the function E00(k+1) (z) = − 21 D(k) (z)+E1(k+1) (z) for z ∈ 3k+1 , where D(k) (z) is given by the formula (2.60)[4]. We construct the localization extension of D(k) (z) in the same way as all the above extensions, by using Proposition 3.1 [3], and then we use the proof of Proposition 4.3 [3]. This yields a localization expansion of the form (4.53), but with terms depending on (θ, h) only, and satisfying the bounds (4.54) with 2κ instead of 2κ−3−6κ0 , and with the constant in front of the exponential equal to N Ld B5 , where B5 is given by the obvious slight modification of the formula in (3.24)[3]. Combining the two expansions we obtain an expansion of the form (4.53) for E00(k+1) (z), where terms satisfy (4.54) with the constant N Ld B5 + 1. We perform one more resummation in this expansion. For a fixed domain Y ∈ Dk+1 ( modck+1 ) we resum over all domains Z such
40
T. Balaban
that Z “determines” Y , i.e. Z ∩ k+1 = Y ∩ k+1 and Z has a non-empty intersection with each component of ck+1 contained in Y . This resummation yields the following final localization expansion: E00(k+1) (z) =
X
E00(k+1 (z, Y ).
(4.55)
Y ∈Dk+1 (modck+1 ):z∈Y
Let us recall that the terms depend also on the domains Zkc , k+1 , 00k+1 , or rather on their intersections with Y , on the configurations (θ, h) restricted to Y ∩ Wk∼ , ψ = ψk0 restricted to Y ∩ k+1 ∩ 00c k+1 . They are analytic functions on the corresponding spaces in (4.25), and they satisfy the bounds |E00(k+1) (z, Y )| < (N Ld B5 + 1)K0 exp −(2κ − 3 − 7κ0 )dk+1 (Y mod ck+1 ) . (4.56) It is clear from the construction of (4.55) that if Y ⊂ 00k+1 , then the term with this domain is equal to the term with the same domain in the localization expansion constructed on the whole lattice, i.e. for 00k+1 = k+1 = Zkc = T . This ends the proof of the part of Proposition 3.4 [5] concerning the functions E00(k+1) (z), z ∈ 3k+1 . To construct an expansion of E10(k+1) (Zkc ∩ ck+1 ) we sum up the expansions (4.53) over z ∈ Zkc ∩ ck+1 . Then for a fixed Z we resum over z ∈ Z ∩ Zkc ∩ ck+1 , and finally for a fixed Y ∈ Dk+1 (modck+1 ) we resum over Z as above. Notice that the domain Y0 in (4.41), (4.53) satisfies the additional condition Y0 ∩ k+1 6= ∅, otherwise the corresponding term in (4.37) is equal to 0, hence the domains Z, Y satisfy this condition also. After the resummations we obtain an expansion of the form X
E10(k+1) (Zkc ∩ ck+1 ) = Y
∈Dk+1 (modck+1 ):Y
∩k+1 6=∅,Y
E00(k+1) (Y )
(4.57)
∩ck+1 6=∅
whose terms have the same properties as for (4.55), except that the bounds (4.56) hold with 2κ − 4 − 7κ0 in the exponential, and the constant e2 K02 (3LM )d ε in front of it. We can bound this constant by 1 for ε small enough, i.e. β large enough, and we obtain the statements of Proposition 3.4 [5] for this function. It is clear that the above analysis can be applied in an identical way to the function (3.15) [5], or the corresponding functions M00(k+1) , but there is a problem with bounds for the localization expansions. We can obtain bounds of the form (4.23), with 2κ replaced by 2κ − 3 − 6κ0 , which is not enough for the inductive hypothesis (H.7)[4], because it d−2 assumes a higher power of the scaling factor L−1 η. We should have (L−1 η) 2 +γ−α1 −1 γ−α1 instead of (L η) in (4.23). We could weaken the inductive assumption. The exponent γ − α1 is enough to control the sum in (H.7)[4], and the thermodynamic limit, but in the future we will need the exponent d−2 2 + γ − α1 to prove more precise statements on correlation functions. We can obtain better bounds performing one order higher ex−1
pansion in βk 2 , and using more carefully the analyticity assumptions in (H.7)[4]. We start with the formula (3.15) [5] and we expand the underintegral function up to the first −1
order in βk 2 . We simplify the notations again omitting the domains, the “primes”, etc., and we write
Renormalization and Localization Expansions
41
∂ (k) 21 = dt dµ1,t (ψ) δφk (x; 0), C ψ ∂ψ 0 0 + * k X ∂ (j) (j) c (k) ˜ 0 (k) 21 (x, Zk ; ψk (ψ (θ) + ψ ), g) M ,C ψ + ∂ψ 0 ψ 0 =0 j=1 Z 1 1 1 ∂2 −1 − 21 0 (k) 1 2 ψ), C (k) 2 ψ, C (k) 2 ψ [3pt] + βk 2 t dt0 (x; β δφ tt C k k ∂ψ 0 ∂ψ 0 0 k Z 1 X 1 ∂2 −1 (j) ˜ + β − 2 tt0 C (k) 21 ψ), g), dt0 M (x, Zkc ; ψk(j) (ψ (k) (θ) [3pt] + βk 2 t k 0 0 ∂ψ ∂ψ 0 Z
1
Z
M(k+1) (x; g) 0
j=1
1
1
C (k) 2 ψ, C (k) 2 ψ
. (4.58)
Consider the last two terms. The underintegral expression can be represented by the Cauchy formula
−1
Z
βk 2 2t −1
1
dt0
0
+βk 2 2t
1 2πi
k Z X j=1
1
Z |τ |=r0
dt0
0
1 2πi
1 1 dτ −1 δφk (x; βk 2 tt0 C (k) 2 ψ + τ C (k) 2 ψ) 3 τ
Z |τ |=rj
−1
dτ (j) ˜ M (x, Zkc ; ψk(j) (ψ (k) (θ) τ3
(4.59)
+βk 2 tt0 C (k) 2 ψ + τ C (k) 2 ψ), g). 1
1
We construct a localization expansion of this function in the usual way, using the same analytic extensions as before, the localization expansions (1.12) [5] of the functions −1
M(j) , and Proposition 4.3[3]. The function ψ 0 (s) = βk 2 tt0 C (k) 2 (s)ψ + τ C (k) 2 (s)ψ can 1
1
− 21
be bounded as before, |ψ 0 (s)| < βk B5 p1 (βk ) + rj B5 p1 (βk ) = δ1 , but we choose the radii rj in different ways now. For the first term we assume that δ1 ≤ C3 c7 , and we −1
take r0−1 = 2B5 p1 (βk )(C3 c7 )−1 . We assume also that βk 2 B5 p1 (βk ) ≤ 21 C3 c7 , but we have already much stronger conditions on βk , or β. Consider a j th term in the sum in (4.59), or rather a term with the localized function M(j) (x, X), and let us look into the proof of Proposition 4.3[3]. The proof was given with functions E from the effective actions in mind. Now we would like to use the fact that the considered functions are analytic on larger spaces 4cj (Bj (X); 1, εj ). The relevant condition is in (4.37)[3]. We replace the space in it by the same space with εj instead of εk , and then the condition is ε0 + (K2 + 1)δ3 ≤ εj . It is satisfied if the conditions (4.38)[3] hold with ξ α instead of η α , ξ = L−j , and they are satisfied if (4.16) hold with ξ α instead of η α . From the last 1 p1 (βk )ξ −α . With these choices of the radii we can we obtain rj−1 = 16B5 K2 K3 Lα αα 0 bound the term of the localization expansion of (4.59) corresponding to a domain Y by
42
T. Balaban −1
βk 2 2K3 C3 c7 (2B5 p1 (βk )(C3 c7 )−1 )2 exp(−2κdk+1 (Y )) +
k X
−1
βk 2 2K0 (16B5 K2 K3 Lα
j=1
<β
− 21 +α1 γ−α1
η
d−2 1 p1 (βk )ξ −α )2 c9 ξ 2 +γ−α1 exp(−2κdk+1 (Y )) αα0
B52 K3 c2 (2p1 ,
α1 1 1 2 ) + 4K0 (16B5 K2 K3 Lα ) d − 2 c7 αα0
1 α1 1 ) c9 exp(−2κdk+1 (Y )) = const.β − 2 +α1 η γ−α1 exp(−2κdk+1 (Y )). d−2 α (4.60) For the expectation value in (4.58) of this term we have the expansion (4.41), (4.42). Notice that it holds for any values of the parameter t. Terms of this expansion satisfy the 1 bounds (4.52) with ε = const. β − 2 +α1 η γ−α1 , and after the resummation (4.53) we obtain a localization expansion of the last two terms in (4.58). Terms of this expansion satisfy ·Lα c2 (2p1 ,
−1
the bounds (4.54). Let us recall that we have the additional factor βk 2 < 2β − 2 η 2 d−2 multiplying these terms, so altogether we get the right scaling factor η 2 +γ−α1 multiplied by const. β −1+α1 . The last expression is arbitrarily small for β large enough, we 1 1 can even assume that const. β − 2 +α1 ≤ 1 and we are left simply with β − 2 . Consider now the first two terms in (4.58). We write them in the form Hk C
(k) 21
Z
dt 0
(Hk C (k) 2 ψ 0 )(x) = 1
+
1 2πi
d−2
!
Z
1
1
dµ1,t (ψ)ψ (x), where Z |τ |=r0
1 dτ δφk (x; τ C (k) 2 ψ 0 ) 2 τ
(4.61)
Z k X 1 dτ (j) ˜ + τ C (k) 21 ψ 0 ), g). M (x; ψk(j) (ψ (k) (θ) 2πi |τ |=rj τ 2 j=1
1
We construct a localization expansion for the operator Hk C (k) 2 in the usual way, and 1 ξ −α |ψ 0 |. The term of this we take r0−1 = B5 (C3 c7 )−1 |ψ 0 |, rj−1 = 16B5 K2 K3 Lα αα 0 expansion corresponding to a domain Y can be bounded by X 1 0 1 −α |ψ | exp(−2κdk+1 (Y )) + 16B5 K0 K2 K3 Lα ξ . c7 αα0 j=1 d−2 1 ·c9 ξ 2 +γ−α1 |ψ 0 | exp(−2κdk+1 (Y )) ≤ B5 K3 C3−1 + 16B5 K0 c7 1 c9 |ψ 0 | exp(−2κdk+1 (Y )) = const. exp(−2κdk+1 (Y ))|ψ 0 |, ·K2 K3 Lα αα0 γ k
B5 K3 C3−1
(4.62)
and it depends on ψ 0 restricted to Y . We substitute the expectation value in (4.61) instead of ψ 0 in this expansion. Now we use for the first time the fact that the measure dµs,t can be analytically extended in the parameter σ. We display the dependence writing −1
explicitly dµs,t (βk 2 σ, ψ), and we have
Renormalization and Localization Expansions
Z
Z
−1
dµ1,t (βk 2 , ψ)ψ(y) = Z
1
= 0
Z
1 dt0 2πi
43
Z
1
dµ0 (ψ)ψ(y) +
dt0
0
1 dσ (σ − t0 )2 |σ|=r
Z
d dt0
Z
−1
dµ1,t (βk 2 t0 , ψ)ψ(y) (4.63)
−1
dµ1,t (βk 2 σ, ψ)ψ(y),
where we take r−1 = β − 8 η γ−α1 . We construct the corresponding localization expansion (4.41), (4.42) for the above expectation value, and the term of this expansion corresponding to a localization domain Z 3 y can be bounded by 1
2e2 β − 8 η γ−α1 p1 (βk ) exp(−(2κ − 3 − 6κ0 )dk+1 (Z)). 1
(4.64)
1
We combine the two expansions, for the operator Hk C (k) 2 and the expectation value above, and we obtain a localization expansion of (4.61), after proper resummations. Terms of this expansion can be bounded by const.β − 8 η γ−α1 p1 (βk ) exp(−(2κ − 4 − 7κ0 )dk+1 (Z)). 1
(4.65)
This completes the construction of the localization expansion for the function (4.58). We have obtained that X (x; g) = M(k+1) (x, X; g), (4.66) M(k+1) 0 0 X∈Dk+1 (modck+1 ):x∈X
where the terms are analytic functions of (θ, h), g on the spaces (4.25), and they satisfy the bounds (x, X; g)| < const.β − 8 +α1 η γ−2α1 exp(−(2κ − 4 − 7κ0 )dk+1 (Xmodck+1 )). |M(k+1) 0 (4.67) − 21 Multiplying (4.66) by βk we obtain the expansion whose terms satisfy the above bounds d−2 5 with the expression in front of the exponentials replaced by const. β − 8 +α1 . η 2 +γ−2α1 . 3 We can assume that e.g. const. β − 8 +α1 ≤ 1, and we obtain the bound in (H.7)[4] with 1 c9 = β − 4 , and κ replaced by 2κ − 4 − 7κ0 . Finally we assume that κ − 4 − 7κ0 ≥ 21 κ, and this ends the proof of Proposition 3.4 [5]. 1
Proof of Proposition 3.3 [5]. By the considerations in the paragraph after Lemma 4.1 we separate the sum of terms with domains X ⊂ ck+1 from the expectation value (3.11) [5], and the remaining sum has the form (4.24) with terms having the properties described in −n− 1
Lemma 4.1, the bounds (4.28) holding with ε = βk 2 . The measure in (3.11) [5] has exactly the same properties as the measures in (4.35), (4.58), so the proof of Proposition 3.4 [5] can be applied directly here. We obtain a sum, which in the simplified notations has the form X X 0(k+1) Rn−1 (Y0 , Z), (4.68) Y0 ∈D 0 :Y0 ∩k+1 6=∅ Z∈D 0 :Y0 ⊂Z
with the terms satisfying the bounds (4.52). Performing the resummations over Y0 with a fixed Z, and then over Z with a fixed Y ∈ Dk+1 (modck+1 ), we obtain the desired localization expansion over the domains Y : Y ∩ k+1 6= ∅. The constant in the bounds −n− 1
is equal to e2 K02 (3L)2d βk 2 < 21 βk−n , and we have 2κ − 5 − 8κ0 in the exponential, so we assume that κ − 5 − 8κ0 ≥ 21 κ, and we obtain all the statements of Proposition 3.3 [5].
44
T. Balaban
Proof of Proposition 3.2 [5]. It is the same as the above proof, the expectation value (3.9) [5] is the expectation value of the function V (k) (Zkc ; ψ). We apply Lemma 4.2, the proof of Proposition 3.4 [5], and we obtain an expansion of the form (4.68), without the −m− 3
2 . Performing the subscript “n-1”, whose terms satisfy the bounds (4.52) with ε = βk above described resummations, and using the above assumptions, we obtain Proposition 3.2 [5].
Proof of Proposition 3.1 [5]. The only difference here is that terms of the expansion (4.33) satisfy the bounds (4.34) with the function dk+1 (·modck+1 ) instead of the usual dk+1 (·), but this is unessential because this function satisfies the same basic resummation bound (1.31) [5]. Actually we could reverse the resummations in the previous proofs, and do the last ones at the beginning, then we would have in all cases the same situation as above. This does not change at all the proofs, we have to use only the modified concept of connectedness: two domains Y1 , Y2 ∈ Dk+1 (modck+1 ), are connected if Y1 ∩ Y2 ∩ k+1 6= ∅. With this concept all the formulas and bounds in the construction described between (4.37) and (4.54) are valid, with dk+1 (·modck+1 ) instead of dk+1 (·). In the case considered now we obtain the localization expansion (3.3) [5], whose terms −3
satisfy the bounds (3.4) [5] with the constant e2 K0 (3L)d βk 2 in front of the exponential, and 2κ − 4 − 7κ0 inside, hence the bounds (3.4) [5] exactly. We have proved all the propositions in Sect. 3 [5], which means that we have constructed all the localization expansions connected with the fluctuation integrals. There is quite a number of other localization expansions and cluster expansions in Sect. 2, and in the next paper, but they are all covered by the constructions described above, in particular by the ones used in the proof of Lemma 4.1. They are actually simpler because no fluctuation variables and integrals are involved. Almost all of them are straightforward consequences of the results of [3], for example localization expansions of the last three terms in (2.14) can be obtained by a direct application of Propositions 2.1, 4.3 [3]. The second term and the sum on the right-hand side of (2.19) are slightly more complicated, we have to use the representation (4.14) at first, and then apply the same constructions as for the expressions (4.15), using the remarks after (2.19). These constructions yield Proposition 2.1, and in a similar way we obtain Proposition 2.2. The most important localization expansion in Sect. 2 is the one discussed in Proposition 2.3 for the function given by (2.28), with the auxiliary definitions (2.27), (2.22), (2.23). Here the important terms are the function −βk+1 C (k+1) (1k+1 (z)) and the sum over j on the right-hand side of (2.27). These are almost identical with the first two terms in (4.1) pre-localized in 1k+1 (z), and we repeat the proof of Lemma 4.1, which yields the proposition. There will be several other expansions in the next paper, but they are of exactly the same type as the ones discussed above.
References 1. Balaban, T.: A Low Temperature Expansion for Classical N -vector Models. I. A Renormalization Group Flow. Commun. Math. Phys. 167, 103–154 (1995) 2. Balaban, T.: The Variational Problems for Classical N -Vector Models. Commun. Math. Phys. 175, 607–642 (1996) 3. Balaban, T.: Localization Expansions. I. Functions of the “Background” Configurations. Commun. Math. Physics 182, 33–82 (1996) 4. Balaban, T.: A Low Temperature Expansion for Classical N -Vector Models. II. Renormalization Group Equations. Commun. Math. Phys. 182, 675–721 (1997)
Renormalization and Localization Expansions
45
5. Balaban, T.: A Low Temperature Expansion for Classical N -Vector Models. III. A Complete Inductive Description, Fluctuation Integrals. Commun. Math. Phys. 182, 675–721 (1997) 6. Balaban, T.: Commun. Math. Phys. a) 89, 571–597 (1983); b) 119, 243–285 (1988); c) 122, 175–202 (1989); d) 122, 355–392 (1989) 7. Brydges, D.: A Short course in Cluster Expansions. In Critical Phenomena, Random Systems, Gauge Theories. Les Houches (1984), London–New York: Elsevier Science Publishers, 1986 8. Brydges, D., Dimock, J., Hurd, T.: Weak Perturbations of Gaussian Measures. In: Mathematical Quantum Theory I. Field Theory and Many Body Theory. CRM Proceedings Lecture Notes 9. Cammarota, C.: Commun. Math. Phys. 85, 517–528 (1982) 10. Feldman, J., Magnen, J., Rivasseau, V., S´en´eor. R.: Commun. Math. Phys. 109, 473 (1987) 11. Abdessalam, A., Rivasseau, V.: An Explicit Large Versus Small Field Multiscale Cluster Expansion. Rev. Math. Phys. To appear 12. Rivasseau, V.: Cluster Expansions with Small/Large Field Conditions In: Mathematical Quantum Theory I: Field Theory and Many Body Theory. CRM Proceedings Lecture Notes 13. Glimm, J., Jaffe, A.: Quantum Physics: Functional Integral Point of View. New York: Springer, 1989 Communicated by D. C. Brydges
Commun. Math. Phys. 198, 47 – 81 (1998)
Communications in
Mathematical Physics © Springer-Verlag 1998
Topological Interpretations of Lattice Gauge Field Theory 1 ´ Doug Bullock1,? , Charles Frohman2 , Joanna Kania-Bartoszynska 1 Department of Mathematics, Boise State University, Boise, ID 83725, USA. E-mail:
[email protected];
[email protected] 2 Department of Mathematics, University of Iowa, Iowa City, IA 52242, USA. E-mail:
[email protected]
Received: 6 October 1997 / Accepted: 13 March 1998
Abstract: We construct lattice gauge field theory based on a quantum group on a lattice of dimension one. Innovations include a coalgebra structure on the connections and an investigation of connections that are not distinguishable by observables. We prove that when the quantum group is a deformation of a connected algebraic group G (over the complex numbers), then the algebra of observables forms a deformation quantization of the ring of G-characters of the fundamental group of the lattice. Finally, we investigate lattice gauge field theory based on quantum SL2 C, and conclude that the algebra of observables is the Kauffman bracket skein module of a cylinder over a surface associated to the lattice. Introduction Lattice gauge field theory based on an algebraic group G is a finite element approximation of a smooth gauge field theory with G as its structure group. Infinitesimally varying connections and gauge transformations on a principal bundle are discretized via a lattice embedded in the base manifold. To each edge in the lattice a connection imparts an element of G encoding the holonomy along that edge. Gauge fields (i.e., functions on connections) are represented by a copy of the coordinate ring of G associated to each edge. The action of the gauge group is then concentrated at vertices. All computations become merely algebraic with analytic and geometric considerations swept aside. The end result is an algebra of observables (the gauge invariant gauge fields) that can be understood as the character theory for representations of the fundamental group of the lattice into G. Lattice gauge field theory based on a quantum group yields a deformation of this theory. Technically, the result is an algebra of observables which, with respect to the ? The first author is partially supported by an Idaho SBOE Specific Research Grant; the second and third by NSF-DMS-9204489 and NSF-DMS-9626818.
48
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
standard Poisson structure [2, 11], gives a deformation quantization of the ring of Gcharacters. Here one must think of the fundamental group of the lattice as the fundamental group of a surface with boundary. In this paper we develop, from an elementary and computational viewpoint, the basic objects of lattice gauge field theory based on a quasitriangular ribbon Hopf algebra (e.g., a quantum group). We then use this foundation to begin the study of the structure of algebras of observables (paying particular attention to quantum groups) and to recognize the observables as algebras that have already been studied in a topological framework. The genesis of our approach can be found in the papers [1, 3, 4, 5, 10]. Fock and Rosly were the first to derive the Poisson structure on G-characters from a lattice gauge field theory. Their formula is written in terms of a solution of the modified classical Yang-Baxter equation [9]. Also, recall that the characters of a surface group are only a homotopy invariant while the Poisson structure is a topological invariant. For this reason, Fock and Rosly endow the lattice with extra information, called a ciliation, so that it determines a surface. Passing to quantum groups, Alekseev, Grosse and Schomerus defined an exchange algebra over a ciliated lattice so that basic elements of the algebra of gauge fields commute according to a solution of the quantum Yang-Baxter equation. This algebra is related to a quantization of the characters with respect to the usual Poisson structure. It is based on a full solution of the Clebsch-Gordan problem for the quantum group being used, and has both gauge transformations and gauge fields in the same place. Buffenoir and Roche [4] took this approach farther. First they isolated the gauge fields from the gauge transformations. Their gauge algebra is dual to that of [1], hence they have a coaction of the gauge algebra on the gauge fields. The coinvariant part of the gauge fields is the algebra of observables, which is a deformation of the classical ring of characters. They proceed to define Wilson loops and the Yang-Mills measure and to derive 3-manifold invariants from this setting [3, 5]. We found ourselves unable to compute examples in the exchange algebra formulation. We instead define our gauge fields as functions on the space of connections. This makes the structure of the algebra of observables more clear. Working from the point of view of low-dimensional topology, we assume a familiarity with the basics of knot theory. Otherwise, one can read most of this paper knowing only the definition of a ribbon Hopf algebra and the basics of its representation theory. Kassel [13] and Sweedler [18] are sufficient references. Part 1 is devoted to our translation of the basic objects of a lattice gauge field theory and to our devices for computing in the reformulated version. We do not merely alter the language of [4]. Three significant innovations provide added computing power. The first is to realize that gauge fields come from the restricted dual of the Hopf algebra on which the theory is based. This leads to a coordinate free formulation. Next, we do not multiply gauge fields as abstract variables modulo exchange relations. Rather we comultiply connections in a way that implies the usual exchange relations for fields while preserving their evaluabililty. Finally, we are able to mimic the classical phenomenon of pushing the support of a gauge field around. Our new foundations allow us to compute Wilson loops and many other operators using a simple extension of tangle functors. The second part is devoted to analyzing the structure of the algebra of observables. Our viewpoint is that the observables corresponding to quantum groups generalize the rings studied by Procesi [15]. He arrived at these rings as the invariants of n-tuples of matrices under conjugation. The connection with lattice gauge field theory is that each n-tuple of matrices corresponds to a connection on a lattice with one vertex and n-edges, with the gauge fields based on a classical group.
Topological Interpretations of Lattice Gauge Field Theory
49
In passing from Procesi’s work to ours, we find that the algebra of observables corresponding to a quantum group is a more subtle object. Instead of depending solely on the fundamental group of the lattice, the observables are classified by the topological type of a surface specified by a ciliated lattice. The construction given in this paper leads to an algebra of “characters” of a surface group with respect to any quasitriangular ribbon Hopf algebra. The algebras are interesting from many points of view: They generalize objects studied in invariant theory; they should provide tools for investigating the structure of the mapping class groups of surfaces; and they should give a way of understanding quantum invariants of 3-manifolds. In the case that the data correspond to a connected affine algebraic group G, it is possible to make explicit parallels with the existing theory. The algebra of observables based on U (g) is shown to be the ring of G-characters of the fundamental group of the associated surface. Then, the original motivating problem is solved: Given the ring of G-characters of a surface group, show that the observables based on the corresponding Drinfeld-Jimbo algebra form a quantization with respect to the usual Poisson structure. We also prove for the classical groups that the algebra of observables is generated by Wilson loops. Finally, invoking a quantized Cayley-Hamilton identity, we obtain a new proof, independent of [7], that the Uh (sl2 )-characters of a surface are exactly the Kauffman bracket skein module of a cylinder over that surface. Many further avenues of research present themselves. Working with quantum groups defined over local fields side steps several interesting and subtle structural questions. What happens when one uses a quantum group at a root of unity? How about lattice gauge field theory based on a quasitriangular quasi-Hopf algebra? There is a graphical calculus of the characters of the fundamental group of any manifold with respect to any algebraic group, for example, see [6], [16] or [17]. It derives from the fact that Wilson loops are a pictorial description of characters of the fundamental group of a manifold, after which the tools of classical invariant theory express all functional relations between characters in a diagrammatic fashion. The graphical models have only been worked out for special linear groups. The power of lattice gauge field theory is that it places the representation theory of the underlying manifold and the quantum invariants in the same setting. Ultimately the asymptotic analysis of the quantum invariants of a 3-manifold in terms of the representations of its fundamental group should flow out of this setting. The identification of the representation theory of a quantum group with that of a compact Lie group leads to rigorous integral formulas for quantum invariants of 3-manifolds. This should in turn lead to a simple explication of the relationship between quantum invariants and more classical invariants of 3-manifolds. Finally, there should be a similarly clean treatment of lattice gauge field theory for lattices of higher dimension. Although, in dimension greater than two, the answers will no longer be topological in nature, the constructions and objects should be of interest to geometers, algebraists and analysts. This work was done at the Banach Center, the University of Iowa, Boise State University, The George Washington University, the University of Missouri, MSRI, and the Free University, Berlin. The authors thank all their hosts for their hospitality. We also thank Daniel Altschuler, Jorgen Anderson, Georgia Benkhart, Vic Camillo, Fred Goodman, Joseph Mattes, Michael Polyak, Florin Radulescu, Arun Ram, Justin Roberts, Don Schack and Bob Sulanke for helpful conversations.
50
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Part 1. Lattice Gauge Field Theory Herein we develop, from a self contained and axiomatic approach, the machinery of gauge field theory on an abstract, oriented, ciliated graph. For basic background on Hopf algebras we rely on Sweedler [18] and Kassel [13]. The discussion here is restricted to the definitions and basic results confirming that the theory is consistent and computationally viable. For origins of the ideas we refer the reader to [1, 3, 4, 5, 8, 10]. 1. Objects The elementary objects of a lattice gauge field theory are: a ribbon Hopf algebra; an abstract graph which is oriented and ciliated; discretized connections, gauge transformations, and gauge fields. 1.1. Let H be a ribbon Hopf algebra defined over a field k or its power series ring k[[h]]. In the latter case all objects carry the h-adic topology (see [13]), and all morphisms are continuous. In discussions germane to both settings we will refer to the base over which the algebra is defined as b. Following Kassel we let µ, η, 1, and S denote the multiplication, P unit, comultiplication, counit and antipode of H. The universal Rmatrix is R = i si ⊗ ti , which we usually write as s ⊗ t with summation understood. The ribbon element is θ, and we add a charmed element, k = θ−1 S(t)s. The charmed element is grouplike, meaning 1(k) = k ⊗ k. It also satisfies k −1 = S(k) = θtS 2 (s) and S 2 (x) = kxk −1 for all x ∈ H. The Hopf algebra dual is well documented in [18] provided b = k. The topological case, however, has been neglected. If H is a Hopf algebra over k[[h]] then the sets Un = {L ∈ H ∗ | L(H) ⊂ hn k[[h]]} form a neighborhood basis of the origin. An ideal J ≤ H is cofinite if H/J is topologically free and modeled on a finite dimensional vector space; L ∈ H ∗ is cofinite if ker(L) contains a cofinite ideal. The restricted dual, H o , is the completion of the cofinite functionals. It is not hard to check that H o is topologically free. In the case that H is a DrinfeldJimbo deformation of a simple Lie algebra [13], it is clear that H o is modeled on (H/hH)o . To see that it is a Hopf algebra one must check that µ∗ , η ∗ , 1∗ , ∗ and S ∗ restricted to H o or H o ⊗ H o take values in the appropriate spaces. The only point that needs any discussion is why µ∗ (L) ∈ H o ⊗ H o . Suppose that L is the limit of cofinite linear functionals {Li }. It follows that {Li } is a Cauchy sequence in H o . The classical discussion of µ∗ in [18] provides Li ◦µ ∈ H o ⊗H o , which is complete by definition [13]. It is easy to see that Li ◦ µ is also Cauchy, so continuity of µ∗ gives µ∗ (L) ∈ H o ⊗ H o . The Hopf algebra H acts on its restricted dual in two obvious ways: x · φ(y) = φ(xy) and x · φ(y) = φ(yx). A subalgebra of H ◦ is stable if it is invariant under both actions. For the remainder of this section we fix a stable subalgebra B of H ◦ . (Stability implies that B is actually a Hopf subalgebra.) The adjoint action ad : H ⊗ H → H is given, in Sweedler notation, by X x00 yS(x0 ), ad(x ⊗ y) = (x)
which is further compressed to ad(x)y = x00 yS(x0 ). (Readers unfamiliar with this notation for comultiplication are referred to [13].) By taking duals we get the adjoint (right) action of H on B: if x, y ∈ H, and φ ∈ B then
Topological Interpretations of Lattice Gauge Field Theory
51
(φad(x))(y) = φ(ad(x)y) = φ(x00 yS(x0 )). An element φ ∈ B is invariant if for every x ∈ H, φad(x) = (x)φ. Our definition of the adjoint action is chosen so that any function φ with the property that φ(xy) = φ(yx) will be invariant. The invariant elements of B form a subalgebra denoted B H . 1.2. A graph consists of a set E called edges, a fixed point free involution − : E → E, and a partition V of E into subsets called vertices. Let i : E → V be the map sending e to the vertex v containing it. Let t = i ◦ −. We call t(e) the terminal vertex of e and i(e) the initial vertex. An orientation is a choice O of one edge from each orbit of the involution. An oriented graph is denoted by the data (E, −, V, O). There is a one-dimensional CW-complex associated to (E, −, V, O), which is called its geometric realization. The 0-cells are in one to one correspondence with V , the 1cells are in one to one correspondence with O, and the characteristic maps are determined by t and i. A ciliation C of a graph is a linear ordering of each vertex. The additional data is denoted V c , although we will continue to use V for the partition of E. A lattice is an oriented, ciliated graph. The geometric realization of an oriented graph is insufficient to support a ciliation so for a lattice we construct an oriented surface called its envelope. Each vertex becomes an oriented disk and each edge in O becomes an oriented band. The orientation of a fattened vertex induces an orientation on its boundary, one point of which is marked with a cilium. Attach the band corresponding to each e to the disks (or disk) at its initial and terminal ends. The attaching points along the oriented boundary of each disk must be arranged in the order given by the ciliation of the vertex. Further annotate the resulting surface by orienting the core of each band from i(e) to t(e). For example, consider E = {±e1 , ±e2 , ±e3 , ±e4 , ±e5 , ±e6 }, V c = {{−e1 , e2 }, {−e2 , e3 }, {−e3 , e1 , e4 , −e6 }, {−e5 , −e4 }, {e6 , e5 }}, O = {e1 , e2 , e3 , e4 , e5 , e6 }.
and
Ciliation is given by the order in which the elements of each vertex are written above. The envelope of (E, −, V c , O) is shown in Fig. 1, alongside a streamlined schematic version. An envelope determines its lattice. The edge set consists of a pair ±e for each band, with e assigned to the orientation. Label the initial and terminal ends of a band core by e and −e respectively. Each disk forms a ciliated vertex by reading off these labels, beginning at the cilium and traveling along the induced orientation.
Fig. 1. Envelope of an oriented, ciliated graph
52
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
1.3. For this subsection we fix (E, −, V c , O). A gauge field theory on this lattice is defined by the interactions of three algebraic objects: O He . • A set of connections, A = • A gauge algebra, G =
Oe∈O Hv . v∈V
• And a set of gauge fields, C[A] =
O
Be .
e∈O
The gauge algebra is a Hopf algebra in the natural sense of a tensor power of Hopf algebras, whereas A and C[A] inherit only the vector space structure of H. However, we will shortly endow the connections with a G-action and a comultiplication, which induce dual structures on C[A] via the evaluation pairing. For each v ∈ V c there is a function ordv : v → N that assigns to e ∈ v the ordinal number corresponding to its position in the ciliation. Connections become a left G-module under the action (ord (e)) (ord (e)) . ⊗v∈V yv · ⊗e∈O xe = ⊗e∈O yi(e) i(e) xe S yt(e) t(e) This is a busy formula, even with the summations of Sweedler notation suppressed. For a graphical description of the action (and the usual method of computing it) see [8]. The gauge algebra acts adjointly on gauge fields via (f · y)(x) = f (y · x), so C[A] is a right G-module. A gauge field f is called an observable if for all y ∈ G we have f · y = (y)f . Observables form a submodule O of C[A]. 1.4. There is a construction of gauge fields which uses a direct interpretation of the restricted dual of H. Suppose that W is a finite dimensional left H-module. We use W ∗ to denote the dual with H acting on the left by (x · f )(v) = f (S(x) · v). The action (f ·x)(v) = f (x·v) makes the dual into a right H-module, denoted W 0 . Comultiplication supplies a left action on W ∗ ⊗W , namely x·(f ⊗v) = (x0 ·f )⊗(x00 ·v). Forcing the natural identification of W ∗ ⊗ W with Hom(W, W ) to be an intertwiner makes the later into a left module as well. In Sweedler notation the action is (x · f )(v) = x00 · f (S(x0 ) · v). Now suppose that ρ : H → Hom(W, W ) is the original representation. I.e., x · v = ρ(x)(v). The reader may check that for any x, y ∈ H, we have y · ρ(x) = ρ(ad(y)x). A finite dimensional representation ρ : H → Hom(V, V ) is said to be adapted to B if {h ◦ ρ | h ∈ (Hom(V, V ))0 } ⊂ B. A coloring of a lattice is a labeling of each e ∈ O by a representation adapted to B. Let ∗ We denote the representation associated N to e, and let W−e = We . A coloring naturally associates the left H-module Wv = e∈v We to each vertex. Given a coloring, there is a map of right G-modules, O O O Wv0 → (W−e ⊗ We )0 → (Hom(We , We ))0 → C[A] v∈V
e∈O
e∈O
defined as follows. The first stage is just reordering of the factors with the natural distribution of primes over tensor products. The next is the canonical identification. The last is composition with ⊗e∈O ρe , where the maps ρe : H → Hom(Ve , Ve ) are the actual representations of the coloring.
Topological Interpretations of Lattice Gauge Field Theory
53
Theorem 1. The images of these maps, taken over all colorings, add up to C[A]. Proof. This is evident after establishing the following claim: For each f ∈ B there is a finite dimensional H-module W so that f ∈ {h ◦ ρ | h ∈ (Hom(W, W ))0 } ⊂ B. Fix a nonzero f ∈ B. Choose I to be maximal among ideals of H contained in ker f . Let ρ : H → Hom(W, W ) be the representation induced by left multiplication of H on W = H/I. Define T to be the linear span of the functionals {y 7→ f (xyz) | x, z ∈ H}. Since I is an ideal and it lies in the kernel of f , T may be thought of as a subspace of W ∗ . Choose {x1 , . . . , xn } ⊂ H so that x1 = 1H and so that, in the quotient, this is a basis for WP . By evaluation, each xi is a functional on T . Suppose that, as a functional on T , X = ai xi = 0. For any y, z ∈ H we have f (yXz) = 0. Maximality of I then implies linear independence of {xi } on T , which means T is all of W ∗ . Choose a basis {f1 , . . . , fn } for W ∗ that is dual to {xi }. Let ρ(xj ) be the matrix M j in the basis {xi }. By duality of bases, we know that every element y ∈ H can be written as X fi (y)xi , y=z+ i
where z ∈ I. Hence ρ(y) =
X
fi (y)M i .
i
The j-k entry of the matrix ρ(y) is X
i fi (y)Mjk ,
i
which proves the assertion {h ◦ ρ | h ∈ (Hom(W, W ))0 } ⊂ B. Finally, let hj be the function y 7→
X
i fi (y)Mj1 .
i i Mj1 .
The first column of M i expresses xi x1 in the chosen basis. Note that hj (xi ) = i = δji . Since hj (I) = 0, we have shown that it agrees However, x1 = 1H , so we have Mj1 with fj on all of H. This proves that {h ◦ ρ | h ∈ (Hom(W, W ))0 } contains a spanning set for T . In particular, it contains f . If H is semisimple there is a way of getting an isomorphism out of the construction above. Restrict the colors to lie in an exhaustive list of irreducible representations adapted to B, so that no representation appears twice in the list. Once this has been done then the map in Theorem 1 becomes an isomorphism. This is the definition of gauge fields used in [1, 4]. Let Inv(W ) denote the invariant part of an H-module. Since the maps described above are all intertwiners, we have the following characterization of observables. N Corollary 1. The sum over all colorings of the images of v∈V Inv(Wv0 ) is equal to O.
54
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
2. Multitangles The goal of this subsection is to develop a functor between two categories: the category of multitangles, M, and the category of connections, A. The objects of M are lattices, and a morphism is a set of tangles in one-to-one correspondence with the vertices of its domain. An object in A is the set of connections on a lattice, viewed as a left module over the gauge algebra of the lattice. The morphisms are pairs of maps, one from the connections in its domain to the connections in its range and the other between the gauge algebras. The second morphism allows us to pull back the connections on the range lattice to a module over the domain gauge algebra. The first map must intertwine this action with the standard one. A multitangle is described by a collection of diagrams in one-to-one correspondence with the vertices of the domain lattice. Each diagram lies in a copy of [0, 1] × [0, 1] with the second factor determining a height function on the entire collection. Each such collection is built by stacking the elementary diagrams described below. A multitangle is an equivalence class of these collections under a relation that will be made explicit shortly. 2.1. Abstractly, a morphism in the category M has a specific domain and range lattice. In practice it will be given by a picture of a multitangle, from which one can easily determine E, O, and V c for both range and domain, but not the involution. However, the specific details of the domain lattice are always clear from context, and the range lattice is then completely determined by the picture. We will now list several elementary morphisms in M by explicitly describing how a domain lattice is altered to produce the range lattice. We also describe an associated picture called an elementary diagram. These are the elementary diagrams. The identity: The domain and range are the same lattice. For each vertex v there is a diagram consisting of arcs with no crossings which are monotonic with respect to the height function. The arcs correspond, from left to right, to the cilial ordering of v. Arcs corresponding to edges in the orientation are directed downwards, others are directed upwards. Fig. 2 shows an envelope and its identity morphism. The convention for ordering and directing arcs used here is standard for all elementary diagrams. It can also be derived from the envelope of a lattice. Allow the band cores to protrude into a fat vertex and unroll it with a M¨obius transformation to the upper half plane, cilium at infinity.
Fig. 2. Identity multitangle
Crossings: The domain and range lattices differ only in the ciliation at a single vertex, v, where a pair of adjacent edges have been transposed. At each vertex other than v there is a trivial diagram as in the identity. The diagram at v has monotonic arcs and
Topological Interpretations of Lattice Gauge Field Theory
55
a single crossing between those arcs corresponding to the transposed edges. Either strand may pass over the other. A geometric example is given in Fig. 3.
Fig. 3. Negative crossing
Triads: Consider an involutory pair of edges, e and −e, in the domain lattice with e ∈ O. In the range lattice, e is removed from its position in a ciliated vertex and replaced with e0 , e00 in that order. Similarly, −e is replaced with −e00 , −e0 . The edges e0 and e00 lie in the orientation of the new lattice, which is otherwise identical to the domain. The diagrams have monotonic arcs without crossings corresponding to all the unchanged edges. The two arcs corresponding to e and −e split at the same height into four arcs corresponding to e0 , e00 , −e00 and −e0 . In an envelope, this is the operation of doubling an edge (Fig. 4).
Fig. 4. Triad
Caps: The edge set of the range will differ from the domain by deleting two adjacent edges from a vertex, exactly one of which lies in the orientation. If the two edges are not an involutory pair, then the two orphaned edges in the range become an involutory pair. The strands corresponding to the deleted edges meet at a local maximum. Otherwise the diagrams are trivial. The effect on envelopes is suggested in Fig. 5. Cups: The range lattice differs from the domain by introducing two new edges, e and −e next to each other at a single vertex. The strands corresponding to the new edges originate in a local minimum and obey the usual directedness rule. Otherwise the diagrams are trivial. This creates a monogon at a vertex as shown in Fig. 6. Stumps: The range lattice is formed from the domain lattice by deleting an involutory pair of edges. The diagrams are trivial except for the two strands corresponding to the deleted edges, which simply terminate. Both stumps must occur at the same height. Figure 7 is an example.
56
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Fig. 5. Cap joining a non-involutory pair of edges
Fig. 6. Cup creating an involutory pair at a single vertex
Fig. 7. Stump eliminating an involutory pair
Fig. 8. Switch exchanging an involutory pair
Topological Interpretations of Lattice Gauge Field Theory
57
Fig. 9. Cut splitting a vertex in two
Switches: The range differs from the domain by replacing some e with −e in the orientation. This is indicated in the diagrams by a hash mark on each of the strands involved, with both marks lying at exactly the same height (Fig. 8). Cuts: The domain lattice is altered by dividing the ordered edges at some vertex into two non-empty consecutive sets, which form new ciliated vertices. The diagram for that vertex is trivial, except for a vertical mark at the top which indicates the cilium of the new vertex (Fig. 9). When the range lattice of one collection of diagrams matches the domain of another we may form a new set of diagrams by stacking the first two. It may be necessary to isotop the bases to get arcs to match, and if two diagrams are stacked atop a single diagram with a cut, the cut extends to the top of the new diagram. The height function is then uniformly rescaled. We define a multidiagram to be any such collection formed by stacking elementary diagrams. A multidiagram is a picture of a framed embedding of a 1-dimensional CW-complex into a collection of cubes. One should not think of the hash marks of a switch as vertices; rather they are extra annotation on what is otherwise a smooth 1-cell. The 1-cells of this complex are called the segments of the multidiagram. Alternatively, segments are the components left behind if triads are removed, switches are ignored, and the arcs passing under a crossing are thought of as connected. The critical points, switches, stumps and triads of a multidiagram are collectively referred to as events. A coloring of a multidiagram is an assignment of a finite dimensional H-module to each segment. Let b denote the 1-dimensional module with H acting by its counit, and identify W ⊗ b = b ⊗ W = W . Except for critical points, one may think of a multidiagram as a 1-parameter family of lattices, 0t . A multidiagram is consistently colored if its coloring satisfies: 1. Segments creating an involutory pair of edges in any 0t must have the same color. (I.e., the coloring induces a coloring of 0t in the sense of Sect. 1.4). 2. Triads must obey the condition in Fig. 10. 3. Any segment ending in a stump is colored by b. W1
W2
W1 ⊗ W2
W2
W1
W1 ⊗ W2
Fig. 10. Triad coloring rule
58
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
2.2. We say that two colored multidiagrams are equivalent if one can be obtained from the other by a sequence of the following local moves. Isotopies: We allow ambient isotopy of the diagrams subject to the following restriction: No two events sharing a segment may occur at the same height. A pair of marks indicating a stump, switch or triad must always remain at the same height. Cuts and stumps cannot become horizontal. Triads must maintain one segment below the horizontal and two above it. Finally, a cap may not occur at the same height as a stump, switch or triad if it shares an involutory pair of edges with the other event. Generalized Reidemeister Moves: These are shown in Fig. 11. The moves are valid regardless of the orientations of the arcs. We also allow the corresponding moves with reversed crossings.
Fig. 11. Generalized Reidemeister moves
Fig. 12. Triad moves
Fig. 13. Cap moves
Interacting Events: These moves describe the interaction of events that share either a common segment or two segments representing an involutory pair of edges. They are divided into triad moves (Fig. 12), cap moves (Fig. 13), stump moves (Fig. 14) and switch moves (Fig. 15). In each picture adjacent pairs of arcs, reading left to right along the base, represent involutory pairs of edges. Subject to that, any orientation of arcs is allowed, as are diagrams with all crossings reversed. The involutory pairs
Topological Interpretations of Lattice Gauge Field Theory
59
Fig. 14. Stump moves
Fig. 15. Switch moves
are shown as adjacent merely to conserve space; the moves are valid even for distant arcs. Some of these moves alter the segments. In each case a consistent coloring of the multidiagram before the move induces an obvious consistent coloring of new multidiagram. Specials: The three moves in Fig. 16 all concern an involutory pair of edges entering a series of triads. In the first two moves three triads have been collapsed into a 5valent vertex using a previously given triad move. In the third move this convention is extended to any number of triads. Note that the colors on the top of each diagram are as generic as possible and unchanged by the move. Consistency conditions then force the indicated colors on the bottom of each diagram. W1 W2 W2 W3
W3
W2
W1
W1 W2 W2 W3
W3
W1
←→ W1 ⊗ W2 ⊗ W2 ⊗ W3
W1 W2 W3 W4
W1 ⊗ W2 ⊗ W2 ⊗ W3
W1 ⊗ W3
W4 W2 W3 W1
W1 W2 W3 W4
W1 ⊗ W3
W4 W2 W3 W1
←→ W4 ⊗ W2 ⊗ W3 ⊗ W1
W1 W2 · · · Wn
W4 ⊗ W2 ⊗ W3 ⊗ W1
W4 ⊗ W3 ⊗ W2 ⊗ W1
Wn · · · W2 W1
W4 ⊗ W3 ⊗ W2 ⊗ W1
W1 W2 · · · Wn
Wn · · · W2 W1
Wn · · · W2 ⊗ W1
Wn · · · W2 ⊗ W1
←→ W1 ⊗ W2 · · · Wn
W1 ⊗ W2 · · · Wn
Fig. 16. Specials
60
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
The first move is allowed with the switch on the other side of the loop, as well as with opposite orientations. The second move is allowed with a negative crossing. In all cases, coloring is the same across the top and determined by consistency at the bottom. Definition 1. A multitangle is an equivalence class of consistently colored multidiagrams. There is a useful (although somewhat imprecise) topological way of understanding the equivalence of multidiagrams. Think of a multidiagram as a diagram of framed tangles in cubes. For the most part any isotopy relative to the boundary of the cubes is an equivalence, exceptions being the rigidities listed above. Since these involve involutory pairs, and since caps can alter the involution, it is best to be careful when isotoping an event past a cap. A switch is a pair of marks that can slide up or down together unless obstructed by a cup, cap or triad. Any pair of switches that meets will cancel (and thus can be created), and a single switch can be canceled (or created) at a cup. Triads, as long as they are moved about in pairs, can be manipulated as though the performing edge slides on a graph provided the only other events encountered are crossings and triads. Interactions with cups are as expected, and in practice one can usually keep caps at the top of the tangle and switches at the bottom. When this is not possible, it is best to rely on the explicit moves as listed. Stumps can be isotoped almost anywhere (only caps are a problem) so long as they never become horizontal. In particular, one can almost always shrink a segment ending in a stump to be very short, and if the other end is a triad or another stump, the segment can be eliminated. In other words, as long as one avoids caps and keeps triads and stumps upright, any continuous deformation of a multitangle is an equivalence and, with the possible exception of the special moves, the behavior of cups, stumps, triads, and switches is fairly intuitive. Finally, in many applications the coloring of a multidiagram is irrelevant. One may then treat every segment as carrying the color b so that consistency is automatic, even for the special moves. In fact, for trivially colored multidiagrams, the special moves reduce to Fig. 17.
Fig. 17. Special moves with trivial coloring
2.3. We begin building a functor from M to A by sending a lattice to its connections and the elementary diagrams to the morphisms described below.
Topological Interpretations of Lattice Gauge Field Theory
61
The identity: This diagram induces the identity on connections and on the gauge algebra. Crossings: The map on connections is an action of the R-matrix or its inverse. There are 12 cases depending on the sign of the crossing, the directions of the arcs, and the possibility that they are an involutory pair. These are given in Fig. 18, which describes the action in the factors corresponding to the crossing arcs. The map extends linearly on connections, using the identity in all other factors. The map on the gauge algebra is the identity. ty
sx
x
y
S(s)y
tx
x
y
yS(t)
sx
x
yS 2 (s)
x
y
tx
y
ty
xS(s)
x
y
S(s)y
xS(t)
x
y
yS(t)
x
xS(s)
sxS(t)
txS(s)
x
x
y
yS 2 (s)
x
xS(t)
txS 2 (s)
S(s)xS(t)
x
x
y
Fig. 18. Action of R and R−1 at crossings
Triads: Suppose that e and −e are replaced by e0 , e00 , −e00 and −e0 , with e ∈ O originally. The map on connections is comultiplication in the factor corresponding to e and the identity elsewhere, with the requirement that the image of the comultiplication take values in the tensor product of the factors corresponding to e0 and e00 in that order. The distribution of the output, using Sweedler notation with summation suppressed, is illustrated in Figure 19. The diagram acts trivially on G. x0
x00
x
x00
x0
x
Fig. 19. Action of a triad
Caps: There are four cases at a local maximum, depending on orientations and on whether or not the incoming strands represent an involutory pair in the domain lattice. These are listed in Fig. 20, where trW denotes the ordinary trace taken in the H-module W coloring that segment. If the lattice loses a vertex then the map on G is in that factor; otherwise it is the identity. xy
x
y
ykx
x
y
tr W (x)
x
tr W (xk)
x
Fig. 20. Operators corresponding to cups and caps
1
k−1
62
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Cups: The action on A is either by the unit of H or by the unit followed by multiplication by k −1 , depending on the orientation of the cup. The two cases are shown in Fig. 20. The map on gauge algebras is the identity. Stumps: A stump acts as the counit in the corresponding factor of the connections. If the range lattice loses one or more vertices because of this, the map on gauge algebras is counit in those factors. Otherwise it is the identity. Switches: For switches the map on connections is x 7→ S(xk) in the factor corresponding to the edge. The map on G is trivial. Cuts: A cut has no effect on connections. It acts trivially on G except in the factor corresponding to the split vertex, where the map is 1 : Hv → Hv0 ⊗ Hv00 . Here v 0 denotes the initial subset of v after the cut, and v 00 the final subset. A general multidiagram is a composition of elementary ones, so it is sent to the corresponding composition of maps. Theorem 2. Equivalent multidiagrams from 0 to 00 induce identical maps on connections and gauge algebras. The map on connections intertwines the action of G0 on A0 with the one on A 00 pulled back via the map on gauge algebras. Proof. To check that equivalent multidiagrams induce the same morphisms one must evaluate both sides of each move under every possible arrangement of orientations and crossings. Number the moves in each of Figs. 11–16, reading left to right and down the page. We will outline the identities and manipulations in H that make each move invariant on connections. That both sides induce the same map on gauge algebras is elementary. Invariance of generalized Reidemeister moves: 1. This follows from the fact that R and R−1 solve the quantum Yang-Baxter equation. 2. Replacing any appearance of S 2 (x) with kxk −1 proves invariance in all cases. 3. This is essentially the identity ( ⊗ 1)(R) = (1 ⊗ )(R) = 1. For some orientations the fact that (S(x)) = (x) is also needed. 4. With the strand directed upwards the left-hand side produces the following morphism, where subscripts indicate successive applications of R and implied sumP mation. Note that R−1 = I S(si ) ⊗ ti : x 7→ xS 2 (s1 )kS(t1 ) = xS(t1 k −1 S(s1 )) = xS(t1 θt2 S 2 (s2 )S(s1 )) = xS(θ)S(t1 t2 S(s1 S(s2 ))) = θx.
5. 6. 7. 8. 9.
Similar computations show that, regardless of orientation, both sides act as multiplication by θ. If the crossings are reversed the action is by θ−1 . This is similar to 2. Those cases that are not immediate follow from an application of S 2 (x) = kxk −1 . RR−1 = 1. Depending on crossings, use one of the identities 1 ⊗ 1(R) = s1 ⊗ s2 ⊗ t1 t2 or 1 ⊗ 1(R) = s1 s2 ⊗ t2 ⊗ t1 . Obvious.
Topological Interpretations of Lattice Gauge Field Theory
63
Triad moves: 1. 1(k −1 ) = k −1 ⊗ k −1 . 2. 1 is coassociative. Cap moves: 1. That S is an anti-algebra morphism suffices. 2. 1 is an algebra morphism. 3. is an algebra morphism and (k) = 1. Stump moves: 1. is the counit for 1. 2. (k −1 ) = 1. 3. From earlier identities, ( ⊗ )(R±1 ) = 1 Switch moves: 1. S(k) = k −1 . 2. ◦ S = and (k) = 1. 3. This is the claim that x 7→ S(xk) is an involution. It follows from S 2 (x) = kxk −1 . 4. (S ⊗ S)(R±1 ) = R±1 . Specials: 1. The definitions of S and . In Sweedler notation the identity is x(1) ⊗ x(2) = x(1) ⊗ S(x(2) )x(3) ⊗ x(4) = x(1) ⊗ x(2) S(x(3) ) ⊗ x(4) . 2. Constrained non-cocommutativity. In Sweedler notation x(1) ⊗ sx(2) ⊗ tx(3) ⊗ x(4) = x(1) ⊗ x(3) s ⊗ x(2) t ⊗ x(4) . 3. S is an anti-coalgebra map and k is grouplike. Checking that every multitangle is a G-module intertwiner is again a matter of checking each elementary diagram under all orientations and crossings. As above, we will indicate the essential identity or manipulation on which the computation rests. Identity: This is obvious. Crossings: Apply the constrained non-cocommutativity identity to prove that a gauge transformation by y at a single vertex is an intertwiner. Any other gauge transformation can be expressed as sums of products of these. Triads: Coassociativity of 1 again. The proof is trivial in Sweedler notation. Caps: Apply the definition of S to check that gauge transformation by y at a single vertex is an intertwiner. Cups: These work for pretty much the same reasons that caps do. Stumps: Follows from the definition of . Switches: S is an anti-algebra map. Cuts: Coassociativity of 1. Remark. We can think of and as single events called positive and negative twists respectively. It is worth remembering that a positive twist acts on a connection as multiplication by θ−1 in that factor. A negative twist acts by θ.
64
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
3. Comultiplication of Connections Fix a lattice 0 = (E, −, V c , O). We define a multitangle whose domain is 0 by repeating the following construction at each vertex: Apply a triad to each arc. Then move the strands corresponding to the x0 ’s to the left of the strands corresponding to the x00 ’s so that the latter segments cross over. Finally, cut the diagrams to separate the x0 ’s from the x00 ’s. An example is given in Fig. 21.
Fig. 21. Multitangle for ∇
The multitangle determines a range lattice denoted 0⊗2 . Its envelope is two disjoint copies of the envelope of 0, but it is important to distinguish them as the prime and double prime copies. The induced morphism on connections is denoted ∇ : A 0 → A0⊗2 . The map on gauge algebras is the standard comultiplication on a tensor power of H. We make the identification A 0 ⊗ A 0 = A0⊗2 , and define 0 = ⊗e∈O e : A0 → b. Theorem 3. The triple (A, ∇, 0 ) is a coalgebra. Proof. Fig. 22 depicts diagrams for (∇ ⊗ 1) ◦ ∇ and (1 ⊗ ∇) ◦ ∇ at one possible trivalent vertex. To see that the left side is equivalent to the right, slide the higher triads down to the lower ones and then back up the other segments. This is possible because 1 is coassociative and because the diagrams separate into three disentangled layers. This phenomenon holds in general, and it is possible to organize this information into an inductive proof that ∇ is coassociative. We leave the details to the reader, with the suggestion that one use a coupon, say n
to denote the diagram for ∇ at a generic n-valent vertex. It is also convenient that
Topological Interpretations of Lattice Gauge Field Theory
65
= n
i
n . −i
The fact that stumps can be retracted and absorbed into triads gives a simple multitangle proof that (0 ⊗ 1) ◦ ∇ = (1 ⊗ 0 ) ◦ ∇ = 1. Thus 0 is a counit for ∇.
Fig. 22. A suggestion of the coassociativity of ∇
The adjoint of ∇, restricted to observables, is denoted by ?: if f, g ∈ O and x ∈ A, then (f ? g)(x) = (f ⊗ g)(∇(x)). Note that 0 is itself an observable. Corollary 2. (O, ?, 0 ) is an algebra. Proof. The intertwining property of morphisms induced by multitangles insures that ? takes values in O. Linearity and associativity follow from linearity and coassociativity of ∇, and 0 is the unit for ? because it is the counit for ∇. 4. Computing in O The algebras of observables for lattices that differ only by orientation or by the cyclic ordering of the ciliated vertices should be isomorphic. Furthermore, mimicking a classical phenomenon, the value of an observable on a connection should be computable from a suitable connection on the complement of a maximal tree in the graph. In the next two sections we will fix a lattice, (E, −, V c , O), and prove that these goals can be met, up to canonical isomorphisms. We will also address the interaction of multitangles with the algebra and coalgebra structures from the previous section. Throughout these two sections, all multitangles are assumed to have trivial coloring. 4.1. Given e ∈ O, let σe denote the map on connections induced by the multitangle which is trivial except for a switch on the strands ±e. In an envelope of 0, σe switches the orientation of the core of the corresponding band. Given v ∈ V , let τv = |v|−1
,
and τv−1 =
|v|−1
.
Here an integer next to an arc indicates that many parallel copies. The orientations are determined by the orientations of the edges at v, and the rest of the multitangle is trivial. The effect on an envelope of τv is to toggle the cilium at v one step counterclockwise, while τv−1 toggles it the other way.
66
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Let e ∈ O so that e and −e lie in distinct vertices, e occupies the last position in the ciliation, and −e occupies the first. Define
πe =
n
n
where the coupon denotes n − 1 triads and the two strands entering it represent e and −e. The rest of the multitangle is trivial. The domain and range lattices are identical. The effect of the map on a connection is N described in Fig. 23, which also introduces the convention of writing a simple tensor in e∈O He by labeling the corresponding cores in an envelope. We call this map a push. x(n) yn
yn x
1
x(1) y1
y1
Fig. 23. Effect of a push on a connection
In order to avoid belaboring useless notation, we will assume that the domains of successive applications of switches, toggles and pushes are clear, provided the original domain was specified. We will also suppress the subscripts whenever possible. Any sequence of toggles, switches and pushes defines a G-module map between connection algebras and thus an operator between observables as well. We say that two connections are gauge equivalent if their difference lies in the span of {y · x − (y)x | x ∈ A, y ∈ G}. Observables cannot distinguish gauge equivalent connections. Two morphisms in A (with the same domain and range) are gauge equivalent if the images of every connection are gauge equivalent. The adjoints of a pair of gauge equivalent operators are identical maps on observables. Proposition 1. Let f be any sequence of toggles and switches that begins and ends at the same lattice. The induced operator on connections is gauge equivalent to the identity. Proof. It suffices to check the compositions σ 2 , τ ± τ ∓ , στ ± στ ∓ , and τv±n , where n is the valence of v. Clearly σ is an involution. It follows easily from tangle equivalence that the next two are also the identity map. The multitangle for τ n is trivial away from v. At that vertex it is represented by
n
where the coupon denotes the generator (with positive crossings) of the center of the n-strand braid group. Note that it consists only of crossings and twists. Because such a tangle acts as multiplication in the factors corresponding to each segment, its behavior can be understood by its effect on the connection 1. We can evaluate this as follows:
Topological Interpretations of Lattice Gauge Field Theory
67
n
τ n (1) =
n
=
= 1n−1 (θ−1 ).
=
n
Hence, the effect on an arbitrary connection is gauge action by θ−1 at v. The same proof −|v| with all crossings reversed shows that τv is gauge action by θ. 4.2. The standard tools for manipulating connections and observables are toggles, switches, pushes, triads (in succession), cups, caps (involving non-involutory pairs), stumps and cuts. We will need an understanding of how well they interact with the coalgebra and algebra structures. We already have notation for the first three maps. Let 1ne be the map induced by a succession of triads on the edges e and −e. We extend the notation to include 10 for the identity and 1−1 for a stump. A cup oriented from e1 to e2 (necessarily involutive) induces the map ηee12 . A cap oriented from e1 to e2 , a non-involutive pair, induces µee21 . A cut between e1 and e2 (in that order) induces κee21 . The notation is deliberately parallel with the defining maps of H, and when context permits we will suppress sub- and superscripts. Theorem 4. The maps σ, 1n , η and µ are coalgebra morphisms. Proof. A switch slides up through the multitangle for ∇ ◦ σ and, after a special move, becomes a pair of switches on the appropriate edges. Now apply the special move corresponding to R1 = 1op R to obtain a tangle for (σ ⊗ σ) ◦ ∇. Consider the multitangle for (µ ⊗ µ) ◦ ∇. At the vertex where the cap occurs we can expand this as
i
2
j
Since the caps do not involve involutory pairs, there is a cap move that makes this into a tangle for ∇ ◦ µ. The proof that (η ⊗ η) ◦ ∇ = ∇ ◦ η is similar.
Fig. 24. Triad commuting with ∇ at a valence two vertex
If the lattice has only two edges, the proof that (1 ⊗ 1) ◦ ∇ = ∇ ◦ 1 is just Figure 24. If there are more edges a similar proof works because of the layering phenomenon seen in the proof of Theorem 3. Higher powers of 1 follow immediately; 10 is trivial; and 1−1 comes from retracting stumps into triads.
68
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
In many applications the output of a multitangle is needed only up to gauge equivalence. There is a particular occurrence which can greatly simplify computations. Let φ be the operator induced by a multitangle that is trivial except for
i
j
.
The difference between the range and domain lattices is just that a subset of consecutive edges in some vertex has been split off to form a new one. The identity map on connections is an operator with the same domain and range as φ. However, it cannot be expressed via the trivial multitangle because the set of edges split off to make the new vertex is not at the end of the original ciliation. Proposition 2. With notation as above, φ is gauge equivalent to the identity. Proof. Given a connection x, we can express φ(x) as an action of φ(1) on x, as in the proof of Proposition 1. In the interest of computing φ(1), replace the i strands of the tangle with a single strand followed by 1i−1 . Tangle equivalence allows the triads to slide over the crossing, after which we find that the action is by 1i−1 (sj · · · s2 s1 ) in the i strands and by t1 ⊗ t2 ⊗ · · · ⊗ tj in the j strands. Now consider the effect of φ on x1 ⊗ · · · ⊗ xj ⊗ y1 ⊗ · · · ⊗ yi in the factors corresponding to the non-trivial part of the tangle. The result is t1 · x1 ⊗ · · · ⊗ tj · xj ⊗ 1i−1 (sj · · · s1 ) · (y1 ⊗ · · · ⊗ yi ), where tk · xk means tk yk or yk S(tk ), depending on orientation of the segment, and similarly for 1i−1 (sj · · · s1 ) · (y1 ⊗ · · · ⊗ yi ). By definition, this is gauge action of 1 ⊗ (sj · · · s1 ) on the connection t1 · x1 ⊗ · · · ⊗ tj · xj ⊗ y1 ⊗ · · · ⊗ yi , so the result is gauge equivalent to (sj · · · s1 )t1 · x1 ⊗ · · · ⊗ tj · xj ⊗ y1 ⊗ · · · ⊗ yi . Since ( ⊗ 1)(R) = 1, this is indistinguishable from the behavior of the identity map. Theorem 5. Up to gauge equivalence, τ ± , κ and π are coalgebra maps. Proof. Draw the tangle for (τv ⊗ τv ) ◦ ∇. By Proposition 2 we can replace the cut with |v|
|v|
The result is equivalent to the tangle for ∇ ◦ τv . Commutation of τ −1 derives from its gauge equivalence with some power of τ . For (κ ⊗ κ) ◦ ∇ the tangle at the cut vertex is
.
Topological Interpretations of Lattice Gauge Field Theory
69
By Proposition 2, this is gauge equivalent to ∇ ◦ κ. Since π is composed of triads, caps, a cut and a cup, it too commutes up to gauge equivalence. Corollary 3. The adjoints of τ ± , σ, π, 1n , η, µ and κ restricted to observables are algebra maps. Since τ and σ are invertible algebra morphisms, we can now see that O is independent of orientation, up to isomorphism, and that it depends only on the cyclic ordering of edges at vertices. 5. Pushes The goal of this section is to prove that a push is invisible to any observable. Let’s begin with a basic fact about invariant tensors. Suppose that U and W are left H-modules. As in Subsect. 1.4, (U ∗ ⊗ W )0 is a right module. This can be identified with Hom(W, U ) as follows: if φ ∈ U ∗ , w ∈ W , then h ∈ Hom(W, U ) becomes the functional sending φ ⊗ w to φ(h(w)). This isomorphism is an intertwiner if we use the following action: for z ∈ H and h ∈ Hom(W, U ), (h · z)(w) = S(z 0 ) · h(z 00 · w). Lemma 1. If h is invariant then, for all z ∈ H and all w ∈ W , h(z · w) = z · h(w). Proof. Let y = S −1 (z). Using Sweedler notation and invariance of h under the action of y 0 , we have h(z · w) = h(S(y) · w) = h((y 0 )S(y 00 ) · w) = (y 0 )h(S(y 00 ) · w) = S(y 0 ) · h(y 00 · S(y 000 ) · w) = S(y 0 ) · h((y 00 )w) = S(y) · h(w) = z · h(w). Now choose a coloring of the lattice with notation ρe , We , and Wv as in Subsect. 1.4. Suppose that our lattice contains the configuration in Fig. 23 and that the vertex on the right is v0 = {−e0 , e1 , e2 , . . . , eN n } (with each ei ∈ O). Choose a gauge field of the form f ⊗ g, where f ∈ Wv0 0 and g ∈ v6=v0 Wv0 , and write the connection depicted in Fig. 23 as z ⊗ x ⊗ y1 ⊗ · · · ⊗ yn . The usual is to convert the gauge field and the connection into N N method of evaluation tensors in e∈E We0 and e∈E We , then tensor them together and contract. (Meaning evaluate the functionals in the We0 ’s on the vectors in corresponding We ’s.) Since these contractions can take place in any order, we can focus on just those taking place between We and We0 for e ∈ v0 . To see the invariance of a push, however, we need to think of these contractions as a composition of morphisms. Let W denote We1 ⊗ · · · ⊗ Wen and let y = y1 ⊗ · · · ⊗ yn . Apply ρe ’s so that x ∈ Hom(We0 , We0 ) and y ∈ Hom(W, W ). We can now view f , and hence x ◦ f ◦ y, as elements of Hom(W, We0 ). Using standard identifications, this becomes a tensor in We0 ⊗ We∗1 ⊗ · · · ⊗ We∗n . The evaluation of the full gauge field is now completed by contracting g with α ⊗ (x ◦ f ◦ y). Lemma 2. With notation as above, if f is invariant then x ◦ f ◦ y = 1 ◦ f ◦ (x(1) y1 ⊗ · · · ⊗ x(n) yn ). Proof. Choose w ∈ W . Reinterpret (x ◦ f ◦ y)(w) as x ∈ H acting on f (y(w)). Then apply Lemma 1.
70
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
In light of Corollary 1, we have established the following result: Theorem 6. The adjoint of a push is the identity on observables. Corollary 4. Every sequence of toggles, switches and pushes from one lattice to another induces the same isomorphism on observables. Proof. Since pushes induce the identity, it suffices to prove this for just toggles and switches. By Proposition 1, any two sequences of toggles and switches are gauge equivalent. We have succeeded in proving that O is independent of orientation and that it depends only on cyclic ordering at vertices. Also, Corollary 4 indicates that we can evaluate observables on whatever configuration is most favorable for the application at hand. There is one more task. We want to construct (as nearly as possible) a universal description of observables. 6. Quantum Holonomy Fix 0 = (E, −, V c , O), with envelope F . We will be quantizing the notion of holonomy along a loop in the lattice. In the classical world, a loop in 0 would be just that, the image of an oriented S 1 with base point. However, in order to quantize, we need the image to be generic and to introduce over- and under-crossings. That is, we need a knot diagram, not just a loop. Also, the base point introduces some technicalities. We will refer to the disks in F representing the elements of V as vertices and the bands as edges. Let α be a proper, generic immersion from a disjoint, finite collection of oriented intervals into F , so that endpoints map to cilia, double points lie in vertices, and the image in each edge consists of arcs parallel to the core. Introduce over- and under-crossings at each interior double point. The resulting object is called a q-net. The special case when the domain is a single interval is called a q-path if the endpoints are distinct, and a q-loop if not. 6.1. A q-net, α, determines an operator, holα , from A to a tensor power of H indexed by the components of α. It is defined as the composition of a pair of multitangles connecting a trio of lattices. The first lattice is 0. The last is determined by the multitangles. The intermediate one comes from α, and it is best defined by constructing its envelope as a subsurface of F . Its fattened vertices are the vertices of F that α meets. Its fattened edges are obtained by thickening the arcs of α in the edges of F . Their cores are oriented according to the orientation of α, and the ciliation is inherited from F . The multitangle connecting the first two lattices is formed as follows: Apply 1m−1 to each pair ±e, where m is the number of times γ meets the corresponding edge of F . The range of this morphism is a lattice identical to the intermediate one, described above, except possibly for orientation. Continue the multitangle by inserting switches whenever the orientations disagree. Color with trivial representations. The second multitangle is formed from the oriented tangles created by α in each vertex of F . Given a vertex, apply a M¨obius transformation mapping it to the upper half plane with the cilium at infinity. Choose a rectangular region that contains all of the image of α except for disjoint arcs running from the top edge to infinity. Rescale this to a unit square and color trivially. The composition of the two induces the operator O Hc . holα : A → c a component of α
Topological Interpretations of Lattice Gauge Field Theory
71
One may think of envelope of the final lattice as the domain of α. Since each vertex is univalent, ciliation is irrelevant. Thus holα is an intertwiner from connections on 0 to connections on the domain of α. 6.2. The notation holα is meant to be read, “holonomy along alpha.” To see it as a quantum analog of holonomy, and to illustrate some computational devices, we will work an example where 0 and α N are as in Fig. 25. Consider the connection x = ei ∈O xi . Since there is no prescribed ordering to the factors, we express x by labeling each edge of 0 with the corresponding xi as in Fig. 26. The evaluation of holα (x) begins with comultiplication applied to each of x4 , x5 and x6 , followed by switches on the output of 1(x5 ). The resulting connection lives over the intermediate lattice described in the definition of holα . The envelope and connection together appear in Fig. 27. e4
e1
e5
e2 e6
e3
Fig. 25. Envelope of 0 and a q-loop, α
x4
x1
x5
x2 x6
x3
Fig. 26. Connection x = ⊗6i=1 xi
x04
x1
x00 4 S(x00 5 k)
S(x05 k)
x2
x00 6 x06
x3
Fig. 27. Intermediate envelope and connection for holα (x)
Next we evaluate the multitangle obtained by expanding the vertex tangles. Let us assume that the multitangle has been isotoped so that evaluation proceeds one vertex at a time. The tangle for the center vertex and the connection in its domain are shown in Figure 28.
72
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
x3 x1 x04
00 x00 4 x6
x06
Fig. 28. Central vertex tangle
Evaluation leads to the connection and envelope shown in Fig. 29. Note that the two caps give rise to a lattice with (abstractly) four fewer edges and a new involution. This is reflected in the envelope by the concatenation of pairs of edges into single edges. t1 x04
S(x00 5 k)
2 x00 6 S (s2 )ks1 x1
S(x05 k)
x06 kt2 x00 4
x2
x3
Fig. 29. Evaluation of the central vertex tangle
The remaining vertex tangles are caps, none of which involve an involutory pair of strands. Each evaluation glues two edges of the envelope together at a vertex, creating a single edge that bypasses the vertex. The effect on the connection is multiplication in those two factors, with the cap’s orientation determining whether or not k is inserted between them. The final result is holα (x) = t1 x04 kS(x005 k)kx06 kt2 x004 kS(x05 k)kx006 S 2 (s2 )ks1 x1 x2 x3 . There is an alternative, more intuitive, method of computing holonomy. Begin with the connection drawn on the envelope as in Fig. 26. Then draw the intermediate envelope. Label new edges with Sweedler notation, reading right to left with respect to the original orientation. If any edge is not traversed by the loop, remember to counit that factor of the connection. Apply S( · k) whenever the loop’s orientation disagrees with that of the envelope, and the result is again Fig. 27. Next sketch each vertex tangle in which crossings occur. Evaluate only the crossings, writing the result on the intermediate lattice. In our example this gives Fig. 30. Finally, traverse the q-loop from beginning to end, concatenating the symbols on each edge traversed. Additionally, each time the loop passes through a vertex insert k if the cilium lies to the right. In the classical limit k = 1 and R = 1⊗1, so holα is actually accumulating holonomy as the loop is traversed. Quantization occurs when self intersections become over- or under-crossings. For another indication that holα (x) behaves like holonomy, suppose that z(1) ⊗ z(2) denotes the tensor sx1 x2 x3 ⊗ tx4 kS(x5 k)kx6 k with summation on both sides implied. The two factors resemble quantum holonomy around the two lobes of 0, 0 00 z(2) z(1) . and holα (x) = z(2) In a classical setting holonomy is inverted if the direction of the path is reversed. In a cocommutative Hopf algebra inversion is replaced by the antipode. In general, however,
Topological Interpretations of Lattice Gauge Field Theory t1 x04
73
s1 x 1
t2 x00 4 S(x00 5 k)
S(x05 k)
x2
2 x00 6 S (s2 )
x06
x3
Fig. 30. Schematic computation of holα (x)
S is not an involution. So, we have the following quantum analog of the reversing result for holonomy. Proposition 3. Let α be a q-net and α the q-net with a component c reversed. The operator holα is holα followed by a switch in the factor indexed by c. Proof. The map holα is defined by composing two multitangles: T1 , consisting of stumps and triads followed by some switches; and T2 formed from the vertex tangles. If a switch is inserted between T1 and T2 on every edge coming from c, the resulting multitangle defines holα . The new switches pass upwards through T2 , canceling at caps, until only one remains. This will lie on a pair of strands corresponding to the component c in the range of the multitangle T2 ◦ T1 . 7. Wilson Operators Roughly speaking, a Wilson operator is the trace of holonomy around a loop. To make this precise, let us extend the definition of q-net by allowing circle components in the domain. We will call the images of intervals based components and the images of circles unbased components. If there are no based components we call it a q-link. Finally, every unbased component must be colored with a finite dimensional H-module. We assume also that the based components are colored trivially. There is an equivalence relation on q-nets which, like the one on multidiagrams, mimics framed tangle isotopy. Two q-nets are equivalent if they differ by a sequence of isotopies of F , Reidemeister moves of type II and III, and the framing equivalence = . If one thinks of a q-net as a diagram of a framed tangle in F × I, then this equivalence is ambient isotopy fixing the endpoints of the based components and their framing normals. Let L be a q-net. As with quantum holonomy, L determines an operator that is obtained from the composition of two multitangles, T2 ◦ T1 . This time, however, the segments of T2 inherit the colors of the components of L. This coloring extends to T1 via consistency conditions. The resulting color on an edge in the domain of T1 can also be obtained as the right-to-left tensor product of the colors on arcs of L along that edge. The induced operator is denoted WL . It takes values in a tensor power of H indexed by the unbased components. Alternatively, one can think of the domain of L as a set of arcs and circles made into a lattice by ignoring the circles. The target of WL is connections on the domain of L. Proposition 4. If L and L0 are equivalent base point free q-nets with the same coloring then WL = WL0 .
74
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Proof. Cerf theory implies L and L0 differ by the moves of q-net equivalence, performed within vertices, together with the moves in Fig. 31. The latter alter multitangles by special moves, and the former by generalized Reidemeister moves.
Fig. 31. Slides of a q-net
As is usual in knot theory, we use the L to denote both a q-net (colored) and its equivalence class. The associated operator is called a Wilson operator. If L is a q-link we say WL is a Wilson link, and a Wilson link of one component is called a Wilson loop. In computing the output of a Wilson operator, we can use the same shortcut for caps as in 6.2. The starting point on a closed component does not matter because trace is invariant under cyclic permutation. Wilson operators obey a reversing result: if the reversed component is based the effect is as in Proposition 3, but if not its statement requires more care. Suppose that L and L differ by reversing an unbased component c colored by V . Let AL denote the connections where WL and WL take values. Define a map f : A → Hc ⊗A L as follows: Connect c to a base point to obtain a q-net L• . If the cilium at which c is based lies to its right, then f is WL• followed by right multiplication by k in the factor indexed by c. If it lies to the left, then f = WL• . Finally, define functions tr c and Sc on Hc ⊗ A L as tr V ⊗ 1 and S ⊗ 1 respectively. Proposition 5. With notation as above, WL = tr c ◦ f and WL = tr c ◦ Sc ◦ f . Remark. This is a bit easier to swallow if L = c. In that case the Wilson loop is computed by taking the trace of something, and the reversed loop is computed by taking the trace S of that something. Proof. Repeat the proof of Proposition 3 up to the point where all but one of the new switches have been canceled. This time the switch will be on two involutory strands entering a cap colored by V . The multitangles for WL and WL differ by replacing a cap with a switch followed by a reversed cap. Since the rest of the multitangle induces WL• , it is easy to verify the proposition for the two possible orientations of the cap. Since multitangles intertwine gauge transformations, Wilson links colored by adapted representations are necessarily elements of O. Furthermore, a Wilson link is determined by a geometric object associated to an envelope. While toggles and switches have no effect on the underlying q-net, the alterations to the lattice will effect the evaluation of the Wilson link. Fortunately the variance is natural. Theorem 7. Suppose that 0 and 00 differ by toggles and switches and that f is the induced map on connections. If WL and WL0 are Wilson links built on the same L in the two envelopes, then WL0 ◦ f = WL . Proof. Suppose 0 and 00 differ by a switch σ. In the multitangle for WL0 ◦σ, pass the first switch up through the triads (if any) on that edge and cancel any resulting consecutive switches. The result is a multitangle for WL . Assume now that the lattices differ by a counterclockwise toggle, τ . That part of the multitangle for WL is represented by the
Topological Interpretations of Lattice Gauge Field Theory
75
left side of Fig. 32, where the solid coupons are the switches and powers of 1 and the dashed coupon contains all the crossings of the transformed vertex. The portion of the multitangle for WL0 ◦ τ at that vertex is now the right side of the figure. Since these are equivalent diagrams, WL0 ◦ τ = WL .
i
j
j
n
n
i
Fig. 32. Tangle diagrams for WL and WL ◦ τv
Corollary 5. Let L be a q-link. The unique isomorphism between O0 and O00 identifies the Wilson links determined by L in each algebra. Observables produced by Wilson links can be graphically multiplied. Suppose that L and L0 are q-link. Laying L0 over L and perturbing the result creates a new q-link denoted L ? L0 . This operation is well defined on equivalence classes of q-links. Theorem 8. WL ? WL0 = WL?L0 . Proof. Let F denote the envelope of the lattice. If wt is a tangent vector along a band core, the right hand side of the edge is determined by a normal vector wn so that {wn , wt } is in the orientation of F . By equivalence of q-nets, we may assume that L lies to the right of L0 in every edge of F . At each vertex, the multitangle for WL?L0 begins with an arc for each edge of F , oriented accordingly. Apply a triad to each of these arcs so that it splits into a prime branch and a double prime branch. If L meets a given edge m times, apply 1m−1 to the prime branch for that edge. If L0 meets it n times, apply 1n−1 to the double prime branch. Now insert the necessary switches to make this the first half of the multitangle. Next, focus on the second part of the multitangle at a single vertex v of F . The transformed vertex fits onto the first part of the multitangle so that the arcs of L ∩ v meet the prime branches and the arcs of L0 ∩ v meet the double primes. Since L lies under L0 one can drag L ∩ v to the left and L0 ∩ v to the right until they are disjoint. Finally, move everything between the initial triad on each arc and L ∩ v to just beneath L ∩ v, and similarly for L0 ∩ v. This can be done for every vertex while preserving the simultaneous levels of triads and switches. Inserting a cut in between L ∩ v and L0 ∩ v in each diagram, we have a multitangle that represents (WL ⊗ WL0 ) ◦ ∇. Let bLF denote the linear space over the set of all framed, oriented, colored links in F × I (completed if b = C[[h]]). This is an algebra under ? which – for every 0 whose envelope is homeomorphic to F – is identified with a sub-algebra W0 ⊂ O0 . Corollary 4 makes these algebras into a category. The content of Corollary 5 is that bLF behaves somewhat like a universal object. One of the aims of the next section is to address how much of O is generated by Wilson links.
76
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
Part 2. The Structure of the Algebra of Observables In this part of the paper we investigate the structure of the algebra of observables for various choices of H and B. Suppose first that G is a connected affine algebraic group. We will show that the ring of G-characters of a free group is the algebra of observables for a theory in which H is the universal enveloping algebra of G and B is its coordinate ring. Next we consider the case when H is a Drinfeld-Jimbo deformation of the universal enveloping algebra. Here the observables become a deformation quantization of the classical character ring. Following Fock and Rosly, [10], we show that the Poisson structure with respect to which we are quantizing is the standard Poisson structure, as in the work of [2, 11]. We consider the extent to which one can generate the ring of observables using Wilson loops. Among the groups (and their quantum analogs) for which this is possible is SL2 (C). We conclude with a demonstration that the observables based on (Uh (sl2 ), q SL2 ) are exactly the Kauffman bracket skein algebra of a cylinder over the envelope of the lattice. 8. Classical LGFT 8.1. Let’s recap a few facts from [12]. An affine algebraic group G is a group equipped with a finitely generated algebra of “polynomial” functions that separate points – the coordinate ring, denoted B – so that multiplication and inversion are polynomial maps. Let H be the universal enveloping algebra of G. If the group is connected then its coordinate ring is naturally identified with a stable subalgebra of H o . G acts on itself by conjugation, which adjointly induces an action of G on B. The most important fact for us is that the fixed part of B under this action is exactly the ring B H as defined in Subsect. 1.1. Now suppose that π is any finitely presented group. A representation of π into G is a point in G × · · · × G whose coordinates are the images of the generators. These must satisfy polynomial identities corresponding to the relations of the presentation, so the space of all representations is an affine algebraic set. It has a coordinate ring on which G acts by the adjoint of conjugation in each factor. The fixed subring – which is independent of presentation (up to isomorphism) – is called the affine G-characters of π. We often shorten this to “characters” or “G-characters” when π or G (or both) are understood from context. The notation is XG (π). If π is the fundamental group of a compact manifold M , we write XG (M ) for XG (π1 (M )). 8.2. Fix a connected affine algebraic group G and a lattice 0 = (E, −, V c , O). Let H be the universal enveloping algebra of G and B its coordinate ring, thought of as lying in H o . In order to see what the observables of this theory look like, we rebuild it using groups instead of algebras. Let the connections be the set of functions A : O → G. The gauge group is the set of functions g : V → G, and the gauge fields are the set ⊗e∈O B. We can view the connections as the Cartesian product of copies of G indexed by O. The gauge fields are just the coordinate ring of the Cartesian product. The action of the gauge group on the connections is given by g · A(e) = g(i(e))A(e)g −1 (t(e)), where e ∈ O, g is an element of the gauge group, and A is a connection. This induces a right action of the gauge group on the gauge fields by taking adjoints. Let OG denote the gauge fields fixed by this action.
Topological Interpretations of Lattice Gauge Field Theory
77
Theorem 9. Let G, H, B, 0 = (E, −, O, V c ) and OG be as above, and let O denote the usual observables. 1. O = OG . 2. OG is the G-characters of π1 of the geometric realization of (E, −, V, O). Proof. 1. Note that the gauge group and the gauge algebra act on the same set of gauge fields. A gauge field is invariant under the action of the gauge algebra if and only if it is invariant under elements of the form 1 ⊗ · · · ⊗ y ⊗ · · · ⊗ 1, where y lies in the Lie algebra of G. The proof that these fields are exactly those fixed by the gauge group action is now a simple generalization of [12, Corollary IV.3.2]. 2. If the lattice has one vertex containing all the edges then OG is, by definition, the G-characters of the fundamental group of the geometric realization. For arbitrary 0 consider another lattice 00 that has a single vertex, and so that the two geometric realizations are homotopic. Choose a maximal tree in the geometric realization of 0. There is an obvious map from the connections on 00 into those on 0 that sends them to the edges of O not appearing in the tree. That this is an isomorphism at the level of observables is an elementary exercise. 9. Quantized Characters For this subsection we assume that (H, B) is defined over C[[h]], and H is a DrinfeldJimbo quantization of a simple Lie algebra g [13]. In this case, H/hH is the universal enveloping algebra of g. We will denote such H by Uh (g). Suppose that B/hB is the coordinate ring of a connected affine algebraic group G. The equivalence of the representation theory of Uh (g) and U (g) makes it easy to see that O/hO is the observables associated to the theory based on (U (g), B/hB). We use topological tensor products as in [13], so the gauge fields are topologically free. Since observables form a closed subalgebra, it is also topologically free. Therefore the observables based on (Uh (g), B) are a deformation quantization of the G-characters of the fundamental group of the geometric realization of 0. The only question that remains unanswered is which Poisson structure on the ring of characters is the tangent vector to this deformation. We can assume that Uh (g) has an R-matrix of the form 1 ⊗ 1 + hr + h2 a, where a is some formal power series with coefficients in U (g) ⊗ U (g), and r is a solution of the modified classical Yang-Baxter equation. To be specific, r ∈ g ⊗ g. Such solutions were classified by Belavin and Drinfeld [14]. The standard presentation of U (g) is in terms of generators Xi , Yi , Hi , where i runs over some index set, and each triple generates a copy of U (sl2 ). The Killing form is an element of g∗ ⊗ g∗ , but being nondegenerate, you can contract it with respect to itself to give an element of g ⊗ g. This element can be expressed in the form ai Xi ⊗ Yi + bi Hi ⊗ Hi + ci Yi ⊗ Xi . The element r can be assumed to be of the form r = 2ai Xi ⊗ Yi + bi Hi ⊗ Hi . There are two actions of r on B ⊗B. You can act on the left, by letting r·(f ⊗g)(Z1 ⊗ Z2 ) = f ⊗ g(r Z1 ⊗ Z2 ), or you can act on the right by letting (f ⊗ g) · r(Z1 ⊗ Z2 ) = f (Z1 ⊗ Z2 r). The Poisson bracket on G is given by
78
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
{f, g} = (f ⊗ g) · r − r · (f ⊗ g). In order to write out a formula for the Poisson structure, we need to create a version of r that operates on the gauge fields on a lattice. We also need to distinguish left actions and right actions: if Z acts by right multiplication in the factor corresponding to the edge e, we denote it by Z 0 (e); if it acts by multiplication on the left, we denote it by Z(e). Since the formula we derive involves antisymmetrization, we let Z1 ∧ Z2 = Z1 ⊗ Z2 − Z2 ⊗ Z1 . Now suppose that f and g are gauge fields in the quantum theory. One may compute f ? g − g ? f by writing it as f ⊗ g ◦ ∇ − g ⊗ f ◦ ∇, and expanding the R matrix as a power series in h. The linear term is X 2ai Xi0 (e) ⊗ Yi0 (e) + bi Hi0 (e) ⊗ Hi0 (e) − 2ai Xi (e) ⊗ Yi (e) − bi Hi (e) ⊗ Hi (e)+ e∈O
X
−
v∈V
2ai Xi0 (α) ∧ Yi0 (β) + bi Hi0 (α) ∧ Hi0 (β)
α<β
X
−
X
2ai Xi (−α) ∧ Yi (−β) + bi Hi (−α) ∧ Hi (−β)
−α<−β
+
X
2ai Xi0 (α) ∧ Yi (−β) + bi Hi0 (α) ∧ Hi (−β)
α<−β
+
X
2ai Xi (−α) ∧ Yi0 (β) + bi Hi (−α) ∧ Hi0 (β) .
−α<β
This is the same as the formula derived by Fock and Rosly. Hence the Poisson structure on our algebra of classical observables is the complex linear extension of the standard Poisson structure on the characters of the surface with respect to the compact group.
10. The Kauffman Bracket Skein Module At the end of Sect. 7 we introduced the algebra of links, bLF , which maps naturally into the observables for any lattice with envelope F . For lattice gauge field theory based on one of the groups GLn (C), On (C), Spn (C), the map is onto. This is due to a theorem of Procesi [15], stating that the invariant theory for Cartesian products of these groups is generated by traces. It follows that Wilson links generate observables for theories built on Drinfeld-Jimbo deformations of these groups as well. Furthermore, since each of these groups has a fundamental representation in whose tensor powers one may find all irreducible representations, a single color suffices. The invariant theory of SLn (C) is a quotient of the invariant theory for GLn (C), so here again Wilson links with a single color suffice. If n = 2, we can even specify the kernel of the map from links to observables in terms of skein relations. A space of links divided by skein relations is a skein module. We will show that the observables for a theory built on (Uh (sl2 ),q SL2 ) are the Kauffman bracket skein module. (Actually, there is a sign change involved in the morphism. This could be eliminated by redefining the skein module, but we prefer to keep its original form.)
Topological Interpretations of Lattice Gauge Field Theory
79
To obtain this result we need an explicit formula for the R-matrix in the fundamental representation. The generators of Uh (sl2 ) are X, Y and H. Let 21 be the vector space spanned by e− 1 , e 1 . The standard representation 2
2
1 ρ : Uh (sl2 ) → End( [[h]]) 2 is given by
ρ(X) =
01 00
ρ(Y ) =
00 10
ρ(H) =
1 0 . 0 −1
One may now expand the R-matrix in [13] using these matrices and writing eh/2 for each appearance of q. The trace on Uh (sl2 ) is just the trace under this representation, and takes on values in C[[h]]. The action of S in the fundamental representation is ab d −eh/2 b . 7→ cd a −eh/2 c So tr ◦ S = tr. In SL2 (C), the Cayley-Hamilton identity is: A2 − tr(A)A + I = 0. Putting the term in the trace on the other side of the equation, and multiplying by A−1 we get a linear homogeneous equation.: A + A−1 = tr(A)I. Now multiply by B to get back a bilinear equation: AB + A−1 B = tr(A)B. Finally take the trace: tr(AB) + tr(A−1 B) = tr(A)tr(B). This formula is the Cayley-Hamilton identity as a trace identity for SL2 (C). It is fundamental for SL2 (C) in the sense that every other identity between traces follows from evaluation of this one. The same identity persists in U (sl2 ), except that you need to use the antipode instead of the inverse: tr(ZW ) + tr(S(Z)W ) = tr(Z)tr(W ). Finally the fundamental trace identity for Uh (sl2 ) is: X tr(si Z)tr(ti W ), t tr(ZW ) + t−1 tr(S(Z)W ) = P
i
where i si ⊗ ti is the R-matrix for Uh (sl2 ) and t = eh/4 . Let LM be the set of framed links (including ∅) in a 3-manifold M . Let CLM [[h]] denote formal power series in h with coefficients in the vector space over LM . We define S(M ) to be the topological submodule of CLM [[h]] generated by all expressions of the form
80
1.
D. Bullock, C. Frohman, J. Kania-Bartoszy´nska
+t
+ t−1
,
and
2. + t2 + t−2 . These formulas indicate relations that hold among links which can be isotoped in M so that they are identical except in the neighborhood shown. The Kauffman bracket skein module is the quotient K(M ) = CLM [[h]]/S(M ). The Kauffman bracket skein module of F × I is an algebra with multiplication as in the space of links in Sect. 7. We denote it K(F ). From [7] we know that K(F ) is a deformation quantization of the SL2 (C)-characters of the fundamental group of F . Theorem 10. Let F be a compact, connected surface with boundary. If the surface underlying the envelope of 0 is F then the observables of a lattice gauge field theory based on (Uh (sl2 ),q SL2 ) are canonically isomorphic to K(F ). Proof. We define a map ζ : K(F ) → O as follows. Let L be a framed link in F × I. Represent it as a diagram in the envelope of 0 with the blackboard framing. Orient the components arbitrarily and color them with the fundamental representation. Now perturb it so that it becomes a q-link, also denoted L. Finally, map it to the observable (−1)|L| WL . This is well defined at the level of LF ×I by Propositions 4 and 5 and the fact that tr ◦ S = tr. That ζ sends elements of S(F × I) to zero follows from the quantum Cayley-Hamilton identity. By Theorem 8, ζ is an algebra map. To see that it is an isomorphism, consider the map induced between K(F )/hK(F ) and O/hO. This is known to be an isomorphism ([6]), so ζ must be one as well. References 1. Alekseev, A.Y., Grosse, H., Schomerus, V.: Combinatorial quantization of the Hamiltonian ChernSimons theory I–II. hep-th/9403066 and hep-th/9408097 and Commun. Math. Phys. 172, 317–358 (1995) 2. Biswas, I. and Guruprasad, K.: Principle bundles on open surfaces and invariant functions on Lie groups. Int. J. Math. 4, 535–544 (1993) 3. Buffenoir, E.: Chern-Simons theory on a lattice and a new description of 3-manifold invariants. qalg/9509020 4. Buffenoir, E. and Roche, Ph.: Two dimensional lattice gauge theory based on a quantum group. Commun. Math. Phys. 170, 661–698 (1995) 5. Buffenoir, E. and Roche, Ph.: Link invariants and combinatorial quantization of Hamiltonian ChernSimons theory. q-alg/9507001, and Commun. Math. Phys. 181, 331–365 (1996) 6. Bullock, D.: Rings of SL2 (C)-characters and the Kauffman bracket skein module q-alg/9604014, to appear in Comm. Math. Helv. 7. Bullock, D., Frohman, C. and Kania-Bartoszy´nska, J.: Understanding the Kauffman bracket skein module. q-alg/9604013, to appear in J. Knot Theory Ramifications 8. Bullock, D., Frohman, C. and Kania-Bartoszy´nska, J.: Skein quantization and lattice gauge field theory q-alg/9609024, and Chaos, Solitons & Frachels 9, 811–824 (1998) 9. Drinfeld, V.G.: Quantum groups. In: Proc. Int. Congress Math., Berkeley 1986, American Mathematical Society, 1987, pp. 798–820 10. Fock, V.V. and Rosly, A.A.: Flat connections and polyubles. Teoreticheskaya i Matematicheskaya Fizika 95, no. 2, 228–238 11. Goldman, W.: Invariant functions on Lie groups and Hamiltonian flows of surface group representations. Invent. Math. 85, 263–302 (1986)
Topological Interpretations of Lattice Gauge Field Theory
81
12. Hochschild, G.: Basic Theory of Algebraic Groups and Lie Algebras, Berlin–Heidelberg–New York: Springer Verlag, 1995 13. Kassel, C.: Quantum Groups, Berlin–Heidelberg–New York: Springer-Verlag, 1995 14. Korgodsky, L. and Soibelman, Y.: Algebras of functions on quantum groups. In: Mathematical surreys and monographs; no 56. Providence, Rhode Island: American Mathematical Society, 1998 15. Procesi, C.: The Invariant Theory of n × n Matrices. Adv. Math. 19, 306–381 (1976) 16. Przytycki, J.H. and Sikora, A.: On skein algebras and SL2 (C)-character varieties. q-alg/9705011, to appear in Topology 17. Sikora, A.: A new geometric method for SLn -representations. Preprint 18. Sweedler, M.: Hopf Algebras, New York. W.A. Benjamin, 1969 Communicated by A. Jaffe
Commun. Math. Phys. 198, 83 – 95 (1998)
Communications in
Mathematical Physics © Springer-Verlag 1998
Multidimensional Extension of the Generalized Chowla–Selberg Formula E. Elizalde1,2 1
Consejo Superior de Investigaciones Cient´ıficas (CSIC), Institut d’Estudis Espacials de Catalunya (IEEC), Edifici Nexus 201, Gran Capit`a 2–4, 08034 Barcelona, Spain. E-mail:
[email protected] 2 Departament ECM and IFAE, Facultat de F´ısica, Universitat de Barcelona, Diagonal 647, 08028 Barcelona, Spain. E-mail:
[email protected] Received: 20 July 1997 / Accepted: 27 March 1998
Abstract: After recalling the precise existence conditions of the zeta function of a pseudodifferential operator, and the concept of reflection formula, an exponentially convergent expression for the analytic continuation of a multidimensional inhomogeneous Epstein-type zeta function of the general form X (~nT A~n + ~bT ~n + q)−s , ζA,~b,q (s) = p ~ n∈Z with A the p × p matrix of a quadratic form, ~b a p vector and q a constant, is obtained. It is valid on the whole complex s-plane, is exponentially convergent and provides the residua at the poles explicitly. It reduces to the famous formula of Chowla and Selberg in the particular case p = 2, ~b = ~0, q = 0. Some variations of the formula and physical applications are considered.
1. Introduction: Existence of the Zeta Function of a Pseudodifferential Operator (9DO) A pseudodifferential operator A of order m on a manifold Mn is defined through its symbol a(x, ξ), which is a function belonging to the space S m (Rn ×Rn ) of C∞ functions such that for any pair of multi-indexs α, β there exists a constant Cα,β so that α β ∂ξ ∂x a(x, ξ) ≤ Cα,β (1 + |ξ|)m−|α| . (1) The definition of A is given, in the distribution sense, by Z −n ei<x,ξ> a(x, ξ)fˆ(ξ) dξ, Af (x) = (2π)
(2)
84
E. Elizalde
where f is a smooth function, f ∈ S [remember that S = {f ∈ C ∞ (Rn ); supx |xβ ∂ α f (x)| < ∞, ∀α, β ∈ Rn ], S 0 being the space of tempered distributions and fˆ the Fourier transform of f . When a(x, ξ) is a polynomial in ξ one gets a differential operator. In general, the order m can be complex. The symbol of a 9DO has the form a(x, ξ) = am (x, ξ) + am−1 (x, ξ) + · · · + am−j (x, ξ) + · · · ,
(3)
being ak (x, ξ) = bk (x) ξ k . Pseudodifferential operators are useful tools, both in mathematics and in physics. They were crucial for the proof of the uniqueness of the Cauchy problem [1] and also for the proof of the Atiyah-Singer index formula [2]. In quantum field theory they appear in any analytical continuation process (as complex powers of differential operators, like the Laplacian) [3]. And they constitute nowadays the basic starting point of any rigorous formulation of quantum field theory through microlocalization, a concept that is considered to be the most important step towards the understanding of linear partial differential equations since the invention of distributions [4]. For A a positive-definite elliptic 9DO of positive order m ∈ R, acting on the space of smooth sections of an n-dimensional vector bundle E over a closed, n-dimensional manifold M , the zeta function is defined as X n ≡ s0 . λ−s Re s > (4) ζA (s) = tr A−s = j , m j The quotient s0 = dim M/ord A is called the abscissa of convergence of ζA (s), which is proven to have a meromorphic continuation to the whole complex plane C (regular at s0 ), provided that the principal symbol of A (that is am (x, ξ)) admits a spectral cut: Lθ = {λ ∈ C; Arg λ = θ, θ1 < θ < θ2 }, Spec A ∩ Lθ = ∅ (the Agmon–Nirenberg condition). Strictly speaking, the definition of ζA (s) depends on the position of the cut 0 (0)], which only depends on Lθ , not so that of the determinant [5] det ζ A = exp[−ζA the homotopy class of the cut. The precise structure of the analytical continuation of the zeta function is known in general [6]. The only singularities it can have are simple poles at sk = (n − k)/m,
k = 0, 1, 2, . . . , n − 1, n + 1, . . . .
(5)
The applications of the zeta-function definition of a determinant in physics are very important [7, 8]. A zeta function with the same meromorphic structure in the complex s-plane and extending the ordinary definition to operators of complex order m ∈ C\Z (it is clear that operators of complex order do not admit spectral cuts), has been obtained in Ref. [9]. The construction starts there from the definition of a trace, obtained as the integral over the manifold of the trace density of the difference between the Schwartz kernel of A and the Fourier transformed of a number of first homogeneous terms (in ξ) of the usual decomposition of the symbol (3) of A.
2. Exponentially Convergent Analytic Continuation (with Explicit Poles and Residua) of our Zeta Function A fundamental property shared by zeta functions of any nature is the existence of a reflection formula. For a generic zeta function, Z(s), it has the form:
Multidimensional Extension of Generalized Chowla–Selberg Formula
85
Z(ω − s) = F (ω, s)Z(s),
(6)
and allows for its analytical continuation in a very easy way – what is the whole story of the zeta function regularization procedure (or at least the main part of it). But the analytically continued expression thus obtained is just another series, which has again a slow convergence behavior, of power series type (actually the same that the original series had, in its own domain of validity). Some years ago, the notorious mathematicians S. Chowla and A. Selberg found a formula, for the case p = 2, ~b = 0 and q = 0 above [10], that yields exponentially quick convergence, and not only in the reflected domain. They were extremely proud of that formula – as one can appreciate by reading the original paper, where actually no hint about its derivation was given. In Ref. [11] we generalized this expression to inhomogeneous zeta functions, but staying always in two dimensions (p = 2), for this was commonly believed to be an unsurmountable restriction of the original formula (see, for instance, Ref. [12]). The generalization we carried out in [11] was already non-trivial and a very detailed account of this step is given in [13] (where a misprint of the original derivation is corrected). Finally, we have realized that an extension to an arbitrary number of dimensions is actually possible. In fact, here we shall obtain formulas for arbitrary p and arbitrary values of ~b and q. The starting point will be Poisson’s resummation formula in p dimensions, which arises from the distribution identity X X ~ x δ(~x − ~n) = ei2πm·~ . (7) p p ~ n∈Z m∈ ~ Z (We shall indistinctly write m ~ · ~x ≡ m ~ T ~x in what follows.) Applying this identity to the function 1 T T ~ f (~x) = exp − ~x A~x + b ~x , (8) 2 with A an invertible p × p matrix, and integrating then over ~x ∈ Rp , one obtains X 1 T T ~ exp − ~n A~n + b ~n 2 p ~ n∈Z T (2π)p/2 X 1 ~ −1 ~ √ = b + 2πim ~ b + 2πim ~ . exp A 2 det A p m∈ ~ Z We are going to consider the following zeta function −s 0 X 1 T (~ ) (~ ) (s) = A + q ζA,~c,q n + ~c n + ~c 2 p ~ n∈Z 0 X −s p ≡ , Re (s) > . Q (~n + ~c) + q 2 p ~ n∈Z
(9)
(10)
The aim is to obtain a formula that gives (the analytical continuation of) this multidimensional zeta function in terms of an exponentially convergent multiseries and which is valid in the whole complex plane, exhibiting the singularities (simple poles) of the meromorphic continuation – with the corresponding residua – explicitly. The prime in
86
E. Elizalde
the summatories of Eq. (10) means that the point ~n = ~0 is to be excluded from the sum. Such restriction is irrelevant as long as q 6= 0 (the contribution of this single point being immediately obtainable), but to define the zeta function in this way is essential in order to be able to reach the limit q → 0 (as we shall do later). The only condition on the matrix A is that it corresponds to a (non-negative) quadratic form, that we call Q. The vector ~c is arbitrary, while q will (for the moment) be a positive constant. 2.1. The main expression (inhomogeneous case). Use of the Poisson resummation formula (9) yields, after some work, the following expression: (2π)p/2 q p/2−s 0(s − p/2) 2s/2+p/4+2 π s q −s/2+p/4 √ √ + 0(s) det A det A 0(s) 0 p X s/2−p/4 × cos(2π m ~ · ~c) m ~ T A−1 m ~ Kp/2−s 2π 2q m ~ T A−1 m ~ , (11) p m∈ ~ Z1/2 ζA,~c,q (s) =
where Kν is the modified Bessel function of the second kind and the subindex 1/2 in ~ ∈ Zp intervene in the sum. That is, if we take Zp1/2 means that only half of the vectors m ~ (as a simple criterion one can, for instance, select an m ~ ∈ Zp we must then exclude −m those vectors in Zp \{~0} whose first non-zero component is positive). Equation (11) fulfills all the requirements demanded before. It is notorious to observe how the only pole of this inhomogeneous Epstein zeta function appears explicitly at s = p/2, where it belongs. Its residue is given by the formula: Ress=p/2 ζA,~c,q (s) = √
(2π)p/2 . det A 0(p/2)
(12)
With a bit of care, it is relatively simple to obtain the limit of expression (11) as q → 0. However, instead of proceeding in this way (what we shall do later), it is advisable to construct first a direct recurrent formula for the case q = 0. This is certainly the natural option in such a case, where no cut-off q exists to safeguard the t-integration (there is no way to use the Poisson formula on all p indices of ~n at once). However, we can still deal with this case by using the Poisson resummation formula on some of the p indices ~n only, say on just one of them, n1 . Poisson’s formula on one index reduces to the celebrated Jacobi identity for the θ3 function ∞ X 2 θ3 z |τ = 1 + 2 q n cos(2nz),
q = eπiτ , |q| < 1, τ ∈ C,
(13)
n=1
the identity being: 2 1 ez /(πiτ ) θ3 θ3 z |τ = √ −iτ
z −1 , τ τ
(14)
or, in other words ∞ X n=−∞
e
n2 πiτ +2niz
=√
∞ X 2 1 e(z−nπ) /(πiτ ) −iτ n=−∞
(15)
Multidimensional Extension of Generalized Chowla–Selberg Formula
87
(for a classical reference see, e.g. Ref. [14]). Here z and τ are arbitrary complex, z, τ ∈ C, with the only restriction that Im τ > 0 (in order that |q| < 1). For the applications, it turns out to be better to recast the Jacobi identity as follows (with πiτ → −t and z → πz): r ∞ ∞ X 2 π X −π2 (n−z)2 /t e−n t+2πinz = e , (16) t n=−∞ n=−∞ equivalently r
∞ X
e
−(n+z)2 t
=
n=−∞
" # ∞ X π −π 2 n2 /t 1+ e cos(2πnz) , t
(17)
n=1
with z, t ∈ C, Re t > 0. 2.2. Recurrent expression (and the homogeneous case). Using this last formula on the first component, n1 , of the summation vector ~n, we obtain (for the sake of simplicity of the final expressions, we shall just consider now the case ~c = ~0, but the result can be generalized to ~c 6= ~0 quite easily): ζA,~0,q (s) = 2
∞ X
an21 + q
−s
n1 =1
+
+
1 0(s) 4π
p−1
~ n2 ∈Z ∞ s X
as/2+1/4
× Ks−1/2 which can be written as
r
0 X
cos
n1 =1
2πn1 √ a
1/2−s π 0(s − 1/2) ~nT2 1p−1~n2 + q a
πn
1/4−s/2 s−1/2 b ~n2 n1 ~nT2 1p−1~n2 + q
1 ~T
a
q T ~n2 1p−1~n2 + q ,
(18)
r
π 0(s − 1/2) ζ1p−1 ,~0,q (s − 1/2) a 0(s) 0 ∞ πn X X 4π s 1 ~T b ~n2 cos + s/2+1/4 a a 0(s) p−1 n1 =1 ~ n2 ∈Z q 1/4−s/2 2πn1 s−1/2 T T Ks−1/2 √ ~n2 1p−1~n2 + q . (19) ~n2 1p−1~n2 + q ×n1 a
ζA,~0,q (s) = ζa,~0,q (s) +
This is clearly a recurrent formula in p, the number of dimensions, the first term of the recurrence being r ∞ X −s π 0(s − 1/2) 1/2−s q = q −s + an2 + q ζa,~0,q (s) = 2 a 0(s) n=1 r ∞ 4π s −1/4−s/2 1/4−s/2 X s−1/2 q a . (20) + q n Ks−1/2 2πn 0(s) a n=1
88
E. Elizalde
To take in these expressions the limit q → 0 is immediate. One obtains: r π 0(s − 1/2) ζ1p−1 ,~0,0 (s − 1/2) ζA,~0,0 (s) = 2a−s ζ(2s) + a 0(s) 0 ∞ πn X X 4π s 1 ~T b ~n2 cos + s/2+1/4 a a 0(s) p−1 n1 =1 ~ n2 ∈ Z q 1/4−s/2 2πn1 s−1/2 T T √ Ks−1/2 ~n2 1p−1~n2 . (21) ~n2 1p−1~n2 ×n1 a In the above formulas, A is a p × p symmetric matrix A = aij i,j=1,2,... ,p = AT , Ap−1 the (p − 1) × (p − 1) reduced matrix Ap−1 = aij i,j=2,... ,p , a the component a = a11 , ~b the p − 1 vector ~b = (a21 , . . . , ap1 )T = (a12 , . . . , a1p )T , and finally, 1p−1 is 1~ the following (p − 1) × (p − 1) matrix 1p−1 = Ap−1 − 4a b ⊗ ~b. Let us now get back to the case q = 0 starting from the beginning (e.g., the zeta function given by Eq. (10), with q = 0). From that expression, the recurrence (21) can be obtained directly in the same way – this is rather obvious, since q plays no role in the derivation. What is not so obvious is to realize that the limit as q → 0 of Eq. (11) is exactly the recurrent formula (21). More precisely, what is obtained in the limit is the reflected formula which one gets after using the well known Epstein zeta function reflection π 2s−p/2 0(p/2 − s)Z(p/2 − s; A−1 ), 0(s)Z(s; A) = √ det A
(22)
being Z(s; A) the Epstein zeta function [15]. After some thinking, such a result is easy to understand. Summing up, we have thus checked that our formula (11) is valid for any q ≥ 0, since it contains in a hidden way, for q = 0, the recurrent expression (21). As announced at the beginning, the formulas derived here can be considered as generalizations (in more than one sense) of the Chowla-Selberg (CS) formula. All share the same properties that are so much appreciated by number-theoretists as pertaining to the CS formula. In a way, these expressions can be viewed as improved reflection formulas for zeta functions; they are in fact much better than those in several aspects. Namely, while a reflection formula connects one region of the complex plane with a complementary region (with some intersection) by analytical continuation, the CS formula and our formulas are valid on the whole complex plane, exhibiting the poles of the zeta function and the corresponding residua explicitly. Even more important, while a reflection formula is intended to replace the initial expression of the zeta function – a power series whose convergence can be extremely slow – by another power series with the same type of convergence, it turns out that the expressions here considered give the meromorphic extension of the zeta function, on the whole complex s-plane, in terms of an exponentially decreasing power series (as was the case with the CS formula, that one being its most precious property). Actually, exponential convergence strictly holds under the condition that q ≥ 0. However, the formulas themselves are valid for q < 0 or even complex. What is not guaranteed for general q ∈C is the exponential convergence of the series, nor its powerlike convergence, for that matter. Those analytical continuations in q must be dealt with specifically, case by case. The physical example of a field theory with a chemical potential falls clearly into this class.
Multidimensional Extension of Generalized Chowla–Selberg Formula
89
2.3. Particular case p = 2. The above statements apply both for the cases q > 0 and q = 0. The last situation is more involved, however. One is led to employ the recurrence relation (21) several times (p − 1, in general), what gives rise each time to an additional series of Bessel functions Kν (exponential convergence). For completeness, let us write down the corresponding series when p = 2 explicitly. They are, with q > 0 [13], ζE (s; a, b, c; q) =
" r ∞ q 1/4 π s X 4 2πq 1−s q s−1/2 √ + n K 2πn −q + √ s−1/2 a qa a (s − 1) 1 0(s) n=1 r r r s X ∞ q a aq 2π + (23) ns−1 Ks−1 4πn a q1 1 n=1 r 1/4−s/2 ∞ X X 4aq 2 (2π)s ns−1/2 cos(πnb/a) d1−2s 1 + 2 + a d n=1 d|n !# r 4aq πn Ks−1/2 1+ 2 , a d −s
where 1 = 4ac − b2 > 0, and, with q = 0, the CS formula [10] −s
√ 22s π as−1
0(s − 1/2)ζ(2s − 1) 0(s)1s−1/2 ∞ πn √ X 2s+5/2 π s s−1/2 n σ (n) cos(πnb/a) K 1 , + √ 1−2s s−1/2 a 0(s) 1s/2−1/4 a
ζE (s; a, b, c; 0) = 2ζ(2s) a
+
n=1
(24) P where σs (n) ≡ d|n ds , sum over the s-powers of the divisors of n. (There is a misprint in the transcription of formula (24) in Ref. [12]). We observe that the rhs’s of (23) and (24) exhibit a simple pole at s = 1, with common residue: 2π Ress=1 ζE (s; a, b, c; q) = √ = Ress=1 ζE (s; a, b, c; 0). 1
(25)
3. The Case of a Truncated Range The most involved case in the family of Epstein-like zeta functions corresponds to having to deal with a truncated range. This comes about when one imposes boundary conditions of the usual Dirichlet or Neumann type [13]. Jacobi’s theta function identity and Poisson’s summation formula are then useless and no expression in terms of a convergent series for the analytical continuation to values of Re s below the abscissa of convergence can be obtained. The best one gets is an asymptotic series expression. However, the issue of extending the CS formula or, better still, the most general expression we have obtained before for inhomogeneous Epstein zeta functions, is not an easy one. This problem has seldom (if ever) been properly addressed in the literature.
90
E. Elizalde
3.1. Example 1. To illustrate the issue, let us consider the following simple example in one dimension: ∞ X
ζG (s; a, c; q) ≡
a(n + c)2 + q
−s
,
Re s > 1/2.
(26)
n=−∞
Associated with this zeta functions, but considerably more difficult to treat, is the truncated series, with indices running from 0 to ∞, ζGt (s; a, c; q) ≡
∞ X
a(n + c)2 + q
−s
,
Re s > 1/2.
(27)
n=0
In this case the Jacobi identity is of no use. How to proceed then? The only way is to employ specific techniques of analytic continuation of zeta functions [13]. The usual method involves three steps [16]. The first step is elementary: to write the initial series as a Mellin transformed one, ∞ ∞ Z X −s