pyranim_full_pyramid
def
The finite set pyranim_full_pyramid n : Finset (ℕ × ℕ) of pairs of natural numbers (i, j) such that 1 ≤ i ≤ j ≤ n, defined by filtering (Finset.Icc 1 n) ×ˢ (Finset.Icc 1 n) with the predicate fun ⟨i, j⟩ => i ≤ j.
Statement
def pyranim_full_pyramid (n : ℕ) : Finset (ℕ × ℕ)- Defined in
- arXiv:2611.16153 Sec. 1.1
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 3
- pyranim_seq_idealFor 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…
- pyranim_stable_positionsFor a natural number n, pyranim_stable_positions n is the finite set of all subsets X of pyranim_full_pyramid n that satisfy the order…
- pyranim_collision_prob_oneThe collision probability pyranim_collision_prob 1 for a 1-tier pyramid game is equal to 1 / 2.
Read back from the Lean
pyranim_full_pyramid n is defined as the finite set of pairs of natural numbers (i, j) such that 1 ≤ i ≤ j ≤ n, constructed by taking the Cartesian product of the interval {1, ..., n} with itself and filtering for pairs where i ≤ j.
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 finite set of chips in the full n-tier pyramid poset P_n = {[i, j] : 1 ≤ i ≤ j ≤ n}. -/ def pyranim_full_pyramid (n : ℕ) : Finset (ℕ × ℕ) := ((Finset.Icc 1 n) ×ˢ (Finset.Icc 1 n)).filter (fun ⟨i, j⟩ => i ≤ j)