AFTD Auto-Formalizing Theoretical Domains

pyranim_collision_prob

def

For a natural number n, pyranim_collision_prob n is the ratio of the number of pairs (X, Y) in pyranim_stable_positions n ×ˢ pyranim_stable_positions n satisfying pyranim_game_iso X Y to the square of the cardinality of pyranim_stable_positions n, as a real number.

Statement

noncomputable def pyranim_collision_prob (n : ℕ) : ℝ
Defined in
arXiv:2611.16153 Sec. 5.3, Question 4
Verified
13 Nov 2026
Axioms
none listed
Built on 2
  • 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_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…
Used by 1

Read back from the Lean

pyranim_collision_prob n defines a function from n : ℕ to ℝ that computes the probability that two independently and uniformly chosen stable positions of size n in the game Pyranim are game-isomorphic. Specifically, letting T = pyranim_stable_positions n, it is defined as the number of pairs (X, Y) ∈ T × T satisfying pyranim_game_iso X Y, divided by the real number |T|².

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 probability that two independent uniformly chosen stable Pyranim positions on n tiers are game-isomorphic. -/
noncomputable def pyranim_collision_prob (n : ℕ) : ℝ := let T := pyranim_stable_positions n
  (@Finset.filter (Finset (ℕ × ℕ) × Finset (ℕ × ℕ)) (fun ⟨X, Y⟩ => pyranim_game_iso X Y) (fun _ => Classical.propDecidable _) (T ×ˢ T)).card / (T.card ^ 2 : ℝ)
See it in the graphDiscuss this resultChallenge it