OctoInformBeta

OpenAI preprint, September 2026 · Section 4. Finite-dimensional weights and sparse block operators

Lemma 4.2: Row and column supports give a squared norm estimate for finite sums of weighted rank-one translations

Synthesis bounds control masked 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

Let GG be a discrete group, II a finite set of labels, and KK a finite coordinate set. A masked operator on ℓ2(G;ℂK)\ell^2(G;\mathbb C^K) combines right translations with rank-one operators on the fibres, allowing a different scalar coefficient at each group element. Its row and column supports record which labels contribute at an output coordinate and at an input coordinate.

The fibre H=ℂKH=\mathbb C^K is the complex Euclidean space of functions on KK, of dimension |K||K|. The Hilbert sum ⨁x∈GEx\bigoplus_{x\in G}E_x of complex Hilbert spaces (Ex)x∈G(E_x)_{x\in G} is the space of families with summable squared norms.✦ For the constant fibre HH, this gives the space and norm in (1): ℋ=ℓ2(G;H)=⨁x∈GH,∥ξ∥2=∑x∈G∥ξ(x)∥H2.\mathcal H=\ell^2(G;H)=\bigoplus_{x\in G}H, \qquad \|\xi\|^2=\sum_{x\in G}\|\xi(x)\|_H^2.(1)

For a bijection e:G→Ge:G\to G, the coordinate permutation PeP_e on ℋ\mathcal H is the operator that sends ξ\xi to the family x↦ξ(e(x))x\mapsto\xi(e(x)).✦ Right translation by t∈Gt\in G on ℋ\mathcal H is the bounded complex-linear operator Rt=Px↦xtR_t=P_{x\mapsto xt}, as in (2): (Peξ)(x)=ξ(e(x)),(Rtξ)(x)=ξ(xt).(P_e\xi)(x)=\xi(e(x)), \qquad (R_t\xi)(x)=\xi(xt).(2)✦

The direct sum ⨁x∈GAx\bigoplus_{x\in G}A_x of bounded complex-linear operators Ax:Ex→ExA_x:E_x\to E_x with a common nonnegative norm bound κ\kappa is the operator on the Hilbert sum given in (3): (⨁x∈GAx)ξ(x)=Axξ(x).\left(\bigoplus_{x\in G}A_x\right)\xi(x)=A_x\xi(x).(3)✦

Fix vectors vi∈Hv_i\in H, group elements si∈Gs_i\in G and a scalar mask c:G×I→ℂc:G\times I\to\mathbb C satisfying |c(x,i)|≤1|c(x,i)|\leq1. Labels in II are retained even when their group elements sis_i coincide. For each i∈Ii\in I, the rank-one operator QiQ_i on HH is given by Qiη=vi⟨vi,η⟩Q_i\eta=v_i\langle v_i,\eta\rangle. The weighted rank-one shift TiT_i and the masked operator TcT_c on ℋ\mathcal H are the bounded complex-linear operators in (4); the direct sum uses (3): Ti=(⨁x∈Gc(x,i)Qi)Rsi,Tc=∑i∈ITi,(Tcξ)(x)=∑i∈Ic(x,i)vi⟨vi,ξ(xsi)⟩.T_i=\left(\bigoplus_{x\in G}c(x,i)Q_i\right)R_{s_i}, \qquad T_c=\sum_{i\in I}T_i, \qquad (T_c\xi)(x)=\sum_{i\in I}c(x,i)v_i \langle v_i,\xi(xs_i)\rangle.(4)

For x,y∈Gx,y\in G, the row support RxR_x and column support CyC_y are the sets of active labels in II defined in (5): Rx={i∈I:c(x,i)≠0},Cy={i∈I:c(ysi−1,i)≠0}.R_x=\{i\in I:c(x,i)\ne0\}, \qquad C_y=\{i\in I:c(ys_i^{-1},i)\ne0\}.(5)

For a subset J⊆IJ\subseteq I, the synthesis operator VJ:ℂJ→HV_J:\mathbb C^J\to H is the bounded complex-linear map forming linear combinations of the corresponding vectors, as in (6): VJa=∑i∈Jaivi.V_J a=\sum_{i\in J}a_i v_i.(6)✦

A subfamily synthesis bound (p,b)(p,b) for the family (vi)i∈I(v_i)_{i\in I} is a pair with p∈ℕp\in\mathbb N and b∈ℝb\in\mathbb R satisfying (7), including for the empty subfamily: ∥VJ∥≤bfor every J⊆I with |J|≤p.\|V_J\|\leq b \qquad\text{for every }J\subseteq I\text{ with }|J|\leq p.(7)✦

The Claim

Theorem 1. Let b≥0b\geq0, with TcT_c, RxR_x and CyC_y as in (4) and (5).

If ∥VRx∥≤b\|V_{R_x}\|\leq b for every x∈Gx\in G and ∥VCy∥≤b\|V_{C_y}\|\leq b for every y∈Gy\in G, then ∥Tc∥≤b2.\|T_c\|\leq b^2.(8)✦

If the family has the subfamily synthesis bound (7) and |Rx|≤p|R_x|\leq p, |Cy|≤p|C_y|\leq p for every x,y∈Gx,y\in G, then ∥Tc∥≤b2.\|T_c\|\leq b^2.(9)✦

In the paper, the result reads: for n=|I|n=|I|, 1≤p≤n1\leq p\leq n and b0>0b_0>0, if ∥VJ∥≤b0\|V_J\|\leq b_0 for every J⊆IJ\subseteq I with |J|≤p|J|\leq p, the mask satisfies |c(x,i)|≤1|c(x,i)|\leq1, and both RxR_x and CyC_y have size at most pp for every x,y∈Gx,y\in G, then ∥Tc∥≤b02\|T_c\|\leq b_0^2.

What Is Checked

The estimates (8) and (9) are stated over a discrete group, finite label and fibre coordinate sets, a scalar mask of modulus at most one, and respectively the synthesis bounds on the supports or the subfamily synthesis bound with the support cardinality bounds.

The coordinate permutation in (2) is a complex-linear isometry: ∥Peξ∥=∥ξ∥\|P_e\xi\|=\|\xi\|. The direct sum in (3) has operator norm at most the common bound κ\kappa.