OctoInformBeta

OpenAI preprint, September 2026 · §3. Ladder cuts and a coefficient lower bound · §3

Proposition 3.7 [Uniform success at a seam]: Raw and independent piece seams reduce to the empty state with positive uniform probability for Fortuin-Kasteleyn parameter p∈(1/2,1)p \in (1/2, 1)

Uniform reduction probabilities and deterministic matching at inventory seams.

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 the inventory model for Fortuin-Kasteleyn (FK) random planar maps with parameter p∈(1/2,1)p \in (1/2, 1) (corresponding to Potts parameter q>4q > 4 via t=qt = \sqrt{q} and p=t/(t+2)p = t / (t + 2)), words of burgers and orders evolve by cancelling matched letters on a stack. The question is whether seam intervals formed either by two independent letter streams stopped at opposite net levels determined by an integer h≥1h \ge 1 or by joining independent sequences of shortened left and right pieces reduce to the empty state with a positive probability uniform in hh, and what deterministic conditions on left and right trajectories force complete cancellation across a seam.

Inventory Words and Hitting Times

Throughout, ℕ={0,1,2,…}\mathbb{N} = \{0, 1, 2, \dots\} denotes the nonnegative integers, and ε\varepsilon denotes the empty word or empty list. Let ℬ={0,1}\mathcal{B} = \{0, 1\} be the set of two Boolean burger types. The inventory order set 𝒪\mathcal{O} consists of a fixed order obo_b for each b∈ℬb \in \mathcal{B} and one flexible order oflexo_{\mathrm{flex}}✦, and the burger-order alphabet 𝒜\mathcal{A} consists of a burger letter 𝖡(b)\mathsf{B}(b) for each b∈ℬb \in \mathcal{B} and an order letter 𝖮(o)\mathsf{O}(o) for each o∈𝒪o \in \mathcal{O}. Write 𝒜*\mathcal{A}^* for the set of finite words over 𝒜\mathcal{A}, juxtaposition for word concatenation, wrevw^{\mathrm{rev}} for the reversal of w∈𝒜*w \in \mathcal{A}^*, and |s||s| for the length of any list ss. The letter increment inc:𝒜→ℤ\mathrm{inc} : \mathcal{A} \to \mathbb{Z} assigns +1+1 to every burger letter 𝖡(b)\mathsf{B}(b) and −1-1 to every order letter 𝖮(o)\mathsf{O}(o).✦

An inventory stack evaluation state e=(Q,R)e = (Q, R) consists of a list QQ of pending orders in 𝒪\mathcal{O} and a list RR of burger types in ℬ\mathcal{B} stored freshest-first.✦ For a state ee, the evaluation eval(w,e)\mathrm{eval}(w, e) of a word w∈𝒜*w \in \mathcal{A}^* is defined recursively by eval(ε,e)=e\mathrm{eval}(\varepsilon, e) = e and eval(aw,e)=eval(w,step(e,a))\mathrm{eval}(aw, e) = \mathrm{eval}(w, \mathrm{step}(e, a)) for a∈𝒜a \in \mathcal{A}, where step(e,a)\mathrm{step}(e, a) is the single-step transition on aa in which an order consumes the freshest eligible burger.✦ The word reduction red(w)\mathrm{red}(w) of w∈𝒜*w \in \mathcal{A}^* is the evaluation state eval(w,(ε,ε))\mathrm{eval}(w, (\varepsilon, \varepsilon)) starting from empty pending orders and an empty burger stack✦, and ww reduces to the empty state if red(w)=(ε,ε)\mathrm{red}(w) = (\varepsilon, \varepsilon).

An FK model parameter pp is a real probability in (1/2,1)(1/2, 1).✦ The letter mass function mp:𝒜→ℝm_p : \mathcal{A} \to \mathbb{R} is given by (1): mp(𝖡(b))=14,mp(𝖮(oflex))=p2,mp(𝖮(ob))=1−p4(b∈ℬ).m_p(\mathsf{B}(b)) = \frac{1}{4}, \qquad m_p(\mathsf{O}(o_{\mathrm{flex}})) = \frac{p}{2}, \qquad m_p(\mathsf{O}(o_b)) = \frac{1 - p}{4} \qquad (b \in \mathcal{B}).(1)✦ The letter distribution νp\nu_p on 𝒜\mathcal{A} is the probability distribution determined by the nonnegative weights mpm_p.✦ For an index set II, the independent and identically distributed (i.i.d.) inventory stream measure ℙpI\mathbb{P}_p^I on 𝒜I\mathcal{A}^I is the product measure with marginal νp\nu_p at every coordinate i∈Ii \in I.✦

For a letter stream x=(xi)i≥0∈𝒜ℕx = (x_i)_{i \ge 0} \in \mathcal{A}^{\mathbb{N}} and n∈ℕn \in \mathbb{N}, the letter increment sum Sn(x)S_n(x) of xx at step nn is ∑i=0n−1inc(xi)∈ℤ\sum_{i=0}^{n-1} \mathrm{inc}(x_i) \in \mathbb{Z} (with S0(x)=0S_0(x) = 0). Given an initial level h∈ℕh \in \mathbb{N}, step n∈ℕn \in \mathbb{N}, and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the upward inventory path Uh(n,x)∈ℤU_h(n, x) \in \mathbb{Z} and the downward inventory path Vh(n,x)∈ℤV_h(n, x) \in \mathbb{Z} are defined by (2): Uh(n,x)=h−Sn+1(x),Vh(n,x)=h+Sn+1(x).U_h(n, x) = h - S_{n+1}(x), \qquad V_h(n, x) = h + S_{n+1}(x).(2) For a space Ω\Omega, an integer-valued process F:ℕ×Ω→ℤF : \mathbb{N} \times \Omega \to \mathbb{Z}, and a point ω∈Ω\omega \in \Omega, the first hitting time of zero τ0(F)(ω)∈ℕ∪{∞}\tau_0(F)(\omega) \in \mathbb{N} \cup \{\infty\} is the least n∈ℕn \in \mathbb{N} such that F(n,ω)=0F(n, \omega) = 0, or ∞\infty if no such nn exists. Writing t_=t\underline{t} = t for t∈ℕt \in \mathbb{N} and ∞_=0\underline{\infty} = 0, the first upward hitting time τh↑(x)\tau^{\uparrow}_h(x) of x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}} from level h∈ℕh \in \mathbb{N} is τ0(Uh)(x)\tau_0(U_h)(x), and the first downward hitting time τh↓(x)\tau^{\downarrow}_h(x) of xx from level hh is τ0(Vh)(x)\tau_0(V_h)(x).

Given x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}} and n∈ℕn \in \mathbb{N}, the revealed word revn(x)∈𝒜*\mathrm{rev}_n(x) \in \mathcal{A}^* is the reversal (x0x1⋯xn−1)rev(x_0 x_1 \cdots x_{n-1})^{\mathrm{rev}} of the first nn entries of xx (with rev0(x)=ε\mathrm{rev}_0(x) = \varepsilon).✦ For a map T:𝒜ℕ→ℕ∪{∞}T : \mathcal{A}^{\mathbb{N}} \to \mathbb{N} \cup \{\infty\} and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the stopped word stop(T,x)\mathrm{stop}(T, x) of xx at TT is revT(x)_+1(x)\mathrm{rev}_{\underline{T(x)} + 1}(x).✦ For a level h∈ℕh \in \mathbb{N} and a pair z=(x,y)∈𝒜ℕ×𝒜ℕz = (x, y) \in \mathcal{A}^{\mathbb{N}} \times \mathcal{A}^{\mathbb{N}}, the raw seam word Whraw(z)∈𝒜*W^{\mathrm{raw}}_h(z) \in \mathcal{A}^* is defined by (3): Whraw(x,y)=stop(τh↑,x)stop(τh↓,y)rev.W^{\mathrm{raw}}_h(x, y) = \mathrm{stop}(\tau^{\uparrow}_h, x)\, \mathrm{stop}(\tau^{\downarrow}_h, y)^{\mathrm{rev}}.(3)

Piece Laws and Seam Events

For a stream x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the reversed right piece word wrev,R(x)∈𝒜*w^{\mathrm{rev},\mathrm{R}}(x) \in \mathcal{A}^* of xx is stop(τ1↓,x)\mathrm{stop}(\tau^{\downarrow}_1, x).✦ The reversed right piece law μ̃pR\tilde{\mu}^{\mathrm{R}}_p on 𝒜*\mathcal{A}^* is the pushforward of ℙpℕ\mathbb{P}_p^{\mathbb{N}} under x↦stop(τ1↓,x)x \mapsto \mathrm{stop}(\tau^{\downarrow}_1, x), and the right piece law μpR\mu^{\mathrm{R}}_p on 𝒜*\mathcal{A}^* is the pushforward of μ̃pR\tilde{\mu}^{\mathrm{R}}_p under word reversal w↦wrevw \mapsto w^{\mathrm{rev}}.✦

For n∈ℕn \in \mathbb{N} and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the shifted letter stream θnx∈𝒜ℕ\theta_n x \in \mathcal{A}^{\mathbb{N}} has entries (θnx)k=xn+k(\theta_n x)_k = x_{n+k} for k∈ℕk \in \mathbb{N}.✦ At step n∈ℕn \in \mathbb{N} for x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the survivor indicator χsurv(n,x)∈ℤ\chi_{\mathrm{surv}}(n, x) \in \mathbb{Z} equals 11 if the burger stack of red(revn+1(x))\mathrm{red}(\mathrm{rev}_{n+1}(x)) is empty and 00 otherwise✦, and the first backward survivor time τsurv(x)\tau_{\mathrm{surv}}(x) of xx is τ0(χsurv)(x)∈ℕ∪{∞}\tau_0(\chi_{\mathrm{surv}})(x) \in \mathbb{N} \cup \{\infty\}. For x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the unmatched order count K(x)∈ℕK(x) \in \mathbb{N} is 00 if τsurv(x)=∞\tau_{\mathrm{surv}}(x) = \infty and otherwise equals the length of the pending order list of red(revτsurv(x)_+1(x))\mathrm{red}(\mathrm{rev}_{\underline{\tau_{\mathrm{surv}}(x)} + 1}(x))✦, while the first survivor type β1(x)∈ℬ\beta_1(x) \in \mathcal{B} is the freshest element of the burger stack of red(revτsurv(x)_+1(x))\mathrm{red}(\mathrm{rev}_{\underline{\tau_{\mathrm{surv}}(x)} + 1}(x)), or 00 if that stack is empty.✦ The first survivor data of x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}} is the pair (K(x),β1(x))∈ℕ×ℬ(K(x), \beta_1(x)) \in \mathbb{N} \times \mathcal{B}✦, and the first survivor tail Θ(x)\Theta(x) of xx is the shifted letter stream θτsurv(x)_+1x\theta_{\underline{\tau_{\mathrm{surv}}(x)} + 1} x.

Given a step index j∈ℕj \in \mathbb{N} and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the parsing step survivor data is the pair (K(Θj(x)),β1(Θj(x)))∈ℕ×ℬ(K(\Theta^j(x)), \beta_1(\Theta^j(x))) \in \mathbb{N} \times \mathcal{B}, where Θj\Theta^j denotes the jj-fold iterate of Θ\Theta.✦ For j∈ℕj \in \mathbb{N} and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the parsing step defect count κj(x)∈ℕ\kappa_j(x) \in \mathbb{N} is the first coordinate K(Θj(x))K(\Theta^j(x)) of the parsing step survivor data at step jj and xx.✦

Let X=(Xj)j≥0X = (X_j)_{j \ge 0} be a sequence of nonnegative integer defect counts on a space Ω\Omega. For n∈ℕn \in \mathbb{N} and ω∈Ω\omega \in \Omega, the defect walk Wn(X,ω)W_n(X, \omega) of XX at step nn and ω\omega is ∑j=0n−1(1−Xj(ω))∈ℤ\sum_{j=0}^{n-1} (1 - X_j(\omega)) \in \mathbb{Z}, and the defect walk survival event An(X)A_n(X) of XX at step nn is {ω∈Ω:Wj(X,ω)≤0 for all 0≤j≤n}\{\omega \in \Omega : W_j(X, \omega) \le 0 \text{ for all } 0 \le j \le n\}. For a sequence X=(Xj)j≥0X = (X_j)_{j \ge 0} of defect counts on Ω\Omega, a point ω∈Ω\omega \in \Omega, and a step n∈ℕn \in \mathbb{N}, the defect stopping predicate is the condition that either ω∉An(X)\omega \notin A_n(X) or ω∈Aj(X)\omega \in A_j(X) for every j∈ℕj \in \mathbb{N}.✦ The defect stopping index σ(X,ω)∈ℕ\sigma(X, \omega) \in \mathbb{N} of XX at ω∈Ω\omega \in \Omega is the least n∈ℕn \in \mathbb{N} satisfying the defect stopping predicate.✦

For a stream x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the left parsing step count L(x)L(x) of xx is σ((κj)j≥0,x)∈ℕ\sigma((\kappa_j)_{j \ge 0}, x) \in \mathbb{N}.✦ Given n∈ℕn \in \mathbb{N} and x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}}, the short piece prefix Pnshort(x)∈𝒜*P^{\mathrm{short}}_n(x) \in \mathcal{A}^* is defined recursively by P0short(x)=εP^{\mathrm{short}}_0(x) = \varepsilon, while Pn+1short(x)P^{\mathrm{short}}_{n+1}(x) concatenates the normal word of the word reduction of the nn-th raw chunk of xx with Pnshort(x)P^{\mathrm{short}}_n(x).✦ The short left piece word wL(x)w^{\mathrm{L}}(x) of x∈𝒜ℕx \in \mathcal{A}^{\mathbb{N}} is PL(x)short(x)∈𝒜*P^{\mathrm{short}}_{L(x)}(x) \in \mathcal{A}^*, and the shortened left piece law μpL\mu^{\mathrm{L}}_p on 𝒜*\mathcal{A}^* is the pushforward of ℙpℕ\mathbb{P}_p^{\mathbb{N}} under wLw^{\mathrm{L}}.✦

Given a sequence x=(xj)j≥0∈(𝒜*)ℕx = (x_j)_{j \ge 0} \in (\mathcal{A}^*)^{\mathbb{N}} of words, the concatenated piece prefix Πn(x)∈𝒜*\Pi_n(x) \in \mathcal{A}^* is defined recursively by Π0(x)=ε\Pi_0(x) = \varepsilon and Πn+1(x)=Πn(x)xn\Pi_{n+1}(x) = \Pi_n(x) x_n for n∈ℕn \in \mathbb{N}.✦ For any probability measure ν\nu on 𝒜*\mathcal{A}^*, the natural pieces law ν⊗ℕ\nu^{\otimes \mathbb{N}} on (𝒜*)ℕ(\mathcal{A}^*)^{\mathbb{N}} is the product measure with marginal ν\nu at every index j∈ℕj \in \mathbb{N}.✦ At a piece count h∈ℕh \in \mathbb{N}, the piece seam event Ehpiece⊆(𝒜*)ℕ×(𝒜*)ℕE^{\mathrm{piece}}_h \subseteq (\mathcal{A}^*)^{\mathbb{N}} \times (\mathcal{A}^*)^{\mathbb{N}} is defined by (4): Ehpiece={(x,y)∈(𝒜*)ℕ×(𝒜*)ℕ:red(Πh(x)Πh(y))=(ε,ε)}.E^{\mathrm{piece}}_h = \bigl\{(x, y) \in (\mathcal{A}^*)^{\mathbb{N}} \times (\mathcal{A}^*)^{\mathbb{N}} : \mathrm{red}\bigl(\Pi_h(x)\Pi_h(y)\bigr) = (\varepsilon, \varepsilon)\bigr\}.(4)

Cuts and Good Trajectories

For a bi-infinite sequence x:ℤ→𝒜*x : \mathbb{Z} \to \mathcal{A}^* of words, a starting index a∈ℤa \in \mathbb{Z}, and a piece count n∈ℕn \in \mathbb{N}, the concatenated interval word I(x,a,n)∈𝒜*I(x, a, n) \in \mathcal{A}^* is Πn(j↦xa+j)\Pi_n(j \mapsto x_{a+j}).✦ A bi-infinite sequence x:ℤ→𝒜*x : \mathbb{Z} \to \mathcal{A}^* has a left cut at a∈ℤa \in \mathbb{Z} if for every n∈ℕn \in \mathbb{N}, the pending order list of red(I(x,a,n))\mathrm{red}(I(x, a, n)) is empty✦, and a bi-infinite sequence y:ℤ→𝒜*y : \mathbb{Z} \to \mathcal{A}^* has a right cut at b∈ℤb \in \mathbb{Z} if for every n∈ℕn \in \mathbb{N}, the burger stack of red(I(y,b−n,n))\mathrm{red}(I(y, b - n, n)) is empty.✦

Given a bi-infinite sequence x:ℤ→𝒜*x : \mathbb{Z} \to \mathcal{A}^*, a∈ℤa \in \mathbb{Z}, and n∈ℕn \in \mathbb{N}, the reduced interval burgers burg(x,a,n)\mathrm{burg}(x, a, n) and reduced interval orders ord(x,a,n)\mathrm{ord}(x, a, n) are respectively the burger stack and the pending order list of red(I(x,a,n))\mathrm{red}(I(x, a, n)). For any list ss and depth k∈ℕk \in \mathbb{N}, the bottom of stack botk(s)\mathrm{bot}_k(s) is the suffix obtained by dropping the first max⁡(0,|s|−k)\max(0, |s| - k) entries of ss.✦ With x:ℤ→𝒜*x : \mathbb{Z} \to \mathcal{A}^*, b∈ℬb \in \mathcal{B}, o∈𝒪o \in \mathcal{O}, and h,k∈ℕh, k \in \mathbb{N}, the bottom burger count Nbbot(x,h,k)∈ℕN^{\mathrm{bot}}_b(x, h, k) \in \mathbb{N} is the number of occurrences of bb in botk(burg(x,0,h))\mathrm{bot}_k(\mathrm{burg}(x, 0, h))✦, and the terminal order count Noterm(x,h,k)∈ℕN^{\mathrm{term}}_o(x, h, k) \in \mathbb{N} is the number of occurrences of oo in botk(ord(x,−h,h))\mathrm{bot}_k(\mathrm{ord}(x, -h, h)).✦

Given α∈ℝ\alpha \in \mathbb{R} and B∈ℕB \in \mathbb{N}, a bi-infinite sequence x:ℤ→𝒜*x : \mathbb{Z} \to \mathcal{A}^* is a good left trajectory for α\alpha and BB if xx has a left cut at 00 and satisfies Nbbot(x,h,k)≥αkN^{\mathrm{bot}}_b(x, h, k) \ge \alpha k for all h,k∈ℕh, k \in \mathbb{N} with B≤k≤hB \le k \le h and every b∈ℬb \in \mathcal{B}.✦ A bi-infinite sequence y:ℤ→𝒜*y : \mathbb{Z} \to \mathcal{A}^* is a good right trajectory for α∈ℝ\alpha \in \mathbb{R} and B∈ℕB \in \mathbb{N} if yy has a right cut at 00 and satisfies Nobterm(y,h,k)≤αkN^{\mathrm{term}}_{o_b}(y, h, k) \le \alpha k for all h,k∈ℕh, k \in \mathbb{N} with B≤k≤hB \le k \le h and every b∈ℬb \in \mathcal{B}.✦ For D∈ℕD \in \mathbb{N}, a bi-infinite sequence y:ℤ→𝒜*y : \mathbb{Z} \to \mathcal{A}^* has a flexible order prefix of length DD if yjy_j is the single-letter word consisting of 𝖮(oflex)\mathsf{O}(o_{\mathrm{flex}}) for every j∈ℕj \in \mathbb{N} with j<Dj < D.✦

The Claim

Theorem 1. Let p∈(1/2,1)p \in (1/2, 1). There exists δ>0\delta > 0 such that for every integer h≥1h \ge 1, the bound (5) holds: (ℙpℕ⊗ℙpℕ)({z∈𝒜ℕ×𝒜ℕ:red(Whraw(z))=(ε,ε)})≥δ.(\mathbb{P}_p^{\mathbb{N}} \otimes \mathbb{P}_p^{\mathbb{N}}) \bigl(\{z \in \mathcal{A}^{\mathbb{N}} \times \mathcal{A}^{\mathbb{N}} : \mathrm{red}(W^{\mathrm{raw}}_h(z)) = (\varepsilon, \varepsilon)\}\bigr) \ge \delta.(5)✦ There exists δ′>0\delta' > 0 such that for every h∈ℕh \in \mathbb{N}, the bound (6) holds: ((μpL)⊗ℕ⊗(μpR)⊗ℕ)(Ehpiece)≥δ′.\bigl((\mu^{\mathrm{L}}_p)^{\otimes \mathbb{N}} \otimes (\mu^{\mathrm{R}}_p)^{\otimes \mathbb{N}}\bigr)(E^{\mathrm{piece}}_h) \ge \delta'.(6)✦ Let x,y:ℤ→𝒜*x, y : \mathbb{Z} \to \mathcal{A}^* be bi-infinite word sequences, let α≥0\alpha \ge 0 be real, and let B,D,h∈ℕB, D, h \in \mathbb{N} satisfy B≤DB \le D and B≤αDB \le \alpha D. Suppose that xx is a good left trajectory for α\alpha and BB, that yy is a good right trajectory for α\alpha and BB with a flexible order prefix of length DD, and that for every j∈ℤj \in \mathbb{Z} the sums of letter increments over the letters of xjx_j and yjy_j equal 11 and −1-1, respectively. Then the concatenated seam interval satisfies (7): red(I(x,0,h)I(y,D−h,h))=(ε,ε).\mathrm{red}\bigl(I(x, 0, h) I(y, D - h, h)\bigr) = (\varepsilon, \varepsilon).(7)✦

In the paper, the result reads: there exists δ>0\delta > 0, depending only on pp, such that for every integer h≥1h \ge 1 the seam interval formed by the backwards hit of +h+h and the forwards hit of −h-h reduces to the empty word with probability at least δ\delta. In (5), the backwards hit of +h+h and forwards hit of −h-h are represented on two independent one-sided letter streams via τh↑\tau^{\uparrow}_h and τh↓\tau^{\downarrow}_h, while (6) and (7) state the independent-piece and deterministic trajectory formulations.

What Is Checked

Claims (5) and (6) are stated for every FK model parameter p∈(1/2,1)p \in (1/2, 1) over the product measure ℙpℕ⊗ℙpℕ\mathbb{P}_p^{\mathbb{N}} \otimes \mathbb{P}_p^{\mathbb{N}} on stream pairs for all integers h≥1h \ge 1 and over the product measure (μpL)⊗ℕ⊗(μpR)⊗ℕ(\mu^{\mathrm{L}}_p)^{\otimes \mathbb{N}} \otimes (\mu^{\mathrm{R}}_p)^{\otimes \mathbb{N}} on piece-sequence pairs for all h∈ℕh \in \mathbb{N}, respectively. Claim (7) is stated over arbitrary bi-infinite word sequences x,y:ℤ→𝒜*x, y : \mathbb{Z} \to \mathcal{A}^*, real α≥0\alpha \ge 0, and integers B,D,h∈ℕB, D, h \in \mathbb{N} with B≤DB \le D and B≤αDB \le \alpha D under the hypotheses that xx is a good left trajectory for α\alpha and BB, that yy is a good right trajectory for α\alpha and BB with a flexible order prefix of length DD, and that each piece xjx_j has increment sum 11 while each yjy_j has increment sum −1-1. For every sequence XX of nonnegative integer defect counts on a space Ω\Omega and every point ω∈Ω\omega \in \Omega, there exists a step index n∈ℕn \in \mathbb{N} satisfying the defect stopping predicate for XX and ω\omega.✦