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 Power Irreducible
Statement
For every positive integer and integer , the natural unitary action of on is irreducible.
Facts & Assumptions
Given: , , and the natural action on the permutation-invariant subspace.
is the group of unitary matrices (Unitary Group Compact).
is the range of the permutation-average projector; its vectors are exactly those fixed by every tensor-factor permutation (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector).
Tensor products of finitely many linear maps defines as the factorwise tensor map. The ordered register and permutation convention Ordered tensor registers, their inner product, and wire permutations shows on elementary tensors that this map commutes with each factor permutation. The tensor-map adjoint and composition identities Tensor maps preserve composition, identities, and adjoints make a unitary representation when is unitary. The QC02 interfaces are present as draft carriers.
Proof
If , the tensor unit is one-dimensional and the action is trivial, so the representation is irreducible. Suppose . Let be the standard orthonormal basis of . For each multi-index with , let be the set of words of length in which occurs times, and set . The sets partition the elementary tensor basis, so the are orthonormal. A vector fixed by all permutations has equal coefficients on each permutation orbit ; hence these vectors span exactly the symmetric subspace in [F2].
Put and . Each is an eigenvector of with eigenvalue . These eigenvalues are distinct: for , let be the first index with . Then , while ; thus the phase difference is nonzero. Also , so the phase difference is not a nonzero multiple of .
Let be a subspace invariant under every , and choose . At least one coefficient is nonzero. Because the eigenvalues in step 1.2 are distinct, the interpolation polynomial satisfies . Invariance under and linearity imply . If , step 1.1 has only the single multi-index , so this already gives . Hence assume in the transfer argument below.
Fix indices with , let be sufficiently small, and set and , so . The unitary rotation sending , and fixing all other sends into the symmetric subspace by [L1]. The coefficient of for is the positive factor times This follows by counting which output -positions came from and which output -positions came from in the tensor expansion. Since and is a polynomial, choose small enough that . The rotated vector lies in by invariance; applying the interpolation projection from step 2.1 for weight isolates a nonzero multiple of , so .
Repeating step 3.1 transfers one unit from any coordinate with to one with . Any two nonnegative multi-indices of total are connected by finitely many such transfers. Thus contains every basis vector from step 1.1 and equals . Every nonzero invariant subspace is therefore the whole representation, proving irreducibility.
Depends on
Used by
Dependency tree · two levels
32 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
- John Watrous, The Theory of Quantum Information (standard reference, not scraped)