anti_ribbon_map
For a standard Young tableau T on D : Finset (ℕ × ℕ) and a filling M : D → ℕ, anti_ribbon_map T M is the filling of anti_ribbon_diagram D.card (standard_young_tableau_descent_set T) assigning to each cell p the value M(T.box k) where k = p.1.1 + p.1.2 - 1 if k ∈ Finset.Icc 1 D.card, and 0 otherwise.
Statement
def anti_ribbon_map {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D)
(M : D → ℕ) : (anti_ribbon_diagram D.card (standard_young_tableau_descent_set T)) → ℕ- Defined in
- arXiv:2611.07715, Section 4
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 4
- StandardYoungTableauFor a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D…
- standard_young_tableau_boxFor a standard Young tableau T on a finite diagram D : Finset (ℕ × ℕ) and an integer k with proof hk : k ∈ Finset.Icc 1 D.card,…
- standard_young_tableau_descent_setFor a standard Young tableau T on D : Finset (ℕ × ℕ), the descent set standard_young_tableau_descent_set T is the subset of k ∈ Finset.Ico…
- anti_ribbon_diagramFor a positive integer N and a descent set S : Finset ℕ, the anti-ribbon diagram anti_ribbon_diagram N S is the finite set of cells in ℕ ×…
- Used by 1
- anti_ribbon_map_preserves_weightFor any finite diagram D : Finset (ℕ × ℕ), any standard Young tableau T on D, and any filling M : D → ℕ belonging to standardization_block…
Read back from the Lean
Given a finite set of cells D ⊆ ℕ × ℕ, a standard Young tableau T on D, and a function M : D → ℕ, anti_ribbon_map defines a function from the anti-ribbon diagram of size |D| with descent set Des(T) to ℕ.
Specifically, for each cell p = (r, c) in the anti-ribbon diagram, let k = r + c - 1. If k ∈ {1, ..., |D|}, the function returns M applied to the unique cell u ∈ D assigned the label k by T (i.e., T.toEquiv.symm k). Otherwise, it returns 0 (though k is always in {1, ..., |D|} for any cell in the anti-ribbon diagram).
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 anti-ribbon filling R_T(M) assigning the entry of M at box T⁻¹(k) to the k-th box of the anti-ribbon shape. -/ def anti_ribbon_map {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) (M : D → ℕ) : (anti_ribbon_diagram D.card (standard_young_tableau_descent_set T)) → ℕ := fun p => let k := p.1.1 + p.1.2 - 1 if hk : k ∈ Finset.Icc 1 D.card then M (standard_young_tableau_box T k hk) else 0