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 , , , and write for . For local pairs with , normal descent defines a unique lower pair at , independently of the chosen normal subgroup chain. The following six conditions are equivalent:
- is this well-defined inclusion.
- There are primitive , with , , and .
- A finite chain of normal pair inclusions joins to .
- Every primitive with satisfies .
- Some such satisfies .
- Some such satisfies .
This inclusion is a conjugation-stable partial order. For normal , it agrees with direct normal inclusion.
Facts & Assumptions
Given: Finite , a field of characteristic , and local pairs and fixed algebras as stated.
Normal subgroups admit unique normal subpairs. (Unique normal subpair below a Brauer pair)
Relative truncations compose on their stated fixed domains. (Relative Brauer homomorphisms are transitive)
Finite primitive decompositions exist for all idempotents in fixed algebras. (Finite-dimensional algebras admit primitive idempotent decompositions)
Surjections between finite algebras preserve nonzero primitive images, including corners. (Brauer images retain the surviving primitive idempotents)
Nontrivial -group orbits have size divisible by . (If a finite -group acts on a finite set , then )
Proper-subgroup traces lie in the Brauer kernel. (Brauer kernel and relative trace support)
Conjugation commutes with Brauer maps. (Brauer homomorphism is conjugation equivariant)
The relative map from exists when is normal in . (Relative Brauer homomorphism)
Proof
Call a primitive associated to if . Such an exists: decompose in and multiply its images by ; their sum is . By [F4], is primitive when nonzero, and its decomposition forces . The same primitive-central argument holds in any algebra. If , nonzero implies nonzero 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.
For primitive , every element of the corner is nilpotent or a unit. Indeed for large , stabilized kernels and images of left multiplication give : an element in the intersection implies . These summands are right -modules. Their projections are left multiplication by idempotents in , hence primitivity forces one summand zero. If is bijective, solve and apply injectivity to to get . Every element of a proper two-sided ideal of must consequently be nilpotent.
For and , coefficient counting gives . To see this, let act on the cosets in the trace. At a basis element centralizing , coefficients from one orbit agree. Non-singleton orbits vanish in characteristic ; fixed cosets are exactly , giving the displayed equality by equivariance. Also for , directly by moving fixed factors through the sum.
Define an auxiliary relation by requiring for every associated primitive at the top. At most one can satisfy it by step 1.1 and orthogonality. A compatibility fact follows without assuming transitivity: if , and , then . Choose a top-associated and decompose it into primitive in . Some has because their sum is . Thus . Since , multiplication shows , while . Orthogonality forces .
If , choose the normal lower block from [F1]. The restriction is onto, since each element of already belongs to and is fixed by truncation. Hence [F4] makes the nonzero primitive in this fixed target algebra. The -stable block is central there, and by [F2] and normal compatibility with . Thus by primitivity. This proves for normal inclusions. Uniqueness from step 2.1 gives the converse normal characterization whenever the strong lower block exists. For the same primitive argument gives reflexivity.
We establish existence of a unique strong lower block by induction on . The equality case and all normal cases are settled in step 3.1. For a proper nonnormal , let . The action of on has exactly fixed cosets. Since is divisible by , [F5] implies , so . Assume existence for all smaller indices. For every take its unique strong lower block under , with .
For , induction supplies a strong lower block at under , since . Compatibility from step 2.1 identifies it with . Descend normally from to . If , induction at supplies a lower block under ; compatibility applied with top identifies it with . Therefore is -stable and for every such , by the normal characterization.
For any top-associated primitive , put . It is an -fixed idempotent of . For , we have by step 4.1 and by step 5.1. Multiplicativity and [F2] therefore give .
The simultaneous kernel just obtained inside equals . Indeed an -fixed vector has constant coefficients on each -orbit of the basis . If a representative has stabilizer , truncation for detects its coefficient at , and disjoint basis orbits cannot cancel it. Orbits with stabilizer exactly have no fixed basis elements for any , so all those truncations kill them. Their sums are exactly the nonzero traces of basis elements from to ; a larger stabilizer gives multiplicity in . This proves both inclusions. By step 1.3 and surjectivity of , the same space is .
Since , step 1.3 puts in , where is a two-sided ideal of . It is proper: [F6] kills it under , while . Step 1.2 makes every element of nilpotent, and multiplicativity makes every element of its image nilpotent. Thus the idempotent is zero. This holds for every associated , proving . Together with uniqueness and the normal base cases it completes the induction.
Existence and compatibility now give transitivity: for take the unique strong lower block at under the top; step 2.1 forces . 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.
Every normal chain is strong by steps 3.1 and 9.1. Conversely any proper subgroup of a finite -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 to . At each subgroup take its unique strong lower block under . Compatibility makes consecutive pairs strongly related, and step 3.1 makes them normally related. The bottom block is exactly when . Thus normal descent is independent of the chain and the candidate relation equals the strong partial order. This establishes (i) exactly when (iii).
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 be the unique strong lower block at . Its equation gives for the witnessing . Nonzero then implies , so by orthogonality and (i) follows. To obtain (ii) from (vi), decompose its into primitive in ; at least one has , and . Conversely (ii) implies (vi), since multiplying by gives its nonzero product . All six conditions are therefore equivalent.
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
- Unique normal subpair below a Brauer pair
- Relative Brauer homomorphisms are transitive
- Finite-dimensional algebras admit primitive idempotent decompositions
- Brauer images retain the surviving primitive idempotents
- If a finite $p$-group $P$ acts on a finite set $X$, then $|X|\equiv|X^P|\pmod p$
- Brauer kernel and relative trace support
- Brauer homomorphism is conjugation equivariant
- Relative Brauer homomorphism
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.