epstein_remoteness_level
The 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 = 2m+1, positions n ≠ 0 where at least one move epstein_down n or epstein_up n is in level 2m and neither move is in level 2j for any j < m; for even k = 2m+2, positions n ≠ 0 where both moves belong to the union of odd levels 2j+1 for j ≤ m and at least one move is in level 2m+1.
Statement
def epstein_remoteness_level : ℕ → Set ℕ- Defined in
- arXiv:2611.05898 Def 1.2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- epstein_downThe down-move in Epstein's put-or-take-a-square game, defined as epstein_down n = n - (Nat.sqrt n)^2.
- epstein_upThe up-move in Epstein's put-or-take-a-square game, defined as epstein_up n = n + (Nat.sqrt n)^2.
- Used by 3
- epstein_remotenessThe remoteness epstein_remoteness n of position n in Epstein's game, defined as the least natural number k such that n ∈…
- 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_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
The function epstein_remoteness_level : ℕ → Set ℕ is defined recursively on k : ℕ as follows:
- For k = 0: epstein_remoteness_level 0 = {0}.
- For k + 1:
- If (k + 1) % 2 = 1 (i.e., k + 1 is odd):
Let m = k / 2. The set epstein_remoteness_level (k + 1) consists of all n : ℕ such that:
1. n ≠ 0,
2. at least one of epstein_down n or epstein_up n belongs to epstein_remoteness_level (2 * m), and
3. for all j < m, neither epstein_down n nor epstein_up n belongs to epstein_remoteness_level (2 * j).
- If (k + 1) % 2 ≠ 1 (i.e., k + 1 is even):
Let m = (k - 1) / 2. The set epstein_remoteness_level (k + 1) consists of all n : ℕ such that:
1. n ≠ 0,
2. epstein_down n ∈ ⋃ (j ≤ m), epstein_remoteness_level (2 * j + 1),
3. epstein_up n ∈ ⋃ (j ≤ m), epstein_remoteness_level (2 * j + 1), and
4. at least one of epstein_down n or epstein_up n belongs to epstein_remoteness_level (2 * m + 1).
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 set of game positions in Epstein's put-or-take-a-square game having remoteness exactly k. -/ def epstein_remoteness_level : ℕ → Set ℕ | 0 => {0} | k + 1 => if (k + 1) % 2 = 1 then let m := k / 2 {n : ℕ | n ≠ 0 ∧ (epstein_down n ∈ epstein_remoteness_level (2 * m) ∨ epstein_up n ∈ epstein_remoteness_level (2 * m)) ∧ ∀ j < m, epstein_down n ∉ epstein_remoteness_level (2 * j) ∧ epstein_up n ∉ epstein_remoteness_level (2 * j)} else let m := (k - 1) / 2 {n : ℕ | n ≠ 0 ∧ (epstein_down n ∈ (⋃ j ≤ m, epstein_remoteness_level (2 * j + 1))) ∧ (epstein_up n ∈ (⋃ j ≤ m, epstein_remoteness_level (2 * j + 1))) ∧ (epstein_down n ∈ epstein_remoteness_level (2 * m + 1) ∨ epstein_up n ∈ epstein_remoteness_level (2 * m + 1))}