The Setting
In a Fortuin-Kasteleyn (FK) random planar map with Potts parameter , the Sheffield inventory bijection encodes a finite map as a block tree whose internal nodes carry connected cores attached at their corners. Graph distance on the full map is built from local pole-to-corner distances inside individual cores and from how corners of parent and child cores glue along tree branches.
At the local level, each core carries a pole-to-corner metric mark, whose expectation under the spine ladder distribution of the critical corner offspring law defines the mean metric increment, and together with the offspring standard deviation this yields the scaling constant for the Brownian continuum random tree (CRT) limit. Globally along an ordered tree of cores, summing local increments from the root produces the ancestral route length of each tree node, while the vertex identifications of the bijection determine the real graph distance between darts of the substituted map.
Inventory Words, Stack Matchings, and Connected Cores
An FK model parameter is a real number satisfying , corresponding to via and ✦, with inventory radius parameter ✦ and flexible order parameter ✦. An inventory order is either a fixed order of one of two binary types, labeled true and false, or a flexible order✦; a burger-order alphabet letter is either a burger token of one of those two types or an inventory order.✦ Under , the letter mass function assigns weight to each burger type, to the flexible order, and to each fixed order✦, defining the letter distribution on the alphabet.✦ For any index set , the independent and identically distributed (i.i.d.) inventory stream measure on -indexed sequences of alphabet letters is the infinite product measure of copies of the letter distribution.✦
An inventory stack evaluation state is a pair consisting of a list of pending orders and a freshest-first stack of burgers.✦ The evaluation of a word on an evaluation state returns when is empty, and recursively evaluates the suffix after updating by the single-step transition (where an order consumes the freshest eligible burger) on the leading letter.✦ The word reduction of a word is the evaluation state obtained by evaluating from empty pending orders and an empty burger stack✦, and a word is empty-reducing if its word reduction has empty pending orders and an empty burger stack. For , the empty-reducing word probability is the probability under the i.i.d. inventory stream measure on that the initial word of a stream is empty-reducing✦, and the total empty word probability is (1)✦
A typed burger-order letter is either a burger token or an order token, each carrying a binary type (true or false).✦ Typed word stack execution evaluates a word of typed letters against a stack of burger types, returning an updated stack upon success or failing on an illegal closure✦; the empty-reducing typed word set of length is the finite set of typed words of length whose typed stack execution from an empty stack terminates successfully with an empty stack.✦ For a typed word and a stack , the flexible closing count counts the flexible order closures encountered when processing letter by letter against , returning on the empty word or upon failure, and for a typed word , the flexible closing count is the flexible closing count starting from an empty stack.✦ At weights and in a commutative monoid, the inventory word monomial weight of a typed word is , where is the length of .✦
Given a list of positions, a non-crossing arch matching along is a list of ordered pairs along generated recursively by taking the empty matching on the empty list, skipping an unmatched element at the head of , or pairing elements and nested around non-crossing arch matchings on the interior sublist between and and on the exterior suffix after .✦ The arch transposition product of a list of pairs is the permutation equal to the identity on the empty list and to when is prepended to .✦ A two-stack matching certificate for a typed word along a list consists of two non-crossing arch matchings and along whose combined endpoints permute , such that every pair matches a true burger at to a true order at and every pair matches a false burger at to a false order at .✦ For a two-stack matching certificate , the stack matching mate permutation is the permutation equal to the arch transposition product of the concatenation of and .✦ Whenever the typed stack execution of a word along a list from an empty stack ends with an empty stack, there exists a two-stack matching certificate along ✦; choosing one yields a canonical two-stack matching certificate for any empty-reducing typed word.✦
For a permutation on , the chord opening endpoints of are the indices satisfying .✦ Two chord opening endpoints and of satisfy the chord crossing relation if either or ✦, and the chord intersection graph of is the simple graph on its chord opening endpoints whose edges are pairs satisfying this crossing relation.✦ A typed word satisfies the connected core word condition if there exist , a sequence on realizing , and a two-stack matching certificate for along such that has an opening endpoint from which every opening endpoint of is reachable in the chord intersection graph of .✦ A connected typed core is a typed word satisfying the connected core word condition.✦
Given a permutation on a set , the vertices of the permutation wedge of are the cycle equivalence classes ✦, and the cycle vertex projection maps each dart to its cycle class .✦ Given also an edge permutation on , the permutation wedge dart graph is the simple graph on the cycle classes of having an edge between distinct classes and whenever some dart satisfies and (or vice versa), with graph distance denoted .✦ For a connected typed core of length , the core stack matching is the canonical two-stack matching certificate on ✦, and the core vertex rotation permutation of is the product of the cyclic shift permutation on and the arch transposition product of .✦ For a connected typed core , the isolated core map graph is the permutation wedge dart graph , and the core entry corner of is the initial corner .✦ For a connected typed core and a corner , the core corner metric increment at is the graph distance in from the entry vertex to the vertex of the shifted corner : (2)✦
Offspring Law, Spine Distribution, and Core Marks
For parameter and size , the core generating polynomial coefficient is the sum of over all words satisfying the connected core word condition✦, and the block generating polynomial coefficient equals for and for .✦ Under FK model parameter , with from (1), the actual FK block mass at size is (3)✦
Block offspring probability weights are a nonnegative sequence summing to , and the doubled block mass sequence of is defined by for even and for odd . A critical even offspring distribution is a nonnegative sequence summing to that vanishes on odd integers, satisfies and , has mean , and has finite second moment .✦ Given block offspring probability weights satisfying , , mean , and , the constructed even offspring distribution is the critical even offspring distribution with weights .✦ For each parameter , the critical FK corner offspring law is the constructed even offspring distribution obtained from the actual FK block mass sequence (3). The infinite offspring product measure of a critical even offspring distribution is the infinite product measure of copies of on -indexed sequences.✦ Its variance is , and the offspring standard deviation is .
For a sequence , the offspring walk partial sum at time is the integer .✦ A step satisfies the ladder epoch condition for if either , or for every and .✦ For a sequence , the first weak ladder epoch is the smallest time step satisfying the ladder epoch condition for , and the weak ladder overshoot is the nonnegative integer part . For a sequence , the spine ladder variable pair is .✦ For a critical even offspring distribution , the offspring spine ladder distribution of is the pushforward of under .✦
Let be the set of optional core labels, each element being either a connected typed core or the empty label representing an unmarked node✦; the arity is when and when .✦ For real parameters , , and , the parametric core label mass assigns weight to and to a core .✦ Evaluating the parametric core label mass at , , and from (1) gives the root core mark mass, and the root core mark distribution on is the probability mass function assigning each label its root core mark mass.✦ For each arity , the conditional core mark distribution is the root core mark distribution conditioned on optional core labels with if at least one label has arity , and is the point mass at otherwise.✦ Using the core corner metric increment (2), for a spine pair and an optional core label , the core label metric increment is defined by (4)✦
Ordered Trees of Cores
An ordered tree of cores is a rooted tree defined recursively: either is a leaf, or is a branch consisting of a connected typed core and a family of child ordered trees of cores indexed by the corners of .✦ A core tree node of is a vertex of the ordered tree itself, keeping a distinct trivial leaf at every empty corner and without identifying coincident map poles: a leaf has a single node, while a node of a branch is either the branch root or a pair with and a core tree node of .✦
A core tree dart of is a dart of the recursively substituted map word: a leaf has no darts, while a dart of a branch is either a corner of or a pair where and is a core tree dart of .✦ For an ordered tree of cores and a core tree dart of , the core tree dart label is the typed burger-order letter carried by : at a branch , a dart at corner carries the -th letter of and a dart retains its label in .✦ In recursive substitution order, the core tree dart list lists all darts of : it is empty when is a leaf, and at a branch it concatenates, over in order, the core dart at followed by the dart list .✦ For an ordered tree of cores , the core tree stack matching is the canonical two-stack matching certificate on with its core tree dart labels, obtained because the recursively substituted word empties the stack.✦
The Claim
Definition 1. Fix an FK model parameter , corresponding to , with critical FK corner offspring law , its offspring standard deviation and offspring spine ladder distribution , and the conditional core mark distributions . Using the core label metric increment (4), the mean core metric increment is defined by (5)✦ and is strictly positive: (6)✦ With from (5), the CRT scaling constant is defined by (7)✦ and satisfies (8)✦ For an ordered tree of cores and a core tree node of , the node route length sums the core corner metric increments (2) along the path from the root of to , given recursively by (9)✦ For an ordered tree of cores with core tree stack matching and cyclic permutation of its dart list , let ; the real graph distance between two core tree darts and of is (10)✦
What Is Checked
The definitions (5) and (7) and claims (6) and (8) are stated over any FK model parameter together with the critical FK corner offspring law , its offspring spine ladder distribution , and the conditional core mark distributions ; the node route length (9) is stated over any ordered tree of cores and any core tree node of , and the real graph distance (10) is stated over any ordered tree of cores and any pair of core tree darts of .
For these constructions, the library proves that for every parameter and block size , the actual FK block mass (3) satisfies ✦, with ✦ and ✦, and that for every sequence there exists a time step satisfying the ladder epoch condition.✦