All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

Geometric series estimate

geometric_series_estimate

Plain-language statement

For every real x2x\ge2, the extended-nonnegative geometric series satisfies

n=02n/x2x.\sum_{n=0}^{\infty}2^{-n/x}\le2^x.

Exact Lean statement

lemma geometric_series_estimate {x : ℝ} (hx : 2 ≤ x) :
    ∑' (n : ℕ), (2 : ℝ≥0∞) ^ (-n / x) ≤ 2 ^ x

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma geometric_series_estimate {x : } (hx : 2  x) :    ∑' (n : ), (2 : 0∞) ^ (-n / x)  2 ^ x := by  calc    _ = ∑' (n : ), ((2 : 0∞) ^ (-x⁻¹)) ^ n := by      congr! 2 with n      rw [div_eq_mul_inv, neg_mul_comm, mul_comm, ENNReal.rpow_mul, ENNReal.rpow_natCast]    _ = (1 - 2 ^ (-x⁻¹))⁻¹ := ENNReal.tsum_geometric _    _  2 * (ENNReal.ofReal x⁻¹)⁻¹ := by      apply near_1_geometric_bound; rw [mem_Icc, inv_nonneg, inv_le_one_iff₀]      exact by linarith, .inr (by linarith)    _ = ENNReal.ofReal (2 * x) := by      rw [ofReal_inv_of_pos (by linarith), inv_inv, ofReal_mul zero_le_two, ofReal_ofNat]    _  ENNReal.ofReal (2 ^ x) := by      gcongr      have key := @one_add_mul_self_le_rpow_one_add 1 (by norm_num) (x - 1) (by linarith)      rw [mul_one, add_sub_cancel, one_add_one_eq_two] at key      replace key := mul_le_mul_of_nonneg_left key zero_le_two      rwa [ Real.rpow_one_add' (by linarith) (by linarith), add_sub_cancel] at key    _ = _ := by rw [ ofReal_rpow_of_pos zero_lt_two, ofReal_ofNat]
Project
Carleson formalization
License
Apache-2.0
Commit
74ef907d6bdb
Source
Carleson/TwoSidedCarleson/Basic.lean:130-148

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