Generalised Ordinary vs Fully Simple Duality for n-Point Functions and a Proof of the Borot–Garcia-Failde Conjecture

We study a duality for the n-point functions in VEV formalism that we call the ordinary vs fully simple duality. It provides an ultimate generalisation and a proper context for the duality between maps and fully simple maps observed by Borot and Garcia-Failde. Our approach allows to transfer the algebraicity properties between the systems of n-point functions related by this duality, and gives direct tools for the analysis of singularities. As an application, we give a proof of a recent conjecture of Borot and Garcia-Failde on topological recursion for fully simple maps.


Introduction
An original motivation that lead to the results of this paper came from an attempt to understand the results and a conjecture of Borot and Garcia-Failde on maps and fully simple maps [BGF20] in the framework of algebraic formalism developed for the n-point functions of hypergeometric KP tau functions in [BDBKS20a;BDBKS20b].
Borot and Garcia-Failde studied the duality between maps and fully simple maps as an instance of a phenomenon known in the theory of topological recursion, the x ↔ y duality, developed by Eynard and Orantin [EO13].Borot and Garica-Failde also proved (see also a different fully 1 combinatorial proof in [BCDGF19]) that enumerations of map and fully simple maps are related by a matrix whose coefficients are given by monotone / strictly monotone Hurwitz numbers.
The second result has a nice interpretation in terms of the vacuum expectation value (VEV) presentation of KP tau functions and using a VEV formula for ordinary maps it gives a VEV formula for fully simple maps.The relation between the VEV formulas for the tau functions of ordinary maps and fully simple maps gives rise to a very general duality for the n-point functions of KP tau functions and beyond, for more general VEV n-point functions that cover, for instance, the stuffed maps and their generalisations.Note that in general this generalised duality (which we still call the ordinary vs fully simple duality) is not reduced to the x ↔ y duality.
This general duality is the main object of study in this paper.We prove explicit closed algebraic formulas (of the same flavour as in [BDBKS20a]) expressing the general ordinary n-point functions in terms of the fully simple ones and vice versa.
These algebraic relations between the n-point functions appear to be a very efficient tool to transfer the properties between the sides of this duality.In particular, we apply this technique to the case of fully simple maps, and we prove (using the known topological recursion on the side of ordinary maps) the topological recursion statement for fully simple maps, conjectured by Borot and Garcia-Failde in [BGF20].
1.1.Organisation of the paper.This paper heavily depends on the techniques developed in [BD-BKS20a; BDBKS20b].For many explicit computations that literally repeat what is done in op.cit.we rather give references than repeat them here.
Section 2 is devoted to explaining the vacuum expectation values that appear in other sections, and how to represent them as sums over graphs.
In Section 3 we recall the details regarding the ordinary and the fully simple maps, and state the theorem on topological recursion for the fully simple maps (originally conjectured by Borot and Garcia-Failde in [BGF20]).
Section 4 is devoted to our main result, namely the generalised ordinary vs fully simple duality, which holds in a much more general context than that of maps.We formulate and prove it first (Sections 4.1-4.6) in the KP context (where we also pose a conjecture on topological recursion for the respective n-point functions), and then (Sections 4.7-4.8) in an even more general context inspired by the so-called stuffed maps .
In Section 5 we use the main result of Section 4 in order to prove the theorem on topological recursion for fully simple maps (Theorem 3.4) stated in Section 3.
Remark 1.1.Throughout the paper we use the notation M g,n , W g,n and M ∨ g,n , W ∨ g,n for the ordinary and fully simple n-point functions, respectively.Let us note here that we abuse the notation: in Sections 3 and 5 M g,n , W g,n , M ∨ g,n , W ∨ g,n stand for the n-point functions of maps/fully simple maps, while in Sections 4.1-4.6 they stand for the general t-deformed hypergeometric KP n-point functions and in Sections 2 and 4.7-4.8they stand for an even more general case inspired by the stuffed maps.See the respective sections for the precise definitions.1.2.Acknowledgements.When this paper was essentially finished and we mentioned the results at the 7th Workshop on Combinatorics of Moduli Spaces, Cluster Algebras, and Topological Recursion (organized by L. Chekhov, S. Lando et al. online on May 31-June 4 2021), we got a message from E. Garcia-Failde that she together with G. Borot and S. Charbonnier also found an alternative independent proof of their conjecture with Borot on the topological recursion for fully simple maps, which was to appear soon (at the time of the current update of our present paper, Borot-Charbonnier-Garcia-Failde's paper is already available, [BCGF21]).
B. B. and M. K. were partially supported by the International Laboratory of Cluster Geometry at the HSE University.S. S. was supported by the Netherlands Organization of Scientific Research.

Vacuum expectation values
The main technical tool used in this paper allowing us to work with various kinds of correlator functions is to express them as certain vacuum expectation values and then to reduce computations to sums over graphs.In this section we explain a general set-up for this technique.We refer to [Kac90;MJD00] and also [BDBKS20a] as the main sources on the formalism presented here.
Given a collection of quantities s g;k 1 ,...,km defined for g ≥ 0, m ≥ 1, k i ≥ 1 and symmetric in k 1 , . . ., k m , we are interested in the VEVs of the type Here ψ i (y, 2 ), i = 1, . . ., n, are formal power series such that ψ i (0, 2 ) = 0 that might eventually coincide with each other.Denote and We define a connected VEV as The computation of such expressions is based on the following formula ([BDBKS20a], Section 3.1): as well as the obvious identities J >0 |0 = 0, 0|J <0 = 0, commutation relations [J a , J b ] = aδ a+b,0 , and their natural corollaries like where the latter formula is understood as its asymptotic expansion in the sector |z| < |w|.In (6) and everywhere below in the paper for a power series f (x) the expression [x k ]f (x) stands for the coefficient in front of x k in the series, and also we have With these formulas, we expand W • n as an infinite sum of the coefficients of the VEVs of the type We commute all operators with the negative indices to the left, and all operators with the positive indices to the right.This way we obtain that (9) is given as a sum over bi-coloured graphs (with white and black vertices) with the following properties: • There are n vertices labelled from 1 to n (white vertices).
• There is a finite number of ordinary edges connecting the white vertices.Self-adjusted ordinary edges (loops) are forbidden.An ordinary edge connecting the white vertices labelled by i and j, i = j, is decorated by • There is a finite number of multi-edges (unlabelled black vertices connected by a finite number of edges to white vertices).A multi-edge can be connected to a white vertex multiple times.A multi-edge that is connected to the white vertices labelled by i 1 , . . ., i k (the indices might be repeated) is decorated by • The value that we associate to a graph is the product of the weights on its ordinary and multi-edges divided by the order of its automorphism group.
Note that there is no requirement that the graphs are connected.Denote the set of not necessarily connected graphs with n labelled white vertices and with any number of ordinary and multi-edges by Γ• n .Let E(γ) be the set of ordinary and multi-edges of a graph γ ∈ Γ• n , and denote the weight of an ordinary or a multi-edge e by weight(e).Then the formula for W • n is A direct corollary of the inclusion-exclusion formula (5) is the following lemma: Lemma 2.1.Let Γn ⊂ Γ• n be a subset of the connected graphs.Then In order to get more compact formulas for practical computations, it is also useful to reduce the sets of graphs Γ• n and Γn to forbid the multiple edges and thus include coefficients coming from the automorphism group into the labels on the multi-edges.To this end, we introduce a subset Γ • n ⊂ Γ• n of graphs that has at most one multi-edge for each tuple of indices a 1 , . . ., a k , where a 1 < • • • < a k , for each k = 1, . . ., n, and no ordinary edges (there are multi-edges with 2 indices, and the contributions of former ordinary edges are incorporated in those).For an edge e like that define weight(e) as weight(e n denote the subset of connected graphs.We have:

Fully simple maps and topological recursion
In this section, we recall the definitions of ordinary maps, fully simple maps, and their VEV expressions.We also recall the definition of topological recursion of Chekhov-Eynard-Orantin, and a statement on topological recursion of ordinary maps as well as a conjecture of Borot-Garcia-Failde on topological recursion for fully simple maps (the latter one is proved below in this paper).
3.1.Geometric definition.Let Map g;µ 1 ,...,µn count the number of connected ordinary maps.More precisely, Map g;µ 1 ,...,µn is a generating formal series in t 1 , t 2 , t 3 , . . .whose coefficient of p i=1 t m i i /m i !, with p i=1 m i = M , is equal to the weighted count of the number of ways to combinatorially glue a surface of genus g from n + M ordered polygons along their sides.The numbers of sides of the first n polygons should be µ 1 , . . ., µ n , respectively (these are the distinguished polygons), and then there are m i polygons with i sides, i = 1, . . ., p.The weighted count means that we weight each polygonal decomposition with the inverse order of its symmetry group.
Let FSMap g;µ 1 ,...,µn be the number of connected fully simple maps, which has exactly the same definition as ordinary maps, with one important addendum: consider the genus g surface combinatorially glued from polygons as a cellular complex.We require that each 0-cell is adjacent to at most one 1-cell that is a boundary component of a distinguished polygon.By Map • g;µ 1 ,...,µn and FSMap • g;µ 1 ,...,µn we denote the disconnected variants of the above definitions, the index g here refers to a possibly disconnected surface of the Euler characteristic 2 − 2g.
Note a slight difference between our definitions and the definitions in [BGF20; BCDGF19] -in op.cit. the authors require also that each distinguished polygon also has one distinguished side, which amounts in a difference by a simple combinatorial factor.In the present paper we drop this requirement, to make formulas and computations below a bit nicer.
We introduce the following generating functions: where D X i := X i ∂/∂X i , D w i := w i ∂/∂w i .

Formulation of topological recursion.
In this paper, it is more convenient for us to give not a general definition of topological recursion [EO07], but its reformulation in terms of the loop equations and the projection property [BS17], further specialized to the case of the underlying curve of genus 0 and rational functions on it as in [BDBKS20b].
Let X and y be meromorphic functions on Σ = CP 1 with affine coordinate z, and assume that the finite critical points of X are p 1 , . . ., p N , all these critical points are simple; y is regular at these points and has non-zero differential.Let σ i denote the deck transformation of X near Consider a system of symmetric rational functions M g,n (z 1 , . . ., z n ), g ≥ 0, n ≥ 1, and set Definition 3.2.We say that the rational symmetric differentials ω g,n , g ≥ 0, n ≥ 1, satisfy the topological recursion on the spectral curve (Σ, X(z), y(z), B(z 1 , z 2 )) if • (Initial conditions) We have: These equalities are also equivalent to • (Linear Loop Equations) For any g, n ≥ 0 the function W g,n+1 may have a pole at p i for i = 1, . . ., N with respect to the first argument such that its principal part is skew symmetric with respect to the involution σ i .In other words, we have that • (Quadratic Loop Equations) For any g, n ≥ 0 the rational function may have a pole at p i in z such that its principal part is skew symmetric with respect to the involution σ i for any i = 1, . . ., N .
• (Projection Property) For any g, n ≥ 0 the function M g,n+1 (z, z n ) considered as a rational function in z has no poles other than p 1 , . . ., p N .Equivalently, the differential ω g,n+1 (z, z n ) has no poles in z other than p 1 , . . ., p N .
The projection property implies that W g,n+1 (z, z n ) also has no poles in z other than p 1 , . . ., p N .But this weaker condition on W g,n+1 is not sufficient for the projection property.We need a stronger requirement that W g,n+1 vanishes at the poles of dX/X so that The linear and quadratic loop equations together determine the principal part of the poles of W g,n+1 (z, z n ) in z up to the terms with at most simple poles at p i .Multiplying by dX(z)/X(z) we obtain the principal part of the poles of ω g,n+1 (z, z n ) without ambiguity.Any meromorphic differential form on CP 1 is determined uniquely by the principal parts of its poles.The principal relation of topological recursion is nothing but an explicit formula expressing the form ω g,n+1 in terms of the principal parts of its poles.
Remark 3.3.The original formulation ([EO07]) of the spectral curve topological recursion, which is equivalent to the one given above, allows one to explicitly recursively reconstruct all the n-point differentials ω g,n starting with the spectral curve data (Σ, X(z), y(z), B(z 1 , z 2 )); we are not listing the respective formulas here for brevity.
3.4.Topological recursion for ordinary maps.Denote t := (t 1 , . . ., t q , 0, 0, ...).Set ( the polynomial part of the Laurent polynomial V (z) ), ( 36) where α = α(t) and γ = γ(t) are functions defined in the vicinity of the point t = 0 via implicit algebraic equations With this set-up, the n-point functions W g,n (X 1 , . . ., X n ) enumerating maps and defined by (26) become rational functions in z 1 , . . ., z n after the substitution X i = X(z i ).Moreover, the differentials i.e. on the spectral curve In particular, this implies that for stable (g, n) all possible poles of rational functions W g,n lie on the hyperplanes z i = ±1.When we say that W g,n are rational, we mean that they are ratios of polynomials of fixed degree whose coefficients are formal power series in the t i parameters.Moreover, the coefficients can be expressed as polynomials in t 1 , . . ., t q , α, γ, so that the entire "nonpolynomiality" is contained in the algebraic functions α(t) and γ(t).In particular, all these series have non-zero radii of convergence.
3.5.Topological recursion for fully simple maps.Given that topological recursion is known for W g,n (X 1 , . . ., X n ), we prove it for W ∨ g,n (w 1 , . . ., w n ), with the spectral curve data given by the functions w(z) and y(z) defined by ( 36)-(38).
Theorem 3.4 (Conjectured by Borot and Garcia-Failde, [BGF20]).Let the parameters t i , i = 1 . . .q, be such that the function w(z) defined in (36) has only simple critical points.Then the n-point functions W ∨ g,n (w 1 , . . ., w n ) defined in (27) satisfy the topological recursion on the spectral curve (CP 1 , w(z), y(z), dz 1 dz 2 /(z 1 − z 2 ) 2 ), where y(z) is defined in (38); that is, the (0, 1)-differential is given by y(z) dw(z) w(z) .In terms of of the spectral curve data X(z) and y(z) for ordinary maps, (42), the spectral curve data for fully simple maps takes the following form: Proof.Follows from Corollaries 5.4 and 5.10.
Remark 3.5.If w(z) has non-simple critical points, the ordinary topological recursion is not applicable, and one needs to use the Bouchard-Eynard recursion [BE13].For brevity, we omit this case here, but the fact that the Bouchard-Eynard recursion holds for it, can be proved by taking a limit from the general case (where the ordinary topological recursion applies), analogously to [BDBS20, Section 2].

Dualities
In this section we formulate and prove the generalised ordinary vs fully simple duality.We start with formulating and proving it in the KP context (along with introducing a conjecture on the topological recursion in this context) in Sections 4.1-4.6,and then, in Sections 4.7-4.8,we also do it in a more general context inspired by the so-called stuffed maps.
Remark 4.1.Note that there were not any t-parameters in [ACEH20], that paper covered only the t = 0 specialization of what is described below; still, we use the terminology ACEH-type to reflect that only a finite number of parameters are non-zero, since this was the case for the cand s-parameters in [ACEH20].
Along with the parameters, we also have variables (p 1 , p 2 , . . .
Consider the following two partition functions The first one specializes for t = 0 to the ACEH partition function studied in [ACEH20], Z ACEH = Z| t=0 .On the other hand, for t = 0 it is recovered from the ACEH function by a shift of variables, (52) The n-point functions are then defined as follows: Notation 4.2.We call the partition functions and the n-point functions defined above in this subsection (and used up until Section 4.7) KP-type as opposed to the more general type discussed in Section 4.7.
Remark 4.3.In the case t = 0 the coefficients of W g,n enumerate various kinds of Hurwitz numbers for various specializations of the other parameters.In the most general case when c and s parameters are not specified, these are the so-called weighted double Hurwitz numbers, see e.g.[ACEH20].The insertion of t-parameters corresponds to additional markings of ramified coverings enumerated by Hurwitz numbers.Therefore, we can refer to the coefficients of W g,n as the t-deformed weighted Hurwitz numbers.On the other hand, the functions W ∨ g,n are introduced in a formal way by an explicit formula (54) and combinatorial meaning of their coefficients is not clear at the moment.The only case when the combinatorial meaning is assigned is the case of enumeration of (hyper)maps and fully simple (hyper)maps.In this way, we consider the coefficients of W ∨ g,n as the "fully simple analogues" of (t-deformed) weighted double Hurwitz numbers.4.2.Conjectural topological recursions.We conjecture that the n-point functions W g,n and W ∨ g,n satisfy topological recursions on some spectral curve.
Conjecture 4.4.Consider the n-point functions W g,n (X 1 , . . ., X n ) and W ∨ g,n (w 1 , . . ., w n ) defined in (53) and (54), respectively.Here it is important that only a finite number of parameters c, t, s are nonzero, as we have assumed at the beginning of Section 4.1; moreover we assume that these parameters are in general position, more on that below.Also consider the curve Σ = CP 1 with the global coordinate z, and a bidifferential B(z Then there exist meromorphic functions X = X(z), w = w(z), and y = y(z) on Σ such that • X(z) and w(z) serve as local coordinates near z = 0, i.e.
• The n-point differentials ω g,n and ω ∨ g,n , reconstructed via topological recursion (as in Remark 3.3) for the spectral curve data (Σ, X(z), y(z), B(z 1 , z 2 )) and (Σ, w(z), y(z), B(z 1 , z 2 )) respectively, have the power expansions at z = 0 given by • Moreover, the functions X(z), w(z) and y(z) are related by the identity where φ is the one of (45).
The aforementioned general position requirement is needed since for some special values of parameters c, t, s the functions X(z), w(z) will acquire non-simple critical points, and thus the ordinary topological recursion will not be applicable; one has to use the Bouchard-Eynard recursion [BE13] for these special situations, but we are not giving the respective precise statement here for brevity.
Remark 4.5.For the two topological recursions conjectured above we have: • The 'poles' of the two recursions and the involutions near the poles are provided by the functions X and w, respectively, considered as ramified coverings • The (0, 1)-differentials are given by in other words, the functions W 0,1 = W ∨ 0,1 = y considered as functions on the spectral curve coincide.
Remark 4.6.The conjecture in this form remains open, even just for the case of the "ordinary" functions W g,n (disregarding the "fully simple" ones, W ∨ g,n ).The topological recursion statement is proved for W g,n for the specialization t = 0 only, see [ACEH20], [BDBKS20b].We expect that this statement extends to the t-deformed case with the same number of critical points for the function X.Meanwhile, we can prove certain duality statements for W g,n and W ∨ g,n , see below (Theorems 4.10 and 4.11), which can potentially allow one to prove the topological recursion on one side if it is already known on the other side independently.We then do the latter for the maps / fully simple maps case, i. e., we prove the Borot-Garcia-Failde conjecture (Theorem 3.4) this way.

Duality formulation.
In this subsection we formulate the duality statement for the W g,n and W ∨ g,n .For this we need to introduce multigraphs: Notation 4.7.Let V be a finite set.A multiedge is an arbitrary subset of V .A multigraph with the set of vertices V is an arbitrary collection of multiedges.A multigraph can be represented as a bipartite graph with white and black vertices.The white vertices are considered as 'true' vertices while black ones are regarded as multiedges.Every multiedge connects several white vertices, namely, those connected with the corresponding black vertex by edges in the usual sense.
A multigraph is called connected if the corresponding bipartite graph is connected.All multigraphs that we are considering are simple meaning that neither multiple multiedges nor multiple edges in the corresponding bipartite graph are allowed.We denote by Γ n the set of all connected multigraphs on n numbered (white) vertices.For a multigraph γ ∈ Γ n we denote by V (γ) and E(γ) the set of its vertices and multiedges, respectively.
Remark 4.8.Notation 4.7 just gives a more detailed and formal definition of the same set Γ n which appeared at the end of Section 2; the graphs from this set differ from the graphs from the set Γn of that section by lacking any multiple edges or "ordinary" edges connecting white vertices.
We formulate an expression for W g,n as a sum over multigraphs on n vertices involving W ∨ g ,n 's for different pairs of g , n and a similar expression for W ∨ g,n in terms of W g ,n 's.These expressions have a symmetric form providing the duality between the functions W g,n and W ∨ g,n : the collection of one of these two functions determines uniquely the other one.Define (e . Let γ ∈ Γ n be a multigraph.Let e = (j 1 , . . ., j k ) ∈ E(γ) be a multiedge connecting vertices j 1 , . . ., j k .We define the weight of this multiedge as follows.If k > 2, we set In the exceptional cases k ≤ 2 these formulas are slightly modified.Namely, if k = 2, we set Finally, in the case k = 1 we set wgt ∨ (j) :=e W ∨ j −u j W ∨ 0,1 (w j ) .(67) Remark 4.9.This wgt ∨ (j 1 , . . ., j k ) (and wgt(j 1 , . . ., j k ) below) is similar to the weight we had in Section 2 (or, more precisely the former is a special case of the latter), except that it gets this correction for k = 1, which was not the case for the weight.
With these notations, the main relation connecting the KP-type 'ordinary' and 'fully simple' correlator functions reads as follows: where U i is the transformation sending a function H(u i , w i ) in u i and w i to the function U i H in X i given by (69) If H(u i , w i )/u i is regular in u i (which is always the case for n ≥ 2), we also have The form (70) can be obtained from (69) due to the fact that the 'principal identity' of [BDBKS20a] implies that the action of U i can be expressed in this case through the local change of variables w = w(X) defined by an implicit equation .
The advantage of this form of U i is that when it is applied in (68) the sums over r and j appear to be finite for any fixed g and n.
All relations (61)-( 72) have dual analogues with the exchange of the generalised 'ordinary' and 'fully simple' functions.Namely, denoting we have: Theorem 4.11. wgt(e).(78) The transformation U ∨ i takes the function H(u i , X i ) in u i and X i to the function U ∨ i H in w i given by If H(u i , X i )/u i is regular in u i (which is always the case for n ≥ 2), then we have also where the change X = X(w) is defined through an implicit equation We give the proofs of the latter two theorems in Section 4.5.
Corollary 4.12.Assume that we are given rational functions X(z), w(z), y(z), and φ(y) satisfying the identity Consider the collections of functions W g,n and W ∨ g,n defined by (53)-( 54) and expressed in z 1 , . . ., z n through the substitutions X i = X(z i ) and w i = w(z i ), respectively.Then the functions W g,n are rational in z-coordinates for all g and n iff the functions W ∨ g,n are rational in z-coordinates for all g and n.
4.4.Special cases and examples.In this subsection we list explicit formulas for W g,n and W ∨ g,n in terms of one another for the special cases (g, n) = (0, 1) and (g, n) = (0, 2), and for regular examples (g, n) = (0, 3) and (g, n) = (1, 1).4.4.1.(0, 1) case.The case (g, n) = (0, 1) is a unique case when the sum over graphs has a constant term in the expansion in the u-variables and the relations (70), (80) cannot be applied directly.However, the computations similar to those in [BDBKS20a] give in this case As a corollary, we conclude that the changes w(X) and X(w) defined by (73) and (83) are inverse to one another and the functions W 0,1 (X) and W ∨ 0,1 (w) are identified through this change.Indeed, we have (89) X(w(X)) and similarly one shows w(X(w)) = w.
4.4.2.(0, 2) case.Out of four connected multigraphs on two vertices only one gives a contribution for g = 0, and we get The two computations agree since we have through the change between X and w (92) .
These relations can be rewritten also in a more symmetric form For the special case of maps/fully simple maps it is known that there exists a local coordinate z on the line with coordinate X or w such that the above bidifferential becomes dz 1 dz 2 (z 1 −z 2 ) 2 in this coordinate (it is the global affine coordinate z on the spectral curve Σ = CP 1 , see Section 3).
Computer experiments indicate that it should also be the case in general.However, the problem of finding this coordinate for the general case remains open, cf.Conjecture 4.4.4.4.3.(0, 3) case.Set where we identify functions in X i and w i on the two sides of these equations through the change ( 73) and (83).

24
where we identify similarly functions in X and w through the change ( 73) and ( 83) and where we denote y = W ∨ 0,1 (w) = W 0,1 (X).Note that we have through this change (101)

Duality proof.
Proof of Theorems 4.10 and 4.11.Consider Z = e F and Z ∨ = e F ∨ as elements of the (bosonic) Fock space: In fact, an explicit structure of these expressions is not important for the proof.The only property that is used in the derivation of (68) and ( 78) is the following relation between these functions.
Consider first the disconnected n-point functions (or rather the extended versions W • n of these functions in the sense of [BDBKS20a, Section 4]).By definition, we have where the summation runs over tuples of all possible integer values of m i 's, both positive and negative.Then, [BDBKS20a, Proposition 3.1] states that Similarly, for the dual case we get Next, we substitute these expressions for J m and commute the corresponding vertex operators moving positive J-operators to the right and negative ones to the left.Then, we compute where the last summation goes over all multigraphs γ on n numbered vertices, both connected and disconnected ones.The inclusion/exclusion procedure used in the passage from disconnected to connected n-point functions singles out exactly connected multigraphs.On the other hand, by [BDBKS20a], the 'connected extended n-point functions' are given by This completes the proof of (68).The proof of (78) is similar.4.6.Maps vs fully simple maps.The enumeration of maps corresponds to the specialization s k = δ k,2 and φ(y) = 1 + y.We have in this case Therefore, we have The topological recursion relations make use of the odd part of ω 0,1 with respect to the involution only.It follows that adding even summands to this form does not change the result of the recursion.Therefore, we can set in this case equally (116) ω 0,1 = −w d(X −1 ), ω ∨ 0,1 = X −1 dw, and this will not affect the computation of the higher differentials.Therefore, our duality statement is equivalent in this case to the '(x ↔ y)-symmetry' conjecture of [BGF20]: we use X −1 and w as the conventional x and y coordinates of topological recursion.Note that in the general case our formulation of ordinary vs fully simple duality is not reduced to the x ↔ y duality.4.7.Beyond KP integrability.The generalised ordinary vs fully simple duality theory developed in Sections 4.1-4.5 can be applied (with literally the same proofs) to more general VEVs.Let ψ = ∞ k=1 ∞ m=0 c k,m y k 2m be a formal series in y and 2 , and t g;k 1 ,...,km and s g;k 1 ,...,km (for g ≥ 0, m ≥ 1, k i ≥ 1) be some numbers symmetric in the indices k.Here we no longer assume that only a finite number of the coefficients c, t, and s are non-zero (as we did at the beginning of this section).Define . ., X n ) being the connected counterparts, respectively.Do note that while we list the variants of these formulas containing the t-parameters (in order for the maps/fully simple maps case to be clearly seen as a special case here), these t-parameters do not represent independent degrees of freedom w. r. t. the s-parameters, which is visible from the s-rewritten formulas.
For n = 2 and g > 0 we have: where by (119) we mean the expression one obtains from (119) for this n = 2 case, but instead of the summation over all 4 graphs there are in this case, we sum over only 3 of them, excluding the graph γ with E(γ) = {(1, 2)}.
Proof.Theorem 4.11 holds for the general W ∨ g,n and W g,n corresponding to M ∨ g,n and M g,n of Section 4.7 (in place of KP-type W ∨ g,n and W g,n ) in exactly the same form, and the proofs are completely analogous.Passing from W ∨ g,n to M ∨ g,n is then done analogously to how a similar thing was done in [BDBKS20a, Theorem 5.3 and Section 6].
Remark 4.15.Analogously, M g,n 's can be expressed in terms of M ∨ g,n 's in similar way to Theorem 4.14.The difference is as Theorem 4.11 differs from Theorem 4.10.One just has to take all formulas of Theorem 4.14 and then to replace ψ with −ψ and all ∨-d functions with non-∨-d ones and vice versa everywhere; this follows from the fact that D −1 ψ = D −ψ .We do not list explicit formulas here for brevity.
Example 4.16.In the case (g, n) = (0, 3), applying (X 1 X 2 X 3 ∂ X 1 ∂ X 2 ∂ X 3 ) −1 to both sides of formulas for general W 0,3 and (w 1 w 2 w 3 ∂ w 1 ∂ w 2 ∂ w 3 ) −1 to both sides of formulas for general W ∨ 0,3 (formulas for general W 0,3 and W ∨ 0,3 are analogous to the ones in Section 4.4), we obtain Here The integration constant ψ 0 (0) is computed from the condition that both sides should vanish at the origin, see [BDBKS20a] for more details on the computation of this kind of constants.

Proof of topological recursion for fully simple maps
In this section we prove Theorem 3.4.Starting from this moment and up to the end of the paper we work only with a special case of fully simple maps, though, when possible, we still write more general formulas in the intermediate computations.So, from now on, as in Section 3, we assume that φ(y) = 1 + y, ψ(y) = log(1 + y), the functions W g,n (X 1 , . . ., X n ) are the corresponding n-point functions for maps, and we use that these functions are rational functions on CP 1 in the coordinates z 1 , . . ., z n , X i = X(z i ), with the coefficients depending on t-parameters, and with known singularities.Furthermore, they satisfy the topological recursion.
An immediate observation that follows from Theorem 4.11 and topological recursion for the ordinary maps is that W ∨ g,n (w 1 , . . ., w n ) are also rational functions on CP 1 in the coordinates z 1 , . . ., z n , w i = w(z i ) (cf.Corollary 4.12).5.1.Loop equations.In this section we prove the loop equations (the blobbed topological recursion) for the fully simple maps.The way we present it is a bit streamlined and shortened version of the argument in [BDBKS20a, Section 2], and it is heavily based on op.cit., so we skip here many subtleties explained there in detail.We use the following notation for operators on the bosonic Fock space: Êk,k ; (138) Using inclusion-exclusion procedure as described in Section 2, we also consider the connected versions of these VEVs denoted by W ∨ n .Let W ∨ g,n := [ 2g−2+n ]W ∨ n .Lemma 5.2 (See [BDBKS20b]).We have: So, in order to proof the linear and quadratic loop equations it is sufficient to prove that the corresponding coefficients of W ∨ g,n are rational functions in z 1 , w 1 = w(z 1 ), whose polar parts at the critical points of w are odd with respect to the respective deck transformations.We can show this via deriving explicit closed formulas for W ∨ g,n .To this end, we obtain the following straightforward generalisation of Theorem 4.11.
Proof.We compute W ∨ g,n in a closed form applying the techniques developed in [BDBKS20b], see also Section 4.5.From [BDBKS20b, Proof of Proposition 2.26] we have where log φ(y) = ψ(y) − u S( ∂ y )e uy .This allows to apply directly the same computations as in Section 4.5, which leads to the formulas stated in this lemma.
Corollary 5.4.The linear and quadratic loop equation hold for fully simple maps.
Proof.Indeed, the formulas that we obtain in Lemma 5.3 manifestly show that the coefficients of the expansion in u of W ∨ g,n are rational functions on CP 1 , whose singularities in z 1 at the critical points of w 1 = w(z 1 ) are generated by a finite iterative application of w 1 ∂ w 1 to rational functions locally holomorphic at the respective critical points.By [BDBKS20b, Proposition 2.9 and 2.12], this property implies the quadratic and linear loop equations.5.2.Projection property.We are going to closely follow [BDBKS20b,Sections 3 & 4], though there are some new effects that we have to take into account.Recall from [BDBKS20b] the definition of the space Θ n : Definition 5.5.The space Θ (which we denote by Θ n , n ≥ 1, when we want to stress the number of variables) is defined as the linear span of functions of the form n i=1 f i (z i ), where each f i (z i ) • is a rational function on the Riemann sphere; • has poles only at the zeroes of dw(z) (which we denote by p 1 , . . ., p N ); • its principal part at p k , k = 1, . . ., N , is odd with respect to the corresponding deck transformation, that is, In order to prove the projection property, we need to prove that for 2g − 2 + n > 0 we have M ∨ g,n ∈ Θ n [BDBKS20b, Proposition 3.9].Consider the statement of Theorem 4.14 specified to fully simple maps expressions in terms of maps, as defined in Section 3. From Equations ( 119), (131), and (132) specified to this case we see that for 2g − 2 + n > 0 every M ∨ g,n is a rational function in z 1 , . . ., z n .Indeed, all M g,n (without " ∨ ", the n-point functions for maps) entering the respective formulas for M ∨ g,n are rational functions in z 1 , . . ., z n (as implied by the topological recursion for maps), except for the M 0,1 and M 0,2 cases.But M 0,1 itself does not enter the formulas (119), (131), and (132) for M ∨ g,n , we only use W 0,1 , which is rational, and M 0,2 only appears with at least one derivative taken, which is also a global rational function.From the structure of the aforementioned formulas of Theorem 4.14 we also immediately see that M ∨ g,n can have poles only at the following points: • At the zeroes of Q(X(z)) which are the same as the zeroes of dw(z).These are the expected poles of M ∨ g,n which is fine for our purpose of proving M ∨ g,n ∈ Θ n .• At z = ±1, since the functions M g,n (for 2g − 2 + n > 0), entering the expression for wgt(e), have poles at these points (and only at these points, as it follows from the topological recursion for maps).• At z such that y(z) = −1, since they appear in L r .
• At z = 0 and z = ∞, since the derivatives of y(z) = W 0,1 (X(z)) can poles at these points.
Let us prove that all these poles, except the ones at the zeroes of Q(X(z)), actually get cancelled.
Lemma 5.6.For 2g − 2 + n > 0, M ∨ g,n (w(z 1 ), . . ., w(z n )) has no poles at z 1 = ±1 and z 1 = 0. Proof.As mentioned above, Theorem 4.14 implies that for 2g − 2 + n > 0 every n-point function M ∨ g,n (w(z 1 ), . . ., w(z n )) is a rational function in z 1 , . . ., z n , also depending on the t-variables.Consider the expansion of M ∨ g,n in the t-variables.If M ∨ g,n had a pole at, say, z 1 = 1, then at least one of the coefficients [t a 1 • • • t a k ]M ∨ g,n would have such a pole as well (as a function in z 1 , . . ., z n ).This means that it is enough to prove that ∀k ∈ Z ≥0 ∀a 1 , . . ., a k ∈ Z >0 the following expression J m j P j,m j (z j ) where P j,m j (z j ) are some polynomials in z j , is a polynomial in z 1 , . . ., z n , this would imply that | t=0 is a polynomial too.The appearance of the polynomials P j,m j is due to the fact that, from (36), w(z) is a polynomial in z which also depends on the t-variables, and thus some of the t-derivatives after applying the Leibniz rule will act on the w's, but they will only produce polynomials in the respective z-variables.
We have J m j P j,m j (z j ) The infinite sum in r becomes finite in the second line since the r-th derivative acts on a polynomial of degree a.Thus D −1 J a D can be represented as a finite sum of expressions of the form where R( ) is some polynomial in and α i , β j ∈ Z >0 .This implies that the whole expression (155) is a finite sum of expressions of the form where R( ) is some polynomial in .But a VEV (159) is not equal to zero if and only if the numbers (i 1 , . . ., i k ) perfectly split into pairs (i, −i).Since there is only a finite number of J 2 's and a finite number of J −j 's, j = 2, j > 0, inside (158), only a finite number of terms one gets after expanding all brackets in (158) are non-vanishing.
Since all these terms are polynomial in z 1 , . . ., z n , the whole expression is polynomial, and thus all (∂ ta 1 • • • ∂ ta k M ∨ g,n )| t=0 are polynomial as well.This, as mentioned above, implies that all M ∨ g,n (w(z 1 ), . . ., w(z n )) have no poles at z 1 = ±1 or z 1 = 0.
Remark 5.7.Note that the argument in the proof of the preceding lemma does not work for poles at points with coordinates depending on t.
Proof.Follows from Theorem 4.14 and Lemmas 5.6, 5.8, and 5.9, taking into account that M g,n is symmetric in all arguments.
As we mentioned above, this Corollary implies the projection property, and thus concludes the proof of Theorem 3.4.