Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 Subspace Dimension And Haar Moment

Statement

Assume the axiom-of-choice branch used by Normalized Haar probability on a compact group. For integers d≥1 and k≥0, put Nk=(k+d−1d−1). Then dim⁡Sym⁡k(Cd)=Nk, and if μ is the probability measure on the unit sphere obtained by pushing normalized Haar probability on U(d) through U↦Ue1, then ∫∣u⟩⟨u∣⊗k dμ(u)=1NkΠsym,k. For k=0, the tensor power and projector are the identity on the one-dimensional tensor unit.

Facts & Assumptions

Given: d≥1, k≥0, the natural tensor action of U(d), and the stated normalized Haar probability.

[F1]

The symmetric subspace is the range of the average of the k! tensor-factor permutations (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector). The current QC02 permutation definition and the local projector lemma specify the action used here; both are draft carriers.

[F2]

The representation of U(d) on this subspace is irreducible (Symmetric Power Irreducible).

[F3]

The unitary group is compact and normalized Haar probability exists on it under the declared choice axiom (Unitary Group Compact, Normalized Haar probability on a compact group, The Axiom of Choice). The owner-published root bodies exist; their hypotheses and the stated conditional branch were checked.

[F5]

For a unit vector u, Pu=∣u⟩⟨u∣ is a rank-one orthogonal projection of trace one; tensor maps give Pu⊗k=∣u⊗k⟩⟨u⊗k∣, and u⊗k is a unit vector by the product inner product. Every tensor-factor permutation fixes u⊗k, so this tensor is symmetric (Ray-to-projector is well-defined and bijective, Dirac Notation Conversion, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).

Proof

1.1givenF1algebra

For each weak composition α1+⋯+αd=k with αj≥0, sum and normalize the elementary tensors in which index j occurs αj times. Different compositions have disjoint orthonormal tensor supports, and permutation invariance forces coefficients to be constant on each such orbit, so these vectors form a basis of Sym⁡k(Cd) by [F1]. Weak compositions correspond bijectively to placements of d−1 separators among k+d−1 positions (the numbers of stars before, between, and after separators recover the parts). There are (k+d−1d−1)=Nk such placements. For k=0 this gives the single empty tensor.

1.2givenF1F3F5algebra

The pushforward measure μ is invariant under every V∈U(d): left invariance of Haar gives VU the same distribution as U, and (VU)e1=V(Ue1). Define the finite-dimensional operator integral M=∫∣u⟩⟨u∣⊗k dμ(u). By [F5], every integrand is a rank-one projection onto a symmetric tensor and has trace one, so M=ΠsymMΠsym by [F1]. Invariance gives V⊗kM(V⊗k)∗=M.

2.1givenF1F2F4F5step 1.2algebra∎

The coordinate integral in step 1.2 is self-adjoint and nonnegative: each integrand is a rank-one orthogonal projection by [F5], so M∗=M and ⟨Mv,v⟩=∫∣⟨v,u⊗k⟩∣2 dμ(u)≥0. Since M=ΠsymMΠsym, its restriction to the symmetric subspace is self-adjoint and nonnegative. By the spectral theorem [F4], that restriction has an orthogonal decomposition into eigenspaces. Each eigenspace is invariant under U(d) because M commutes with the representation by step 1.2; irreducibility [F2] therefore permits only one eigenspace, so M=cΠsym for some c≥0. Taking traces gives 1=tr⁡M=ctr⁡Πsym=cNk, since every integrand has trace one by [F5] (also for k=0). Thus c=1/Nk, proving the moment identity.

Depends on

Used by

Dependency tree · two levels

58 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