OctoInformBeta

OpenAI preprint, September 2026 · §4. Quantitative bounds and separation

§4.1 (setting): disjoint composition: A definition for outer and inner functions with arbitrary coordinate sets

Boolean composition on separate input blocks.

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

Disjoint composition concerns Boolean functions whose input bits are arranged in separate blocks. Let II be the set of block labels, let JJ be the set of positions within a block, and put 𝔹={false,true}\mathbb{B}=\{\mathrm{false},\mathrm{true}\}. An input x:I×J→𝔹x\colon I\times J\to\mathbb{B} assigns a bit to each position (i,j)(i,j).

The Definition

Definition 1. Let f:𝔹I→𝔹f\colon\mathbb{B}^{I}\to\mathbb{B} and g:𝔹J→𝔹g\colon\mathbb{B}^{J}\to\mathbb{B} be Boolean functions. The disjoint composition f∘g:𝔹I×J→𝔹f\circ g\colon\mathbb{B}^{I\times J}\to\mathbb{B} of Boolean functions f:𝔹I→𝔹f\colon\mathbb{B}^{I}\to\mathbb{B} and g:𝔹J→𝔹g\colon\mathbb{B}^{J}\to\mathbb{B} is the Boolean function given by (1): (f∘g)(x)=f(i↦g(j↦x(i,j))).(f\circ g)(x) = f\bigl(i\mapsto g(j\mapsto x(i,j))\bigr).(1)✦

In the paper, the result reads: for total Boolean functions ff on aa bits and gg on bb bits, (f∘g)(x1,…,xa)=f(g(x1),…,g(xa))(f\circ g)(x_1,\ldots,x_a)=f(g(x_1),\ldots,g(x_a)), where each xix_i contains bb disjoint raw bits.

What Is Checked

The definition in (1) is stated for arbitrary coordinate sets II and JJ and Boolean functions on those sets.