OctoInformBeta

OpenAI preprint, September 2026 · §4. The critical block tree · §4

Proposition 4.3 [Exact finite representation]: For q>4q > 4, the marked critical tree law reproduces finite Fortuin-Kasteleyn expectations at n+1n+1 edges with positive odd-size partition weights

Exact marked tree representation of finite Fortuin-Kasteleyn maps.

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

Fix a Potts parameter q>4q > 4 and consider a rooted planar map MM with n+1n+1 edges for an integer n≥0n \ge 0, weighted by the Fortuin-Kasteleyn (FK) cluster model. Equipping the vertices of MM with scaled graph distance and normalized degree measure turns MM 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 2(n+1)+12(n+1)+1 nodes, and to show that every odd tree size carries positive partition weight.

Planar Maps and the Finite FK Law

For an integer n≥0n \ge 0, a dart of a map with n+1n+1 edges is an index in Dn={0,…,2(n+1)−1}D_n = \{0, \dots, 2(n+1)-1\}, with dart 00 designated as the root dart.✦ For a permutation σ\sigma on DnD_n, an orbit of σ\sigma is a cycle of σ\sigma, with Orb(σ)\mathrm{Orb}(\sigma) denoting the set of all orbits and [d]σ[d]_\sigma the orbit of a dart d∈Dnd \in D_n; conjugating σ\sigma by a dart permutation rr gives r−1σrr^{-1} \sigma r, inducing a bijection between the orbits of r−1σrr^{-1} \sigma r and those of σ\sigma that pushes edge subsets forward. Given permutations a,sa, s on DnD_n and an edge-orbit subset A⊆Orb(a)A \subseteq \mathrm{Orb}(a), each orbit e∈Orb(a)e \in \mathrm{Orb}(a) has unordered vertex-orbit endpoints {[d]s,[a(d)]s}\{[d]_s, [a(d)]_s\} for a representative dart d∈ed \in e✦, and the spanning graph G(a,s,A)G(a, s, A) is the simple graph on Orb(s)\mathrm{Orb}(s) with an edge between [d]s[d]_s and [a(d)]s[a(d)]_s whenever [d]a∈A[d]_a \in A.✦ A subset A⊆Orb(a)A \subseteq \mathrm{Orb}(a) satisfies the multiforest condition for (a,s)(a, s) when G(a,s,A)G(a, s, A) is acyclic, has no self-loops ([d]s≠[a(d)]s[d]_s \neq [a(d)]_s for every [d]a∈A[d]_a \in A), and maps distinct edges in AA to distinct unordered endpoint pairs.

A labelled planar map (a,s)(a, s) with n+1n+1 edges is a pair of permutations on DnD_n satisfying the planar map conditions: aa is a fixed-point-free involution on DnD_n, the full spanning graph G(a,s,Orb(a))G(a, s, \mathrm{Orb}(a)) is connected, and |Orb(s)|+|Orb(s∘a)|=n+3|\mathrm{Orb}(s)| + |\mathrm{Orb}(s \circ a)| = n + 3. Two labelled planar maps (a1,s1)(a_1, s_1) and (a2,s2)(a_2, s_2) of size nn are isomorphic if some permutation rr on DnD_n fixes the root dart 00 and satisfies a2∘r=r∘a1a_2 \circ r = r \circ a_1 and s2∘r=r∘s1s_2 \circ r = r \circ s_1.✦ A rooted planar map MM with n+1n+1 edges is an equivalence class of labelled planar maps under root-preserving map isomorphism, carrying a representative edge-reversal involution aMa_M and vertex-rotation permutation sMs_M, vertex set V(M)=Orb(sM)V(M) = \mathrm{Orb}(s_M), edge set E(M)=Orb(aM)E(M) = \mathrm{Orb}(a_M), and spanning subgraph GM(A)=G(aM,sM,A)G_M(A) = G(a_M, s_M, A) for A⊆E(M)A \subseteq E(M).

A metric measure space presentation (X,𝜚,ℱ,μ)(X, \varrho, \mathcal{F}, \mu) is a quadruple consisting of a set XX, a real-valued distance function 𝜚\varrho on X×XX \times X, a σ\sigma-algebra ℱ\mathcal{F} on XX, and a measure μ\mu on (X,ℱ)(X, \mathcal{F}).✦ For a rooted planar map MM with n+1n+1 edges, writing δx\delta_x for the Dirac measure at a point xx, the normalized vertex degree measure μM\mu_M on V(M)V(M) is defined by μM=∑d∈Dn12(n+1)δ[d]sM.\mu_M = \sum_{d \in D_n} \frac{1}{2(n+1)}\, \delta_{[d]_{s_M}}.(1)✦ For any real scale factor α∈ℝ\alpha \in \mathbb{R}, the rescaled map metric measure space MαM^\alpha of MM is the metric measure space presentation on V(M)V(M) assigning to vertices v,w∈V(M)v, w \in V(M) the distance αdistGM(E(M))(v,w)\alpha\, \mathrm{dist}_{G_M(E(M))}(v, w) using graph distance in GM(E(M))G_M(E(M)), equipped with the discrete σ\sigma-algebra on V(M)V(M) and the measure μM\mu_M from (1).✦

For a rooted planar map MM with n+1n+1 edges and a subset A⊆E(M)A \subseteq E(M), let k(M,A)k(M, A) be the number of connected components of GM(A)G_M(A).✦ At parameter q∈ℝq \in \mathbb{R}, the FK-decorated map weight wq(M,A)w_q(M, A) is wq(M,A)=qk(M,A)+(|A|−|V(M)|)/2,w_q(M, A) = q^{k(M, A) + (|A| - |V(M)|)/2},(2)✦ and the finite FK partition function Zq,nZ_{q,n} summed over all rooted planar maps MM with n+1n+1 edges is Zq,n=∑M∑A⊆E(M)wq(M,A).Z_{q,n} = \sum_{M} \sum_{A \subseteq E(M)} w_q(M, A).(3)✦ For α∈ℝ\alpha \in \mathbb{R} and a test functional FF from metric measure space presentations to ℝ\mathbb{R}, the finite FK map expectation 𝔼q,nα[F]\mathbb{E}_{q,n}^{\alpha}[F] is defined via (2) and (3) by 𝔼q,nα[F]=∑M∑A⊆E(M)wq(M,A)Zq,nF(Mα).\mathbb{E}_{q,n}^{\alpha}[F] = \sum_{M} \sum_{A \subseteq E(M)} \frac{w_q(M, A)}{Z_{q,n}}\, F(M^\alpha).(4)✦

Tree-decorated Maps, Inventory Words, and Core Decomposition

Given permutations (a,s)(a, s) on DnD_n and edge subsets C,R⊆Orb(a)C, R \subseteq \mathrm{Orb}(a), the set of spanning tree completions 𝒯(a,s,C,R)\mathcal{T}(a, s, C, R) is the set of spanning trees extending CC within RR.✦ A tree-decorated rooted map (M,T)(M, T) of size nn is a pair consisting of a rooted planar map MM with n+1n+1 edges and a spanning tree T∈𝒯(aM,sM,∅,E(M))T \in \mathcal{T}(a_M, s_M, \emptyset, E(M)).✦ For an involution aa on DnD_n and A⊆Orb(a)A \subseteq \mathrm{Orb}(a), the partial dart reversal reva,A\mathrm{rev}_{a, A} is the permutation on DnD_n applying aa to darts with [d]a∈A[d]_a \in A and fixing all other darts.✦ A canonical rooted tree map (a,s,A)(a, s, A) of size nn is a triple consisting of a labelled planar map (a,s)(a, s) of size nn and an edge-orbit subset A⊆Orb(a)A \subseteq \mathrm{Orb}(a) satisfying the tour condition that s∘reva,As \circ \mathrm{rev}_{a, A} equals the cyclic shift d↦d+1(mod⁡2(n+1))d \mapsto d + 1 \pmod{2(n+1)} on DnD_n.✦ Using the root tour numbering i↦σi(0)i \mapsto \sigma^i(0) of a single-cycle permutation σ\sigma on DnD_n, canonicalization maps each tree-decorated rooted map of size nn bijectively to a canonical rooted tree map of size nn.

An FK parameter choice pp is a real number in (1/2,1)(1/2, 1); for q>4q > 4, setting t=qt = \sqrt{q} gives p(q)=t/(t+2)∈(1/2,1)p(q) = t/(t+2) \in (1/2, 1).✦ For an FK parameter choice p∈(1/2,1)p \in (1/2, 1), the flexible-order parameter θ(p)\theta(p) is the real number 1+2p/(1−p)1 + 2p/(1-p) and the radius parameter u(p)u(p) is the real number (1−p)/16(1-p)/16. The inventory alphabet 𝒜={b0,b1,o0,o1,o*}\mathcal{A} = \{b_0, b_1, o_0, o_1, o_*\} consists of two burger types b0,b1b_0, b_1 (indexed by {0,1}\{0, 1\}, taking 11 as the first type and 00 as the second), two fixed orders o0,o1o_0, o_1, and one flexible order o*o_*.✦ An inventory evaluation state consists of a list of pending orders and a freshest-first stack of burger types in {0,1}\{0, 1\}✦; evaluating a word over 𝒜\mathcal{A} 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 λp\lambda_p on 𝒜\mathcal{A} assigning mass 1/41/4 to each burger, p/2p/2 to o*o_*, and (1−p)/4(1-p)/4 to each fixed order, let λp⊗ℕ\lambda_p^{\otimes \mathbb{N}} be the i.i.d. measure on infinite streams of letters. Writing p∅(p,N)p_{\emptyset}(p, N) for the probability under λp⊗ℕ\lambda_p^{\otimes \mathbb{N}} that the initial word of length NN of a stream is empty-reducing, the total empty-word probability τ(p)\tau(p) is τ(p)=∑n=0∞p∅(p,2n).\tau(p) = \sum_{n=0}^{\infty} p_{\emptyset}(p, 2n).(5)✦

The typed burger-order alphabet 𝒜typ\mathcal{A}_{\mathrm{typ}} is the set {b0,b1,o0,o1}\{b_0, b_1, o_0, o_1\}, consisting of the burger and order letters carrying an explicit type in {0,1}\{0, 1\}.✦ Executing a word over 𝒜typ\mathcal{A}_{\mathrm{typ}} against a freshest-first stack of types in {0,1}\{0, 1\} returns the updated stack upon valid matches or fails on an illegal closure, and 𝒲emp\mathcal{W}^{\mathrm{emp}} (with 𝒲Nemp\mathcal{W}_N^{\mathrm{emp}} for length NN) is the set of stack-emptying typed words whose execution from the empty stack finishes with an empty stack. For a typed word ww, the flexible closing count f(w)f(w) counts the flexible-order closures encountered along its execution from the empty stack, and for θ,r∈ℝ\theta, r \in \mathbb{R} its inventory word monomial weight is mθ,r(w)=θf(w)r|w|.m_{\theta, r}(w) = \theta^{f(w)} r^{|w|}.(6)✦

A successful dart word ww of size nn is a map from DnD_n to 𝒜typ\mathcal{A}_{\mathrm{typ}} whose sequence (w(0),…,w(2n+1))(w(0), \dots, w(2n+1)) belongs to 𝒲2(n+1)emp\mathcal{W}_{2(n+1)}^{\mathrm{emp}}.✦ Let 𝒮n\mathcal{S}_n denote the set of successful dart words of size nn; for q∈ℝq \in \mathbb{R}, the typed word partition function is Zq,nword=∑w∈𝒮n(1+q)f(w).Z_{q,n}^{\mathrm{word}} = \sum_{w \in \mathcal{S}_n} (1 + \sqrt{q})^{f(w)}.(7)✦ Assigning to each dart i∈Dni \in D_n in a canonical rooted tree map (a,s,A)(a, s, A) the burger b𝟏[i]a∈Ab_{\mathbf{1}_{[i]_a \in A}} when i<a(i)i < a(i) and the order o𝟏[i]a∈Ao_{\mathbf{1}_{[i]_a \in A}} otherwise yields the canonical tour matching word in 𝒮n\mathcal{S}_n, inducing bijections from canonical rooted tree maps and hence from tree-decorated rooted maps of size nn to 𝒮n\mathcal{S}_n.

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 MM for a typed word ww along a list ll consists of two non-crossing arch matchings on ll whose combined endpoints permute ll, with the first pairing burgers of type 11 to orders of type 11 and the second pairing burgers of type 00 to orders of type 00✦, and the mate permutation πM\pi_M of MM is the arch transposition product of the combined arch lists. For any permutation π\pi on {0,…,K−1}\{0, \dots, K-1\}, an opener ii of π\pi is an index with i<π(i)i < \pi(i), two openers x,yx, y of π\pi cross if 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 whose vertices are the openers of π\pi and whose edges connect crossing pairs. A typed word ww of length KK satisfies the connected core word condition, written w∈𝒞w \in \mathcal{C}, if it admits a two-stack matching certificate MM on {0,…,K−1}\{0, \dots, K-1\} whose mate permutation πM\pi_M has an opener at index 00 from which every opener of πM\pi_M is reachable in the chord intersection graph of πM\pi_M✦; elements of 𝒞\mathcal{C} are connected typed cores.✦

The set ℒcore\mathcal{L}_{\mathrm{core}} of optional core labels consists of the empty label ⌀\varnothing, of arity 00, and every connected typed core c∈𝒞c \in \mathcal{C}, of arity |c||c|. For θ,r,τ∈ℝ\theta, r, \tau \in \mathbb{R}, the parametric core label mass mθ,r,τ:ℒcore→ℝm_{\theta, r, \tau} : \mathcal{L}_{\mathrm{core}} \to \mathbb{R} is defined via (6) by mθ,r,τ(ℓ)={1/τif ℓ=⌀,mθ,rτ(c)/τif ℓ=c∈𝒞.m_{\theta, r, \tau}(\ell) = \begin{cases} 1/\tau & \text{if } \ell = \varnothing, \\ m_{\theta, r\tau}(c)/\tau & \text{if } \ell = c \in \mathcal{C}. \end{cases}(8)✦ For an FK parameter p∈(1/2,1)p \in (1/2, 1) with θ=θ(p)\theta = \theta(p), r=u(p)r = \sqrt{u(p)}, and τ=τ(p)\tau = \tau(p) from (5), the root core mark distribution ρp\rho_p on ℒcore\mathcal{L}_{\mathrm{core}} assigns probability weight mθ,r,τ(ℓ)m_{\theta, r, \tau}(\ell) to each ℓ∈ℒcore\ell \in \mathcal{L}_{\mathrm{core}}, and the conditional core mark distribution κp(k)\kappa_p(k) at arity k≥0k \ge 0 is ρp\rho_p conditioned on labels of arity kk, or the point mass δ⌀\delta_{\varnothing} when no optional core label has arity kk.✦

An ordered tree of cores TT is either a leaf or a branch consisting of a connected typed core c∈𝒞c \in \mathcal{C} and child core trees (Ti)i=0|c|−1(T_i)_{i=0}^{|c|-1} indexed by the corners of cc.✦ For an ordered tree of cores TT, the label sequence labels(T)\mathrm{labels}(T) is (⌀)(\varnothing) at a leaf and cc followed by the concatenated label sequences of its children at a branch, with degree sequence degrees(T)\mathrm{degrees}(T) given by the arities of labels(T)\mathrm{labels}(T). For an ordered tree of cores TT, the typed word w(T)w(T) is the empty word at a leaf and inserts the subwords w(Ti)w(T_i) into the corners of cc at a branch; for every ordered tree of cores TT, the word w(T)w(T) empties the stack✦, and T↦w(T)T \mapsto w(T) is a bijection onto 𝒲emp\mathcal{W}^{\mathrm{emp}}. For θ,r,τ∈ℝ\theta, r, \tau \in \mathbb{R}, the core tree product mass Πθ,r,τ(T)\Pi_{\theta, r, \tau}(T) is defined via (6) by Πθ,r,τ(T)={1/τif T=leaf,mθ,rτ(c)τ∏i=0|c|−1Πθ,r,τ(Ti)if T=branch(c,(Ti)).\Pi_{\theta, r, \tau}(T) = \begin{cases} 1/\tau & \text{if } T = \mathrm{leaf}, \\ \dfrac{m_{\theta, r\tau}(c)}{\tau} \displaystyle\prod_{i=0}^{|c|-1} \Pi_{\theta, r, \tau}(T_i) & \text{if } T = \mathrm{branch}(c, (T_i)). \end{cases}(9)✦

Tree Coding, Block Weights, and the Marked Tree Law

For a sequence d:{0,…,N−1}→{0,…,N−1}d : \{0, \dots, N-1\} \to \{0, \dots, N-1\}, the degree partial walk is Sj(d)=∑i<j(di−1)S_j(d) = \sum_{i < j} (d_i - 1) for j≥0j \ge 0✦; dd is a discrete bridge of length NN if SN(d)=−1S_N(d) = -1✦, and dd is a Łukasiewicz tree code of length NN, written d∈Code(N)d \in \mathrm{Code}(N), if SN(d)=−1S_N(d) = -1 and Sj(d)≥0S_j(d) \ge 0 for all j<Nj < N. For an integer array d:{0,…,N−1}→ℕd : \{0, \dots, N-1\} \to \mathbb{N}, the total step of dd is the integer sum ∑i=0N−1(di−1)\sum_{i=0}^{N-1}(d_i - 1).✦ The degree increment word of a list of nonnegative integers is the integer list obtained by subtracting 11 from each entry, and an integer list satisfies the discrete excursion condition if its sum is −1-1 and all of its prefix sums are nonnegative.✦ For a discrete bridge of positive length NN, the unique good rotation index is the cyclic shift index m∈{0,…,N−1}m \in \{0, \dots, N-1\} under which every prefix sum of the rotated bridge remains nonnegative; shifting the bridge cyclically by mm gives its canonical tree code in Code(N)\mathrm{Code}(N), and an array of length 2n+12n+1 with total step −1-1 similarly maps to a tree code in Code(2n+1)\mathrm{Code}(2n+1). For each n≥0n \ge 0, the binary comb tree code in Code(2n+1)\mathrm{Code}(2n+1) assigns degree 22 to positions i<ni < n and 00 to positions n≤i<2n+1n \le i < 2n+1.✦

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 (d,ℓ)(d, \ell) of length NN is a pair in Code(N)×ℒcoreN\mathrm{Code}(N) \times \mathcal{L}_{\mathrm{core}}^{N} such that arity(ℓi)=di\mathrm{arity}(\ell_i) = d_i for every i∈{0,…,N−1}i \in \{0, \dots, N-1\}.✦ 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 NN to core trees with label length NN, from compatible marked tree codes of length N+1N+1 to 𝒲Nemp\mathcal{W}_N^{\mathrm{emp}} via core trees of label length N+1N+1, and from 𝒮n\mathcal{S}_n to compatible marked tree codes of length 2(n+1)+12(n+1)+1; write Ψn\Psi_n for the last bijection.

A critical even offspring distribution ν\nu is a sequence (νk)k≥0(\nu_k)_{k \ge 0} with νk≥0\nu_k \ge 0, ∑k=0∞νk=1\sum_{k=0}^{\infty} \nu_k = 1, even support (νk=0\nu_k = 0 for odd kk), ν0>0\nu_0 > 0, ν2>0\nu_2 > 0, mean ∑k=0∞kνk=1\sum_{k=0}^{\infty} k \nu_k = 1, and finite second moment ∑k=0∞k2νk<∞\sum_{k=0}^{\infty} k^2 \nu_k < \infty.✦ Its tree code weight on d∈Code(N)d \in \mathrm{Code}(N) is wν(d)=∏i=0N−1νdiw_{\nu}(d) = \prod_{i=0}^{N-1} \nu_{d_i}✦, and its tree code partition function at length NN is Zνcode(N)=∑d∈Code(N)wν(d).Z_{\nu}^{\mathrm{code}}(N) = \sum_{d \in \mathrm{Code}(N)} w_{\nu}(d).(10)✦

A sequence of block offspring probability weights b=(bm)m≥0b = (b_m)_{m \ge 0} is a sequence with bm≥0b_m \ge 0 and ∑m=0∞bm=1\sum_{m=0}^{\infty} b_m = 1, whose doubled sequence b̃\tilde{b} is given by b̃k=bk/2\tilde{b}_k = b_{k/2} for even kk and b̃k=0\tilde{b}_k = 0 for odd kk; whenever b0>0b_0 > 0, b1>0b_1 > 0, ∑m=0∞mbm=1/2\sum_{m=0}^{\infty} m b_m = 1/2, and ∑m=0∞m2bm<∞\sum_{m=0}^{\infty} m^2 b_m < \infty, the doubled sequence b̃\tilde{b} forms a critical even offspring distribution.✦ For θ∈ℝ\theta \in \mathbb{R} and m≥0m \ge 0, the core and block generating coefficients are cm(θ)=∑w∈𝒲2memp∩𝒞θf(w),bmraw(θ)=𝟏m=0+cm(θ).c_m(\theta) = \sum_{w \in \mathcal{W}_{2m}^{\mathrm{emp}} \cap \mathcal{C}} \theta^{f(w)}, \qquad b_m^{\mathrm{raw}}(\theta) = \mathbf{1}_{m=0} + c_m(\theta).(11) For an FK parameter p∈(1/2,1)p \in (1/2, 1) with θ=θ(p)\theta = \theta(p), u=u(p)u = u(p), and τ=τ(p)\tau = \tau(p) from (5), the actual FK block mass is defined via (11) by bp,m=bmraw(θ)(uτ2)mτ,b_{p, m} = \frac{b_m^{\mathrm{raw}}(\theta)\, (u \tau^2)^m}{\tau},(12)✦ and doubling (bp,m)m≥0(b_{p,m})_{m \ge 0} from (12) defines the critical FK corner offspring distribution νp\nu_p.✦

Given a critical even offspring distribution ν\nu, let ν⊗N\nu^{\otimes N} be the i.i.d. product measure on ℕN\mathbb{N}^N✦, let the conditioned offspring bridge law at size nn be the measure ν⊗(2n+1)\nu^{\otimes (2n+1)} conditioned on arrays d∈ℕ2n+1d \in \mathbb{N}^{2n+1} with total step ∑i=02n(di−1)=−1\sum_{i=0}^{2n} (d_i - 1) = -1, and let the conditioned tree code law ℙν,ncode\mathbb{P}_{\nu, n}^{\mathrm{code}} be the pushforward of this conditioned measure onto Code(2n+1)\mathrm{Code}(2n+1) under the cyclic rotation map. Given a Markov kernel κ\kappa from ℕ\mathbb{N} to measures on ℒcore\mathcal{L}_{\mathrm{core}}, the tree code marking kernel assigns to each d∈Code(N)d \in \mathrm{Code}(N) the conditional mark product measure ⨂i=0N−1κ(di)\bigotimes_{i=0}^{N-1} \kappa(d_i), and the marked tree code law ℙν,κ,nmarked\mathbb{P}_{\nu, \kappa, n}^{\mathrm{marked}} on Code(2n+1)×ℒcore2n+1\mathrm{Code}(2n+1) \times \mathcal{L}_{\mathrm{core}}^{2n+1} is the semidirect product of ℙν,ncode\mathbb{P}_{\nu, n}^{\mathrm{code}} with this marking kernel.✦ For α∈ℝ\alpha \in \mathbb{R}, n≥0n \ge 0, and a functional FF from metric measure space presentations to ℝ\mathbb{R}, the marked tree map test observable F̃α,n(d,ℓ)\widetilde{F}_{\alpha, n}(d, \ell) on Code(2(n+1)+1)×ℒcore2(n+1)+1\mathrm{Code}(2(n+1)+1) \times \mathcal{L}_{\mathrm{core}}^{2(n+1)+1} evaluates F(Mα)F(M^\alpha) on the underlying rooted map MM obtained from (d,ℓ)(d, \ell) by inverting Ψn\Psi_n and the map-to-word bijection whenever arity(ℓi)=di\mathrm{arity}(\ell_i) = d_i for all ii, and returns 00 otherwise.✦

The Claim

Theorem 1. For every q>4q > 4 with p=p(q)p = p(q), every scale factor α∈ℝ\alpha \in \mathbb{R}, every integer n≥0n \ge 0, and every functional FF from metric measure space presentations to ℝ\mathbb{R}, the finite FK map expectation (4) and the marked tree code law satisfy (13), 𝔼q,nα[F]=∫F̃α,n(x)dℙνp,κp,n+1marked(x).\mathbb{E}_{q,n}^{\alpha}[F] = \int \widetilde{F}_{\alpha,n}(x)\, \mathrm{d}\mathbb{P}_{\nu_p, \kappa_p, n+1}^{\mathrm{marked}}(x).(13)✦ For every q>4q > 4 with p=p(q)p = p(q) and every n≥0n \ge 0, the marked tree code law satisfies (14) in terms of (7), ℙνp,κp,n+1marked=∑w∈𝒮n(1+q)f(w)Zq,nwordδΨn(w).\mathbb{P}_{\nu_p, \kappa_p, n+1}^{\mathrm{marked}} = \sum_{w \in \mathcal{S}_n} \frac{(1 + \sqrt{q})^{f(w)}}{Z_{q,n}^{\mathrm{word}}}\, \delta_{\Psi_n(w)}.(14)✦ For every FK parameter p∈(1/2,1)p \in (1/2, 1) with θ=θ(p)\theta = \theta(p), u=u(p)u = u(p), and τ=τ(p)\tau = \tau(p), and every n≥0n \ge 0, the marked tree code law satisfies (15) in terms of (6) and (10), ℙνp,κp,n+1marked=∑w∈𝒮nmθ,u(w)/τZνpcode(2(n+1)+1)δΨn(w).\mathbb{P}_{\nu_p, \kappa_p, n+1}^{\mathrm{marked}} = \sum_{w \in \mathcal{S}_n} \frac{m_{\theta, \sqrt{u}}(w) / \tau}{Z_{\nu_p}^{\mathrm{code}}(2(n+1)+1)}\, \delta_{\Psi_n(w)}.(15)✦ For all real numbers θ,r,τ\theta, r, \tau with τ≠0\tau \neq 0, every core label excursion list ll with corresponding core tree TlT_l, and every ordered tree of cores TT, the label masses (8) and product mass (9) satisfy (16) and (17), ∏j=0|l|−1mθ,r,τ(lj)=mθ,r(w(Tl))τ,\prod_{j=0}^{|l|-1} m_{\theta, r, \tau}(l_j) = \frac{m_{\theta, r}(w(T_l))}{\tau},(16)✦ Πθ,r,τ(T)=mθ,r(w(T))τ.\Pi_{\theta, r, \tau}(T) = \frac{m_{\theta, r}(w(T))}{\tau}.(17)✦ The two-letter typed word b1o1b_1 o_1 satisfies (18), b1o1∈𝒞.b_1 o_1 \in \mathcal{C}.(18)✦ For every critical even offspring distribution ν\nu and every integer n≥0n \ge 0, the tree code partition function (10) satisfies (19), Zνcode(2n+1)>0.Z_{\nu}^{\mathrm{code}}(2n + 1) > 0.(19)✦

In the paper, the result reads: the marked tree conditioned to have N=2n+1N = 2n + 1 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 n+1n+1 edges and tree codes of size 2(n+1)+12(n+1)+1, together with the positive partition weight (19) at every odd size 2n+12n+1.

What Is Checked

The claims (13) through (19) are stated over rooted planar maps with n+1n+1 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 DnD_n is bijective✦, and for every p∈(1/2,1)p \in (1/2, 1) the actual FK block weights (12) are nonnegative at every m≥0m \ge 0✦ and strictly positive at m=0m = 0 and m=1m = 1.