OctoInformBeta

OpenAI preprint, September 2026 · §7. Cycles from an idempotent

Centralizer action, a fixed support graph, and path weights: Finite orbit chains and bounded-degree support graphs for complex group ring matrices

Centralizer actions and weighted group ring paths.

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

For a matrix over a complex group ring, consider paths whose closing step is twisted by a fixed group element. Let GG be a group, let II be a finite index set, and let e=(eij)∈MI(ℂ[G])e=(e_{ij})\in M_I(\mathbb C[G]) be a group ring matrix. The corresponding complex matrix algebra is MI(ℂ)M_I(\mathbb C).✦ Fix g∈Gg\in G, and write tr\operatorname{tr} for the ordinary matrix trace.

For g∈Gg\in G, the centralizer JJ is the subgroup of GG specified in (1)✦, and the cyclic subgroup ZZ of JJ is generated by gg.✦ J=CG(g)={c∈G:cg=gc},Z=⟨g⟩≤J.J=C_G(g)=\{c\in G:cg=gc\},\qquad Z=\langle g\rangle\leq J.(1)

The matrix support supp⁡(e)\operatorname{supp}(e) is the finite set of group elements having a nonzero coefficient in some entry of ee, as in (2). supp⁡(e)={s∈G:the coefficient of s in eij is nonzero for some i,j∈I}.\operatorname{supp}(e) =\{s\in G:\text{the coefficient of $s$ in $e_{ij}$ is nonzero for some $i,j\in I$}\}.(2)✦

For k≥1k\geq1, a path hh in GG is a tuple h=(h0,…,hk−1)∈Gkh=(h_0,\ldots,h_{k-1})\in G^k. The twisted increments δi(h)\delta_i(h) of a path h=(h0,…,hk−1)∈Gkh=(h_0,\ldots,h_{k-1})\in G^k are the group elements defined in (3). δi(h)={hi−1hi+1,0≤i<k−1,hk−1−1gh0,i=k−1.\delta_i(h)= \begin{cases} h_i^{-1}h_{i+1},&0\leq i<k-1,\\ h_{k-1}^{-1}gh_0,&i=k-1. \end{cases}(3)✦ Centralizer equivalence of paths is the relation ∼\sim on GkG^k given by (4). h∼h′⇔hi′=chifor every i, for some c∈J.h\sim h' \quad\Longleftrightarrow\quad h'_i=ch_i\ \text{for every $i$, for some $c\in J$}.(4)✦

The Claim

Definition 1 (Centralizer action and path weights). The centralizer quotient HH is the quotient group of JJ by ZZ✦, and the vertex space YY is the set of right cosets of ZZ in GG, as specified in (5)✦; right translation by s∈Gs\in G sends ZhZh to ZhsZhs.✦ H=J/Z,Y=Z∖G,(cZ)⋅(Zh)=Zch(c∈J,h∈G).H=J/Z,\qquad Y=Z\backslash G,\qquad (cZ)\cdot(Zh)=Zch\quad(c\in J,\ h\in G).(5)

Let S⊆GS\subseteq G be finite and symmetric, meaning S−1=SS^{-1}=S. The support graph ΓS\Gamma_S is the simple graph on YY with adjacency (6). y∼ΓSz⇔y≠zandz=ysfor some s∈S.y\sim_{\Gamma_S}z \quad\Longleftrightarrow\quad y\ne z\ \text{and}\ z=ys\ \text{for some $s\in S$}.(6)✦ The centralizer quotient action is free as in (7). Stab⁡H(y)={1}(y∈Y).\operatorname{Stab}_H(y)=\{1\}\qquad(y\in Y).(7)✦ The degree bound is (8). deg⁡ΓS(y)≤|S|(y∈Y).\deg_{\Gamma_S}(y)\leq |S|\qquad(y\in Y).(8)✦ If SS generates GG, then (9) holds. ΓSis connected.\Gamma_S\ \text{is connected}.(9)✦ If GG is finitely generated, a finite set S⊆GS\subseteq G can be chosen with the properties in (10). S−1=S,⟨S⟩=G,supp⁡(e)⊆S.S^{-1}=S,\qquad \langle S\rangle=G,\qquad \operatorname{supp}(e)\subseteq S.(10)✦

The coefficient matrix As∈MI(ℂ)A_s\in M_I(\mathbb C) of ee at s∈Gs\in G is defined by (11). (As)ij=the coefficient of s in eij(i,j∈I).(A_s)_{ij}=\text{the coefficient of $s$ in $e_{ij}$} \qquad(i,j\in I).(11)✦ The convolution kernel Ke:G×G→MI(ℂ)K_e:G\times G\to M_I(\mathbb C) is given by (12). Ke(h,ℓ)=Ah−1ℓ.K_e(h,\ell)=A_{h^{-1}\ell}.(12)✦

For k≥1k\geq1, the path orbit space QkQ_k is the quotient in (13) by the centralizer equivalence (4). Qk=Gk/∼=J∖Gk.Q_k=G^k/{\sim}=J\backslash G^k.(13)✦ The path weight wk:Gk→ℂw_k:G^k\to\mathbb C is defined by (14), with the matrix factors ordered by increasing ii. wk(h)=tr⁡(∏i=0k−1Aδi(h)).w_k(h)=\operatorname{tr} \left(\prod_{i=0}^{k-1} A_{\delta_i(h)}\right).(14)✦ The orbit weight Wk:Qk→ℂW_k:Q_k\to\mathbb C is the function assigning the path weight wk(h)w_k(h) to the orbit [h][h], as in (15). Wk([h])=wk(h).W_k([h])=w_k(h).(15)✦ Write 𝒆q\mathbf e_q for the basis vector at qq in the free complex vector space on QkQ_k. The weighted path orbit vector vkv_k in ℂ(Qk)\mathbb C^{(Q_k)} is the finitely supported vector defined in (16). vk=∑q∈QkWk(q)𝒆q∈ℂ(Qk).v_k=\sum_{q\in Q_k}W_k(q)\mathbf e_q \in\mathbb C^{(Q_k)}.(16)✦

In the paper, the result reads: for a finitely generated group GG, an idempotent e=∑sAss∈Mr(ℂ[G])e=\sum_s A_s s\in M_r(\mathbb C[G]), and an infinite-order element gg, put J=CG(g)J=C_G(g), H=J/⟨g⟩H=J/\langle g\rangle, and Y=⟨g⟩∖GY=\langle g\rangle\backslash G; a finite symmetric generating set S⊆G\{1}S\subseteq G\setminus\{1\} containing the nonidentity coefficient support and its inverses gives a connected simple graph on YY by right steps in SS, of degree at most D=max⁡(2,|S|)D=\max(2,|S|), on which HH acts freely by graph automorphisms, while for k≥1k\geq1 the weight tr⁡(Ah0−1h1⋯Ahk−2−1hk−1Ahk−1−1gh0)\operatorname{tr}(A_{h_0^{-1}h_1}\cdots A_{h_{k-2}^{-1}h_{k-1}} A_{h_{k-1}^{-1}gh_0}) of a tuple in GkG^k, with only the closing factor when k=1k=1, gives a finite chain vkv_k on Qk=J∖GkQ_k=J\backslash G^k.

What Is Checked

The constructions are stated over arbitrary group ring matrices on a finite index set and arbitrary g∈Gg\in G; finite generation is assumed for the choice of SS in (10).

For every finite symmetric set SS, each vertex of ΓS\Gamma_S has finitely many neighbors✦, so ΓS\Gamma_S is locally finite.✦ For every k≥1k\geq1, the orbit weight WkW_k is nonzero on only finitely many orbits.✦