Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Symmetric polynomial centers have primitive split content idempotents

Statement

Let A be a finite-dimensional unital algebra over a field F (Algebras over a commutative ring, central structure maps, and algebra homomorphisms), with commuting elements x1,…,xd and split joint regular-module generalized-eigenprojectors pword∈A: the pword are pairwise orthogonal, sum to 1, and (xr−wordr)pword is nilpotent for every r. For each finite multiset α of eigenvalues let eα:=∑word of multiset αpword, and assume each eα is central. If Z(A) is the image of the symmetric polynomial ring in x1,…,xd (Symmetric polynomials as the invariants of variable permutations, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution), then each eα is zero or primitive central, and its nonzero terms are exactly all primitive central idempotents of A (Blocks of a finite-dimensional algebra via primitive central idempotents). No splitting-simple-module hypothesis and no algebraic-closure hypothesis on F is required. For d=0 the asserted symmetric-center hypothesis says Z(A)=F⋅1 and yields the same conclusion.

Facts & Assumptions

Given: The finite commuting split-projector family, the central content idempotents, and the equality between Z(A) and the symmetric-polynomial image, as assumed in the Statement.

[F1]

By hypothesis the joint generalized-eigenprojectors are orthogonal, sum to 1, and commute with every xr; on each word summand the differences xr−wordr are commuting nilpotents. The sums eα are central by hypothesis.

[F2]

A symmetric polynomial is invariant under all permutations of the variables (Symmetric polynomials as the invariants of variable permutations). Its elementary-symmetric generation is proved in step 1.2.

[F3]

A nonzero central idempotent is primitive if it cannot be split as a sum of two nonzero orthogonal central idempotents (Blocks of a finite-dimensional algebra via primitive central idempotents). The nilpotent-ideal criterion is proved in step 2.1.

Proof

technique · direct

Given: The data of the Statement and [F1]–[F3]. If d=0 there is nothing

to prove beyond Z(A)=F⋅1, whose only idempotents are 0 and 1; assume

d≥1 and fix a content α with e:=eα≠0.

1.1F1algebra

The nilpotent ideal of the content summand. For 1≤k≤d let ak be the value of σk on any word of content α (independent of the order of the word). On the summand pwordA inside eA write xr=wordr+Nr with commuting nilpotents Nr by [F1]. Choose M with NrM=0 for all r; then every product of more than d(M−1) monomials of positive degree in the Nr vanishes, because among more than d(M−1) factors some Nr occurs at least M times (finite pigeonhole). Hence every polynomial in the Nr with zero constant term is nilpotent, and in particular Nk:=eσk(x)−ake is nilpotent on every pwordA; since there are finitely many words, a common exponent makes Nk nilpotent in eA. The Nk commute, and the ideal J they generate in the commutative ring eZ(A) is nilpotent by the same degree count.

1.2F2algebra

Elementary-symmetric generation without division. For a homogeneous symmetric polynomial, order its finitely many monomials lexicographically with x1>⋯>xd. Its leading exponent vector (b1,…,bd) has b1≥⋯≥bd: otherwise swapping an inverted pair produces a larger monomial with the same coefficient, contrary to maximality. The product σ1b1−b2σ2b2−b3⋯σdbd has leading monomial x1b1⋯xdbd with coefficient 1. Subtract its multiple by the leading coefficient. The remaining polynomial is symmetric and has a smaller leading monomial of the same total degree; the finite set of degree-m monomials makes repetition terminate. Apply this to each homogeneous component. Every symmetric polynomial is therefore a polynomial in the σk, over any field and without division by factorials.

2.1F2F3step 1.1step 1.2algebra

The center of the content summand is a local ring. By step 1.2 every symmetric polynomial is a polynomial in σ1,…,σd, so the symmetric-center hypothesis gives eZ(A)=Fe+J. Since e≠0 and J is nilpotent, Fe∩J=0: if ce∈J with c≠0, nilpotence would give 0=(ce)M=cMe, contradicting e≠0. Therefore eZ(A)/J≅F, a field, and an idempotent b has residue 0 or 1 in this field. In the first case b∈J is nilpotent, and b=bM=0; in the second case the same argument applied to the idempotent e−b∈J gives b=e. Thus every idempotent of eZ(A) is 0 or e.

3.1F1step 2.1∎

The nonzero content idempotents are exactly the primitive central idempotents. Step 2.1 shows that each eα≠0 is a primitive idempotent of Z(A), hence primitive central in A. Conversely, let b be a primitive central idempotent of A. The eα are central, pairwise orthogonal and sum to 1, so b=∑αbeα; if two terms beα were nonzero, they would be orthogonal nonzero idempotents summing to the primitive idempotent b, a contradiction, so exactly one term equals b. This nonzero beα is an idempotent of eαZ(A), hence equals eα by step 2.1, proving b=eα. Hence the nonzero eα are precisely the primitive central idempotents, and the blocks of A are exactly the nonzero content summands. No algebraic closure, splitting-simple-module theorem, power-sum generation, division by d!, or level-one restriction is used.

Remarks

The proof is the local center argument: the content idempotents make the center of each summand a local ring with nilpotent nilradical, so its idempotents can only be 0 and the unit. Everything is finite and choice-free.

Depends on

Used by

Dependency tree · two levels

11 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