introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.76 kB
import Mathlib.Logic.Equiv.Prod
import OAI.Computability.PerfectCompleteness.Construction.HiddenBucketBias
import OAI.Computability.PerfectCompleteness.Foundations.TerminalCalls
import OAI.Computability.PerfectCompleteness.Sampling.CutSamplerRefinement
import OAI.Computability.UniqueGames.Foundations.SamplingLemmas
namespace OAI
section
namespace PerfectCompleteness.CutTerminalSplit
open PointwiseSpaces RecursiveSpaces DescendantSpaces RecursiveSampler TerminalCalls
open UniqueGamesTheorem.Foundations.Games
open scoped Classical
noncomputable section
universe u w
variable {branch : Nat β†’ Nat} {n m : Nat}
theorem refinedSpace_eq_terminal (π•œ : Type w) [Field π•œ]
(repeats : Nat β†’ Nat) (p : Path branch n m) :
βˆ€ (A : Slots branch n β†’ Type u) (terminal : TerminalIndex repeats p),
CutSamplerRefinement.RefinedSpace π•œ repeats p A (drawIndex repeats p terminal) =
CutSamplerRefinement.RefinedSpace π•œ repeats (.refl m) (p.family A) () := by
induction p with
| refl n =>
intro A terminal
cases terminal
rfl
| step i p ih =>
intro A terminal
exact ih (childFamily A i) terminal.2
variable (π•œ : Type w) [Field π•œ] (repeats : Nat β†’ Nat)
(p : Path branch n (m + 1)) (A : Slots branch n β†’ Type u)
abbrev TerminalFactor :=
(i : Fin (branch m)) β†’ squareSpace (space π•œ branch m (childFamily (p.family A) i))
abbrev TerminalTape := TerminalIndex repeats p β†’ TerminalFactor π•œ p A
abbrev ExteriorIndex := {j : DrawIndex repeats p // Β¬ IsTerminal repeats p j}
abbrev ExteriorTape :=
(j : ExteriorIndex repeats p) β†’ CutSamplerRefinement.RefinedSpace π•œ repeats p A j.val
def terminalFactorEquiv (terminal : TerminalIndex repeats p) :
CutSamplerRefinement.RefinedSpace π•œ repeats p A (drawIndex repeats p terminal) ≃
TerminalFactor π•œ p A :=
Equiv.cast (refinedSpace_eq_terminal π•œ repeats p A terminal)
def terminalTapeEquiv :
((j : {j : DrawIndex repeats p // IsTerminal repeats p j}) β†’
CutSamplerRefinement.RefinedSpace π•œ repeats p A j.val) ≃
TerminalTape π•œ repeats p A :=
((Equiv.piCongrLeft
(fun j : {j : DrawIndex repeats p // IsTerminal repeats p j} =>
CutSamplerRefinement.RefinedSpace π•œ repeats p A j.val)
(terminalSubtypeEquiv repeats p)).symm).trans
(Equiv.piCongrRight (terminalFactorEquiv π•œ repeats p A))
def splitTape :
CutSamplerRefinement.Tape π•œ repeats p A ≃
TerminalTape π•œ repeats p A Γ— ExteriorTape π•œ repeats p A :=
(Equiv.piEquivPiSubtypeProd (IsTerminal repeats p)
(CutSamplerRefinement.RefinedSpace π•œ repeats p A)).trans
(Equiv.prodCongr (terminalTapeEquiv π•œ repeats p A) (Equiv.refl _))
@[simp] theorem splitTape_terminal_apply
(x : CutSamplerRefinement.Tape π•œ repeats p A) (terminal : TerminalIndex repeats p) :
(splitTape π•œ repeats p A x).1 terminal =
terminalFactorEquiv π•œ repeats p A terminal (x (drawIndex repeats p terminal)) := rfl
@[simp] theorem splitTape_exterior_apply
(x : CutSamplerRefinement.Tape π•œ repeats p A) (j : ExteriorIndex repeats p) :
(splitTape π•œ repeats p A x).2 j = x j.val := rfl
variable [Finite π•œ] [βˆ€ s, Finite (A s)]
instance childSquareFintype (i : Fin (branch m)) :
Fintype (squareSpace (space π•œ branch m (childFamily (p.family A) i))) :=
Fintype.ofFinite _
def terminalLaw : FiniteDistribution (TerminalTape π•œ repeats p A) :=
FiniteProduct.law (fun _ : TerminalIndex repeats p =>
FiniteProduct.law (fun i : Fin (branch m) =>
FiniteDistribution.uniform
(squareSpace (space π•œ branch m (childFamily (p.family A) i)))))
def exteriorLaw : FiniteDistribution (ExteriorTape π•œ repeats p A) :=
FiniteProduct.law (fun j : ExteriorIndex repeats p =>
FiniteDistribution.uniform (CutSamplerRefinement.RefinedSpace π•œ repeats p A j.val))
theorem terminalLaw_uniform :
terminalLaw π•œ repeats p A = FiniteDistribution.uniform (TerminalTape π•œ repeats p A) := by
simp only [terminalLaw, UniformLinearImage.law_uniform]
theorem exteriorLaw_uniform :
exteriorLaw π•œ repeats p A = FiniteDistribution.uniform (ExteriorTape π•œ repeats p A) :=
UniformLinearImage.law_uniform
theorem split_tapeLaw :
(CutSamplerRefinement.tapeLaw π•œ repeats p A).pushforward (splitTape π•œ repeats p A) =
(terminalLaw π•œ repeats p A).product (exteriorLaw π•œ repeats p A) := by
unfold CutSamplerRefinement.tapeLaw
rw [UniformLinearImage.law_uniform, FiniteDistribution.pushforward_equiv,
terminalLaw_uniform, exteriorLaw_uniform]
apply FiniteDistribution.eq_of_weight_eq
intro x
change 1 / (Fintype.card (CutSamplerRefinement.Tape π•œ repeats p A) : ℝ) =
(1 / (Fintype.card (TerminalTape π•œ repeats p A) : ℝ)) *
(1 / (Fintype.card (ExteriorTape π•œ repeats p A) : ℝ))
rw [Fintype.card_congr (splitTape π•œ repeats p A), Fintype.card_prod]
simp only [Nat.cast_mul, one_div, mul_inv]
theorem terminal_marginal :
(CutSamplerRefinement.tapeLaw π•œ repeats p A).pushforward
(fun x => (splitTape π•œ repeats p A x).1) = terminalLaw π•œ repeats p A := by
rw [← FiniteDistribution.pushforward_comp (CutSamplerRefinement.tapeLaw π•œ repeats p A)
(splitTape π•œ repeats p A) Prod.fst, split_tapeLaw]
exact HiddenBucketBias.product_fst
(terminalLaw π•œ repeats p A) (exteriorLaw π•œ repeats p A)
theorem terminal_marginal_uniform :
(CutSamplerRefinement.tapeLaw π•œ repeats p A).pushforward
(fun x => (splitTape π•œ repeats p A x).1) =
FiniteDistribution.uniform (TerminalTape π•œ repeats p A) := by
rw [terminal_marginal, terminalLaw_uniform]
end
end PerfectCompleteness.CutTerminalSplit
end
end OAI