OctoInformBeta

OpenAI preprint, September 2026 · Section 1. Introduction

Theorem 1.1: A countable, unbounded metric wedge with separation at least one and a noncompact closed ball

A Lipschitz-free space separates approximation properties.

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 approximation problem for a Lipschitz-free space asks whether finite-rank operators approximate its identity uniformly on compact sets, and whether their operator norms can remain bounded. The metric space in this construction is a wedge of countably many blocks built from colored graphs.

For a pointed metric space (M,d,o)(M,d,o), the space Lip⁡0(M)\operatorname{Lip}_0(M) consists of real Lipschitz functions on MM that vanish at oo, with the norm in (1). Lip⁡0(M)={f:M→ℝ:f(o)=0,∥f∥Lip<∞},∥f∥Lip=supx≠y|f(x)−f(y)|d(x,y).\operatorname{Lip}_0(M) =\{f:M\to\mathbb R:f(o)=0,\ \|f\|_{\mathrm{Lip}}<\infty\}, \qquad \|f\|_{\mathrm{Lip}} =\sup_{x\ne y}\frac{|f(x)-f(y)|}{d(x,y)}.(1)✦ The evaluation functional δx∈Lip⁡0(M)*\delta_x\in\operatorname{Lip}_0(M)^* sends ff to f(x)f(x).✦ The real Lipschitz-free space ℱ(M)\mathcal F(M) of a pointed metric space (M,d,o)(M,d,o) is the closed linear span of the evaluation functionals δx\delta_x, x∈Mx\in M, in Lip⁡0(M)*\operatorname{Lip}_0(M)^*, as in (2). δx(f)=f(x),ℱ(M)=span⁡ℝ{δx:x∈M}¯⊂Lip⁡0(M)*.\delta_x(f)=f(x), \qquad \mathcal F(M) =\overline{\operatorname{span}_{\mathbb R}\{\delta_x:x\in M\}} \subset\operatorname{Lip}_0(M)^*.(2)

For a real normed space XX, let ℛ(X)\mathscr R(X) denote the bounded finite-rank linear operators from XX to itself. The approximation property (AP) of XX is the requirement that every compact set C⊂XC\subset X and every ε>0\varepsilon>0 admit T∈ℛ(X)T\in\mathscr R(X) satisfying (3). supu∈C∥Tu−u∥<ε.\sup_{u\in C}\|Tu-u\|<\varepsilon.(3)✦ For λ∈ℝ\lambda\in\mathbb R, the λ\lambda-bounded approximation property (λ\lambda-BAP) of XX is the requirement that every compact C⊂XC\subset X and every ε>0\varepsilon>0 admit T∈ℛ(X)T\in\mathscr R(X) satisfying both (3) and (4). ∥T∥≤λ.\|T\|\le\lambda.(4)✦

The Metric Blocks

Fix an integer p≥1p\ge1. The local radius LpL_p, the scales Rp,Kp,BpR_p,K_p,B_p, and the label cap DpD_p are defined together with the auxiliary bounds Vp,Qp,HpV_p,Q_p,H_p in (5). Here kpk_p is the number of generators, Δp\Delta_p the graph degree bound, and cpc_p the number of colors. Lp=10p,Rp=3Lp,Kp=10p(Rp+1),Dp=Kp+2Lp+5,Bp=4Rp+Dp=300p2+150p+5,Vp=1+4pBp,kp=20Vp+2,Δp=2kp,Qp=Δp2Lp+1,Hp=ΔpDp+1,cp=2ΔpQpHp+1.\begin{aligned} L_p&=10p,& R_p&=3L_p,& K_p&=10p(R_p+1),\\ D_p&=K_p+2L_p+5,& B_p&=4R_p+D_p=300p^2+150p+5,\\ V_p&=1+4pB_p,& k_p&=20V_p+2,& \Delta_p&=2k_p,\\ Q_p&=\Delta_p^{\,2L_p+1},& H_p&=\Delta_p^{\,D_p+1},& c_p&=2\Delta_pQ_pH_p+1. \end{aligned}(5) The generator set is Ap={0,…,kp−1}A_p=\{0,\ldots,k_p-1\}✦, and the color set is Cp={0,…,cp−1}C_p=\{0,\ldots,c_p-1\}.✦

A graph GG with reversible ports on a vertex set XX has a port set EE, an involution e↦e‾e\mapsto\bar e, and moves x↦x⋅ex\mapsto x\cdot e satisfying (6). e‾¯=e,(x⋅e)⋅e‾=x.\overline{\bar e}=e, \qquad (x\cdot e)\cdot\bar e=x.(6)✦ In a graph GG with reversible ports EE on a vertex set XX, a walk from x∈Xx\in X along a finite word ww in EE follows the moves specified by its letters successively; write x⋅wx\cdot w for its endpoint and |w||w| for its length.

Let 𝔽(Ap)\mathbb F(A_p) be the free group on ApA_p, with word length |g||g|. For N≥0N\ge0, the word ball Wp,NW_{p,N} in the free group 𝔽(Ap)\mathbb F(A_p) and the permutation group Γp,N\Gamma_{p,N} of that ball are defined by (7). Wp,N={g∈𝔽(Ap):|g|≤N},Γp,N=Sym⁡(Wp,N).W_{p,N}=\{g\in\mathbb F(A_p):|g|\le N\}, \qquad \Gamma_{p,N}=\operatorname{Sym}(W_{p,N}).(7) Choose permutations σp,N,a∈Γp,N\sigma_{p,N,a}\in\Gamma_{p,N}, a∈Apa\in A_p, that agree with left multiplication by aa whenever the argument and its image lie in Wp,NW_{p,N}, and let ρp,N:𝔽(Ap)→Γp,N\rho_{p,N}:\mathbb F(A_p)\to\Gamma_{p,N} be the homomorphism determined by ρp,N(a)=σp,N,a\rho_{p,N}(a)=\sigma_{p,N,a}. The finite Cayley graph on Γp,N\Gamma_{p,N} uses signed generator ports, with moves and reversal as in (8). Ep=Ap×{−1,1},(a,s)¯=(a,−s),g⋅(a,s)=gρp,N(as).E_p=A_p\times\{-1,1\}, \qquad \overline{(a,s)}=(a,-s), \qquad g\cdot(a,s)=g\rho_{p,N}(a^s).(8)✦ The signed generator associated to a port (a,s)∈Ep(a,s)\in E_p is the element of 𝔽(Ap)\mathbb F(A_p) equal to aa when s=1s=1 and to a−1a^{-1} when s=−1s=-1.

For each coloring c:Γp,N→Cpc:\Gamma_{p,N}\to C_p, take a copy of this Cayley graph.✦ The graph GpG_p is the disjoint union, over all NN and all colorings c:Γp,N→Cpc:\Gamma_{p,N}\to C_p, of copies of the Cayley graph on Γp,N\Gamma_{p,N}, with vertex set XpX_p and coloring χp\chi_p given in (9). Xp=∐N≥0(CpΓp,N×Γp,N),χp(N,c,g)=c(g).X_p=\coprod_{N\ge0} \bigl(C_p^{\Gamma_{p,N}}\times\Gamma_{p,N}\bigr), \qquad \chi_p(N,c,g)=c(g).(9) The moves preserve NN and cc. The distinguished vertex is vp=(0,c0,1)v_p=(0,c_0,1), where c0c_0 is the constant zero coloring.✦

A box label bb on the color set CpC_p is a map b:Cp→{0,…,Dp}b:C_p\to\{0,\ldots,D_p\}, with the supremum norm on its coordinates.✦ The distance profile ℓp(x)\ell_p(x) of a vertex x∈Xpx\in X_p is the box label whose coordinate at a color is the shortest walk length to that color, truncated at DpD_p, as in (10). ℓp(x)(i)=min⁡({Dp}∪{|w|:χp(x⋅w)=i}),i∈Cp.\ell_p(x)(i) =\min\bigl(\{D_p\}\cup \{|w|:\chi_p(x\cdot w)=i\}\bigr), \qquad i\in C_p.(10)✦ The set of realized label anchors is 𝒜p=ℓp(Xp)\mathcal A_p=\ell_p(X_p).✦ The metric block MpM_p, with scale RpR_p, has the vertices XpX_p of GpG_p and a separate copy of the realized label anchors 𝒜p\mathcal A_p as its points. The anchor inclusion ιanc\iota_{\mathrm{anc}} maps each label in 𝒜p\mathcal A_p to its copy in the metric block MpM_p.✦ The base point opo_p of the metric block MpM_p is the anchor of the distinguished vertex vpv_p of GpG_p, as specified in (11). Mp=Xp⊔𝒜p,op=ιanc(ℓp(vp)).M_p=X_p\sqcup\mathcal A_p, \qquad o_p=\iota_{\mathrm{anc}}\bigl(\ell_p(v_p)\bigr).(11)

The pointed metric wedge (M,d,o)(M,d,o) joins the successive pieces (Mn+1,on+1)(M_{n+1},o_{n+1}), n≥0n\ge0, by identifying their base points.✦ (M,o)=⋁p≥1(Mp,op),M={o}⊔∐p≥1(Mp\{op}).(M,o)=\bigvee_{p\ge1}(M_p,o_p), \qquad M=\{o\}\sqcup\coprod_{p\ge1}\bigl(M_p\setminus\{o_p\}\bigr).(12)

The Claim

Theorem 1. There exists a countable pointed metric space (M,d,o)(M,d,o) satisfying (13) and the properties (14), (15), (16), and (17) below.✦ The metric wedge (12) is such a space. d(x,y)≥1(x,y∈M,x≠y).d(x,y)\ge1\qquad(x,y\in M,\ x\ne y).(13)✦ supx∈Md(o,x)=+∞.\sup_{x\in M}d(o,x)=+\infty.(14)✦ For some x∈Mx\in M and r>0r>0, B¯(x,r) is not compact.\overline B(x,r)\text{ is not compact}.(15)✦ ℱ(M) has AP.\mathcal F(M)\text{ has AP}.(16)✦ For every λ∈ℝ\lambda\in\mathbb R, there are a compact set Cλ⊂ℱ(M)C_\lambda\subset\mathcal F(M) and ελ>0\varepsilon_\lambda>0 such that supu∈Cλ∥Tu−u∥≥ελ(T∈ℛ(ℱ(M)),∥T∥≤λ).\sup_{u\in C_\lambda}\|Tu-u\|\ge\varepsilon_\lambda \qquad \bigl(T\in\mathscr R(\mathcal F(M)),\ \|T\|\le\lambda\bigr).(17)✦

The Lipschitz-free space ℱ(M)\mathcal F(M) of the metric wedge has AP.✦ For every real λ\lambda, the Lipschitz-free space ℱ(M)\mathcal F(M) of the metric wedge fails λ\lambda-BAP.✦

What Is Checked

The existence assertion in (13) is stated over real Lipschitz-free spaces of pointed metric spaces, with the witness based at the common label anchor of the metric wedge (12).

The color count cpc_p in (5) is positive.✦

For every pointed metric space (M,d,o)(M,d,o) and every x∈Mx\in M, the evaluation functional satisfies ∥δx∥≤d(x,o)\|\delta_x\|\le d(x,o).