OctoInformBeta

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

Lemma 7.1: For a group GG, idempotents over ℂ[G]\mathbb C[G] have zero trace coefficient at every element of infinite order

Restricting matrices and their conjugacy class traces.

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 group and II a finite set. A group ring matrix ee is an element of MI(ℂ[G])M_I(\mathbb C[G]), where ℂ[G]\mathbb C[G] is the finitely supported complex group ring.✦ The matrix support supp⁡(e)\operatorname{supp}(e) of a matrix e∈MI(ℂ[G])e\in M_I(\mathbb C[G]) is the finite subset of GG defined in (1): supp⁡(e)=⋃i,j∈Isupp⁡(eij).\operatorname{supp}(e) =\bigcup_{i,j\in I}\operatorname{supp}(e_{ij}).(1)✦

For g∈Gg\in G, write [g]G[g]_G for its conjugacy class. The conjugacy class coefficient cG(a;g)c_G(a;g) of a=∑h∈Gahh∈ℂ[G]a=\sum_{h\in G}a_hh\in\mathbb C[G] is the sum in (2): cG(a;g)=∑h∈[g]G∩supp⁡(a)ah.c_G(a;g)=\sum_{h\in[g]_G\cap\operatorname{supp}(a)}a_h.(2)✦ For a square matrix ee over ℂ[G]\mathbb C[G] and g∈Gg\in G, the idempotent trace coefficient HSG(e)([g]G)\mathrm{HS}_G(e)([g]_G) is the value of its conjugacy-class Hattori-Stallings trace given by (3): HSG(e)([g]G)=cG(tr⁡(e);g),tr⁡(e)=∑i∈Ieii.\mathrm{HS}_G(e)([g]_G) =c_G(\operatorname{tr}(e);g), \qquad \operatorname{tr}(e)=\sum_{i\in I}e_{ii}.(3)

Let KK be a subgroup of GG, with inclusion j:K↪Gj:K\hookrightarrow G. Write j*:ℂ[K]→ℂ[G]j_*:\mathbb C[K]\to\mathbb C[G] for extension along this inclusion, and also for its entrywise application to matrices. The restriction e|Ke|_K of e∈MI(ℂ[G])e\in M_I(\mathbb C[G]) is the matrix in MI(ℂ[K])M_I(\mathbb C[K]) whose coefficients are specified in (4): ((e|K)rs)h=(ers)j(h)(r,s∈I,h∈K).\bigl((e|_K)_{rs}\bigr)_h=(e_{rs})_{j(h)} \qquad(r,s\in I,\ h\in K).(4)✦

The Claim

Theorem 1. Let K≤GK\leq G and let e∈MI(ℂ[G])e\in M_I(\mathbb C[G]) have supp⁡(e)⊆K\operatorname{supp}(e)\subseteq K. Entrywise extension satisfies (5): j*(e|K)=e.j_*(e|_K)=e.(5)✦ If ee is idempotent, its restriction satisfies (6): (e|K)2=e|K.(e|_K)^2=e|_K.(6)✦ The matrix traces satisfy (7): j*(tr⁡(e|K))=tr⁡(e).j_*\bigl(\operatorname{tr}(e|_K)\bigr)=\operatorname{tr}(e).(7)✦

For a∈ℂ[K]a\in\mathbb C[K] and g∈Gg\in G, the conjugacy class coefficients satisfy (8): cG(j*a;g)=∑h∈supp⁡(a)j(h)∈[g]Gah.c_G(j_*a;g) =\sum_{\substack{h\in\operatorname{supp}(a)\\j(h)\in[g]_G}}a_h.(8)✦

Let A⊆GA\subseteq G be a union of conjugacy classes, and let a∈ℂ[G]a\in\mathbb C[G] satisfy cG(a;h)=0c_G(a;h)=0 for every h∈Ah\in A. Then (9) holds: ∑h∈A∩supp⁡(a)ah=0.\sum_{h\in A\cap\operatorname{supp}(a)}a_h=0.(9)✦

Let qq be a nonnegative integer, let e∈Mq(ℂ[G])e\in M_q(\mathbb C[G]) be idempotent, and let g∈Gg\in G have infinite order. Then (10) holds: HSG(e)([g]G)=0.\mathrm{HS}_G(e)([g]_G)=0.(10)✦

In the paper, the result reads: every inclusion i:L↪Gi:L\hookrightarrow G of discrete groups induces by extension of scalars a map between Grothendieck groups of finitely generated projective modules i*:K0(ℂ[L])→K0(ℂ[G])i_*:K_0(\mathbb C[L])\to K_0(\mathbb C[G]) such that, for every y∈K0(ℂ[L])y\in K_0(\mathbb C[L]) and conjugacy class CC of GG, HSG(i*y)(C)=∑B⊆L∩CHSL(y)(B)\mathrm{HS}_G(i_*y)(C)=\sum_{B\subseteq L\cap C}\mathrm{HS}_L(y)(B), where BB ranges over the conjugacy classes of LL and only finitely many summands are nonzero; every x∈K0(ℂ[G])x\in K_0(\mathbb C[G]) is induced from a finitely generated subgroup that can be required to contain any prescribed finite subset of GG; and the finite-order-support assertion for all finitely generated groups therefore implies it for every discrete group.

What Is Checked

The statements are over complex group rings of arbitrary groups and finite square matrices, with support containment for restriction and conjugacy invariance for the coefficient sum.