math / data /lean /OAI /NumberTheory /TwoPoint /Bounds /ActiveStateComparison.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.92 kB
import OAI.NumberTheory.TwoPoint.Bounds.ActiveStateVectors
import OAI.NumberTheory.TwoPoint.Bounds.EventualResidueComparison
namespace OAI
/-! Arbitrary functions of the bounded active sets at the trace vertices
are compared at every finite interval, using their exact state expansion. -/
namespace TwoPointCorrelations
open Finset Filter
theorem BravermanDepth22Input.eventually_active_state_comparison (hBr : BravermanDepth22Input) :
βˆƒ A : β„•, 1000 ≀ A ∧ βˆ€αΆ  L : ℝ in atTop,
βˆ€ (m : β„•) (s : Fin m β†’ β„•) [βˆ€ i, NeZero (s i)],
0 < m β†’ (m : ℝ) ≀ Real.exp L + 1 β†’
Pairwise (fun i j => (s i).Coprime (s j)) β†’
(βˆ€ i, (s i : ℝ) ≀ Real.exp L) β†’
βˆ€ (R n Ninput M : β„•), (n : ℝ) ≀ Real.exp L β†’
(M : ℝ) ≀ 400 * Real.log L β†’ (R : ℝ) ≀ 4 * L β†’
βˆ€ (coord : Fin Ninput β†’ Fin m)
(test : βˆ€ i, ZMod (s (coord i)) β†’ Bool)
(index : Fin R β†’ Fin n β†’ Fin Ninput)
(f : (Fin R β†’ Finset (Fin n)) β†’ ℝ),
(βˆ€ b : Fin R β†’ boundedActiveStates n M,
|f (fun r => (b r).val)| ≀ Real.exp (L ^ 4)) β†’
βˆ€ a N : β„•, Real.exp (L ^ A / 2) ≀ (N : ℝ) β†’
let F := fun z : βˆ€ j, ZMod (s j) =>
let bits := residueCircuitInputs s coord test z
if βˆ€ r, (activeState (fun i => bits (index r i))).card ≀ M
then f (fun r => activeState (fun i => bits (index r i))) else 0
|uniformAverage (fun x : Fin N => F (fun j => (a + x.val : ZMod (s j)))) -
uniformAverage F| ≀ Real.exp (-(L ^ 9)) := by
obtain ⟨A, hA, hscalar⟩ := hBr.eventually_scalar_residue_comparison 1 (by norm_num)
refine ⟨A, hA, ?_⟩
filter_upwards [hscalar, eventually_ge_atTop (4800 : ℝ)] with L hscalar hL
intro m s _ hm hmexp hcop hs R n Ninput M hn hM hR coord test index f hf a N hN
let c := fun b : Fin R β†’ boundedActiveStates n M =>
activeStateVectorCircuit index (fun r => (b r).val)
let coeff := fun b : Fin R β†’ boundedActiveStates n M => f (fun r => (b r).val)
have hb := hscalar m s hm hmexp hcop hs _ Ninput coord test c coeff
(fun b => (activeStateVectorCircuit_depth index _).trans (by norm_num))
(fun b => activeStateVector_size_budget L index _ (by linarith) hn hR)
(by simpa only [one_mul] using activeStateVector_coefficient_budget L f hL hn hM hR hf)
a N hN
have hexpand (z : βˆ€ j, ZMod (s j)) :
(if βˆ€ r, (activeState (fun i => residueCircuitInputs s coord test z (index r i))).card ≀ M
then f (fun r => activeState (fun i => residueCircuitInputs s coord test z (index r i))) else 0) =
βˆ‘ b : Fin R β†’ boundedActiveStates n M, coeff b *
eventIndicator (residueCircuitEvent s coord test (c b)) z :=
activeStateVector_scalar_expansion M index f (residueCircuitInputs s coord test z)
dsimp only
simpa only [← hexpand] using hb
end TwoPointCorrelations
end OAI