wip

GoldbachTm.lean

@@ -4,6 +4,9 @@ import GoldbachTm.Basic
 import GoldbachTm.Format
 import GoldbachTm.ListBlank
 import GoldbachTm.Tm27.TuringMachine27
+import GoldbachTm.Tm27.Search0
+import GoldbachTm.Tm27.Content
+
 import GoldbachTm.Tm31.TuringMachine31
 import GoldbachTm.Tm31.Search0
 import GoldbachTm.Tm31.Content

GoldbachTm/Tm27/Content.lean

@@ -0,0 +1,3 @@
+import GoldbachTm.Tm27.TuringMachine27
+import GoldbachTm.Tm27.Search0
+import Mathlib.Data.Nat.Prime.Defs

GoldbachTm/Tm27/Search0.lean

@@ -0,0 +1,105 @@
+-- theorem of recursive states
+-- all these states' usage is to search 0
+import GoldbachTm.Tm27.TuringMachine27
+
+namespace Tm27
+
+-- left
+theorem rec17 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨17, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero l), Turing.ListBlank.mk r⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨17, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ r)⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) l (List.cons Γ.one r)
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec19 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨19, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero l), Turing.ListBlank.mk r⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨19, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ r)⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) l (List.cons Γ.one r)
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec21 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨21, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero l), Turing.ListBlank.mk r⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨21, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ r)⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) l (List.cons Γ.one r)
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec24 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨24, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero l), Turing.ListBlank.mk r⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨24, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ r)⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) l (List.cons Γ.one r)
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+--right
+theorem rec11 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨11, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero r) ⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨11, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ l), Turing.ListBlank.mk r⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) (List.cons Γ.one l) r
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec20 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨20, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero r) ⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨20, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ l), Turing.ListBlank.mk r⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) (List.cons Γ.one l) r
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec23 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨23, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero r) ⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨23, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ l), Turing.ListBlank.mk r⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) (List.cons Γ.one l) r
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+theorem rec26 (k : ℕ): ∀ (i : ℕ) (l r : List Γ),
+nth_cfg i = some ⟨⟨26, by omega⟩, ⟨Γ.one, Turing.ListBlank.mk l, Turing.ListBlank.mk (List.replicate k Γ.one ++ List.cons Γ.zero r) ⟩⟩ →
+nth_cfg (i + k + 1) = some ⟨⟨26, by omega⟩, ⟨Γ.zero, Turing.ListBlank.mk (List.replicate (k+1) Γ.one ++ l), Turing.ListBlank.mk r⟩⟩ := by
+induction k with intros i l r h
+| zero => simp [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+| succ k => rename_i induction_step
+            specialize induction_step (i+1) (List.cons Γ.one l) r
+            have g : i + (k+1) +1 = i + 1 + k + 1 := by omega
+            rw [g, induction_step]
+            . simp [List.replicate_succ' (k+1)]
+            . simp! [nth_cfg, h, step, machine, Turing.Tape.write, Turing.Tape.move]
+
+end Tm27

GoldbachTm/Tm27/TuringMachine27.lean

@@ -1,5 +1,6 @@
 -- inspired by https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Computability/TuringMachine.lean
 import Mathlib.Computability.TuringMachine
+import Mathlib.Data.Real.Sqrt
 import GoldbachTm.Basic
 import GoldbachTm.Format
 import GoldbachTm.ListBlank
@@ -91,4 +92,22 @@ def machine : Machine
 | ⟨26, _⟩, Γ.one  => some ⟨⟨26, by omega⟩, ⟨Turing.Dir.right, Γ.one⟩⟩
 | ⟨_+27, _⟩, _ => by omega -- https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Pattern.20matching.20on.20Fin.20isn't.20exhaustive.20for.20large.20matches/near/428048252
 
+def nth_cfg : (n : Nat) -> Option Cfg
+| 0 => init []
+| Nat.succ n => match (nth_cfg n) with
+                | none => none
+                | some cfg =>  step machine cfg
+
+
+-- g1 = g2
+macro "forward" g1:ident g2:Lean.binderIdent i:term: tactic => `(tactic| (
+have h : nth_cfg ($i + 1) = nth_cfg ($i + 1) := rfl
+nth_rewrite 2 [nth_cfg] at h
+simp [*, step, Option.map, machine, Turing.Tape.write, Turing.Tape.move] at h
+try simp! [*, -nth_cfg] at h
+try ring_nf at h
+clear $g1
+rename_i $g2
+))
+
 end Tm27