OctoInformBeta

OpenAI preprint, September 2026 · §2. Path diagrams and missing recurrent classes · §2

Lemma 2.4 [Products of missing sets]: For idempotent ee and z,wz, w nested in ee, a class missing from zwzw is missing from zz or ww, and ee misses none

Products in an idempotent’s corner lose no new recurrent classes.

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

A boundary diagram on mm labels records how a block with a left and a right boundary is crossed: which edges run through it from one boundary to the other, and which come back out on the side they entered. Diagrams of adjacent blocks multiply, and a path of the product may bounce between the two blocks any number of times before it leaves.

Following the crossings of a diagram ee in one direction, with returns at the boundaries in between, some labels lie on loops, and these fall into the recurrent classes of ee. When ee is idempotent and a diagram zz of its corner replaces it, a class may lose all its loops; it is then missing from zz. The question is how such losses combine under the product: whether zwzw can lose a class that both zz and ww keep, and whether a power of zz can lose a class that zz keeps.

Diagrams and Their Product

A boundary diagram aa on mm labels is a quadruple of relations on two copies D+D^+ and D−D^- of an mm-element label set, Fa⊆D+×D+,Ba⊆D−×D−,La⊆D+×D−,Ra⊆D−×D+,F_a \subseteq D^+ \times D^+, \qquad B_a \subseteq D^- \times D^-, \qquad L_a \subseteq D^+ \times D^-, \qquad R_a \subseteq D^- \times D^+,(1)✦ the forward relation FaF_a, whose edges enter on the left and exit on the right, the backward relation BaB_a, whose edges enter on the right and exit on the left, and the left and right relations LaL_a and RaR_a, whose edges enter and exit on the left and on the right respectively. The set of boundary diagrams on mm labels is 𝒯m\mathcal{T}_m.

Relations compose in path order: (x,z)∈PQ(x,z) \in PQ when (x,y)∈P(x,y) \in P and (y,z)∈Q(y,z) \in Q for some yy. The reflexive transitive closure of a relation PP on a set XX is the relation P*=⋃k≥0PkP^* = \bigcup_{k \ge 0} P^k on XX, where P0=IXP^0 = I_X is the identity relation on XX and Pk+1=PkPP^{k+1} = P^k P.✦

The product abab of two boundary diagrams aa and bb on mm labels is the boundary diagram of aa glued to the left of bb, with the four relations Fab=Fa(LbRa)*Fb,Bab=Bb(RaLb)*Ba,Lab=La∪Fa(LbRa)*LbBa,Rab=Rb∪BbRa(LbRa)*Fb.\begin{aligned} F_{ab} &= F_a (L_b R_a)^* F_b, &\qquad B_{ab} &= B_b (R_a L_b)^* B_a,\\ L_{ab} &= L_a \cup F_a (L_b R_a)^* L_b B_a, & R_{ab} &= R_b \cup B_b R_a (L_b R_a)^* F_b. \end{aligned}(2)✦ Powers zkz^k of a diagram zz are taken under this product.

A boundary diagram ee on mm labels is idempotent when ee=eee = e. A boundary diagram zz on mm labels is nested in a boundary diagram ee on mm labels, written z⊴ez \trianglelefteq e, when ez=zez = z and ze=zze = z. The corner of a boundary diagram ee on mm labels is the set {z∈𝒯m:z⊴e}\{z \in \mathcal{T}_m : z \trianglelefteq e\} of diagrams nested in ee.✦

Recurrent and Missing Classes

A sign σ\sigma is ++ or −-. The through relation of a boundary diagram aa at a sign σ\sigma is the relation TaσT^\sigma_a on DσD^\sigma of its crossings in the direction of σ\sigma: Ta+=FaT^+_a = F_a and Ta−=BaT^-_a = B_a.✦ The loop closure of a boundary diagram ee at σ\sigma is the relation Λeσ\Lambda^\sigma_e on DσD^\sigma that closes up the alternating returns at a boundary: Λe+=(LeRe)*\Lambda^+_e = (L_e R_e)^* and Λe−=(ReLe)*\Lambda^-_e = (R_e L_e)^*.✦

For boundary diagrams ee and zz on mm labels, the recurrence relation ρeσ\rho^\sigma_e of ee at σ\sigma and the surviving relation Ueσ(z)U^\sigma_e(z) of zz relative to ee at σ\sigma are the relations on DσD^\sigma obtained by placing the loop closure of ee on both sides of the through relation of ee and of zz: ρeσ=ΛeσTeσΛeσ,Ueσ(z)=ΛeσTzσΛeσ.\rho^\sigma_e = \Lambda^\sigma_e \, T^\sigma_e \, \Lambda^\sigma_e, \qquad U^\sigma_e(z) = \Lambda^\sigma_e \, T^\sigma_z \, \Lambda^\sigma_e.(3)

The set 𝒞e\mathcal{C}_e of signed recurrent classes of a boundary diagram ee consists of the pairs (σ,C)(\sigma, C) of a sign σ\sigma and a set CC of labels such that, for some label xx with (x,x)∈ρeσ(x,x) \in \rho^\sigma_e, C={y:(x,y)∈ρeσ and (y,x)∈ρeσ}.C = \{\, y : (x,y) \in \rho^\sigma_e \text{ and } (y,x) \in \rho^\sigma_e \,\}.(4)✦

For boundary diagrams ee and zz, the set ℳe(z)⊆𝒞e\mathcal{M}_e(z) \subseteq \mathcal{C}_e of classes missing from zz consists of the signed recurrent classes of ee none of whose labels has a loop in the surviving relation of zz relative to ee: ℳe(z)={(σ,C)∈𝒞e:(x,x)∉Ueσ(z) for every x∈C}.\mathcal{M}_e(z) = \{\, (\sigma, C) \in \mathcal{C}_e : (x,x) \notin U^\sigma_e(z) \text{ for every } x \in C \,\}.(5)✦

The Claim

Theorem 1. Let ee be a boundary diagram on mm labels. Then ℳe(e)=∅.\mathcal{M}_e(e) = \emptyset.(6)✦ If moreover ee is idempotent, then for all diagrams zz and ww in the corner of ee ℳe(zw)⊆ℳe(z)∪ℳe(w),\mathcal{M}_e(zw) \subseteq \mathcal{M}_e(z) \cup \mathcal{M}_e(w),(7)✦ and for every diagram zz in the corner of ee and every natural number kk ℳe(zk+1)⊆ℳe(z).\mathcal{M}_e(z^{k+1}) \subseteq \mathcal{M}_e(z).(8)✦

In the paper, the result reads: for an idempotent ee and z,w∈e𝒯mez, w \in e\mathcal{T}_m e, ℳe(zw)⊆ℳe(z)∪ℳe(w)\mathcal{M}_e(zw) \subseteq \mathcal{M}_e(z) \cup \mathcal{M}_e(w) and ℳe(e)=∅\mathcal{M}_e(e) = \emptyset, and in particular ℳe(zk)⊆ℳe(z)\mathcal{M}_e(z^k) \subseteq \mathcal{M}_e(z) for every k≥1k \ge 1, with e𝒯mee\mathcal{T}_m e the corner of ee.

What Is Checked

The claim is stated over boundary diagrams on mm labels and their product, the corner of a diagram, and the sets of missing recurrent classes, built from the through relations, the loop closures, and the recurrence and surviving relations at each sign.