math / data /lean /OAI /Computability /MinUncut /Search /SampleEnumeration.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.07 kB
import Mathlib
import OAI.Computability.MinUncut.Search.FiniteEnumeration
import OAI.Computability.MinUncut.Estimates.WeightedTestLaw
import OAI.Computability.MinUncut.Encoding.QuestionEncoding
namespace OAI
section
namespace MinUncut.Outer
open MinUncut.Inner MinUncut.FiniteGaussian MinUncut.FiniteProof OuterSmoothness
open MinUncutGames.Foundations.Hastad.SourceOccurrences
namespace SampleEnumeration
def fin (n : β„•) : Enumeration (Fin n) := Enumeration.ofEncoding (Encoding.fin n)
def field : Enumeration Fβ‚‚ := Enumeration.ofEncoding fieldEncoding
def point (m n : β„•) : Enumeration (Point m n) := (fin m).function (fin n)
def row (m n : β„•) : Enumeration (Row m n) :=
(fin m).sigma (fun i => ((fin m).subtype (fun j => j≠i)).function (fin n))
local instance codeEq (m n : β„•) : DecidableEq (Code m n) :=
Subtype.instDecidableEq
def code (m n : β„•) : Enumeration (Code m n) :=
((row m n).function field).image (faceSum m n).rangeRestrict (by
intro z
obtain ⟨f,hf⟩ := z.property
exact ⟨f,Subtype.ext hf⟩)
local instance codeType (m n : β„•) : Fintype (Code m n) :=
Fintype.ofList (code m n).values (code m n).complete
abbrev Slots {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) :=
Ξ£ j, Fin (secondSlotCount (Q j))
def slots {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) : Enumeration (Slots Q) :=
(fin t).sigma (fun j => fin (secondSlotCount (Q j)))
def formsPiEquiv (A : Type) [Fintype A] [DecidableEq A] :
Forms (A β†’ Fβ‚‚) ≃ Fβ‚‚ Γ— (A β†’ Fβ‚‚) :=
(AffineMap.toConstProdLinearMap Fβ‚‚).toEquiv.trans
(Equiv.prodCongr (Equiv.refl Fβ‚‚) (LinearEquiv.piRing Fβ‚‚ Fβ‚‚ A Fβ‚‚).toEquiv)
def formsCurryEquiv (A : Type) (B : A β†’ Type) :
Forms (βˆ€a, B a β†’ Fβ‚‚) ≃ Forms ((Ξ£a, B a) β†’ Fβ‚‚) :=
AffineEquiv.arrowCongrEquiv
(LinearEquiv.piCurry Fβ‚‚ (fun (_ : A) (_ : B _) => Fβ‚‚)).symm.toAffineEquiv
(AffineEquiv.refl Fβ‚‚ Fβ‚‚)
def formsEquiv {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) :
Forms (SecondAlphabet Q) ≃ Fβ‚‚ Γ— (Slots Q β†’ Fβ‚‚) :=
(formsCurryEquiv (Fin t) (fun j => Fin (secondSlotCount (Q j)))).trans (formsPiEquiv (Slots Q))
local instance formEq {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) :
DecidableEq (Forms (SecondAlphabet Q)) :=
fun f g => decidable_of_iff (formsEquiv Q f=formsEquiv Q g) (formsEquiv Q).injective.eq_iff
def forms {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) : Enumeration (Forms (SecondAlphabet Q)) :=
(field.pair ((slots Q).function field)).image (formsEquiv Q).symm (formsEquiv Q).symm.surjective
def arrays {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) (m n : β„•) :
Enumeration (FaceArray (SecondAlphabet Q) m n) := (row m n).function (forms Q)
def coordinates (m n : β„•) : Enumeration (TestCoordinates m n) :=
Enumeration.ofEncoding ((point m n).encoding.sum ((point m n).encoding.sum (code m n).encoding))
def localSample {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) (m n : β„•) (g : GridData) :
Enumeration (LocalSample (SecondAlphabet Q) m n g) := by
letI : DecidableEq (Forms (SecondAlphabet Q)) := formEq Q
letI : DecidableEq (FaceArray (SecondAlphabet Q) m n) := inferInstanceAs (DecidableEq (Row m n β†’ Forms (SecondAlphabet Q)))
exact (arrays Q m n).pair ((arrays Q m n).pair ((code m n).pair ((coordinates m n).function (fin g.L))))
def finsets (t : β„•) : Enumeration (Finset (Fin t)) :=
((fin t).function (Enumeration.ofEncoding Encoding.bool)).image
(fun f => Finset.univ.filter (fun j => f j=true)) (by
intro S
refine ⟨fun j => decide (j∈S),?_⟩
ext j
simp)
def fixedSets (t k : β„•) : Enumeration (FixedSets (Fin t) k) :=
(finsets t).subtype (fun H => H.card=k)
def outerSample (t s k : β„•) : Enumeration (OuterSample (Fin t) (Fin s) k) :=
(fixedSets t k).pair (((fin t).function (fin s)).pair ((fin t).function (fin 3)))
local instance localEq {N t : β„•} (Q : Fin t β†’ SecondQuestion (Fin N)) (m n : β„•) (g : GridData) :
DecidableEq (LocalSample (SecondAlphabet Q) m n g) := by
letI : DecidableEq (Forms (SecondAlphabet Q)) := formEq Q
letI : DecidableEq (FaceArray (SecondAlphabet Q) m n) :=
inferInstanceAs (DecidableEq (Row m n β†’ Forms (SecondAlphabet Q)))
exact fun f h => decidable_of_iff
(f.1=h.1 ∧ f.2.1=h.2.1 ∧ f.2.2.1=h.2.2.1 ∧ f.2.2.2=h.2.2.2)
(by constructor <;> intro he <;> aesop)
def second {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) {k : β„•}
(o : OuterSample (Fin t) (Fin s) k) : Fin t β†’ SecondQuestion (Fin N) :=
fun j => if j∈o.1.val then Sum.inl ((eqs (o.2.1 j)).names (o.2.2 j)) else Sum.inr (eqs (o.2.1 j))
lemma second_eq {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) {k : β„•}
(o : OuterSample (Fin t) (Fin s) k) : second eqs o=sampleSecond eqs o := by
funext j
simp [second,sampleSecond,secondQuestion,sampleFirst,sampleHidden,hiddenSet,slotQuestion]
def semanticLocal {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) {k : β„•}
(o : OuterSample (Fin t) (Fin s) k) (m n : β„•) (g : GridData) :
Enumeration (LocalSample (SecondAlphabet (sampleSecond eqs o)) m n g) :=
(second_eq eqs o) β–Έ localSample (second eqs o) m n g
local instance semanticLocalEq {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) {k : β„•}
(o : OuterSample (Fin t) (Fin s) k) (m n : β„•) (g : GridData) :
DecidableEq (LocalSample (SecondAlphabet (sampleSecond eqs o)) m n g) :=
(second_eq eqs o) β–Έ localEq (second eqs o) m n g
def elementary {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) (k m n : β„•) (g : GridData) :
Enumeration (Elementary (I := Fin t) eqs k m n g) :=
(outerSample t s k).sigma (fun o => semanticLocal eqs o m n g)
def tests : Enumeration Test :=
Enumeration.ofList [.first,.second,.third,.fourth] (by intro j; cases j <;> simp)
def all {N s t : β„•} (eqs : Fin s β†’ Equation (Fin N)) (k m n : β„•) (g : GridData) :
Enumeration (Test Γ— Elementary (I := Fin t) eqs k m n g) :=
tests.pair (elementary eqs k m n g)
end SampleEnumeration
end MinUncut.Outer
end
end OAI