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

Brauer's First Main Theorem

Statement

Let D be a fixed p-subgroup of finite G, let N=NG(D), and use a splitting p-modular residue field k. Block induction is a bijection {b a block of kN:D is a defect group of b}{B a block of kG:D is a defect group of B},bbG. The sets may be empty. The bijection commutes with G-conjugation of D and requires no AC.

Facts & Assumptions

Given: The stated finite group, field and actual subgroup D.

[F1]

A global block of defect D determines a local block of defect D gives a local defect-D inducing block for every global defect-D block.

[F3]

Every local full-defect block induces to a global block of defect D gives definedness for every local input and preserves the exact defect group.

Proof

1.1

F3 makes the displayed assignment a function with the stated codomain. F2 makes it injective, and F1 makes it onto. These are precisely the two bijection conditions, including if either set is empty: F1 and F3 then force the other to be empty as well.

F1F2F3algebra
2.1

For gG, conjugation carries NG(D) to NG(gDg1), sends a block ideal to the conjugate ideal, and transports the double-group action and every split inclusion/retraction by the algebra isomorphism xgxg1. A diagonal vertex ΔD is carried to Δ(gDg1), since relative induction splittings and subgroup minimality are transported in both directions. Thus conjugating the summand condition defining bG gives (gb)G=g(bG) by uniqueness. If N=G, restriction to the same double group is identity and each block is its own unique inducing block, so the bijection is identity. In particular D=1 gives the identity on defect-zero blocks. This proves equivariance and all boundaries; no preferred representative of a conjugacy class is chosen. F1–F3 are choice-free and the present maps are explicit, so no AC is required.

F1F2F3step 1.1algebra

Depends on

Used by

Dependency tree · two levels

13 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