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.

Local block projection controls p-section character support

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 B be a block of kG, let χIrrK(G,B), let u be a p-element, and put H=CG(u). For a block c of kH, let Vc=c^ResHGVχ and write χc for its ordinary character, where Vχ is a simple KG-module affording χ. If cGB, then χc(uv)=0 for every p-regular vH.

Facts & Assumptions

Given: AC and the modular system, blocks, character, element, and local component in the Statement.

[F1]

Integral block lifts exist uniquely (Block idempotents lift uniquely from kH to OH), and ordinary irreducibles belong to unique blocks (Blocks partition the ordinary and Brauer irreducible characters).

[F2]

The subsection convention makes every cG defined (Brauer subsections and B-subsections). Nagao supplies M=McorrMerr, every indecomposable summand of Mcorr belonging to a block d with dG=B, and every indecomposable summand of Merr having no vertex containing u (Nagao decomposition for restriction to a centralizer).

[F3]

Every indecomposable Nagao error summand has zero trace at uv (Nagao error terms have zero trace on the relevant p-section), under the algebraically closed residue-field hypothesis (An algebraically closed field: every nonconstant polynomial has a root in the field).

[F4]

AC is available (The Axiom of Choice) and is used through the AC-stated suppliers F2–F3. The lattice construction and projection below are finite.

Proof

1.1

Choose a K-basis w1,,wn of Vχ and set M=gG,1inOgwi. This is a finitely generated, G-stable, torsion-free O-module spanning Vχ over K, hence is finite free because O is a DVR. Thus M is an OG-lattice affording χ. Since χ belongs to B, F1 says that B^ acts as the identity on Vχ, and therefore B^M=M.

F1construct
1.2

Apply Nagao with D=u and H=CG(u). Its hypotheses hold because D is central in H and DCG(D)=HNG(D). Suppose cGB. Each indecomposable summand of Mcorr belongs by F2 to a block d with dG=B. Thus dc, so orthogonality of the lifted block idempotents from F1 gives c^Mcorr=0. Consequently [F1, F2] Mc=c^M=c^Merr, which is a direct summand of Merr. Decompose Mc into finitely many indecomposable OH-lattices. Each is therefore an indecomposable summand of Merr, so F3 makes its character zero at uv.

F3F4
2.1

Scalar extension commutes with the idempotent projection: KOMcc^(KOM)=Vc. Adding the finitely many zero traces from step 1.2 proves χc(uv)=0. This also shows that the character component is independent of the chosen stable lattice. If Mc=0 the character is zero identically; if u=1, Nagao has no error part, so the antecedent cGB forces this zero case. Algebraic closedness and AC are used exactly through F3 and the AC-stated block contracts.

F1F3step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

25 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