Download data/lean/OAI/Computability/PerfectCompleteness/Decoding/LowerCutScalar.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.92 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Decoding/LowerCutScalar.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/PerfectCompleteness/Decoding/LowerCutScalar.lean
-
curl -L -o LowerCutScalar.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Decoding/LowerCutScalar.lean
4.92 kB
| import OAI.Computability.PerfectCompleteness.Sampling.CutSamplerKeyLocalityLemmas | |
| namespace OAI | |
| section | |
| namespace PerfectCompleteness.LowerCutScalar | |
| open RecursiveSpaces DescendantSpaces RecursiveSampler TerminalCalls | |
| noncomputable section | |
| universe u w | |
| variable {branch : Nat β Nat} {n m : Nat} | |
| abbrev Values (π : Type w) [Field π] (repeats : Nat β Nat) | |
| (p : Path branch n (m + 1)) (A : Slots branch n β Type u) := | |
| TerminalIndex repeats p β space π branch (m + 1) (p.family A) | |
| def reconstruct (π : Type w) [Field π] (repeats : Nat β Nat) : | |
| {n m : Nat} β (p : Path branch n (m + 1)) β (A : Slots branch n β Type u) β | |
| Values π repeats p A β CutTerminalSplit.ExteriorTape π repeats p A β | |
| space π branch n A | |
| | _, _, .refl _, _, values, _ => values () | |
| | n + 1, _, .step i p, A, values, exterior => | |
| RecursiveSampler.combine π A i (repeats (n + 1)) | |
| (fun j => exterior β¨.inl j, not_isTerminal_ordinary repeats i p jβ©) | |
| (fun h => reconstruct π repeats p (childFamily A i) | |
| (fun terminal => values ((h, false), terminal)) | |
| (CutSamplerReplayGrouping.subExterior π repeats i p A (h, false) exterior)) | |
| (fun h => reconstruct π repeats p (childFamily A i) | |
| (fun terminal => values ((h, true), terminal)) | |
| (CutSamplerReplayGrouping.subExterior π repeats i p A (h, true) exterior)) | |
| @[simp] theorem reconstruct_refl (π : Type w) [Field π] (repeats : Nat β Nat) | |
| (A : Slots branch (m + 1) β Type u) | |
| (values : Values π repeats (.refl (m + 1)) A) | |
| (exterior : CutTerminalSplit.ExteriorTape π repeats (.refl (m + 1)) A) : | |
| reconstruct π repeats (.refl (m + 1)) A values exterior = values () := rfl | |
| theorem reconstruct_step (π : Type w) [Field π] (repeats : Nat β Nat) | |
| (i : Fin (branch n)) (p : Path branch n (m + 1)) | |
| (A : Slots branch (n + 1) β Type u) | |
| (values : Values π repeats (.step i p) A) | |
| (exterior : CutTerminalSplit.ExteriorTape π repeats (.step i p) A) : | |
| reconstruct π repeats (.step i p) A values exterior = | |
| RecursiveSampler.combine π A i (repeats (n + 1)) | |
| (fun j => exterior β¨.inl j, not_isTerminal_ordinary repeats i p jβ©) | |
| (fun h => reconstruct π repeats p (childFamily A i) | |
| (fun terminal => values ((h, false), terminal)) | |
| (CutSamplerReplayGrouping.subExterior π repeats i p A (h, false) exterior)) | |
| (fun h => reconstruct π repeats p (childFamily A i) | |
| (fun terminal => values ((h, true), terminal)) | |
| (CutSamplerReplayGrouping.subExterior π repeats i p A (h, true) exterior)) := rfl | |
| theorem reconstruct_splitTape (π : Type w) [Field π] | |
| (repeats : Nat β Nat) (p : Path branch n (m + 1)) : | |
| β (A : Slots branch n β Type u) | |
| (tape : CutSamplerRefinement.Tape π repeats p A), | |
| reconstruct π repeats p A | |
| (fun terminal => UniformChildSum.recursiveSum (p.family A) | |
| ((CutTerminalSplit.splitTape π repeats p A tape).1 terminal)) | |
| (CutTerminalSplit.splitTape π repeats p A tape).2 = | |
| CutSamplerRefinement.evaluate π repeats p A tape := by | |
| induction n generalizing m with | |
| | zero => | |
| have h := p.height_le | |
| omega | |
| | succ n ih => | |
| cases p with | |
| | refl => | |
| intro A tape | |
| rfl | |
| | step i p => | |
| intro A tape | |
| rw [reconstruct_step, CutSamplerLocality.evaluate_step] | |
| apply congrArgβ (RecursiveSampler.combine π A i (repeats (n + 1)) | |
| (fun j => tape (.inl j))) | |
| Β· funext h | |
| rw [CutSamplerReplayGrouping.subExterior_splitTape] | |
| simp_rw [CutTerminalZero.splitTape_terminal_step] | |
| exact ih p (childFamily A i) | |
| (CutSamplerLocality.subTape π repeats i p A tape h false) | |
| Β· funext h | |
| rw [CutSamplerReplayGrouping.subExterior_splitTape] | |
| simp_rw [CutTerminalZero.splitTape_terminal_step] | |
| exact ih p (childFamily A i) | |
| (CutSamplerLocality.subTape π repeats i p A tape h true) | |
| theorem reconstruct_join (π : Type w) [Field π] (repeats : Nat β Nat) | |
| (p : Path branch n (m + 1)) (A : Slots branch n β Type u) | |
| (terminal : CutTerminalSplit.TerminalTape π repeats p A) | |
| (exterior : CutTerminalSplit.ExteriorTape π repeats p A) : | |
| reconstruct π repeats p A | |
| (fun call => UniformChildSum.recursiveSum (p.family A) (terminal call)) exterior = | |
| CutSamplerRefinement.evaluate π repeats p A | |
| ((CutTerminalSplit.splitTape π repeats p A).symm (terminal, exterior)) := by | |
| simpa only [Equiv.apply_symm_apply] using | |
| reconstruct_splitTape π repeats p A | |
| ((CutTerminalSplit.splitTape π repeats p A).symm (terminal, exterior)) | |
| end | |
| end PerfectCompleteness.LowerCutScalar | |
| end | |
| end OAI | |