Uniform bound on the number of overlapping grid boxes
ProvedHairer.grid_overlap_countanalysisregularity-structures
Fix a centre , fine widths , and positive coarse widths with . There is a finite set , of cardinality at most , containing every coarse index whose box meets the fine box:
The bound is independent of the centre and widths. In a smooth grid construction of reconstruction, this controls the number of coarse cells contributing to each fine cell.
Preamble
import Definitions.Def_Hairer_TestFunctions set_option autoImplicit false noncomputable section
Formal statement
namespace Hairer
theorem grid_overlap_count {d : ℕ} (x : Pt d) (a c : Fin d → ℝ)
(hc : ∀ i, 0 < c i) (hac : ∀ i, a i ≤ c i) :
∃ S : Finset (Fin d → ℤ), S.card ≤ 5 ^ d ∧
∀ k : Fin d → ℤ, (∃ y : Pt d, (∀ i, |y i - x i| < a i) ∧
(∀ i, |y i / c i - (k i : ℝ)| < 1)) → k ∈ S := by sorry
end Hairer
Source
Elementary coordinate-box counting estimate used in the smooth partition approach to reconstruction.