Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Maximal Brauer pairs exist and are conjugate

Statement

For a block b of kG, maximal b-Brauer pairs exist and form one G-conjugacy class. If (P,e) is maximal, P is a defect group and BrP(b) is the sum of the distinct NG(P)-conjugates of e.

Facts & Assumptions

Given: A finite group G, a field of characteristic p, and a nonzero primitive central block b.

[F1]

Membership equals descent from (1,b); comparable and conjugate pairs have the same block. (Every Brauer pair determines a unique global block)

[F2]

Maximal nonzero Brauer-support subgroups are defect groups, and these are conjugate. (Defect groups are maximal Brauer support)

[F3]

Non-singleton orbits vanish under a normal relative Brauer map. (Brauer maps kill nontrivial idempotent orbit sums)

[F4]

Idempotents lift through finite commutative quotients. (Idempotents lift through finite commutative algebra quotients)

[F5]

Brauer projection is a unital algebra map. (Brauer homomorphism is multiplicative)

[F6]

Brauer projection on invariant elements retains precisely the centralizing basis coefficients. (Brauer homomorphism for a p subgroup)

[F8]

Pair inclusion is a partial order, and for a normal subgroup it is exactly the stability and relative Brauer-product criterion. (Brauer pair order is independent of the normal chain)

Proof

technique · direct
1.1

There are finitely many p-subgroups and finitely many central primitive idempotents in each centralizer algebra. The set of b-pairs is nonempty because it contains (1,b), and therefore it has a maximal pair (P,e). Let z be the sum of the distinct NG(P)-conjugates of e. They are orthogonal block idempotents of kCG(P), so z2=z, and z is NG(P)-fixed. Every such conjugate pair belongs to b by [F1], so BrP(b)z=z. The pair relation is a partial order by [F8].

F1F5F8
1.2

We use the elementary normalizer condition for a finite p-group T: if P<T, then P<NT(P). Indeed let P act on T/P by left multiplication. Nonfixed orbits have size divisible by p by orbit-stabilizer. The number of fixed cosets is therefore congruent to [T:P]=0 modulo p. It is positive since P is fixed, and fixed cosets are exactly NT(P)/P. Hence that quotient has at least p elements.

given
2.1

If PR for a strictly larger p-subgroup R, partition these summands into R-orbits. Non-singletons have zero relative image by [F3]. For an R-fixed summand f, a nonzero relative image is a central idempotent and hence contains a block d of kCG(R). Centrality follows because f commutes with that algebra; multiplicativity gives idempotence. The stable block and this product satisfy the normal criterion [F8], so (P,f)(R,d), and [F1] makes this a larger b-pair. Conjugating back by a normalizer element contradicts maximality of (P,e). Thus BrR/P(z)=0 for every such R.

F1F3F5F8step 1.1
3.1

If xCG(P) has nonzero coefficient in z, take a Sylow subgroup T of CG(x) containing P, using [F7]. If T>P, put R=NT(P)>P by step 1.2. Then PR, and xCG(R), so its nonzero coefficient survives BrR/P(z), contradicting step 2.1. Thus P is Sylow in CG(x) for every support element x.

F6F7step 2.1step 1.2
4.1

Suppose x is in this support and y=gxg1CG(P). The groups gPg1 and P are Sylow in CG(y): the former by step 3.1 and conjugation, the latter by equality of centralizer orders. Choose cCG(y) with cgPg1c1=P by [F7]. Then cgNG(P) and (cg)x(cg)1=y. Normalizer invariance of z gives equal coefficients at x,y. Consequently each G-conjugacy class meeting the support has constant coefficient on its whole intersection with CG(P); classes not meeting the support have coefficient zero throughout. Summing these coefficients times full G-class sums constructs aZ(kG) with BrP(a)=z.

F6F7step 1.1step 3.1
5.1

The restriction of BrP to Z(kG) identifies its image with a finite commutative quotient by its kernel, by [F5]. Lift its idempotent z to a central idempotent c by [F4]. Then bc is a central idempotent beneath primitive b, hence is 0 or b. Its image is BrP(b)z=z0, so bc=b. Also BrP(bc)=BrP(b) and equals z, proving BrP(b)=z.

F4F5step 1.1step 4.1
6.1

If S>P had BrS(b)0, let R=NS(P)>P. Coefficient projection gives BrR(b)=BrR/P(BrP(b))=0 by steps 2.1 and 5.1. Since CG(S)CG(R), projecting further would give BrS(b)=0, a contradiction. Thus P is maximal nonzero support, hence a defect group by [F2].

F2F6step 2.1step 1.2step 5.1
7.1

For any other maximal pair (Q,f), step 6.1 makes Q a defect group. By [F2] conjugate it so that Q=P. Membership says BrP(b)f=f. Step 5.1 writes this image as exactly the sum of the distinct normalizer conjugates of e. Orthogonality of central blocks forces f to be one of these conjugates. This proves the single G-conjugacy class, as well as the asserted image formula.

F1F2step 5.1step 6.1

Sources

Jacobsen, Block fusion systems and the center of the group ring, Lemma 2.32 and Theorem 2.33, pp.18–19; general-field lifting proved locally. Local argument and conventions as displayed above.

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