fpvandoorn/carleson
Source indexedlemma Β· leanprover/lean4:v4.32.0
Antichain.Ep_inter_G_inter_Ip'_subset_E2
Carleson.Antichain.AntichainTileCount Β· Carleson/Antichain/AntichainTileCount.lean:296 to 319
Source documentation
We prove inclusion 6.3.24 for every p β (π_aux π Ο N) with π° p' < π° p such that
(π p : Set X) β© (π p') β β
. The variable p' corresponds to π_Ο in the blueprint.
Exact Lean statement
lemma Ep_inter_G_inter_Ip'_subset_E2 {π : Set (π X)} (Ο : Ξ X) (N : β) {p p' : π X}
(hpin : p β (π_aux π Ο N).toFinset) (hp' : Ο β ball_(p') (π¬ p') (2 ^ (N + 1)))
(hs : π° p' < π° p) (hπ : ((π p' : Set X) β© (π p)).Nonempty) :
E p β© G β© β(π p') β Eβ (2^(N + 3)) p'Complete declaration
Lean source
Full Lean sourceLean 4
lemma Ep_inter_G_inter_Ip'_subset_E2 {π : Set (π X)} (Ο : Ξ X) (N : β) {p p' : π X} (hpin : p β (π_aux π Ο N).toFinset) (hp' : Ο β ball_(p') (π¬ p') (2 ^ (N + 1))) (hs : π° p' < π° p) (hπ : ((π p' : Set X) β© (π p)).Nonempty) : E p β© G β© β(π p') β Eβ (2^(N + 3)) p' := by have hle : π p' β€ π p := β¨Or.resolve_right (fundamental_dyadic (le_of_lt hs)) (not_disjoint_iff_nonempty_inter.mpr hπ), le_of_lt hsβ© -- Ineq. 6.3.22 have hΟin : dist_(p) (π¬ p) Ο < ((2 : β)^(N + 1)) := by simp only [π_aux, mem_Ico, sep_and, toFinset_inter, toFinset_setOf, Finset.mem_inter, Finset.mem_filter_univ] at hpin exact (lt_one_add (dist_(p) (π¬ p) Ο)).trans hpin.2.2 -- Ineq. 6.3.23 have hsmul_le : smul (2 ^ (N + 3)) p' β€ smul (2 ^ (N + 3)) p := tile_reach (le_of_lt (mem_ball'.mpr hp')) (le_of_lt hΟin) hle hs -- Ineq. 6.3.24 simp only [TileLike.le_def, smul_snd] at hsmul_le simp only [E, Eβ, TileLike.toSet, smul_fst, smul_snd, subset_inter_iff, inter_subset_right, true_and] refine β¨?_, fun _ hx β¦ ?_β© Β· rw [inter_assoc, inter_comm, inter_assoc] exact inter_subset_left Β· apply mem_of_subset_of_mem (le_trans (le_trans subset_cball (ball_subset_ball (mod_cast Nat.one_le_two_pow))) hsmul_le.2) hx.1.1.2.1