All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

I Union ball subset i Union Ω₁

Construction.iUnion_ball_subset_iUnion_Ω₁

Plain-language statement

For a fixed spatial grid cube II, every frequency parameter lying in one of the prescribed balls centered at the finite net Z(I)\mathcal Z(I) also lies in at least one of the frequency regions Ω1(I,f)\Omega_1(I,f). 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

Canonical source
Full Lean sourceLean 4
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

Project-declaredLean 4.32.0

Ae tendsto zero of distribution le

ae_tendsto_zero_of_distribution_le

Plain-language statement

Suppose that, for every error threshold δ>0\delta>0 and every measure tolerance ε>0\varepsilon>0, one can choose N0N_0 so that the set where supN>N0f(x)FN(x)\sup_{N>N_0}\lVert f(x)-F_N(x)\rVert exceeds δ\delta has measure at most ε\varepsilon. Then FN(x)F_N(x) converges to f(x)f(x) for almost every xx.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Antichain operator

antichain_operator

Plain-language statement

For an antichain A\mathfrak{A} of pairwise incomparable tiles, and measurable functions ff and gg bounded by the indicators of FF and GG, the pairing of gg with the Carleson sum over A\mathfrak{A} is controlled by the L2L^2 norms of ff and gg and by positive powers of the two tile-density parameters. Concretely, the bound is

C(a,q)dens1(A)(q1)/(8a4)dens2(A)1/q1/2f2g2.C(a,q)\,\mathrm{dens}_1(\mathfrak{A})^{(q-1)/(8a^4)}\,\mathrm{dens}_2(\mathfrak{A})^{1/q-1/2}\,\lVert f\rVert_2\lVert g\rVert_2.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record