Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries

Statement

For all partitions λ,μ,ν⊢n:

(a) g(λ,μ,ν) is a nonnegative integer;

(b) g is invariant under every permutation of the three arguments, that is g(λ,μ,ν)=g(μ,λ,ν)=g(λ,ν,μ)=⋯ for all six orderings;

(c) conjugating exactly two of the three partitions preserves the coefficient: g(λ,μ,ν)=g(λ′,μ′,ν)=g(λ′,μ,ν′)=g(λ,μ′,ν′), where λ′ denotes the conjugate partition.

No positive combinatorial rule for the coefficients is asserted.

Facts & Assumptions

Given: An integer n≥0 and partitions λ,μ,ν⊢n with conjugates λ′,μ′,ν′.

[F1]

g(λ,μ,ν) is the multiplicity of Sν in the completely reducible module Sλ⊗CSμ, hence a nonnegative integer (Kronecker coefficients and the internal tensor product).

[F2]

g(λ,μ,ν)=1n!∑σ∈Snχλ(σ)χμ(σ)χν(σ) (The Kronecker coefficient is a three-character inner product).

[F3]

For every ρ⊢n and σ∈Sn, χρ′(σ)=sgn⁡(σ)χρ(σ), and sgn⁡(σ)2=1 (Sign twist corresponds to the omega involution).

Proof

technique · direct
1.1F1given

Claim (a): by [F1], g(λ,μ,ν) is the multiplicity of an irreducible summand in a completely reducible finite-dimensional module, so it is a nonnegative integer.

1.2F2givenalgebra

Claim (b): by [F2], g(λ,μ,ν) is the average over σ∈Sn of the product χλ(σ)χμ(σ)χν(σ). Permuting the three arguments permutes the three factors of each summand, and complex multiplication is commutative, so every summand and hence the average is unchanged; this gives all six orderings.

2.1F2F3algebra∎

Claim (c): by [F3], χλ′(σ)=sgn⁡(σ)χλ(σ), χμ′(σ)=sgn⁡(σ)χμ(σ) and χν′(σ)=sgn⁡(σ)χν(σ) for every σ∈Sn. Substituting the first two of these into the formula [F2] for g(λ′,μ′,ν) gives 1n!∑σsgn⁡(σ)2χλ(σ)χμ(σ)χν(σ)=1n!∑σχλ(σ)χμ(σ)χν(σ)=g(λ,μ,ν), since sgn⁡(σ)2=1 for every σ. The same computation with exactly two of the three substitutions gives g(λ′,μ,ν′)=g(λ,μ′,ν′)=g(λ,μ,ν).

Depends on

Used by

Dependency tree · two levels

23 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