OctoInformBeta

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

Lemma 4.1 [Rooted corner substitution]: Corner insertion maps valid corner words bijectively onto nonempty typed words and yields core and block series identities on the unit interval

Corner substitution and generating series for inventory words.

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

Consider finite Fortuin-Kasteleyn (FK) planar maps with Potts parameter q>4q > 4, where T(z)=∑n≥0anznT(z) = \sum_{n \ge 0} a_n z^n is the map generating function for the coefficient sequence aa and Φ(y)=1+∑m≥1bmym\Phi(y) = 1 + \sum_{m \ge 1} b_m y^m is the block generating function. How does a nontrivial rooted planar map decompose into a single rooted block with rooted maps inserted at its corners, and what relation between TT and Φ\Phi follows from that decomposition?

Inventory Words and Generating Series

An FK model parameter pp is a real probability parameter in (1/2,1)(1/2, 1).✦ The set 𝔹\mathbb{B} of boolean burger types is {true,false}\{\mathrm{true}, \mathrm{false}\}. The set 𝖮𝗋𝖽\mathsf{Ord} of inventory orders consists of the flexible order and the fixed orders carrying a type in 𝔹\mathbb{B}.✦ The finite alphabet 𝒜\mathcal{A} of burger-order letters consists of the burger tokens of each type in 𝔹\mathbb{B} and the order tokens carrying an element of 𝖮𝗋𝖽\mathsf{Ord}.✦

For an FK model parameter p∈(1/2,1)p \in (1/2, 1), the letter mass function νp:𝒜→ℝ\nu_p : \mathcal{A} \to \mathbb{R} is the function assigning mass 1/41/4 to each burger token, p/2p/2 to the flexible order token, and (1−p)/4(1 - p)/4 to each fixed order token.✦ The letter distribution μp\mu_p on 𝒜\mathcal{A} is the probability mass function with point masses νp(a)\nu_p(a) for a∈𝒜a \in \mathcal{A}.✦ For any index set II, the independent and identically distributed (i.i.d.) inventory stream measure ℙp\mathbb{P}_p on 𝒜I\mathcal{A}^I is the product measure of copies of μp\mu_p.✦ Given an infinite sequence ξ∈𝒜ℕ\xi \in \mathcal{A}^{\mathbb{N}} and an integer N≥0N \ge 0, the letter sequence prefix ξ|N\xi|_N is the finite sequence (ξ0,…,ξN−1)(\xi_0, \dots, \xi_{N-1}) indexed by {0,…,N−1}\{0, \dots, N-1\}✦, and the letter stream initial word wN(ξ)w_N(\xi) is the corresponding list of length NN over 𝒜\mathcal{A}.✦

An inventory stack evaluation state e=(O,B)e = (O, B) is a pair of a list OO of pending orders in 𝖮𝗋𝖽\mathsf{Ord} and a stack BB of boolean burger types in 𝔹\mathbb{B} stored freshest-first.✦ The evaluation run⁡(w,e)\operatorname{run}(w, e) of a word ww over 𝒜\mathcal{A} on a state ee is the state that equals ee when ww is empty, and on a word starting with letter aa followed by suffix w′w' recursively evaluates w′w' on the state obtained from ee by the single-step transition on aa, in which an order consumes the freshest eligible burger.✦ The word reduction red⁡(w)\operatorname{red}(w) of a word ww over 𝒜\mathcal{A} is the state run⁡(w,([],[]))\operatorname{run}(w, ([], [])).✦ An empty-reducing word ww over 𝒜\mathcal{A} is a word over 𝒜\mathcal{A} that satisfies red⁡(w)=([],[])\operatorname{red}(w) = ([], []).✦

At length N≥0N \ge 0 and FK model parameter p∈(1/2,1)p \in (1/2, 1), the empty-reducing word probability ηp(N)\eta_p(N) is the probability under ℙp\mathbb{P}_p that the initial word wN(ξ)w_N(\xi) of a stream ξ∈𝒜ℕ\xi \in \mathcal{A}^{\mathbb{N}} satisfies the empty-reducing word condition.✦ For an FK model parameter p∈(1/2,1)p \in (1/2, 1) and a real number xx, the inventory generating series T(x)T(x) is T(x)=∑m≥0ηp(2m)xm.T(x) = \sum_{m \ge 0} \eta_p(2m) x^m.(1)✦

The finite typed alphabet 𝒜ty\mathcal{A}_{\mathrm{ty}} of typed burger-order letters consists of the burger tokens and the order tokens carrying an explicit type in 𝔹\mathbb{B}.✦ Given a finite word ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} and a boolean stack ss, typed word stack execution evaluates ww against ss and returns either a resulting boolean stack or failure upon an illegal closure: on the empty word it returns ss, and on a leading letter aa followed by suffix w′w' it applies the single-step typed transition to ss and aa and recursively executes w′w' on the updated stack, failing if that step fails.✦ The set 𝒲\mathcal{W} of stack-emptying typed words consists of all finite words ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} whose typed word stack execution from [][] succeeds and returns [][].✦ The set 𝒲+\mathcal{W}_+ of nonempty typed words is the subset of 𝒲\mathcal{W} consisting of all words in 𝒲\mathcal{W} of positive length.✦ For any finite alphabet Σ\Sigma and integer N≥0N \ge 0, the set ΣN\Sigma^N of words of length NN is the finite set of all length-NN lists with entries in Σ\Sigma.✦ For an integer N≥0N \ge 0, the set 𝒲N\mathcal{W}_N of empty-reducing typed words of length NN is the subset of 𝒜tyN\mathcal{A}_{\mathrm{ty}}^N consisting of all words in 𝒜tyN\mathcal{A}_{\mathrm{ty}}^N whose typed word stack execution from [][] succeeds and returns [][].✦

The flexible closing count flex⁡(w,s)\operatorname{flex}(w, s) of a finite word ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} against a boolean stack ss is zero when ww is empty; when ww starts with letter aa followed by suffix vv, it equals zero if the single-step typed transition on ss and aa fails, and otherwise equals flex⁡(v,s′)\operatorname{flex}(v, s') plus 11 when that transition is a flexible order closure and 00 when it is not, where s′s' is the updated stack.✦ For parameters τ,r\tau, r in a commutative monoid RR, the inventory word monomial weight ω(τ,r;w)∈R\omega(\tau, r; w) \in R of a finite word ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} is ω(τ,r;w)=τflex⁡(w,[])r|w|,\omega(\tau, r; w) = \tau^{\operatorname{flex}(w, [])} r^{|w|},(2)✦ where |w||w| denotes the length of ww. For extended nonnegative real parameters τ,r∈[0,∞]\tau, r \in [0, \infty], the word generating series W(τ,r)∈[0,∞]W(\tau, r) \in [0, \infty] is W(τ,r)=∑w∈𝒲ω(τ,r;w).W(\tau, r) = \sum_{w \in \mathcal{W}} \omega(\tau, r; w).(3)✦

Matchings, Connected Cores, and Corner Insertion

Given a set XX and a finite list ll of elements of XX, a non-crossing arch matching EE on ll is a list of ordered pairs in X×XX \times X that arises from the empty matching [][] on [][] by finitely many steps of either prepending an unmatched element a∈Xa \in X to a list l′l' without changing a matching on l′l', or taking non-crossing arch matchings E′E' on a list LL and F′F' on a list RR and forming (a,b)(a, b) followed by E′E' and F′F' on the list formed by aa, LL, bb, and RR.✦ The endpoints of paired arches for a list EE of pairs in X×XX \times X form the list obtained by listing aa and bb in order for each pair (a,b)(a, b) in EE.✦ The arch transposition product turns⁡(E)\operatorname{turns}(E) of a list EE of pairs in X×XX \times X is the permutation of XX defined recursively as the identity on [][] and as turns⁡(E′)(ab)\operatorname{turns}(E') \, (a \; b) when EE consists of (a,b)(a, b) followed by E′E', where (ab)(a \; b) is the transposition swapping aa and bb.✦ Given a map v:X→𝒜tyv : X \to \mathcal{A}_{\mathrm{ty}} and a list ll in XX, a two-stack matching certificate M=(E1,E2)M = (E_1, E_2) for vv along ll is a pair of two non-crossing arch matchings E1E_1 and E2E_2 on ll whose concatenated list of paired endpoints is a permutation of ll, such that every pair (i,j)∈E1(i, j) \in E_1 matches a burger token v(i)v(i) of type true\mathrm{true} with an order token v(j)v(j) of type true\mathrm{true} and every pair (i,j)∈E2(i, j) \in E_2 matches a burger token v(i)v(i) of type false\mathrm{false} with an order token v(j)v(j) of type false\mathrm{false}.✦ The stack matching mate permutation σM\sigma_M on XX of a two-stack matching certificate M=(E1,E2)M = (E_1, E_2) is the arch transposition product turns\operatorname{turns} applied to the concatenation of E1E_1 and E2E_2.✦

For an integer N≥0N \ge 0 and a permutation σ\sigma of {0,…,N−1}\{0, \dots, N-1\}, the set Op⁡(σ)\operatorname{Op}(\sigma) of chord opening endpoints is {i∈{0,…,N−1}:i<σ(i)}\{i \in \{0, \dots, N-1\} : i < \sigma(i)\}. For a permutation σ\sigma of {0,…,N−1}\{0, \dots, N-1\}, two chord opening endpoints i,j∈Op⁡(σ)i, j \in \operatorname{Op}(\sigma) satisfy the chord crossing relation if either i<j<σ(i)<σ(j)i < j < \sigma(i) < \sigma(j) or j<i<σ(j)<σ(i)j < i < \sigma(j) < \sigma(i).✦ The chord intersection graph G(σ)G(\sigma) of a permutation σ\sigma of {0,…,N−1}\{0, \dots, N-1\} is the simple graph on vertex set Op⁡(σ)\operatorname{Op}(\sigma) whose edges are the pairs {i,j}\{i, j\} satisfying the chord crossing relation.✦ A connected core word ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} is a finite word over 𝒜ty\mathcal{A}_{\mathrm{ty}} such that there exist an integer K≥0K \ge 0, a map v:{0,…,K−1}→𝒜tyv : \{0, \dots, K-1\} \to \mathcal{A}_{\mathrm{ty}} whose list of values (v(0),…,v(K−1))(v(0), \dots, v(K-1)) equals ww, and a two-stack matching certificate MM for vv along (0,…,K−1)(0, \dots, K-1) such that 0∈Op⁡(σM)0 \in \operatorname{Op}(\sigma_M) and every vertex in Op⁡(σM)\operatorname{Op}(\sigma_M) is reachable from 00 in G(σM)G(\sigma_M).✦ The set 𝒞core\mathcal{C}_{\mathrm{core}} of connected typed cores consists of all finite words ww over 𝒜ty\mathcal{A}_{\mathrm{ty}} satisfying the connected core word condition.✦

A finite list l=((a1,w1),…,(ak,wk))l = ((a_1, w_1), \dots, (a_k, w_k)) pairing letters ai∈𝒜tya_i \in \mathcal{A}_{\mathrm{ty}} with finite words wiw_i over 𝒜ty\mathcal{A}_{\mathrm{ty}} is a valid corner list if (a1,…,ak)(a_1, \dots, a_k) is a connected core word and for each ii the typed word stack execution of wiw_i from [][] succeeds and returns [][].✦ The set 𝒞\mathcal{C} of valid corner words consists of all finite lists ll pairing letters in 𝒜ty\mathcal{A}_{\mathrm{ty}} with finite words over 𝒜ty\mathcal{A}_{\mathrm{ty}} that satisfy the valid corner condition.✦ For any finite list l=((a1,w1),…,(ak,wk))l = ((a_1, w_1), \dots, (a_k, w_k)) pairing letters ai∈𝒜tya_i \in \mathcal{A}_{\mathrm{ty}} with finite words wiw_i over 𝒜ty\mathcal{A}_{\mathrm{ty}}, the literal corner insertion ins⁡(l)\operatorname{ins}(l) is the concatenated word a1w1⋯akwka_1 w_1 \cdots a_k w_k.✦ The corner insertion map ι:𝒞→𝒲+\iota : \mathcal{C} \to \mathcal{W}_+ is the map sending each valid corner word l∈𝒞l \in \mathcal{C} to ins⁡(l)\operatorname{ins}(l).✦

Given a real parameter τ\tau and an integer m≥0m \ge 0, the core generating polynomial coefficient cm(τ)c_m(\tau) is cm(τ)=∑w∈𝒲2m∩𝒞coreτflex⁡(w,[]).c_m(\tau) = \sum_{w \in \mathcal{W}_{2m} \cap \mathcal{C}_{\mathrm{core}}} \tau^{\operatorname{flex}(w, [])}.(4)✦ The block generating polynomial coefficient bm(τ)b_m(\tau) for τ∈ℝ\tau \in \mathbb{R} and an integer m≥0m \ge 0 is bm(τ)=𝟏{m=0}+cm(τ).b_m(\tau) = \mathbf{1}_{\{m = 0\}} + c_m(\tau).(5)✦ For an FK model parameter p∈(1/2,1)p \in (1/2, 1), the flexible order parameter τp\tau_p is the real number 1+2p/(1−p)1 + 2p/(1 - p)✦, and the inventory radius parameter uu is the real number (1−p)/16(1 - p)/16.✦

The Claim

Theorem 1. The corner substitution bijection ι\iota is bijective✦ and defines the corner substitution bijection ι:𝒞→∼𝒲+.\iota : \mathcal{C} \xrightarrow{\sim} \mathcal{W}_+.(6)✦ For any two finite lists l1l_1 and l2l_2 pairing letters in 𝒜ty\mathcal{A}_{\mathrm{ty}} with finite words over 𝒜ty\mathcal{A}_{\mathrm{ty}} that satisfy the valid corner condition, ins⁡(l1)=ins⁡(l2)⟹l1=l2.\operatorname{ins}(l_1) = \operatorname{ins}(l_2) \implies l_1 = l_2.(7)✦ For any extended nonnegative real parameters τ,r∈[0,∞]\tau, r \in [0, \infty], ∑w∈𝒲+ω(τ,r;w)=∑c∈𝒞coreτflex⁡(c,[])(rW(τ,r))|c|.\sum_{w \in \mathcal{W}_+} \omega(\tau, r; w) = \sum_{c \in \mathcal{C}_{\mathrm{core}}} \tau^{\operatorname{flex}(c, [])} \bigl(r \, W(\tau, r)\bigr)^{|c|}.(8)✦ For any FK model parameter p∈(1/2,1)p \in (1/2, 1) and any real x∈[0,1]x \in [0, 1], the core series is summable and satisfies ∑m=0∞cm(τp)(uxT(x)2)m=T(x)−1,\sum_{m = 0}^{\infty} c_m(\tau_p) \bigl(u x T(x)^2\bigr)^m = T(x) - 1,(9)✦ and the block series is summable and satisfies ∑m=0∞bm(τp)(uxT(x)2)m=T(x).\sum_{m = 0}^{\infty} b_m(\tau_p) \bigl(u x T(x)^2\bigr)^m = T(x).(10)✦

In the paper, the result reads: every nontrivial rooted planar map is uniquely obtained from a rooted block by inserting a rooted map, possibly trivial, in each of its corners, with each nonempty insert attached at the origin of its root dart; moreover, aa is multiplicative when two maps are joined at one vertex, and consequently T(z)=Φ(zT(z)2)T(z) = \Phi(z T(z)^2).

Here stack-emptying typed words, connected typed cores, and valid corner lists correspond to maps, blocks, and corners, and the generating-function relation is stated at the rescaled argument uxT(x)2u x T(x)^2 for x∈[0,1]x \in [0, 1].

What Is Checked

The corner substitution bijection (6) and injectivity statement (7) are stated over finite lists satisfying the valid corner condition, valid corner words 𝒞\mathcal{C}, nonempty typed words 𝒲+\mathcal{W}_+, literal corner insertion ins\operatorname{ins}, and the corner insertion map ι\iota. In (8), the identity ranges over extended nonnegative real parameters τ,r∈[0,∞]\tau, r \in [0, \infty], nonempty typed words 𝒲+\mathcal{W}_+, connected typed cores 𝒞core\mathcal{C}_{\mathrm{core}}, flexible closing counts, inventory word monomial weights, and the word generating series W(τ,r)W(\tau, r). An FK model parameter p∈(1/2,1)p \in (1/2, 1), a real number x∈[0,1]x \in [0, 1], the flexible order parameter τp\tau_p, the inventory radius parameter uu, the core and block generating polynomial coefficients, and the inventory generating series T(x)T(x) underlie (9) and (10).

For these constructions, the letter mass function takes nonnegative values summing to 11 to define the letter distribution on 𝒜\mathcal{A}, the chord crossing relation is symmetric and loopless so that G(σ)G(\sigma) is a simple graph, and the literal corner insertion of any valid corner word is nonempty and stack-emptying.