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.

Brauer pair order is independent of the normal chain

Statement

Put AR=(kG)R, BR=kCG(R), bR=BrR, and write ji for ij=j=ji. For local pairs (Q,f),(P,e) with QP, normal descent defines a unique lower pair at Q, independently of the chosen normal subgroup chain. The following six conditions are equivalent:

  1. (Q,f)(P,e) is this well-defined inclusion.
  2. There are primitive iAP, jAQ with ji, bP(i)e0, and bQ(j)f0.
  3. A finite chain of normal pair inclusions joins (Q,f) to (P,e).
  4. Every primitive iAP with bP(i)e0 satisfies bQ(i)f0.
  5. Some such i satisfies bQ(i)f=bQ(i)0.
  6. Some such i satisfies bQ(i)f0.

This inclusion is a conjugation-stable partial order. For normal QP, it agrees with direct normal inclusion.

Facts & Assumptions

Given: Finite G, a field of characteristic p, and local pairs and fixed algebras as stated.

[F1]

Normal subgroups admit unique normal subpairs. (Unique normal subpair below a Brauer pair)

[F2]

Relative truncations compose on their stated fixed domains. (Relative Brauer homomorphisms are transitive)

[F3]

Finite primitive decompositions exist for all idempotents in fixed algebras. (Finite-dimensional algebras admit primitive idempotent decompositions)

[F4]

Surjections between finite algebras preserve nonzero primitive images, including corners. (Brauer images retain the surviving primitive idempotents)

[F6]

Proper-subgroup traces lie in the Brauer kernel. (Brauer kernel and relative trace support)

[F7]

Conjugation commutes with Brauer maps. (Brauer homomorphism is conjugation equivariant)

[F8]

The relative map from BQP exists when Q is normal in P. (Relative Brauer homomorphism)

Proof

technique · direct
1.1

Call a primitive iAP associated to (P,e) if bP(i)e0. Such an i exists: decompose 1 in AP and multiply its images by e; their sum is e0. By [F4], bP(i) is primitive when nonzero, and its decomposition bP(i)e+bP(i)(1e) forces bP(i)e=bP(i). The same primitive-central argument holds in any algebra. If QP, nonzero bP(i) implies nonzero bQ(i) because the former retains a subset of the latter coefficients. Distinct blocks are orthogonal, since their product, if nonzero, is a central idempotent below each and must equal each.

F3F4
1.2

For primitive iAP, every element c of the corner C=iAPi is nilpotent or a unit. Indeed for large n, stabilized kernels and images of left multiplication give C=kerLcnimLcn: an element cnx in the intersection implies xkerLc2n=kerLcn. These summands are right C-modules. Their projections are left multiplication by idempotents in C, hence primitivity forces one summand zero. If Lc is bijective, solve cx=i and apply injectivity to c(xci)=0 to get xc=i. Every element of a proper two-sided ideal of C must consequently be nilpotent.

given
1.3

For N=NP(Q) and aAQ, coefficient counting gives bQ(TrQPa)=TrQN(bQ(a)). To see this, let Q act on the cosets P/Q in the trace. At a basis element centralizing Q, coefficients from one orbit agree. Non-singleton orbits vanish in characteristic p; fixed cosets are exactly N/Q, giving the displayed equality by equivariance. Also xTrQP(a)y=TrQP(xay) for x,yAP, directly by moving fixed factors through the sum.

F5F7
2.1

Define an auxiliary relation (Q,f)(P,e) by requiring bQ(i)f=bQ(i)0 for every associated primitive i at the top. At most one f can satisfy it by step 1.1 and orthogonality. A compatibility fact follows without assuming transitivity: if (Q,f)(P,e), (S,d)(P,e) and (S,d)(Q,f), then d=d. Choose a top-associated i and decompose it into primitive j in AQ. Some j has bQ(j)f0 because their sum is bQ(i)0. Thus bS(j)d=bS(j)0. Since ji, multiplication shows bS(i)d0, while bS(i)d=bS(i). Orthogonality forces d=d.

F3F4step 1.1
3.1

If QP, choose the normal lower block f from [F1]. The restriction bQ:APBQP is onto, since each element of BQP already belongs to AP and is fixed by truncation. Hence [F4] makes the nonzero bQ(i) primitive in this fixed target algebra. The P-stable block f is central there, and BrP/Q(bQ(i)f)=bP(i)BrP/Q(f)=bP(i)0 by [F2] and normal compatibility with e. Thus bQ(i)f=bQ(i) by primitivity. This proves for normal inclusions. Uniqueness from step 2.1 gives the converse normal characterization whenever the strong lower block exists. For Q=P the same primitive argument gives reflexivity.

F1F2F4F8step 1.1step 2.1
4.1

We establish existence of a unique strong lower block by induction on [P:Q]. The equality case and all normal cases are settled in step 3.1. For a proper nonnormal Q, let N=NP(Q). The action of Q on P/Q has exactly [N:Q] fixed cosets. Since [P:Q] is divisible by p, [F5] implies p[N:Q], so Q<N<P. Assume existence for all smaller indices. For every Q<RP take its unique strong lower block eR under (P,e), with eP=e.

F5step 3.1ih
5.1

For Q<RTP, induction supplies a strong lower block at R under (T,eT), since [T:R]<[P:Q]. Compatibility from step 2.1 identifies it with eR. Descend normally from (N,eN) to (Q,f). If Q<RN, induction at [R:Q] supplies a lower block under (R,eR); compatibility applied with top (N,eN) identifies it with f. Therefore f is N-stable and BrR/Q(f)eR=eR for every such R, by the normal characterization.

F1F8step 2.1step 3.1step 4.1
6.1

For any top-associated primitive i, put z=bQ(i)(1f). It is an N-fixed idempotent of BQ. For Q<RN, we have bR(i)eR=bR(i) by step 4.1 and BrR/Q(f)eR=eR by step 5.1. Multiplicativity and [F2] therefore give BrR/Q(z)=bR(i)(1BrR/Q(f))=0.

F2F7F8step 4.1step 5.1
7.1

The simultaneous kernel just obtained inside BQN equals TrQN(BQ). Indeed an N-fixed vector has constant coefficients on each N-orbit of the basis CG(Q). If a representative x has stabilizer S>Q, truncation for S/Q detects its coefficient at x, and disjoint basis orbits cannot cancel it. Orbits with stabilizer exactly Q have no fixed basis elements for any R>Q, so all those truncations kill them. Their sums are exactly the nonzero traces of basis elements from Q to N; a larger stabilizer gives multiplicity [S:Q]=0 in k. This proves both inclusions. By step 1.3 and surjectivity of bQ:AQBQ, the same space is bQ(TrQP(AQ)).

F4F5F8step 1.3step 6.1
8.1

Since z=bQ(i)zbQ(i), step 1.3 puts z in bQ(J), where J=TrQP(iAQi) is a two-sided ideal of C=iAPi. It is proper: [F6] kills it under bP, while bP(i)0. Step 1.2 makes every element of J nilpotent, and multiplicativity makes every element of its image nilpotent. Thus the idempotent z is zero. This holds for every associated i, proving (Q,f)(P,e). Together with uniqueness and the normal base cases it completes the induction.

F4F6step 1.2step 1.3step 2.1step 3.1step 7.1discharge-induction
9.1

Existence and compatibility now give transitivity: for (S,d)(Q,f)(P,e) take the unique strong lower block d at S under the top; step 2.1 forces d=d. Reflexivity was proved in step 3.1. If two pairs are comparable both ways, their subgroups coincide and uniqueness forces equal blocks, proving antisymmetry. Conjugation is an algebra isomorphism on all fixed algebras, carries primitive decompositions to primitive decompositions, and preserves the association equations by [F7], proving conjugation stability.

F7step 2.1step 3.1step 8.1
10.1

Every normal chain is strong by steps 3.1 and 9.1. Conversely any proper subgroup of a finite p-group is properly contained in its normalizer by the fixed-coset calculation in step 4.1. Repeated normalizers therefore give a finite normal subgroup chain from Q to P. At each subgroup take its unique strong lower block under (P,e). Compatibility makes consecutive pairs strongly related, and step 3.1 makes them normally related. The bottom block is f exactly when (Q,f)(P,e). Thus normal descent is independent of the chain and the candidate relation equals the strong partial order. This establishes (i) exactly when (iii).

F1step 2.1step 3.1step 4.1step 8.1step 9.1
11.1

Strong association implies (iv) and (v), with existence of a witnessing primitive from step 1.1. Each implies (vi). Conversely let (vi) hold and let f be the unique strong lower block at Q. Its equation gives bQ(i)f=bQ(i) for the witnessing i. Nonzero bQ(i)f then implies ff0, so f=f by orthogonality and (i) follows. To obtain (ii) from (vi), decompose its i into primitive j in AQ; at least one has bQ(j)f0, and ji. Conversely (ii) implies (vi), since multiplying bQ(i)f by bQ(j) gives its nonzero product bQ(j)f. All six conditions are therefore equivalent.

F3F4step 1.1step 8.1step 10.1

Sources

AKO, Fusion Systems in Algebra and Topology, IV §2 Theorem 2.10, Lemmas 2.11–2.12 and Proposition 2.14, printed pp.180–183; six-clause formulation retained from BKY Theorem 2.2. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

21 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