introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.28 kB
import Mathlib
import OAI.MeasureTheory.FalconerCompletion.Sphere.SphereMeasure
namespace OAI
/-! Quantitative estimates for the distance-set construction. -/
section
section
namespace CurrentFalconer.TreeND
abbrev CellPath (d : β„•) := List (Fin d β†’ Bool)
variable {d : β„•}
def dyadicPaths {d : β„•} : β„• β†’ Finset (CellPath d)
| 0 => {[]}
| n+1 => Finset.univ.biUnion fun a : Fin d β†’ Bool =>
(dyadicPaths n).image (List.cons a)
@[simp] theorem mem_dyadicPaths (n : β„•) (p : CellPath d) :
p ∈ dyadicPaths n ↔ p.length = n := by
induction n generalizing p with
| zero => simp [dyadicPaths]
| succ n ih =>
cases p with
| nil => simp [dyadicPaths]
| cons a p => simp [dyadicPaths, ih]
lemma dyadicPaths_card_le (N : β„•) : (dyadicPaths (d := d) N).card ≀ (2^d)^N := by
classical
induction N with
| zero => simp [dyadicPaths]
| succ N ih =>
calc
_ ≀ βˆ‘ a ∈ (Finset.univ : Finset (Fin d β†’ Bool)),
((dyadicPaths N).image (List.cons a)).card := Finset.card_biUnion_le
_ ≀ βˆ‘ _a ∈ (Finset.univ : Finset (Fin d β†’ Bool)), (2^d)^N :=
Finset.sum_le_sum (fun _ _ => Finset.card_image_le.trans ih)
_ = _ := by simp [pow_succ,Nat.mul_comm]
end CurrentFalconer.TreeND
end
end
end OAI