Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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 images retain the surviving primitive idempotents

Statement

For AR=(kG)R and BR=kCG(R), the nonzero Brauer images of a primitive decomposition of 1 in AR form a primitive decomposition of 1 in BR. If QP and i is primitive in AP, then the nonzero images under BrQ of a primitive decomposition of i in AQ form a primitive decomposition of BrQ(i). More generally, for any surjective unital homomorphism of finite-dimensional algebras over a field, idempotents lift, and primitive idempotents have zero or primitive images, also in every corner.

Facts & Assumptions

Given: Finite-dimensional algebras over a field; the Brauer cases have characteristic p.

[F1]

Brauer maps have the fixed-algebra domains AR. (Brauer homomorphism for a p subgroup)

[F2]

Each Brauer map is a unital surjective algebra homomorphism. (Brauer homomorphism is multiplicative)

[F3]

Every idempotent admits a finite primitive decomposition. (Finite-dimensional algebras admit primitive idempotent decompositions)

[F4]

Coprime polynomials over a field admit a polynomial linear combination equal to one. (Bézout identity and the Euclidean algorithm for polynomials over a field)

Proof

technique · direct
1.1

Let ϕ:AB and y2=y in B. The cases y=0,1 lift by 0,1. Otherwise choose x above y. Linear dependence among 1,x,,xdimA gives m(x)=0 for a nonzero polynomial m. Since m(y)=m(0)(1y)+m(1)y=0 and both idempotents are nonzero, multiplication by them forces m(0)=m(1)=0. Write m(T)=g(T)(T1)s with s1 maximal, so g(1)0 and g(0)=0. Bézout supplies ug+v(T1)s=1. Set q=ug; then q(q1)=uvm, q(0)=0 and q(1)=1. Therefore q(x)2=q(x) and ϕ(q(x))=q(y)=y. Polynomial evaluation is valid even in noncommutative A because powers of one element commute.

F4
2.1

For an idempotent eA, the corner map eAeϕ(e)Bϕ(e) is onto: a target ϕ(e)bϕ(e) has preimage eae if ϕ(a)=b. Apply step 1.1 using identity e in this corner. If e is primitive and ϕ(e)0 were not, a nontrivial idempotent in its target corner would lift to ueAe with u0,e. Then e=u+(eu) would be an orthogonal nontrivial decomposition, impossible. Conversely a primitive target idempotent lifts by step 1.1, then decomposition by [F3] has exactly one nonzero image, which supplies a primitive lift.

F3step 1.1
3.1

Homomorphisms preserve sums and orthogonality. Apply step 2.1 to the surjection ARBR in [F2] and delete zero images in a decomposition of one. For the second clause decompose i in AQ, which contains AP. A summand ji is primitive in iAQi exactly when primitive in AQ, since j(iAQi)j=jAQj. The same image argument gives the primitive decomposition of BrQ(i); if all images vanish it is the empty decomposition. No primitivity of BrQ(i) itself is asserted when i is only primitive in AP.

F1F2F3step 2.1

Sources

AKO, Fusion Systems in Algebra and Topology, IV §1 Proposition 1.4 and IV §2 Lemma 2.8; arbitrary-field polynomial proof supplied here. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

8 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