Plain-language statement
If one grid cube is strictly contained below another grid cube , then the project’s phase distance at the finer cube is controlled by the phase distance at the coarser cube:
Exact Lean statement
lemma dist_strictMono {I J : Grid X} (hpq : I < J) {f g : Θ X} :
dist_{I} f g ≤ C2_1_2 a * dist_{J} f gFormal artifact
Lean source
lemma dist_strictMono {I J : Grid X} (hpq : I < J) {f g : Θ X} : dist_{I} f g ≤ C2_1_2 a * dist_{J} f g := by calc _ ≤ dist_{c I, 4 * D ^ s I} f g := cdist_mono (ball_subset_ball (by simp_rw [div_eq_inv_mul, defaultD]; gcongr; norm_num)) _ ≤ 2 ^ (-𝕔 * (a : ℝ)) * dist_{c I, 4 * D ^ (s I + 1)} f g := by rw [← div_le_iff₀' (by positivity), neg_mul, Real.rpow_neg zero_le_two, div_inv_eq_mul, mul_comm] convert! le_cdist_iterate (x := c I) (r := 4 * D ^ s I) (by positivity) f g (𝕔 * a) using 1 · norm_cast · apply dist_congr rfl have : (defaultA a : ℝ) ^ (𝕔 * a) = D := by simp only [defaultD, Nat.cast_pow, Nat.cast_ofNat] rw [← pow_mul]; congr 1; ring rw [this, zpow_add_one₀ (realD_pos a).ne']; ring _ ≤ 2 ^ (-𝕔 * (a : ℝ)) * dist_{c I, 4 * D ^ s J} f g := by gcongr have : s I < s J := (Grid.lt_def.mp hpq).2 apply cdist_mono gcongr · exact one_le_realD _ · lia _ ≤ 2 ^ (-𝕔 * (a : ℝ)) * dist_{c J, 8 * D ^ s J} f g := by gcongr have : c I ∈ ball (c J) (4 * D ^ s J) := mem_of_mem_of_subset c_mem_Grid ((Grid.lt_def.mp hpq).1.trans Grid_subset_ball) rw [mem_ball] at this exact cdist_mono (ball_subset_ball' (by linarith)) _ ≤ 2 ^ (-𝕔 * (a : ℝ) + 5 * a) * dist_{J} f g := by rw [Real.rpow_add zero_lt_two, mul_assoc] gcongr rw [show (2 : ℝ) ^ (5 * (a : ℝ)) = (defaultA a) ^ 5 by norm_cast; ring] convert! cdist_le_iterate _ f g 5 using 1 · exact dist_congr rfl (by ring) · have := one_le_realD a; positivity _ = _ := by congr 1; rw [C2_1_2, ← add_mul]- Project
- Carleson formalization
- License
- Apache-2.0
- Commit
- 74ef907d6bdb
- Source
- Carleson/GridStructure.lean:397-431
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Adjoint Carleson adjoint
adjointCarleson_adjoint
Plain-language statement
adjointCarleson is the adjoint of carlesonOn.
Source project: Carleson formalization
Person-level attribution pending.
Ae tendsto zero of distribution le
ae_tendsto_zero_of_distribution_le
Plain-language statement
Suppose that, for every error threshold and every measure tolerance , one can choose so that the set where exceeds has measure at most . Then converges to for almost every .
Source project: Carleson formalization
Person-level attribution pending.
Antichain operator
antichain_operator
Plain-language statement
For an antichain of pairwise incomparable tiles, and measurable functions and bounded by the indicators of and , the pairing of with the Carleson sum over is controlled by the norms of and and by positive powers of the two tile-density parameters. Concretely, the bound is
Source project: Carleson formalization
Person-level attribution pending.