epstein_remoteness
The remoteness epstein_remoteness n of position n in Epstein's game, defined as the least natural number k such that n ∈ epstein_remoteness_level k, or ⊤ if no such k exists.
Statement
noncomputable def epstein_remoteness (n : ℕ) : WithTop ℕ
- Defined in
- arXiv:2611.05898 Def 1.2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 1
- epstein_remoteness_levelThe set epstein_remoteness_level k of positions with remoteness k in Epstein's put-or-take game: level 0 contains only 0; for odd k =…
- Used by 3
- epstein_remoteness_of_is_stein_numberFor every natural number n, if n is an E. P. Stein number (is_stein_number n), then its remoteness epstein_remoteness n is equal to 2.
- epstein_remoteness_four_nonemptyThere exists a natural number n such that epstein_remoteness n = 4.
- epstein_remoteness_twenty_nineIn Epstein's put-or-take-a-square game, the natural number 29 has remoteness epstein_remoteness 29 = 4.
Read back from the Lean
epstein_remoteness is a function mapping each natural number n : ℕ to an element of WithTop ℕ (the natural numbers extended with positive infinity ⊤).
For a given n : ℕ:
- If there exists some natural number k such that n ∈ epstein_remoteness_level k, then epstein_remoteness n evaluates to some k_min (coerced into WithTop ℕ), where k_min is the least natural number satisfying n ∈ epstein_remoteness_level k_min (obtained via Nat.find).
- If no such k exists, epstein_remoteness n evaluates to ⊤.
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 remoteness function R(n) in Epstein's put-or-take-a-square game, valued in WithTop ℕ. -/ noncomputable def epstein_remoteness (n : ℕ) : WithTop ℕ := open Classical in if h : ∃ k : ℕ, n ∈ epstein_remoteness_level k then some (Nat.find h) else ⊤