pyranim_stable_positions
def
For 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 ideal predicate pyranim_is_order_ideal X.
Statement
noncomputable def pyranim_stable_positions (n : ℕ) : Finset (Finset (ℕ × ℕ))
- Defined in
- arXiv:2611.16153 Def. 1.1
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 2
- 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…
- pyranim_is_order_idealA finite set of chips X : Finset (ℕ × ℕ) is an order ideal if whenever p ∈ X and a, b are natural numbers with p.1 ≤ a ≤ b ≤ p.2, the…
- Used by 2
- pyranim_collision_probFor a natural number n, pyranim_collision_prob n is the ratio of the number of pairs (X, Y) in pyranim_stable_positions n ×ˢ…
- 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
Given a natural number n, pyranim_stable_positions n is defined as the set (as a Finset) of all subsets X of the pyramid of pairs {(i, j) ∈ {1, ..., n} × {1, ..., n} | i ≤ j} such that X is an order ideal: for every (i, j) ∈ X and all integers a, b with i ≤ a ≤ b ≤ j, the pair (a, b) also belongs to X.
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 all stable positions of an n-tier Pyranim game. -/ noncomputable def pyranim_stable_positions (n : ℕ) : Finset (Finset (ℕ × ℕ)) := @Finset.filter (Finset (ℕ × ℕ)) pyranim_is_order_ideal (fun _ => Classical.propDecidable _) (pyranim_full_pyramid n).powerset