Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Modular trace depends only on the p-regular part

Statement

Let G be finite, k have characteristic p>0, and V be a finite-dimensional representation. Each gG has commuting factors g=su, with s of order prime to p and u of p-power order, and tr(gV)=tr(sV).

Facts & Assumptions

Proof

1.1

Write g=mpa with pm. Choose e,fZ with em+fpa=1, and set u=gem, s=gfpa. Their product is g and they commute; upa=sm=1. This also covers g=1 and a=0.

F2given
2.1

Put N=ρ(u)I. The commuting binomial identity in characteristic p, iterated a times, gives Npa=ρ(u)paI=0. Since ρ(s)N=Nρ(s), the map T=ρ(s)N satisfies Tpa=ρ(s)paNpa=0. Moreover ρ(g)ρ(s)=T.

F1step 1.1algebra
3.1

A nilpotent map T has trace zero over k itself. To see this, extend an independent list successively along 0=kerT0kerTkerTpa=V. At each stage, if the current list does not span that kernel, append a vector outside its span. The dimension bound forces this finite procedure to terminate. Since T(kerTj)kerTj1, its matrix in the resulting basis has zero diagonal. The trace is independent of basis: tr(AB)=i,jAijBji=tr(BA), so tr(P1TP)=tr(T).

F3F4step 2.1algebra
4.1

By additivity of the diagonal sum, tr(ρ(g))tr(ρ(s))=tr(T)=0. For V=0 both sums are empty and zero. No assertion that ρ(u)=I is needed.

step 2.1step 3.1algebra

Depends on

Used by

Dependency tree · two levels

38 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources