Alphabeta Math
LemmaStatement: 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.

A global block of defect D determines a local block of defect D

Statement

Fix a p-subgroup DG and N=NG(D). If the block B=kGf has D as a defect group, there is a unique block b=kNe of kN among the blocks having defect group D that induces to B. Its idempotent is e=BrD(f). This argument is choice-free.

Facts & Assumptions

Given: A splitting residue field k and the stated global block of defect D.

[F1]

Normal p-subgroups fix central idempotents under Brauer projection by Normal p-subgroups fix block idempotents under Brauer projection.

[F2]

Maximal Brauer pairs exist and are conjugate gives a maximal pair and writes the Brauer image as the sum of its distinct normalizer conjugates.

[F3]

Maximal Brauer pairs detect defect groups identifies its subgroup as a defect group.

[F4]

Defect groups are maximal Brauer support gives maximality of nonzero support and containment in conjugate defect groups.

[F5]

Centralizer containment makes block induction well-defined defines every block induction here and identifies its character by the Brauer projection.

[F6]

Modular block central characters correspond to blocks identifies blocks by their central characters.

[F7]

Brauer homomorphism for a p subgroup gives coefficient projection and its identity on centralizing coefficients.

Proof

1.1

Take a maximal B-pair (P,a) from F2. By F3 its subgroup P is a defect group. Apply F4 to P and D in both directions: their orders agree, and P is conjugate to D. Conjugate the pair to have subgroup literally D. Then F2 gives e=BrD(f) as the sum of one N-orbit of primitive central idempotents of kCG(D). It is nonzero, idempotent and N-invariant, hence central in kN.

F2F3F4algebra
2.1

Suppose u is a central idempotent of kN beneath e. Since DN, F1 gives u=BrD(u)kCG(D). It is central in that algebra, since CG(D)N. Thus u is a sum of a subset of the primitive idempotents in step 1.1. Centrality in kN makes this subset N-stable, and one transitive orbit has only the empty and whole stable subsets. Hence u=0 or u=e. So e is primitive in Z(kN) and defines a block b. Moreover BrD(e)=e0. If S>D were a p-subgroup of N with BrS(e)0, F7 and CG(S)CG(D) would give BrS(f)=BrS(e)0, contradicting F4 for f. Therefore F4, now in N, proves D is a defect group of b.

F1F4F7step 1.1algebra
3.1

Since CG(D)N, F5 defines bG and gives λbG(f)=λb(e)=1. F6 therefore identifies bG=B. Conversely, if a block c of kN with defect group D induces to B, F5 gives 1=λB(f)=λc(e). Since e is primitive by step 2.1, F6 forces c=b. This proves uniqueness in the stated defect-D domain as well as the promised existence. For D=1, N=G and the construction gives e=f; the same holds whenever N=G by F1. All chosen pairs, subgroups and idempotent subsets lie in finite sets; no AC or stronger restriction-summand theorem was used.

F1F5F6step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

28 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