Download data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/RecursiveLoss.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.74 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/RecursiveLoss.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/RecursiveLoss.lean
-
curl -L -o RecursiveLoss.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/FalconerCompletion/Recursion/RecursiveLoss.lean
2.74 kB
| import Mathlib | |
| import OAI.MeasureTheory.Falconer.Model | |
| import OAI.MeasureTheory.FalconerCompletion.Graphs.SuffixDescendants | |
| import OAI.MeasureTheory.FalconerCompletion.Recursion.RecursiveEnvironment | |
| import OAI.MeasureTheory.FalconerCompletion.Recursion.RecursiveUnit | |
| namespace OAI | |
| /-! Recursive policies and quantitative depth estimates. -/ | |
| open _root_.OAI.PlanarFalconer | |
| section | |
| section | |
| open Set MeasureTheory | |
| open scoped ComplexConjugate RealInnerProductSpace | |
| namespace GraphLiteralSupport.CurrentFalconer.TreeND | |
| open Set MeasureTheory Filter PlanarFalconer | |
| open scoped ContDiff Classical | |
| variable {n : β} | |
| noncomputable def recursiveLoss (n : β) (C : β) : β := |C|+100*(n+2:β) | |
| lemma recursiveLoss_pos (n : β) (C : β) : 0<recursiveLoss n C := by | |
| unfold recursiveLoss | |
| positivity | |
| lemma recursiveLoss_graph (n : β) (C : β) : C+36*(n+1:β)+5β€2*recursiveLoss n C := by | |
| unfold recursiveLoss | |
| nlinarith [le_abs_self C,abs_nonneg C,(Nat.cast_nonneg n : (0:β)β€(n:β))] | |
| lemma recursiveLoss_dim (n : β) (C : β) : 4*(n+2:β)β€2*recursiveLoss n C := by | |
| unfold recursiveLoss | |
| nlinarith [abs_nonneg C,(Nat.cast_nonneg n : (0:β)β€(n:β))] | |
| lemma recursiveLoss_test (n : β) (C : β) : Cβ€2*recursiveLoss n C := by | |
| unfold recursiveLoss | |
| nlinarith [le_abs_self C,abs_nonneg C,(Nat.cast_nonneg n : (0:β)β€(n:β))] | |
| lemma weighted_child_cap {N : β} {a b x M : β} (hx : 0β€x) (hab : aβ€b) | |
| (h : ((2:β)^N)^b*xβ€M) : ((2:β)^N)^a*xβ€M := | |
| (mul_le_mul_of_nonneg_right (Real.rpow_le_rpow_of_exponent_le | |
| (one_le_powβ (by norm_num)) hab) hx).trans h | |
| lemma farSeparated_centre {a : β} {K : β} {X Y : CellPath (n+1)} | |
| (hX : X.length=a) (hY : Y.length=a) | |
| (h : Attempt4FullFar.farSeparatedGridND a K (fun j => (pathIndex X j:β€)) (fun j => (pathIndex Y j:β€))) : | |
| CentreSeparated X Y a K := by | |
| unfold CentreSeparated treeCenter | |
| rw [hX,hY] | |
| change K/8/(2:β)^aβ€_ β§ _β€_ | |
| simpa only [Attempt4FullFar.farSeparatedGridND,div_div,ambientGridCenter,Attempt4FullFar.ambientGridCenter] using h | |
| lemma RecursiveEnvironmentND.distance_mem (e : RecursiveEnvironmentND n) (K : β) | |
| (W : Finset (List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))) | |
| (total : β) (Ξ¨ : β β β) (a t i : β) (X Y : CellPath (n+1)) | |
| (hX : XβdyadicPaths a) (hY : YβdyadicPaths a) | |
| (hox : 0<e.Ο (treeCell X)) (hoy : 0<e.Ο (treeCell Y)) | |
| (hsep : Attempt4FullFar.farSeparatedGridND a K (fun j => (pathIndex X j:β€)) (fun j => (pathIndex Y j:β€))) : | |
| e.energies K W total Ξ¨ (.D a t i) ((e.distanceData a t i X Y).coincidence.toReal) := | |
| β¨X,Y,hX,hY,hox,hoy,hsep,rflβ© | |
| end GraphLiteralSupport.CurrentFalconer.TreeND | |
| end | |
| end | |
| end OAI | |