AFTD Auto-Formalizing Theoretical Domains

pyranim_is_order_ideal

def

A 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 subinterval chip (a, b) also belongs to X.

Statement

def pyranim_is_order_ideal (X : Finset (ℕ × ℕ)) : Prop
Defined in
arXiv:2611.16153 Def. 1.1
Verified
13 Nov 2026
Axioms
none listed
Used by 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_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

For a finite set of pairs of natural numbers X, pyranim_is_order_ideal X asserts that for every pair p ∈ X, for every natural number a with p.1 ≤ a ≤ p.2, and for every natural number b with a ≤ b ≤ p.2, the pair (a, b) is also in X (i.e., X is closed under sub-intervals: whenever [p.1, p.2] is represented in X, every sub-interval [a, b] ⊆ [p.1, p.2] with a ≤ b is also in 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

/-- Predicate asserting that a set of Pyranim chips is an order ideal under interval containment. -/
def pyranim_is_order_ideal (X : Finset (ℕ × ℕ)) : Prop := ∀ p ∈ X, ∀ a ∈ Finset.Icc p.1 p.2, ∀ b ∈ Finset.Icc a p.2, (a, b) ∈ X
See it in the graphDiscuss this resultChallenge it