OctoInformBeta

OpenAI preprint, September 2026 · §6. From the block tree to the map · §6

§6 (setting): the metric marks and constants: Positivity of spine mean β\beta and constant c(q)c(q) for q>4q > 4, with route length G(w)G(w) and core tree graph distance

Positive metric constants and distances on core trees.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

In a Fortuin-Kasteleyn (FK) random planar map with Potts parameter q>4q > 4, 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 pp is a real number satisfying 1/2<p<11/2 < p < 1, corresponding to q>4q > 4 via t=qt = \sqrt{q} and p=t/(t+2)p = t/(t+2)✦, with inventory radius parameter u=(1−p)/16u = (1-p)/16✦ and flexible order parameter θ=1+2p/(1−p)\theta = 1 + 2p/(1-p)✦. 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 p∈(1/2,1)p \in (1/2, 1), the letter mass function assigns weight 1/41/4 to each burger type, p/2p/2 to the flexible order, and (1−p)/4(1-p)/4 to each fixed order✦, defining the letter distribution on the alphabet.✦ For any index set II, the independent and identically distributed (i.i.d.) inventory stream measure on II-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 ww on an evaluation state UU returns UU when ww is empty, and recursively evaluates the suffix after updating UU by the single-step transition (where an order consumes the freshest eligible burger) on the leading letter.✦ The word reduction of a word ww is the evaluation state obtained by evaluating ww from empty pending orders and an empty burger stack✦, and a word ww is empty-reducing if its word reduction has empty pending orders and an empty burger stack. For N≥0N \ge 0, the empty-reducing word probability εp(N)\varepsilon_p(N) is the probability under the i.i.d. inventory stream measure on ℕ\mathbb{N} that the initial word (x0,…,xN−1)(x_0, \dots, x_{N-1}) of a stream xx is empty-reducing✦, and the total empty word probability τ\tau is τ=∑n≥0εp(2n).\tau = \sum_{n \ge 0} \varepsilon_p(2n).(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 𝒲N\mathcal{W}_N of length N≥0N \ge 0 is the finite set of typed words of length NN whose typed stack execution from an empty stack terminates successfully with an empty stack.✦ For a typed word ww and a stack ss, the flexible closing count f(w,s)f(w, s) counts the flexible order closures encountered when processing ww letter by letter against ss, returning 00 on the empty word or upon failure, and for a typed word ww, the flexible closing count f(w)f(w) is the flexible closing count starting from an empty stack.✦ At weights θ\theta and rr in a commutative monoid, the inventory word monomial weight of a typed word ww is θf(w)r|w|\theta^{f(w)} r^{|w|}, where |w||w| is the length of ww.✦

Given a list ll of positions, a non-crossing arch matching EE along ll is a list of ordered pairs along ll generated recursively by taking the empty matching on the empty list, skipping an unmatched element at the head of ll, or pairing elements aa and bb nested around non-crossing arch matchings on the interior sublist between aa and bb and on the exterior suffix after bb.✦ The arch transposition product turns⁡(E)\operatorname{turns}(E) of a list EE of pairs is the permutation equal to the identity on the empty list and to turns⁡(E′)∘(ab)\operatorname{turns}(E') \circ (a\;b) when (a,b)(a, b) is prepended to E′E'.✦ A two-stack matching certificate M=(E1,E2)M = (E_1, E_2) for a typed word ww along a list ll consists of two non-crossing arch matchings E1E_1 and E2E_2 along ll whose combined endpoints permute ll, such that every pair (e1,e2)∈E1(e_1, e_2) \in E_1 matches a true burger at e1e_1 to a true order at e2e_2 and every pair (e1,e2)∈E2(e_1, e_2) \in E_2 matches a false burger at e1e_1 to a false order at e2e_2.✦ For a two-stack matching certificate M=(E1,E2)M = (E_1, E_2), the stack matching mate permutation mate⁡(M)\operatorname{mate}(M) is the permutation equal to the arch transposition product of the concatenation of E1E_1 and E2E_2.✦ Whenever the typed stack execution of a word along a list ll from an empty stack ends with an empty stack, there exists a two-stack matching certificate along ll✦; choosing one yields a canonical two-stack matching certificate for any empty-reducing typed word.✦

For a permutation π\pi on {0,…,N−1}\{0, \dots, N-1\}, the chord opening endpoints of π\pi are the indices i∈{0,…,N−1}i \in \{0, \dots, N-1\} satisfying i<π(i)i < \pi(i).✦ Two chord opening endpoints xx and yy of π\pi satisfy the chord crossing relation if either x<y<π(x)<π(y)x < y < \pi(x) < \pi(y) or y<x<π(y)<π(x)y < x < \pi(y) < \pi(x)✦, and the chord intersection graph of π\pi is the simple graph on its chord opening endpoints whose edges are pairs satisfying this crossing relation.✦ A typed word ww satisfies the connected core word condition if there exist K≥0K \ge 0, a sequence vv on {0,…,K−1}\{0, \dots, K-1\} realizing ww, and a two-stack matching certificate MM for vv along (0,…,K−1)(0, \dots, K-1) such that mate⁡(M)\operatorname{mate}(M) has an opening endpoint r=0r = 0 from which every opening endpoint of mate⁡(M)\operatorname{mate}(M) is reachable in the chord intersection graph of mate⁡(M)\operatorname{mate}(M).✦ A connected typed core BB is a typed word satisfying the connected core word condition.✦

Given a permutation ρ\rho on a set XX, the vertices of the permutation wedge of ρ\rho are the cycle equivalence classes X/∼ρX / {\sim_\rho}✦, and the cycle vertex projection maps each dart d∈Xd \in X to its cycle class [d]ρ[d]_\rho.✦ Given also an edge permutation π\pi on XX, the permutation wedge dart graph Γ(π,ρ)\Gamma(\pi, \rho) is the simple graph on the cycle classes of ρ\rho having an edge between distinct classes uu and vv whenever some dart d∈Xd \in X satisfies [d]ρ=u[d]_\rho = u and [π(d)]ρ=v[\pi(d)]_\rho = v (or vice versa), with graph distance denoted dist⁡Γ(π,ρ)\operatorname{dist}_{\Gamma(\pi, \rho)}.✦ For a connected typed core BB of length |B||B|, the core stack matching ℳ(B)=(ℳ1(B),ℳ2(B))\mathcal{M}(B) = (\mathcal{M}_1(B), \mathcal{M}_2(B)) is the canonical two-stack matching certificate on (0,…,|B|−1)(0, \dots, |B|-1)✦, and the core vertex rotation permutation ρB\rho_B of BB is the product γ|B|∘turns⁡(ℳ1(B))\gamma_{|B|} \circ \operatorname{turns}(\mathcal{M}_1(B)) of the cyclic shift permutation γ|B|\gamma_{|B|} on {0,…,|B|−1}\{0, \dots, |B|-1\} and the arch transposition product of ℳ1(B)\mathcal{M}_1(B).✦ For a connected typed core BB, the isolated core map graph GBG_B is the permutation wedge dart graph Γ(mate⁡(ℳ(B)),ρB)\Gamma(\operatorname{mate}(\mathcal{M}(B)), \rho_B), and the core entry corner of BB is the initial corner 0∈{0,…,|B|−1}0 \in \{0, \dots, |B|-1\}.✦ For a connected typed core BB and a corner j∈{0,…,|B|−1}j \in \{0, \dots, |B|-1\}, the core corner metric increment δB(j)\delta_B(j) at jj is the graph distance in GBG_B from the entry vertex [0]ρB[0]_{\rho_B} to the vertex [γ|B|(j)]ρB[\gamma_{|B|}(j)]_{\rho_B} of the shifted corner γ|B|(j)\gamma_{|B|}(j): δB(j)=dist⁡GB([0]ρB,[γ|B|(j)]ρB).\delta_B(j) = \operatorname{dist}_{G_B}\bigl([0]_{\rho_B},\, [\gamma_{|B|}(j)]_{\rho_B}\bigr).(2)✦

Offspring Law, Spine Distribution, and Core Marks

For parameter θ\theta and size m≥0m \ge 0, the core generating polynomial coefficient Cm(θ)C_m(\theta) is the sum of θf(w)\theta^{f(w)} over all words w∈𝒲2mw \in \mathcal{W}_{2m} satisfying the connected core word condition✦, and the block generating polynomial coefficient Bm(θ)B_m(\theta) equals 1+C0(θ)1 + C_0(\theta) for m=0m = 0 and Cm(θ)C_m(\theta) for m≥1m \ge 1.✦ Under FK model parameter p∈(1/2,1)p \in (1/2, 1), with τ\tau from (1), the actual FK block mass bp(m)b_p(m) at size m≥0m \ge 0 is bp(m)=Bm(θ)(uτ2)mτ.b_p(m) = B_m(\theta)\,\frac{(u\tau^2)^m}{\tau}.(3)✦

Block offspring probability weights b=(b(k))k≥0b = (b(k))_{k \ge 0} are a nonnegative sequence summing to 11, and the doubled block mass sequence b̃\tilde{b} of bb is defined by b̃(k)=b(k/2)\tilde{b}(k) = b(k/2) for even k≥0k \ge 0 and b̃(k)=0\tilde{b}(k) = 0 for odd kk. A critical even offspring distribution η=(η(k))k≥0\eta = (\eta(k))_{k \ge 0} is a nonnegative sequence summing to 11 that vanishes on odd integers, satisfies η(0)>0\eta(0) > 0 and η(2)>0\eta(2) > 0, has mean ∑k≥0kη(k)=1\sum_{k \ge 0} k\,\eta(k) = 1, and has finite second moment ∑k≥0k2η(k)<∞\sum_{k \ge 0} k^2\eta(k) < \infty.✦ Given block offspring probability weights bb satisfying b(0)>0b(0) > 0, b(1)>0b(1) > 0, mean ∑k≥0kb(k)=1/2\sum_{k \ge 0} k\,b(k) = 1/2, and ∑k≥0k2b(k)<∞\sum_{k \ge 0} k^2 b(k) < \infty, the constructed even offspring distribution is the critical even offspring distribution with weights b̃\tilde{b}.✦ For each parameter p∈(1/2,1)p \in (1/2, 1), the critical FK corner offspring law ηp\eta_p is the constructed even offspring distribution obtained from the actual FK block mass sequence (3). The infinite offspring product measure ℙη\mathbb{P}_\eta of a critical even offspring distribution η\eta is the infinite product measure of copies of η\eta on ℕ\mathbb{N}-indexed sequences.✦ Its variance σ2\sigma^2 is ∑k≥0(k−1)2η(k)\sum_{k \ge 0} (k - 1)^2 \eta(k), and the offspring standard deviation σ\sigma is σ2\sqrt{\sigma^2}.

For a sequence x:ℕ→ℕx : \mathbb{N} \to \mathbb{N}, the offspring walk partial sum Sn(x)S_n(x) at time n≥0n \ge 0 is the integer ∑k=0n−1(xk−1)\sum_{k=0}^{n-1} (x_k - 1).✦ A step n≥0n \ge 0 satisfies the ladder epoch condition for xx if either Sn+1(x)≥0S_{n+1}(x) \ge 0, or Sm+1(x)<0S_{m+1}(x) < 0 for every m≥0m \ge 0 and n=0n = 0.✦ For a sequence x:ℕ→ℕx : \mathbb{N} \to \mathbb{N}, the first weak ladder epoch ℓ(x)\ell(x) is the smallest time step n≥0n \ge 0 satisfying the ladder epoch condition for xx, and the weak ladder overshoot O(x)O(x) is the nonnegative integer part max⁡(Sℓ(x)+1(x),0)\max(S_{\ell(x)+1}(x), 0). For a sequence x:ℕ→ℕx : \mathbb{N} \to \mathbb{N}, the spine ladder variable pair Z(x)Z(x) is (xℓ(x),O(x))∈ℕ×ℕ(x_{\ell(x)}, O(x)) \in \mathbb{N} \times \mathbb{N}.✦ For a critical even offspring distribution η\eta, the offspring spine ladder distribution ℙsp\mathbb{P}_{\mathrm{sp}} of η\eta is the pushforward of ℙη\mathbb{P}_\eta under ZZ.✦

Let ℒ\mathcal{L} be the set of optional core labels, each element a∈ℒa \in \mathcal{L} being either a connected typed core BB or the empty label ⌀\varnothing representing an unmarked node✦; the arity arity⁡(a)\operatorname{arity}(a) is 00 when a=⌀a = \varnothing and |B||B| when a=Ba = B.✦ For real parameters θ\theta, rr, and τ\tau, the parametric core label mass assigns weight 1/τ1/\tau to ⌀\varnothing and θf(B)(rτ)|B|/τ\theta^{f(B)}(r\tau)^{|B|}/\tau to a core BB.✦ Evaluating the parametric core label mass at θ\theta, r=ur = \sqrt{u}, and τ\tau from (1) gives the root core mark mass, and the root core mark distribution on ℒ\mathcal{L} is the probability mass function assigning each label aa its root core mark mass.✦ For each arity k≥0k \ge 0, the conditional core mark distribution νk\nu_k is the root core mark distribution conditioned on optional core labels a∈ℒa \in \mathcal{L} with arity⁡(a)=k\operatorname{arity}(a) = k if at least one label has arity kk, and is the point mass at ⌀\varnothing otherwise.✦ Using the core corner metric increment (2), for a spine pair z=(k,i)∈ℕ×ℕz = (k, i) \in \mathbb{N} \times \mathbb{N} and an optional core label a∈ℒa \in \mathcal{L}, the core label metric increment g(z,a)g(z, a) is defined by g(z,a)={δB(k−1−i),if a=B with |B|=k and i<k,0,otherwise.g(z, a) = \begin{cases} \delta_B(k - 1 - i), & \text{if } a = B \text{ with } |B| = k \text{ and } i < k, \\ 0, & \text{otherwise}. \end{cases}(4)✦

Ordered Trees of Cores

An ordered tree of cores 𝒯\mathcal{T} is a rooted tree defined recursively: either 𝒯\mathcal{T} is a leaf, or 𝒯\mathcal{T} is a branch (B,(𝒯j)0≤j<|B|)(B, (\mathcal{T}_j)_{0 \le j < |B|}) consisting of a connected typed core BB and a family of child ordered trees of cores indexed by the corners of BB.✦ A core tree node ww of 𝒯\mathcal{T} 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 (B,(𝒯j)0≤j<|B|)(B, (\mathcal{T}_j)_{0 \le j < |B|}) is either the branch root or a pair (i,w′)(i, w') with i∈{0,…,|B|−1}i \in \{0, \dots, |B|-1\} and w′w' a core tree node of 𝒯i\mathcal{T}_i.✦

A core tree dart dd of 𝒯\mathcal{T} is a dart of the recursively substituted map word: a leaf has no darts, while a dart of a branch (B,(𝒯j)0≤j<|B|)(B, (\mathcal{T}_j)_{0 \le j < |B|}) is either a corner i∈{0,…,|B|−1}i \in \{0, \dots, |B|-1\} of BB or a pair (i,d′)(i, d') where i∈{0,…,|B|−1}i \in \{0, \dots, |B|-1\} and d′d' is a core tree dart of 𝒯i\mathcal{T}_i.✦ For an ordered tree of cores 𝒯\mathcal{T} and a core tree dart dd of 𝒯\mathcal{T}, the core tree dart label is the typed burger-order letter carried by dd: at a branch (B,(𝒯j)0≤j<|B|)(B, (\mathcal{T}_j)_{0 \le j < |B|}), a dart at corner ii carries the ii-th letter of BB and a dart (i,d′)(i, d') retains its label in 𝒯i\mathcal{T}_i.✦ In recursive substitution order, the core tree dart list D(𝒯)D(\mathcal{T}) lists all darts of 𝒯\mathcal{T}: it is empty when 𝒯\mathcal{T} is a leaf, and at a branch (B,(𝒯j)0≤j<|B|)(B, (\mathcal{T}_j)_{0 \le j < |B|}) it concatenates, over i=0,…,|B|−1i = 0, \dots, |B|-1 in order, the core dart at ii followed by the dart list D(𝒯i)D(\mathcal{T}_i).✦ For an ordered tree of cores 𝒯\mathcal{T}, the core tree stack matching ℳ(𝒯)=(ℳ1(𝒯),ℳ2(𝒯))\mathcal{M}(\mathcal{T}) = (\mathcal{M}_1(\mathcal{T}), \mathcal{M}_2(\mathcal{T})) is the canonical two-stack matching certificate on D(𝒯)D(\mathcal{T}) with its core tree dart labels, obtained because the recursively substituted word empties the stack.✦

The Claim

Definition 1. Fix an FK model parameter p∈(1/2,1)p \in (1/2, 1), corresponding to q>4q > 4, with critical FK corner offspring law ηp\eta_p, its offspring standard deviation σ\sigma and offspring spine ladder distribution ℙsp\mathbb{P}_{\mathrm{sp}}, and the conditional core mark distributions (νk)k≥0(\nu_k)_{k \ge 0}. Using the core label metric increment (4), the mean core metric increment β\beta is defined by β=∫ℕ×ℕ∫ℒg(z,a)dνz1(a)dℙsp(z),\beta = \int_{\mathbb{N} \times \mathbb{N}} \int_{\mathcal{L}} g(z, a)\,d\nu_{z_1}(a)\,d\mathbb{P}_{\mathrm{sp}}(z),(5)✦ and is strictly positive: 0<β.0 < \beta.(6)✦ With β\beta from (5), the CRT scaling constant c(q)c(q) is defined by c(q)=σ22β,c(q) = \frac{\sigma}{2\sqrt{2}\,\beta},(7)✦ and satisfies 0<c(q).0 < c(q).(8)✦ For an ordered tree of cores 𝒯\mathcal{T} and a core tree node ww of 𝒯\mathcal{T}, the node route length G(w)G(w) sums the core corner metric increments (2) along the path from the root of 𝒯\mathcal{T} to ww, given recursively by G(w)={0,if 𝒯 is a leaf, or w is the root of a branch,δB(i)+G(w′),if 𝒯=(B,(𝒯j)0≤j<|B|) and w=(i,w′) with w′ in 𝒯i.G(w) = \begin{cases} 0, & \text{if } \mathcal{T} \text{ is a leaf, or } w \text{ is the root of a branch}, \\ \delta_B(i) + G(w'), & \text{if } \mathcal{T} = (B, (\mathcal{T}_j)_{0 \le j < |B|}) \text{ and } w = (i, w') \text{ with } w' \text{ in } \mathcal{T}_i. \end{cases}(9)✦ For an ordered tree of cores 𝒯\mathcal{T} with core tree stack matching ℳ(𝒯)\mathcal{M}(\mathcal{T}) and cyclic permutation γ𝒯\gamma_{\mathcal{T}} of its dart list D(𝒯)D(\mathcal{T}), let s=γ𝒯∘turns⁡(ℳ1(𝒯))s = \gamma_{\mathcal{T}} \circ \operatorname{turns}(\mathcal{M}_1(\mathcal{T})); the real graph distance d𝒯(a,b)d_{\mathcal{T}}(a, b) between two core tree darts aa and bb of 𝒯\mathcal{T} is d𝒯(a,b)=dist⁡Γ(mate⁡(ℳ(𝒯)),s)([a]s,[b]s).d_{\mathcal{T}}(a, b) = \operatorname{dist}_{\Gamma(\operatorname{mate}(\mathcal{M}(\mathcal{T})),\, s)}\bigl([a]_s, [b]_s\bigr).(10)✦

What Is Checked

The definitions (5) and (7) and claims (6) and (8) are stated over any FK model parameter p∈(1/2,1)p \in (1/2, 1) together with the critical FK corner offspring law ηp\eta_p, its offspring spine ladder distribution ℙsp\mathbb{P}_{\mathrm{sp}}, and the conditional core mark distributions (νk)k≥0(\nu_k)_{k \ge 0}; the node route length (9) is stated over any ordered tree of cores 𝒯\mathcal{T} and any core tree node ww of 𝒯\mathcal{T}, and the real graph distance (10) is stated over any ordered tree of cores 𝒯\mathcal{T} and any pair of core tree darts a,ba, b of 𝒯\mathcal{T}.

For these constructions, the library proves that for every parameter p∈(1/2,1)p \in (1/2, 1) and block size m≥0m \ge 0, the actual FK block mass (3) satisfies bp(m)≥0b_p(m) \ge 0✦, with bp(0)>0b_p(0) > 0✦ and bp(1)>0b_p(1) > 0✦, and that for every sequence x:ℕ→ℕx : \mathbb{N} \to \mathbb{N} there exists a time step n≥0n \ge 0 satisfying the ladder epoch condition.✦