format: text

text:
# Computational information for the logistic map at the chaos threshold

## 1 Introduction

Since the discovery of impredictability in deterministic systems that led to the study of chaotic dynamical systems, much work has been done to find properties of chaos that could give a classification of these systems. In particular indicators like Lyapounov exponent, Kolmogorov-Sinai entropy, topological entropy and others have been developed.

Nevertheless, in recent years there have been found dynamical systems for which all the known indicators don’t give the presence of chaos, but numerical results show a high order of impredictability for orbits of these systems. This phenomenon has led to attempts to generalize the known indicators (for example see ,), but has also stimulated the research for new properties of these systems.

One of the possible new approaches to these weakly chaotic dynamical systems is related to information theory, that is to the notion of information content of a symbolic string. In Section 2 we give the definition of information content and show how to apply this technique to dynamical systems.

In particular we study the dynamics of the logistic map (see equation (3)) at the chaos threshold, that represents one of the best known examples of weak chaos. In Section 3 we give the theoretical results that allow a classification of our map among the weakly chaotic dynamical systems.

Our theoretical approach is based on the notion of Algorithmic Information Content introduced by Kolmogorov and Chaitin (see Section 2), and unfortunately this notion of information is not computable, in the sense that cannot exist an algorithm which computes this function. Hence to numerically confirm our results, we have to use an approximate notion of information content. In Section 4, we present a possible approach to this problem, that consists on the use of compression algorithms to obtain an estimate for the information contained in a string. In particular a new compression algorithm, called CASToRe, is presented and some of its properties are illustrated. Finally in Section 5, we apply CASToRe to the logistic map at the chaos threshold to confirm the theoretical predictions for the behaviour of the Algorithmic Information Content of the strings generated by the map.

## 2 Information of symbolic sequences

In our approach the basic notion is the information content of a symbolic sequence. Given a finite string $`s^n`$ of length $`n`$, that is a finite sequence of symbols $`s_i`$, $`i=1,\mathrm{},n`$, taken in a given alphabet, the intuitive meaning of quantity of information $`I(s^n)`$ contained in $`s^n`$ is the following one:

$`I(s^n)`$ is the length of the smallest binary message from which you can reconstruct $`s^n`$.

Formally, this notion leads to the definition of the Algorithmic Information Content (AIC) (or Kolmogorov complexity) introduced by Chaitin () and Kolmogorov (). In order to define it, it is necessary to define the partial recursive functions. We limit ourselves to give an intuitive idea which is very close to the formal definition. We can consider a partial recursive function as a computer $`C`$ which takes a program $`p`$ (namely a binary string) as an input, performs some computations and gives a string $`s=C(p)`$, written in the given alphabet, as an output. The AIC of a string $`s`$ is defined as the shortest binary program $`p`$ which gives $`s`$ as its output, that is

$$I_{AIC}(s,C)=\mathrm{min}\{|p|:C(p)=s\},$$
(1)
where $`|p|`$ means the length of the string $`p`$. A computing machine is called universal (namely it is a computer in the usual sense of the word) if it can simulate any other machine (for a precise definition see any book on recursion). In particular if $`C`$ and $`C^{}`$ are universal then $`I_{AIC}(s,C)I_{AIC}(s,C^{})+const`$, where the constant depends only on $`C`$ and $`C^{}`$. This implies that, if $`C`$ is universal, the complexity of $`s`$ with respect to $`C`$ depends only on $`s`$ up to a fixed constant and then its asymptotic behavior does not depend on the choice of $`C`$. Thus, we will just write $`I_{AIC}(s)`$ in equation (1) when referring to the AIC of the string $`s`$.

We now extend the concept of information to strings generated by a dynamical system $`(X,f)`$. Using the usual procedure of symbolic dynamics, given a partition $`\alpha `$ of the phase space of the dynamical system $`(X,f)`$, it is possible to associate a string $`\mathrm{\Phi }_\alpha \left(x\right)`$ to the orbit having $`xX`$ as initial condition. If $`\alpha =\{A_1,\mathrm{},A_l\},`$ then $`\mathrm{\Phi }_\alpha \left(x\right)=(s_0,s_1,\mathrm{},s_k,\mathrm{})`$ if and only if

$$f^kxA_{s_k}k,$$

with $`s_k\{1,\mathrm{}l\}k`$. The AIC of a single orbit of the dynamical system is then the AIC of the symbolic string generated by the orbit. If we want not to have dependence on the partition $`\alpha `$ of the phase space, then we have to make some procedure of looking for the supremum varying the partitions. The first results have been obtained by Brudno () using open covers of the phase space. Another possible approach, using computable partitions333The intuitive idea of computable partition is a partition that can be recognised by a computer., is introduced in . We are not interested in this problem, but we will just assume that the partitions we consider are generating in the sense that they give the best approximation for the AIC of an orbit of our dynamical system.

There exist some results connecting the information content of a string generated by a dynamical system and the Kolmogorov-Sinai entropy $`h^{KS}`$ of the system.

First of all it is proved that in a dynamical system with an ergodic invariant measure $`\mu `$ with positive K-S entropy $`h_\mu ^{KS}`$, the AIC of a string $`n`$ symbols long behaves like $`I_{AIC}(s^n)h_\mu ^{KS}n`$ for almost any initial condition with respect to the measure $`\mu `$ ().

Instead, in a periodic dynamical system, we expect to find $`I_{AIC}(s^n)=O(\mathrm{log}(n))`$. Indeed, the shortest program that outputs the string $`s^n`$ would contain only information on the period of the string and on its length.

It is possible to have also intermediate cases, in which the K-S entropy is null for all the invariant measures that are physically relevant and the system is not periodic. These systems, whose behaviour has been defined weak chaos, are an important challenge for research on dynamical systems. Indeed no information are given by the classical properties, such as K-S entropy or Lyapounov exponents, and in the last years some generalized definitions of entropy of a system have been introduced to characterize the behaviour of such systems (for example see ). We believe that an approach to weakly chaotic systems using the order of increasing of their AIC could be a powerful way to classify these systems. This approach has already been used for the Manneville map (, ):

$$f(x)=x+x^z(\text{mod 1})x[0,1],z1.$$

In the cited papers it is proved that the AIC of the Manneville map behaves, for values $`z>2`$ of its parameter, as

$$I_{AIC}(s^n)n^\alpha ,\alpha =\frac{1}{z1}<1,$$
(2)
and this behaviour has been defined sporadicity.

Among the weakly chaotic systems, one can identify behaviours different from the sporadic one. As an example, the AIC can have order smaller than any power law (with respect to the length of the encoded string). We choose to call this behaviour mild chaos.

In this paper we show that the AIC of the logistic map at the chaos threshold is of order of $`\mathrm{log}n`$ (Theorem 3.10 and Section 5). Then, we will prove that the weakly chaotic dynamics of the logistic map at the chaos threshold is in particular mildly chaotic.

## 3 The logistic map from information point of view

We now apply the theory of the Algorithmic Information Content of an orbit of a dynamical system to the logistic map at the chaos threshold. We first give some well known results on the dynamics of the map, and then use these results to obtain an estimate for the AIC.

### 3.1 The dynamics of the logistic map

The logistic map, defined by

$$f_\lambda (x)=\lambda x(1x),x[0,1],1\lambda 4,$$
(3)
is a very simple example of a map with an extremely complicated behaviour for some values of the parameter $`\lambda `$. The dynamics of the map have been studied extensively, and there are many important results that have been generalized to one dimensional dynamical systems. Here we give a brief description of the well known period doubling sequence, and recall some results for the dynamics at the chaos threshold. The references for the first part of this section are , , .

Consider first $`\lambda (1,3)`$. There are two fixed points, $`x_0=0`$ and $`x_1=(\lambda 1)/\lambda `$. The fixed point at the origin is unstable and the point $`x_1`$ is stable. Then every orbit ends up on the fixed point $`x_1`$.

When $`\lambda =\lambda _1=3`$, we have the first bifurcation. The derivative of $`f`$ at the point $`x_1`$ is -1, and the fixed point is now neutrally stable. Moreover one periodic orbit of period 2 is generated and it becomes stable as soon as $`\lambda `$ becomes greater than $`\lambda _1`$. This is a period doubling bifurcation.

This kind of bifurcation repeats over and over at different values $`\lambda _n`$ of the parameter. That is, when $`\lambda (\lambda _n,\lambda _{n+1})`$, there is one stable periodic orbit of period $`2^{n+1}`$, and unstable periodic orbits of period $`2^j`$, $`j=0,\mathrm{},n`$. When $`\lambda =\lambda _{n+1}`$, the stable periodic orbit loses its stability and a new periodic orbit of period $`2^{n+2}`$ is generated.

One of the main features of this bifurcation sequence is that the bifurcation parameters $`\lambda _n`$ accumulate at $`\lambda =\lambda _{\mathrm{}}`$, where

$$\lambda _{\mathrm{}}=3.569945671870944901842.$$
(4)
Moreover it holds

$$\lambda _n=\lambda _{\mathrm{}}\frac{b}{\delta ^n},$$
(5)
where $`\delta `$ is the so-called Feigenbaum constant and $`b`$ is a suitable constant ().

The behaviour of the logistic map at the chaos threshold has attracted much attention, in particular for being a map with null Kolmogorov entropy for any invariant probability measure, and nevertheless showing a weakly chaotic behaviour.

We recall that in this paper by weak chaos we mean the behaviour of a map with null Kolmogorov entropy for all the physically relevant invariant measures and with a dynamics that is neither periodic nor regular in some sense. As we have seen in Section 2, a way to classify weakly chaotic maps is given by the Algorithmic Information Content (AIC) of a string generated by the map.

Let’s consider now the map $`f_\lambda _{\mathrm{}}`$. For this map there are countably many unstable periodic orbits of periods $`2^j`$, for all $`j`$, and an attractor $`\mathrm{\Omega }`$ that is a Cantor set, the so-called Feigenbaum attractor. It holds the following theorem (, Theorem III.3.5):

###### Theorem 3.1.

The logistic map $`f_\lambda _{\mathrm{}}`$ at the chaos threshold has an invariant Cantor set $`\mathrm{\Omega }`$.

(1) There is a decreasing chain of closed subsets

$$J^{(0)}J^{(1)}J^{(2)}\mathrm{},$$

each of which contains $`1/2`$, and each of which is mapped onto itself by $`f_\lambda _{\mathrm{}}`$.

(2) Each $`J^{(i)}`$ is a disjoint union of $`2^i`$ closed intervals. $`J^{(i+1)}`$ is constructed by deleting an open subinterval from the middle of each of the intervals making up $`J^{(i)}`$.

(3) $`f_\lambda _{\mathrm{}}`$ maps each of the intervals making up $`J^{(i)}`$ onto another one; the induced action on the set of intervals is a cyclic permutation of order $`2^i`$.

(4) $`\mathrm{\Omega }=_iJ^{(i)}`$. $`f_\lambda _{\mathrm{}}`$ maps $`\mathrm{\Omega }`$ onto itself in a one-to-one fashion. Every orbit in $`\mathrm{\Omega }`$ is dense in $`\mathrm{\Omega }`$.

(5) For each $`k`$, $`f_\lambda _{\mathrm{}}`$ has exactly one periodic orbit of period $`2^k`$. This periodic orbit is repelling and does not belong to $`J^{(k+1)}`$. Moreover this periodic orbit belongs to $`J^{(k)}J^{(k+1)}`$, and each point of the orbit belongs to one of the intervals of $`J^{(k)}`$.

(6) Every orbit of $`f_\lambda _{\mathrm{}}`$ either lands after a finite number of steps exactly on one of the periodic orbits enumerated in 5, or converges to the Cantor set $`\mathrm{\Omega }`$ in the sense that, for each $`k`$, it is eventually contained in $`J^{(k)}`$. There are only countably many orbits of the first type.

A characteristic of chaotic dynamical systems is the sensitivity to initial conditions. Roughly speaking we can say that a system has sensitive dependence on initial conditions if two orbits that start close diverge.

It is well known that the Kolmogorov-Sinai entropy is related to the sensitivity to initial conditions of the orbits. The exact relations between the K-S entropy and the instability of the system is given by the Ruelle-Pesin theorem. We will recall this theorem in the one-dimensional case. Suppose that the average rate of separation of nearby starting orbits is exponential, namely

$$\mathrm{\Delta }x(n)\mathrm{\Delta }x(0)2^{\lambda n}\text{for }\mathrm{\Delta }x(0)1,$$

where $`\mathrm{\Delta }x(n)`$ denotes the distance of these two points at time $`n`$. If the Lyapounov exponent $`\lambda `$ is positive then the system is unstable and $`\lambda `$ can be considered a measure of its instability (or sensibility with respect to the initial conditions). The Ruelle-Pesin theorem implies that, under some regularity assumptions, $`\lambda `$ equals the K-S entropy.

The logistic map at the chaos threshold has null Kolmogorov entropy for any invariant probability measure (it is shown by continuity of topological entropy and by the Variational Principle), and null Lyapounov exponent (experimental results), but nevertheless numerical experiments show that there is a power law divergence for nearby orbits. This feature of the logistic map has induced the application of a generalized version of the thermo-dynamical entropy (, ). Formally, we have:

###### Definition 3.2.

A dynamical system $`f:XX`$ has sensitivity to initial conditions if there exists $`\delta >0`$ such that, for all $`xX`$ and for all neighbourhoods $`U`$ of $`x`$, there exist $`yU`$ and $`n`$ such that $`d(f^n(x),f^n(y))>\delta `$.

###### Theorem 3.3.

The logistic map at the chaos threshold has no sensitivity to initial conditions. Indeed there exists a subset $`X[0,1]`$ with $`m(X)=1`$, for the Lebesgue measure $`m`$, such that for all $`\delta >0`$ and for all $`xX`$, there exists a neighbourhood $`U(\delta )`$ of $`x`$ such that $`yU(\delta )`$ and $`n`$ we have $`d(f_\lambda _{\mathrm{}}^n(x),f_\lambda _{\mathrm{}}^n(y))<\delta `$.

Proof. By Theorem 3.1(6), we have that eventually almost every orbit, with respect to the Lebesgue measure $`m`$, ends up on $`J^{(k)}`$ for all $`k`$. Moreover by Theorem 3.1(1), we have that $`f_\lambda _{\mathrm{}}(J^{(k)})J^{(k)}`$.

Let now $`\delta >0`$ be fixed. Being $`\mathrm{\Omega }`$ a Cantor set, there exists $`k_\delta `$ such that $`m(J_i^{(k_\delta )})<\delta `$ for all $`i=1,\mathrm{},2^{k_\delta }`$, where by $`J_i^{(k_\delta )}`$ we denote the intervals making up $`J^{(k_\delta )}`$. We have (Theorem 3.1(3)) that the action of $`f_\lambda _{\mathrm{}}`$ on $`J^{(k_\delta )}`$ is a cyclic permutation of the $`2^{k_\delta }`$ intervals. Then if $`xJ_i^{(k_\delta )}`$, for some $`i`$, and $`U(\delta )`$ is a neighbourhood of $`x`$ contained in $`J_i^{(k_\delta )}`$, then, for all $`n`$, $`f_\lambda _{\mathrm{}}^n(U(\delta ))J_j^{(k_\delta )}`$, for some $`j`$. Hence $`yU(\delta )`$ and $`n`$, we have $`d(f_\lambda _{\mathrm{}}^n(x),f_\lambda _{\mathrm{}}^n(y))<\delta `$.

Let now $`X`$ be the set of the points whose orbit is eventually contained in $`J^{(k_\delta )}`$. By Theorem 3.1(6), we have $`m(X)=1`$. Let now be $`xX`$, then there exists a neighbourhood $`U(\delta )`$ of $`x`$, such that, if $`f_\lambda _{\mathrm{}}^N(x)J_i^{(k_\delta )}`$ for some $`i`$, then $`f_\lambda _{\mathrm{}}^N(U(\delta ))J_i^{(k_\delta )}`$. The neighbourhood $`U(\delta )`$ exists by continuity of the map $`f_\lambda _{\mathrm{}}`$. Now, we can repeat the same argument as before, showing that $`yU(\delta )`$ and $`n`$, we have $`d(f_\lambda _{\mathrm{}}^n(x),f_\lambda _{\mathrm{}}^n(y))<\delta `$ (if necessary it is possible to shrink the neighbourhood $`U(\delta )`$ to have the previous relation for all $`n`$). ∎

Hence it remains the problem of explaining the power law divergence of nearby orbits. One way to give an estimate of the order of this divergence is by considering the dimension of the set of points that remain close for some iterations.

###### Definition 3.4.

For $`x[0,1]`$, we define

$$B(x,n,ϵ)=\{y[0,1]|d(f_\lambda _{\mathrm{}}^i(x),f_\lambda _{\mathrm{}}^i(y))<ϵi=0,\mathrm{},n\}.$$

Using this definition, we apply Theorem 3.3 to obtain

###### Corollary 3.5.

For all $`ϵ>0`$ and for all $`xX`$, there exists a $`N(x,ϵ)`$, such that $`B(x,n,ϵ)=B(x,m,ϵ)`$ for all $`n,mN(x,ϵ)`$.

Hence, given a point $`xX`$ and $`ϵ`$, the set $`B(x,n,ϵ)`$ shrinks as $`n`$ increases, until $`n`$ reaches the value $`N(x,ϵ)`$. At this point the set $`B(x,n,ϵ)`$ doesn’t change any more. But, if we are interested in estimate the order of divergence of nearby orbits at the point $`x`$, we have to consider the limit

$$B(x,n)=\underset{ϵ0^+}{lim}B(x,n,ϵ).$$
(6)
We find that $`lim_{ϵ0^+}N(x,ϵ)=+\mathrm{}`$, for all $`xX`$, hence the function $`B(x,n)`$ is a decreasing function of $`n`$, whose order gives information on the order of the local divergence. In the next subsection we derive an estimate for the AIC of a string generated by $`f_\lambda _{\mathrm{}}`$, and hence, by a theorem of , we find the order of $`B(x,n)`$.

### 3.2 The AIC at the chaos threshold

In this subsection we show an approach to the dynamics of the logistic map at the chaos threshold, $`f_\lambda _{\mathrm{}}`$, that allows us to find an estimate for the AIC (equation (1)) of almost every orbit generated by $`f_\lambda _{\mathrm{}}`$. This approach uses the notion of kneading invariant. To have a complete treatment of kneading theory see, for example, .

Let $`f:[0,1][0,1]`$ be a $`C^1`$ unimodal map, that is there exists only one point $`c[0,1]`$ such that $`f^{}(c)=0`$, and $`f`$ is increasing on $`(0,c)`$ and decreasing on $`(c,1)`$. We can then define the kneading sequence $`k_f(x,t)`$ of a point $`x[0,1]`$.

###### Definition 3.6.

For $`x[0,1]`$, we define coefficients $`\theta _i(x)`$ by:

$$\theta _i(x)=\{\begin{array}{cc}+1\hfill & \text{ if }\frac{d}{dx}f^{(i+1)}>0\hfill \\ 1\hfill & \text{ if }\frac{d}{dx}f^{(i+1)}<0\hfill \\ 0\hfill & \text{ if }\frac{d}{dx}f^{(i+1)}=0\hfill \end{array}$$

Then the kneading sequence relative to $`x`$ is the formal power series

$$k_f(x,t)=\underset{i=0}{\overset{\mathrm{}}{}}\theta _i(x)t^i.$$

###### Theorem 3.7.

It is possible to introduce a distance $`D`$ on the space of kneading sequences, given by

$$D(k_f(x,t),k_f(y,t))=\underset{i=0}{\overset{\mathrm{}}{}}\frac{1}{2^i}|\theta _i(x)\theta _i(y)|.$$

This distance makes the function $`xk_f(x,t)`$ a continuous function for all $`x[0,1]`$, but the preimages of the critical point $`c`$.

###### Definition 3.8.

If $`x`$ is a preimage of the critical point $`c`$, we define

$$k_f(x_\pm ,t)=\underset{yx^\pm }{lim}k_f(y,t),$$

where the limit is taken through sequences of points $`y`$ that are not preimages of $`c`$. For the critical point $`c`$, it holds $`k_f(c_{},t)=k_f(c_+,t)`$. Then we define the kneading invariant $`k_f(t)`$ of the function $`f`$ as the sequence $`k_f(c_{},t)`$.

Using classical results on renormalization of maps with null topological entropy (), one can prove the following:

###### Theorem 3.9.

The kneading invariant of the logistic map at the chaos threshold $`f_\lambda _{\mathrm{}}`$ is given by

$$k_{f_\lambda _{\mathrm{}}}(t)=\underset{i=0}{\overset{\mathrm{}}{}}(1t^{2^i}).$$
(7)
Let’s consider now the partition $`\alpha =(A_0,A_1)`$, given by $`A_0=[0,1/2]`$ and $`A_1=(1/2,1]`$, of the interval $`[0,1]`$ for the map $`f_\lambda _{\mathrm{}}`$. If we take a point $`x[0,1]`$, we can code its orbit into a string $`s`$ with $`s_i\{0,1\}`$, according to whether $`f_\lambda _{\mathrm{}}^i(x)`$ is in $`A_0`$ or in $`A_1`$.

From the definition of the coefficients $`\theta _i(x)`$, for any point $`x`$, we can see that $`\theta _i(x)=\text{sgn }(f^{}(x)\mathrm{}f^{}(f^i(x)))`$. Hence, in the coding of the orbit of $`x`$ into the string $`s`$, we have $`s_i=0`$ if there is a permanence in the sign of $`\theta _{i1}(x)`$ and $`\theta _i(x)`$, $`s_i=1`$ otherwise.

We denote by $`s(x)`$ the string generated by the orbit with initial condition $`x`$. Let’s start studying the string generated by the point $`x=1/2`$, that is the critical point of $`f_\lambda _{\mathrm{}}`$. The coding of the orbit of $`1/2`$ into a string $`s`$ is related to the kneading invariant of the map $`k_{f_\lambda _{\mathrm{}}}(t)`$, given by Theorem 3.9. Thanks to the particular form of the kneading invariant (eqn. (7)), we obtain that to reconstruct the string $`s`$, it is sufficient to make the following operations:

* the first symbol is 0;
* given $`s^n`$, that is the first $`n`$ symbols of the string, we construct $`s^{2n}`$ by $`s^n\overline{s}^n`$, where $`\overline{s}^n`$ is equal to $`s^n`$ if $`n=2^{2k}`$, otherwise $`\overline{s}^n`$ is obtained by $`s^n`$ changing the first symbol.

Hence we have that $`I_{AIC}(s^n(1/2))=\mathrm{log}n`$, indeed it is enough to specify the length of the string $`s^n`$. Moreover, by Theorem 3.1(1), we have that $`1/2\mathrm{\Omega }`$, the attractor of $`f_\lambda _{\mathrm{}}`$, and the orbit of $`1/2`$ is dense in $`\mathrm{\Omega }`$ (Theorem 3.1(4)). Hence for all $`xX`$ (see Theorem 3.3), there exists $`N(x)`$ such that for all $`iN(x)`$, $`s_i(x)`$ can be obtained by $`s_i(1/2)`$. This implies the following result:

###### Theorem 3.10.

For almost any point $`x[0,1]`$, the AIC of the string $`s(x)`$ generated by the orbit of the map $`f_\lambda _{\mathrm{}}`$ with $`x`$ as initial condition, is such that

$$I_{AIC}(s^n(x))=\mathrm{log}n+const,$$
(8)
where the constant depends on the point $`x`$.

###### Remark 3.11.

We remark that we have actually proved only the behaviour of the AIC for the partition $`\alpha `$. Indeed to obtain the AIC of the orbits of our dynamical system we should consider the supremum on either all the open covers or the computable partitions (see Section 2). But we have that $`\alpha `$ is a generating partition, that is $`lim_n\mathrm{}diam(\alpha ^n)=0`$, where $`diam(\alpha )`$ is the diameter of a partition, and $`\alpha ^n=\alpha \mathrm{}f^n(\alpha )`$. Hence we suppose that the AIC we estimated is a good approximation of the real one, following the same arguments used, for example, for the Kolmogorov-Sinai entropy.

We are now ready to give an estimate on the behaviour of the function $`B(x,n)`$ defined in equation (6). Indeed, using Theorem 40 in , we have:

###### Corollary 3.12.

For almost any point $`x[0,1]`$, the function $`B(x,n)`$ is of the order of $`n^k`$, for some constant $`k>0`$. Hence, we can say that we have a power law divergence for nearby orbits, for almost any orbit.

This result confirms the experiments made on the logistic map at the chaos threshold. The constant $`k`$ has been found to be approximately $`1.3236`$ ().

We have thus derived an estimate for the behaviour of the Algorithmic Information Content for the logistic map at the chaos threshold, showing its connection with the sensitivity to initial conditions. We remark that the AIC is not a computable function, that is it does not exist an algorithm able to compute the AIC of any string. In the next section, we show how to obtain an estimate of the AIC for our map.

## 4 Compression Algorithms

In Section 2 we have introduced the notion of Algorithmic Information Content (AIC) of a finite string $`s`$, following the work of Chaitin () and Kolmogorov (). Since the notion of AIC is not computable, it has been approximated by other notions of information content of a string that can be computed.

One measure of the information content of a finite string built on an alphabet $`𝒜`$ can be defined by a lossless (reversible) data compression algorithm

$$Z:\mathrm{\Sigma }(𝒜)\mathrm{\Sigma }(\{0,1\}),$$

that is a coding procedure such that from the coded string we can reconstruct the original string. Hence it is natural to consider the length of the coded string as an approximate measure of the quantity of information that is contained in the original string. We then define the information content $`I_Z(s)`$ of the string $`s`$ as

$$I_Z\left(s\right)=\left|Z(s)\right|,$$
(9)
where $`|Z(s)|`$ denotes the length of the compressed string $`Z(s)`$. The information content $`I_Z\left(s\right)`$ turns out to be a computable function and for this reason we will call it Computable Information Content $`(CIC)`$. For a more accurate discussion on compression algorithms and the CIC we refer to .

### 4.1 A new compression algorithm: CASToRe

In  and , it has been presented a new compression algorithm, called CASToRe, which has been created in order to give information on null entropy dynamics and has been used to study a case of sporadic dynamics, the Manneville map. In the following, the algorithm CASToRe will be used to evaluate the Computable Information Content $`I_Z`$ of the strings (equation (9)). As will be better shown later in the case of regular strings, this new algorithm will be a sensitive measure of the information content of the string. That’s why it is called CASToRe: Compression Algorithm, Sensitive To Regularity. In particular, in  the algorithm CASToRe has been tested on fully chaotic and sporadic strings, confirming the theoretical results.

We now give a short description of the algorithm. CASToRe is a compression algorithm which is a modification of the LZ78 algorithm ().

As it will be proved in Theorem (4.1), the Information $`I_Z`$ of a constant sequence, originally with length $`n`$, is $`4+2\mathrm{log}(n+1)[\mathrm{log}(\mathrm{log}(n+1))1]`$, if the algorithm $`Z`$ is CASToRe. The theory predicts that the best possible information is $`I_{AIC}=\mathrm{log}(n)+`$const. In , it is shown that the algorithm $`LZ78`$ encodes a constant $`n`$ digits long sequence to a string with length about $`const+n^{\frac{1}{2}}`$ bits; so, we cannot expect that $`LZ78`$ is able to distinguish a sequence whose information grows like $`n^\alpha `$ ($`\alpha <\frac{1}{2}`$) (sporadic dynamics) from a constant or periodic one, while it has been proved () that CASToRe is a very useful tool to identify the correct exponent in the sporadic case.

The algorithm CASToRe is based on an adaptive dictionary. Roughly speaking, this means that it translates an input stream of symbols (the file we want to compress) into an output stream of numbers, and that it is possible to reconstruct the input stream knowing the correspondence between output and input symbols. This unique correspondence between sequences of symbols (words) and numbers is called *the dictionary*.

At the beginning of encoding procedure, the dictionary is empty. In order to explain the principle of encoding, let’s consider a point within the encoding process, when the dictionary already contains some words.

We start analyzing the stream, looking for the longest word W in the dictionary matching the stream. Then we look for the longest word Y in the dictionary where W + Y matches the stream. Suppose that we are compressing an English text, and the stream contains “basketball …”, we may have the words “basket” (number 119) and “ball” (number 12) already in the dictionary, and they would of course match the stream.

The output from this algorithm is a sequence of word-word pairs (W, Y), or better their numbers in the dictionary, in our case (119, 12). The resulting word “basketball” is then added to the dictionary, so each time a pair is output to the code-stream, the string from the dictionary corresponding to W is extended with the word Y and the resulting string is added to the dictionary.

In the following subsections, we will estimate the information content $`I_Z`$, where the algorithm $`Z`$ is CASToRe, in the case of constant sequences and periodic sequences with period $`p>1`$. Indeed this is important for the application of CASToRe to the logistic map at the chaos threshold (Section 5).

### 4.2 CASToRe on constant strings

We first study the case of period $`p=1`$ (constant strings). If we have a string given by

$$s=(aaaaaaaaaaaaaaa\mathrm{}\mathrm{}\mathrm{}\mathrm{}.),$$
(10)
the algorithm CASToRe gives a codification

$$\begin{array}{cccc}1\hfill & :\hfill & (0,a)\hfill & [a]\hfill \\ 2\hfill & :\hfill & (1,1)\hfill & [aa]\hfill \\ 3\hfill & :\hfill & (2,2)\hfill & [aaaa]\hfill \\ 4\hfill & :\hfill & (3,3)\hfill & [aaaaaaaa]\hfill \\ & & \mathrm{}\hfill & \\ k\hfill & :\hfill & (k1,k1)\hfill & [a\mathrm{}a]\hfill \end{array}$$
(11)
so if we compute the information $`I_Z(s^n)`$, as function of the length $`n`$ of the string to be compressed, we can immediately deduce that $`I_Z(s^n)O(\mathrm{log}_2n)`$. Indeed a much more accurate estimate of the CIC for constant strings is obtained in the following theorem.

###### Theorem 4.1.

Let $`s`$ be a constant string as in (10), then the information function $`I_Z(s^n)`$ obtained applying the compression algorithm CASToRe is approximated by the function $`\mathrm{\Psi }(n)`$:

$$\mathrm{\Psi }(n)=4+2\mathrm{log}_2(n+1)\left(\mathrm{log}_2(\mathrm{log}_2(n+1))1\right),$$
(12)
where the approximation is given by the identification of the integer part of $`\mathrm{log}_2(\mathrm{log}_2(n))`$ with its real value.

Proof. We notice that the algorithm CASToRe acts on $`s`$ in such a way that at the end of each term of the codification, the length $`n`$ of the codified string is of the form $`n=2^h1`$. Then we look for the value of $`I(2^h1)`$. We can easily obtain that if $`k=[\mathrm{log}_2h]`$, where $`[]`$ denotes the integer part, then

$$\begin{array}{cc}\hfill I(2^h1)=& 2+_{i=0}^{k1}2(2^{i+1}2^i)\mathrm{log}_2(2^{i+1})+2(n2^k)\mathrm{log}_2(2^{k+1})\hfill \\ \hfill =& 2+_{i=0}^{k1}(i+1)2^{i+1}+2(n2^k)\mathrm{log}_2(2^{k+1})\hfill \\ \hfill =& 4+(k1)2^{k+1}+2(n2^k)\mathrm{log}_2(2^{k+1}),\hfill \end{array}$$
(13)
where we used

$$\underset{j=1}{\overset{r}{}}j2^j=(r1)2^{r+1}+2.$$

At this point it is enough to approximate $`k`$ with its real value $`\mathrm{log}_2h`$, and substitute to $`h`$ its value $`\mathrm{log}_2(n+1)`$ to obtain equation (12). The theorem is proved. ∎

### 4.3 CASToRe on periodic strings

We now look at strings $`s`$ with prime period $`p>1`$. From the point of view of the information content, we expect that periodic strings are not so different from constant strings. Indeed we find that the algorithm CASToRe is able to recognize periodic strings as constant strings after having encoded $`n_p`$ symbols, depending on $`p`$. Then, the CIC $`I_Z(s^n)`$ must behave as in the constant case for $`n>n_p`$, indeed it is given by $`\mathrm{\Psi }(n)`$ plus a constant term $`C_s`$ that depends on the particular string $`s`$. This term $`C_s`$ can be estimated as the amount of information obtained from $`s`$ at the $`n_p`$-th symbol. We first prove the following theorem

###### Theorem 4.2.

Let $`s`$ be a periodic string with prime period $`p>1`$, then there exists a constant $`n_p`$, depending on $`s`$, such that, when the algorithm CASToRe reaches the $`n_p`$-th term of the string, it starts codifying the string $`s`$ as if it were a constant string. The constant $`n_p`$ has as upper bound

$$K_p=p^2\left[2+\frac{3}{2}\mathrm{log}_2p+\frac{1}{2}\mathrm{log}_2|𝒜|\right]$$
(14)
where $`|𝒜|`$ is the number of symbols in the alphabet used to construct the string $`s`$. Note that $`K_p`$ depends only on the period $`p`$.

Proof. Let us assume that $`|𝒜|=r`$. Since $`s`$ has prime period $`p`$, we can look at it as a sequence of substrings, each one $`p`$ symbols long; they will be called $`p`$-substrings.

Once the codification has started and the first $`p`$ characters have been read, the last encoded word will be $`t`$ symbols long and will end at some $`k`$-th (mod. $`p`$) site in the second $`p`$-substring. Then, after at most $`(p+1)`$ subsequent reading of contiguous $`p`$-substrings, the algorithm will arrive at the end of an already known word; this word will finish at some $`h`$-th (mod. $`p`$) site of the $`(p+2)`$-th $`p`$-substring of $`s`$.

Let us assume that the number of words needed by the algorithm to codify the fragment starting from the $`h`$-th symbol of a previous $`p`$-substring to its correspondent belonging to the $`(p+2)`$-th $`p`$-substring of $`s`$ is $`m`$; we will indicate the collection of that $`m`$ words by $`(h)`$. Let us analyse the different cases.

First case: $`m=2^c`$. The algorithm continues to process the remaining part of $`s`$, codifying the next fragment $`(h)`$ by coupling two words each time. So, after $`c`$ steps only one word will be necessary and later the algorithm will follow the period.

Second case: $`m=2^{c_1}q`$, where $`q`$ is odd. The algorithm first behaves $`c_1`$ times as described above, and after just $`q`$ words will be needed to process the following $`(h)`$. Let us call $`A_1,\mathrm{},A_q`$ those known words. After one step, the algorithm CASToRe will have built the new words $`B_1=(A_1,A_2),\mathrm{},B_{\frac{q1}{2}}=(A_{q2},A_{q1})`$, and $`B_{\frac{q1}{2}+1}=(A_q,B_1)`$. Then, the algorithm will reach the period after $`c_2`$ steps, where $`c_2=\mathrm{min}\{c:2^c>q+1\}`$.

Third case: m is odd. The algorithm will behave as in the second case, with $`c_1=0`$.

So we have proved the existence of the constant $`n_p`$. Let us estimate its upper bound, $`K_p`$. It holds:

$$n_pp(p+2)[1+C]$$

where $`C=\mathrm{min}\{c:2^c>m+1\}`$. Now, we estimate $`m`$. It does hold $`m(p+2)\times S`$ where $`S`$ is the number of words necessary to cover up a $`p`$-substring. Since $`r`$ different symbols are available in the alphabet $`𝒜`$, then it must be $`SN`$ where $`N`$ is the smaller integer such that it holds $`p_{i=1}^Nir^i`$.

Since we have

$$p\frac{r(N+1)r^{N+1}+Nr^{N+2}}{(r1)^2}=\underset{i=1}{\overset{N}{}}ir^i$$

and we are interested in an estimation of $`N`$, let us look for the smallest integer $`N`$ such that

$$\mathrm{log}_r\left(\frac{p(r1)^2}{r}1\right)2\mathrm{log}_rN.$$

Let $`N_0`$ the real solution of the following equation:

$$N_0=\sqrt{\frac{(r1)^2p}{r}1}.$$

Then the integer $`N`$ we looked for is $`O(\sqrt{rp})`$ and it holds $`m(p+2)\sqrt{rp}`$. So, we have $`C1+\mathrm{log}_2(m+1)`$. Finally, if we approximate $`p+2`$ with $`p`$, we obtain

$$K_pp^2\left[2+\frac{3}{2}\mathrm{log}_2p+\frac{1}{2}\mathrm{log}_2r\right]$$

and the theorem is proved. ∎

## 5 Experimental results on the logistic map

In this section we show how to obtain an estimation for the Computable Information Content $`I_Z(s^n)`$ for a finite string $`s^n`$ generated by the logistic map at the chaos threshold, using CASToRe as compression algorithm $`Z`$. In the remainder of this section we drop the subscript $`Z`$ from the CIC, since we are always referring to CASToRe.

The plan of our experiments on the logistic map is to apply CASToRe to strings generated by the logistic map $`f_\lambda `$ for different values of $`\lambda `$ that approximate the chaos threshold $`\lambda _{\mathrm{}}`$. In particular we consider two approximating sequences of values of $`\lambda `$: the sequence of values $`\lambda _j<\lambda _{\mathrm{}}`$ at which the period doubling bifurcations occur (Section 5.1) and the sequence of values $`\mu _j>\lambda _{\mathrm{}}`$ at which the inverse tangent bifurcations occur (Section 5.2). Thus we obtain approximations for the CIC at the chaos threshold from below and from above, and the two coincide. We can then say to have obtained an approximation for the CIC computed with CASToRe for the logistic map at the chaos threshold $`f_\lambda _{\mathrm{}}`$.

We remark that the symbolic strings are obtained from the orbits of the logistic map at the chaos threshold considering the partition $`\alpha =(A_0,A_1)`$ of $`[0,1]`$ given by $`A_0=[0,1/2)`$ and $`A_1=(1/2,1]`$. The choice of this partition for the experiments is justified by its optimality as remarked in Section 3.2.

### 5.1 The period doubling sequence

In Section 4.3 we have analysed the behaviour of our algorithm CASToRe on periodic strings, obtaining that the CIC $`I(s)`$ of a periodic string $`s`$ behaves with respect to the length $`n`$ of the encoded string as

$$I(s^n)=\mathrm{\Psi }(n)+C_s,$$
(15)
where $`\mathrm{\Psi }(n)`$ is given by equation (12) and $`C_s`$ is a constant depending on the string $`s`$ (Theorem 4.2).

We start considering the logistic map for values of the parameter $`\lambda `$ in the sequence $`(\lambda _j)_j`$ given by the period doubling bifurcations, for which values the logistic map is periodic. The sequence $`(\lambda _j)_j`$ converges to the chaos threshold value $`\lambda _{\mathrm{}}`$ from below and can be generated by the equation (5) (Section 3.1).

We generated the terms of the sequence $`(\lambda _j)_j`$ (where the differences are given up to 38 decimal digits) and iterated the logistic map $`10^7`$ times. So we had strings of $`10^7`$ symbols. When studying the CIC $`I_j(s^n)`$ for each $`\lambda _j`$, where $`s^n`$ is the symbolic orbit of the logistic map with parameter $`\lambda =\lambda _j`$, we first tried to obtain the constant terms $`C_j`$, as expected from equation (15). We have obtained an increasing sequence of values $`C_j`$ (for $`j`$ that tends to infinity), and our results about the compression of periodic strings by the algorithm CASToRe (see Theorem 4.2) are supported by the computations of the following limits

$$\underset{n\mathrm{}}{lim}\frac{I_j(s^n)C_j}{\mathrm{\Psi }(n)}=1j$$
(16)
As expected, equation (16) tells us that, after the compression of a long enough substring of our string $`s`$, we obtain the same information function as for constant strings, simply translated by a constant. If we denote by $`n_j`$ the number of symbols that the algorithm has to process before reaching that behaviour, we have $`n_j\mathrm{}`$ as $`j\mathrm{}`$. So we have that $`C_j\mathrm{}`$ as $`j\mathrm{}`$.

The approximation of the information content $`I_j(s^n)`$ with a function $`\mathrm{\Psi }(n)`$ of the form given by (12) plus a constant term is not very good for periodic strings with high period. This is because of the poorness of the upper bound of our computations: indeed, we know that this approximation is accurate for values of $`n>n_j`$ and there are strings whose $`n_j`$ is bigger than $`10^7`$, the length of our orbits. In our case the period $`p_j`$ of the strings $`s_j`$ is already big enough for $`j=12`$, indeed $`p_{12}=2^{12}=4098`$, so $`n_{12}16\times 10^6`$. This means that we have to look for another way of approximation to the information function for values of $`n`$ lower than $`n_j`$. At the bifurcation points it is well known from experimental results that the orbit separation is polynomial and, thanks to the results in , we can say that the Algorithmic Information Content is at most logarithmic. So, we can expect our Computable Information Content to behave like

$$I_j(s^n)\{\begin{array}{cc}S_j(n)\mathrm{\Psi }(n)\hfill & \text{ for }n<n_j\hfill \\ C_j+\mathrm{\Psi }(n)\hfill & \text{ for }n>n_j\hfill \end{array}j$$
(17)
with $`C_j`$ as given before. To find the functions $`S_j(n)`$, we simply have to compute the fraction

$$S_j(n)=\frac{I_j(s^n)}{\mathrm{\Psi }(n)},j.$$
(18)
First of all, we deduce from equation (16) that $`lim_n\mathrm{}S_j(n)=1`$ for all $`j`$. Moreover the numerical experiments show that the sequence of functions $`(S_j(n))_j`$ is point-wise increasing in $`j`$ and bounded from above (see figure 1 on the left). Then we define the bounding function $`S_{\mathrm{}}(n)`$ as

$$S_{\mathrm{}}(n)=\underset{j\mathrm{}}{lim}\left(S_j(n)\chi _{_{[0,n_j]}}(n)+\chi _{_{[n_j,\mathrm{}]}}(n)\right)$$

for each $`n`$, where $`\chi _{_{[a,b]}}(n)`$ denotes the characteristic function of the real interval $`[a,b]`$.

### 5.2 Inverse tangent bifurcations

In order to establish the behaviour of the information function $`I_{\mathrm{}}(s^n)`$ at the chaos threshold, we applied the same method as before, building up a sequence $`(\mu _k)_k`$ of parameters approximating $`\lambda _{\mathrm{}}`$ from above.

In the interval $`[\lambda _{\mathrm{}},4]`$, the logistic map has a general chaotic behaviour, except from narrow ranges (called periodic windows) of parameters for which the map is periodic. Inside each window, a new period doubling sequence can be identified, that leads the map to chaos. The behaviour becomes periodic from chaotic via a tangent bifurcation, that is we can find a fixed point of a given iterate of the map having 1 as its eigenvalue (). The values of the parameter at which the tangent bifurcations occur converge to $`\lambda _{\mathrm{}}`$ from above and can be generated using the following relation:

$$\mu _k=\lambda _{\mathrm{}}+\frac{c}{\delta ^k}$$

where $`c`$ is a suitable constant and $`\delta `$ is the Feigenbaum constant.

Using the same definition of $`S_k(n)`$ given in equation (18), we find a sequence of functions such that $`lim_n\mathrm{}S_k(n)=+\mathrm{}`$ for all $`k`$, due to the chaotic behaviour of the map at $`\mu _k`$.

As we can see in figure 1 on the right, the numerical evidence is that the sequence $`(S_k(n))_k`$ is point-wise decreasing in $`k`$ and the same function $`S_{\mathrm{}}(n)`$ found in the previous subsection is a lower bound for the sequence. Then we have

$$\underset{k\mathrm{}}{lim}S_k(n)=S_{\mathrm{}}(n)$$

for each $`n`$.

### 5.3 Results

From the previous subsections we can draw some conclusions. First of all, we can say that for all $`n`$ the information function $`I_j(s^n)`$ of the logistic map (3) with parameter $`\lambda =\lambda _j`$ (as shown in Section 5.1) is

$$I_j(s^n)S_j(n)\mathrm{\Psi }(n)\chi _{_{[0,n_j]}}(n)+(\mathrm{\Psi }(n)+C_j)\chi _{_{[n_j,\mathrm{}]}}(n)j,$$

and with parameter $`\lambda =\mu _k`$ (as shown in subsection 5.2) is

$$I_k(s^n)S_k(n)\mathrm{\Psi }(n)k.$$

Moreover we have that

$$\underset{j\mathrm{}}{lim}I_j(n)=\underset{k\mathrm{}}{lim}I_k(n)=I_{\mathrm{}}(n)=S_{\mathrm{}}(n)\mathrm{\Psi }(n)n.$$

From the numerical approximation of $`S_{\mathrm{}}(n)`$ from above and below, we conjecture that $`S_{\mathrm{}}(n)`$ is an increasing bounded function of $`n`$ and there exists a constant $`S_{\mathrm{}}=lim_n\mathrm{}S_{\mathrm{}}(n)`$.

Numerical estimates give a value of $`S_{\mathrm{}}`$ of more or less $`3.5`$. In figure 2 the behaviour of functions $`S_i(n)`$ corresponding to some values of both the approximating sequences is shown.

We have thus confirmed the theoretical result of Theorem 3.10, proving that the logistic map at the chaos threshold is mildly chaotic (see Section 2).

Finally we remark that the feature of $`I_{\mathrm{}}(s^n)`$ and in particular of $`S_{\mathrm{}}(n)`$ is typical of the logistic map, and is not simply due to the fact that we are considering periodic orbits with period going to infinity. Indeed, from the behaviour of the function $`S_{\mathrm{}}(n)`$, we deduce that $`\mathrm{max}__nS_{\mathrm{}}(n)<3.7`$ and this means that for $`n=10^3`$, for example, $`I_{\mathrm{}}(s^n)`$ is less than approximately $`148`$. But we can construct periodic strings with period less than $`100`$, such that the information after $`10^3`$ symbols is more than $`148`$. We can consider, for example, a string with period given by all the possible combinations of two symbols in pieces of length from 1 to 4. This string has period $`98<<2^7`$, but $`I(734)=356`$, much more than $`148`$.


text:
# The Form Factors and Quantum Equation of Motion in the sine-Gordon Model Talk given by H. Babujian at NATO Advanced Research Workshop “Dynamical Symmetries in Integrable Two-Dimensional Quantum Field Theories and Lattice Models” 25-30 September, Kiev Ukraine.

## 1 Introduction

This work continues a previous investigation  on exact form factors for the sine-Gordon alias the massive Thirring model. Coleman  had shown that these two models are equivalent on the quantum level. The corresponding classical models are defined by their Lagrangian’s

$`^{SG}`$ $`=`$ $`\frac{1}{2}_\mu \phi ^\mu \phi +{\displaystyle \frac{\alpha }{\beta ^2}}\left(\mathrm{cos}\beta \phi 1\right)`$
$`^{MT}`$ $`=`$ $`\overline{\psi }(i\gamma M)\psi \frac{1}{2}gj^\mu j_\mu ,\left(j^\mu =\overline{\psi }\gamma ^\mu \psi \right).`$
We do not use these classical Lagrangians and any quantization procedure to construct the quantum models. We have contact with the classical models only, when at the end we compare our exact results with Feynman graph expansions which are based on the Lagrangians. The ‘form factor program’ is part of the ‘Bootstrap program for integrable quantum field theories in 1+1-dimensions’. This program classifies integrable quantum field theoretic models and in addition it provides their explicit exact solutions in term of all Wightman functions. These results are obtained in three steps:

1. The S-matrix is calculated by means of general properties such as unitarity and crossing, the Yang-Baxter equations (which are a consequence of integrability) and the additional assumption of ‘maximal analyticity’. This means that the two-particle S-matrix is an analytic function in the physical plane (of the Mandelstam variable $`(p_1+p_2)^2`$) and possesses only those poles there which are of physical origin.
2. Generalized form factors which are matrix elements of local operators

$${}_{}{}^{out}p_m^{},\mathrm{},p_1^{}\left|𝒪(x)\right|p_1,\mathrm{},p_n_{}^{in}$$

are calculated by means of the S-matrix. More precisely, the equations $`(i)(v)`$ given below on page 2.2 are used as an input. These equations follow from LSZ-assumptions and again the additional assumption of ‘maximal analyticity’ (see also ).
3. The Wightman functions are obtained by inserting a complete set of intermediate states. In particular the two point function for a hermitian operator $`𝒪(x)`$ reads

$$𝒪(x)𝒪(0)=\underset{n=0}{\overset{\mathrm{}}{}}\frac{1}{n!}\mathrm{}\frac{dp_1\mathrm{}dp_n}{(2\pi )^n2\omega _1\mathrm{}2\omega _n}\left|\mathrm{\hspace{0.17em}0}\left|𝒪(0)\right|p_1,\mathrm{},p_n^{in}\right|^2e^{ix{\scriptscriptstyle p_i}}.$$

The on-shell program i.e. the exact determination of the scattering matrix was formulated in . Off-shell considerations were carried out in  and in , where the concept of a generalized form factor was introduced and consistency equations were formulated which are expected to be satisfied by these objects. Thereafter this approach was developed further and studied in the context of several explicit models (see e.g. 111For more references see .). More recent papers on solitonic matrix elements in the sine-Gordon model are . There is a nice application  of form factors in condensed matter physics. The one dimensional Mott insulators can be described in terms of the quantum sine-Gordon model.

In the previous paper  an integral representation for general matrix elements of the fundamental fermi-field of the massive Thirring model has been proposed. In  we generalize this formula and investigate in particular charge-less local operators. The strategy is as follows:

For a state of $`n`$ particles of kind $`\alpha _i`$ with momenta $`p_i=m\mathrm{sinh}\theta _i`$ and a local operator $`𝒪(x)`$ the generalized form factor is defined by

$$\mathrm{\hspace{0.17em}0}|𝒪(x)|\alpha _1(p_1),\mathrm{},\alpha _n(p_n)^{in}=e^{ix(p_1+\mathrm{}+p_n)}𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })$$
(1)
for $`\theta _1>\mathrm{}>\theta _n`$. The short notation $`\underset{¯}{\alpha }=(\alpha _1,\mathrm{},\alpha _n)`$ and $`\underset{¯}{\theta }=(\theta _1,\mathrm{},\theta _n)`$ has been used. We make the Ansatz

$$𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })=_{𝒞_{\underset{¯}{\theta }}}𝑑z_1\mathrm{}_{𝒞_{\underset{¯}{\theta }}}𝑑z_mh(\underset{¯}{\theta },\underset{¯}{z})p^𝒪(\underset{¯}{\theta },\underset{¯}{z})\mathrm{\Psi }_{\underset{¯}{\alpha }}(\underset{¯}{\theta },\underset{¯}{z})$$

with the Bethe state $`\mathrm{\Psi }_{\underset{¯}{\alpha }}(\underset{¯}{\theta },\underset{¯}{z})`$ defined by eq. (9) and the integration contours $`𝒞_{\underset{¯}{\theta }}`$ of figure 1. The scalar function $`h(\underset{¯}{\theta },\underset{¯}{z})`$ is uniquely determined by the S-matrix whereas the scalar ‘p-function’ $`p^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ depends on the operator. By means of the Ansatz we transform the properties $`(i)(v)`$ of the co-vector valued function $`𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })`$ (see page 2.2) to properties $`(i^{})(v^{})`$ of the scalar function $`p^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ which are easily solved. For example we obtain the p-functions for the local operator222The symbol $`𝒩`$ refers to normal products of local quantum fields. $`𝒩\left[\overline{\psi }\psi \right](x)`$ as

$$p^{\overline{\psi }\psi }(\underset{¯}{\theta },\underset{¯}{z})=N_n^{\overline{\psi }\psi }\left(\underset{i=1}{\overset{n}{}}e^{\theta _i}\underset{i=1}{\overset{m}{}}e^{z_i}\underset{i=1}{\overset{n}{}}e^{\theta _i}\underset{i=1}{\overset{m}{}}e^{z_i}\right).$$

In section 4 we propose in addition the p-functions for $`𝒩\left[\overline{\psi }\gamma ^5\psi \right](x)`$, the current $`j^\mu (x)`$, the energy momentum tensor $`T^{\mu \nu }(x)`$ and the infinitely many higher conserved currents $`J_L^\mu (x)`$. The identification with the operators is made by comparing the exact results with Feynman graph expansions. Properties as charge, behavior under Lorentz transformations etc. will also become obvious.

## 2 Recall of formulae

In this section we recall some formulae which we shall need in the following sections to present our results. All this material can be found in  including the original references.

### 2.1 The S-matrix

The sine-Gordon model alias massive Thirring model describes the interaction of several types of particles: solitons, anti-solitons alias fermions and anti-fermions and a finite number of charge-less breathers, which may be considered as bound states of solitons and anti-solitons. Integrability of the model implies that the n-particle S-matrix factorizes into two particle S-matrices. In particular scattering conserves the number of particles and even their momenta. The two particle soliton-soliton amplitude $`a(\theta )`$, the soliton anti-solitons forward and backward amplitudes $`b(\theta )`$ and $`c(\theta )`$ are given by

$$b(\theta )=\frac{\mathrm{sinh}\theta /\nu }{\mathrm{sinh}(i\pi \theta )/\nu }a(\theta ),c(\theta )=\frac{\mathrm{sinh}i\pi /\nu }{\mathrm{sinh}(i\pi \theta )/\nu }a(\theta ),$$

$$a(\theta )=\mathrm{exp}_0^{\mathrm{}}\frac{dt}{t}\frac{\mathrm{sinh}\frac{1}{2}(1\nu )t}{\mathrm{sinh}\frac{1}{2}\nu t\mathrm{cosh}\frac{1}{2}t}\mathrm{sinh}t\frac{\theta }{i\pi }.$$
(2)
The parameter $`\theta `$ is the absolute value of the rapidity difference $`\theta =|\theta _1\theta _2|`$ where $`\theta _i`$ are the rapidities of the particles given by the momenta $`p_i=M\mathrm{sinh}\theta _i`$. The parameter $`\nu `$ is related to the sine-Gordon and massive Thirring model coupling constant by

$$\nu =\frac{\beta ^2}{8\pi \beta ^2}=\frac{\pi }{\pi +2g}$$

where the second equality is due to Coleman .

We list some general properties of the two-particle S-matrix. As usual in this context we use in the notation

$$v^{1\mathrm{}n}V^{1\mathrm{}n}=V_1\mathrm{}V_n$$

for a vector in a tensor product space. The vector components are denoted by $`v^{\alpha _1\mathrm{}\alpha _n}`$. A linear operator connecting two such spaces with matrix elements $`A_{\alpha _1\mathrm{}\alpha _n}^{\alpha _1^{}\mathrm{}\alpha _n^{}^{}}`$ is denoted by

$$A_{1\mathrm{}n}^{1^{}\mathrm{}n^{}}:V^{1\mathrm{}n}V^{1^{}\mathrm{}n^{}}$$

where we omit the upper indices if they are obvious. All vector spaces $`V_i`$ are isomorphic to a space $`V`$ whose basis vectors are label all kinds of particles (here solitons and anti-solitons, i.e. $`V^2`$). An S-matrix as $`S_{ij}`$ acts nontrivial only on the factors $`V_iV_j`$.

The physical S-matrix in the formulas above is given for positive values of the rapidity parameter $`\theta `$. For later convenience we will also consider an auxiliary matrix $`\dot{S}(\theta _1,\theta _2)`$ regarded as a function depending on the individual rapidities of both particles $`\theta _1,\theta _2`$ or some times also on the difference $`\theta _1\theta _2`$

$$\dot{S}_{12}(\theta _1,\theta _2)=\dot{S}_{12}(\theta _1\theta _2)=\{\begin{array}{ccc}(\sigma S)_{12}(|\theta _1\theta _2|)\hfill & \text{for}\hfill & \theta _1>\theta _2\hfill \\ (S\sigma )_{21}^1(|\theta _1\theta _2|)\hfill & \text{for}\hfill & \theta _1<\theta _2\hfill \end{array}$$

with $`\sigma `$ taking into account the statistics of the particles. It is a diagonal matrix $`\sigma _{12}`$ with entries $`1`$ if both particles are fermions and $`+1`$ otherwise. The matrix $`\dot{S}(\theta _1,\theta _2)`$ is an analytic function in terms of both variables $`\theta _1`$ and $`\theta _2`$. The auxiliary matrix $`\dot{S}_{12}`$ acts nontrivial on the factors $`V_1V_2`$ and in addition exchanges these factors, e.g.

$$\dot{S}_{12}(\theta ):V_1V_2V_2V_1.$$

It may be depicted as

$$\dot{S}_{12}(\theta _1,\theta _2)=\begin{array}{c}\text{}\end{array}$$

Here and in the following we associate a rapidity variable $`\theta _i`$ to each space $`V_i`$ which is graphically represented by a line labeled by $`\theta _i`$ or simply by $`i`$. In terms of the auxiliary S-matrix the Yang-Baxter equation has the general form

$$\dot{S}_{12}(\theta _{12})\dot{S}_{13}(\theta _{13})\dot{S}_{23}(\theta _{23})=\dot{S}_{23}(\theta _{23})\dot{S}_{13}(\theta _{13})\dot{S}_{12}(\theta _{12})$$

which graphically simply reads

$$\begin{array}{c}\text{}.\end{array}$$

Unitarity and crossing may be written and depicted as

$$\dot{S}_{21}(\theta _{21})\dot{S}_{12}(\theta _{12})=1:\begin{array}{c}\text{}\end{array}$$
(3)
$$\dot{S}_{12}(\theta _1\theta _2)=𝐂^{2\overline{2}}\dot{S}_{\overline{2}1}(\theta _2+i\pi \theta _1)𝐂_{\overline{2}2}=𝐂^{1\overline{1}}\dot{S}_{2\overline{1}}(\theta _2(\theta _1i\pi )𝐂^{\overline{1}1}$$
(4)
$$\begin{array}{c}\text{}\end{array}=\begin{array}{c}\text{}\end{array}=\begin{array}{c}\text{}\end{array}$$
(8)
where $`𝐂^{1\overline{1}}`$ and $`𝐂_{1\overline{1}}`$ are charge conjugation matrices. For the sine-Gordon model the matrix elements are $`𝐂^{\alpha \overline{\beta }}=𝐂_{\alpha \overline{\beta }}=\delta _{\alpha \beta }`$ where $`\overline{\beta }`$ denotes the anti-particle of $`\beta `$. We have introduced the graphical rule, that a line changing the “time direction” also interchanges particles and anti-particles and changes the rapidity as $`\theta \theta \pm i\pi `$, as follows

$$𝐂_{\alpha \overline{\beta }}=\begin{array}{c}\text{}\end{array},𝐂^{\alpha \overline{\beta }}=\begin{array}{c}\text{}\end{array}.$$

Similar crossing relations will be used below to investigate the properties of form factors.

Finally we denote a property of the two-particle S-matrix

$$\dot{S}_{\alpha \beta }^{\delta \gamma }(0)=\delta _\alpha ^\delta \delta _\beta ^\gamma $$

which turns out to be true for all examples. This means that $`\dot{S}`$ for zero momentum difference is equal to minus the permutation operator.

### 2.2 Form factors

For a state of $`n`$ particles of kind $`\alpha _i`$ with momenta $`p_i`$ and a local operator $`𝒪(x)`$ we define the form factor functions $`𝒪_{\alpha _1,\mathrm{},\alpha _n}(\theta _1,\mathrm{},\theta _n)`$ by eq. (1) on page 1 for the specific order of the rapidities$`\theta _1>\mathrm{}>\theta _n`$. For all other arrangements of the rapidities the functions $`𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })`$ are given by analytic continuation. Note that in general this analytic continuation does not provide the physical values of the form factor. These are given for ordered rapidities as indicated above and for other orders by the statistics of the particles, of course. The $`𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })`$ are considered as the components of a co-vector valued function $`𝒪_{1\mathrm{}n}(\underset{¯}{\theta })V_{1\mathrm{}n}=\left(V^{1\mathrm{}n}\right)^{}`$which may be depicted as

$$𝒪_{1\mathrm{}n}(\underset{¯}{\theta })=\begin{array}{c}\text{}\end{array}.$$

Now we formulate the main properties of form factors in terms of the functions $`𝒪_{1\mathrm{}n}(\underset{¯}{\theta })`$ which follow from general LSZ-assumptions and “maximal analyticity”. The later condition means that $`𝒪_{1\mathrm{}n}(\underset{¯}{\theta })`$ is a meromorphic function with respect to all $`\theta `$’s and all poles in the ‘physical’ strips $`0<\mathrm{I}m\theta _{ij}<\pi `$ $`(\theta _{ij}=\theta _i\theta _ji<j)`$ are of physical origin, as for example bound state poles.

#### Properties:

The co-vector valued function $`𝒪_{1\mathrm{}n}(\underset{¯}{\theta })`$ is meromorphic with respect to all variables $`\theta _1,\mathrm{},\theta _n`$ and

* it satisfies the symmetry property under the permutation of both, the variables $`\theta _i,\theta _j`$ and the spaces $`i,j`$ at the same time

$$𝒪_{\mathrm{}ij\mathrm{}}(\mathrm{},\theta _i,\theta _j,\mathrm{})=𝒪_{\mathrm{}ji\mathrm{}}(\mathrm{},\theta _j,\theta _i,\mathrm{})\dot{S}_{ij}(\theta _i\theta _j)$$

for all possible arrangements of the $`\theta `$’s,
* it satisfies the periodicity property under the cyclic permutation of the rapidity variables and spaces

$$𝒪_{1\mathrm{}n}(\theta _1,\theta _2,\mathrm{},\theta _n,)=𝒪_{2\mathrm{}n1}(\theta _2,\mathrm{},\theta _n,\theta _12\pi i)\sigma _{𝒪1}$$
* and it has poles determined by one-particle states in each sub-channel. In particular the function $`𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })`$ has a pole at $`\theta _{12}=i\pi `$ such that

$$\underset{\theta _{12}=i\pi }{\mathrm{R}es}𝒪_{1\mathrm{}n}(\theta _1,\mathrm{},\theta _n)=2i𝐂_{12}𝒪_{3\mathrm{}n}(\theta _3,\mathrm{},\theta _n)\left(\mathrm{𝟏}S_{2n}\mathrm{}S_{23}\right)$$

where $`𝐂_{12}`$ is the charge conjugation matrix.
* If the model also possesses bound states, the function $`𝒪_{\underset{¯}{\alpha }}(\underset{¯}{\theta })`$ has additional poles. If for instance the particles 1 and 2 form a bound state (12), there is a pole at $`\theta _{12}=iu_{12}^{(12)}(0<u_{12}^{(12)}<\pi )`$ such that

$$\underset{\theta _{12}=iu_{12}^{(12)}}{\mathrm{R}es}𝒪_{12\mathrm{}n}(\theta _1,\theta _2,\mathrm{},\theta _n)=𝒪_{(12)\mathrm{}n}(\theta _{(12)},\mathrm{},\theta _n)\sqrt{2}\mathrm{\Gamma }_{12}^{(12)}$$

where the bound state intertwiner $`\mathrm{\Gamma }_{12}^{(12)}`$ and the relations of the rapidities $`\theta _1,\theta _2,\theta _{(12)}`$ and the fusion angle $`u_{12}^{(12)}`$ .
* Naturally, since we are dealing with relativistic quantum field theories we finally have Lorentz covariance

$$𝒪_{1\mathrm{}n}(\theta _1+\mu ,\mathrm{},\theta _n+\mu )=e^{s\mu }𝒪_{1\mathrm{}n}(\theta _1,\mathrm{},\theta _n)$$

if the local operator transforms as $`𝒪e^{s\mu }𝒪`$ where $`s`$ is the “spin” of $`𝒪`$.

In the formulae $`(i)`$ the statistics of the particles is taken into account by $`\dot{S}`$ which means that $`\dot{S}_{12}=S_{12}`$ if both particles are fermions and $`\dot{S}_{12}=S_{12}`$ otherwise. In $`(ii)`$ the statistics of the operator $`𝒪`$ is taken into account by $`\sigma _{𝒪1}=1`$ if both the operator $`𝒪`$ and particle 1 are fermionic and $`\sigma _{𝒪1}=1`$ otherwise.

The property $`(i)(iv)`$ may be depicted as

$$\begin{array}{cccc}\hfill (i)& \hfill \begin{array}{c}\text{}\end{array}& =& \begin{array}{c}\text{}\end{array}\hfill \\ \hfill (ii)& \hfill \begin{array}{c}\text{}\end{array}& =& \begin{array}{c}\text{}\end{array}\sigma _{𝒪1}\hfill \\ \hfill (iii)& \hfill \frac{1}{2i}\underset{\theta _{12}=i\pi }{\mathrm{R}es}\begin{array}{c}\text{}\end{array}& =& \begin{array}{c}\text{}\end{array}\begin{array}{c}\text{}\end{array}\sigma _{𝒪1}\hfill \\ \hfill (iv)& \hfill \frac{1}{\sqrt{2}}\underset{\theta _{12}=iu_{12}^{(12)}}{\mathrm{R}es}\begin{array}{c}\text{}\end{array}& =& \begin{array}{c}\text{}\end{array}\hfill \end{array}$$

We will now provide a constructive and systematic way of how to solve the properties $`(i)(v)`$ for the co-vector valued function $`f`$ once the scattering matrix is given. These solutions are candidates of form factors. To capture the vectorial structure of the form factors we will employ the techniques of the algebraic Bethe Ansatz which we now explain briefly.

### 2.3 The ‘off-shell’ Bethe Ansatz co-vectors

As usual in the context of algebraic Bethe Ansatz we define the monodromy matrix as

$$T_{1\mathrm{}n,0}(\underset{¯}{\theta },\theta _0)=\dot{S}_{10}(\theta _1\theta _0)\dot{S}_{20}(\theta _2\theta _0)\mathrm{}\dot{S}_{n0}(\theta _n\theta _0)=\begin{array}{c}\text{}\end{array}.$$

It is a matrix acting in the tensor product of the “quantum space” $`V^{1\mathrm{}n}=V_1\mathrm{}V_n`$ and the “auxiliary space” $`V_0`$ (all $`V_i^2`$ = soliton-anti-soliton space). The sub-matrices $`A,B,C,D`$ with respect to the auxiliary space are defined by

$$T_{1\mathrm{}n,0}(\underset{¯}{\theta },z)\left(\begin{array}{cc}A_{1\mathrm{}n}(\underset{¯}{\theta },z)& B_{1\mathrm{}n}(\underset{¯}{\theta },z)\\ C_{1\mathrm{}n}(\underset{¯}{\theta },z)& D_{1\mathrm{}n}(\underset{¯}{\theta },z)\end{array}\right).$$

A Bethe Ansatz co-vector in $`V_{1\mathrm{}n}`$ is given by

$$\begin{array}{ccc}\hfill \mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z})& =& \mathrm{\Omega }_{1\mathrm{}n}C_{1\mathrm{}n}(\underset{¯}{\theta },z_1)\mathrm{}C_{1\mathrm{}n}(\underset{¯}{\theta },z_m)\hfill \\ \hfill \begin{array}{c}\text{}\end{array}& =& \begin{array}{c}\text{}\end{array}\hfill \end{array}$$
(9)
where $`\underset{¯}{z}=(z_1,\mathrm{},z_m)`$. Usually one has the restriction $`2mn`$ and the charge of the state is $`q=n2m=`$ number of solitons minus number of anti-solitons. The solitons are depicted by $``$ or $``$ and anti-solitons by $``$ or $``$. The co-vector $`\mathrm{\Omega }_{1\mathrm{}n}`$ is the “pseudo-vacuum” consisting only of solitons (highest weight states)

$$\mathrm{\Omega }_{1\mathrm{}n}=\mathrm{}.$$

It satisfies

$$\begin{array}{ccc}\hfill \mathrm{\Omega }_{1\mathrm{}n}B_{1\mathrm{}n}(\underset{¯}{\theta },z)& =& 0\hfill \\ \hfill \mathrm{\Omega }_{1\mathrm{}n}A_{1\mathrm{}n}(\underset{¯}{\theta },z)& =& \underset{i=1}{\overset{n}{}}\dot{a}(\theta _iz)\mathrm{\Omega }_{1\mathrm{}n}\hfill \\ \hfill \mathrm{\Omega }_{1\mathrm{}n}D_{1\mathrm{}n}(\underset{¯}{\theta },z)& =& \underset{i=1}{\overset{n}{}}\dot{b}(\theta _iz)\mathrm{\Omega }_{1\mathrm{}n}.\hfill \end{array}$$

The eigenvalues of the matrices $`A`$ and $`D`$, i.e. the functions $`\dot{a}=a`$ and $`\dot{b}=b`$ are given by the amplitudes of the scattering matrix (2). In the following we use the co-vector $`\mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z})`$ in its ‘off-shell’ version which means that we do not fix the parameters $`\underset{¯}{z}`$ by means of Bethe Ansatz equations but we integrate over the $`z`$’s.

## 3 The general form factor formula

In this section we present our main result. We derive a general formula in terms of an integral representation which allows to construct form factors i.e. matrix elements of local fields as given by eq. (1). More precisely, we construct co-vector valued functions which satisfy the properties $`(i)(v)`$ on page 2.2.

As a candidate of a generalized form factor of a local operator $`𝒪(0)`$ we make the following Ansatz for the co-vector valued function

$$𝒪_{1\mathrm{}n}(\underset{¯}{\theta })=_{𝒞_{\underset{¯}{\theta }}}𝑑z_1\mathrm{}_{𝒞_{\underset{¯}{\theta }}}𝑑z_mh(\underset{¯}{\theta },\underset{¯}{z})p^𝒪(\underset{¯}{\theta },\underset{¯}{z})\mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z})$$
(10)
with the Bethe Ansatz state $`\mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z})`$ defined by eq. (9). For all integration variables $`z_j`$ $`(j=1,\mathrm{},m)`$ the integration contours $`𝒞_{\underset{¯}{\theta }}`$ consists of several pieces (see figure 1):

* A line from $`\mathrm{}`$ to $`\mathrm{}`$ avoiding all poles such that $`\mathrm{I}m\theta _i\pi ϵ<\mathrm{I}mz_j<\mathrm{I}m\theta _i\pi `$.
* Clock wise oriented circles around the poles (of the $`\varphi (\theta _iz_j)`$) at $`z_j=\theta _i`$ $`(i=1,\mathrm{},n)`$.

Let the scalar function (c.f. )

$$h(\underset{¯}{\theta },\underset{¯}{z})=\underset{1i<jn}{}F(\theta _{ij})\underset{i=1}{\overset{n}{}}\underset{j=1}{\overset{m}{}}\varphi (\theta _iz_j)\underset{1i<jm}{}\tau (z_iz_j),$$
(11)
be given by

$$\tau (z)=\frac{1}{\varphi (z)\varphi (z)},\varphi (z)=\frac{1}{F(z)F(z+i\pi )}$$
(12)
and

$`F(\theta )`$ $`=`$ $`\mathrm{sin}{\displaystyle \frac{1}{2i}}\theta f_{ss}^{(0)}(\theta )`$
$`f_{ss}^{(0)}(\theta )`$ $`=`$ $`\mathrm{exp}{\displaystyle _0^{\mathrm{}}}{\displaystyle \frac{dt}{t}}{\displaystyle \frac{\mathrm{sinh}\frac{1}{2}(1\nu )t}{\mathrm{sinh}\frac{1}{2}\nu t\mathrm{cosh}\frac{1}{2}t}}{\displaystyle \frac{1\mathrm{cosh}t(1\theta /(i\pi ))}{2\mathrm{sinh}t}}.`$ (13)
The function $`F(\theta )`$ is the soliton-soliton form factor fulfilling Watson’s equations

$$F(\theta )=F(\theta )\dot{a}(\theta )=F(2\pi i\theta )$$
(14)
with $`\dot{a}(\theta )=a(\theta )`$ where $`a(\theta )`$ is the soliton-soliton scattering amplitude.

#### Remarks:

* Using Watson’s equations (14) for $`F(z)`$, crossing (4) and unitarity (3) for the sine-Gordon amplitudes one derives the following identities for the scalar functions $`\varphi (z)`$ and $`\tau (z)`$ from the definitions (12)

$$\varphi (z)=\varphi (i\pi z)=\frac{1}{\dot{b}(z)}\varphi (zi\pi )=\frac{\dot{a}(z2\pi i)}{\dot{b}(z)}\varphi (z2\pi i),$$

$$\tau (z)=\tau (z)=\frac{b(z)}{a(z)}\frac{a(2\pi iz)}{b(2\pi iz)}\tau (z2\pi i)$$

where $`b(z)`$ is the soliton-anti-soliton scattering amplitude related to $`a(z)`$ by crossing $`b(z)=a(i\pi z)`$.
* The functions $`\varphi (z)`$ and $`\tau (z)`$ are of the form

$$\varphi (z)=\frac{const}{\mathrm{sinh}z}\mathrm{exp}_0^{\mathrm{}}\frac{dt}{t}\frac{\mathrm{sinh}\frac{1}{2}(1\nu )t\left(\mathrm{cosh}t(\frac{1}{2}z/(i\pi ))1\right)}{\mathrm{sinh}\frac{1}{2}\nu t\mathrm{sinh}t}$$

$$\tau (z)=const.\mathrm{sinh}z\mathrm{sinh}z/\nu $$
* The function $`h(\underset{¯}{\theta },\underset{¯}{z})`$ and the state $`\mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z})`$ are completely determined by the S-matrix.

In contrast to the functions $`F(z),\varphi (z)`$ and $`\tau (z)`$ the ‘p-function’ $`p^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ in the integral representation (10) depends on the local operator $`𝒪(x),`$in particular on the spin, the charge and the statistics. The number of the particles $`n`$ and the number of integrations $`m`$ are related by $`q=n2m`$ where $`q`$ is the charge of the operator $`𝒪(x)`$. The p-functions is an entire function in the $`z_j(j=1,\mathrm{},m)`$ and in order that the form factor satisfies the properties $`(i)(v)`$ it has to satisfy the following

#### Conditions:

The p-function $`p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ (where $`n`$ is the number of particles and the number of variables $`\theta `$) satisfies

* $`p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ is symmetric with respect to the $`\theta `$’s and the $`z`$’s.
* $`p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})=\sigma _{𝒪i}p_n^𝒪(\mathrm{},\theta _i2\pi i,\mathrm{},\underset{¯}{z})`$ and it is a polynomial in $`e^{\pm z_j}(j=1,\mathrm{},m)`$.

The statistics factor $`\sigma _{𝒪i}`$ is $`1`$ if the operator $`𝒪(x)`$ and the particle $`i`$ are both fermionic and $`+1`$ otherwise.
* $`\{\begin{array}{c}p_n^𝒪(\theta _1=\theta _n+i\pi ,\underset{¯}{\overset{~}{\theta }},\theta _n;\underset{¯}{\overset{~}{z}},z_m=\theta _n)={\displaystyle \frac{\varkappa }{m}}p_{n2}^𝒪(\underset{¯}{\overset{~}{\theta }},\underset{¯}{\overset{~}{z}})+\stackrel{~}{p}^{(1)}(\underset{¯}{\theta })\hfill \\ p_n^𝒪(\theta _1=\theta _n+i\pi ,\underset{¯}{\overset{~}{\theta }},\theta _n;\underset{¯}{\overset{~}{z}},z_m=\theta _1)=\sigma _{𝒪1}{\displaystyle \frac{\varkappa }{m}}p_{n2}^𝒪(\underset{¯}{\overset{~}{\theta }},\underset{¯}{\overset{~}{z}})+\stackrel{~}{p}^{(2)}(\underset{¯}{\theta })\hfill \end{array}`$

where $`\underset{¯}{\overset{~}{\theta }}=(\theta _2,\mathrm{},\theta _{n1}),\underset{¯}{\overset{~}{z}}=(z_1,\mathrm{}z_{m1})`$ and where $`\stackrel{~}{p}^{(1,2)}(\underset{¯}{\theta })`$ are independent of the $`z`$’s and non-vanishing only for charge less operators $`𝒪(x)`$. The constant $`\varkappa `$ depends on the coupling and is given by (see formula (B.7) in )

$$\varkappa =\frac{\left(f_{ss}^{(0)}(0)\right)^2}{4\pi }.$$
* the bound state p-functions are investigated in section 5
* $`p_n^𝒪(\underset{¯}{\theta }+\mu ,\underset{¯}{z}+\mu )=e^{s\mu }p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ where $`s`$ is the ‘spin’ of the operator $`𝒪(x)`$.

As an extension of theorem 4.1 in  we prove the following theorem which allow to construct generalized form factors.

###### Theorem 1

The co-vector valued function $`𝒪_{1\mathrm{}n}(\underset{¯}{\theta })`$ defined by (10) fulfills the properties $`(i),(ii)`$ and $`(iii)`$ on page 2.2 if the functions $`F(\theta ),\varphi (z)`$ and $`\tau (z)`$ are given by definition (11) – (13) and if the p-function $`p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})`$ satisfies the conditions $`(i^{})(iii^{})`$.

This theorem is proven in .

#### Remarks:

* The number of C-operators $`m`$ depends on the charge $`q=n2m`$ of the operator $`𝒪`$, e.g. $`m=(n1)/2`$ for the soliton field $`\psi (x)`$ with charge $`q=1`$ and $`m=n/2`$ for charge-less operators like $`\overline{\psi }\psi `$ or the energy momentum tensor $`T^{\mu \nu }`$.
* Note that other sine-Gordon form factors can be calculated from the general formula (10) using the bound state formula $`(iv)`$.
* The general representation of form factors by formula (10) is not specific to the sine-Gordon model. It may be applied to all integrable quantum field theoretic model. The main difficulty is to solve the corresponding Bethe Ansatz.

## 4 Examples of “p-functions”

In this section we propose the p-functions for various local operators. Since the charge of the operators which we consider is zero the number of integrations $`m`$ and the number of particles $`n`$ are related by $`m=n/2`$ and form factors are non-vanishing only for even number of particles $`n=2,4,\mathrm{}`$. We consider p-functions of the form

$$p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})=N_n^𝒪\left(p_+^𝒪(P^\mu )\underset{j=1}{\overset{m}{}}e^{Lz_j}+p_{}^𝒪(P^\mu )\underset{j=1}{\overset{m}{}}e^{Lz_j}\right)$$
(15)
where $`P^\mu `$ is the total energy momentum vector of all particles. The integrals in (10) converge for $`L<(1/\nu +1)(n/2m+1)+1/\nu `$. For large values of $`L`$ the form factors are defined in general as the analytic continuations of the integral representation from sufficiently small values of $`\nu `$ to other values. Obviously the p-functions (15) satisfy the conditions $`(i^{})(iii^{})`$ on page 3. From the property $`(iii^{})`$ we obtain the recursion relation for the normalization constants

$$N_n^𝒪=N_{n2}^𝒪\frac{\varkappa }{m}N_n^𝒪=N_2^𝒪\frac{1}{m!}\varkappa ^{m1}$$

where $`N_2^𝒪`$ follows from the two-particle form factors. For the local operators $`𝒩\left[\overline{\psi }\psi \right](x)`$, $`𝒩\left[\overline{\psi }\gamma ^5\psi \right](x)`$, the current $`j^\mu (x)=𝒩\left[\overline{\psi }\gamma ^\mu \psi \right](x)`$, the energy momentum tensor $`T^{\mu \nu }(x)=\frac{i}{2}𝒩\left[\overline{\psi }\gamma ^\mu \stackrel{}{^\nu \text{}}\psi \right](x)g^{\mu \nu }^{MT}`$ and the infinitely many higher conserved currents $`J_L^\mu (x)`$ we propose the following p-functions

$`p^{\overline{\psi }\psi }(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`N_n^{\overline{\psi }\psi }\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}\right)`$
$`p^{\overline{\psi }\gamma ^5\psi }(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`N_n^{\overline{\psi }\gamma ^5\psi }\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}+{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}\right)`$
$`p^{j^\pm }(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`\pm N_n^j\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}\right)^1\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}+{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}\right)`$
$`p^{T^{\pm \pm }}(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`N_n^T{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\pm \theta _i}\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}\right)^1\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}\right)`$
$`p^{T^+}(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`N_n^T\left({\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{z_i}\right)`$
$`p^{J_L^\pm }(\underset{¯}{\theta },\underset{¯}{z})`$ $`=`$ $`\pm N_n^{J_L}{\displaystyle \underset{i=1}{\overset{n}{}}}e^{\pm \theta _i}{\displaystyle \underset{i=1}{\overset{m}{}}}e^{Lz_i},(L=\pm 1,\pm 3,\mathrm{}).`$
The identification with the operators has been made by comparing the exact results with Feynman graph expansions. Properties as charge, behavior under Lorentz transformations etc. also become obvious  The fundamental sine-Gordon bose field $`\phi (x)`$ which correspond to the lowest breather is related to the current by Coleman’s formula

$$ϵ^{\mu \nu }_\nu \phi =\frac{2\pi }{\beta }j^\mu \text{or}^\pm \phi =\pm \frac{2\pi }{\beta }j^\pm .$$

This implies for the p-function

$$p_n^\phi (\underset{¯}{\theta },\underset{¯}{z})=N_n^j\frac{2\pi i}{\beta M}\left(\underset{i=1}{\overset{n}{}}e^\theta \underset{i=1}{\overset{n}{}}e^\theta \right)^1\left(\underset{i=1}{\overset{n}{}}e^\theta \underset{i=1}{\overset{m}{}}e^z+\underset{i=1}{\overset{n}{}}e^\theta \underset{i=1}{\overset{m}{}}e^z\right).$$

## 5 Soliton Breather form factors

We calculate breather form factors starting with the general formula (10) for the soliton form factors using the property $`(vi)`$ on page $`(iv)`$ (for details see ). The $`b_k`$-breather-$`(n2)`$-soliton form factor is obtained from $`𝒪_{123\mathrm{}n}(\underset{¯}{\theta })`$ by means of the fusion procedure $`(iv)`$ with the fusion angle given by $`u_{12}^{(12)}=u^{(k)}=\pi (1k\nu )`$ the bound state rapidity $`\xi =\theta _{(12)}=\frac{1}{2}(\theta _1+\theta _2)`$ and $`\underset{¯}{\theta }^{}=\theta _3,\mathrm{},\theta _n`$

$$\underset{\theta _{12}=iu^{(k)}}{\mathrm{R}es}𝒪_{123\mathrm{}n}(\underset{¯}{\theta })=𝒪_{(12)3\mathrm{}n}(\xi ,\underset{¯}{\theta }^{})\sqrt{2}\mathrm{\Gamma }_{12}^{(12)}(iu^{(k)})$$

where the bound state intertwiner .

For $`\theta _{12}iu^{(k)}`$ there will be pinchings of the integration contours in formula (10) at the poles $`z_i=z^{(l)}=\theta _2i\pi l\nu =\xi \frac{1}{2}i\pi (1k\nu +2l\nu )`$ for $`l=0,\mathrm{},k`$ and $`i=1,\mathrm{},m`$. Using the pinching rule of contour integrals and the symmetry with respect to the $`mz`$-integrations we obtain

$$\begin{array}{c}\underset{\theta _{12}=iu^{(k)}}{\mathrm{R}es}𝒪_{123\mathrm{}n}(\underset{¯}{\theta })=\underset{\theta _{12}=iu^{(k)}}{\mathrm{R}es}(2\pi i)m\underset{l=0}{\overset{k}{}}\underset{z_1=z^{(l)}}{\mathrm{R}es}_{𝒞_{\underset{¯}{\theta }}}𝑑z_2\mathrm{}_{𝒞_{\underset{¯}{\theta }}}𝑑z_m\hfill \\ \hfill \times h(\underset{¯}{\theta },\underset{¯}{z})p^𝒪(\underset{¯}{\theta },\underset{¯}{z})\mathrm{\Psi }_{1\mathrm{}n}(\underset{¯}{\theta },\underset{¯}{z}).\end{array}$$

After a lengthy calculation  we obtain for the case of the lowest breather the one-breather-$`(n2)`$-soliton form factor

$$\begin{array}{c}𝒪_{3\mathrm{}n}(\xi ,\underset{¯}{\theta }^{})=\underset{2<i}{}F_{sb}(\xi \theta _i)\underset{2<i<j}{}F(\theta _{ij})\underset{l=0}{\overset{1}{}}(1)^l\underset{2<i}{}\rho (\xi \theta _i,l)\hfill \\ \hfill \times _{𝒞_{\underset{¯}{\theta }}}dz_2\mathrm{}_{𝒞_{\underset{¯}{\theta }}}dz_m\underset{1<j}{}\chi (\xi z_j,l)\\ \hfill \times \underset{2<i}{}\underset{1<j}{}\varphi (\theta _iz_j)\underset{1<i<j}{}\tau (z_{ij})\stackrel{~}{p}^𝒪(\xi ,\underset{¯}{\theta }^{},z^{(l)},\underset{¯}{z}^{})\mathrm{\Psi }_{3\mathrm{}n}(\underset{¯}{\theta }^{},\underset{¯}{z}^{})\end{array}$$

with $`\underset{¯}{z}^{}=(z_2,\mathrm{},z_m)`$. The soliton-breather form factor has been introduced as

$`F_{sb}(\theta )`$ $`=`$ $`K_{sb}(\theta )\mathrm{sin}\frac{1}{2i}\theta f_{sb}^{(0)}(\theta )`$
$`f_{sb}^{(0)}(\theta )`$ $`=`$ $`\mathrm{exp}{\displaystyle _0^{\mathrm{}}}{\displaystyle \frac{dt}{t}}\mathrm{\hspace{0.17em}2}{\displaystyle \frac{\mathrm{cosh}\frac{1}{2}\nu t}{\mathrm{cosh}\frac{1}{2}t}}{\displaystyle \frac{1\mathrm{cosh}t(1\theta /(i\pi ))}{2\mathrm{sinh}t}}`$
$`K_{sb}(\theta )`$ $`=`$ $`{\displaystyle \frac{\mathrm{cos}\frac{\pi }{4}(1\nu )/E(\frac{1}{2}(1\nu ))}{\mathrm{sinh}\frac{1}{2}(\theta \frac{i\pi }{2}(1+\nu ))\mathrm{sinh}\frac{1}{2}(\theta +\frac{i\pi }{2}(1+\nu ))}}`$
The normalization has been chosen such that $`F_{sb}(\mathrm{})=1`$. The function $`E(\nu )`$ was used in  Also we have introduced the short notations

$`\rho (\xi ,l)`$ $`=`$ $`(1)^l{\displaystyle \frac{\mathrm{sinh}\frac{1}{2}\left(\xi \frac{i\pi }{2}(1+(1)^l\nu )\right)}{\mathrm{sinh}\frac{1}{2}\xi }}`$
$`\chi (\xi ,l)`$ $`=`$ $`(1)^l{\displaystyle \frac{\mathrm{sinh}\frac{1}{2}(\xi +\frac{i\pi }{2}(1+(1)^l\nu ))}{\mathrm{sinh}\frac{1}{2}(\xi \frac{i\pi }{2}(1+(1)^l\nu ))}}`$
The following identities have been used

$`F(\theta _1\theta _i)F(\theta _2\theta _i)\stackrel{~}{\varphi }(\theta _iz^{(l)})`$ $`=`$ $`F_{sb}(\xi \theta _i)\rho (\xi \theta _i,l)`$
$`\varphi (\theta _1z_j)\varphi (\theta _2z_j)S_{sb}(\xi z_j)\tau (z^{(l)}z_j)`$ $`=`$ $`\chi (\xi z_j,l)`$
for $`\theta _{1/2}=\xi \pm \frac{i\pi }{2}(1\nu ),z^{(l)}=\xi \frac{i\pi }{2}(1(1)^l\nu ).`$ The new p-function is obtained from the old one by

$$\stackrel{~}{p}^𝒪(\xi ,\underset{¯}{\theta }^{},z^{(l)},\underset{¯}{z}^{})=md(\nu )p^𝒪(\xi +\frac{1}{2}iu^{(1)},\xi \frac{1}{2}iu^{(1)},\underset{¯}{\theta }^{},z^{(l)},\underset{¯}{z}^{})$$

where the constant $`d(\nu )`$ is given by

$$d(\nu )=\frac{\sqrt{E(\nu )}}{\varkappa \sqrt{\mathrm{sin}\frac{1}{2}\pi \nu }}$$

Iterating the procedure above we obtain the $`r`$-breather-$`s`$-soliton form factor with $`2r+s=n,`$ the breather rapidities $`\underset{¯}{\xi }=(\xi _1,\mathrm{},\xi _r)`$ and the soliton rapidities$`\underset{¯}{\theta }=(\theta _1,\mathrm{},\theta _s)`$

$`𝒪_{1\mathrm{}s}(\underset{¯}{\xi },\underset{¯}{\theta })`$ $`=`$ $`{\displaystyle \underset{1i<jr}{}}F_{bb}(\xi _{ij}){\displaystyle \underset{i=1}{\overset{r}{}}}{\displaystyle \underset{j=1}{\overset{s}{}}}F_{sb}(\xi _i\theta _j){\displaystyle \underset{1i<js}{}}F(\theta _{ij})`$
$`\times {\displaystyle \underset{l_1=0}{\overset{1}{}}}\mathrm{}{\displaystyle \underset{l_r=0}{\overset{1}{}}}(1)^{l_1+\mathrm{}+l_r}{\displaystyle \underset{1i<jr}{}}(1+(l_il_j){\displaystyle \frac{i\mathrm{sin}\pi \nu }{\mathrm{sinh}\xi _{ij}}})`$
$`\times {\displaystyle \underset{i=1}{\overset{r}{}}}{\displaystyle \underset{j=1}{\overset{s}{}}}\rho (\xi _i\theta _j,l){\displaystyle }dz_{r+1}\mathrm{}{\displaystyle }dz_m{\displaystyle \underset{i=1}{\overset{r}{}}}{\displaystyle \underset{j=r+1}{\overset{m}{}}}\chi (\xi _iz_j,l)`$
$`\times {\displaystyle \underset{i=1}{\overset{s}{}}}{\displaystyle \underset{j=r+1}{\overset{m}{}}}\varphi (\theta _iz_j){\displaystyle \underset{r<i<jm}{}}\tau (z_{ij})\stackrel{~}{p}(\underset{¯}{\xi },\underset{¯}{\theta },\underset{¯}{z^{(l)}},\underset{¯}{z})\mathrm{\Psi }_{1\mathrm{}s}(\underset{¯}{\theta },\underset{¯}{z})`$
again with $`z_i^{(l_i)}=\xi _i\frac{i\pi }{2}(1(1)^{l_i}\nu ),(i=1,\mathrm{},r)`$. The two-breather form factor has been introduced as

$`F_{bb}(\xi )`$ $`=`$ $`K_{bb}(\xi )\mathrm{sin}\frac{1}{2i}\xi f_{bb}^{(0)}(\xi )`$
$`f_{bb}^{(0)}(\theta )`$ $`=`$ $`\mathrm{exp}{\displaystyle _0^{\mathrm{}}}{\displaystyle \frac{dt}{t}}\mathrm{\hspace{0.17em}2}{\displaystyle \frac{\mathrm{cosh}(\frac{1}{2}\nu )t}{\mathrm{cosh}\frac{1}{2}t}}{\displaystyle \frac{1\mathrm{cosh}t(1\theta /(i\pi ))}{2\mathrm{sinh}t}}`$
$`K_{bb}(\theta )`$ $`=`$ $`{\displaystyle \frac{\mathrm{cos}\frac{1}{2}\pi \nu /E(\nu )}{\mathrm{sinh}\frac{1}{2}(\theta i\pi \nu )\mathrm{sinh}\frac{1}{2}(\theta +i\pi \nu )}}`$
The normalization has been chosen such that $`F_{bb}(\mathrm{})=1`$. It has been used that

$$\begin{array}{c}F_{sb}(\xi _1\theta _3)F_{sb}(\xi _1\theta _4)\rho (\xi _1\theta _3,l_1)\rho (\xi _1\theta _4,l_1)\chi (\xi _1z_2^{(l_2)},l_1)\hfill \\ \hfill =F_{bb}(\xi _{12})\left(1+(l_1l_2)\frac{i\mathrm{sin}\pi \nu }{\mathrm{sinh}\xi _{12}}\right)\end{array}$$

for $`\theta _{3/4}=\xi _2\pm \frac{i\pi }{2}(1\nu )`$. The new p-function is obtained from the old one by

$$\stackrel{~}{p}(\underset{¯}{\xi },\underset{¯}{\theta }^{\prime \prime },\underset{¯}{z^{(l)}},\underset{¯}{z}^{\prime \prime })=\left(\genfrac{}{}{0pt}{}{m}{r}\right)r!d^r(\nu )p(\xi _1+\frac{1}{2}\theta ^{(1)},\xi _1\frac{1}{2}\theta ^{(1)},\mathrm{},\underset{¯}{\theta }^{\prime \prime },z_1^{(l_1)},\mathrm{},\underset{¯}{z}^{\prime \prime }).$$

In particular for $`n=2r=2m`$ we get the pure lowest breather form factor

$$𝒪(\underset{¯}{\xi })=\underset{i<j}{}F_{bb}(\xi _{ij})\underset{l_1=0}{\overset{1}{}}\mathrm{}\underset{l_r=0}{\overset{1}{}}(1)^{l_1+\mathrm{}+l_r}\underset{1=i<j}{\overset{r}{}}\left(1+(l_il_j)\frac{i\mathrm{sin}\pi \nu }{\mathrm{sinh}\xi _{ij}}\right)\stackrel{~}{p}(\underset{¯}{\xi },\underset{¯}{z^{(l)}})$$
(16)
and the pure breather p-function

$$\stackrel{~}{p}(\underset{¯}{\xi },\underset{¯}{z^{(l)}})=r!d^r(\nu )p(\xi _1+\frac{1}{2}iu^{(1)},\xi _1\frac{1}{2}iu^{(1)},\mathrm{},z_1^{(l_1)},\mathrm{}).$$

## 6 The quantum sine-Gordon field equation

The classical sine-Gordon model is given by the wave equation

$$\mathrm{}\phi (t,x)+\frac{\alpha }{\beta }\mathrm{sin}\beta \phi (t,x)=0.$$

and two particle sine-Gordon S-matrix for the scattering of fundamental bosons (lowest breathers)

$$S(\theta )=\frac{\mathrm{sinh}\theta +i\mathrm{sin}\pi \nu }{\mathrm{sinh}\theta i\mathrm{sin}\pi \nu }$$

where $`\theta `$ is the rapidity difference defined by $`p_1p_2=m^2\mathrm{cosh}\theta `$ and $`\nu `$ is related to the coupling constant by $`\nu =\beta ^2/(8\pi \beta ^2).`$

From the S-matrix off-shell quantities as arbitrary matrix elements of local operators are obtained by means of the “form factor program” . In particular we provide exact expressions for all matrix elements of all powers of the fundamental bose field $`\phi (t,x)`$ and its exponential $`𝒩\mathrm{exp}i\gamma \phi (t,x)`$ for arbitrary $`\gamma `$. Here and in the following $`𝒩`$ denotes normal ordering with respect to the physical vacuum which means in particular for the vacuum expectation value $`\mathrm{\hspace{0.17em}0}|𝒩\mathrm{exp}i\gamma \phi (t,x)|\mathrm{\hspace{0.17em}0}=1`$. For the exceptional value $`\gamma =\beta `$ we find that the operator $`\mathrm{}^1𝒩\mathrm{sin}\beta \phi (t,x)`$ is local. Moreover the quantum sine-Gordon field equation333In the framework of constructive quantum field theory quantum field equations where considered in .

$$\mathrm{}\phi (t,x)+\frac{\alpha }{\beta }𝒩\mathrm{sin}\beta \phi (t,x)=0$$
(17)
is fulfilled for all matrix elements, if the “bare” mass $`\sqrt{\alpha }`$ is related to the renormalized mass by444Before such a formula was found in .

$$\alpha =m^2\frac{\pi \nu }{\mathrm{sin}\pi \nu }$$
(18)
where $`m`$ is the physical mass of the fundamental boson. The factor $`\frac{\pi \nu }{\mathrm{sin}\pi \nu }`$ modifies the classical equation and has to be considered as a quantum correction. For the sinh-Gordon model an analogous quantum field equation has been obtained in 555It should be obtained from (1) by the replacement $`\beta ig`$. However the relation between the bare and the renormalized mass in  differs from the analytic continuation of (18) by a factor which is $`1+O(\beta ^4)1`$.. Note that in particular at the ‘free fermion point’ $`\nu 1(\beta ^24\pi )`$ this factor diverges, a phenomenon which is to be expected by short distance investigations . For fixed bare mass square $`\alpha `$ and $`\nu 2,3,4,\mathrm{}`$ the physical mass goes to zero. These values of the coupling are known to be specific: 1. the Bethe Ansatz vacuum in the language of the massive Thirring model shows phase transitions  and 2. the model at these points is related  to Baxters RSOS-models which correspond to minimal conformal models with central charge $`c=16/(\nu (\nu +1))`$ (see also ).

Also we calculate all matrix elements of all higher local currents $`J_M^\mu (t,x)`$ ($`M=\pm 1,\pm 3,\mathrm{}`$) fulfilling $`_\mu J_M^\mu (t,x)=0`$ which is characteristic for integrable models. The higher charges fulfill the eigenvalue equation

$$\left(𝑑xJ_M^0(x)\underset{i=1}{\overset{n}{}}\left(p_i^+\right)^M\right)|p_1,\mathrm{},p_n^{in}=0.$$
(19)
In particular for $`M=\pm 1`$ the currents yield the energy momentum tensor $`T^{\mu \nu }=T^{\nu \mu }`$ with $`_\mu T^{\mu \nu }=0`$. We find that its trace fulfills

$$T_\mu ^\mu (t,x)=2\frac{\alpha }{\beta ^2}\left(1\frac{\beta ^2}{8\pi }\right)\left(𝒩\mathrm{cos}\beta \phi (t,x)1\right).$$
(20)
This formula is consistent with renormalization group arguments . In particular this means that $`\beta ^2/4\pi `$ is the anomalous dimension of $`\mathrm{cos}\beta \phi `$. Again this operator equation is modified by a quantum correction ($`1\beta ^2/8\pi `$). Obviously for fixed bare mass square $`\alpha `$ and $`\beta ^28\pi `$ the model will be conformal invariant which is related to a Berezinski-Kosterlitz-Thouless phase transition . The proofs of the statements (17) – (20) is sketched in the following together with some checks in perturbation theory. The complete proofs will be published elsewhere .

A form factor of n fundamental bosons (lowest breathers) is of the form

$$f_n^𝒪(\underset{¯}{\theta })=N_n^𝒪K_n^𝒪(\underset{¯}{\theta })\underset{1i<jn}{}F(\theta _{ij})$$

where $`N_n^𝒪`$ is a normalization constant, $`\theta _{ij}=\theta _i\theta _j`$ and $`F(\theta )`$ is the two particle form factor function. It fulfills Watson’s equations

$$F(\theta )=F(\theta )S(\theta )=F(2\pi i\theta )$$

with the S-matrix given above. Explicitly it is given by the integral representation

$$F(\theta )=N\mathrm{exp}_0^{\mathrm{}}\frac{dt}{t}\frac{\left(\mathrm{cosh}\frac{1}{2}t\mathrm{cosh}(\frac{1}{2}+\nu )t\right)\left(1\mathrm{cosh}t(1\frac{\theta }{i\pi })\right)}{\mathrm{cosh}\frac{1}{2}t\mathrm{sinh}t}$$

normalized such that $`F(\mathrm{})=1`$. The K-function $`K_n^𝒪(\underset{¯}{\theta })`$ is meromorphic, symmetric and periodic (under $`\theta _i\theta _i+2\pi i`$).

From (16) we have

$$K_n^𝒪(\underset{¯}{\theta })=\underset{l_1=0}{\overset{1}{}}\mathrm{}\underset{l_n=0}{\overset{1}{}}(1)^{l_1+\mathrm{}+l_n}\underset{1i<jn}{}\left(1+(l_il_j)\frac{i\mathrm{sin}\pi \nu }{\mathrm{sinh}\theta _{ij}}\right)p_n^𝒪(\underset{¯}{\theta },\underset{¯}{z})$$
(21)
where $`z_i=\theta _i\frac{i\pi }{2}\left(1+(2l_i1)\nu \right)`$. The dependence on the operator is encoded in the ’p-function’ $`p_n^𝒪`$. It is separately symmetric with respect to the variables $`\underset{¯}{\theta }`$ and $`\underset{¯}{z}`$ and has to fulfill some simple conditions in order that the form factor function $`f_n^𝒪`$ fulfill some properties . These properties follow (see ) from general LSZ-assumptions and in additions specific features typical for integrable field theories. In particular the recursion relation holds

$$\underset{\theta _{12}=i\pi }{\mathrm{R}es}f_n^𝒪(\theta _1,\mathrm{},\theta _n)=2if_{n2}^𝒪(\theta _3,\mathrm{},\theta _n)\left(\mathrm{𝟏}S(\theta _{2n})\mathrm{}S(\theta _{23})\right).$$
(22)
Here we will not provide more details but only give some examples of operators and their corresponding p-functions:

1. The correspondence of exponentials of the field and their p-function666For the sinh-Gordon model an analogous representation as (21) together with this p-function was obtained in  by different methods. is

$$𝒩e^{i\gamma \phi }\underset{i=1}{\overset{n}{}}e^{(2l_i1)i\pi \nu \gamma /\beta }$$
(23)
for an arbitrary constant $`\gamma `$.
2. Taking derivatives of this formula with respect to $`\gamma `$ we get for the field and its powers

$$𝒩\phi ^N\left(\underset{i=1}{\overset{r}{}}(2l_i1)\right)^N.$$
(24)
3. Higher currents (for $`M=\pm 1,\pm 3,\mathrm{}`$) correspond to the p-functions

$$J_M^\pm \underset{i=1}{\overset{n}{}}e^{\pm \theta _i}\underset{i=1}{\overset{n}{}}e^{Mz_i}$$

for $`n=`$ even and zero for $`n=`$ odd. For $`M=\pm 1`$ we get the light cone components of the energy momentum tensor $`T^{\rho \sigma }=J_\sigma ^\rho `$ with $`\rho ,\sigma =\pm `$ (see also ).

In order to prove equations as for example (17) and (20) we consider the corresponding p-functions and their K-functions defined by (21). The K-functions are rational functions of the $`x_i=e^{\theta _i}`$. We analyze the poles and the asymptotic behavior and find identities by using induction and Liouville’s theorem. Transforming these identities to the corresponding form factors one finds the field equation (17) and the trace equation (20) up to normalizations.

Normalization constants are obtained in the various cases by the following observations:

1. The normalization a field annihilating a one-particle state is given by the vacuum one-particle matrix element, in particular for the fundamental bose field one has

$$\mathrm{\hspace{0.17em}0}|\phi (0)|p=\sqrt{Z^\phi }$$

with the finite wave function renormalization constant calculated in  as

$$Z^\phi =(1+\nu )\frac{\frac{\pi }{2}\nu }{\mathrm{sin}\frac{\pi }{2}\nu }\mathrm{exp}\left(\frac{1}{\pi }_0^{\pi \nu }\frac{t}{\mathrm{sin}t}𝑑t\right)$$

where $`Z^\phi =1+O(\beta ^4)`$. This gives the normalization constant

$$N_1^{(1)}=\sqrt{Z^\phi }/2$$
(25)
for the form factors of the fundamental bose field and which are obtained from the p-function of (24) for $`N=1`$.
2. If a local operator is connected to an observable like a charge $`Q=𝑑x𝒪(x)`$ we use the relation

$$p^{}|Q|p=qp^{}|p.$$

For example for the higher charges we obtain

$$N_2^{J_M}=\frac{i^Mm^{M+1}}{2\mathrm{sin}\pi \nu \mathrm{sin}\frac{M}{2}\pi \nu F(i\pi )}\mathrm{with}\frac{1}{F(i\pi )}=Z^\phi \frac{\beta ^2}{8\pi \nu }\frac{\mathrm{sin}\pi \nu }{\pi \nu }.$$
3. We use Weinberg’s power counting theorem for bosonic Feynman graphs 777This type of arguments has been also used in .. For the exponentials of the boson field $`𝒪=𝒩e^{i\gamma \phi }`$ this yields in particular the asymptotic behavior

$$f_n^𝒪(\theta _{1,}\theta _{2,}\mathrm{})=f_1^𝒪(\theta _1)f_{n1}^𝒪(\theta _{2,}\mathrm{})+O(e^{\mathrm{R}e\theta _1})$$

as $`\mathrm{R}e\theta _1\mathrm{}`$ in any order of perturbation theory. This behavior is also assumed to hold for the exact form factors. Applying this formula iteratively we obtain from (21) with (23) the following relation for the normalization constants of the operators $`𝒩e^{i\gamma \phi }`$

$$N_n^\gamma =\left(N_1^\gamma \right)^n(n1).$$
4. The recursion relation (22) relates $`N_{n+2}`$ and $`N_n.`$ For all p-functions mentioned above we obtain

$$N_{n+2}=N_n\frac{2}{\mathrm{sin}\pi \nu F(i\pi )}(n1).$$

Using c) and d) we calculate the normalization constants for the exponential of the field $`𝒩e^{i\gamma \phi }`$ and obtain

$$N_1^\gamma =\sqrt{Z^\phi }\frac{\beta }{2\pi \nu }.$$
(26)
The normalization constants (25) and (26) now yield the field equation (17) with the mass relation (18). The statement (20) is proved similarly. The eigen value equation (19) is obtained by taking the scalar products with arbitrary out-states and by using a general crossing formula .

All the results may be checked in perturbation theory by Feynman graph expansions. In particular in lowest order the relation between the bare and the renormalized mass (18) is given by Figure 1 (a). It had already been calculated in  and yields

$$m^2=\alpha \left(1\frac{1}{6}\left(\frac{\beta ^2}{8}\right)^2+O(\beta ^6)\right)$$

which agrees with the exact formula above. Similarly we check the quantum corrections of the trace of the energy momentum tensor (20) by calculating the Feynman graph of Figure 1 (b) with the result again taken from  as

$$p|𝒩\mathrm{cos}\beta \phi 1|p=\beta ^2\left(1+\frac{\beta ^2}{8\pi }\right)+O(\beta ^6).$$

This again agrees with the exact formula above since the normalization given by eq. (19) implies $`p|T_\mu ^\mu |p=2m^2`$. All other equations have also been checked in perturbation theory .

#### Acknowledgements:

We thank A.A. Belavin, J. Balog, R. Flume, A. Fring, R.H. Poghossian, F.A. Smirnov, R. Schrader, B. Schroer and Al.B. Zamolodchikov for discussions. One of authors (M.K.) thanks E. Seiler and P. Weisz for discussions and hospitality at the Max-Planck Insitut für Physik (München), where parts of this work have been performed. H.B. was supported by DFG, Sonderforschungsbereich 288 ‘Differentialgeometrie und Quantenphysik’ and partially by grants INTAS 99-01459 and ISTC A102.