pyranim_is_visible
def
For a finite set X : Finset (ℕ × ℕ) and a chip c : ℕ × ℕ, pyranim_is_visible X c is the proposition that c ∈ X and it is not the case that both (c.1 - 1, c.2) ∈ X and (c.1, c.2 + 1) ∈ X, with natural number subtraction on c.1 - 1.
Statement
def pyranim_is_visible (X : Finset (ℕ × ℕ)) (c : ℕ × ℕ) : Prop
- Defined in
- arXiv:2611.16153 Def. 1.2
- Verified
- 13 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a finite set $X$ of pairs of natural numbers and a pair $c = (c_1, c_2) \in \mathbb{N} \times \mathbb{N}$, pyranim_is_visible X c holds if and only if $c \in X$ and not both $(c_1 - 1, c_2) \in X$ and $(c_1, c_2 + 1) \in X$ (using truncated natural number subtraction, where $0 - 1 = 0$).
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
/-- A chip c in X is visible if its two immediate upper chips are not both present in X. -/ def pyranim_is_visible (X : Finset (ℕ × ℕ)) (c : ℕ × ℕ) : Prop := c ∈ X ∧ ¬ ((c.1 - 1, c.2) ∈ X ∧ (c.1, c.2 + 1) ∈ X)