math / data /lean /ComparatorChallenges /GaussianMoat.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.17 kB
import Mathlib
namespace OAI
namespace GaussianMoat
abbrev PrimeVertex := {z : GaussianInt // Irreducible z}
noncomputable def primeGraph (D : ℝ) : SimpleGraph PrimeVertex where
Adj p q := p β‰  q ∧ dist (p.val : β„‚) (q.val : β„‚) ≀ D
symm := by
constructor
intro p q h
exact ⟨h.1.symm, by simpa only [dist_comm] using h.2⟩
loopless := by
constructor
intro p h
exact h.1 rfl
def component (D : ℝ) (p : PrimeVertex) : Set PrimeVertex :=
{q | (primeGraph D).Reachable p q}
def MainEndpoint : Prop :=
βˆ€ (D : ℝ) (z : β„• β†’ GaussianInt),
(βˆ€ t, Irreducible (z t)) β†’ Function.Injective z β†’
(βˆ€ t, dist (z (t + 1) : β„‚) (z t : β„‚) ≀ D) β†’ False
def UniformEndpoint : Prop :=
βˆ€ D : ℝ, βˆƒ B : β„•,
(βˆ€ p : PrimeVertex, (component D p).Finite ∧ (component D p).ncard ≀ B) ∧
(βˆ€ (n : β„•) (z : Fin n β†’ GaussianInt),
(βˆ€ i, Irreducible (z i)) β†’ Function.Injective z β†’
(βˆ€ i j : Fin n, j.val = i.val + 1 β†’ dist (z j : β„‚) (z i : β„‚) ≀ D) β†’
n ≀ B)
theorem fullMain : MainEndpoint ∧ UniformEndpoint := by
sorry
end GaussianMoat
end OAI