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 the set of all points of all lines. It has measure zero. Let be a point of . We consider two convex neighborhoods of such that is relatively compact in .
For any two points belonging to , and a path joining and in , we would like to define an infinite ordered product of transformations , where factors correspond to the intersection points of with all possible pieces relative to . Factors in the infinite product are ordered according to the time parameter of , the sign corresponds to the mutual position of orientations of and a piece at the intersection point.
In order to give a precise meaning to the infinite product the neighborhood of should be sufficiently small. Then we will have an analytic continuation of symplectomorphisms to , and the convergence of the infinite product. We are also going to prove that the product is independent of the choice of path . In order to achieve these goals it suffices to assume:
- C1
-
for any such the set is contained in ;
- C2
-
for any there is only a finite number of pieces of lines in such that .
Theorem 7
Assume two above conditions. Then the product defining converges at every point of and in fact gives an element of . Moreover, the product does not depend on the choice of path , and for any satisfies the relation .
Proof. Condition C1 implies that all transformations admit an analytic continuation to . Let us introduce a decreasing filtration by positive real numbers on group by the formula
This is a complete filtration, and condition C2 implies that in any quotient only a finite number of elements are non-trivial. Therefore we can define the product in the quotient group.
In order to prove independence of , we consider the quotient group , and the finite -dimensional CW-complex (graph) consisting of finitely many pieces , such that in the quotient. For each vertex of the graph there is a natural cyclic order on the edges incident to . The product taken in the cyclic order over the set of edges incident to is equal to (this follows from the construction of via factorizations). Since is simply-connected, we conclude that the image of in does not depend on . Using completeness of the filtration we see that does not depend on . Proof of the identity is similar.
Theorem 8
Assumptions A1 and A2 imply that for any there exist neighborhood (and also ) satisfying conditions C1 and C2.
Proof. Assumption A1 implies that the result near any singular point , as there are only two lines near . If we are far from then obviously A2 implies C1.
In order to check C2 we prove the following lemma
Lemma 5
Under Assumptions A1 and A2, for any the set
consists of a finite number of intervals.
Proof: We proceed by induction in “complexity of the line”. Let be the infimum of where has a collision at time . 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 at the beginning of any composite line is greater or equal to the sum . Therefore the inequality in the lemma implies that the number of collisions is bounded from above by . Also we have an upper bound on integer coefficients in each collision (see Axiom in Section 9.2). Let us observe that the length of each edge of the ansector tree of is also bounded from above by , for some absolute constant . Hence we have only finitely many possibilities for intersections.
For point which is far from we chose as a neighborhood of radius where is constant from Assumption A2. Then for any point of a line we will have the inclusion
This implies that in for the corresponding piece is bounded below by
Since (by the last lemma) there exists only a finite number of pieces intersecting such , we obtain convergence condition C2.