OctoInformBeta

OpenAI preprint, September 2026 · Section 6. Scalar tests and incidence averaging

Lemma 6.1: Opposing label bumps for a graph incidence admit a common 11-Lipschitz extension

Bounded scalar tests outside exceptional states.

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

The issue is to prescribe scalar values on a finite part of a metric block while controlling both the Lipschitz constant and the range. An incidence selects opposite signs for the data at its two ends.

A graph GG with reversible ports on a vertex set XX and port set EE has an involution e↦e‾e\mapsto\bar e and a move map satisfying move⁡(move⁡(x,e),e‾)=x\operatorname{move}(\operatorname{move}(x,e),\bar e)=x.✦ For a vertex x∈Xx\in X and a finite port word ww in EE, the port walk endpoint G(x,w)G(x,w) is the vertex of XX reached by following the entries of ww in order, with the empty word ending at xx; write |w||w| for its length.✦ A nonbacktracking port word ww in EE is a finite word in which no port is followed by its reverse.✦

For a color set CC, a coloring c:X→Cc:X\to C, and an integer cap D≥0D\ge0, a bounded color coordinate vector vv is an element of ℬD={0,…,D}C\mathcal B_D=\{0,\ldots,D\}^C, equipped with the supremum norm.✦ The truncated distance to color ii is the iith coordinate of the vertex distance profile ℓx∈ℬD\ell_x\in\mathcal B_D in (1): ℓx(i)=min⁡({D}∪{|w|:c(G(x,w))=i}).\ell_x(i)=\min\bigl(\{D\}\cup \{|w|:c(G(x,w))=i\}\bigr).(1)

A realized label anchor a∈ℬDa\in\mathcal B_D is a vector in the range of x↦ℓxx\mapsto\ell_x.✦ The graph with label anchors at attachment scale R≥0R\ge0 has point set MM, and its block label ℓ:M→ℬD\ell:M\to\mathcal B_D is specified in (2): A={ℓx:x∈X},M=X⊔A,ℓ(z)={ℓx,z=x∈X,a,z=a∈A.A=\{\ell_x:x\in X\},\qquad M=X\sqcup A,\qquad \ell(z)= \begin{cases} \ell_x,&z=x\in X,\\ a,&z=a\in A. \end{cases}(2) Write dd for the metric on this block.

For a map h:U→Vh:U\to V between metric spaces, with metric dVd_V on VV, a center a∈Va\in V, and real parameters L,KL,K, the label bump ϕh,a:U→ℝ\phi_{h,a}:U\to\mathbb R is the function in (3): ϕh,a(t)=Lmax⁡{1−dV(a,h(t))K,0}.\phi_{h,a}(t)=L\max\left\{1-\frac{d_V(a,h(t))}{K},0\right\}.(3)✦ For the incidence construction, take positive integers L,KL,K with L≤KL\le K and put bx=ϕℓ,ℓxb_x=\phi_{\ell,\ell_x}.

Continuation Records

Fix a finite state set S⊆MS\subseteq M. Label compatibility between x∈Xx\in X and j∈Sj\in S, and proximity between states j,k∈Sj,k\in S, are the relations in (4): x∼j⇔∥ℓx−ℓ(j)∥∞≤K+2L+1,j⇝k⇔d(j,k)≤2L.\begin{aligned} x\sim j&\quad\Longleftrightarrow\quad \|\ell_x-\ell(j)\|_\infty\le K+2L+1,\\ j\rightsquigarrow k&\quad\Longleftrightarrow\quad d(j,k)\le2L. \end{aligned}(4) A matched walk from a vertex x∈Xx\in X with initial state j∈Sj\in S is a finite port word ww accompanied by a state in SS at each successive vertex, starting with jj, such that each vertex is compatible with its state and successive states are related by proximity.✦

An attainable continuation length tt from a vertex x∈Xx\in X in a direction e∈Ee\in E with initial state j∈Sj\in S is a nonnegative integer equal either to zero or to the length of a nonbacktracking matched word beginning with ee.✦ Write T(x,e,j)T(x,e,j) for the set of attainable continuation lengths. For x∈Xx\in X, e∈Ee\in E, j∈Sj\in S and a horizon n≥0n\ge0, the bounded continuation record rn(x,e,j)r_n(x,e,j) is the integer in (5): rn(x,e,j)=max⁡(T(x,e,j)∩{0,…,n}).r_n(x,e,j)=\max\bigl(T(x,e,j)\cap\{0,\ldots,n\}\bigr).(5)✦ The condition Hn(x)H_n(x) of absence of reduced matches means that no initial state in SS admits a nonbacktracking matched word of length nn from xx.✦

For a vertex x∈Xx\in X, a horizon n≥0n\ge0 and a state j∈Sj\in S, an exceptional direction e∈Ee\in E at jj is a port satisfying rn(x,g,j)<rn(x,e,j)r_n(x,g,j)<r_n(x,e,j) for every g≠eg\ne e.✦ The exceptional state set En(x,e)⊆SE_n(x,e)\subseteq S is defined by (6): En(x,e)={j∈S:Hn(x) fails, or e is exceptional at j}.E_n(x,e)=\{j\in S:H_n(x)\text{ fails, or }e \text{ is exceptional at }j\}.(6)✦ For an incidence e:x→ye:x\to y, where y=move⁡(x,e)y=\operatorname{move}(x,e), write Ee=En(x,e)E_e=E_n(x,e) and Ee‾=En(y,e‾)E_{\bar e}=E_n(y,\bar e).

The Claim

Theorem 1. Let NN be a metric space, P⊆NP\subseteq N, v:N→ℝv:N\to\mathbb R, and L0≥0L_0\ge0. Suppose that vv is 11-Lipschitz on PP and |v|≤L0|v|\le L_0 there. There is a function f:N→ℝf:N\to\mathbb R satisfying (7): |f(z)−f(w)|≤d(z,w)(z,w∈N),|f(z)|≤L0(z∈N),f|P=v|P.\begin{gathered} |f(z)-f(w)|\le d(z,w)\quad(z,w\in N),\qquad |f(z)|\le L_0\quad(z\in N),\\ f|_P=v|_P. \end{gathered}(7)✦

Let P,Q⊆NP,Q\subseteq N and let b,c:N→[0,L0]b,c:N\to[0,L_0] be 11-Lipschitz. Suppose that b(j)=c(k)=0b(j)=c(k)=0 whenever j∈Pj\in P, k∈Qk\in Q and d(j,k)<2L0d(j,k)<2L_0. There is a function f:N→ℝf:N\to\mathbb R satisfying (8): |f(z)−f(w)|≤d(z,w)(z,w∈N),|f(z)|≤L0(z∈N),f|P=b|P,f|Q=−c|Q.\begin{gathered} |f(z)-f(w)|\le d(z,w)\quad(z,w\in N),\qquad |f(z)|\le L_0\quad(z\in N),\\ f|_P=b|_P,\qquad f|_Q=-c|_Q. \end{gathered}(8)✦

For the metric block above, let S⊆MS\subseteq M be finite, let n≥0n\ge0, and let e:x→ye:x\to y be an incidence. There is a function fe:M→ℝf_e:M\to\mathbb R satisfying (9): |fe(z)−fe(w)|≤d(z,w)(z,w∈M),|fe(z)|≤L(z∈M),fe|S\Ee=bx|S\Ee,fe|S\Ee‾=−by|S\Ee‾.\begin{gathered} |f_e(z)-f_e(w)|\le d(z,w)\quad(z,w\in M),\qquad |f_e(z)|\le L\quad(z\in M),\\ f_e|_{S\setminus E_e}=b_x|_{S\setminus E_e},\qquad f_e|_{S\setminus E_{\bar e}}=-b_y|_{S\setminus E_{\bar e}}. \end{gathered}(9)✦

In the paper, the result reads: with the finite set S⊆MpS\subseteq M_p, the integer block parameter p≥1p\ge1, n≥2n\ge2 and G=GmG=G_m from the continuation construction, where MpM_p is the metric block and GmG_m is the continuation graph, every incidence e:x→ye:x\to y admits a 11-Lipschitz function fe:Mp→[−L,L]f_e:M_p\to[-L,L] agreeing with bxb_x on S\EeS\setminus E_e and with −by-b_y on S\Ee‾S\setminus E_{\bar e}.

What Is Checked

The incidence statement (9) is stated over the metric block with realized label anchors and the exceptional sets determined by compatibility and continuation records; the extension statements (8) and (7) are stated over arbitrary metric spaces.