Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

SM Eq. (14), Supplemental Material p. 3 — the M-dual preserves dominance order: λ ⊵ μ implies λ̄ ⊵ μ̄

Proved
WernerExt.TwoSided.dual_dominance

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

dominance-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1young-diagram

Let d≥2d\ge2d≥2, λ,μ⊢dn\lambda,\mu\vdash_dnλ,μ⊢d​n with λ⊵μ\lambda\trianglerighteq\muλ⊵μ, and let M≥λ1,μ1M\ge\lambda_1,\mu_1M≥λ1​,μ1​. With the MMM-duals λˉi=M−λd−i+1\bar\lambda_i=M-\lambda_{d-i+1}λˉi​=M−λd−i+1​, μˉi=M−μd−i+1\bar\mu_i=M-\mu_{d-i+1}μˉ​i​=M−μd−i+1​,

λˉ ⊵ μˉ.\bar\lambda\ \trianglerighteq\ \bar\mu.λˉ ⊵ μˉ​.

So the dominance order between duals is the one between the original partitions, which the paper uses to transfer the Azenhas bound to the minimum product diagram.

Formalization Note M≥λ1,μ1M\ge\lambda_1,\mu_1M≥λ1​,μ1​ is written as M≥λi,μiM\ge\lambda_i,\mu_iM≥λi​,μi​ for every iii (equivalent for decreasing rows); the dual is computed with natural-number subtraction, exact under this hypothesis.

Differences from the source:

  • encoding: M ≥ λ_1 (and μ_1) → ∀ i, λ_i ≤ M ∧ μ_i ≤ M; reason: equivalent for weakly decreasing rows
  • 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

/-- SM Eq. (14), SM p. 3: taking the `M`-dual preserves dominance order: if `λ, μ ⊢_d n`,
`λ ⊵ μ` and `M` is at least the first rows of both, then `λ̄ ⊵ μ̄`. -/
theorem dual_dominance (d n M : ℕ) (hd : 2 ≤ d) (l m : DPart d n) (hlm : Dominates l.1 m.1)
    (hM : ∀ i : Fin d, l.1 i ≤ M ∧ m.1 i ≤ M) :
    Dominates (mDual M l.1) (mDual M m.1) := by sorry

end WernerExt.TwoSided
Source
Jakab, Solymos, Zimborás, Extendibility of Werner States, arXiv:2208.13743v2, Supplemental Material p. 3 (PDF 9), SM Eq. (14)
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