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 and , the nonzero Brauer images of a primitive decomposition of in form a primitive decomposition of in . If and is primitive in , then the nonzero images under of a primitive decomposition of in form a primitive decomposition of . 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 .
Brauer maps have the fixed-algebra domains . (Brauer homomorphism for a p subgroup)
Each Brauer map is a unital surjective algebra homomorphism. (Brauer homomorphism is multiplicative)
Every idempotent admits a finite primitive decomposition. (Finite-dimensional algebras admit primitive idempotent decompositions)
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
Let and in . The cases lift by . Otherwise choose above . Linear dependence among gives for a nonzero polynomial . Since and both idempotents are nonzero, multiplication by them forces . Write with maximal, so and . Bézout supplies . Set ; then , and . Therefore and . Polynomial evaluation is valid even in noncommutative because powers of one element commute.
For an idempotent , the corner map is onto: a target has preimage if . Apply step 1.1 using identity in this corner. If is primitive and were not, a nontrivial idempotent in its target corner would lift to with . Then 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.
Homomorphisms preserve sums and orthogonality. Apply step 2.1 to the surjection in [F2] and delete zero images in a decomposition of one. For the second clause decompose in , which contains . A summand is primitive in exactly when primitive in , since . The same image argument gives the primitive decomposition of ; if all images vanish it is the empty decomposition. No primitivity of itself is asserted when is only primitive in .
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
- AKO, Fusion Systems in Algebra and Topology, IV §1 Proposition 1.4 and IV §2 Lemma 2.8; arbitrary-field polynomial proof supplied here (standard reference, not scraped)