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

Conjugation and exchange symmetries of the Littlewood–Richardson coefficients

Statement

For all partitions λ,μ,ν, with primes denoting conjugate partitions, cμνλ=cνμλandcμνλ=cμ′ν′λ′, where each c is the Littlewood–Richardson coefficient of the inherited tableau definition (Littlewood--Richardson tableaux and coefficients). No choice principle is used.

Facts & Assumptions

Given: Partitions λ,μ,ν and their LR coefficients.

[F1]

The coefficient cμνλ is the number of LR tableaux of shape λ/μ and content ν, and it is zero unless μ⊆λ and ∣λ∣=∣μ∣+∣ν∣ (Littlewood--Richardson tableaux and coefficients).

[F2]

For every pair of partitions, sμsν=∑λcμνλsλ, a finite sum in the stable symmetric-function ring (The Littlewood–Richardson rule for products of Schur functions).

[F3]

The graded Z-algebra involution ω satisfies ω(sη)=sη′ for every partition η (The omega involution conjugates Schur functions).

[F4]

In every degree the Schur functions form an orthonormal Z-basis, so coefficients in a Schur expansion are unique (Schur functions form an orthonormal integral basis).

[F5]

Conjugation transposes Young diagrams, preserves size, and is an involution; in particular μ⊆λ iff μ′⊆λ′ and η′′=η (Partitions, English diagrams, and conjugation).

[F6]

Multiplication in Λ is coordinatewise multiplication of symmetric polynomials, hence is associative, commutative, and graded (The stable graded ring of symmetric functions).

Proof

technique · coefficient comparison
1.1F2F4F6

By [F6], sμsν=sνsμ. Expanding each side by [F2] and comparing coefficients in the Schur basis [F4] gives cμνλ=cνμλ for every λ.

1.2F2F3F4F5

Apply the ring homomorphism ω [F3] to the expansion in [F2]. Since ω(sη)=sη′, this gives sμ′sν′=∑λcμνλsλ′=∑ηcμνη′sη, where the reindexing η=λ′ is valid by [F5]. The LR expansion [F2] applied to μ′,ν′ also gives sμ′sν′=∑ηcμ′ν′ηsη. Uniqueness in [F4] implies cμ′ν′η=cμνη′; taking η=λ′ and using λ′′=λ proves cμνλ=cμ′ν′λ′.

2.1F1F2F5step 1.1step 1.2∎

If a partition is empty, the LR expansion [F2] includes the unit and all other coefficients are zero by [F1], so both symmetries still hold. If a coefficient is zero because its containment or size condition fails, [F1] gives zero and conjugation preserves those conditions by [F5]; when the LR set is empty despite valid containment and size, step 1.2 already proves the conjugate coefficient is equal to it. Thus the zero, unit, and boundary cases, including λ=μ, require no strict-containment assumption. All coefficient comparisons are in finite homogeneous degrees. No tableau representatives, bases, or other objects are chosen, and no axiom of choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

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