AFTD Auto-Formalizing Theoretical Domains

instFintypeStandardYoungTableau

instanceoriginal

The type StandardYoungTableau D of standard Young tableaux on a finite diagram D is finite.

Statement

noncomputable instance instFintypeStandardYoungTableau (D : Finset (ℕ × ℕ)) : Fintype (StandardYoungTableau D)
Related work
folklore
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • StandardYoungTableauFor a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D…
  • row_col_leFor a finite diagram D : Finset (ℕ × ℕ) and cells u, v : ℕ × ℕ, row_col_le D u v holds if there is a reflexive-transitive chain of unit…

Read back from the Lean

For every finite subset $D \subseteq \mathbb{N} \times \mathbb{N}$, the type StandardYoungTableau D is finite (has an instance of Fintype).

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

/-- Fintype instance for standard Young tableaux on a finite diagram D. -/
noncomputable instance instFintypeStandardYoungTableau (D : Finset (ℕ × ℕ)) : Fintype (StandardYoungTableau D) := Fintype.ofInjective (fun T => T.toEquiv) (fun T₁ T₂ h => by cases T₁; cases T₂; cases h; rfl)
See it in the graphDiscuss this resultChallenge it