File size: 1,166 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 | 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
|