OctoInformBeta

OpenAI preprint, September 2026 · §2. Countable diagrams and their tests

Restriction of diagrams: A label (J,i)(J, i) moves to (e[J],i)(e[J], i) along an injection ee, and a diagram DD restricts to D↾eD\restriction e, pulling back its relations and tags

Diagrams restrict along injections of positions, and restrictions compose.

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

Fix sets AA and BB of positions and an injection e:A→Be : A \to B. For A⊆BA \subseteq B and ee the inclusion, the restriction defined below cuts a diagram on BB down to AA. The question is how this restriction behaves along a composite A→B→CA \to B \to C of two injections.

Labels and Diagrams

A label on a set AA of positions is a pair (J,i)(J, i) in which JJ is a nonempty finite subset of AA and ii is a natural number; L(A)L(A) is the set of labels on AA.✦

A tag is a countable ordinal, an element of ω1\omega_1.✦

A diagram DD on a set AA of positions is a triple (E,R,ρ)(E, R, \rho) in which EE and RR are binary relations on L(A)L(A) and ρ:L(A)→ω1\rho : L(A) \to \omega_1 assigns a tag to each label.✦

The Claim

Definition 1. Let e:A→Be : A \to B be an injection of sets of positions. The map of labels along ee is ℓe:L(A)→L(B)\ell_e : L(A) \to L(B), ℓe(J,i)=(e[J],i),\ell_e(J, i) = (e[J], i),(1)✦ where e[J]e[J] is the image of JJ under ee. For a diagram D=(E,R,ρ)D = (E, R, \rho) on BB, the restriction of DD along ee is the diagram D↾e=(Ee,Re,ρe)D\restriction e = (E^e, R^e, \rho^e) on AA given, for labels ll and l′l' on AA, by lEel′⇔ℓe(l)Eℓe(l′),lRel′⇔ℓe(l)Rℓe(l′),ρe(l)=ρ(ℓe(l)).l \mathrel{E^e} l' \iff \ell_e(l) \mathrel{E} \ell_e(l'), \qquad l \mathrel{R^e} l' \iff \ell_e(l) \mathrel{R} \ell_e(l'), \qquad \rho^e(l) = \rho(\ell_e(l)).(2)✦ If moreover f:B→Cf : B \to C is an injection of sets of positions and DD is a diagram on CC, then restricting along ff and then along ee is restricting along f∘ef \circ e: (D↾f)↾e=D↾(f∘e).(D\restriction f)\restriction e = D\restriction (f \circ e).(3)✦

In the paper, the result reads: D↾JD\restriction J pulls the relations and the tags back along ℓJ(U,i)=({ju:u∈U},i)\ell_J(U, i) = (\{j_u : u \in U\}, i), and restrictions compose; there juj_u is the page’s e(u)e(u), so that JJ, ℓJ\ell_J and the label (U,i)(U, i) stand for ee, ℓe\ell_e and (J,i)(J, i).

What Is Checked

The map of labels (1), the restriction (2) and the composition law (3) are stated over injections between sets of positions and over diagrams (E,R,ρ)(E, R, \rho) on them, with labels in L(A)L(A) and tags in ω1\omega_1.