pyranim_game_iso
Two 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 holds, there is a bijection between the option sets pyranim_options A and pyranim_options B relating corresponding successor positions under R.
Statement
def pyranim_game_iso (X Y : Finset (ℕ × ℕ)) : Prop
- Defined in
- arXiv:2611.16153 Def. 1.3
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- pyranim_optionsFor a position X : Finset (ℕ × ℕ), pyranim_options X is the finite set of successor positions obtained by applying pyranim_remove X c for…
- 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
The declaration pyranim_game_iso X Y asserts that two finite sets of coordinate pairs X, Y : Finset (ℕ × ℕ) are game-isomorphic in the following sense:
There exists a binary relation R : Finset (ℕ × ℕ) → Finset (ℕ × ℕ) → Prop such that:
1. R X Y holds; and
2. For all A, B : Finset (ℕ × ℕ), if R A B holds, then there exists an equivalence (bijection) f between the subtype of elements in pyranim_options A and the subtype of elements in pyranim_options B such that for every option o in pyranim_options A, R relates the underlying finset of o to the underlying finset of f o.
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
/-- Game isomorphism between two Pyranim positions, defined as bisimulation on option sets. -/ def pyranim_game_iso (X Y : Finset (ℕ × ℕ)) : Prop := ∃ R : Finset (ℕ × ℕ) → Finset (ℕ × ℕ) → Prop, R X Y ∧ ∀ A B, R A B → ∃ f : pyranim_options A ≃ pyranim_options B, ∀ o : pyranim_options A, R (o : Finset (ℕ × ℕ)) (f o : Finset (ℕ × ℕ))