Here we describe the domain moduli spaces needed for the construction of the composition operations described in Polyfold Constructions for Fukaya Categories#Composition Operations; we refer to these as Deligne-Mumford spaces. In some constructions of the Fukaya category, e.g. in Seidel's book, the relevant Deligne-Mumford spaces are moduli spaces of trees of disks with boundary marked points (with one point distinguished). We tailor these spaces to our needs:
- In order to ultimately produce a version of the Fukaya category whose morphism chain complexes are finitely-generated, we extend this moduli spaces by labeling certain nodes in our nodal disks by numbers in . This anticipates our construction of the spaces of maps, where, after a boundary node forms with the property that the two relevant Lagrangians are equal, the node is allowed to expand into a Morse trajectory on the Lagrangian.
- Moreover, we allow there to be unordered interior marked points in addition to the ordered boundary marked points.
These interior marked points are necessary for the stabilization map, described below, which serves as a bridge between the spaces of disk trees and the Deligne-Mumford spaces. We largely follow Chapters 5-8 of [LW []], with two notable departures:
- In the Deligne-Mumford spaces constructed in [LW], interior marked points are not allowed to collide, which is geometrically reasonable because Li-Wehrheim work with aspherical symplectic manifolds. Therefore Li-Wehrheim's Deligne-Mumford spaces are noncompact and are manifolds with corners. In this project we are dropping the "aspherical" hypothesis, so we must allow the interior marked points in our Deligne-Mumford spaces to collide -- yielding compact orbifolds.
- Li-Wehrheim work with a single Lagrangian, hence all interior edges are labeled by a number in . We are constructing the entire Fukaya category, so we need to keep track of which interior edges correspond to boundary nodes and which correspond to Floer breaking.
Some notation and examples
For , with and for a decomposition , we will denote by the Deligne-Mumford space of nodal disks with boundary marked points and unordered interior marked points and with numbers in labeling certain nodes. (This anticipates the space of nodal disk maps where, for , and are the same Lagrangian if and only if .) It will also be useful to consider the analogous spaces where the interior marked points are ordered. As we will see, is a manifold with boundary and corners, while is an orbifold; moreover, we have surjections
which are defined by forgetting the ordering of the interior marked points (there is an -action on the domain, and this map takes orbits).
Before precisely constructing and analyzing these spaces, let's sneak a peek at some examples.
Here is .
Here is , with the associahedron appearing as the smaller pentagon. Note that the hollow boundary marked point is the "distinguished" one.
And here are (lower-left) and . and have order-2 orbifold points, drawn in red and corresponding to configurations where the two interior marked points have bubbled off onto a sphere. The red bits in are there only to show the points with nontrivial isotropy with respect to the -action which interchanges the labels of the interior marked points.
Our Deligne-Mumford spaces model trees of disks with boundary and interior marked points, where in addition there may be trees of spheres with marked points attached to interior points of the disks. We must therefore work with ordered resp. unordered trees, to accommodate the trees of disks resp. spheres.
An ordered tree is a tree satisfying these conditions:
- there is a designated root vertex , which has valence ; we orient toward the root.
- is ordered in the sense that for every , the incoming edge set is equipped with an order.
- The vertex set is partitioned into main vertices and critical vertices, such that the root is a critical vertex.
An unordered tree is defined similarly, but without the order on incoming edges at every vertex; a labeled unordered tree is an unordered tree with the additional datum of a labeling of the non-root critical vertices. For instance, here is an example of an ordered tree , with order corresponding to left-to-right order on the page:
INSERT EXAMPLE HERE
We now define, for , the space resp. of nodal trees of spheres with incoming unordered resp. ordered marked points. (These spaces can be given the structure of compact manifolds resp. orbifolds without boundary -- for instance, , , and is diffeomorphic to the blowup of at 3 points on the diagonal.)
where (1), (2), (3) are as follows:
- is an unordered tree, with critical vertices consisting of leaves and the root.
- For every main vertex and each edge , is a marked point in satisfying the requirement that for fixed, the points are distinct. We denote this (unordered) set of marked points by .
- The tree satisfies the stability condition, i.e. for every , we have .
The equivalence relation is defined by declaring that , are equivalent if there exists an isomorphism of labeled trees and a collection of holomorphism automorphisms of the sphere such that for every .
The spaces are defined similarly, but where the underlying combinatorial object is an unordered labeled tree.
Next, we define, for and a decomposition , the space of nodal trees of disks and spheres with ordered incoming boundary marked points and unordered interior marked points. Before we define this space, we note that if is an ordered tree with consisting of leaves and the root, we can associate to every edge in a pair called the node labels at :
- Choose an embedding of into a disk in a way that respects the orders on incoming edges and which sends the critical vertices to .
- This embedding divides into regions, where the 0-th region borders the root and the first leaf, for the -th region borders the -th and -th leaf, and the -th region borders the -th leaf and the root. Label these regions accordingly by .
- Associate to every edge in the labels of the two regions which it borders.
With all this setup in hand, we can finally define :
where (1)--(6) are defined as follows:
- is an ordered tree with critical vertices consisting of leaves and the root.
- is a tuple of edge lengths with , where the Morse edges are those satisfying for some . Moreover, for a Morse edge incident to a critical vertex, we require .
- For every main vertex and each edge , is a marked point in such that, for any , the sequence is in (strict) counterclockwise order. Similarly, is a collection of unordered interior marked points -- i.e. for , is an unordered subset of .
- is a collection of sphere trees such that the equation holds.
- is a distinguished tuple of interior marked points, which corresponds to the places where the sphere trees are attached to the disk tree.
- The disk tree satisfies the stability condition, i.e. for every with , we have .
The definition of the equivalence relation is defined similarly to the one in . is defined similarly.
Gluing and the definition of the topology
We will define the topology on (and its variants) like so:
- Fix a representative of an element .
- Associate to each interior nodes a gluing parameter in ; associate to each Morse-type boundary node a gluing parameter in ; and associate to each Floer-type boundary node a gluing parameter in . Now define a subset by gluing using the parameters, varying the marked points by less than in -norm (for the boundary marked points) resp. Hausdorff distance (for the interior marked points), and varying the lengths by less than .
- We define the collection of all such sets to be a basis for the topology.
To make the second bullet precise, we will need to define a gluing map
The image of this map is defined to be .
Before we can construct , we need to make some choices:
- Fix a gluing profile, i.e. a continuous decreasing function with , . (For instance, we could use the exponential gluing profile .)
- For each main vertex and edge , we must choose a family of strip coordinates near (this notion is defined below).
- For each main vertex and point in , we must choose a family of cylinder coordinates near that point. (We do not make precise this notion, but its definition should be evident from the definition of strip coordinates.) We must also choose cylinder coordinates within the sphere trees which are attached to the disk tree.
Here we define the notion of (positive resp. negative) strip coordinates.
- are defined by
- is a Moebius transformation which maps the extended upper half plane to the and sends .
(Note that there is only a 2-dimensional space of choices of strip coordinates, which are in bijection with the complex automorphisms of the extended upper half plane fixing .)Now that we've defined strip coordinates, we say that for and varying in , a family of positive resp. negative strip coordinates near is a collection of functions
With these preparatory choices made, we can define the sets appearing in the definition of .
- is a product of intervals , one for every Floer-type nodal edge in ("Floer-type" meaning an edge whose adjacent regions are labeled by a pair not contained in a single , "nodal" meaning that the edge connects two main vertices).
- is a product of intervals , one for every Morse-type nodal edge in ("Morse-type meaning an edge whose adjacent regions are labeled by a pair contained in a single , "nodal" meaning ).
is a product of disks , one for every point in to which a sphere tree is attached.
- is a product of disks , one for every interior edge in the unordered tree underlying the sphere tree .
- is the -neighborhood of , i.e. the set of satisfying these conditions:
- For every Morse-type edge , lies in . Moreover, for every Morse-type nodal edge resp. edge adjacent to a critical vertex, we fix resp. .
- For every main vertex , the marked points must be within of (under -norm for the boundary marked points and Hausdorff distance for the interior marked points).
- Similar restrictions apply to .
- must be within of in Hausdorff distance.
We can now construct the gluing map . We will not include all the details.
- The glued tree is defined by collapsing the gluing edges , where the nodal edges are the Floer-type nodal edges and Morse-type nodal edges (see above). For any vertex , we denote by the vertices in which are identified to form . These vertices form a subtree of ; denote the edges in this subtree by .
- To define the objects , we will "glue" certain disks and spheres together, using the choices of strip coordinates and cylinder coordinates made above. The crucial constructions will be, for each main vertex , a glued disk formed by gluing together the disks corresponding to the vertices in . We now make a few definitions towards the construction of :
- For , define the gluing length .
- Denote by the left translation of by ,
- We define our glued surface by using strip coordinates to identify neighborhoods of each pair of gluing edges in with (in the component closer to the root) resp. (in the component further from the root), and then replacing these two ends by the quotient space
The resulting Riemann surface is biholomorphic to a disk, and all the information (boundary marked points, interior marked points, etc.) persists in the glued disk.
- We perform a similar gluing construction at each of the interior nodes, using the families of cylinder coordinates we chose earlier.
The atlas of Deligne-Mumford space
We define charts for like so:
- Fix an element and a representative of .
- Choose a local slice near :
- for every disk component with boundary marked points, fix the first three boundary marked points;
- for every disk component with boundary marked points, fix the distinguished boundary marked points and the first interior marked point;
- for every sphere component, fix the first three marked points.
- The restriction to this local slice of the gluing map defined above is our chart.
For , the moduli space of domains
can be compactified to form the Deligne-Mumford space , whose boundary and corner strata can be represented by trees of polygonal domains with each edge represented by two punctures and . The thin neighbourhoods of these punctures are biholomorphic to half-strips, and then a neighbourhood of a tree of polygonal domains is obtained by gluing the domains together at the pairs of strip-like ends represented by the edges.