On the generic existence of WKB spectral networks/Stokes graphs
Abstract
We prove the generic existence of spectral networks for a large class of spectral data.
1 Introduction
Let be a compact Riemann surface and be a meromorphic quadratic differential on . For , the equation gives a codimension 1 foliation on . The set of leaves passing through the zero set of is called, the Stokes graph of in the literature of exact WKB analysis. It is a fundamental observation of Voros [Vor83], and later proved by Koike–Schäfke [KS] (see also [Tak17, Nik23]) that, for a large class of , we can analytically lift the all order formal WKB solutions of a deformation quantization of the spectral curve of on the complement of the Stokes graph for generic . By assigning connection matrices on each curve on the graph, we can completely package the solution to the connection problem of the exact WKB solutions.
Independently, the same structure was discovered by Gaiotto–Moore–Neitzke [GMN13b] in the study of a certain class of quantum field theories called class theories. In their frame work, the space of meromorphic quadratic differentials of a given pole type is interpreted as the Coulomb branch of the theory. Fix and a point of the Coulomb branch determines a “phase” of the theory, and each curve passing through in the Stokes graph is a BPS-state of the theory in the presence of a defect on . The reason why the Stokes graph is important in physics is now evident: Knowing the contents of the BPS-spectrum is a first step to understand the theory. Similar to the case of exact WKB analysis, one can assign BPS multiplicities on the curves of the diagram. In their terminology, Stokes graph is called (WKB) spectral network.
Remark 1.1.
In the body of the paper, we use the term Stokes graph rather than WKB spectral network.
To generalize exact WKB analysis to “higher order differentials” is a long desired story, but there are several obstacles to establish such a theory. The first obstacle is that we do not know how to define Stokes graphs for the higher order case. It is known that a naive generalization does not work, as observed by Berk–Nevins–Roberts [BNR82]. The next obstacle is the resummation problem, but it is even more harder: We cannot even formulate a conjecture without knowing the Stokes graph.
One of the subjects of this paper is to provide a generic existence theorem of Stokes graph/spectral network for a large class of pole data.
Our approach is based on Gaiotto–Moore–Neitzke’s work [GMN13a]. In their work, they proposed an inductive construction of spectral networks using mass filtration and claimed that their construction generically work. Although their ideas seem to be roughly correct, we believe that to transform it to a mathematically rigorous statement, several works have to be done. Our work here is to provide mathematically rigorous setup/notions/proofs to make their construction actually work.
Now we would like to state our results more precisely. Let be a finite subset of and be a fixed positive number. We take a point of the meromorphic Hitchin base where is the sheaf of meromorphic sections of the canonical sheaf with poles in . In this work, we assume is strongly GMN (Definition 3.15) which is a higher-order generalization of (a little bit stronger version of) GMN condition appeared in the work of Bridgeland–Smith [BS15].
For a point , one can associate a complex 1-dimensional submanifold called the spectral curve of in the cotangent bundle . The restriction of the projection to gives a branched -fold covering map. We define the set of turning points to be the branching values of the covering map, which generalizes the 2nd order case.
Around a point in outside the branching values, take a pair of sheets of . Then the difference between the restriction of the holomorphic Liouville form to the sheets gives a holomorphic 1-form on . Then the reality condition of the 1-form times gives a local foliation of . A leaf of the foliation is called a -preStokes curve.
Roughly speaking, a -Stokes graph is a set of -preStokes curves first emanating from the set of turning points, and then evolving again and again from the collisions of the curves. We say a -Stokes graph is unobstructed if it does not contain any 4d BPS states (Definition 5.3), which is a tree whose edges are -preStokes curves and the vertices are turning points.
Theorem 1.2.
Suppose is strongly GMN. There exists a dense set of such that unobstructed -Stokes graph exists for any in the subset.
We can strengthen this theorem to a statement with compatible wall-crossing data as follows: Wall-crossing data is a set of pairs of a preStokes curve and wall-crossing matrix (or connection matrix in the context of exact WKB analysis). Associated to it, we have wall-crossing matrix. The compatibility means the vanishing of undesired monodromies.
As Gaiotto–Moore–Neitzke observed, Stokes graphs/spectral networks are filtered by BPS mass. An initial wall-crossing data is a wall-crossing data defined at the level of . Here is our another main theorem.
Theorem 1.3.
Suppose is strongly GMN. Let be an open subset of . Give an initial wall-crossing data. Then there exists a dense subset of such that a Stokes graph with compatible wall-crossing data exists for any .
Our proof is based on Gaiotto–Moore–Neitzke’s argument, which is very close to the construction of scattering diagrams [KS06, GS11]: We first start with the preStokes curves emanating from the branching values of . Then, we possibly have anomalous monodromy around the collisions. Then we add new Stokes curves with wall-crossing factors to cancel the anomalous monodromies. Then the new Stokes curves can have collisions and produce anomalous monodromies again. Then we repeat the procedures.
This prescription is very convincing, but there are potential problems: (1) Possibly there are situations where we cannot cancel anomalous monodromies, (2) the set of collisions/preStokes curves in the network is possibly non-discrete/dense for which we cannot define local monodromies.
We can observe that (1) only happens when there are 4d BPS states which does not happen for generic . For (2), Gaiotto–Moore–Neitzke used the mass filtration to draw diagrams.
To make this procedure mathematically rigorous, our key machineries/observations/proofs are the following:
-
1.
Associated quadratic differential: To control the behavior of preStokes curves, we associate a quadratic differential on a covering of . Then we can use the classical theory of quadratic differentials [Str84] to control preStokes curves.
-
2.
Novikov ring: To describe local monodromies in a way compatible with the mass filtration, it is better to consider them as defined over the Novikov ring. This is parallel to the use of the formal power series ring in the theory of scattering diagram.
-
3.
Stoke trees: To perturb to collapse 4d BPS states, we have to treat a family of Stokes graphs/spectral networks, which is not well-behaved. We instead treat it as a union of Stokes trees. This interpretation is motivated by [GMN13a] and a folklore conjectural interpretation of spectral networks in terms of holomorphic disks bounded by the spectral curve. For the 2nd order case, see Nho [Nho24] for a related result. The expected interpretation in the present setup will be shown in [IKO].
-
4.
Gromov compactness: In our construction, we take mass cut-off. Step by step, we can take our mass cut-off greater than the previous cut-off. We have to prove the cut-off eventually goes to . One can prove this by careful estimates of mass.
With these machineries, we can prove the existence of spectral networks.
Remark 1.4.
A part of the argument of the proof of this theorem has already appeared in the author’s previous work [Kuw20, v3]. However a result provided in the paper is proved under very strong assumptions, which has been never checked for a large class of examples. In the referee process of the paper, the anonymous referee suggested the author to remove the section from the paper. The result of a large enhancement of the section is this paper.
Remark 1.5.
From the side of exact WKB analysis, the theory of virtual turning points has been developed [HKT15]. Based on this theory, Honda [Hon08] proposed an approach to a general construction of Stokes graph under certain conditions. Although some of the ideas here are parallel to his work, the statement of his theorem is very different from ours, in particular, it does not prove any generic existence. See the original article for more information.
Now we give several applications of our result.
The first one is an exact formulation of exact WKB conjecture, which will be provided in Section 8.
The second one is the Gromov compactness theorem for 4d BPS states. In this paper, a 4d BPS-state is a Stokes tree ended in turning points.
Theorem 1.6.
For any , any strongly GMN Lagrangian , and any , the number of the BPS states with mass less than is finite.
The proof is a minor modification of the proof of the main theorem of this paper. Conjecturally, this statement is a Morse-theoretic counterpart of the Gromov compactness theorem of holomorphic disks bounded by the spectral curve.
The third application is a construction of sheaf quantization of the spectral curve as conducted in [Kuw20] in the 2nd order case. Again, let be a strongly GMN Lagrangian. We specify a brane structure of . For , we set , which also carries an induced brane structure.
If is unobstructed, it defines an object of (non-curved) Fukaya category of . By the Solomon–Verbitsky theorem [SV19], the set of unobstructed ’s are dense in .
On the other hand, there is a conjectural sheaf-theoretic model of nonexact Fukaya category of , called the category of sheaf quantizations [Tam18, Kuw20, IK, KPS24]. The following theorem is a sheaf-theoretic counterpart of a version of the Solomon–Verbitsky theorem.
Theorem 1.7.
There exists a dense set of such that there exists a sheaf quantization of for any .
The proof goes as follows: A brane structure gives an initial spectral network. Then the main theorem gives a spectral network. Now, as in [Kuw20], one can glue up a sheaf quantization by using wall-crossing factors. From sheaf quantizations, one can also construct a local system over the base, which is nonabelianization in the sense of [GMN13a] in our setup.
Acknowledgment
I would like to thank Akishi Ikeda, Hiroshi Iritani, Tsukasa Ishibashi, Kohei Iwaki, and Hiroshi Ohta for discussions on several topics related to the subject of this paper. I also would like to thank the members of GHKK reading seminar (Tsukasa Ishibashi, Shunsuke Kano, Yuma Mizuno, Hironori Oya) where I learned the notion of scattering diagram. This work is supported by JSPS KAKENHI Grant Numbers JP22K13912 and JP20H01794.
2 Setup
In this section, we introduce our main objects. There are two ways to describe it by using differentials and by using Lagrangians. These two descriptions are equivalent and both useful. In the following section, we will use these two descriptions interchangeably.
2.1 Differential language
Let be a compact Riemann surface and be a nonempty finite subset on . Let be the sheaf of meromorphic differentials with possible poles in .
Definition 2.1.
Fix a positive integer . A (-)spectral data is an element
(2.1) |
Let be a spectral data. Let be a local coordinate of . Then can be locally written as
(2.2) |
Consider the symbol . We set
(2.3) |
where is identified with the cotangent of . This is independent of the choice of the local coordinate. The resulting 1-dimensional complex subvariety of is called the spectral curve of .
We denote the defining projection by .
Definition 2.2.
We say a branching point of is simple if the branching order is minimal.
Note also that the set of the branching values is finite by the compactness of .
2.2 Symplectic language
Let be a local coordinate of and be the associated cotangent coordinate. Then the 1-form on does not depend on the choice of the local coordinate. The resulting global 1-form is called the Liouville form . The 2-form gives a canonical symplectic structure of .
Let be a holomorphic Lagrangian submanifold (equivalently, 1-dimensional smooth complex submanifold).
Definition 2.3.
We say is meromorphic if there exists such that .
We can recover from as follows. For each contractible open subset in , we have where each is isomorphic to through . For each , we have the 1-form on by pulling back . Then we set
(2.4) |
Then recovers .
For this reason, we will use and interchangeably in the following sections.
3 Trajectory structure
We fix a meromorphic Lagrangian . We denote the restriction of the projection to by .
3.1 PreStokes curves and trajectory
Definition 3.1.
Let be a smooth immersed curve in . A type structure of is an ordered pair of sections of .
For , we set .
Definition 3.2.
We say an immersed curve with a type structure is a preStokes curve of type if the following hold
-
1.
does not pass branching points.
-
2.
where .
We always orient a preStokes curve in a way that is increasing.
Definition 3.3.
We say a branching point (resp. value) is of type if it is a simple branching point (resp. value) of where and merge. Note that a branching point is of type is also of type .
Remark 3.4.
In the literature of exact WKB analysis, branching value is called turning point.
Definition 3.5.
A maximal preStokes curve is called a trajectory.
Definition 3.6.
-
1.
A saddle trajectory is a trajectory of type connecting branching values of the same type.
-
2.
A closed trajectory is a periodic trajectory.
-
3.
A recurrent trajectory is a trajectory whose closure has nonempty interior.
The followings are basic facts.
Lemma 3.7 ([Str84]).
For each simple branching value of type , three preStokes curves of type emanate.
We later use the following lemma:
Lemma 3.8.
Let be two preStokes curves which are not recurrent and distinct. The intersections between and are discrete.
Proof.
Since and are real analytic curve, they coincide if they have accumulating intersection points. ∎
3.2 The case of quadratic differentials
In this section, we consider the case when . In this case, the theory is classical. We refer to Strebel [Str84] and Bridgeland–Smith [BS15]. We use a little stronger version of the GMN condition in [BS15].
Definition 3.9.
A quadratic differential is strongly GMN if the following holds:
-
1.
Any branch point is simple.
-
2.
has at least one branch point.
-
3.
Any pole is with order .
-
4.
has at least one pole.
Lemma 3.10 ([BS15, Lemma 3.1]).
If is strongly GMN, there exists a nonempty open subset such that does not admit closed and recurrent trajectories for .
3.3 Associated quadratic differential
To deal with , it is convenient to use the knowledge from the theory of quadratic differentials. For this purpose, we introduce an associated quadratic differential as follows.
Example 3.11.
To explain the following construction, we first deal with an example of ; . For the defining equation of the spectral curve , we take the square completion . It is easy to observe that any preStokes curve defined by is a preStokes curve of the quadratic differential , and vice verca.
In the following, we generalize this example to higher order cases. Let be the set of branching values of . Take a contractible open subset in . Then we have where each is isomorphic to through . For each , we have the 1-form on by pulling back , which is again denoted by . Let be the diagonal subset of . For each , we set
(3.1) |
which is a quadratic differential on . Consider the analytic continuation of over , and we denote the resulting Riemann surface by .
Note that each sheet of is parametrized by . For each point of , we can fill out by one of the following:
-
1.
if a sheet is corresponding to which is the type of the branch, then we fill out it by a disk. Then is extended by zero.
-
2.
if a sheet is corresponding to which is not the type of the branch, then we fill out it by a branching disk. Then is extended.
We denote the resulting branched covering of by . The following is obvious from the above construction.
Lemma 3.12.
The Riemann surface is a finite covering of .
As a result, we get a finite covering and a quadratic differential on .
For our purpose, either of construction works well. The following is also obvious.
Lemma 3.13.
Any preStokes curve of is the projection of a preStokes curve of .
Remark 3.14.
Alternative way to get a similar object is as follows: We consider the fiber product using . We denote the projections by (). This is again a finite branched covering of . Note that the diagonal is a connected component. On the complement , we consider the quadratic differential . It descends to a quadratic differential on . We have a branched covering map , and any preStokes curve of is the projection of a preStokes curve of .
3.4 Global structure
To have tame behavior of global trajectories, we assume a higher-order analogue of GMN condition.
Definition 3.15 (Higher order GMN condition).
We say is strongly GMN if the followings hold:
-
1.
is strongly GMN, and
-
2.
has poles on .
Remark 3.16.
For our main results, one can remove the second condition easily by perturbing more. We assume here just for simplicity of the notation.
Here we give a sufficient condition to be strongly GMN. For this purpose, we recall the Hukuhara–Levelt–Turittin theorem.
Definition-Lemma 3.17.
Let be a meromorphic flat connection over . After the base change to , there exists an isomorphism
(3.2) |
where is a finite Puiseux series, , and is a regular connection. The set is called the formal type of .
For a point , take a local neighborhood, and consider a differential equation
(3.3) |
associated to . Viewing this as a differential system, we define the formal type of as the formal type of this equation.
Lemma 3.18.
is strongly GMN if the following holds:
-
1.
Any branching point is simple.
-
2.
There exists at least one branching point for each connected component of the spectral curve.
-
3.
For any , of the formal type has pole order at any pole.
-
4.
For any , .
Proof.
Lemma 3.19.
If is strongly GMN, it does not have closed trajectories and recurrent trajectories for generic .
Proof.
This is by Lemma 3.10. ∎
4 Stokes graph (a.k.a. WKB spectral network)
In this section, we first define the Stokes graph (a.k.a. WKB spectral network).
4.1 Stokes trees
A tree is a connected acyclic graph whose valency at each interior vertex is . A rooted tree is a tree with a distinguished exterior vertex. For a rooted tree, the distinguished vertex is called the root vertex. The edge connected to the root vertex is called the root edge. A leaf vertex is an exterior vertex which is not the root vertex. A leaf edge is the edge connected to a leaf vertex. We always orient a rooted tree toward the root.
We first define the notion of a Stokes tree. We fix a meromorphic Lagrangian and .
Definition 4.1 (Open Stokes tree, or 2d BPS state).
An open Stokes tree is the following: an immersion of a finite rooted tree with type structures on the interior of each edge of such that
-
1.
Each edge is a preStokes curve of type .
-
2.
The orientation of each edge as a preStokes curve is the same as the one induced from the orientation of .
-
3.
The root vertex is in . The restriction .
-
4.
Any leaf edge of type has its leaf vertex is in the branching value of type .
-
5.
Any interior vertex is in . Here is the set of branching values.
-
6.
Each interior vertex has the cyclic order induced from the orientation of . Suppose is an interior vertex and consider the ordered set of edges on with rooted . Then the condition is the following: Each is a preStokes curve of type for . For , it is a preStokes curve of type .
We always consider each edge of an open Stokes tree as a preStokes curve is of the type whose orientation is compatible with the orientation of the rooted tree. We always consider open Stokes trees up to reparametrization.
Definition 4.2 (Closed Stokes tree, or 4d BPS state of genus ).
A closed Stokes tree is the following: a finite tree immersed in with a type structure on the interior of each edge of satisfying the following:
-
1.
Each edge is a preStokes curve of type .
-
2.
Any exterior vertex of type has its leaf vertex is in the branching value of type .
-
3.
Any interior vertex is in .
-
4.
Each interior vertex has the cyclic order induced from the orientation of . Suppose is an interior vertex and consider the ordered set of edges on with rooted . Then the condition is the following: Each is a preStokes curve of type up to opposition.
We always consider each edge of a rooted Stokes tree as a preStokes curve is of the type whose orientation is compatible with the orientation of the rooted tree. We always consider closed Stokes trees up to reparametrization.
Definition 4.3.
-
1.
The Stokes graph of at is the set of open and closed Stokes trees. We denote the subset of open Stokes trees by , and the set of closed Stokes trees by . We sometimes omit from the notation if the context is clear.
-
2.
A Stokes graph of at is a subset of .
-
3.
We say the angle is unobstructed if is empty.
Remark 4.4.
In §5, we state and prove a generic exisntence result of unobstructed angles.
4.2 Mass filtration
We next assign a positive real number called BPS mass to each Stokes tree. For each preStokes curve of type , we set
(4.1) |
For an open Stokes tree , we set
(4.2) |
For the later use, for a point of an open Stokes tree, we set
(4.3) |
where is the subset of edge starting from the ascendant vertex ending at , and is the subtree of whose rooted edge is .
For a closed Stokes tree , we set
(4.4) |
The Stokes graph is equipped with an increasing filtration where consists of those with mass less than . We set
(4.5) |
Suppose is strongly GMN. Suppose there are no saddle trajectories at . Then any trajectory emanating from a branching value ends at .
Definition 4.5.
The initial Stokes graph of is the set of Stokes trees consisting of the trajectories emanating from the turning points.
Note that any Stokes tree in the initial graph is mass zero.
5 The generic existence of unobstructed angles
5.1 Statement
Here is our main theorem.
Theorem 5.1.
For a strongly GMN Lagrangian , the set of unobstructed ’s is dense in .
We will prove this in the rest of this section.
5.2 Unobstructed diagram
We fix a strongly GMN Lagrangian . We also fix .
Definition 5.2 (Collision).
-
1.
A collision between two Stokes trees is a crossing of the rooted edges of the trees.
-
2.
We say a set of Stokes trees forms a collision if each two of them forms a collision at .
-
3.
Let be a set of Stokes trees making a collision at . We say forms an ordered collision if the types at of takes the form .
-
4.
We say an ordered collision is cyclic if moreover .
For an ordered collision formed by , we set
(5.1) |
and call it mass of the collision .
Definition 5.3.
Fix . We fix . Let be a Stokes graph. We say is unobstructed modulo if
-
1.
Locally finite.
-
2.
Any ordered collision happens outside the set of turning points.
-
3.
There are no closed Stokes trees with energy less than .
-
4.
There are no non-discrete overlapping between and preStokes curves in Stokes trees in .
-
5.
The set of ordered collisions with energy less than is finite in .
Lemma 5.4.
Let be a strongly GMN Lagrangian. For , there exists such that the initial graph of is unobstructed for some energy for any .
Proof.
By Lemma 3.10, there exists a nonempty open subset such that the initial Stokes graph of the associated quadratic differential is locally finite for . This is the first condition of Definition 5.3.
Since the set of turning points and the set of initial Stokes trees are both finite, one can find a nonempty open subset in such that the initial Stokes trees do not pass through turning points for . This is the second condition of Definition 5.3.
We will treat 3, 4, 5 later. ∎
5.3 Deformable Stokes trees
Since we are interested in the generic behaviour of Stokes trees, we only treat deformable Stokes trees. We start with then notion of family of preStokes curves.
Definition 5.5.
Let be an interval in . Let be an interval. A map . A type structure of is an ordered pair of continuous sections of .
Definition 5.6.
Let be an -parametrized family of immersed curves. Let be its type structure. We say is a family of preStokes curves of type if the restriction to each is a preStokes curve for any .
Now we can define families of open Stokes trees.
Definition 5.7.
Let be an interval in . A family of Stokes trees is specified by the following:
-
1.
A rooted tree .
-
2.
A continuous map such that the restriction to each edge of is a family of preStokes curves.
Definition 5.8 (Deformable Stokes tree).
A Stokes tree at is deformable if there exists an open neighborhood of and an -family of Stokes trees whose restriction to is .
5.4 Inductive construction
In the following, we will construct unobstructed Stokes diagram inductively. We explain the setup and key lemmas.
Definition 5.9.
-
1.
Let be a Stokes graph. Let be a non-cyclic ordered collision of open Stokes trees in . We say is scatterable if there exists an open Stokes tree which contains as an interior vertex. We say is unscatterable if it is not scatterable.
-
2.
We say is scattered if there exists an open Stokes tree in which contains as an interior vertex. We say is unscattered if it is not scattered.
Definition 5.10.
Let be a non-cyclic ordered collision of . Suppose the type of on is . The one can adjoin a new preStokes curve of type at to . If the obtained one is a Stokes tree, we call it the scattering of at .
Definition 5.11.
Let be an unobstructed Stokes graph modulo . We set
(5.2) |
Definition 5.12.
Let be an -family of Stokes graphs and be a real positive number. We say is -scatterble if the following holds: There exists a nonempty relatively compact open subset of such that
-
1.
All the cyclic-ordered collisions of mass less than are scatterable at any .
-
2.
Any scatterings at the collisions with energy less than is deformable over .
If is -scatterble, we define the new family of Stokes graphs by the union of and the scatterings.
We start with , the initial unobstructed diagram, which is a family over a nonempty open subset . We will choose an increasing sequence such that . We inductively set
(5.3) |
when it is defined. Now we state the key lemma.
Lemma 5.13.
For each , there exists a nonempty open interval on which is scatterble at and unobstructed modulo . Moreover, We can take in a way that
-
1.
is a relatively compact subset of , and
-
2.
.
As a corollary of this lemma, we can prove our main theorem.
Proof of Theorem 5.1.
Since is a relatively compact subset of , is not empty (Proof: Take one element from each . It forms a bounded sequence. Hence having a convergent subsequence. For each , the limit is contained in . Hence it is contained in . Hence the limit is in ). Since we can take arbitrary close to the initial , we have the density result.
Now take . Take any Stokes tree . Then is finite, and if . Then the second part of the above lemma implies that is the desired unobstructed Stokes graph. ∎
5.5 Proof of Lemma 5.13: Induction part
In this section, we prove the first part of Lemma 5.13. Since we have already proved for in Lemma 5.4, we prove the following induction.
Lemma 5.14.
Suppose is -scatterble and unobstructed modulo on an open subset of . Then, for any , there exists a relatively compact subset of such that is unobstructed modulo .
Proof.
We first deal with the generic unobstructedness. For this, we first show the following finiteness.
Claim 5.15.
Let be a positive number. The number of the collisions in of mass less than is finite.
Proof.
By induction, we can see that the number of involved preStokes curves involved in is finite. For a , take a sequence of points on the rooted edge such that going to . By the assumption on the pole order (strongly GMN assumption), we have for any . In particular, there exists a neighborhood of such that
(5.4) |
This implies that the collisions of mass less than is contained in . Since such collisions are discrete by Lemma 3.8, we have the desired finiteness. ∎
We then add finitely many new Stokes trees. Now we would like to show we can achieve the unobstructedness by perturbing . We would like to check from 1 to 5 of Definition 5.3.
- 1.
-
2.
Since the number of turning points are finite by the compactness of , by perturbing slightly, all the added new Stokes trees can avoid turning points. So, any ordered collision happens outside the set of turning points.
-
3.
By Claim 5.15, the number of collisions of mass less than is finite. We will see the absence of cyclically ordered collisions with energy less than in the following lemma.
-
4.
Again, by Claim 5.15, the number of collisions of mass less than is finite. We can also avoid collisions of preStokes curves of different types by the following lemma.
-
5.
The set of ordered collisions with energy less than is discrete in , since the intersections are discrete by Claim 5.15.
If there are no cyclic ordered collision, we have done. So, suppose there are several cyclic ordered collisions. The number of them is finite by Claim 5.15. In this case, we can resolve them by the following claim.
Claim 5.16 (Moving lemma).
Take a point on a smooth part of a Stokes tree in . Take a small disk neighborhood. Then the edge divides the disk into two half disks. Then there exists such that the corresponding tree in intersect with the disk on the left half disk for any .
Proof.
We prove by induction. If the tree has no internal vertices, the statement is clear. Suppose be a deformable Stokes tree with some internal vertices. The vertex next to the root vertex formed by a collision of some preStokes curves. We denote the corresponding vertex after the perturbation by by . By the perturbation of by , the collision point moves to left with respect to any preStokes curves involved in the collision. In other words, the collision point satisfies . Here is the coordinate defined by the integration of the differential defining the corresponding preStokes curve. The root edge curve defines the coordinate . Hence . Hence the new curve also moves left after the perturbation. ∎
Now we can collapse the cases 3 and 4 by the above moving lemma as in Figure 5.1. This completes the proof of the generic unobstructedness.
We next show the generic deformability. The following lemma is enough:
Lemma 5.17.
Let be an -family of Stokes trees. There exists a nonempty open subset of satisfying the following: For any , the scatterings at the collisions with mass less than are deformable over .
Proof.
The deformability can fail if (1) the collisions form or collapse after perturbations, or (2) the new Stokes curve emanating from the collision does not form a Stokes tree. (1) is OK, since the formation and collapsing of collisions are non-generic phenomena. For (2), it is easy to avoid the situation by using the associated quadratic differential. ∎
This completes the proof. ∎

5.6 Proof of Lemma 5.13: Mass estimate part
In this section, we prove the latter part of Lemma 5.13. What we will show is that there exists which does not depend on and satisfies . Then the desired statement follows.
We start with some preliminary notions. For a while, we consider about paramatrized by . In the following discussion, we will discuss uniformly over . For a branching value of type , let be the union of the (three) preStokes curves emanating from of type . If it is necessary we retake sufficiently small, so that we can take a compact neighborhood of uniformly over such that
-
1.
does not contain any other branching values, does not intersect with the Stokes trees of type in for any by 4 of Definition 5.3.
-
2.
is topologically a trivalent tree with a single interior vertex and has three boundaries .
We set
(5.5) |
We also take a small neighborhood of such that the closure of does not contain any other branching values and does not intersect with Stokes trees of or in . Consider the set of connected subsets of preStokes curves of type or such that each starts from a point outside and ends at a point in . We set
(5.6) |
Let be a branching value or an ordered collision of initial Stokes curves which is different from . Let be the set of preStokes curves of type emanating from passing through . We set
(5.7) |
This is positive, since the set of turning points and the ordered collisions is discrete and is outside the closure of .
We choose and for each turning point and set
(5.8) |
which is again a positive real number. Not that this number is taken uniformly over .
We now set
(5.9) |
Now we prove the following:
Lemma 5.18.
We have for any .
Proof.
Since , it holds for . We assume the statement holds true for . We classify the unscattered point of into the followings:
-
1.
Collisions of trees in with mass greater than or equal to .
-
2.
Collisions formed by new Stokes trees in .
For the 1st one, the statement is satisfied. We further classify the 2nd one as follows:
-
1.
If a new collision happens outside , then the collision carries mass greater than .
-
2.
Suppose a new collision happens inside between an initial curve and a tree. If the rooted edge of the tree emanates outside , it carries mass greater than .
-
3.
Suppose a new collision happens inside between an initial curve and a tree. If the rooted edge of the tree emanates inside , the rooted edge is created by a scattering between a Stokes tree in and a Stokes tree in with . Hence it carries mass greater than .
This completes the proof. ∎
This completes the proof of Lemma 5.13.
5.7 The finiteness of closed Stokes trees
As a variant of the above argument, we prove the following theorem.
Theorem 5.19 (Gromov compactness).
For any without recurrent trajectories and any , the number of closed Stokes trees with mass less than is finite.
We can run the same inductive argument to construct the Stokes graph in the presence of closed Stokes trees. Namely, we only add new preStokes curves to scatterble collisoins. As in the above proof, we obtain the following:
Lemma 5.20.
We have for any .
6 Wall-crossing factors and sheaf quantization
For a Stokes graph/WKB spectral network, one can assign data of multiplicity, called wall-crossing factors (or BPS-multiplicity). We can use our inductive procedure to construct such data in a canonical way. Moreover, the resulting wall-crossing factors give a sheaf quantization.
6.1 Definition
Let be a field. Let be a real manifold and be the real line with the standard coordinate . We consider the discrete group of the real numbers and let it act on by addition.
We denote the derived category of equivariant -module sheaves by . We define the subcategory by the microsupport condition where is the cotangent coordinate of . We set
(6.1) |
This is a version in [Kuw20] of the category introduced by Tamarkin [Tam18]. The feature of this version is the natural enrichment over .
For an object , the positive microsupport is well-defined. We set
(6.2) |
where .
Definition 6.1.
For a smooth Lagrangian , we say is a sheaf quantization of if .
Given a brane structure of , one can further speak about a sheaf quantization of . Namely, associated to a brane structure of , we can associate a local system on to a sheaf quantization of . We say is a sheaf quantization of if the local system is the rank 1 constant sheaf.
Conjecture 6.2.
There exists an infinitesimally wrapped Fukaya category of nonexact Lagrangians in with a natural embedding
(6.3) |
This conjecture was checked for integral Lagrangians in [KPS24].
Now let us assume be a Riemann surface . Let be a holomorphic Lagrangian in . By the Solomon–Verbitsky theorem [SV19], one can consider as an object of for generic . Hence, if the above conjecture holds, one can deduce the following:
Conjecture 6.3.
For generic , the Lagrangian is sheaf quantizable.
In the following, we prove this conjecture for spectral curves, without assuming Conjecture 6.2.
6.2 Modification by wall-crossing factors
For the discussion in this section, we first recall the definition of brane structures.
Let be a strongly GMN Lagrangian submanifold.
Definition 6.4.
A brane structure of is a pair of a rank 1 -local system on and a spin structure .
In the following, we give a spectral-network-friendly form of a brane structure.
We first note that a spin structure gives a double covering of the co-circle bundle of . We pull back to , then push-forward to . We take the part where the fiber monodromy is . By this procedure, the set of local systems on and the set of local systems on whose fiber monodromy is are one-to-one, which depends on .
Definition 6.5.
A wall-crossing data for a Stokes graph is a -valued function on the set of open Stokes trees in the graph.
Consider an unobstructed angle . Take . Consider wall-crossing data on . We subtract the collision points of and the branching values and the poles from and denote it by .
Let be a Stokes tree with the rooted edge of type . Let be a path in crossing the root edge of at one point. We set . We denote the lift of (resp. ) to the sheet by (resp. ). Let be the lift of to sheet (1). We denote the associated Gauss lift by .
We associate another path as follows: Let be the point where and meets. For some metric of , we take an -neighborhood of , and remove the part of the neighborhood ascending to . Then we take a path gamma detouring the boundary of the neighborhood. We lift this path to the associated Gauss path on . Note that one can make .
Now we consider the following matrix:
(6.4) |
For an arbitrary path on , let be the trees crossing with in the chronological order. We set
(6.5) |
Now we get a new representation of associated to . For any point which is a branching value or a interior vertex of a tree, we associate by
(6.6) |
where runs over shrinking circles encircling .
Definition 6.6.
We say is compatible if for any such and any .
6.3 Initial wall-crossing data
Let be an unobstructed initial diagram, which consists of Stokes curves emanating from branching values, three for each branching point.
Definition 6.7.
The canonical initial data assigns for each Stokes tree (curve) in .
The initial wall-crossing data is indeed compatible at . Around a branching point, we can take the following trivialization of the spin structure: For each Stokes curve, when crossing a Stokes curve, we have a transformation of matrix of the trivialization by
(6.7) |
Then crossing six times, we have
(6.8) |
This corresponds to one winding around the fiber of . Then
(6.9) |
Hence it is compatible.
Theorem 6.8.
There exists a unique consistent wall-crossing data whose restriction to is the canonical initial data.
6.4 Inductive construction
It is enough to describe how we specify wall-crossing data when it is scattered. Suppose is an unscattered collision point. Suppose it consists of Stokes trees in a cyclic order. We denote the rooted edges of them by , where the collision happens. We set
(6.10) |
for .For , we put the wall crossing factor on the scattering . Then we obtain a new Stokes subgraph (after perturbing if necessary). One can directly check the following:
Lemma 6.9.
We have modulo .
By repeating this procedure along the construction of the Stokes graph, we complete the proof of Theorem 6.8.
6.5 Construction of sheaf quantization
Take an unobstructed angle . Fix . On each connected component of the complement of , we consider the projection
(6.11) |
where is the connected component of . Along this morphism, we pull back , and denote it by .
We put the following sheaf
(6.12) |
On each wall and each Stokes tree with the root edge of type contributing on it, we consider the automorphism
(6.13) |
By the compatibility, we can glue up them to get a sheaf . By taking the inverse limit, we obtain our desired object .
Theorem 6.10.
The object is a sheaf quantization of the given brane structure .
7 Non-abelianization
7.1 Novikov ring and equivariant Tamarkin category
Let be the semigroup of real nonnegative numbers. We denote the polynomial ring of by . For , we denote the corresponding indeterminate by . We denote the ideal generated by by . Then we set
(7.1) |
This is called the universal Novikov ring. The unique maximal ideal of will be denoted by . We denote the fraction field by .
We now recall the main result of [Kuw24]. We denote the derived category of -modules over by .
Theorem 7.1 ([Kuw24]).
There exists an almost embedding
(7.2) |
For a more precise result, we refer to [Kuw24].
7.2 Non-abelianization over Novikov field
It is known/expected that the spectral network transforms a local system on a spectral curve into a local system on e.g., [GMN13a, IM21]. This procedure is called non-abelianization. This is an important topic related to cluster coordinates on character varieties. In this section, we explain how to realize non-abelianization in our setup.
Theorem 7.2.
Let be a strongly GMN Lagrangian. Let be an unobstructed angle. Fix a spin structure of . Then we have a map
(7.3) |
where is the set of -local systems on of rank for a field .
Proof.
In the last section, we constructed a sheaf quantization as an object in . By using the main result of Theorem 7.1, we can construct a -module sheaves on . By inspecting the construction in [Kuw24], one can see that, by tensoring over , we obtain a locally constant sheaf over , which is the nonabelianization. ∎
Remark 7.3.
We conjecture that the resulting local system is covergent under the substitution for when .
8 Exact WKB conjecture
Exact WKB analysis has been expected for higher order differential equations. However, we cannot find much exact conjectures on exact WKB analysis in the literature. Here, as an application of our results, we give a version of an exact conjecture.
We suppose be an -flat connection. We denote a WKB formal solution by and its Borel–Laplace dual by .
Conjecture 8.1.
Assume is WKB-regular [Kuw20] and the spectral curve is strongly GMN. Let be an unobstructed angle whose existence is assured by Theorem 5.1.
-
1.
If is not on the Stokes graph at , is analytically continuable on . Moreover, is Laplace transformable in the direction .
-
2.
Let be the set of Stokes trees at passing through . Then the first sheet of the analytic continuation of is smooth on .
References
- [BNR82] H. L. Berk, William McCay Nevins, and K. V. Roberts. New Stokes’ line in WKB theory. J. Math. Phys., 23(6):988–1002, 1982.
- [BS15] Tom Bridgeland and Ivan Smith. Quadratic differentials as stability conditions. Publ. Math. Inst. Hautes Études Sci., 121:155–278, 2015.
- [GMN13a] Davide Gaiotto, Gregory W. Moore, and Andrew Neitzke. Spectral networks. Ann. Henri Poincaré, 14(7):1643–1731, 2013.
- [GMN13b] Davide Gaiotto, Gregory W. Moore, and Andrew Neitzke. Wall-crossing, Hitchin systems, and the WKB approximation. Adv. Math., 234:239–403, 2013.
- [GS11] Mark Gross and Bernd Siebert. From real affine geometry to complex geometry. Ann. of Math. (2), 174(3):1301–1428, 2011.
- [HKT15] Naofumi Honda, Takahiro Kawai, and Yoshitsugu Takei. Virtual turning points, volume 4 of SpringerBriefs in Mathematical Physics. Springer, Tokyo, 2015.
- [Hon08] Naofumi Honda. The geometric structure of a virtual turning point and the model of the Stokes geometry. In Differential equations and exact WKB analysis, volume B10 of RIMS Kôkyûroku Bessatsu, pages 63–113. Res. Inst. Math. Sci. (RIMS), Kyoto, 2008.
- [IK] Yuichi Ike and Tatsuki Kuwagaki. Microlocal categories over the Novikov ring.
- [IKO] Kohei Iwaki, Tatsuki Kuwagaki, and Hiroshi Ohta. in progress.
- [IM21] Matei Ionita and Benedict Morrissey. Spectral networks and non-abelianization, 2021.
- [KPS24] Tatsuki Kuwagaki, Adrian Petr, and Vivek Shende. On fukaya categories and prequantization bundles, 2024.
- [KS] Tatsuya Koike and Richard Schäfke. unpublished.
- [KS06] Maxim Kontsevich and Yan Soibelman. Affine structures and non-Archimedean analytic spaces. In The unity of mathematics, volume 244 of Progr. Math., pages 321–385. Birkhäuser Boston, Boston, MA, 2006.
- [Kuw20] Tatsuki Kuwagaki. Sheaf quantization from exact wkb analysis, 2020.
- [Kuw24] Tatsuki Kuwagaki. Almost equivalences between tamarkin category and novikov sheaves, 2024.
- [Nho24] Yoon Jae Nho. Family floer theory, non-abelianization, and spectral networks, 2024.
- [Nik23] Nikita Nikolaev. Existence and uniqueness of exact WKB solutions for second-order singularly perturbed linear ODEs. Comm. Math. Phys., 400(1):463–517, 2023.
- [Str84] Kurt Strebel. Quadratic differentials, volume 5 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]. Springer-Verlag, Berlin, 1984.
- [SV19] Jake P. Solomon and Misha Verbitsky. Locality in the Fukaya category of a hyperkähler manifold. Compos. Math., 155(10):1924–1958, 2019.
- [Tak17] Yoshitsugu Takei. WKB analysis and Stokes geometry of differential equations. In Analytic, algebraic and geometric aspects of differential equations, Trends Math., pages 263–304. Birkhäuser/Springer, Cham, 2017.
- [Tam18] Dmitry Tamarkin. Microlocal condition for non-displaceability. In Algebraic and analytic microlocal analysis, volume 269 of Springer Proc. Math. Stat., pages 99–223. Springer, Cham, 2018.
- [Vor83] A. Voros. The return of the quartic oscillator: the complex WKB method. Ann. Inst. H. Poincaré Sect. A (N.S.), 39(3):211–338, 1983.
Department of Mathematics, Graduate School of Science, Kyoto University, tatsuki.kuwagaki.a.gmail.com