young_diagram_part_gcd
def
The greatest common divisor of the row lengths of a Young diagram $\lambda$.
Statement
def young_diagram_part_gcd (μ : YoungDiagram) : ℕ- Defined in
- arXiv:2610.29291 Theorem 3.4
- Verified
- 22 Oct 2026
- Axioms
- none listed
Read back from the Lean
The definition young_diagram_part_gcd assigns to each Young diagram μ the natural number obtained by folding Nat.gcd from the right over the list of its row lengths (μ.rowLens) starting with 0. In other words, it is the greatest common divisor of the parts (row lengths) of μ, which evaluates to 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 greatest common divisor of the row lengths of a Young diagram. -/ def young_diagram_part_gcd (μ : YoungDiagram) : ℕ := μ.rowLens.foldr Nat.gcd 0