ScalingStacks

11.3 Infinite product and its convergence [03WR]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

11.3 Infinite product and its convergence

Denote by Wℒ:=∪l∈ℒfl([0,+∞))W_{\cal L}:=\cup_{l\in{\cal L}}f_{l}([0,+\infty)) the set of all points of all lines. It has measure zero. Let pp be a point of YY. We consider two convex neighborhoods U⊂U′U\subset U^{\prime} of pp such that UU is relatively compact in U′U^{\prime}.

For any two points x,yx,y belonging to U∖WℒU\setminus W_{\cal L}, and a path γ\gamma joining xx and yy in UU, we would like to define an infinite ordered product ix,yγi_{x,y}^{\gamma} of transformations φL±1\varphi_{L}^{\pm 1}, where factors correspond to the intersection points of γ\gamma with all possible pieces LL relative to (U,U′)(U,U^{\prime}). Factors in the infinite product are ordered according to the time parameter of γ\gamma, the sign corresponds to the mutual position of orientations of γ\gamma and a piece LL at the intersection point.

In order to give a precise meaning to the infinite product the neighborhood UU of pp should be sufficiently small. Then we will have an analytic continuation of symplectomorphisms φL\varphi_{L} to UU, and the convergence of the infinite product. We are also going to prove that the product is independent of the choice of path γ\gamma. In order to achieve these goals it suffices to assume:

C1

for any l,tl,t such fl​(t)∈Uf_{l}(t)\in U the set (expfl​(t))−1​(U)(\exp_{f_{l}(t)})^{-1}(U) is contained in Pl,tP_{l,t}\,;

C2

for any C∈𝐑C\in{\bf R} there is only a finite number of pieces LL of lines in UU such that infx∈Uo​r​dL​(x)<C\inf_{x\in U}ord_{L}(x)<C.

Theorem 7

Assume two above conditions. Then the product defining ix,yγi_{x,y}^{\gamma} converges at every point of UU and in fact gives an element of S​y​m​p​(U)Symp(U). Moreover, the product does not depend on the choice of path γ\gamma, and for any x,y,z∈U∖Wℒx,y,z\in U\setminus W_{\cal L} satisfies the relation ix,y​iy,z=ix,zi_{x,y}i_{y,z}=i_{x,z}.

Proof. Condition C1 implies that all transformations φL\varphi_{L} admit an analytic continuation to UU. Let us introduce a decreasing filtration by positive real numbers S​y​m​p≥r​(U),r∈𝐑,r≥0Symp^{\geq r}(U),\,\,r\in{\bf R},r\geq 0 on group S​y​m​p​(U)Symp(U) by the formula

{g∈Symp(U)|log|ξ′/ξ−1|,log|η′/η−1|<−r where (ξ′,η′)=g((ξ,η))}\left\{g\in Symp(U)\,|\,\,\log|\xi^{\prime}/\xi-1|,\log|\eta^{\prime}/\eta-1|<-r\,\mbox{ where }(\xi^{\prime},\eta^{\prime})=g((\xi,\eta))\,\right\}

This is a complete filtration, and condition C2 implies that in any quotient S​y​m​p​(U)/S​y​m​p≥r​(U)Symp(U)/Symp^{\geq r}(U) only a finite number of elements φL\varphi_{L} are non-trivial. Therefore we can define the product in the quotient group.

In order to prove independence of γ\gamma, we consider the quotient group S​y​m​p​(U)/S​y​m​p≥r​(U)Symp(U)/Symp^{\geq r}(U), and the finite 11-dimensional CW-complex (graph) consisting of finitely many pieces LL, such that φL≠1\varphi_{L}\neq 1 in the quotient. For each vertex vv of the graph there is a natural cyclic order on the edges incident to vv. The product φv=∏LφL±1\varphi_{v}=\prod_{L}\varphi_{L}^{\pm 1} taken in the cyclic order over the set of edges incident to vv is equal to i​did (this follows from the construction of φl\varphi_{l} via factorizations). Since UU is simply-connected, we conclude that the image of ix,yγi_{x,y}^{\gamma} in S​y​m​p​(U)/S​y​m​p≥r​(U)Symp(U)/Symp^{\geq r}(U) does not depend on γ\gamma. Using completeness of the filtration we see that ix,y:=ix,yγi_{x,y}:=i_{x,y}^{\gamma} does not depend on γ\gamma. Proof of the identity ix,y​iy,z=ix,zi_{x,y}i_{y,z}=i_{x,z} is similar. ■\blacksquare

Theorem 8

Assumptions A1 and A2 imply that for any p∈Yp\in Y there exist neighborhood UU (and also U′U^{\prime}) satisfying conditions C1 and C2.

Proof. Assumption A1 implies that the result near any singular point s∈Bs​i​n​gs\in B^{sing}\,, as there are only two lines near ss. If we are far from Bs​i​n​gB^{sing} then obviously A2 implies C1.

In order to check C2 we prove the following lemma

Lemma 5

Under Assumptions A1 and A2, for any C>0C>0 the set

{(l,t)|o​r​dl​(t)​(fl​(t))<C}⊂ℒ×(0,+∞)\{(l,t)|\,\,ord_{l}(t)(f_{l}(t))<C\,\}\subset{\cal L}\times(0,+\infty)

consists of a finite number of intervals.

Proof: We proceed by induction in “complexity of the line”. Let δ∈𝐑>0\delta\in{\bf R}_{>0} be the infimum of o​r​dl​(t)​(fl​(t))ord_{l}(t)(f_{l}(t)) where l∈ℒi​nl\in{\cal L}_{in} has a collision at time tt. This number is strictly positive because the number of initial lines is finite, and by A1 there is no collisions at small times. Observe that the value of o​r​dl​(0)ord_{l}(0) at the beginning of any composite line ll is greater or equal to the sum o​r​dl1​(t1)+o​r​dl2​(t2)ord_{l_{1}}(t_{1})+ord_{l_{2}}(t_{2}). Therefore the inequality in the lemma implies that the number of collisions is bounded from above by C/δC/\delta. Also we have an upper bound on integer coefficients (n1,n2)(n_{1},n_{2}) in each collision (see Axiom OPEN𝟑​𝐛)\bf 3b) in Section 9.2). Let us observe that the length of each edge of the ansector tree of ll is also bounded from above by A​o​r​dlA\,ord_{l}, for some absolute constant A>0A>0. Hence we have only finitely many possibilities for intersections. ■\blacksquare

For point p∈Yp\in Y which is far from Bs​i​n​gB^{sing} we chose as UU a neighborhood of radius ϵ′≪ϵ\epsilon^{\prime}\ll\epsilon where ϵ>0\epsilon>0 is constant from Assumption A2. Then for any point of a line fl​(t)∈Uf_{l}(t)\in U we will have the inclusion

U⊂expfl​(t)⁡(12​Pl,t).U\subset\exp_{f_{l}(t)}\left(\frac{1}{2}P_{l,t}\right)\,\,.

This implies that o​r​dLord_{L} in UU for the corresponding piece LL is bounded below by

12​o​r​dl​(t)​(fl​(t)).\frac{1}{2}ord_{l}(t)(f_{l}(t))\,\,.

Since (by the last lemma) there exists only a finite number of pieces LL intersecting such UU, we obtain convergence condition C2. ■\blacksquare

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.