AFTD Auto-Formalizing Theoretical Domains

pyranim_options

def

For a position X : Finset (ℕ × ℕ), pyranim_options X is the finite set of successor positions obtained by applying pyranim_remove X c for all visible chips c ∈ X that do not have both immediate upper chips in X.

Statement

def pyranim_options (X : Finset (ℕ × ℕ)) : Finset (Finset (ℕ × ℕ))
Defined in
arXiv:2611.16153 Def. 1.2
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • pyranim_removeThe position resulting from removing chip c = (i, j) from X, which removes c and all chips (a, b) in X that contain (i, j) (satisfying a ≤…
Used by 2
  • pyranim_collision_prob_oneThe collision probability pyranim_collision_prob 1 for a 1-tier pyramid game is equal to 1 / 2.
  • pyranim_game_isoTwo Pyranim positions X and Y are game-isomorphic if there exists a bisimulation relation R relating X and Y such that whenever R A B…

Read back from the Lean

Given a finite set of pairs of natural numbers X, pyranim_options X is defined as the finite set of finite sets of pairs of natural numbers obtained by taking the image under pyranim_remove X of all pairs c = (c₁, c₂) ∈ X such that it is not the case that both (c₁ - 1, c₂) ∈ X and (c₁, c₂ + 1) ∈ 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 set of legal successor positions obtained by removing each visible chip from X. -/
def pyranim_options (X : Finset (ℕ × ℕ)) : Finset (Finset (ℕ × ℕ)) := (X.filter (fun c => ¬ ((c.1 - 1, c.2) ∈ X ∧ (c.1, c.2 + 1) ∈ X))).image (pyranim_remove X)
See it in the graphDiscuss this resultChallenge it