AFTD Auto-Formalizing Theoretical Domains

is_wide_partition

def

A Young diagram $d$ is wide if for every Young diagram $\mu$ whose list of row lengths $\mu.\text{rowLens}$ is a sublist of $d.\text{rowLens}$ (obtained by deleting rows of $d$), $\mu$ dominates its conjugate diagram.

Statement

def is_wide_partition (d : YoungDiagram) : Prop
Defined in
arXiv:2610.29291 Definition 2.2
Verified
22 Oct 2026
Axioms
none listed
Built on 1
  • young_diagram_dominates_conjugateA partition $\mu$ dominates its conjugate partition $\mu'$, meaning prefix sums of row lengths are at least prefix sums of column lengths.
Used by 2

Read back from the Lean

For a Young diagram d, is_wide_partition d asserts that for every Young diagram μ, if the list of row lengths of μ (μ.rowLens) is a sublist (a subsequence) of the list of row lengths of d (d.rowLens), then μ dominates its conjugate; that is, for every natural number k, the sum of the row lengths of μ for row indices from 0 to k - 1 is greater than or equal to the sum of the column lengths of μ for column indices from 0 to k - 1.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A Young diagram is wide if every subpartition obtained by deleting rows dominates its conjugate. -/
def is_wide_partition (d : YoungDiagram) : Prop := ∀ μ : YoungDiagram, μ.rowLens.Sublist d.rowLens → young_diagram_dominates_conjugate μ
See it in the graphDiscuss this resultChallenge it