A solution space for a system of nullstate partial differential equations 1
Abstract
This article is the first of four that completely and rigorously characterize a solution space for a homogeneous system of linear partial differential equations (PDEs) in variables that arises in conformal field theory (CFT) and multiple SchrammLöwner evolution (SLE). In CFT, these are nullstate equations and conformal Ward identities. They govern partition functions for the continuum limit of a statistical cluster or loopgas model, such as percolation, or more generally the Potts models and O models, at the statistical mechanical critical point. (SLE partition functions also satisfy these equations.) For such a lattice model in a polygon with its sides exhibiting a free/fixed sidealternating boundary condition , this partition function is proportional to the CFT correlation function
where the are the vertices of and where is a oneleg corner operator. (Partition functions for “crossing events” in which clusters join the fixed sides of in some specified connectivity are linear combinations of such correlation functions.) When conformally mapped onto the upper halfplane, methods of CFT show that this correlation function satisfies the system of PDEs that we consider.
In this first article, we use methods of analysis to prove that the dimension of this solution space is no more than , the th Catalan number. While our motivations are based in CFT, our proofs are completely rigorous. This proof is contained entirely within this article, except for the proof of lemma 14, which constitutes the second article [26]. In the third article [27], we use the results of this article to prove that the solution space of this system of PDEs has dimension and is spanned by solutions constructed with the CFT Coulomb gas (contour integral) formalism. In the fourth article [28], we prove further CFTrelated properties about these solutions, some useful for calculating clustercrossing probabilities of critical lattice models in polygons.
I Introduction
We consider critical bond percolation on a very fine square lattice inside a rectangle with wired (or fixed) left and right sides (i.e., all bonds are activated on these sides) and free top and bottom sides (i.e., we do not condition the state of any of the bonds on these sides). In [1], J. Cardy used conformal field theory (CFT) [2]; [3]; [4] methods to argue that, at the critical point and in the continuum limit, the partition function for this system is proportional to the CFT correlation function
(1) 
where is the th vertex of and is a CFT oneleg corner operator [5]; [6]; [7]; [8]; [9]; [10] that implements the boundary condition change (BCC) from free to fixed [11]; [5]; [1] at this vertex. The essence of this argument supposed the emergence of conformal invariance at the critical point for bond percolation in the continuum limit, a feature that was previously observed in computer simulations [12]. By considering the limit of a particular combination of certain state random cluster model partition functions given by (1), Cardy then predicted a formula for the probability that the wired sides of are joined by a cluster of activated bonds (figure 1). His prediction, called Cardy’s formula, is [1]
(2) 
Here, corresponds onetoone with the aspect ratio of the rectangle via the second equation in (2), with the complete elliptic function of the first kind [13]. Computer simulations [12]; [14] have numerically verified this prediction (2), thus giving very strong evidence for the presence of conformal symmetry in the continuum limit of critical percolation. Other simulations [15] consistently suggest that many observables, such as the probability of the leftright clustercrossing event, common to different homogeneous models of critical percolation (e.g., site vs. bond percolation and percolation on different regular lattices) converge to the same value in the continuum limit, a phenomenon called universality. Later, S. Smirnov rigorously proved Cardy’s formula for site percolation on the triangular lattice [16]. Also after Cardy’s result (2), researchers have used CFT to predict other formulas involving critical percolation cluster crossings [17]; [18], densities [19]; [20]; [21]; [7], and pinch points [22].
The setup for Cardy’s formula has interesting generalizations that motivate the analysis presented in this article. Looking beyond rectangles, we may consider system domains that are evensided polygons , with the boundary condition (BC) alternating from wired to free to wired, etc., as we trace the boundary of from side to side. We call this a free/fixed sidealternating boundary condition (FFBC) (figure 2). And looking beyond percolation, we may consider other lattice models with critical points that have CFT descriptions in the continuum limit. These include the Potts model [23] and its close relative, the random cluster model [24]. If we enumerate the FFBC events and condition one of these systems to exhibit the th FFBC event on the boundary of , then we may adapt Cardy’s argument to predict that the conditioned partition function is proportional to the point CFT correlation function
(3) 
Here, is the th vertex of , and is a CFT oneleg corner operator [5]; [6]; [7]; [8]; [9]; [10] that implements the BCC from free to fixed [11]; [5]; [1] at this vertex (appendix A). If we condition the system to exhibit the th FFBC event, then Potts model spin clusters or FK clusters, anchor to the wired sides of and join these sides in some topological crossing configuration with some nontrivial probability. We call these boundary clusters. An induction argument [25] shows that there are such configurations (figure 3), with the th Catalan number given by
(4) 
Formulas for crossing probabilities, or probabilities of these crossing events, as functions of the shape of generalize Cardy’s formula (2), which corresponds to the case of critical percolation with . In [8], we use results from this article and its sequels [26]; [27]; [28] to predict some of these formulas, extending recent results on crossing probabilities for hexagons [30]; [29].
To calculate the point function (3), we conformally map onto the upper halfplane (figure 2). After we continuously extend it to the boundary of , this map also sends the vertices , onto real numbers , and it sends the oneleg corner operator hosted by the th vertex of to a oneleg boundary operator at [9]; [10]. In the Potts model (resp. random cluster model) [23]; [24], the oneleg boundary operator is a primary operator that belongs to the (resp. ) position of the Kac table [1]; [2]; [3]; [4]; [11]. (We discuss oneleg boundary operators further in appendix A.) Thus, the CFT nullstate condition implies that this halfplane version of (3) satisfies the system of nullstate partial differential equations (PDEs) [2]; [3]
(5) 
where the oneleg boundary weight is the conformal weight of the oneleg boundary operator and is given by [2]; [3]; [4] (appendix A)
(6) 
Here, is the central charge of the CFT, and it corresponds to the model under consideration. For example, corresponds to percolation [1], and corresponds to the Ising model (i.e., the twostate Potts model) and the twostate random cluster model [2]. Also, the sign to be used in (6) depends on the model. For example, we use the sign for the Potts model and the sign for the random cluster model.
Aside from the nullstate PDEs (5), any CFT correlation function must satisfy three conformal Ward identities [2]; [3]; [4]. For the halfplane version of the particular point function (3) above, these are
(7) 
If a function satisfies these PDEs (7), then it is covariant with respect to conformal bijections of the upper halfplane onto itself, with each coordinate having conformal weight . We elaborate on this in section I.1 below.
If , then it is easy to show that any solution to the system (5, 7) is of the form for some arbitrary constant . Thus, the rank (i.e., the dimension of the solution space) equals the first Catalan number, . If , then we may use the conformal Ward identities (7) to convert the system of four nullstate PDEs (5) into a single hypergeometric differential equation [2]. The general solution of this differential equation completely determines the solution space, so the rank of the system equals the second Catalan number, . (After setting , an appropriate boundary condition argument gives Cardy’s formula (2).) If , then a similar but more complicated argument [29] shows that the rank of the system equals the third Catalan number, , at least when . Beyond this, the need for linearly independent crossingprobability formulas suggests that the rank of the system is at least , but it does not apparently suggest that the rank is exactly. In spite of this, the Coulomb gas formalism [29]; [31]; [32] allows us to construct many explicit classical (in the sense of [33]) solutions of the system for any , a remarkable feat! Neither this article nor its first sequel [26] uses these solutions, but the latter sequels [27]; [28] do.
In addition to CFT, we may use multiple SLE [34]; [35]; [36]; [37]; [38], a generalization of SLE (SchrammLöwner evolution) [39]; [40]; [41], to study the continuum limit of a critical lattice model inside a polygon with an FFBC. As we use this approach, we forsake the boundary clusters and study their perimeters instead. These perimeters, called boundary arcs, are random fractal curves that fluctuate inside . Their law is conjectured, (and proven for some models in the case of (ordinary) SLE, see table 1), to be that of multiple SLE, a stochastic process that simultaneously grows fractal curves, one from each vertex, inside . These curves explore the interior of without crossing themselves or each other until they join to form distinct, noncrossing boundary arcs that connect the vertices of pairwise (figure 4) in a specified connectivity [30]; [35]. An induction argument [25] shows that these curves join in one of possible connectivities, called boundary arc connectivities [22] (figure 3). Furthermore, we identify each boundary arc connectivity with the particular clustercrossing event whose boundary arcs join in that connectivity.
Random walk or critical lattice model  Current status  
The looperased random walk [42]  2  proven [43]  
The selfavoiding random walk [44]  8/3  0  conjectured [45] 
Potts spin cluster perimeters [23]  3  1/2  proven [46] 
Potts spin cluster perimeters [23]  10/3  4/5  conjectured [47] 
Potts spin/FK cluster perimeters [23]; [24]  4  1  conjectured [47] 
The level line of a Gaussian free field [48]  4  1  proven [48] 
The harmonic explorer [48]  4  1  proven [48] 
Potts FK cluster perimeters [24]  24/5  4/5  conjectured [47] 
Potts FK cluster perimeters [24]  16/3  1/2  proven [46] 
Percolation and smartkinetic walks [49]; [50]  6  0  proven [51] 
Uniform spanning trees [43]  8  proven [43] 
Multiple SLE provides a different, rigorous approach to calculating some observables that may be predicted via CFT, and although these two approaches are fundamentally different, they are closely related [52]. Two entities determine the multipleSLE process [34]; [35]:

The first is stochastic: a collection of absolutely continuous martingales with zero crossvariation and total quadratic variation , with the SLE speed or parameter and the evolution time. The equation [52]
(8) relates a CFT of central charge (resp. ) to a multiple SLE with one of two possible speeds, one in the dilute phase , and one in the dense phase (resp. with one speed in the dilute phase) [40] of SLE. Further arguments provided in appendix A show that if we substitute (8) into (6), then we must use the (resp. ) sign in the dilute (resp. dense) phase, so [52]
(9) 
The second is deterministic: a nonzero function , which we call an partition function. (This is similar to but slightly different from the actual partition function of the critical system under consideration. See appendix A and [8].) The only condition imposed on is that it satisfies the system of nullstate PDEs (5) and the three conformal Ward identities (7) (in the classical sense of [33]) with given by (9), and that it never equals zero.
Because all boundary arcs have the statistics of SLE curves in the small regardless of our choice of SLE partition function, the partition function that we do use may only influence a largescale property of multiple SLE, such as the eventual pairwise connectivity of its curves in the longtime limit. Indeed, two multipleSLE processes whose curves are conditioned to join in different connectivities obey the same stochastic PDEs driven by the martingales of condition I. Because which SLE partition function to use for item II above is the only unspecified feature of these equations, we expect that this choice influences the eventual boundary arc connectivity.
This supposition naturally leads us to conjecture the rank of the system (5, 7) previously considered in our CFT approach above. As mentioned, there are possible boundary arc connectivities, which we enumerate one through . Thus, there must be at least one SLE partition function per connectivity that conditions the boundary arcs to join pairwise in that connectivity almost surely. But furthermore, if our SLE partition function does not influence any of the boundary arcs’ other largescale properties, then there may be at most one SLE partition function , called the th connectivity weight, that conditions the boundary arcs to join in, say, the th connectivity. If this is true, then we anticipate that the set is a basis for the solution space of the system (5, 7), and the rank of the system is therefore . Proving this last statement is one of the principal goals of this article and its sequels [26]; [27]; [28].
i.1 Objectives and organization
So far, we have used the application of the system (5, 7) to critical lattice models and multiple SLE to anticipate some of the properties of its solution space. In this section, we set the stage for our proof of some of these properties by declaring the goals, describing the organization, and establishing some notation conventions for this article and its sequels [26]; [27]; [28]. Inserting (9) in the system (5, 7) gives the nullstate PDEs
(10) 
with and (however we consider only in this article), and the three conformal Ward identities
(11) 
We call the th nullstate PDE among (5) the nullstate PDE centered on . Although this system (10, 11) arises in CFT in a way that is typically nonrigorous, our treatment of this system here and in [26]; [27]; [28] is completely rigorous. Before declaring what we intend to prove about this system of PDEs, we observe some important facts about it.

The subsystem of nullstate PDEs (10) is undefined on the locus of diagonal points in , or points with at least two of its coordinates equal. We let be the complement of the locus of diagonal points in . Then the diagonal points make up the boundary , and all together, they divide into connected components, each of the form
(12) for some permutation . By symmetry, it suffices to restrict the domain of our solutions to the component corresponding to the identity permutation . That is, we take whenever without loss of generality. In this article and its sequel [26], we refer to as a point in a component of and as the th coordinate of that point, but in the sequels [27]; [28], we refer to as a point.

The subsystem (10) is elliptic, so all of its solutions exhibit strong regularity. Indeed, after summing over all nullstate PDEs, we find that any solution satisfies a linear homogeneous strictly elliptic PDE whose coefficients are analytic in any connected component of . (In fact, the principal part of this PDE is simply the Laplacian.) It follows from the theorem of Hans Lewy [53] that all of its solutions are (real) analytic in any connected component of . We use this fact to exchange the order of integration and differentiation in many of the integral equations that we encounter here and in [26].

We may explicitly solve the conformal Ward identities (11) via the method of characteristics. It follows that any function that satisfies these identities must have the form
(13) where is any set of independent crossratios that we may form from , where is a (real) analytic function of , and where is any pairing (i.e., a permutation other than the identity with ) of the indices .

We suppose that is a Möbius transformation sending the upper halfplane onto itself, and we define and . Then the mapping defined by sends onto a possibly different connected component of . Because the crossratios , are invariant under , the right side of (13) evaluated at any is welldefined. If we enumerate the permutations in so , , are all of the components of that may be reached from by such a transformation , then we use (13) to extend to the function
(14) It is evident that because in (13) satisfies the system of PDEs (10, 11), must satisfy this system too on each component of in its domain. Now, it is easy to show that (14) transforms covariantly with respect to conformal bijections of the upper halfplane onto itself, with each of the independent variables having conformal weight (9). In other words, the functional equation (where )
(15) holds whenever is a Möbius transformation taking the upper halfplane onto itself. Such transformations are compositions of translation by , dilation by , and the inversion (all of which have positivevalued derivatives). Hence, is invariant as we translate the coordinates of by the same amount and is covariant with conformal weight (9) as we dilate all of them by the same factor or invert all of them. The first, second, and third Ward identities (11) (counting from the left) respectively induce these three properties.

We may directly compute the solution space for the system of PDEs (10, 11) with domain for [35].

In the case, we use the first conformal Ward identity of (11) (counting from the left) to reduce either PDE in (10) to a second order Euler differential equation in the one variable . The Euler equation has two characteristic powers (given in (29) below), and the second conformal Ward identity of (11) permits only the power . Thus, the solution space is
(16) It is easy to show that the elements of satisfy the third conformal Ward identity of (11).

In the case, the conformal Ward identities demand that our solutions have the form (13), which we write as
(17) with an unspecified function. By substituting (17) into any one of the nullstate PDEs, we find that satisfies a second order hypergeometric differential equation. This restricts to a linear combination of two possible functions and given by
(18) with the Gauss hypergeometric function [13]. Thus, with , the solution space is
(19)

Now we define the solution space for the system of PDEs (10, 11) that we wish to rigorously characterize in this article:
Definition 1.
Sometimes, we write to specify the particular solution space with and use a similar notation for subsets of too. But usually, we suppress reference to the parameter and simply write .
One may explicitly construct many putative elements of by using the Coulomb gas formalism first proposed by V.S. Dotsenko and V.A. Fateev [31]; [32]. This method is nonrigorous, but in [29], J. Dubédat gave a proof that these “candidate solutions” indeed satisfy the system of PDEs (10, 11). We call these solutions Coulomb gas solutions.
The goal of this article and its sequels [26]; [27]; [28] is to completely determine the space for all . By “determine,” we mean

Rigorously prove that is spanned by realvalued Coulomb gas solution.

Rigorously prove that .

Argue that has a basis of connectivity weights and find formulas for all of the connectivity weights.
(For all , the multipleSLE curves are spacefilling almost surely [39]; [40]. Although we suspect that the findings of this article and its sequels [26]; [27]; [28] are true for all , our proofs do not carry over to this range.) Goals 1 and 2 determine the size and content of . In this article, we prove the upper bound . To obtain that upper bound in this article, we construct a basis for the dual space of linear functionals acting on . The derivation of this bound is contained entirely within this article, except for the proof of lemma 14 below, which we defer to the second article [26] of this series. In the third article [27], we use the results of this article and [26] to achieve goals 1 and 2 above. In the fourth article [28], we investigate connectivity weights among other topics, and we use them to predict a formula for the probability of a particular multipleSLE boundary arc connectivity. A heuristic, though nonrigorous, argument shows that the basis for that is dual to comprises all of the connectivity weights. This realization gives a direct method for their computation, as desired in goal 3.
In a future article [8], we use the connectivity weights to derive continuumlimit crossingprobability formulas for critical lattice models (such as percolation, Potts models, and random cluster models) in a polygon with an FFBC. We verify our predictions with highprecision computer simulations of the critical random cluster model in a hexagon, finding excellent agreement.
In appendix A, we survey some of the CFT methodologies used to study critical lattice models. This formalism (nonrigorously) anticipates many of our results, so we often interpret our findings in context with CFT throughout this article. The reader who is not familiar with this approach but wishes to understand our asides to it may consult this appendix. (We emphasize that, in spite of our occasional references to CFT, all of our proofs are rigorous, and none of them use assumptions from CFT. Rather, CFT tells us what ought to be true, and we prove those facts using rigorous methods.)
i.2 A survey of our approach
In this section, we motivate our method to achieve goals 1–3 (stated in the previous section), momentarily restricting our attention to percolation () [49]; [50]; [51] for simplicity. To begin, we choose one of the available boundary arc connectivities in a sided polygon with vertices . Topological considerations show that there are at least two sides of whose two adjacent vertices are endpoints of a common boundary arc (i.e., multipleSLE curve), and we let be such a side.
Next, we investigate what happens as the vertices and approach each other. What we find depends on the boundary condition for . If this side is wired, then the adjacent free sides and fuse into one contiguous free side of a sided polygon , and the isolated boundary cluster previously anchored to contracts away. Or if is free, then the adjacent wired sides fuse into one contiguous wired side of , and the boundary clusters previously anchored to these sides fuse into one boundary cluster anchored to this new wired side. In either situation, the original crossing configuration for the sided polygon goes to a crossing configuration for a sided polygon, and the connectivity weight for the former configuration goes to the connectivity weight for the latter configuration (figure 5). (In percolation, “connectivity weight” and “crossingprobability formula” are synonymous.) If we repeat this process more times, then we end with a zerosided polygon, or disk, whose boundary is either all wired or all free. The disk trivially exhibits just one “boundary arc connectivity” with zero curves, so this cumulative process sends the original connectivity weight to one.
Now, we might bring together in a different order the same pairs of vertices that approach each other in the previous paragraph. But because all of these variations send the same connectivity weight to one, we anticipate that all of them are different realizations of the same map.
Next, we investigate what happens if two adjacent vertices and that are not endpoints of a common boundary arc approach each other. Using the same boundary arc connectivity as before, we observe one of two outcomes. If the side is wired, then the adjacent free sides and of do not fuse into one contiguous free segment. Instead, they remain separated by an infinitesimal wired segment centered on the point within the side of , and the boundary cluster previously anchored to now anchors to this infinitesimal segment. Or if is free, then the adjacent wired sides do not fuse into one contiguous wired segment. Instead, they remain separated by an infinitesimal free segment centered on , and the boundary clusters that originally anchored to the adjacent wired sides remain separated by this segment. The likelihood of witnessing either of these two configurations in , with respect to the point on its boundary, is zero. Hence, pulling together two vertices not connected by a common boundary arc sends the connectivity weight for the original configuration in to zero. In CFT, this corresponds to the appearance of only the twoleg fusion channel in the OPE of the oneleg corner operators at and . (See appendix A.)
All of these mappings that pull pairs of adjacent vertices of together are subject to one constraint: the vertices and of the sided polygon to be brought together at the th step of this mapping cannot be separated from each other by any other vertices within the boundary of . If we imagine connecting and with an arc crossing the interior of for each , then this condition is satisfied if and only if we may draw these arcs in so they do not intersect. Furthermore, two mappings that bring the same pairs of vertices together in a different order have the same such arc connectivities, of which there are (4) (figure 6). Now, if changing the order in which we collapse the sides of does not change the image of any of these mappings, then there are effectively only distinct mappings. Assuming that the order indeed does not matter, we enumerate these mappings as we enumerated their corresponding boundary arc connectivities, we denote the th of them by , and we let
If the arc connectivity for some specified mapping in matches (resp. does not match) the boundary arc connectivity for some specified connectivity weight, then our arguments imply that this mapping sends that connectivity weight to one (resp. zero). Hence, we anticipate that for all and, assuming that is finitedimensional with basis , the set of connectivity weights is the basis of dual to . (Therefore, in the sequel [28], we define the th connectivity weight to be the element of dual to . Both here and in that article, we assume that this precise definition agrees with the multipleSLE definition given above.)
If is a basis for , then this duality relation implies that is the coefficient of the th connectivity weight in the decomposition of over . Furthermore, the linear mapping with the th coordinate of equaling is a bijection. That is, although destroys the pointwise information contained in each element of , it preserves the linear relations between these elements.
This reasoning motivates our strategy for proving goals 1–3 in section I.1 but in what follows, we order our steps differently because we do not know how to prove that is a basis for a priori. So after constructing the elements of in sections II and III, we prove that the linear mapping is injective in section IV (deferring there the proof of lemma 14 to [26]). Then the dimension theorem of linear algebra bounds the dimension of by . Finally, to prove that the dimension of is indeed in [27], we use the Coulomb gas formalism to construct explicit elements of and then use results of this article to prove that they are linearly independent. That is a basis for follows from these results.
Ii Boundary behavior of solutions
Motivated by the observations of section I.2, we investigate the behavior of elements of near certain points in the boundary of . (See the discussion surrounding (12).) If we conformally map the sided polygon onto the upper halfplane, with its th vertex sent to the th coordinate of , then the action of bringing together the vertices and sends to the boundary point . This point is in the hyperplane within , whose points have only the th and th coordinates equal. Hence, to implement the mappings described in the previous section for any , we must study the limit of as for any first.
Interpreting as a halfplane correlation function of oneleg boundary operators (3), we anticipate this limit using CFT. (These correlation functions appear, e.g., on the right side of (132). See appendix A for further details and a review of the CFT nomenclature that we refer to here.) We envisage the th coordinate of as hosting a oneleg boundary operator . If we send for some , then the operators and fuse into some combination of an identity operator (which is actually independent of ) and a twoleg boundary operator at . After inserting their OPE into the point function , we find the Frobenius series expansion
(21)  
(22)  
(23) 
Here, and are arbitrary real constants (for our present purposes), is the conformal weight of the leg boundary operator (140)
(24) 
Below, (29) gives the powers appearing in (22, 23). Loosely speaking, if appropriately normalized, we refer to either (22) or (23) in CFT as a “conformal block,” and (22) and (23) correspond to the identity and twoleg fusion channels of the constituent oneleg boundary operators respectively
Motivated by this interpretation of , we suppose that any has a Frobenius series expansion in centered on :
(25)  
(26)  
(27) 
Using the nullstate PDEs (10) centered on and (i.e., with and ) and collecting the leading order contributions, we find from either equation that
(28) 
Solving this equation for , we find the two powers
(29) 
that appear in (22) and (23) respectively. In this article, we restrict our attention to the range over which is the smaller power. At the next order, the nullstate PDEs centered on and respectively give
(30)  
(31) 
Taking their difference when gives , so immediately follows if . (We reexamine the case with more closely in section II of [28].) In the CFT language, the condition that is equivalent to the vanishing of the levelone descendant of the identity operator, and the condition implies that the identity operator is nonlocal. Comparing (25) with (22) suggest that we interpret as a point function of oneleg boundary operators. If this supposition is true, then must satisfy the system of PDEs (10, 11) in the coordinates of with replaced by . This observation echoes our previous claim that the limit (previously ) sends a connectivity weight for a sided polygon to that of a sided polygon. If instead, then (30) and (31) are identical, so is typically not zero. In the CFT language, this implies that the twoleg operator is local. We focus our attention on the case of (29) for now and postpone consideration of the case to [26]; [28].
These heuristic calculations suggest that for all , if we let approach with the values of and the other coordinates of fixed, then either grows or decays with power or greater. Lemma 3 below establishes this fact, but before we prove it, we introduce some convenient notation.
Definition 2.
We define and to be the projection maps removing the th coordinate and both the th and th coordinates respectively from :
(32)  
More generally, we define to be the projection map removing the coordinates with indices from .
In this article, we often identify with the subset of the boundary of whose points have only two coordinates, the th and the th, equal. Furthermore, we sometimes identify , explicitly given by
(33) 
with the subset of the boundary of whose points have only three coordinates, the th, the th and the th, equal.
Lemma 3.
Suppose that and , and for some , let
(34) 
Then for all and any compact subset of , the supremums
(35) 
are as .
Proof.
For each point , we let , we relabel the coordinates in as in increasing order, and we let . With this new notation, we define
(36) 
Finally, we choose an arbitrary compact subset , and with determined by (20), we choose bounded open sets , with and , such that they are sequentially compactly embedded:
(37) 
(We choose large enough so .) Our goal is to prove that the quantities in (35) are as .
To begin, we write the nullstate PDE (10) centered on as , where contains all of the terms that are seemingly largest when . With referring to a derivative with respect to , we have
(38)  