The Setting
Fix a Potts parameter and consider a rooted planar map with edges for an integer , weighted by the Fortuin-Kasteleyn (FK) cluster model. Equipping the vertices of with scaled graph distance and normalized degree measure turns into a metric measure space. The problem is to express the finite FK expectation of any test functional on such maps as the integral against a marked critical Galton-Watson tree law conditioned to have nodes, and to show that every odd tree size carries positive partition weight.
Planar Maps and the Finite FK Law
For an integer , a dart of a map with edges is an index in , with dart designated as the root dart.✦ For a permutation on , an orbit of is a cycle of , with denoting the set of all orbits and the orbit of a dart ; conjugating by a dart permutation gives , inducing a bijection between the orbits of and those of that pushes edge subsets forward. Given permutations on and an edge-orbit subset , each orbit has unordered vertex-orbit endpoints for a representative dart ✦, and the spanning graph is the simple graph on with an edge between and whenever .✦ A subset satisfies the multiforest condition for when is acyclic, has no self-loops ( for every ), and maps distinct edges in to distinct unordered endpoint pairs.
A labelled planar map with edges is a pair of permutations on satisfying the planar map conditions: is a fixed-point-free involution on , the full spanning graph is connected, and . Two labelled planar maps and of size are isomorphic if some permutation on fixes the root dart and satisfies and .✦ A rooted planar map with edges is an equivalence class of labelled planar maps under root-preserving map isomorphism, carrying a representative edge-reversal involution and vertex-rotation permutation , vertex set , edge set , and spanning subgraph for .
A metric measure space presentation is a quadruple consisting of a set , a real-valued distance function on , a -algebra on , and a measure on .✦ For a rooted planar map with edges, writing for the Dirac measure at a point , the normalized vertex degree measure on is defined by (1)✦ For any real scale factor , the rescaled map metric measure space of is the metric measure space presentation on assigning to vertices the distance using graph distance in , equipped with the discrete -algebra on and the measure from (1).✦
For a rooted planar map with edges and a subset , let be the number of connected components of .✦ At parameter , the FK-decorated map weight is (2)✦ and the finite FK partition function summed over all rooted planar maps with edges is (3)✦ For and a test functional from metric measure space presentations to , the finite FK map expectation is defined via (2) and (3) by (4)✦
Tree-decorated Maps, Inventory Words, and Core Decomposition
Given permutations on and edge subsets , the set of spanning tree completions is the set of spanning trees extending within .✦ A tree-decorated rooted map of size is a pair consisting of a rooted planar map with edges and a spanning tree .✦ For an involution on and , the partial dart reversal is the permutation on applying to darts with and fixing all other darts.✦ A canonical rooted tree map of size is a triple consisting of a labelled planar map of size and an edge-orbit subset satisfying the tour condition that equals the cyclic shift on .✦ Using the root tour numbering of a single-cycle permutation on , canonicalization maps each tree-decorated rooted map of size bijectively to a canonical rooted tree map of size .
An FK parameter choice is a real number in ; for , setting gives .✦ For an FK parameter choice , the flexible-order parameter is the real number and the radius parameter is the real number . The inventory alphabet consists of two burger types (indexed by , taking as the first type and as the second), two fixed orders , and one flexible order .✦ An inventory evaluation state consists of a list of pending orders and a freshest-first stack of burger types in ✦; evaluating a word over updates this state step by step, and a word is empty-reducing if evaluating it from empty orders and an empty stack ends with both empty.✦ Under the letter distribution on assigning mass to each burger, to , and to each fixed order, let be the i.i.d. measure on infinite streams of letters. Writing for the probability under that the initial word of length of a stream is empty-reducing, the total empty-word probability is (5)✦
The typed burger-order alphabet is the set , consisting of the burger and order letters carrying an explicit type in .✦ Executing a word over against a freshest-first stack of types in returns the updated stack upon valid matches or fails on an illegal closure, and (with for length ) is the set of stack-emptying typed words whose execution from the empty stack finishes with an empty stack. For a typed word , the flexible closing count counts the flexible-order closures encountered along its execution from the empty stack, and for its inventory word monomial weight is (6)✦
A successful dart word of size is a map from to whose sequence belongs to .✦ Let denote the set of successful dart words of size ; for , the typed word partition function is (7)✦ Assigning to each dart in a canonical rooted tree map the burger when and the order otherwise yields the canonical tour matching word in , inducing bijections from canonical rooted tree maps and hence from tree-decorated rooted maps of size to .
On a finite list of positions, a non-crossing arch matching is built inductively from the empty matching by skipping an unmatched position or pairing two positions around non-crossing matchings on the interior and exterior segments✦; its endpoints flatten the pairs, and its arch transposition product multiplies the transpositions of those pairs. A two-stack matching certificate for a typed word along a list consists of two non-crossing arch matchings on whose combined endpoints permute , with the first pairing burgers of type to orders of type and the second pairing burgers of type to orders of type ✦, and the mate permutation of is the arch transposition product of the combined arch lists. For any permutation on , an opener of is an index with , two openers of cross if or , and the chord intersection graph of is the simple graph whose vertices are the openers of and whose edges connect crossing pairs. A typed word of length satisfies the connected core word condition, written , if it admits a two-stack matching certificate on whose mate permutation has an opener at index from which every opener of is reachable in the chord intersection graph of ✦; elements of are connected typed cores.✦
The set of optional core labels consists of the empty label , of arity , and every connected typed core , of arity . For , the parametric core label mass is defined via (6) by (8)✦ For an FK parameter with , , and from (5), the root core mark distribution on assigns probability weight to each , and the conditional core mark distribution at arity is conditioned on labels of arity , or the point mass when no optional core label has arity .✦
An ordered tree of cores is either a leaf or a branch consisting of a connected typed core and child core trees indexed by the corners of .✦ For an ordered tree of cores , the label sequence is at a leaf and followed by the concatenated label sequences of its children at a branch, with degree sequence given by the arities of . For an ordered tree of cores , the typed word is the empty word at a leaf and inserts the subwords into the corners of at a branch; for every ordered tree of cores , the word empties the stack✦, and is a bijection onto . For , the core tree product mass is defined via (6) by (9)✦
Tree Coding, Block Weights, and the Marked Tree Law
For a sequence , the degree partial walk is for ✦; is a discrete bridge of length if ✦, and is a Łukasiewicz tree code of length , written , if and for all . For an integer array , the total step of is the integer sum .✦ The degree increment word of a list of nonnegative integers is the integer list obtained by subtracting from each entry, and an integer list satisfies the discrete excursion condition if its sum is and all of its prefix sums are nonnegative.✦ For a discrete bridge of positive length , the unique good rotation index is the cyclic shift index under which every prefix sum of the rotated bridge remains nonnegative; shifting the bridge cyclically by gives its canonical tree code in , and an array of length with total step similarly maps to a tree code in . For each , the binary comb tree code in assigns degree to positions and to positions .✦
A core label excursion list is a list of optional core labels whose arity increment word satisfies the discrete excursion condition✦; for every ordered tree of cores, the increment word of its degree sequence satisfies this condition✦, so reading the label sequence gives a bijection between ordered trees of cores and core label excursion lists.✦ A compatible marked tree code of length is a pair in such that for every .✦ Reconstructing an ordered tree of cores from a compatible marked tree code via the inverse excursion bijection yields bijections from compatible marked tree codes of length to core trees with label length , from compatible marked tree codes of length to via core trees of label length , and from to compatible marked tree codes of length ; write for the last bijection.
A critical even offspring distribution is a sequence with , , even support ( for odd ), , , mean , and finite second moment .✦ Its tree code weight on is ✦, and its tree code partition function at length is (10)✦
A sequence of block offspring probability weights is a sequence with and , whose doubled sequence is given by for even and for odd ; whenever , , , and , the doubled sequence forms a critical even offspring distribution.✦ For and , the core and block generating coefficients are (11) For an FK parameter with , , and from (5), the actual FK block mass is defined via (11) by (12)✦ and doubling from (12) defines the critical FK corner offspring distribution .✦
Given a critical even offspring distribution , let be the i.i.d. product measure on ✦, let the conditioned offspring bridge law at size be the measure conditioned on arrays with total step , and let the conditioned tree code law be the pushforward of this conditioned measure onto under the cyclic rotation map. Given a Markov kernel from to measures on , the tree code marking kernel assigns to each the conditional mark product measure , and the marked tree code law on is the semidirect product of with this marking kernel.✦ For , , and a functional from metric measure space presentations to , the marked tree map test observable on evaluates on the underlying rooted map obtained from by inverting and the map-to-word bijection whenever for all , and returns otherwise.✦
The Claim
Theorem 1. For every with , every scale factor , every integer , and every functional from metric measure space presentations to , the finite FK map expectation (4) and the marked tree code law satisfy (13), (13)✦ For every with and every , the marked tree code law satisfies (14) in terms of (7), (14)✦ For every FK parameter with , , and , and every , the marked tree code law satisfies (15) in terms of (6) and (10), (15)✦ For all real numbers with , every core label excursion list with corresponding core tree , and every ordered tree of cores , the label masses (8) and product mass (9) satisfy (16) and (17), (16)✦ (17)✦ The two-letter typed word satisfies (18), (18)✦ For every critical even offspring distribution and every integer , the tree code partition function (10) satisfies (19), (19)✦
In the paper, the result reads: the marked tree conditioned to have nodes produces the exact map marginal of the Fortuin-Kasteleyn law, and every such size is attainable. The theorem states this distributional identity as an equality of expectations (13) for maps with edges and tree codes of size , together with the positive partition weight (19) at every odd size .
What Is Checked
The claims (13) through (19) are stated over rooted planar maps with edges as dart-relabelling equivalence classes of rotation systems, their rescaled metric measure space presentations with normalized vertex degree measure (1), the finite FK map expectation (4), the two-type burger-order inventory alphabet and its stack reduction, connected core words defined via two-stack matchings and chord intersection graphs, ordered trees of cores, discrete bridges and Łukasiewicz tree codes, critical even offspring distributions, the doubled actual FK block weights (12), and the induced marked tree code laws and test observables.
Conjugating a labelled planar map by a dart permutation preserves the planar map conditions, and the partial dart reversal of an involution on any edge subset remains an involution.✦ The root tour numbering of any single-cycle permutation on is bijective✦, and for every the actual FK block weights (12) are nonnegative at every ✦ and strictly positive at and .