OctoInformBeta

OpenAI preprint, September 2026 · Section 3. Sparse assignments from nonamenability

Section 3: regular averages, product labels and endpoint loads: Word labels and Boolean assignments for a discrete group

Regular translations and labelled endpoint loads.

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. The complex Hilbert space ℓ2(G)\ell^2(G) is the space of square-summable functions on GG, with norm as in (1): ℓ2(G)={f:G→ℂ:∑x∈G|f(x)|2<∞},∥f∥22=∑x∈G|f(x)|2.\ell^2(G)=\left\{f:G\to\mathbb C:\sum_{x\in G}|f(x)|^2<\infty\right\}, \qquad \|f\|_2^2=\sum_{x\in G}|f(x)|^2.(1)✦ A family s:I→Gs:I\to G, written si=s(i)s_i=s(i), supplies group elements for a label set II.

For a bijection e:G→Ge:G\to G, the coordinate permutation TeT_e on ℓ2(G)\ell^2(G) is the complex-linear operator defined by (2): (Tef)(x)=f(e(x)).(T_e f)(x)=f(e(x)).(2)✦

The Definition

Definition 1. The right regular representation R:G→ℬ(ℓ2(G))R:G\to\mathcal B(\ell^2(G)), where ℬ(ℓ2(G))\mathcal B(\ell^2(G)) denotes the bounded complex-linear operators, is the homomorphism defined by (3): (Rtf)(x)=f(xt)(t,x∈G,f∈ℓ2(G)).(R_t f)(x)=f(xt) \qquad(t,x\in G,\ f\in\ell^2(G)).(3)✦

A word ww of length nn with labels in II is an element of Wn(I)W_n(I), the set defined recursively by (4), where nn is a nonnegative integer and ε\varepsilon denotes the empty word: W0(I)={ε},Wn+1(I)=I×Wn(I).W_0(I)=\{\varepsilon\}, \qquad W_{n+1}(I)=I\times W_n(I).(4)✦ The word product ps,n:Wn(I)→Gp_{s,n}:W_n(I)\to G is the map defined recursively by (5): ps,0(ε)=1,ps,n+1(i,w)=sips,n(w)(i∈I,w∈Wn(I)).p_{s,0}(\varepsilon)=1, \qquad p_{s,n+1}(i,w)=s_i\,p_{s,n}(w) \quad(i\in I,\ w\in W_n(I)).(5)✦

Suppose II is finite, and let a:G×I→{0,1}a:G\times I\to\{0,1\} be a Boolean assignment. The row ones AxA_x at x∈Gx\in G form the finite subset of II defined by (6): Ax={i∈I:a(x,i)=1}.A_x=\{i\in I:a(x,i)=1\}.(6)✦ The column zeros ByB_y at y∈Gy\in G form the finite subset of II defined by (7): By={i∈I:a(ysi−1,i)=0}.B_y=\{i\in I:a(ys_i^{-1},i)=0\}.(7)✦

In the paper, the result reads: right translation on ℓ2(G)\ell^2(G) is Rtf(x)=f(xt)R_t f(x)=f(xt); a list (si)i∈I(s_i)_{i\in I} determines a labelled edge (x,i)(x,i) joining row xx to column xsixs_i, with a(x,i)=1a(x,i)=1 assigning it to its row and a(x,i)=0a(x,i)=0 to its column; distinct labels remain distinct edges even when their group products coincide.

What Is Checked

The definitions apply to every discrete group GG and every label set II, with II finite for the endpoint sets, and to every family ss and Boolean assignment aa of the stated kind.

For every bijection e:G→Ge:G\to G and every f∈ℓ2(G)f\in\ell^2(G), the coordinate permutation TeT_e satisfies (8): ∥Tef∥2=∥f∥2.\|T_e f\|_2=\|f\|_2.(8)✦