math / data /lean /ComparatorChallenges /FiniteCircle.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
10.2 kB
import Mathlib
namespace OAI
namespace FiniteCircle
open scoped BigOperators List
universe u v
inductive EditStep {Ξ± : Type u} : List Ξ± β†’ List Ξ± β†’ Prop
| insert (u v : List Ξ±) (a : Ξ±) : EditStep (u ++ v) (u ++ a :: v)
| delete (u v : List Ξ±) (a : Ξ±) : EditStep (u ++ a :: v) (u ++ v)
| substitute (u v : List Ξ±) (a b : Ξ±) : EditStep (u ++ a :: v) (u ++ b :: v)
inductive EditScript {Ξ± : Type u} : β„• β†’ List Ξ± β†’ List Ξ± β†’ Prop
| nil (x : List Ξ±) : EditScript 0 x x
| cons {n : β„•} {x y z : List Ξ±} :
EditStep x y β†’ EditScript n y z β†’ EditScript (n + 1) x z
noncomputable def editDistance {Ξ± : Type u} (x y : List Ξ±) : β„• :=
sInf {n : β„• | EditScript n x y}
noncomputable def lcs {Ξ± : Type u} (x y : List Ξ±) : β„• :=
sSup {n : β„• | βˆƒ z : List Ξ±, z <+ x ∧ z <+ y ∧ z.length = n}
noncomputable def deficit {Ξ± : Type u} (x y : List Ξ±) : β„• := x.length - lcs x y
abbrev Words (Ξ± : Type u) (d : β„•) := {x : List Ξ± // x.length ≀ d}
abbrev RealL1 := lp (fun _ : β„• => ℝ) 1
noncomputable def distortion {Ξ± : Type u} {X : Type v} (word : X β†’ List Ξ±)
(f : X β†’ RealL1) : ℝ :=
(sSup {r : ℝ | βˆƒ x y : X, x β‰  y ∧
r = β€–f x - f yβ€– / (editDistance (word x) (word y) : ℝ)}) *
(sSup {r : ℝ | βˆƒ x y : X, x β‰  y ∧
r = (editDistance (word x) (word y) : ℝ) / β€–f x - f yβ€–})
noncomputable def optimalDistortion {Ξ± : Type u} {X : Type v}
(word : X β†’ List Ξ±) : ℝ :=
sInf {D | βˆƒ f : X β†’ RealL1, Function.Injective f ∧ D = distortion word f}
noncomputable def E (Ξ± : Type u) (d : β„•) : ℝ :=
optimalDistortion (fun x : Words Ξ± d => x.val)
noncomputable def setDistortion (S : Set (List Bool)) : ℝ :=
optimalDistortion (fun x : S => x.val)
noncomputable def alphabetSupremum (d : β„•) : ℝ :=
sSup {r | βˆƒ A : β„•, 2 ≀ A ∧ r = E (Fin A) d}
noncomputable def exponentScale (d : β„•) : ℝ :=
Real.sqrt (Real.log d * Real.log (Real.log d))
def encode {Ξ± : Type u} {w : β„•} (c : Ξ± β†’ Fin w β†’ Bool) (x : List Ξ±) : List Bool :=
x.flatMap (fun a => List.ofFn (c a))
def interval {Ξ± : Type u} {w : β„•} (c : Ξ± β†’ Fin w β†’ Bool)
(a : Ξ±) (s len : β„•) : List Bool :=
((List.ofFn (c a)).drop s).take len
def OffsetLocal {Ξ± : Type u} {w : β„•} (Ξ΄ : ℝ) (c : Ξ± β†’ Fin w β†’ Bool) : Prop :=
βˆ€ a b : Ξ±, a β‰  b β†’ βˆ€ s t : β„•,
s + w / 8 ≀ w β†’ t + w / 8 ≀ w β†’
(lcs (interval c a s (w / 8)) (interval c b t (w / 8)) : ℝ) ≀
(1 - Ξ΄) * (w / 8 : β„•)
def indexSpan {w : β„•} (is : List (Fin w)) : β„• :=
match is with
| [] => 0
| i :: js => (js.getLastD i).val + 1 - i.val
def AnchorLocal {Ξ± : Type u} {w : β„•} (Ξ΅ : ℝ) (c : Ξ± β†’ Fin w β†’ Bool) : Prop :=
βˆ€ a b : Ξ±, βˆ€ is js : List (Fin w),
is.Pairwise (fun i j => i.val < j.val) β†’
js.Pairwise (fun i j => i.val < j.val) β†’
is.length = js.length β†’ (w : ℝ) / 4 ≀ is.length β†’
(indexSpan is - is.length : β„•) ≀ Ξ΅ * w β†’
(indexSpan js - js.length : β„•) ≀ Ξ΅ * w β†’
(βˆ€ ij ∈ is.zip js, c a ij.1 = c b ij.2) β†’
a = b ∧ βˆƒ i : Fin w, (i, i) ∈ is.zip js
def SubstitutionBounds {Ξ± : Type u} [Fintype Ξ±] {w : β„•}
(a C : ℝ) (c : Ξ± β†’ Fin w β†’ Bool) : Prop :=
0 < w ∧ (w : ℝ) ≀ C * Real.log (2 * Fintype.card Ξ±) ∧
(βˆ€ L : β„•, βˆ€ x y : List Ξ±, x.length = L β†’ y.length = L β†’
a * w * deficit x y ≀ (deficit (encode c x) (encode c y) : ℝ) ∧
deficit (encode c x) (encode c y) ≀ w * deficit x y) ∧
(βˆ€ x y : List Ξ±, editDistance (encode c x) (encode c y) ≀ w * editDistance x y)
def TwoCodes (a C Ξ΄ Ξ΅ : ℝ) : Prop :=
βˆ€ (Ξ± : Type) [Fintype Ξ±], 2 ≀ Fintype.card Ξ± β†’
(βˆƒ (w : β„•) (c : Ξ± β†’ Fin w β†’ Bool),
SubstitutionBounds a C c ∧ OffsetLocal δ c) ∧
(βˆƒ (w : β„•) (c : Ξ± β†’ Fin w β†’ Bool),
SubstitutionBounds a C c ∧ AnchorLocal Ρ c)
def period (h : β„•) (p : β„• β†’ β„• β†’ β„•) (l : β„•) : β„• := ∏ k : Fin h, p l k
def circleSize (h : β„•) (p : β„• β†’ β„• β†’ β„•) : β„• :=
2 * ∏ l : Fin h, period h p (l.val + 1)
def MaskPrimes (h : β„•) (p : β„• β†’ β„• β†’ β„•) : Prop :=
(βˆ€ l k : Fin h, Nat.Prime (p (l.val + 1) k)) ∧
Function.Injective (fun lk : Fin h Γ— Fin h => p (lk.1.val + 1) lk.2) ∧
βˆ€ l k : Fin h, h ^ 3 ≀ p (l.val + 1) k ∧ p (l.val + 1) k ≀ 2 * h ^ 3
def ExcludedPrimes (m : β„•) (p : β„• β†’ β„• β†’ β„•) : Prop :=
(βˆ€ l k : Fin m, Nat.Prime (p (l.val + 1) k)) ∧
Function.Injective (fun lk : Fin m Γ— Fin m => p (lk.1.val + 1) lk.2) ∧
βˆ€ l k : Fin m, m ^ 3 < p (l.val + 1) k ∧ p (l.val + 1) k ≀ m ^ 5
abbrev MaskTag (h : β„•) (p : β„• β†’ β„• β†’ β„•) (l : β„•) := Ξ£ k : Fin h, Fin (p l k)
def maskTags (h : β„•) (p : β„• β†’ β„• β†’ β„•) (l : β„•) : List (MaskTag h p l) :=
(List.ofFn fun k : Fin h => List.ofFn fun b : Fin (p l k) => Sigma.mk k b).flatten
def MaskAlphabet (h : β„•) (p : β„• β†’ β„• β†’ β„•) : β„• β†’ Type
| 0 => Bool
| l + 1 => MaskTag h p (l + 1) Γ— MaskAlphabet h p l
instance maskAlphabetFintype (h : β„•) (p : β„• β†’ β„• β†’ β„•) (l : β„•) :
Fintype (MaskAlphabet h p l) := by
induction l with
| zero => exact inferInstanceAs (Fintype Bool)
| succ l ih => exact @instFintypeProd _ _ inferInstance ih
def MaskState (h : β„•) (p : β„• β†’ β„• β†’ β„•) (M : β„•) : β„• β†’ Type
| 0 => ZMod M
| l + 1 => MaskTag h p (l + 1) β†’ MaskState h p M l
def shiftMaskState (h : β„•) (p : β„• β†’ β„• β†’ β„•) (M : β„•) :
(l : β„•) β†’ MaskState h p M l β†’ ZMod M β†’ MaskState h p M l
| 0, v, ΞΈ => (show ZMod M from v) + ΞΈ
| l + 1, v, ΞΈ => fun j => shiftMaskState h p M l (v j) ΞΈ
def maskGamma (h : β„•) (p : β„• β†’ β„• β†’ β„•) (M l a : β„•)
(j : MaskTag h p l) : ZMod M :=
(βˆ‘ k : Fin h, ((M / p l k * (a % p l k) : β„•) : ZMod M)) +
((j.2.val * (M / p l j.1) * (a % p l j.1) : β„•) : ZMod M)
def maskWord (h : β„•) (p : β„• β†’ β„• β†’ β„•) (R M : β„•) :
(l : β„•) β†’ MaskState h p M l β†’ List (MaskAlphabet h p l)
| 0, v => (List.range M).map (fun b => decide (((b : ZMod M) - (show ZMod M from v)).val < M / 2))
| l + 1, v => (List.range (R * period h p (l + 1))).flatMap fun a =>
(maskTags h p (l + 1)).flatMap fun j =>
(maskWord h p R M l
(shiftMaskState h p M l (v j) (maskGamma h p M (l + 1) a j))).map
(fun x => (j, x))
def ExcludedAlphabet (m L : β„•) : β„• β†’ Type
| 0 => Fin L Γ— Bool
| l + 1 => Fin m Γ— ExcludedAlphabet m L l
instance excludedAlphabetFintype (m L l : β„•) : Fintype (ExcludedAlphabet m L l) := by
induction l with
| zero => exact inferInstanceAs (Fintype (Fin L Γ— Bool))
| succ l ih => exact @instFintypeProd _ _ inferInstance ih
def ExcludedState (m L : β„•) : β„• β†’ Type
| 0 => ZMod L
| l + 1 => Fin m β†’ ExcludedState m L l
def shiftExcludedState (m L : β„•) :
(l : β„•) β†’ ExcludedState m L l β†’ ZMod L β†’ ExcludedState m L l
| 0, v, ΞΈ => (show ZMod L from v) + ΞΈ
| l + 1, v, ΞΈ => fun i => shiftExcludedState m L l (v i) ΞΈ
def excludedTranslation (m : β„•) (p : β„• β†’ β„• β†’ β„•) (L l s : β„•) (i : Fin m) :
ZMod L := βˆ‘ j ∈ Finset.univ.erase i, ((L / p l j * (s % p l j) : β„•) : ZMod L)
def excludedWord (m : β„•) (p : β„• β†’ β„• β†’ β„•) (R L : β„•) :
(l : β„•) β†’ ExcludedState m L l β†’ List (ExcludedAlphabet m L l)
| 0, v => List.ofFn fun b : Fin L =>
(b, decide (((b.val : ZMod L) - (show ZMod L from v)).val < L / 2))
| l + 1, v => (List.range (R * period m p (l + 1))).flatMap fun s =>
(List.ofFn fun i : Fin m =>
(excludedWord m p R L l
(shiftExcludedState m L l (v i) (excludedTranslation m p L (l + 1) s i))).map
(fun x => (i, x))).flatten
def MaskWitness (a C Ξ΄ lower : ℝ) (d : β„•) : Prop :=
βˆƒ h : β„•, 2 ≀ h ∧ βˆƒ p : β„• β†’ β„• β†’ β„•, MaskPrimes h p ∧
βˆƒ (w : β„•) (c : MaskAlphabet h p h β†’ Fin w β†’ Bool),
SubstitutionBounds a C c ∧ OffsetLocal δ c ∧
βˆƒ n : β„•, 0 < n ∧ n ≀ d ∧
(βˆ€ v : MaskState h p (circleSize h p) h,
(encode c (maskWord h p (h ^ (2 * h)) (circleSize h p) h v)).length = n) ∧
Real.exp (lower * exponentScale d) ≀ setDistortion
(Set.range fun v : MaskState h p (circleSize h p) h =>
encode c (maskWord h p (h ^ (2 * h)) (circleSize h p) h v))
def ExcludedWitness (a C Ξ΅ lower : ℝ) (d : β„•) : Prop :=
βˆƒ m : β„•, 2 ≀ m ∧ βˆƒ p : β„• β†’ β„• β†’ β„•, ExcludedPrimes m p ∧
βˆƒ (w : β„•) (c : ExcludedAlphabet m (circleSize m p) m β†’ Fin w β†’ Bool),
SubstitutionBounds a C c ∧ AnchorLocal Ρ c ∧
βˆƒ n : β„•, 0 < n ∧ n ≀ d ∧
(βˆ€ v : ExcludedState m (circleSize m p) m,
(encode c (excludedWord m p (m ^ (2 * m)) (circleSize m p) m v)).length = n) ∧
Real.exp (lower * exponentScale d) ≀ setDistortion
(Set.range fun v : ExcludedState m (circleSize m p) m =>
encode c (excludedWord m p (m ^ (2 * m)) (circleSize m p) m v))
def UniformUpper (C : ℝ) (dβ‚€ : β„•) : Prop :=
βˆ€ (Ξ± : Type) [Fintype Ξ±], 2 ≀ Fintype.card Ξ± β†’ βˆ€ d : β„•, dβ‚€ ≀ d β†’
βˆƒ (M : β„•) (F : Words Ξ± d β†’ Fin M β†’ ℝ), βˆ€ x y : Words Ξ± d,
(editDistance x.val y.val : ℝ) ≀ βˆ‘ i, |F x i - F y i| ∧
(βˆ‘ i, |F x i - F y i|) ≀
Real.exp (C * exponentScale d) * editDistance x.val y.val
def FullMain : Prop :=
βˆƒ c C a Ccode Ξ΄ Ξ΅ : ℝ, βˆƒ dβ‚€ : β„•,
0 < c ∧ 0 < C ∧ 0 < a ∧ 0 < Ccode ∧ 0 < δ ∧ 0 < Ρ ∧
TwoCodes a Ccode Ξ΄ Ξ΅ ∧ UniformUpper C dβ‚€ ∧
(βˆ€ (Ξ± : Type) [Fintype Ξ±], 2 ≀ Fintype.card Ξ± β†’ βˆ€ d : β„•, dβ‚€ ≀ d β†’
Real.exp (c * exponentScale d) ≀ E Ξ± d ∧
E Ξ± d ≀ Real.exp (C * exponentScale d)) ∧
(βˆ€ d : β„•, dβ‚€ ≀ d β†’
MaskWitness a Ccode δ c d ∧ ExcludedWitness a Ccode Ρ c d ∧
Real.exp (c * exponentScale d) ≀ alphabetSupremum d ∧
alphabetSupremum d ≀ Real.exp (C * exponentScale d))
end FiniteCircle
theorem finiteCircle_fullMain : FiniteCircle.FullMain := by
sorry
end OAI