Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Nagao error terms have zero trace on the relevant p-section

Statement

Assume the Axiom of Choice. Let (K,O,k) be a splitting p-modular system for a finite group G, with k algebraically closed. Let uG be a p-element and put H=CG(u). Let B be a block of kG, and let M be a finite-free OG-lattice satisfying B^M=M. Apply the Nagao decomposition with D=u: ResHGM=McorrMerr. If χ and χcorr are the ordinary characters of KOM and KOMcorr, then for every p-regular vH, χ(uv)=χcorr(uv). More precisely, the ordinary character of every indecomposable summand of Merr is zero at uv.

Facts & Assumptions

Given: AC and the system, element, centralizer, block, lattice, and characters in the Statement.

[F1]

The commuting p- and p-parts of a finite-order element are unique (Every finite-group element has unique commuting p- and p-prime parts), and their use here places uv in the p-section SG(u) (The p-section of a p-element).

[F2]

In the Nagao error part for D=u, no vertex of an indecomposable summand contains D (Nagao decomposition for restriction to a centralizer).

[F3]

Over the algebraically closed residue field, a relatively Q-projective lattice has zero character at an element whose p-part is not conjugate into Q (Relative projectivity forces character vanishing off the controlling p-section and An algebraically closed field: every nonconstant polynomial has a root in the field).

[F4]

AC is available (The Axiom of Choice) and is used only through the AC-stated suppliers F2–F3; trace additivity below is finite.

Proof

1.1

The subgroup D=u is central in H, and DCG(D)=CG(u)=HNG(D), so F2 applies. Decompose the finite-rank lattice Merr into indecomposable OH-lattices U1,,Ur. If u=1, then D=1 and F2 says no vertex of an error summand contains 1, which is impossible; thus r=0 and the result is immediate.

F2
1.2

Suppose u1. For each Ui, choose a vertex Qi. By F2, D≰Qi. Since u is central in H, every H-conjugate of u is u itself; hence u is not H-conjugate to an element of Qi. Because u and the p-regular element v commute, F1 says that the p-part of uv is exactly u. Each Ui is relatively Qi-projective by the definition of a vertex, so F3 gives tr(uvKOUi)=0.

F1F2F3F4
2.1

Scalar extension preserves the finite direct sum, and trace is additive. Step 1.2 proves the more precise assertion in the Statement. Therefore the character of Merr is zero at uv. Taking traces in M=McorrMerr gives the required equality. The case Merr=0 is the empty finite sum, already covered, and algebraic closedness is used exactly through F3.

step 1.1step 1.2algebra

Depends on

Used by

Dependency tree · two levels

21 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