I Union ball subset i Union Ω₁
Construction.iUnion_ball_subset_iUnion_Ω₁
Plain-language statement
For a fixed spatial grid cube , every frequency parameter lying in one of the prescribed balls centered at the finite net also lies in at least one of the frequency regions . Equivalently, the union of those net balls is contained in the union of the first-stage tile frequency regions.
Exact Lean statement
lemma iUnion_ball_subset_iUnion_Ω₁ : ⋃ z ∈ 𝓩 I, ball_{I} z C4_2_1 ⊆ ⋃ f : 𝓩 I, Ω₁ ⟨I, f⟩Formal artifact
Lean source
lemma iUnion_ball_subset_iUnion_Ω₁ : ⋃ z ∈ 𝓩 I, ball_{I} z C4_2_1 ⊆ ⋃ f : 𝓩 I, Ω₁ ⟨I, f⟩ := by rw [iUnion₂_subset_iff]; intro z mz (ϑ : Θ X) mϑ set f := Finite.equivFin (𝓩 I) with hf by_cases h : ∃ y ∈ 𝓩 I, ϑ ∈ ball_{I} y C𝓩 · obtain ⟨z', mz', hz'⟩ := h exact subset_iUnion_of_subset _ subset_rfl (ball_subset_Ω₁ ⟨I, ⟨z', mz'⟩⟩ hz') · let L := {k : Fin (Nat.card (𝓩 I)) | ϑ ∈ ball_{I} (f.symm k).1 C4_2_1} have Ln : L.Nonempty := by use f ⟨z, mz⟩; rwa [mem_setOf, Equiv.symm_apply_apply] obtain ⟨k, mem_k, hk⟩ := L.exists_min_image id L.toFinite Ln simp_rw [L, mem_setOf_eq] at mem_k simp only [id_eq] at hk have q : ∀ i < k, ϑ ∉ Ω₁_aux I i := by by_contra! h; obtain ⟨i, li, hi⟩ := h have := Ω₁_subset_ball ⟨I, f.symm i⟩ simp_rw [Ω₁, ← hf, Equiv.apply_symm_apply] at this replace this : ϑ ∈ ball_{I} (f.symm i).1 C4_2_1 := this hi replace this : i ∈ L := by simp only [L, mem_setOf_eq, this] exact absurd (hk i this) (not_le.mpr li) rw [mem_iUnion]; use f.symm k; rw [Ω₁, Ω₁_aux]; dsimp only rw [Equiv.apply_symm_apply]; simp_rw [k.2]; rw [dite_true, mem_sdiff, mem_sdiff] refine ⟨⟨mem_k, ?_⟩, ?_⟩ · rw [mem_iUnion₂]; push Not at h ⊢; exact fun i mi ↦ h i mi.1 · rw [mem_iUnion₂]; push Not; exact fun i mi ↦ q ⟨i, mi.trans k.2⟩ mi- Project
- Carleson formalization
- License
- Apache-2.0
- Commit
- 74ef907d6bdb
- Source
- Carleson/TileExistence.lean:1792-1814
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.