Download data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchTransitions.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.82 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchTransitions.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchTransitions.lean
-
curl -L -o BranchTransitions.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/BranchTransitions.lean
6.82 kB
| import OAI.MeasureTheory.Falconer.Angular.AngularNearProgress | |
| import OAI.MeasureTheory.Falconer.Recursion.BranchRepresentativeCharges | |
| namespace OAI | |
| namespace PlanarFalconer | |
| inductive BranchState where | |
| | D (a t i : β) | |
| | H (aβ tβ a t i : β) | |
| deriving DecidableEq | |
| namespace BranchState | |
| def start : BranchState β β | |
| | .D a _ _ | .H _ _ a _ _ => a | |
| def finish : BranchState β β | |
| | .D _ t _ | .H _ _ _ t _ => t | |
| def index : BranchState β β | |
| | .D _ _ i | .H _ _ _ _ i => i | |
| def angular : BranchState β β | |
| | .D .. => 0 | |
| | .H .. => 1 | |
| def Valid (N : β) (sig : β) : BranchState β Prop | |
| | .D a t _ => a β€ t β§ t β€ N | |
| | .H aβ tβ a t _ => aβ β€ a β§ a β€ t β§ t β€ tβ β§ tβ β€ N β§ (tβ:β) β€ t+sig*N | |
| noncomputable def descriptors (A : β β β) (N q : β) : BranchState β Finset PolicyDescriptor | |
| | .D a t _ => policyDescriptorList A N q a t | |
| | .H aβ tβ a _ _ => remainingPolicyDescriptors A N q aβ tβ a | |
| noncomputable def nearDepth (A : β β β) (N q : β) (sig : β) (s : BranchState) : β := | |
| s.finish-2*sourceFarBuffer N ((s.descriptors A N q).sup descriptorLength) sig | |
| theorem valid_depths {N : β} {sig : β} {s : BranchState} (h : s.Valid N sig) : | |
| s.start β€ s.finish β§ s.finish β€ N := by | |
| cases s <;> simp only [Valid,start,finish] at * | |
| Β· exact h | |
| Β· omega | |
| end BranchState | |
| inductive BranchLabel where | |
| | suffix | low | high | near | far | direct | |
| deriving DecidableEq | |
| inductive BranchStep (A : β β β) (N q : β) (sig : β) : | |
| BranchState β BranchLabel β BranchState β Prop where | |
| | suffix {a t i : β} (wide : a+100*q < t) | |
| (side : a+t < 2*policyDepth A N q a t) : | |
| BranchStep A N q sig (.D a t i) .suffix (.D a (policyDepth A N q a t) (i+1)) | |
| | low {a t i v : β} (wide : a+100*q < t) | |
| (mem : v β Finset.Ioc a t) (gap : sig*N β€ (t:β)-v) : | |
| BranchStep A N q sig (.D a t i) .low (.D a v (i+1)) | |
| | high {a t i v : β} (wide : a+100*q < t) | |
| (side : 2*policyDepth A N q a t β€ a+t) | |
| (mem : v β Finset.Ioc a t) (gap : (t:β)-v < sig*N) : | |
| BranchStep A N q sig (.D a t i) .high (.H a t (policyDepth A N q a t) v i) | |
| | near {aβ tβ a t i : β} (wide : a+100*q < t) | |
| (side : a < (BranchState.H aβ tβ a t i).nearDepth A N q sig) : | |
| BranchStep A N q sig (.H aβ tβ a t i) .near | |
| (.H aβ tβ ((BranchState.H aβ tβ a t i).nearDepth A N q sig) t i) | |
| | far {aβ tβ a t i b : β} (wide : a+100*q < t) | |
| (side : a < (BranchState.H aβ tβ a t i).nearDepth A N q sig) | |
| (mem : b β Finset.Icc (a+9) ((BranchState.H aβ tβ a t i).nearDepth A N q sig+6)) : | |
| BranchStep A N q sig (.H aβ tβ a t i) .far (.D b t (i+1)) | |
| | direct {aβ tβ a t i : β} {e : PolicyDescriptor} (wide : a+100*q < t) | |
| (witness : DirectPolicyWitness A N q aβ tβ a t sig e) : | |
| BranchStep A N q sig (.H aβ tβ a t i) .direct (.H aβ tβ (descriptorAnchor e) t i) | |
| namespace BranchStep | |
| variable {A : β β β} {N q : β} {sig : β} | |
| variable {s u : BranchState} {label : BranchLabel} | |
| theorem nonterminal (h : BranchStep A N q sig s label u) : s.start+100*q < s.finish := by | |
| cases h <;> assumption | |
| theorem nested (h : BranchStep A N q sig s label u) (hq : 0 < q) | |
| (hv : s.Valid N sig) : s.start β€ u.start β§ u.finish β€ s.finish := by | |
| cases h with | |
| | suffix hw _ => | |
| have hp := policyDepth_interior A hq (policyBlocks_nonempty hq hv.2 hw) | |
| simp only [BranchState.start,BranchState.finish] | |
| omega | |
| | low _ hm _ => | |
| have hm := Finset.mem_Ioc.mp hm | |
| exact β¨le_rfl,hm.2β© | |
| | high hw _ hm _ => | |
| have hp := policyDepth_interior A hq (policyBlocks_nonempty hq hv.2 hw) | |
| have hm := Finset.mem_Ioc.mp hm | |
| exact β¨by dsimp [BranchState.start]; omega,hm.2β© | |
| | near _ hs => exact β¨hs.le,le_rflβ© | |
| | far _ _ hm => | |
| have hm := Finset.mem_Icc.mp hm | |
| exact β¨by dsimp [BranchState.start]; omega,le_rflβ© | |
| | direct _ hw => exact β¨hw.anchor_gt.le,le_rflβ© | |
| theorem index_change (h : BranchStep A N q sig s label u) : | |
| u.index = s.index + (if label = .suffix β¨ label = .low β¨ label = .far then 1 else 0) := by | |
| cases h <;> simp [BranchState.index] | |
| theorem episode_balance (h : BranchStep A N q sig s label u) : | |
| u.angular + (if label = .far then 1 else 0) = | |
| s.angular + (if label = .high then 1 else 0) := by | |
| cases h <;> simp [BranchState.angular] | |
| theorem suffix_decrease (h : BranchStep A N q sig s .suffix u) (hq : 0 < q) | |
| (hv : s.Valid N sig) : u.finish+q β€ s.finish := by | |
| cases h with | |
| | suffix hw _ => | |
| have hp := policyDepth_interior A hq (policyBlocks_nonempty hq hv.2 hw) | |
| dsimp only [BranchState.finish] | |
| omega | |
| theorem low_decrease (h : BranchStep A N q sig s .low u) : | |
| (u.finish:β)+sig*N β€ s.finish := by | |
| cases h with | |
| | low _ _ hg => dsimp only [BranchState.finish]; linarith | |
| theorem graph_charge (h : BranchStep A N q sig s label u) (hq : 0 < q) | |
| (hv : s.Valid N sig) (hg : label = .high β¨ label = .direct) : | |
| s.start < u.start β§ u.start β policyRepresentatives A N q := by | |
| cases h with | |
| | high hw _ _ _ => | |
| have hn := policyBlocks_nonempty hq hv.2 hw | |
| have hp := policyDepth_interior A hq hn | |
| exact β¨by dsimp [BranchState.start]; omega,policyDepth_mem_representatives A hnβ© | |
| | direct _ hw => | |
| exact β¨hw.anchor_gt,policyDescriptor_anchor_mem A hq (Finset.mem_filter.mp hw.mem).1β© | |
| | _ => simp at hg | |
| end BranchStep | |
| def ChargedNear (A : β β β) (N q : β) (s u : BranchState) : Prop := | |
| u.start+100*q < u.finish β§ β e β s.descriptors A N q, | |
| descriptorLength e = (s.descriptors A N q).sup descriptorLength β§ | |
| s.start < descriptorAnchor e β§ descriptorAnchor e β€ u.start | |
| theorem near_uncharged_next_direct {A : β β β} {N q : β} {sig : β} | |
| (hq : 0 < q) (hceil : β10*sig*(N:β)ββ < q) | |
| {s u w : BranchState} {label : BranchLabel} | |
| (h : BranchStep A N q sig s .near u) (hn : Β¬ ChargedNear A N q s u) | |
| (hnext : BranchStep A N q sig u label w) : label = .direct := by | |
| have hw := hnext.nonterminal | |
| cases h with | |
| | near hwide hnear => | |
| obtain ht | hp | he := actual_near_progress A hq hceil hnear | |
| Β· exact (not_lt_of_ge ht hw).elim | |
| Β· obtain β¨e,hm,hL,ha,hb,_β© := hp | |
| exact (hn β¨hw,e,hm,hL,ha,hbβ©).elim | |
| Β· simp only [BranchState.finish] at he | |
| cases hnext with | |
| | near _ hs => | |
| simp only [BranchState.nearDepth,BranchState.finish,BranchState.descriptors] at hs | |
| rw [he.2] at hs | |
| exact (Nat.lt_irrefl _ hs).elim | |
| | far _ hs _ => | |
| simp only [BranchState.nearDepth,BranchState.finish,BranchState.descriptors] at hs | |
| rw [he.2] at hs | |
| exact (Nat.lt_irrefl _ hs).elim | |
| | direct _ _ => rfl | |
| end PlanarFalconer | |
| end OAI | |