The planar Ising model and total positivity

A matrix is called totally positive (resp. totally nonnegative) if all its minors are positive (resp. nonnegative). Consider the Ising model with free boundary conditions and no external field on a planar graph $G$. Let $a_1,\dots,a_k,b_k,\dots,b_1$ be vertices placed in a counterclockwise order on the outer face of $G$. We show that the $k\times k$ matrix of the two-point spin correlation functions \[ M_{i,j} = \langle \sigma_{a_i} \sigma_{b_j} \rangle \] is totally nonnegative. Moreover, $\det M>0$ if and only if there exist $k$ pairwise vertex-disjoint paths that connect $a_i$ with $b_i$. We also compute the scaling limit at criticality of the probability that there are $k$ parallel and disjoint connections between $a_i$ and $b_i$ in the double random current model. Our results are based on a new distributional relation between double random currents and random alternating flows of Talaska.


Introduction
The Ising model was introduced by Lenz with the intention to describe the behaviour of ferromagnets, and was first solved in dimension 1 by Ising [19]. Peierls later showed that the model does undergo a phase transition in dimensions 2 or more [32], and it has been since the subject of extensive study both in the physics and mathematics literature. Notable results in the planar case include the exact solution obtained by Onsager [31] and Yang [38], and the recent breakthrough of Smirnov et al. showing conformal invariance in the critical scaling limit [7,8,17,18,36].
A seemingly unrelated notion is that of totally positive matrices characterized by having all their minors positive. They appear in various areas of mathematics and physics including oscillations in mechanical systems [12,13] (which was the original motivation to study them), stochastic processes and statistical mechanics [9,11,22], quantum groups [28][29][30], and algebraic geometry [33,34]. Some of their fundamental properties include the simplicity and positivity of the spectrum obtained by Gantmacher and Krein [12], and the variation diminishing property discovered by Shoenberg [35] which says that the number of sign changes in a vector does not increase after multiplying by a totally positive matrix.
In this article we identify total positivity in the planar Ising model. Our results on the Ising boundary two-point correlation functions are analogous to the results of Fomin [11] on the walk matrices of random walks on planar graphs. Indeed, the walk matrix can be interpreted as the two-point correlation function matrix of another very well known ferromagnetic spin system -the discrete Gaussian free field. Furthermore, Fomin provides an interpretation of the determinants of walk matrices in terms of probabilities of non-intersection events involving loop-erased walks of Lawler [25]. In our setting the relevant events concern the double random current model. The random current model is derived from the power series expansion of the Ising model partition function. It was introduced by Griffiths, Hurst and Sherman [15], and was later used by Aizenman et al. [1][2][3] to obtain a detailed description of the behaviour of the Ising model on Z d . The model has recently received revived attention from the mathematical community. The most notable example is the result of Aizenman, Duminil-Copin and Sidoravicius [4] who studied percolation properties of double random currents to show continuity of magnetization for a wide range of Ising models on Z d (including the d = 3 case). Their argument was later generalized by Björnberg to the setting of quantum Ising models [5]. Also, a new distributional relation between random currents, Bernoulli percolation and the FK-Ising model was discovered by Lupu and Werner [27]. One of the main tools used to study the random current model is the switching lemma [15], and our result may be thought of as its planar generalization (see Example 2.2). For a recent overview of the applications of the random current model, see [10].
Since the work of Groeneveld, Boel and Kasteleyn [16], the boundary Ising correlation functions have been known to satisfy exact Pfaffian relations. We provide an alternative proof of this fact using the expansion of the Pfaffian as a sum of determinants (see Lemma 5.6). Our results are hence a refinement of those in [16] in that we relate each of these determinants to an explicit event in the double random current model.
A special property of the (dis-)connection events appearing in our results is that even though they are non-local, i.e., they depend on a macroscopic (in terms of the size of the graph) number of edge variables, their probabilities are simple functions of the boundary measurements which are defined as expectations of local variables. This in particular implies that these probabilities do not depend on the structure of the graph as long as the boundary measurements are preserved. This phenomenon also exists in uniform groves and double dimers as was discovered by Kenyon and Wilson [23,24]. Moreover, the authors proved that the probability of seeing any type of partition of the boundary vertices induced by cluster connectivities in these models is a homogenous multi-linear polynomial in the boundary measurements.
We arrive at the total positivity of the Ising boundary two-point functions by representing them in terms of alternating flows of Talaska which satisfy total positivity [37]. They, in turn, appear in the combinatorial study of the totally nonnegative Grassmannian initiated by Postnikov [33]. The interpretation of the determinants of the two-point functions in terms of random current probabilities is achieved by a new distributional relation between double random currents and random alternating flows.
This article is organized as follows: The next section introduces basic notation and presents the main results. Section 3 gives a distributional identity for double random currents, and Section 4 provides a closely related identity for random alternating flows. The relationship between these two, together with the total positivity of alternating flows, is the basis for our main results, whose proofs are given in Section 5.

Main results
Let G = (V, E) be a finite connected planar graph. For positive coupling constants J : E → (0, ∞), we consider the Ising model on G with free boundary conditions and no external field, i.e., a probability measure on the space of spin configurations {−1, 1} V given by is the partition function. Since the coupling constants are positive, the model is ferromagnetic, i.e., it assigns larger probability to configurations where more pairs of adjacent spins assume the same value. For u, v ∈ V , the two-point spin correlation function is defined to be the expectation A classical argument says that in a ferromagnetic spin system, all two-point functions are positive (see Lemma 5.1). Let W = {w 1 , w 2 , . . . , w n } be the set of vertices on the outer face of G listed counterclockwise, and let W • ∪ W • = W be a partition of W into two sets (one of them possibly empty). We will refer to W as the boundary vertices and for A ⊆ W , we will write For two natural numbers i, j, we define I i,j to be the set of numbers strictly between i and j, e.g. I 1,1 = ∅, and I 1,3 = I 3,1 = {2}. The following result yields positivity of determinants of matrices whose entries are, up to a sign, the boundary two-point spin correlation functions.
Then, for any B ⊂ W with |B| = k, where N A,B is the k × k submatrix of N A with columns indexed by B. Moreover, det N A,B > 0 if and only if there exist k pairwise edge-disjoint (possibly empty) directed paths in G such that each of them starts in A and ends in B, and if two paths meet at a vertex, then their edges alternate in orientation around it (edge oriented towards or away from the vertex). Here, we assume that an empty path joining represented by a counterclockwise loop (resp. clockwise loop) attached to v within the outer face.
We note that the choice of W • and W • determines both the sign factors appearing in the definition of N A , and the interpretation of the associated determinants in terms of alternating flows (see Lemma 5.5). This is inherited from the results of [37] through the construction of Section 4 (see Figure 2).
Indeed, assume that a, b, c are ordered counterclockwise, a, b ∈ W • , c ∈ W • , and take A, B = {a, b, c}. We have and by Theorem 2.1, which gives the second inequality. The inequality is strict since we can take empty paths connecting the vertices with themselves. To obtain the first inequality, we use the second one together with the Griffiths inequality σ a σ b ≥ σ a σ c σ c σ b [14].
In the special case when A and B form disjoint contiguous sets of boundary vertices, we obtain the following total positivity property of the boundary two-point spin correlation functions with no additional signs. Remark 1. One can prove that if A and B are as above, then det M A,B = det N A,B by showing that the additional signs in N A,B make the same sign contribution to the determinant as the reverse order on columns in M A,B . This is evident in the following expansion of these determinants. Let A, B be any subsets of W of equal cardinality, and let π : A → B be a bijection. One can interpret π as a pairing of the disjoint union A B, i.e., a partition of A B into pairs {a, π(a)}. One can then think of a diagrammatic representation of π where points representing A and B are placed in the corresponding order on the boundary of a disk, and straight line segments connect the points according to π. Here, for each v ∈ A • ∩ B • (resp. each v ∈ A • ∩ B • ), two copies of v are placed on the circle, and the one corresponding to a point in A comes immediately after (resp. before) the one corresponding to a point in B in the counterclockwise order. We define xing(π) to be the number of crossings between the line segments. It is easy to see that when A, B are as in Corollary 2. Our second main result provides an interpretation of these determinants in terms of random currents. A current on G is a function n : E → {0, 1, 2, . . . }. By ∂n we denote the set of sources of n, i.e., vertices v such The weight of a current n is defined by and the random current probability measure with boundary conditions A is given by where Z A curr = n∈Ω A w(n) is the partition function. Note that if n 1 ∈ Ω A and n 2 ∈ Ω ∅ , then n 1 + n 2 ∈ Ω A . The double random current probability measure P A d-curr with boundary conditions A is defined to be the measure of the sum of two independent random currents The blue edges represent odd values and the red edges represent even values with A and ∅ boundary conditions respectively: For u, v ∈ V and a current n, we will write u n ← → v if u and v are connected in G by a path of edges with non-zero values of n, and we will write u n ← → v otherwise. Let A and B be contiguous sets of boundary vertices as in Corollary 2.2. We define the event of having parallel and disjoint connections between A and B (see Figure 1) by As a consequence of the proof of Theorem 2.1 and Corollary 2.2, we can compute the probability of P A,B under the double random current measure: Theorem 2.3. Let A and B be contiguous sets of boundary vertices as in Corollary 2.2, and let v 1 , v 2 , . . . , v 2k be a counterclockwise order on A ∪ B. Consider the 2k × 2k skew-symmetric matrix satisfying Then, where Pf denotes the Pfaffian of a skew-symmetric matrix.
Example 2.2. We consider the simplest non-trivial case of Theorem 2.3 when k = 2. To this end, let S = {a, b, c, d} ⊆ W be ordered counterclockwise, and let X = {n ∈ Ω S | a n ← → b n ← → c n ← → d}. Note that by planarity of G, and the fact that each connected component of n contains an even number of vertices in ∂n, the complement of X in Ω S is P {a,b},{c,d} ∪ P {a,d},{b,c} .
We note that these formulas follow from the switching lemma of Griffiths, Hurst and Sherman [15] (see e.g. [4] for a modern treatment of the lemma). The statement of Theorem 2.3 for k > 2 does not however seem to be a direct consequence of this lemma.
Remark 2. For future reference, recall that the Pfaffian of the skew-symmetric matrix K A∪B is the square root of its determinant, and it is a well known fact that it can be written as where the sum is over all pairings of A ∪ B, and where xing is defined as in (2.2).
Our last main result concerns the scaling limit at criticality of the parallel connection probability in double random currents. The proof relies on the computation of Hongler [17] of the scaling limit of the boundary two-point functions themselves. Analogous and more general results were obtained by Kenyon and Wilson [24] for the double dimer model, multichordal loop erased walk, and grove Peano curves.
Theorem 2.4. Let D be a bounded finitely-connected domain in the complex plane with a piecewise C 1 boundary. Let ∂ s D be the straight part of the boundary, i.e., the part composed of intervals parallel either to the real or imaginary axis.

Random currents
In this section G = (V, E) is a finite (not necessarily planar) graph. Note that the definitions of the Ising model and the random current model generalize verbatim to arbitrary finite graphs.
Let E A be the collection of sets of edges for which A is the set of vertices with odd degree in the induced subgraph. One can see that Let x e = tanh J e and y e = (cosh J e ) −1 . The next result describes the measure P A curr on Γ A induced from the random current measure. Lemma 3.1. The probability of ω ∈ Γ A induced from the random current measure is given by For ω ⊆ E, let E ∅ (ω) = E ∅ ∩ {ω | ω ⊆ ω}. The main result of this section gives a formula for the probability measure P A d-curr on Γ A induced from the double random current measure.

Random alternating flows
In this section we assume that G is planar, and we explain how the double random current measure is related to a measure on alternating flows. To this end, we define a directed modification G = (V ∪ W + ∪ W − , E) of G as follows. Each edge e ∈ E is replaced by three directed edges e ∈ E: one middle edge e m , and two side edges e s1 , e s2 (see Figure 2). The side edges lie on opposite sides of e m and have the opposite orientation to e m . The orientation of each middle edge is chosen arbitrarily, and the edge weights are given by (4.1) Moreover, for each w ∈ W , two vertices w + ∈ W + and w − ∈ W − , and two directed edges (w, w − ), (w + , w) ∈ E are placed in the external face of G so that w − becomes a sink and w + becomes a source. The weights of these edges are set to 1. The vertices are placed in such a way that w − is comes immediately before (resp. after) w + if w ∈ W • (resp. if w ∈ W • ) in the counterclockwise order around the external face of G (see Figure 2). A flow on G is a set of edges F ⊆ E such that each vertex has the same number of ingoing and outgoing edges in F . An alternating flow is a flow such that for each v ∈ V , the edges of the flow alternate in orientation around v (edge oriented towards v or away from v). For U ⊆ W , we will write U + ⊆ W + and U − ⊆ W − for the the corresponding sets of sources and sinks in G. For two (possibly intersecting) sets A, B ⊂ W of equal cardinality, let where V (F ) is the set of vertices incident on at least one edge of F . Following Talaska [37], we define the weight of an alternating flow F ∈ F A,B by and we consider the probability measure on alternating flows with boundary conditions A, B given by where Z A,B a-flow = F ∈F A,B w(F ) is the partition function. Note that in [37] general oriented planar graphs are considered, and the connection with double random currents described in this section is realized by our particular choice of G and its edge weights.
There are four different types of local (interior) edge configurations in an alternating flow F on G according to the total amount of flow at the endpoints (the number of incoming edges minus the number of outgoing edges) and the orientation of the edges (see Figure 3). Note that it is not possible that F contains e R1 and e R2 but not e B since then the alternating condition is violated. Also note that there are three different configurations of type (1a) which are indistinguishable from the point of view of alternating With each F ∈ F A,B , as in Section 3, we associate a pair of sets ω(F ) = (ω 1 (F ), ω 2 (F )), where ω 1 (F ) is the set of edges e ∈ E such that the local configuration of F at e is of type (1a) or (1b), and where ω 2 (F ) is the set of edges e ∈ E with the local configuration of type (2a) or (2b). We denote by Γ A,B the image of F A,B under this map. Note that ω 1 (F ) ∈ E A B since, by the flow condition, one can split ω 1 (F ) into a sourceless part in E ∅ and a collection of |A| edge-disjoint directed paths starting at A and ending at B. In particular, every v ∈ A ∩ B is the starting and ending point of exactly one such path, and hence, the degree of ω 1 (F ) at v is even. This means that Γ A,B ⊆ Γ A B , and hence the map above induces a probability measure P A,B a-flow on Γ A B , which is supported on Γ A,B . The main result of this section casts this measure into a form related to that of the induced double random current measure from Theorem 3.2.
Theorem 4.1. Let A, B ⊂ W be such that |A| = |B|, and let G be one of the directed modifications of G described above. Let ω ∈ Γ A,B , and let k (ω) be the number of connected components of ω that contain a vertex in A ∪ B. Then, the probability of ω induced from the random alternating flow measure is given by  Let ω ⊆ E be such that E ∅ (ω) is nonempty. Then, Proof. Consider a maximal spanning forest T ⊆ ω of ω, and note that |ω \ T | = |ω| − |V (ω)| + k(ω). It is hence enough to construct a bijection between E ∅ (ω) and the set of subsets of ω \ T . To this end, to each e ∈ ω \ T we assign the unique cycle C e ⊆ (ω \ T ) ∪ {e}. Note that C e ∈ E ∅ (ω). The bijection is given by assigning to each ω ∈ E ∅ (ω) the set ω ∩ (ω \ T ), and its inverse by assigning to each {e 1 , . . . , e l } ⊆ ω \ T the set C e 1 · · · C e l ∈ E ∅ (ω).
Proof of Theorem 4.1. Letω be a modification of ω seen as a subset of E where each edge in ω 2 is replaced by two parallel edges. By an alternating orientation ofω we mean an assignment of orientations to the edges ofω such that for each v ∈ V , the edges alternate in orientation around v. Let F be such that ω(F ) = ω, and letF be its equivalence class under identifying the three local edge configurations of type (1a). Note that such equivalence classes are in one-to-one correspondence with alternating orientations ofω. We claim that the number of such alternating orientations is Indeed, consider a connected component κ ofω that does not contain a vertex in A∪B. We claim that κ has exactly 2 different alternating orientations. To see this, consider the outer boundary ∂ out κ of κ, i.e., the set of edges in κ incident on the unbounded face of κ. Because of the alternating condition, the choice of the orientation for one edge determines the orientation of all other edges in ∂ out κ. Moreover, there are no conflicts of orientations since each vertex of κ has even degree, and hence ∂ out κ can be deformed to a cycle by splitting vertices incident on more than 2 edges from ∂ out κ. Then, the orientations of all edges agree with the clockwise or anticlockwise order on the cycle. After orienting ∂ out κ, one has to consider all connected components of κ \ ∂ out κ, and repeat the reasoning with the only difference being that there is no more freedom of choice of the orientation (if ∂ out κ was oriented clockwise (resp. counterclockwise), then all outer boundaries of the connected components of κ \ ∂ out κ have to be oriented counterclockwise (resp. clockwise)). One repeats this procedure until all edges of κ are oriented. On the other hand, there is no freedom of orientation for components containing a vertex in A ∪ B since each such component has to be oriented from a vertex in A to a vertex in B. Therefore (4.3) holds true. We now turn to the total weight w(F ) of each equivalence classF , which we define to be the sum of weights of all flows inF . By (4.1), the total multiplicative contribution to w(F ) of configurations of type (1a) is where we took the factor 2 # edges and did not take the factor 2 |A|−# vertices from (4.2) into account. This contribution is therefore equal to the contribution of a configuration of type (1b). The contributions of configurations of type (2a) and (2b) also agree and are equal to Hence, by (4.2), we can write Note that the map ω is constant on each equivalence classF , and hence, with a slight abuse of notation, we can write ω(F ) for the value of ω evaluated at any representative ofF . Combining all the previous observations, and using the definition of P A,B a-flow , we can write P where the second to last equality follows from (4.3), and the last one from Lemma 4.2.
In two special cases the measures induced from double random currents and alternating flows are the same. Proof. By Lemma 5.4, we have that Γ ∅,∅ = Γ ∅ and Γ {a},{b} = Γ {a,b} , and the statement follows from Theorems 3.2 and 4.1.

Proofs of main results
We need to state a few necessary lemmas. The first one goes back to the work of Griffiths, Hurst and Sherman [15], and we give a proof for completeness. We will write Z a,b = Z {a,b} , and we define Z a,b curr = Z ∅ curr for a = b.
Proof. If a = b, then the equality is trivial. Otherwise, for a vertex v and a current n, we define n v = u: {u,v}∈E n {u,v} , and we have The second to last equality holds true since the only currents that survive the summation over the symmetric set {−1, 1} |V | are the ones for which the exponent of σ v is even at every vertex.
The next lemma expresses the two-point spin correlation function as a ratio of partition functions of alternating flows. Recall that we defined Γ A,B ⊆ Γ A B to be the image of F A,B under the map ω from Section 4.
The next lemma describes an alternating property of sources and sinks in a connected component of an alternating flow. Proof. Note that κ is an alternating flow itself. Take a source vertex v ∈ V (κ)∩A + , and traverse the edges of the external face of κ in a counterclockwise order. Since at each vertex in V that you visit, you take the rightmost possible turn, and since κ is alternating, all the directed edges are aligned with the direction of traversal until you encounter the consecutive vertex in v ∈ V (κ) ∩ (A + ∪ B − ). Since v is either a sink or a source, and since there exists an edge directed towards v , it must be a sink. An analogous argument can be made when starting at v but this time the edges are directed against the direction of traversal. Hence, the next vertex encountered in V (κ) ∩ (A + ∪ B − ) is again a source, and the lemma is proved.
The following is the reverse of the lemma above.
Lemma 5.4. Let ω ∈ Γ A B be such that for each connected component κ of ω, the vertices in A + ∪ B − that are adjacent to V (κ) alternate between the sources in A + and the sinks in B − as one goes around the external face. Then, there exists F ∈ F A,B such that ω(F ) = ω.
Proof. Fix a connected component κ of ω. Similarly to the proof of Theorem 4.1, we consider a graphκ where each edge of κ ∩ ω 2 is replaced by two parallel edges, and moreover, the edges connecting each vertex in V (κ) ∩ W to the corresponding vertices in A + ∪ B − are added. It is now enough to show that there exists an alternating orientation ofκ where each vertex in V (κ) ∩ A + becomes a source and each vertex in V (κ) ∩ B − becomes a sink. By the assumption on κ, we can add (in one of two possible ways) |V (κ) ∩ (A + ∪ B − )|/2 vertex-disjoint edges connecting in pairs consecutive vertices in V (κ) ∩ A + and V (κ) ∩ B − . We call the resulting graphκ . It is now enough to construct an alternating orientation ofκ such that each of the additional edges is directed from a vertex in V (κ) ∩ B − to a vertex in V (κ) ∩ A + , and then restrict the orientation toκ. To this end, note that each vertex ofκ has even degree. Therefore, as in the proof Theorem 4.1, the outer boundary ofκ can be deformed to a cycle, and can be directed clockwise or counterclockwise so that the additional edges are directed properly. We can then orient the rest ofκ consistently as in Theorem 4.1, and the lemma is proved.
The next lemma is an adaptation of a result of [37]. Proof. The proof is a matter of translation of the results of [37] to our setting.
To this end, consider the boundary measurement matrix M from Definition 2.4 of [37] defined for G with weights as in Section 4. By Corollary 5.3 of [37], the entry corresponding to source a + and sink b − is equal to Z a,b a-flow /Z ∅ a-flow , and hence, by Lemma 5.2, to σ a σ b . Therefore, the boundary measurement matrix for G is the matrix of Ising boundary spin correlation functions.
By Corollary 4.3 of [37], it is hence enough to check that the signs in N A agree with those in the matrix in Corollary 4.3 of [37] where only the columns corresponding to sinks are considered. In [37], the sign of the entry corresponding to source a + and sink b − is negative if the number of sources strictly between a + and b − in a fixed clockwise order is odd, and it is positive otherwise. By our choice, for every w ∈ W • (resp. w ∈ W • ), the sink w − immediately precedes (resp. succeeds) the source w + in the counterclockwise order. One can easily check that as a result, s(i, j) from the definition of N A,B counts the number of sources strictly between the source w + l i ∈ A + and the sink w − j ∈ B − . Therefore, the signs in the definition of N A agree with those in [37] (up to changing a clockwise to a counterclockwise order). Hence, the result follows from Corollary 4.3 of [37].
Remark 3. The proof of Corollary 4.3 of [37] uses the signed walk interpretation of the boundary measurement matrix of Postnikov [33]. One can compare this with the Kac-Ward representation of the planar Ising model [20], where the Ising boundary two-point functions can be expressed as partition functions of signed non-backtracking walks on the undirected graph G (see e.g. [21], or [26] for a concise proof of the Kac-Ward formula).
We are now ready to prove our first two main results.
Proof of Theorem 2.1. It is a direct consequence of Lemma 5.5. The interpretation of empty paths as counterclockwise or clockwise loops follows from the way the sources and sinks are placed around the external face (see Section 4). Before proving the rest of our main results, we will need a classical Pfaffian formula of Groeneveld, Boel and Kasteleyn [16]. We present here a different proof involving the connection between double random currents and alternating flows. For yet another proof involving the dimer model, see the recent treatment of the combinatorics of the planar Ising model [6]. Recall that a bijection between A and B can be thought of as a pairing of A ∪ B, i.e., a partition of A ∪ B into pairs {a, π(a)}, a ∈ A . Note that each pairing π of A ∪ B appears in a sum as above for exactly 2 |A| choices of A . Indeed, for each of the |A| pairs in π, we can choose one vertex that will belong to A . Hence, by (2.4) and by Lemma 5.5, we have Recall that Γ A ,B ⊂ Γ A∪B is the image of F A ,B under the map ω from Section 4. We claim that each ω ∈ Γ A∪B belongs to Γ A ,B for exactly 2 k where the second to last equality holds true since, by the definition of P A,B , k (ω) = |A| for every ω ∈ P A,B . Moreover, since P

A,B
a-flow is supported on Γ A,B , to justify the last equality we have to show that P A,B = Γ A,B . To this end, note that by Lemma 5.3, for each F ∈ F A,B , we have that ω(F ) ∈ P A,B , where ω denotes the map from Section 4. Indeed, for contiguous sets A and B, there is only one way of distributing the sources A + and sinks B − between the connected components of an alternating flow in such a way that they alternate around the external face for each component. This means that each connected component of F connects a single point in A to a single point in B. On the other hand, by Lemma 5.4, for each ω ∈ P A,B , there exists F ∈ F A,B such that ω(F ) = ω. Therefore, P A,B = Γ A,B and (5.2) holds true. Furthermore, using Lemma 5.5 and 5.6, we get where we used Corollary 4.3 to obtain that Z ∅ a-flow = (Z ∅ curr ) 2 . Together with (5.2), this finishes the proof.
Proof of Theorem 2.4. Hongler in his PhD thesis [17] showed that in the setting of Theorem 2.4, for any a ∈ A and b ∈ B, the following limit exists The result now follows from Theorem 2.3 since, by the expansions of the determinant and Pfaffian (2.1) and (2.4), the normalization factors from (5.3), the constants 2( √ 2 + 1)/π, and the terms containing derivatives of ϕ from (5.4) cancel out.