math / data /lean /OAI /Geometry /HeilbronnTriangle /ConditionalSmith.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.39 kB
import OAI.Geometry.HeilbronnTriangle.ConditionalMatrix
import OAI.Geometry.HeilbronnTriangle.MinorInvariant
import OAI.Geometry.HeilbronnTriangle.RepeatedLabels
namespace OAI
namespace Problem355.ConditionalMatrix
open scoped BigOperators
theorem arrayMatrix_map {X : Type*} {B k j : β„•} (hjk : j ≀ k)
(digit : Fin 3 β†’ Fin 3 β†’ Fin k β†’ X β†’ Fin B)
(f : Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) :
(arrayMatrix digit f k).map (ZMod.castHom (Nat.pow_dvd_pow B hjk) (ZMod (B ^ j))) =
arrayMatrix digit f j := by
ext a c
simp only [Matrix.map_apply, arrayMatrix, map_natCast]
theorem array_moment_le_two_of_diagonal {X : Type*} [Fintype X] [Nonempty X]
{B k : β„•} (hB : B.Prime) (hk : 0 < k)
(digit : Fin 3 β†’ Fin 3 β†’ Fin k β†’ X β†’ Fin B)
(hinj : βˆ€ a c v, Function.Injective (digit a c v))
(hpos : βˆ€ a c v x, 0 < (digit a c v x).val)
(b e : (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) β†’ β„•)
(hbe : βˆ€ f, b f ≀ e f) (hek : βˆ€ f, e f ≀ k)
(P Q : (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) β†’
Matrix.GeneralLinearGroup (Fin 3) (ZMod (B ^ k)))
(hdiag : βˆ€ f, arrayMatrix digit f k =
(P f : Matrix (Fin 3) (Fin 3) (ZMod (B ^ k))) *
Matrix.diagonal ![1, ((B ^ b f : β„•) : ZMod (B ^ k)),
((B ^ e f : β„•) : ZMod (B ^ k))] *
(Q f : Matrix (Fin 3) (Fin 3) (ZMod (B ^ k))))
(hsmall : (B : ℝ) * (1 / (Fintype.card X : ℝ)) ^ 4 ≀ 1 / 2) :
(βˆ‘ f : Fin 3 β†’ Fin 3 β†’ Fin k β†’ X,
(1 / (Fintype.card (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) : ℝ)) * (B : ℝ) ^ b f) ≀ 2 := by
apply array_moment_le_two hB hk digit hinj hpos b
(fun f => (hbe f).trans (hek f)) _ hsmall
intro j hjpos hj f hbf
have h := (UnitPivot.minorsVanish_reduce_prime_power_iff hB (hbe f) hj
(P f) (Q f) (arrayMatrix digit f k) (hdiag f)).mpr hbf
simpa only [arrayMatrix_map hj] using h
theorem collision_moment_le_six_div {Ξ› X : Type*}
[Fintype Ξ›] [DecidableEq Ξ›] [Nonempty Ξ›] [Fintype X] [Nonempty X]
{B k : β„•} (hB : B.Prime) (hk : 0 < k)
(digit : Ξ› β†’ Ξ› β†’ Ξ› β†’ Fin 3 β†’ Fin 3 β†’ Fin k β†’ X β†’ Fin B)
(hinj : βˆ€ a b c i l v, Function.Injective (digit a b c i l v))
(hpos : βˆ€ a b c i l v x, 0 < (digit a b c i l v x).val)
(val : Ξ› β†’ Ξ› β†’ Ξ› β†’ (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) β†’ β„•)
(hval : βˆ€ a b c f, val a b c f ≀ k)
(hminor : βˆ€ a b c j, 1 ≀ j β†’ j ≀ k β†’ βˆ€ f, j ≀ val a b c f β†’
UnitPivot.MinorsVanish (arrayMatrix (digit a b c) f j))
(hsmall : (B : ℝ) * (1 / (Fintype.card X : ℝ)) ^ 4 ≀ 1 / 2) :
(βˆ‘ a : Ξ›, βˆ‘ b : Ξ›, βˆ‘ c : Ξ›, βˆ‘ f : Fin 3 β†’ Fin 3 β†’ Fin k β†’ X,
(1 / (Fintype.card (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) : ℝ)) *
(if a = b ∨ a = c ∨ b = c then (B : ℝ) ^ val a b c f else 0)) /
(Fintype.card Ξ› : ℝ) ^ 3 ≀ 6 / (Fintype.card Ξ› : ℝ) := by
have h := Sampling.conditional_collision_moment_le
(Ξ± := Ξ›) (Ξ© := Fin 3 β†’ Fin 3 β†’ Fin k β†’ X)
(fun _ _ _ _ => 1 / (Fintype.card (Fin 3 β†’ Fin 3 β†’ Fin k β†’ X) : ℝ))
(fun a b c f => (B : ℝ) ^ val a b c f) 2 (by norm_num)
(fun a b c => array_moment_le_two hB hk (digit a b c) (hinj a b c)
(hpos a b c) (val a b c) (hval a b c) (hminor a b c) hsmall)
norm_num only [show (3 : ℝ) * 2 = 6 by norm_num] at h
exact h
end Problem355.ConditionalMatrix
end OAI