Download data/lean/OAI/MeasureTheory/Falconer/Recursion/InitialProfileClass.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.74 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/InitialProfileClass.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/MeasureTheory/Falconer/Recursion/InitialProfileClass.lean
-
curl -L -o InitialProfileClass.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/MeasureTheory/Falconer/Recursion/InitialProfileClass.lean
3.74 kB
| import OAI.MeasureTheory.Falconer.Recursion.UniformProfileGain | |
| namespace OAI | |
| /-! The initial class inherits its lower profile from the actual leaf prefix | |
| counts. The label-selection loss is explicit and paid only once. -/ | |
| namespace Falconer | |
| open Set Regularization | |
| attribute [local instance] Classical.propDecidable | |
| theorem block_profile_ratios_from_prefix {N B : β} (hB : 0 < B) | |
| {L : Finset (CellPath 2)} (hL : L β cubePaths 2 N) | |
| (f : CellPath 2 β List β) {p : CellPath 2} (hp : p β L) | |
| {A D t : β} (hA : 0 β€ A) (hD : 0 β€ D) | |
| (hmass : (L.card:β) β€ D*((classLeaves L (blockLabel L N B f (N/B+1)) | |
| (blockLabel L N B f (N/B+1) p)).card:β)) | |
| (hprefix : β k β€ N, β q : CellPath 2, | |
| ((prefixFiber L k q).card:β) β€ A*(2:β)^(-t*(k:β))*(L.card:β)) : | |
| β i β€ N/B+1, | |
| (blockProduct L (blockLabel L N B f (N/B+1)) N B i p:β)/ | |
| (blockProduct L (blockLabel L N B f (N/B+1)) N B (N/B+1) p:β) β€ | |
| ((2:β)^(N/B+1)*D*A)*(2:β)^(-t*(blockDepth N B i:β)) := by | |
| intro i hi | |
| let K := N/B+1 | |
| let F := blockLabel L N B f K | |
| let C := classLeaves L F (F p) | |
| have hpC : p β C := by simp [C,classLeaves,hp] | |
| have hCsub : C β L := Finset.filter_subset _ _ | |
| have hc := blockClass_leaf_count hL B f K p hi (Finset.mem_image.mpr β¨p,hpC,rflβ©) | |
| have hr := blockClass_root_count hL hB f hp | |
| apply (div_le_iffβ (Nat.cast_pos.mpr (blockProduct_pos L F N B K p))).2 | |
| calc | |
| (blockProduct L F N B i p:β) β€ ((prefixFiber C (blockDepth N B i) | |
| (p.take (blockDepth N B i))).card:β) := Nat.cast_le.mpr hc.1 | |
| _ β€ ((prefixFiber L (blockDepth N B i) (p.take (blockDepth N B i))).card:β) := | |
| Nat.cast_le.mpr (Finset.card_le_card (Finset.filter_subset_filter _ hCsub)) | |
| _ β€ A*(2:β)^(-t*(blockDepth N B i:β))*(L.card:β) := | |
| hprefix _ (Nat.sub_le N _) _ | |
| _ β€ A*(2:β)^(-t*(blockDepth N B i:β))*(D*(C.card:β)) := by gcongr | |
| _ β€ A*(2:β)^(-t*(blockDepth N B i:β))*(D*((2:β)^K* | |
| (blockProduct L F N B K p:β))) := by | |
| gcongr | |
| exact_mod_cast hr.2 | |
| _ = _ := by ring | |
| theorem exists_initial_profile_class {N B : β} (hB : 0 < B) | |
| {L : Finset (CellPath 2)} (hL : L β cubePaths 2 N) (hLne : L.Nonempty) | |
| {A t lam : β} (hA : 0 β€ A) | |
| (hprefix : β k β€ N, β q : CellPath 2, | |
| ((prefixFiber L k q).card:β) β€ A*(2:β)^(-t*(k:β))*(L.card:β)) | |
| (hcost : (2:β)^(N/B+1)*((2*B+1:β):β)^(N/B+1)*A β€ (2:β)^(lam*(N:β))) : | |
| β p β L, | |
| (L.card:β) β€ ((2*B+1:β):β)^(N/B+1)* | |
| ((classLeaves L (blockLabel L N B (fun _ => []) (N/B+1)) | |
| (blockLabel L N B (fun _ => []) (N/B+1) p)).card:β) β§ | |
| β i β€ N/B+1, | |
| (blockProduct L (blockLabel L N B (fun _ => []) (N/B+1)) N B i p:β)/ | |
| (blockProduct L (blockLabel L N B (fun _ => []) (N/B+1)) N B (N/B+1) p:β) β€ | |
| (2:β)^(lam*(N:β)-t*(blockDepth N B i:β)) := by | |
| obtain β¨p,hp,hmassβ© := exists_large_planar_block_class hL hLne B (N/B+1) | |
| have hmassR : (L.card:β) β€ ((2*B+1:β):β)^(N/B+1)* | |
| ((classLeaves L (blockLabel L N B (fun _ => []) (N/B+1)) | |
| (blockLabel L N B (fun _ => []) (N/B+1) p)).card:β) := by exact_mod_cast hmass | |
| refine β¨p,hp,hmassR,?_β© | |
| have hh := block_profile_ratios_from_prefix hB hL (fun _ => []) hp hA (by positivity) hmassR hprefix | |
| intro i hi | |
| calc | |
| _ β€ ((2:β)^(N/B+1)*((2*B+1:β):β)^(N/B+1)*A)* | |
| (2:β)^(-t*(blockDepth N B i:β)) := hh i hi | |
| _ β€ (2:β)^(lam*(N:β))*(2:β)^(-t*(blockDepth N B i:β)) := | |
| mul_le_mul_of_nonneg_right hcost (by positivity) | |
| _ = _ := by rw [β Real.rpow_add (by norm_num : (0:β) < 2)]; congr 1; ring | |
| end Falconer | |
| end OAI | |