Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 N≥1, n≥1, V=QN, and W=V⊗n. Let B0 be the image of Q[Sn] acting by place permutations, and let A0 be the unital associative subalgebra of End⁡Q(W) generated by ρn(a)=∑r=1n1⊗(r−1)⊗a⊗1⊗(n−r),a∈MN(Q). Then A0=End⁡B0(W). Moreover, A0 is generated already by the operators ρn(Ei,i+1), ρn(Ei+1,i) (1≤i<N) and ρn(Ejj) (1≤j≤N), where Eab are the matrix units.

Facts & Assumptions

Given: N,n≥1, the finite-dimensional rational spaces V,W, and the actions just defined.

[F1]

The matrix units form a basis of End⁡Q(V), and the tensor products of these units form a basis of its n-fold tensor power; the canonical map End⁡(V)⊗n→End⁡(V⊗n) 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).

[F2]

Conjugation by a place permutation permutes the tensor factors of End⁡(V)⊗n, and distinct matrix-unit tensors form a basis, as in [F1].

[F3]

Operators supported on different tensor positions commute, and [Eab,Ecd]=δbcEad−δdaEcb for matrix units.

Proof

Given: The data in [F1]–[F3].

1.1givenF1F2algebra

Under [F1], identify End⁡Q(W) with MN(Q)⊗n. 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 End⁡B0(W) is spanned by the symmetrized tensors of n matrix units.

1.2givenF1F2algebra

For any a1,…,an∈MN(Q), multilinear expansion and inclusion–exclusion give ∑J⊆{1,…,n}(−1)n−∣J∣(∑j∈Jaj)⊗n=∑σ∈Snaσ(1)⊗⋯⊗aσ(n). Indeed, a term in the expansion indexed by a function f:{1,…,n}→{1,…,n} occurs with total coefficient ∑J⊇im⁡f(−1)n−∣J∣, which is 1 when im⁡f is all of {1,…,n} and 0 otherwise; surjective functions between these equal finite sets are permutations. Taking the aj 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 Q, so every orbit sum is a rational linear combination of pure powers a⊗n.

2.1givenF3step 1.2algebra

Fix a∈MN(Q) and put xr=1⊗(r−1)⊗a⊗1⊗(n−r). The xr commute by [F3], and pm=∑rxrm=ρn(am)∈A0. For E(t)=∏r=1n(1+xrt)=∑m=0nemtm, formal differentiation and E′(t)/E(t)=∑j≥1(−1)j−1pjtj−1 give, by comparing coefficients, mem=∑j=1m(−1)j−1em−jpj. This induction puts each em in A0 because m is invertible in Q. In particular, en=x1⋯xn=a⊗n belongs to A0. Step 1.2 now gives End⁡B0(W)⊆A0. Conversely each ρn(a) commutes with place permutations because conjugation merely permutes its summands, so A0⊆End⁡B0(W) and equality follows.

3.1step 2.1F3algebra∎

The map a↦ρn(a) is a Lie representation: expanding the commutator, terms in different positions cancel by [F3], leaving [ρn(a),ρn(b)]=ρn([a,b]). The adjacent matrix units and the diagonal units generate every matrix unit under brackets: for r<s, recursively Er,s=[Er,s−1,Es−1,s], and for r>s use Er,s=[Er,r−1,Er−1,s]; each bracket uses a shorter interval and starts with an adjacent unit, while the Ejj supply the diagonal basis. Their ρn images therefore generate all ρn(MN(Q)) as an associative algebra, hence generate A0.

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