epstein_remoteness_twenty_nine
In Epstein's put-or-take-a-square game, the natural number 29 has remoteness epstein_remoteness 29 = 4.
Statement
theorem epstein_remoteness_twenty_nine : epstein_remoteness 29 = 4- Formalizes
- arXiv:2611.05898 Ex 1.4
- Verified
- 06 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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_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 =…
- epstein_downThe down-move in Epstein's put-or-take-a-square game, defined as epstein_down n = n - (Nat.sqrt n)^2.
- 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_upThe up-move in Epstein's put-or-take-a-square game, defined as epstein_up n = n + (Nat.sqrt n)^2.
- Used by 1
- epstein_remoteness_four_nonemptyThere exists a natural number n such that epstein_remoteness n = 4.
Read back from the Lean
The remoteness value of the number 29 in Epstein's game, epstein_remoteness 29, is equal to 4 (as an element of WithTop ℕ).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To prove that 29 has remoteness 4 in Epstein's put-or-take-a-square game, the argument computes the game transitions: subtracting the largest square gives 4 (level 1) and adding it gives 54 (level 3), which places 29 into remoteness level 4. It then proves that 29 does not belong to levels 0, 1, 2, or 3 by showing that its transition targets fail the necessary membership conditions for earlier levels. Because 4 is the smallest index k for which 29 belongs to level k, the definition of remoteness yields epstein_remoteness 29 = 4.
Characterisation of remoteness level 3: n belongs to level 3 if and only if n ≠ 0, at least one of its moves is in level 2, and neither move is 0.
Instantiating the recursive definition epstein_remoteness_level.eq_2 with k = 2 gives an odd level 3 with m = 1. The universal quantifier ∀ j < 1 requires that neither move belongs to level 2*0 = 0. Since level 0 is {0}, this simply means neither move is 0.
uses
epstein_remoteness_level.eq_2,MulZeroClass.mul_zero,epstein_remoteness_level.eq_1,Set.mem_singleton_iffhave h := epstein_remoteness_level.eq_2 2 rw [h] dsimp ext n simp only [Set.mem_ofPred_eq] constructor · rintro ⟨hn, h2, hj⟩ have h0 := hj 0 (by decide) rw [MulZeroClass.mul_zero, epstein_remoteness_level.eq_1, Set.mem_singleton_iff] at h0 exact ⟨hn, h2, h0.1, h0.2⟩ · rintro ⟨hn, h2, hd0, hu0⟩ refine ⟨hn, h2, fun j hj => ?_⟩ interval_cases j rw [MulZeroClass.mul_zero, epstein_remoteness_level.eq_1, Set.mem_singleton_iff] exact ⟨hd0, hu0⟩
Characterisation of remoteness level 4: n belongs to level 4 if and only if n ≠ 0, both moves belong to level 1 ∪ level 3, and at least one move belongs to level 3.
Instantiating epstein_remoteness_level.eq_2 with k = 3 gives an even level 4 with m = 1. The index j ranges over {0, 1}, so the union over j ≤ 1 of level (2j + 1) is level 1 ∪ level 3. Both moves must lie in this union, with at least one reaching level 3.
uses
epstein_remoteness_level.eq_2,Nat.zero_le,le_reflhave h := epstein_remoteness_level.eq_2 3 rw [h] dsimp ext n simp only [Set.mem_iUnion, exists_prop, Set.mem_union, Set.mem_ofPred_eq] constructor · rintro ⟨hn, ⟨j1, hj1, hd⟩, ⟨j2, hj2, hu⟩, h3⟩ refine ⟨hn, ?_, ?_, h3⟩ · interval_cases j1 <;> [left; right] <;> assumption · interval_cases j2 <;> [left; right] <;> assumption · rintro ⟨hn, hd, hu, h3⟩ refine ⟨hn, ?_, ?_, h3⟩ · rcases hd with hd | hd · exact ⟨0, Nat.zero_le 1, hd⟩ · exact ⟨1, le_refl 1, hd⟩ · rcases hu with hu | hu · exact ⟨0, Nat.zero_le 1, hu⟩ · exact ⟨1, le_refl 1, hu⟩
4 belongs to remoteness level 1.
For n = 4, the largest square ≤ 4 is 4, so epstein_down 4 = 4 - 4 = 0. By the level 1 characterisation, any positive integer with a move to 0 is in level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eq,Or.inlrw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]
1 belongs to remoteness level 1.
For n = 1, epstein_down 1 = 1 - 1 = 0, so 1 belongs to level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eq,Or.inlrw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]
9 belongs to remoteness level 1.
For n = 9, epstein_down 9 = 9 - 9 = 0, so 9 belongs to level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eq,Or.inlrw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]
5 belongs to remoteness level 2.
From 5, the down move is 5 - 4 = 1 and the up move is 5 + 4 = 9. Since both 1 and 9 are in level 1, 5 belongs to level 2.
uses
epstein_remoteness_of_is_stein_number_level_two_eq,epstein_remoteness_twenty_nine_mem_level_one_one,epstein_remoteness_twenty_nine_mem_level_one_ninerw [epstein_remoteness_of_is_stein_number_level_two_eq] refine ⟨by decide, ?_, ?_⟩ · have : epstein_down 5 = 1 := by norm_num [epstein_down] rw [this] exact epstein_remoteness_twenty_nine_mem_level_one_one · have : epstein_up 5 = 9 := by norm_num [epstein_up] rw [this] exact epstein_remoteness_twenty_nine_mem_level_one_nine
54 belongs to remoteness level 3.
From 54, the down move is 54 - 49 = 5, which belongs to level 2. The down move 5 and up move 103 are both non-zero, so by the level 3 characterisation, 54 belongs to level 3.
uses
epstein_remoteness_twenty_nine_level_three,Or.inl,epstein_remoteness_twenty_nine_mem_level_two_fiverw [epstein_remoteness_twenty_nine_level_three] refine ⟨by decide, Or.inl ?_, ?_, ?_⟩ · have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] exact epstein_remoteness_twenty_nine_mem_level_two_five · intro h have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] at h revert h; decide · intro h have : epstein_up 54 = 103 := by norm_num [epstein_up] rw [this] at h revert h; decide
29 belongs to remoteness level 4.
From 29, the down move is 29 - 25 = 4 (which is in level 1) and the up move is 29 + 25 = 54 (which is in level 3). Both moves lie in level 1 ∪ level 3, and the up move is in level 3, fulfilling the condition for level 4.
uses
epstein_remoteness_twenty_nine_level_four,Or.inl,epstein_remoteness_twenty_nine_mem_level_one_four,Or.inr,epstein_remoteness_twenty_nine_mem_level_three_fifty_fourrw [epstein_remoteness_twenty_nine_level_four] refine ⟨by decide, ?_, ?_, ?_⟩ · have hd : epstein_down 29 = 4 := by norm_num [epstein_down] rw [hd] exact Or.inl epstein_remoteness_twenty_nine_mem_level_one_four · have hu : epstein_up 29 = 54 := by norm_num [epstein_up] rw [hu] exact Or.inr epstein_remoteness_twenty_nine_mem_level_three_fifty_four · have hu : epstein_up 29 = 54 := by norm_num [epstein_up] rw [hu] exact Or.inr epstein_remoteness_twenty_nine_mem_level_three_fifty_four
0 does not belong to remoteness level 1.
By definition, all elements of level 1 are non-zero, so 0 ∉ level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eqrw [epstein_remoteness_of_is_stein_number_level_one_eq] simp
5 does not belong to remoteness level 1.
Level 1 requires epstein_down n = 0 or epstein_up n = 0. But for n = 5, the moves are 1 and 9, neither of which is 0.
uses
epstein_remoteness_of_is_stein_number_level_one_eqrw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 5 = 1 := by norm_num [epstein_down] omega · have : epstein_up 5 = 9 := by norm_num [epstein_up] omega
54 does not belong to remoteness level 1.
For n = 54, the moves are 5 and 103, neither of which is 0, so 54 is not in level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eqrw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 54 = 5 := by norm_num [epstein_down] omega · have : epstein_up 54 = 103 := by norm_num [epstein_up] omega
4 does not belong to remoteness level 2.
Level 2 requires both moves to be in level 1. But epstein_down 4 = 0, and 0 ∉ level 1, contradiction.
uses
epstein_remoteness_of_is_stein_number_level_two_eq,epstein_remoteness_twenty_nine_not_mem_level_one_zerorw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, hd, -⟩ have : epstein_down 4 = 0 := by norm_num [epstein_down] rw [this] at hd exact epstein_remoteness_twenty_nine_not_mem_level_one_zero hd
54 does not belong to remoteness level 2.
Level 2 requires epstein_down 54 = 5 to be in level 1, which contradicts the fact that 5 ∉ level 1.
uses
epstein_remoteness_of_is_stein_number_level_two_eq,epstein_remoteness_twenty_nine_not_mem_level_one_fiverw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, hd, -⟩ have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] at hd exact epstein_remoteness_twenty_nine_not_mem_level_one_five hd
29 does not belong to remoteness level 0.
Level 0 is {0}, and 29 ≠ 0.
uses
epstein_remoteness_level.eq_1rw [epstein_remoteness_level.eq_1] simp
29 does not belong to remoteness level 1.
The moves from 29 are 4 and 54, neither of which is 0, so 29 cannot belong to level 1.
uses
epstein_remoteness_of_is_stein_number_level_one_eqrw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 29 = 4 := by norm_num [epstein_down] omega · have : epstein_up 29 = 54 := by norm_num [epstein_up] omega
29 does not belong to remoteness level 2.
Level 2 would require the up move 54 to be in level 1, contradicting 54 ∉ level 1.
uses
epstein_remoteness_of_is_stein_number_level_two_eq,epstein_remoteness_twenty_nine_not_mem_level_one_fifty_fourrw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, -, hu⟩ have : epstein_up 29 = 54 := by norm_num [epstein_up] rw [this] at hu exact epstein_remoteness_twenty_nine_not_mem_level_one_fifty_four hu
29 does not belong to remoteness level 3.
Level 3 requires at least one move to be in level 2. But epstein_down 29 = 4 ∉ level 2 and epstein_up 29 = 54 ∉ level 2, contradiction.
uses
epstein_remoteness_twenty_nine_level_three,epstein_remoteness_twenty_nine_not_mem_level_two_four,epstein_remoteness_twenty_nine_not_mem_level_two_fifty_fourrw [epstein_remoteness_twenty_nine_level_three] rintro ⟨-, h | h, -, -⟩ · have : epstein_down 29 = 4 := by norm_num [epstein_down] rw [this] at h exact epstein_remoteness_twenty_nine_not_mem_level_two_four h · have : epstein_up 29 = 54 := by norm_num [epstein_up] rw [this] at h exact epstein_remoteness_twenty_nine_not_mem_level_two_fifty_four h
There exists some level containing 29, so the remoteness equals the option of the minimal such level index.
Since 29 ∈ level 4, the proposition ∃ k, 29 ∈ epstein_remoteness_level k holds. Unfolding epstein_remoteness via epstein_remoteness.eq_def and evaluating the conditional with dif_pos reduces the value to some (Nat.find hex).
uses
epstein_remoteness_twenty_nine_mem_level_four_twenty_nine,epstein_remoteness.eq_def,dif_pos,Classical.propDecidableclassical have hex : ∃ k, 29 ∈ epstein_remoteness_level k := ⟨4, epstein_remoteness_twenty_nine_mem_level_four_twenty_nine⟩ have hstep : epstein_remoteness 29 = (some (Nat.find hex) : WithTop ℕ) := by rw [epstein_remoteness.eq_def] exact @dif_pos (c := ∃ k, 29 ∈ epstein_remoteness_level k) (h := Classical.propDecidable _) hex (α := WithTop ℕ) (t := fun hh => @Option.some ℕ (Nat.find (p := fun k => 29 ∈ epstein_remoteness_level k) hh)) (e := fun _ => ⊤)
The minimal level containing 29 is 4.
Because 29 ∈ level 4, the minimal index Nat.find hex satisfies Nat.find hex ≤ 4. By checking each possible value 0, 1, 2, 3 with interval_cases, each case is ruled out by the non-membership lemmas proved earlier, leaving 4 as the only possible value.
uses
Nat.find_spec,Nat.find_min',epstein_remoteness_twenty_nine_mem_level_four_twenty_nine,False.elim,epstein_remoteness_twenty_nine_not_mem_level_zero_twenty_nine,epstein_remoteness_twenty_nine_not_mem_level_one_twenty_nine,epstein_remoteness_twenty_nine_not_mem_level_two_twenty_nine,epstein_remoteness_twenty_nine_not_mem_level_three_twenty_ninehave hfind : Nat.find hex = 4 := by have hspec : 29 ∈ epstein_remoteness_level (Nat.find hex) := Nat.find_spec hex have hle : Nat.find hex ≤ 4 := Nat.find_min' hex epstein_remoteness_twenty_nine_mem_level_four_twenty_nine interval_cases Nat.find hex · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_zero_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_one_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_two_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_three_twenty_nine hspec) · rfl
epstein_remoteness 29 = 4.
Substituting the minimal index 4 into the remoteness expression concludes the theorem.
rw [hstep, hfind] rfl
epstein_remoteness_level.eq_2- The recurrence relation for epstein_remoteness_level (k + 1), branching on the parity of k + 1.
MulZeroClass.mul_zero- Multiplying any element by zero on the right gives zero.
epstein_remoteness_level.eq_1- Remoteness level 0 consists solely of {0}.
Set.mem_singleton_iff- An element x belongs to the singleton set {b} if and only if x = b.
Nat.zero_le- Zero is less than or equal to any natural number n.
le_refl- Every element in a preorder is less than or equal to itself.
epstein_remoteness_of_is_stein_number_level_one_eq- Remoteness level 1 consists of non-zero numbers where either the down move or the up move equals 0.
Or.inl- From a proof of A, deduce A ∨ B.
epstein_remoteness_twenty_nine_mem_level_one_one- The natural number 1 belongs to remoteness level 1.
epstein_remoteness_twenty_nine_mem_level_one_nine- The natural number 9 belongs to remoteness level 1.
epstein_remoteness_of_is_stein_number_level_two_eq- Remoteness level 2 consists of non-zero numbers whose down and up moves both belong to level 1.
epstein_remoteness_twenty_nine_level_three- Remoteness level 3 consists of non-zero numbers with at least one move in level 2 and neither move equal to 0.
epstein_remoteness_twenty_nine_mem_level_two_five- The natural number 5 belongs to remoteness level 2.
epstein_remoteness_twenty_nine_level_four- Remoteness level 4 consists of non-zero numbers whose down and up moves belong to level 1 ∪ level 3, with at least one belonging to level 3.
epstein_remoteness_twenty_nine_mem_level_one_four- The natural number 4 belongs to remoteness level 1.
Or.inr- From a proof of B, deduce A ∨ B.
epstein_remoteness_twenty_nine_mem_level_three_fifty_four- The natural number 54 belongs to remoteness level 3.
epstein_remoteness_twenty_nine_not_mem_level_one_zero- The natural number 0 does not belong to remoteness level 1.
epstein_remoteness_twenty_nine_not_mem_level_one_five- The natural number 5 does not belong to remoteness level 1.
epstein_remoteness_twenty_nine_not_mem_level_one_fifty_four- The natural number 54 does not belong to remoteness level 1.
epstein_remoteness_twenty_nine_not_mem_level_two_four- The natural number 4 does not belong to remoteness level 2.
epstein_remoteness_twenty_nine_not_mem_level_two_fifty_four- The natural number 54 does not belong to remoteness level 2.
epstein_remoteness_twenty_nine_mem_level_four_twenty_nine- The natural number 29 belongs to remoteness level 4.
epstein_remoteness.eq_def- The definition of epstein_remoteness as the minimal level index containing n, or top if none exists.
dif_pos- Dependent if-then-else evaluates to the true branch when the condition holds.
Classical.propDecidable- Every proposition is decidable under classical logic.
Nat.find_spec- Nat.find H satisfies the predicate p.
Nat.find_min'- Nat.find H is less than or equal to any index satisfying p.
False.elim- From a contradiction (False), anything follows.
epstein_remoteness_twenty_nine_not_mem_level_zero_twenty_nine- The natural number 29 does not belong to remoteness level 0.
epstein_remoteness_twenty_nine_not_mem_level_one_twenty_nine- The natural number 29 does not belong to remoteness level 1.
epstein_remoteness_twenty_nine_not_mem_level_two_twenty_nine- The natural number 29 does not belong to remoteness level 2.
epstein_remoteness_twenty_nine_not_mem_level_three_twenty_nine- The natural number 29 does not belong to remoteness level 3.
- Remoteness level membership relies on checking square roots and arithmetic for specific small integers; tactics such as norm_num and omega dispatch these evaluations automatically.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
lemma epstein_remoteness_twenty_nine_level_three : epstein_remoteness_level 3 = {n | n ≠ 0 ∧ (epstein_down n ∈ epstein_remoteness_level 2 ∨ epstein_up n ∈ epstein_remoteness_level 2) ∧ epstein_down n ≠ 0 ∧ epstein_up n ≠ 0} := by have h := epstein_remoteness_level.eq_2 2 rw [h] dsimp ext n simp only [Set.mem_ofPred_eq] constructor · rintro ⟨hn, h2, hj⟩ have h0 := hj 0 (by decide) rw [MulZeroClass.mul_zero, epstein_remoteness_level.eq_1, Set.mem_singleton_iff] at h0 exact ⟨hn, h2, h0.1, h0.2⟩ · rintro ⟨hn, h2, hd0, hu0⟩ refine ⟨hn, h2, fun j hj => ?_⟩ interval_cases j rw [MulZeroClass.mul_zero, epstein_remoteness_level.eq_1, Set.mem_singleton_iff] exact ⟨hd0, hu0⟩lemma epstein_remoteness_twenty_nine_level_four : epstein_remoteness_level 4 = {n | n ≠ 0 ∧ epstein_down n ∈ epstein_remoteness_level 1 ∪ epstein_remoteness_level 3 ∧ epstein_up n ∈ epstein_remoteness_level 1 ∪ epstein_remoteness_level 3 ∧ (epstein_down n ∈ epstein_remoteness_level 3 ∨ epstein_up n ∈ epstein_remoteness_level 3)} := by have h := epstein_remoteness_level.eq_2 3 rw [h] dsimp ext n simp only [Set.mem_iUnion, exists_prop, Set.mem_union, Set.mem_ofPred_eq] constructor · rintro ⟨hn, ⟨j1, hj1, hd⟩, ⟨j2, hj2, hu⟩, h3⟩ refine ⟨hn, ?_, ?_, h3⟩ · interval_cases j1 <;> [left; right] <;> assumption · interval_cases j2 <;> [left; right] <;> assumption · rintro ⟨hn, hd, hu, h3⟩ refine ⟨hn, ?_, ?_, h3⟩ · rcases hd with hd | hd · exact ⟨0, Nat.zero_le 1, hd⟩ · exact ⟨1, le_refl 1, hd⟩ · rcases hu with hu | hu · exact ⟨0, Nat.zero_le 1, hu⟩ · exact ⟨1, le_refl 1, hu⟩lemma epstein_remoteness_twenty_nine_mem_level_one_four : 4 ∈ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]lemma epstein_remoteness_twenty_nine_mem_level_one_one : 1 ∈ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]lemma epstein_remoteness_twenty_nine_mem_level_one_nine : 9 ∈ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] refine ⟨by decide, Or.inl ?_⟩ norm_num [epstein_down]lemma epstein_remoteness_twenty_nine_mem_level_two_five : 5 ∈ epstein_remoteness_level 2 := by rw [epstein_remoteness_of_is_stein_number_level_two_eq] refine ⟨by decide, ?_, ?_⟩ · have : epstein_down 5 = 1 := by norm_num [epstein_down] rw [this] exact epstein_remoteness_twenty_nine_mem_level_one_one · have : epstein_up 5 = 9 := by norm_num [epstein_up] rw [this] exact epstein_remoteness_twenty_nine_mem_level_one_ninelemma epstein_remoteness_twenty_nine_mem_level_three_fifty_four : 54 ∈ epstein_remoteness_level 3 := by rw [epstein_remoteness_twenty_nine_level_three] refine ⟨by decide, Or.inl ?_, ?_, ?_⟩ · have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] exact epstein_remoteness_twenty_nine_mem_level_two_five · intro h have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] at h revert h; decide · intro h have : epstein_up 54 = 103 := by norm_num [epstein_up] rw [this] at h revert h; decidelemma epstein_remoteness_twenty_nine_mem_level_four_twenty_nine : 29 ∈ epstein_remoteness_level 4 := by rw [epstein_remoteness_twenty_nine_level_four] refine ⟨by decide, ?_, ?_, ?_⟩ · have hd : epstein_down 29 = 4 := by norm_num [epstein_down] rw [hd] exact Or.inl epstein_remoteness_twenty_nine_mem_level_one_four · have hu : epstein_up 29 = 54 := by norm_num [epstein_up] rw [hu] exact Or.inr epstein_remoteness_twenty_nine_mem_level_three_fifty_four · have hu : epstein_up 29 = 54 := by norm_num [epstein_up] rw [hu] exact Or.inr epstein_remoteness_twenty_nine_mem_level_three_fifty_fourlemma epstein_remoteness_twenty_nine_not_mem_level_one_zero : 0 ∉ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] simplemma epstein_remoteness_twenty_nine_not_mem_level_one_five : 5 ∉ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 5 = 1 := by norm_num [epstein_down] omega · have : epstein_up 5 = 9 := by norm_num [epstein_up] omegalemma epstein_remoteness_twenty_nine_not_mem_level_one_fifty_four : 54 ∉ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 54 = 5 := by norm_num [epstein_down] omega · have : epstein_up 54 = 103 := by norm_num [epstein_up] omegalemma epstein_remoteness_twenty_nine_not_mem_level_two_four : 4 ∉ epstein_remoteness_level 2 := by rw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, hd, -⟩ have : epstein_down 4 = 0 := by norm_num [epstein_down] rw [this] at hd exact epstein_remoteness_twenty_nine_not_mem_level_one_zero hdlemma epstein_remoteness_twenty_nine_not_mem_level_two_fifty_four : 54 ∉ epstein_remoteness_level 2 := by rw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, hd, -⟩ have : epstein_down 54 = 5 := by norm_num [epstein_down] rw [this] at hd exact epstein_remoteness_twenty_nine_not_mem_level_one_five hdlemma epstein_remoteness_twenty_nine_not_mem_level_zero_twenty_nine : 29 ∉ epstein_remoteness_level 0 := by rw [epstein_remoteness_level.eq_1] simplemma epstein_remoteness_twenty_nine_not_mem_level_one_twenty_nine : 29 ∉ epstein_remoteness_level 1 := by rw [epstein_remoteness_of_is_stein_number_level_one_eq] rintro ⟨-, h | h⟩ · have : epstein_down 29 = 4 := by norm_num [epstein_down] omega · have : epstein_up 29 = 54 := by norm_num [epstein_up] omegalemma epstein_remoteness_twenty_nine_not_mem_level_two_twenty_nine : 29 ∉ epstein_remoteness_level 2 := by rw [epstein_remoteness_of_is_stein_number_level_two_eq] rintro ⟨-, -, hu⟩ have : epstein_up 29 = 54 := by norm_num [epstein_up] rw [this] at hu exact epstein_remoteness_twenty_nine_not_mem_level_one_fifty_four hulemma epstein_remoteness_twenty_nine_not_mem_level_three_twenty_nine : 29 ∉ epstein_remoteness_level 3 := by rw [epstein_remoteness_twenty_nine_level_three] rintro ⟨-, h | h, -, -⟩ · have : epstein_down 29 = 4 := by norm_num [epstein_down] rw [this] at h exact epstein_remoteness_twenty_nine_not_mem_level_two_four h · have : epstein_up 29 = 54 := by norm_num [epstein_up] rw [this] at h exact epstein_remoteness_twenty_nine_not_mem_level_two_fifty_four h/-- The integer 29 has remoteness 4 in Epstein's put-or-take-a-square game. -/theorem epstein_remoteness_twenty_nine : epstein_remoteness 29 = 4 := by classical have hex : ∃ k, 29 ∈ epstein_remoteness_level k := ⟨4, epstein_remoteness_twenty_nine_mem_level_four_twenty_nine⟩ have hstep : epstein_remoteness 29 = (some (Nat.find hex) : WithTop ℕ) := by rw [epstein_remoteness.eq_def] exact @dif_pos (c := ∃ k, 29 ∈ epstein_remoteness_level k) (h := Classical.propDecidable _) hex (α := WithTop ℕ) (t := fun hh => @Option.some ℕ (Nat.find (p := fun k => 29 ∈ epstein_remoteness_level k) hh)) (e := fun _ => ⊤) have hfind : Nat.find hex = 4 := by have hspec : 29 ∈ epstein_remoteness_level (Nat.find hex) := Nat.find_spec hex have hle : Nat.find hex ≤ 4 := Nat.find_min' hex epstein_remoteness_twenty_nine_mem_level_four_twenty_nine interval_cases Nat.find hex · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_zero_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_one_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_two_twenty_nine hspec) · exact False.elim (epstein_remoteness_twenty_nine_not_mem_level_three_twenty_nine hspec) · rfl rw [hstep, hfind] rfl