OctoInformBeta

OpenAI preprint, September 2026 · §6. One shear and exact coverage

Labeled suffix patterns and slice closure: Nonempty configurations with binary branching and families closed under deleting a fixed last coordinate

Labelled suffix patterns and coordinate slices.

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

Let qq be a nonnegative integer and AA a set of labels, and give ℝq\mathbb R^q its ordered coordinates x1,…,xqx_1,\ldots,x_q. A labelled configuration ss in ℝq\mathbb R^q with labels in AA is a finite subset of ℝq×A\mathbb R^q\times A. A suffix at coordinate jj consists of the coordinates with indices strictly greater than jj.

For a finite labelled configuration s⊂ℝq+1×As\subset\mathbb R^{q+1}\times A and v∈ℝv\in\mathbb R, the last-coordinate slice sl⁡v(s)\operatorname{sl}_v(s) is the labelled configuration in ℝq\mathbb R^q defined by (1): sl⁡v(s)={((x1,…,xq),a):(x,a)∈s,xq+1=v}.\operatorname{sl}_v(s) =\bigl\{((x_1,\ldots,x_q),a):(x,a)\in s,\ x_{q+1}=v\bigr\}.(1)✦

The Definition

Definition 1. A finite labelled configuration s⊂ℝq×As\subset\mathbb R^q\times A has unique labels when every point has at most one label, as in (2): #{a∈A:(x,a)∈s}≤1(x∈ℝq).\#\{a\in A:(x,a)\in s\}\leq 1 \qquad (x\in\mathbb R^q).(2)✦

A finite labelled configuration s⊂ℝq×As\subset\mathbb R^q\times A has binary suffix fibers when each fixed suffix restricts the preceding coordinate to two possible values one unit apart, as in (3): for every j∈{1,…,q} and y∈ℝq, there is v∈ℝ such that{xj:(x,a)∈s,xk=yk for j<k≤q}⊆{v,v+1}.\begin{gathered} \text{for every }j\in\{1,\ldots,q\}\text{ and }y\in\mathbb R^q, \text{ there is }v\in\mathbb R\text{ such that}\\ \bigl\{x_j:(x,a)\in s,\ x_k=y_k\text{ for }j<k\leq q\bigr\} \subseteq\{v,v+1\}. \end{gathered}(3)✦

A source pattern ss in ℝq\mathbb R^q with labels in AA is a finite nonempty labelled configuration with unique labels and binary suffix fibers, as in (4): 𝒫q(A)={s⊂ℝq×A:s is finite and nonempty,s has unique labels and binary suffix fibers}.\mathcal P_q(A)= \left\{s\subset\mathbb R^q\times A: \begin{array}{l} s\text{ is finite and nonempty,}\\ s\text{ has unique labels and binary suffix fibers} \end{array}\right\}.(4)✦

Let DD be a nonnegative integer, and let SqS_q be a finite family of finite labelled configurations in ℝq\mathbb R^q, for each nonnegative integer qq. The sequence (Sq)q≥0(S_q)_{q\geq0}, with labels in AA, is closed under nonempty last-coordinate slices below DD when (5) holds: {sl⁡v(s):s∈Sq+1,v∈ℝ}\{⌀}⊆Sq(0≤q<D).\bigl\{\operatorname{sl}_v(s):s\in S_{q+1},\ v\in\mathbb R\bigr\} \setminus\{\varnothing\}\subseteq S_q \qquad (0\leq q<D).(5)✦

What Is Checked

The definitions are stated for finite subsets of ℝq×A\mathbb R^q\times A with an arbitrary label set AA, and for finite families of these configurations in each dimension.