p. 3 — a dominance-minimal irrep of λ^A ⊗ λ^B has the smallest Casimir eigenvalue among the product diagrams
ProvedWernerExt.TwoSided.min_casimircasimir-operatordominance-orderlittlewood-richardsonp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , , , . If appears in and is dominated by every irrep appearing there (a minimum with respect to dominance order), then
Combined with Eq. (11), this identifies the lowest eigenvalue of on the sector, which gives .
Formalization Note A -partition is represented by the published type QAlgorithms.Schur.Partition d n (Young diagrams with boxes and at most rows), read through its first row lengths; is the published polynomial Littlewood–Richardson coefficient lrCoefficient d λ μ ν (LR tableaux of shape and content ).
Differences from the source:
- encoding: “λ^(AB) appears in λ^(A) ⊗ λ^(B)” for SU(d) irreps labelled by d-row partitions of fixed sizes → 0 < lrCoefficient d λ^A λ^B λ^AB (polynomial LR coefficient, λ^A inner shape, λ^B content); reason: at fixed box counts no two distinct partitions are SU(d)-equivalent (p. 2), so the SU(d) multiplicity is the polynomial LR coefficient
- encoding: 1-based rows λ_1, …, λ_d and sites → 0-based
Fin drows andFin nsites; reason: Lean indexing convention; same instances
Preamble
import Mathlib import Definitions.Def_WernerExt_TwoSided_Model import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P19
Formal statement
namespace WernerExt.TwoSided
open QAlgorithms.Schur QAlgorithms.Papers.Independent.Frontier30.P19
/-- p. 3: if the set of irreps appearing in `λ^A ⊗ λ^B` has a minimum `λ^0` in dominance
order, then `λ^0` has the smallest quadratic Casimir eigenvalue among the product diagrams. -/
theorem min_casimir (d nA nB : ℕ) (hd : 2 ≤ d) (hA : 1 ≤ nA) (hB : 1 ≤ nB)
(lA : Partition d nA) (lB : Partition d nB) (l0 : Partition d (nA + nB))
(h0 : 0 < lrCoefficient d lA.val lB.val l0.val)
(hmin : ∀ lAB : Partition d (nA + nB), 0 < lrCoefficient d lA.val lB.val lAB.val →
Dominates (fun i : Fin d => lAB.val.rowLen i) (fun i : Fin d => l0.val.rowLen i)) :
∀ lAB : Partition d (nA + nB), 0 < lrCoefficient d lA.val lB.val lAB.val →
casimirValue (fun i : Fin d => l0.val.rowLen i) ≤
casimirValue (fun i : Fin d => lAB.val.rowLen i) := by sorry
end WernerExt.TwoSided
Source
Jakab, Solymos, Zimborás, Extendibility of Werner States, arXiv:2208.13743v2, p. 3, 'Thus, if the set of irreps that appear in the irrep decomposition of λ^(A) ⊗ λ^(B) has a minimum …'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.