math / data /lean /OAI /Computability /MaxCut /Analysis /CubeEquiv.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.21 kB
import Mathlib
import OAI.Computability.MaxCut.Estimates.Dictator
namespace OAI
noncomputable section
namespace OptimalMaxCut.LongCode.InstanceAdapter
open scoped BigOperators
open MaxCutGames.Foundations.Target MaxCutGames.Foundations.Hastad
/-- Fixed binary radix indexing, rather than a chosen `Fintype.equivFin`. -/
def cubeEquiv (q : β„•) : Cube (Fin q) ≃ Fin (2 ^ q) :=
(Equiv.arrowCongr (Equiv.refl (Fin q)) finTwoEquiv.symm).trans finFunctionFinEquiv
/-- Row-major indexing before the explicit finite-field blowup. -/
def vertexEquiv (n q : β„•) : (Fin n Γ— Cube (Fin q)) ≃ Fin (n * 2 ^ q) :=
(Equiv.prodCongr (Equiv.refl (Fin n)) (cubeEquiv q)).trans finProdFinEquiv
noncomputable def output {q : β„•} (g : Instance q) (t : β„š)
(ht : t ∈ Set.Icc (-1 : β„š) 1) (K : β„•) : ScaledGraph :=
(ofInstance g).output t ht (vertexEquiv g.vertices q) K
theorem output_vertex_bound {q : β„•} (g : Instance q) (t : β„š)
(ht : t ∈ Set.Icc (-1 : β„š) 1) (K : β„•) :
(output g t ht K).graph.vertices ≀
(g.vertices * 2 ^ q) * (2 * (K * (g.vertices * 2 ^ q + 1) ^ 2 + 1)) ^ 6 :=
Game.output_vertex_bound _ _ _ _ _
end OptimalMaxCut.LongCode.InstanceAdapter
end
end OAI