AFTD Auto-Formalizing Theoretical Domains

pyranim_seq_ideal

def

For a sequence l : Fin n → Fin (n+2), pyranim_seq_ideal n l is the set of chips (a,b) of the n-tier pyramid with l(b-1) ≤ a: each column b is the interval {l(b-1), ..., b}.

Statement

noncomputable def pyranim_seq_ideal (n : ℕ) (l : Fin n → Fin (n + 2)) : Finset (ℕ × ℕ)
Source
step towards pyranim_card_stable_positions
Verified
13 Nov 2026
Axioms
none listed
Built on 2
  • pyranim_fin_lookupFor l : Fin m → Fin (m+2), pyranim_fin_lookup m l j is the ℕ-th value of l when j < m, and the default m+2 otherwise, so that sequences…
  • pyranim_full_pyramidThe finite set pyranim_full_pyramid n : Finset (ℕ × ℕ) of pairs of natural numbers (i, j) such that 1 ≤ i ≤ j ≤ n, defined by filtering…

Lean source view module on GitHub

/-- The Pyranim position attached to a column-minimum sequence l: (a,b) is present iff l (b-1) ≤ a. -/
noncomputable def pyranim_seq_ideal (n : ℕ) (l : Fin n → Fin (n + 2)) : Finset (ℕ × ℕ) := (pyranim_full_pyramid n).filter fun p => pyranim_fin_lookup n l (p.2 - 1) ≤ p.1
See it in the graphDiscuss this resultChallenge it