OctoInformBeta

OpenAI preprint, September 2026 · Section 1. Introduction

Theorem 1.2: Finite anchors witness an error of at least 1/21/2 for each integer norm bound p≥1p\ge1

Blocks obstruct finite-rank approximation at fixed norm.

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

Finite anchors in a metric space test how closely finite-rank operators on its Lipschitz-free space approximate the identity. The integer block parameter p≥1p\ge1 specifies the allowed operator norm. A finite-rank linear operator TT between Banach spaces is a linear operator whose range is finite-dimensional.

For a pointed metric space (M,d,o)(M,d,o), the real Lipschitz space Lip⁡0(M)\operatorname{Lip}_0(M) consists of the Lipschitz functions f:M→ℝf:M\to\mathbb R with f(o)=0f(o)=0, equipped with the Lipschitz norm in (1).✦ Evaluation at x∈Mx\in M is the functional δx\delta_x, and the Lipschitz-free space ℱ(M)\mathcal F(M) is its closed linear span in Lip⁡0(M)*\operatorname{Lip}_0(M)^*: ∥f∥Lip=supx≠y|f(x)−f(y)|d(x,y),δx(f)=f(x),ℱ(M)=span¯{δx:x∈M}⊆Lip⁡0(M)*.\begin{gathered} \|f\|_{\operatorname{Lip}} =\sup_{x\ne y}\frac{|f(x)-f(y)|}{d(x,y)}, \qquad \delta_x(f)=f(x),\\ \mathcal F(M) =\overline{\operatorname{span}}\{\delta_x:x\in M\} \subseteq\operatorname{Lip}_0(M)^*. \end{gathered}(1) The Dirac embedding δ:M→ℱ(M)\delta:M\to\mathcal F(M) sends each x∈Mx\in M to its evaluation functional δx\delta_x, regarded as an element of the closed evaluation span.

The Block Construction

The construction is defined for nonnegative integers pp. Its local radius LpL_p, scales Rp,Kp,BpR_p,K_p,B_p, and label cap DpD_p are the integers in (2); BpB_p is also the block diameter bound. Lp=10p,Rp=3Lp,Kp=10p(Rp+1),Dp=Kp+2Lp+5,Bp=4Rp+Dp=300p2+150p+5.\begin{gathered} L_p=10p,\qquad R_p=3L_p,\qquad K_p=10p(R_p+1),\\ D_p=K_p+2L_p+5,\qquad B_p=4R_p+D_p=300p^2+150p+5. \end{gathered}(2) The auxiliary bound VpV_p determines the generator count kpk_p and the graph degree bound Δp\Delta_p. The local ball bound QpQ_p, ball bound HpH_p, and color count cpc_p are defined by (3). Vp=1+4pBp,kp=20Vp+2,Δp=2kp,Qp=Δp2Lp+1,Hp=ΔpDp+1,cp=2ΔpQpHp+1.\begin{gathered} V_p=1+4pB_p,\qquad k_p=20V_p+2,\qquad \Delta_p=2k_p,\\ Q_p=\Delta_p^{\,2L_p+1},\qquad H_p=\Delta_p^{\,D_p+1},\qquad c_p=2\Delta_p Q_p H_p+1. \end{gathered}(3) The generator set is Ep={0,…,kp−1}E_p=\{0,\ldots,k_p-1\}, and the color set is Cp={0,…,cp−1}C_p=\{0,\ldots,c_p-1\}.

A graph with reversible ports on a vertex set XX has a port set 𝒫\mathscr P, an involution e↦e‾e\mapsto\bar e on 𝒫\mathscr P, and moves me:X→Xm_e:X\to X satisfying (4).✦ A port walk follows the entries of a finite word of ports; ⌀\varnothing denotes the empty word and ewew a word with first entry ee. e‾¯=e,me‾(me(x))=x,walk⁡(x,⌀)=x,walk⁡(x,ew)=walk⁡(me(x),w).\begin{gathered} \overline{\bar e}=e,\qquad m_{\bar e}(m_e(x))=x,\\ \operatorname{walk}(x,\varnothing)=x,\qquad \operatorname{walk}(x,ew)=\operatorname{walk}(m_e(x),w). \end{gathered}(4)

Let 𝔽(Ep)\mathbb F(E_p) be the free group on EpE_p, with word length |g||g|. For N≥0N\ge0, the word ball WNW_N and its permutation group ΓN\Gamma_N are (5). WN={g∈𝔽(Ep):|g|≤N},ΓN=Sym⁡(WN).W_N=\{g\in\mathbb F(E_p):|g|\le N\},\qquad \Gamma_N=\operatorname{Sym}(W_N).(5) For each generator a∈Epa\in E_p, choose a permutation σN,a\sigma_{N,a} of WNW_N that agrees with left multiplication by aa whenever the product stays in WNW_N.✦ The word ball representation ρN:𝔽(Ep)→ΓN\rho_N:\mathbb F(E_p)\to\Gamma_N is the group homomorphism sending each generator aa to σN,a\sigma_{N,a}.✦

The ports are 𝒫p=Ep×{+,−}\mathscr P_p=E_p\times\{+,-\}, with reversal interchanging the signs. The signed generator map ℓ:𝒫p→𝔽(Ep)\ell:\mathscr P_p\to\mathbb F(E_p) is defined by ℓ(a,+)=a\ell(a,+)=a and ℓ(a,−)=a−1\ell(a,-)=a^{-1}.✦ The finite Cayley graph on ΓN\Gamma_N moves gg to gρN(ℓ(e))g\rho_N(\ell(e)) along port ee.✦ The graph of all colorings has vertices (η,g)(\eta,g), where η:ΓN→Cp\eta:\Gamma_N\to C_p and g∈ΓNg\in\Gamma_N, and each move leaves η\eta fixed.✦

The block graph GpG_p is the disjoint union, over N≥0N\ge0, of the graphs of all colorings of ΓN\Gamma_N by CpC_p.✦ Its vertex set XpX_p and componentwise coloring γp\gamma_p are given in (6). Xp=∐N≥0(ΓN→Cp)×ΓN,me(N,η,g)=(N,η,gρN(ℓ(e))),γp(N,η,g)=η(g).\begin{gathered} X_p=\coprod_{N\ge0}(\Gamma_N\to C_p)\times\Gamma_N,\\ m_e(N,\eta,g)=(N,\eta,g\rho_N(\ell(e))),\qquad \gamma_p(N,\eta,g)=\eta(g). \end{gathered}(6)

A box label b∈ℬpb\in\mathscr B_p is a vector in ℬp={0,…,Dp}Cp\mathscr B_p=\{0,\ldots,D_p\}^{C_p}, with the supremum norm.✦ The distance profile λ(x)∈ℬp\lambda(x)\in\mathscr B_p of a vertex x∈Xpx\in X_p is the vector of truncated port distances to each color, defined in (7), where |w||w| is the number of ports in ww. λ(x)i=min({Dp}∪{|w|:w∈𝒫p<∞,γp(walk⁡(x,w))=i})(i∈Cp).\lambda(x)_i=min\bigl(\{D_p\}\cup \{|w|:w\in\mathscr P_p^{<\infty}, \gamma_p(\operatorname{walk}(x,w))=i\}\bigr) \qquad(i\in C_p).(7)✦

The realized label anchors form the set 𝒜p=λ(Xp)\mathscr A_p=\lambda(X_p).✦ The metric block MpM_p has underlying set Xp⊔𝒜pX_p\sqcup\mathscr A_p and scale RpR_p.✦ Write ιp:𝒜p→Mp\iota_p:\mathscr A_p\to M_p for the anchor inclusion.✦ The anchor associated to a vertex x∈Xpx\in X_p is the label λ(x)∈𝒜p\lambda(x)\in\mathscr A_p, and the corresponding point in MpM_p is ax=ιp(λ(x))a_x=\iota_p(\lambda(x)). The finite anchor set Ap⊆MpA_p\subseteq M_p and the base point op∈Mpo_p\in M_p are defined in (8), where 11 is the identity permutation and η0:Γ0→Cp\eta_0:\Gamma_0\to C_p is constantly zero. Ap=ιp(𝒜p),x*=(0,η0,1),op=ax*.A_p=\iota_p(\mathscr A_p),\qquad x_*=(0,\eta_0,1),\qquad o_p=a_{x_*}.(8)

The Claim

Theorem 1 (Block existence principle). For each integer p≥1p\ge1, there are a countable pointed metric space (M,d,o)(M,d,o) and a finite set A⊆MA\subseteq M containing oo such that, for every bounded finite-rank linear operator T:ℱ(M)→ℱ(M)T:\mathcal F(M)\to\mathcal F(M) with ∥T∥≤p\|T\|\le p, the bounds in (9) hold: 1≤d(x,y)(x,y∈M,x≠y),d(x,y)≤Bp(x,y∈M),maxa∈A∥Tδa−δa∥≥12.\begin{gathered} 1\le d(x,y)\quad(x,y\in M,\ x\ne y),\qquad d(x,y)\le B_p\quad(x,y\in M),\\ \max_{a\in A}\|T\delta_a-\delta_a\|\ge\frac12. \end{gathered}(9)✦ For the constructed block MpM_p, every bounded finite-rank linear operator T:ℱ(Mp)→ℱ(Mp)T:\mathcal F(M_p)\to\mathcal F(M_p) with ∥T∥≤p\|T\|\le p satisfies (10): there is a∈Ap with ∥Tδa−δa∥≥12.\text{there is }a\in A_p\text{ with } \|T\delta_a-\delta_a\|\ge\frac12.(10)✦ For every nonnegative integer pp, the base point satisfies (11): op∈Ap.o_p\in A_p.(11)✦

In the paper, the result reads: for each integer p≥1p\ge1 there are a bounded countably infinite pointed metric space (Mp,dp,op)(M_p,d_p,o_p) and a finite Ap⊆MpA_p\subseteq M_p containing opo_p, with separation at least one and diameter at most Bp=300p2+150p+5B_p=300p^2+150p+5, such that every bounded finite-rank linear operator T0T_0 on ℱ(Mp)\mathcal F(M_p) with ∥T0∥≤p\|T_0\|\le p satisfies max⁡a∈Ap∥T0δa−δa∥≥1/2\max_{a\in A_p}\|T_0\delta_a-\delta_a\|\ge1/2.

What Is Checked

The block existence principle is stated over real closed evaluation spans of countable pointed metric spaces. The principle’s explicit obstruction uses the graph vertices and realized label anchors defining MpM_p and ApA_p.

there is σ∈Sym⁡(WN) such that σ(g)=ag(g∈WN,|ag|≤N).\text{there is }\sigma\in\operatorname{Sym}(W_N)\text{ such that } \sigma(g)=ag\quad(g\in W_N,\ |ag|\le N).(12)✦

The color count in (3) satisfies cp>0c_p>0.✦