Download data/lean/OAI/Dynamics/ConditionalShuffle/HybridCycles.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.38 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Dynamics/ConditionalShuffle/HybridCycles.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Dynamics/ConditionalShuffle/HybridCycles.lean
-
curl -L -o HybridCycles.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Dynamics/ConditionalShuffle/HybridCycles.lean
6.38 kB
| import OAI.Dynamics.ConditionalShuffle.CycleIterate | |
| namespace OAI | |
| noncomputable section | |
| open scoped Classical | |
| namespace Thorp.Conditional.Hybrid | |
| open OverlayEnergy Revealed.Instrument | |
| lemma raw_append (d n m : β) (v : RawState (d+1)) | |
| (s : Fin n β Bool) (r : Fin m β Bool) (a : History (d+1) n) (b : History (d+1) m) : | |
| raw d v (n+m) (Fin.append s r) (Fin.append a b) = raw d (raw d v n s a) m r b := by | |
| induction m with | |
| | zero => | |
| have hr : Fin.append s r = s := by funext i; exact Fin.append_left s r i | |
| have hb : Fin.append a b = a := by funext i; exact Fin.append_left a b i | |
| rw [hr, hb]; rfl | |
| | succ m ih => | |
| obtain β¨β¨q,rβ©,rflβ© := (Fin.snocEquiv (fun _ : Fin (m+1) => Bool)).surjective r | |
| obtain β¨β¨c,bβ©,rflβ© := (Fin.snocEquiv (fun _ : Fin (m+1) => Coins (d+1))).surjective b | |
| erw [Fin.append_snoc, Fin.append_snoc, raw_snoc, raw_snoc, ih] | |
| lemma raw_public (d : β) (v : RawState (d+1)) (t : β) (Ο : History (d+1) t) : | |
| raw d v t (fun _ => false) Ο = rawPermute v (run (d+1) t Ο) := by | |
| induction t with | |
| | zero => rfl | |
| | succ t ih => | |
| change rawPermute (raw d v t (fun _ => false) (Fin.init Ο)) (step (d+1) (Ο (Fin.last t))) = _ | |
| rw [ih, run_succ] | |
| rfl | |
| lemma raw_private (d : β) (v : RawState (d+1)) (t : β) (Ο : History (d+1) t) : | |
| raw d v t (fun _ => true) Ο = rawIterate d v t Ο := by | |
| induction t with | |
| | zero => rfl | |
| | succ t ih => | |
| change rawNext d (raw d v t (fun _ => true) (Fin.init Ο)) (Ο (Fin.last t)) = _ | |
| rw [ih]; rfl | |
| def periodLength (g : β) := (9*(g+3)+200*(g+3))+(g+3) | |
| lemma periodLength_eq (g : β) : periodLength g = 210*(g+3) := by unfold periodLength; omega | |
| def cycleSchedule (g : β) : Fin (periodLength g) β Bool := | |
| Fin.append (Fin.append (fun _ : Fin (9*(g+3)) => false) | |
| (fun _ : Fin (200*(g+3)) => false)) (fun _ : Fin (g+3) => true) | |
| def tripleHistory (Ξ© : Type) (a b c : β) : | |
| (((Fin a β Ξ©) Γ (Fin b β Ξ©)) Γ (Fin c β Ξ©)) β (Fin ((a+b)+c) β Ξ©) := | |
| (Equiv.prodCongr (Fin.appendEquiv a b) (Equiv.refl _)).trans (Fin.appendEquiv (a+b) c) | |
| lemma tripleHistory_apply (Ξ© : Type) (a b c : β) (Ο) : | |
| tripleHistory Ξ© a b c Ο = Fin.append (Fin.append Ο.1.1 Ο.1.2) Ο.2 := rfl | |
| def cycleHistory (g : β) : CycleCoins g β (Fin (periodLength g) β Bits g) := | |
| tripleHistory (Bits g) (9*(g+3)) (200*(g+3)) (g+3) | |
| lemma cycleHistory_apply (g : β) (Ο : CycleCoins g) : | |
| cycleHistory g Ο = Fin.append (Fin.append Ο.1.1 Ο.1.2) Ο.2 := | |
| tripleHistory_apply (Bits g) _ _ _ Ο | |
| lemma raw_cycle (g : β) (v : RawState (g+3)) (Ο : CycleCoins g) : | |
| raw (g+2) v (periodLength g) (cycleSchedule g) (cycleHistory g Ο) = cycle g v Ο := by | |
| rw [cycleHistory_apply] | |
| unfold cycleSchedule | |
| erw [raw_append, raw_append, raw_public, raw_public, raw_private] | |
| rfl | |
| def repeatedSchedule (g n : β) : Fin (periodLength g*n) β Bool := | |
| chunks Bool (periodLength g) n (fun _ => cycleSchedule g) | |
| def repeatedHistory (g n : β) : (Fin n β CycleCoins g) β (Fin (periodLength g*n) β Bits g) := | |
| (Equiv.piCongrRight (fun _ : Fin n => cycleHistory g)).trans (chunks (Bits g) (periodLength g) n) | |
| lemma repeatedHistory_apply (g n : β) (Ο : Fin n β CycleCoins g) : | |
| repeatedHistory g n Ο = chunks (Bits g) (periodLength g) n (fun i => cycleHistory g (Ο i)) := by | |
| rfl | |
| lemma raw_cycles (g : β) (v : RawState (g+3)) (n : β) (Ο : Fin n β CycleCoins g) : | |
| raw (g+2) v (periodLength g*n) (repeatedSchedule g n) (repeatedHistory g n Ο) = cycles g v n Ο := by | |
| induction n with | |
| | zero => rfl | |
| | succ n ih => | |
| obtain β¨β¨c,Οβ©,rflβ© := (Fin.snocEquiv (fun _ : Fin (n+1) => CycleCoins g)).surjective Ο | |
| have hs : (fun _ : Fin (n+1) => cycleSchedule g) = | |
| Fin.snoc (fun _ : Fin n => cycleSchedule g) (cycleSchedule g) := by | |
| funext i; refine Fin.lastCases ?_ (fun j => ?_) i <;> simp | |
| have hh : (fun i : Fin (n+1) => cycleHistory g ((Fin.snoc Ο c : Fin (n+1) β CycleCoins g) i)) = | |
| Fin.snoc (fun i : Fin n => cycleHistory g (Ο i)) (cycleHistory g c) := by | |
| funext i; refine Fin.lastCases ?_ (fun j => ?_) i <;> simp | |
| rw [repeatedHistory_apply, repeatedSchedule] | |
| rw [hs] | |
| change raw (g+2) v _ _ (chunks (Bits g) _ _ | |
| (fun i => cycleHistory g ((Fin.snoc Ο c : Fin (n+1) β CycleCoins g) i))) = _ | |
| rw [hh, chunks_snoc, chunks_snoc] | |
| erw [raw_append] | |
| change raw (g+2) (raw (g+2) v _ (repeatedSchedule g n) (repeatedHistory g n Ο)) | |
| _ (cycleSchedule g) (cycleHistory g c) = _ | |
| rw [ih, raw_cycle] | |
| simp only [cycles, Fin.snocEquiv, Equiv.coe_fn_mk, Fin.init_snoc, Fin.snoc_last] | |
| lemma repeated_energy (g : β) (v : RawState (g+3)) | |
| (hw : β x, v.free x = false β v.weight x = 0) (hz : β x, v.weight x = 0) | |
| (hf : Fintype.card (Position (g+3)) β€ 64 * freeCount v.free) | |
| (hk : freeCount v.free β€ 2^g) | |
| (hs : 256*(g+4) β€ Fintype.card (Position (g+3))) (n : β) : | |
| energy (g+2) v (periodLength g*n) (repeatedSchedule g n) β€ rawEnergy v * OverlayEnergy.coefficient g^n := by | |
| have hh := mean_equiv (repeatedHistory g n) | |
| (fun Ο : History (g+3) (periodLength g*n) => | |
| rawEnergy (raw (g+2) v (periodLength g*n) (repeatedSchedule g n) Ο)) | |
| change mean (fun Ο : Fin n β CycleCoins g => | |
| rawEnergy (raw (g+2) v _ (repeatedSchedule g n) (repeatedHistory g n Ο))) = _ at hh | |
| simp only [raw_cycles] at hh | |
| change mean (fun Ο : History (g+3) (periodLength g*n) => _) β€ _ | |
| have hi := cycles_expected_energy g v hw hz hf hk hs n | |
| exact (mean_fintype_irrel _ _ _).le.trans (hh.symm.le.trans hi) | |
| lemma repeated_point_energy (g : β) (B : Position (g+3) β Bool) (tag) (ht : B tag = true) | |
| (hf : Fintype.card (Position (g+3)) β€ 64*freeCount B) (hk : freeCount B β€ 2^g) | |
| (hs : 256*(g+4) β€ Fintype.card (Position (g+3))) (n : β) : | |
| energy (g+2) (initialState (g+3) B tag ht).raw (periodLength g*n) (repeatedSchedule g n) β€ | |
| OverlayEnergy.coefficient g^n := by | |
| have hh := repeated_energy g (initialState (g+3) B tag ht).raw | |
| (initialState (g+3) B tag ht).supported (initialState (g+3) B tag ht).mass_zero hf hk hs n | |
| exact hh.trans (mul_le_of_le_one_left (pow_nonneg (coefficient_nonneg g) n) | |
| (initialState (g+3) B tag ht).energy_le_one) | |
| end Thorp.Conditional.Hybrid | |
| end | |
| end OAI | |