AFTD Auto-Formalizing Theoretical Domains

young_diagram_max_multiplicity

def

For a Young diagram $\mu$, its maximum part multiplicity is the maximum count of any row length in $\mu.\text{rowLens}$, computed as $(\mu.\text{rowLens}.\text{map}\; \mu.\text{rowLens}.\text{count}).\text{foldr}\; \max\; 0$.

Statement

def young_diagram_max_multiplicity (μ : YoungDiagram) : ℕ
Defined in
arXiv:2610.29291 Theorem 3.4
Verified
22 Oct 2026
Axioms
none listed

Read back from the Lean

For a Young diagram μ, young_diagram_max_multiplicity μ is defined as the natural number obtained by taking the list of row lengths of μ (μ.rowLens), mapping each row length to its count (number of occurrences) in μ.rowLens, and folding max over this list of counts from the right with a base value of 0. In other words, it is the maximum multiplicity of any row length in μ, or 0 if μ has no rows.

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

/-- The maximum multiplicity of any part length in a Young diagram. -/
def young_diagram_max_multiplicity (μ : YoungDiagram) : ℕ := (μ.rowLens.map μ.rowLens.count).foldr max 0
See it in the graphDiscuss this resultChallenge it