OctoInformBeta

OpenAI preprint, September 2026 · Section 4. Finite-rank operators and signed measures

Lemma 4.2: Affine weights preserve centered pairings and satisfy quantitative variation and label bump bounds

Signed measures from finite-support operators.

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 coefficient at the basepoint is free to change when a vector in a Lipschitz-free space is represented by signed weights. Affine weights specify this coefficient for operator images, while label bumps test their distribution on the constructed block.

Let (M,d,o)(M,d,o) be a pointed metric space with real scalars. The space Lip⁡0(M)\operatorname{Lip}_0(M) consists of the real Lipschitz functions vanishing at oo, with the Lipschitz norm.✦ The Lipschitz-free space ℱ(M)\mathcal F(M) is the closed linear span of the evaluation functionals in Lip⁡0(M)*\operatorname{Lip}_0(M)^*, as in (1); the canonical pairing is ⟨u,f⟩=u(f)\langle u,f\rangle=u(f). ∥f∥Lip=supx≠y|f(x)−f(y)|d(x,y),δx(f)=f(x),ℱ(M)=span¯{δx:x∈M}⊆Lip⁡0(M)*.\|f\|_{\operatorname{Lip}} =\sup_{x\ne y}\frac{|f(x)-f(y)|}{d(x,y)}, \qquad \delta_x(f)=f(x), \qquad \mathcal F(M) =\overline{\operatorname{span}}\{\delta_x:x\in M\} \subseteq\operatorname{Lip}_0(M)^*.(1) For a real Lipschitz function gg, its centered function is g∘(t)=g(t)−g(o)g^\circ(t)=g(t)-g(o), an element of Lip⁡0(M)\operatorname{Lip}_0(M).✦ For each x∈Mx\in M, the evaluation functional δx∈Lip⁡0(M)*\delta_x\in\operatorname{Lip}_0(M)^* sends ff to f(x)f(x). The Dirac embedding x↦δxx\mapsto\delta_x regards each evaluation functional as a vector of ℱ(M)\mathcal F(M).

Assume that distinct points of MM have distance at least one. For j∈Mj\in M, the Lipschitz point indicator ιj\iota_j is the function on MM equal to 𝟏{j}\mathbf 1_{\{j\}} for j≠oj\ne o and zero for j=oj=o.✦ For j∈Mj\in M, the coefficient functional cjc_j on ℱ(M)\mathcal F(M) is evaluation against the point indicator ιj\iota_j, as in (2). For a finite set S⊂MS\subset M containing oo, the finite-support projection PSP_S is the operator in the same display. cj(u)=⟨u,ιj⟩,PSu=∑j∈Scj(u)δj.c_j(u)=\langle u,\iota_j\rangle, \qquad P_Su=\sum_{j\in S}c_j(u)\delta_j.(2)

A signed measure ν\nu on SS is a family of real weights indexed by SS. Its pairing with a function gg on SS and its total variation are defined by (3). ⟨ν,g⟩S=∑j∈Sν(j)g(j),∥ν∥TV=∑j∈S|ν(j)|.\langle\nu,g\rangle_S=\sum_{j\in S}\nu(j)g(j), \qquad \|\nu\|_{\mathrm{TV}}=\sum_{j\in S}|\nu(j)|.(3) The affine weights αu\alpha_u of u∈ℱ(M)u\in\mathcal F(M) are the signed measure on SS defined in (4). For a bounded linear operator TT on ℱ(M)\mathcal F(M), write μx\mu_x for the weights of TδxT\delta_x. αu(j)=cj(u)+𝟏{o}(j)(1−∑s∈Scs(u)),μx=αTδx.\alpha_u(j)=c_j(u)+\mathbf 1_{\{o\}}(j) \left(1-\sum_{s\in S}c_s(u)\right), \qquad \mu_x=\alpha_{T\delta_x}.(4)✦

For a map h:M→Nh:M\to N into a metric space, a center z∈Nz\in N, and real parameters ℓ\ell and κ\kappa, the label bump bh,zℓ,κb_{h,z}^{\ell,\kappa} is the real function on MM given by (5). bh,zℓ,κ(t)=ℓmax⁡{1−dN(z,h(t))κ,0}.b_{h,z}^{\ell,\kappa}(t) =\ell\max\left\{1-\frac{d_N(z,h(t))}{\kappa},0\right\}.(5)✦

The Constructed Block

Fix an integer p≥1p\ge1. The block scales and counts are defined by (6), where kk is the number of generators, Δ\Delta is the graph degree bound, QQ is the local ball bound, HH is the ball bound, and mm is the number of colors. L=10p,R=3L,K=10p(R+1),D=K+2L+5,B=Bp=4R+D=300p2+150p+5,V=1+4pB,k=20V+2,Δ=2k,Q=Δ2L+1,H=ΔD+1,m=2ΔQH+1.\begin{gathered} L=10p,\qquad R=3L,\qquad K=10p(R+1),\qquad D=K+2L+5,\\ B=B_p=4R+D=300p^2+150p+5,\qquad V=1+4pB,\\ k=20V+2,\qquad \Delta=2k,\qquad Q=\Delta^{2L+1},\qquad H=\Delta^{D+1},\qquad m=2\Delta QH+1. \end{gathered}(6) The generator set is A={0,…,k−1}A=\{0,\ldots,k-1\}✦, and the color set is C={0,…,m−1}C=\{0,\ldots,m-1\}.✦ The local radius LL is given by L=10pL=10p. Set the scale KK to 10p(R+1)10p(R+1). The label cap is D=K+2L+5D=K+2L+5. Use 4R+D4R+D for the scale BB. The auxiliary bound VV is given by V=1+4pBV=1+4pB.

Let FAF_A be the free group on AA. For each nonnegative integer nn, the word ball WnW_n in FAF_A consists of the elements of reduced word length at most nn, and Γn\Gamma_n is its full permutation group.✦ For each generator aa, choose a permutation σn,a\sigma_{n,a} of WnW_n that agrees with left multiplication by aa wherever the product belongs to WnW_n, and let the word ball permutation representation ρn\rho_n be the homomorphism extending this assignment, as in (7). Wn={g∈FA:the reduced word length of g is at most n},Γn=Sym⁡(Wn),ρn:FA→Γn,ρn(a)=σn,a.W_n=\{g\in F_A:\text{the reduced word length of }g\text{ is at most }n\}, \qquad \Gamma_n=\operatorname{Sym}(W_n), \qquad \rho_n:F_A\to\Gamma_n,\quad \rho_n(a)=\sigma_{n,a}.(7)

A graph with reversible ports is a graph equipped with an involutive reversal of its ports such that reversed moves undo one another.✦ The finite Cayley graph on Γn\Gamma_n has ports (a,ε)∈A×{+1,−1}(a,\varepsilon)\in A\times\{+1,-1\}, signed generator aεa^\varepsilon, and move γ↦γρn(aε)\gamma\mapsto\gamma\rho_n(a^\varepsilon); port reversal changes ε\varepsilon to −ε-\varepsilon.✦ A coloring χ:Γn→C\chi:\Gamma_n\to C remains fixed under moves. All colored Cayley graphs at a fixed radius form one component family; their disjoint union over radii is the block graph GG on the vertex set XX in (8), with componentwise coloring cc. X=∐n≥0(CΓn×Γn),c(n,χ,γ)=χ(γ),G((n,χ,γ),(a,ε))=(n,χ,γρn(aε)).\begin{gathered} X=\coprod_{n\ge0}(C^{\Gamma_n}\times\Gamma_n), \qquad c(n,\chi,\gamma)=\chi(\gamma),\\ G\bigl((n,\chi,\gamma),(a,\varepsilon)\bigr) =(n,\chi,\gamma\rho_n(a^\varepsilon)). \end{gathered}(8)

For a vertex x∈Xx\in X and a finite list ww of ports, the endpoint x⋅wx\cdot w of the port walk from xx is obtained by following ww in order. A box label is a vector in {0,…,D}C\{0,\ldots,D\}^C, with the supremum norm.✦ For a vertex x∈Xx\in X and a color i∈Ci\in C, the coordinate ax(i)a_x(i) of the vertex distance profile and the set 𝒜\mathcal A of realized label anchors are defined in (9); |w||w| denotes the length of the port list. ax(i)=min⁡({D}∪{|w|:c(x⋅w)=i}),𝒜={ax:x∈X}⊆{0,…,D}C.a_x(i)=\min\left(\{D\}\cup \{|w|:c(x\cdot w)=i\}\right), \qquad \mathcal A=\{a_x:x\in X\}\subseteq\{0,\ldots,D\}^C.(9) The metric block MpM_p is the graph with these label anchors and attachment scale RR.✦ The maps ιX\iota_X and ι𝒜\iota_{\mathcal A} are the inclusions of the vertex set XX and the anchor set 𝒜\mathcal A into the metric block MpM_p. Its block label hph_p and finite anchor set 𝒜p\mathcal A_p are given in (10). Mp=X⊔𝒜,hp(ιXx)=ax,hp(ι𝒜a)=a,𝒜p=ι𝒜(𝒜),x0=(0,χ0,1),χ0≡0,o=ι𝒜(ax0),bx=bhp,axL,K.\begin{gathered} M_p=X\sqcup\mathcal A,\qquad h_p(\iota_Xx)=a_x,\qquad h_p(\iota_{\mathcal A}a)=a,\\ \mathcal A_p=\iota_{\mathcal A}(\mathcal A),\qquad x_0=(0,\chi_0,1),\qquad \chi_0\equiv0,\qquad o=\iota_{\mathcal A}(a_{x_0}),\qquad b_x=b_{h_p,a_x}^{L,K}. \end{gathered}(10) Here x0x_0 is the distinguished graph vertex, oo is the block basepoint, and bxb_x is the bump associated with the source vertex x∈Xx\in X.

The Claim

Theorem 1. Let (M,d,o)(M,d,o) be unit-separated, meaning that distinct points have distance at least one, and let S⊂MS\subset M be finite and contain oo. For every u∈ℱ(M)u\in\mathcal F(M), the affine mass is given by (11). ∑j∈Sαu(j)=1.\sum_{j\in S}\alpha_u(j)=1.(11)✦ If PSu=uP_Su=u and g:M→ℝg:M\to\mathbb R is Lipschitz, its centered pairing is (12). ⟨αu,g|S⟩S=⟨u,g∘⟩+g(o).\langle\alpha_u,g|_S\rangle_S =\langle u,g^\circ\rangle+g(o).(12)✦

Let T:ℱ(M)→ℱ(M)T:\mathcal F(M)\to\mathcal F(M) be bounded linear with PST=TP_ST=T. For real q≥0q\ge0 and β\beta, suppose that ∥T∥≤2q\|T\|\le2q and d(x,o)≤βd(x,o)\le\beta for every x∈Mx\in M. Then (13) holds for every x∈Mx\in M. ∥μx∥TV≤1+4qβ.\|\mu_x\|_{\mathrm{TV}}\le1+4q\beta.(13)✦

Let h:M→Nh:M\to N be 11-Lipschitz, and let x,a∈Mx,a\in M satisfy h(a)=h(x)h(a)=h(x). Take real ℓ≥0\ell\ge0, κ>0\kappa>0, q≥0q\ge0 and rr. Suppose that PST=TP_ST=T, ∥T∥≤2q\|T\|\le2q, d(x,a)≤rd(x,a)\le r, and ∥Tδa−δa∥<1\|T\delta_a-\delta_a\|<1. The bump estimate is (14). ⟨μx,bh,h(x)ℓ,κ|S⟩S≥ℓ−ℓκ(2qr+1).\left\langle\mu_x, b_{h,h(x)}^{\ell,\kappa}|_S\right\rangle_S \ge \ell-\frac{\ell}{\kappa}(2qr+1).(14)✦

On the constructed block MpM_p, let SS be finite and contain oo, and let TT be bounded linear on ℱ(Mp)\mathcal F(M_p). Assume that PST=TP_ST=T, ∥T∥≤2p\|T\|\le2p, and ∥Tδa−δa∥<1\|T\delta_a-\delta_a\|<1 for every a∈𝒜pa\in\mathcal A_p. For every source vertex x∈Xx\in X, the block estimate is (15). ⟨μιXx,bx|S⟩S≥3L4.\langle\mu_{\iota_Xx},b_x|_S\rangle_S\ge\frac{3L}{4}.(15)✦

In the paper, the result reads: for an integer p≥1p\ge1, a finite S⊂MpS\subset M_p containing oo, and a bounded linear TT whose range is supported on SS, with ∥T∥≤2p\|T\|\le2p and ∥Tδa−δa∥<1\|T\delta_a-\delta_a\|<1 at every anchor, there are signed measures μy\mu_y on SS of total mass one for all y∈Mpy\in M_p, satisfying ∑j∈Sμy(j)g(j)=⟨Tδy,g−g(o)⟩+g(o)\sum_{j\in S}\mu_y(j)g(j)=\langle T\delta_y,g-g(o)\rangle+g(o) for every real Lipschitz gg, with ∥μy∥TV≤V=1+4pB\|\mu_y\|_{\mathrm{TV}}\le V=1+4pB and ∑j∈SμιXx(j)bx(j)≥3L/4\sum_{j\in S}\mu_{\iota_Xx}(j)b_x(j)\ge3L/4 for every source vertex x∈Xx\in X.

What Is Checked

The general assertions are stated over unit-separated pointed metric spaces and finite sets containing the basepoint. The block assertion uses the graph with label anchors MpM_p, its specified basepoint and its finite anchor set.

The color count mm is positive.✦ The metric block satisfies d(u,v)≥1d(u,v)\ge1 for distinct u,v∈Mpu,v\in M_p.✦