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.
Classical tensor centralizer from polarization and Newton identities
Statement
Let , , , and . Let be the image of acting by place permutations, and let be the unital associative subalgebra of generated by Then . Moreover, is generated already by the operators , () and (), where are the matrix units.
Facts & Assumptions
Given: , the finite-dimensional rational spaces , and the actions just defined.
The matrix units form a basis of , and the tensor products of these units form a basis of its -fold tensor power; the canonical map is the isomorphism obtained by its action on elementary tensors (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums, The elementary tensors of two bases form the product basis of the tensor product).
Conjugation by a place permutation permutes the tensor factors of , and distinct matrix-unit tensors form a basis, as in [F1].
Operators supported on different tensor positions commute, and for matrix units.
Proof
Given: The data in [F1]–[F3].
Under [F1], identify with . An endomorphism commutes with every place permutation exactly when it is fixed by conjugation by each such permutation. By [F2], this action permutes the tensor-unit basis, so its invariant subspace has as a basis the orbit sums of that basis: invariance says precisely that coefficients are constant on each finite orbit. Thus is spanned by the symmetrized tensors of matrix units.
For any , multilinear expansion and inclusion–exclusion give . Indeed, a term in the expansion indexed by a function occurs with total coefficient , which is when is all of and otherwise; surjective functions between these equal finite sets are permutations. Taking the to be the matrix units in any multiset orbit makes the right side the orbit sum multiplied by the product of the factorials of its multiplicities. That integer is nonzero and invertible in , so every orbit sum is a rational linear combination of pure powers .
Fix and put . The commute by [F3], and . For , formal differentiation and give, by comparing coefficients, . This induction puts each in because is invertible in . In particular, belongs to . Step 1.2 now gives . Conversely each commutes with place permutations because conjugation merely permutes its summands, so and equality follows.
The map is a Lie representation: expanding the commutator, terms in different positions cancel by [F3], leaving . The adjacent matrix units and the diagonal units generate every matrix unit under brackets: for , recursively , and for use ; each bracket uses a shorter interval and starts with an adjacent unit, while the supply the diagonal basis. Their images therefore generate all as an associative algebra, hence generate .
Depends on
Used by
Dependency tree · two levels
17 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
- Pavel Etingof et al., Introduction to representation theory (standard reference, not scraped)