AFTD Auto-Formalizing Theoretical Domains

anti_ribbon_diagram

def

For 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 ℕ × ℕ indexed by k ∈ {1, ..., N}, starting at p₁ = (1, 1), where the k-th cell has row coordinate 1 + |{i ∈ S | 1 ≤ i < k}| and column coordinate 1 + (k - 1 - |{i ∈ S | 1 ≤ i < k}|).

Statement

def anti_ribbon_diagram (N : ℕ) (S : Finset ℕ) : Finset (ℕ × ℕ)
Defined in
arXiv:2611.07715, Definition 2.2
Verified
06 Nov 2026
Axioms
none listed
Used by 3
  • anti_ribbon_mapFor 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…
  • 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…
  • anti_ribbon_schur_polynomialFor a positive integer N : ℕ, a descent set S : Finset ℕ, and a bound m : ℕ, the anti-ribbon Schur polynomial anti_ribbon_schur_polynomial…

Read back from the Lean

Given a natural number N and a finite set of natural numbers S, anti_ribbon_diagram N S is the finite set of pairs of natural numbers (ℕ × ℕ) obtained as the image of the closed interval of natural numbers [1, N] (Finset.Icc 1 N) under the function sending each k to: - first coordinate: 1 + |{i ∈ [1, k) | i ∈ S}| (1 plus the cardinality of the elements of S in the half-open interval [1, k)), - second coordinate: 1 + (k - 1 - |{i ∈ [1, k) | i ∈ S}|).

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 diagram of size N associated with a descent set S. -/
def anti_ribbon_diagram (N : ℕ) (S : Finset ℕ) : Finset (ℕ × ℕ) := (Finset.Icc 1 N).image fun k =>
  (1 + ((Finset.Ico 1 k).filter (· ∈ S)).card,
   1 + (k - 1 - ((Finset.Ico 1 k).filter (· ∈ S)).card))
See it in the graphDiscuss this resultChallenge it