All proofs
Project-declaredLean 4.32.0 Β· mathlib@81a5d257c8e4

Dens1 le dens

dens1_le_dens'

Plain-language statement

If every tile in PP lies at the fixed generation kk, then the first global density of PP is at most the generation-specific density densβ€²(k,P)\mathrm{dens}'(k,P).

Exact Lean statement

lemma dens1_le_dens' {k : β„•} {P : Set (𝔓 X)} (hP : P βŠ† TilesAt k) : dens₁ P ≀ dens' k P

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma dens1_le_dens' {k : β„•} {P : Set (𝔓 X)} (hP : P βŠ† TilesAt k) : dens₁ P ≀ dens' k P := by  rw [dens₁, dens']; gcongr with p' mp' l hl  simp_rw [ENNReal.mul_iSup, iSup_le_iff, mul_div_assoc]; intro p mp sl  suffices p ∈ TilesAt k by    exact le_iSup_of_le p (le_iSupβ‚‚_of_le this sl (mul_le_mul' (by norm_cast) le_rfl))  simp_rw [TilesAt, mem_preimage, 𝓒, mem_sdiff, aux𝓒, mem_setOf]  constructor  Β· rw [mem_lowerCubes] at mp; obtain ⟨p'', mp'', lp''⟩ := mp    have hp'' := mem_of_mem_of_subset mp'' hP    simp_rw [TilesAt, mem_preimage, 𝓒, mem_sdiff, aux𝓒, mem_setOf] at hp''    obtain ⟨J, lJ, vJ⟩ := hp''.1; use J, lp''.trans lJ  Β· by_contra h; obtain ⟨J, lJ, vJ⟩ := h    have hp' := mem_of_mem_of_subset mp' hP    simp_rw [TilesAt, mem_preimage, 𝓒, mem_sdiff, aux𝓒, mem_setOf] at hp'    apply absurd _ hp'.2; use J, sl.1.trans lJ
Project
Carleson formalization
License
Apache-2.0
Commit
74ef907d6bdb
Source
Carleson/Discrete/Defs.lean:95-109

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 sup⁑N>N0βˆ₯f(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)(qβˆ’1)/(8a4) dens2(A)1/qβˆ’1/2 βˆ₯fβˆ₯2βˆ₯gβˆ₯2.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