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

Defect groups are maximal Brauer support

Statement

A p-subgroup D is a defect group of b if and only if Br⁡D(b)≠0 and D is maximal among p-subgroups with nonzero Brauer image. Every subgroup with nonzero image is contained in a conjugate of any defect group.

Facts & Assumptions

Given: A block idempotent b and p-subgroups of G.

[F1]

Defect groups are minimal p-subgroups giving b=Tr⁡DG(a). (Block relative trace characterizes diagonal projectivity)

[F2]

The Brauer kernel is the proper trace sum, and nonzero trace support forces subgroup containment up to conjugacy. (Brauer kernel and relative trace support)

[F3]

A finite trace-ideal sum containing the block identity has one ideal containing it. (Block centre locality and trace ideal sums)

[F4]

Defect groups and their conjugates are exactly one conjugacy class. (Defect groups of a block are conjugate)

Proof

technique · direct
1.1F1F2F3

Choose a defect group D and a∈BD with b=Tr⁡DG(a). If Br⁡D(b)=0, [F2] writes b=∑Q<DTr⁡QD(uQ). Multiplying by b if necessary puts uQ in BQ. Since b is central and a is D-fixed, trace transitivity gives b=b2=Tr⁡DG(ab)=∑Q<DTr⁡QG(auQ). Each term lies in its trace ideal of Z(B). By [F3], b belongs to one proper-Q trace ideal, contradicting minimality of D. Thus its image is nonzero.

2.1F2F4step 1.1∎

For any P with Br⁡P(b)≠0, the same trace expression for b and [F2] imply P≤gDg−1 for some g. A subgroup containing D with nonzero image therefore has order at most ∣D∣, proving maximality of D. Conversely a maximal P with nonzero image lies in gDg−1, whose image is nonzero since it too is a defect group by [F4] and step 1.1. Maximality gives equality, and [F4] makes P a defect group.

Sources

Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

14 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