Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (10), p. 3 (corrected: c(λ) − c(μ) = 2[(k − i) + (μ_i − μ_k) + 1], not (k − i) + (μ_i − μ_k)) — a dominance cover raises c by at least 1; c refines dominance order

Proved
WernerExt.TwoSided.casimir_dominance

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

casimir-operatordominance-orderp2o-batch-pfp2ap2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1young-diagram

Let d≥2d\ge2d≥2 and n≥0n\ge0n≥0; all partitions below are ddd-partitions of nnn, and ccc is Eq. (9).

  1. If λ\lambdaλ covers μ\muμ in dominance order, then c(λ)−c(μ)≥1c(\lambda)-c(\mu)\ge1c(λ)−c(μ)≥1.
  2. The order of the Casimir eigenvalues refines dominance order: if λ⊵μ\lambda\trianglerighteq\muλ⊵μ and λ≠μ\lambda\ne\muλ=μ, then c(λ)>c(μ)c(\lambda)>c(\mu)c(λ)>c(μ).
  3. If λ\lambdaλ is obtained from μ\muμ by removing one box from row kkk and appending it to row i<ki<ki<k, then
c(λ)−c(μ)=2[(k−i)+(μi−μk)+1].c(\lambda)-c(\mu)=2\left[(k-i)+(\mu_i-\mu_k)+1\right].c(λ)−c(μ)=2[(k−i)+(μi​−μk​)+1].

These facts show that a dominance-minimal constituent has the smallest Casimir eigenvalue.

Formalization Note Clause 3 is stated for every such box move between ddd-partitions; a cover in dominance order is a box move of this kind (p. 3).

Differences from the source:

  • correction: the middle equalities of (10): c(λ) − c(μ) = (k − i) + (λ_i − λ_k) − 2 = (k − i) + (μ_i − μ_k) → c(λ) − c(μ) = 2[(k − i) + (μ_i − μ_k) + 1]; reason: the printed value is false: for d = 2, λ = (2, 0) covers μ = (1, 1) (box from row k = 2 to row i = 1), c(λ) = 4 and c(μ) = 0, so c(λ) − c(μ) = 4 while (k − i) + (μ_i − μ_k) = 1; the corrected formula is checked on all 560 box moves with d ≤ 5 and rows ≤ 4
  • generalization: clause 3 under the hypothesis that λ covers μ → clause 3 for every move of one box from row k to row i < k between d-partitions of n; reason: the computation does not use the cover property; covers are such moves, so it specializes to the source
  • encoding: λ ⊢ n, μ ⊢ n arbitrary partitions → d-partitions of n; reason: c is defined for d-row diagrams (Eq. (9)), and every partition dominating a d-row partition has at most d rows, so covers among d-partitions are covers among all partitions
  • encoding: 1-based rows λ_1, …, λ_d and sites → 0-based Fin d rows and Fin n sites; reason: Lean indexing convention; same instances
Preamble
import Mathlib
import Definitions.Def_WernerExt_TwoSided_Model
Formal statement
namespace WernerExt.TwoSided

/-- Eq. (10), p. 3: (a) if `λ` covers `μ` in dominance order (both `d`-partitions of `n`), then
`c(λ) − c(μ) ≥ 1`; (b) the order of the Casimir eigenvalues refines dominance order:
`λ ⊵ μ`, `λ ≠ μ` implies `c(λ) > c(μ)`; (c) (corrected middle equalities of (10)) if `λ` is
obtained from `μ` by moving one box from row `k` to row `i < k`, then
`c(λ) − c(μ) = 2[(k − i) + (μ_i − μ_k) + 1]`. -/
theorem casimir_dominance (d n : ℕ) (hd : 2 ≤ d) :
    (∀ l m : DPart d n, Covers l m → casimirValue m.1 + 1 ≤ casimirValue l.1) ∧
      (∀ l m : DPart d n, Dominates l.1 m.1 → l ≠ m → casimirValue m.1 < casimirValue l.1) ∧
      (∀ (l m : DPart d n) (i k : Fin d), i < k → l.1 i = m.1 i + 1 → l.1 k + 1 = m.1 k →
        (∀ r : Fin d, r ≠ i → r ≠ k → l.1 r = m.1 r) →
        casimirValue l.1 - casimirValue m.1 =
          2 * (((k : ℕ) : ℝ) - ((i : ℕ) : ℝ) + ((m.1 i : ℝ) - (m.1 k : ℝ)) + 1)) := by sorry

end WernerExt.TwoSided
Source
Jakab, Solymos, Zimborás, Extendibility of Werner States, arXiv:2208.13743v2, p. 3, Eq. (10) and the cover paragraph after Eq. (7)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me