Bilinear polynomial ergodic averages
DefinitionLacunary sequence#✓fully proved
For a real number \(\Lambda \ge 0\), a sequence \((a_n)_{n \in \mathbb{N}}\) of nonnegative real numbers is \(\Lambda\)-lacunary if \(a_{n+1} / a_n > \Lambda\) for every \(n \in \mathbb{N}\), where division by \(0\) gives \(0\); in particular every term of a \(\Lambda\)-lacunary sequence is positive.
def Lacunary (Λ : ℝ≥0) (a : ℕ → ℝ≥0) : Prop := ∀ n, a (n + 1) / a n > Λ
Used by 1
DefinitionVariational norm#✓fully proved
For a real number \(r \ge 0\) and a sequence \(a = (a_n)_{n \in \mathbb{N}}\) of complex numbers, the \(r\)-variational norm of \(a\) is the element of \([0, \infty]\)
where the inner supremum runs over nondecreasing finite sequences of natural numbers \(N_0 \le N_1 \le \dots \le N_J\) and the empty sum (\(J = 0\)) is \(0\). For \(r = 0\) the whole term \(\big( \sum_{j=0}^{J-1} |a_{N_{j+1}} - a_{N_j}|^r \big)^{1/r}\) is replaced by the number of indices \(j < J\) with \(a_{N_{j+1}} \ne a_{N_j}\).
noncomputable def variationalNorm (r : ℝ≥0) (a : ℕ → ℂ) : ℝ≥0∞ :=
(⨆ n, ‖a n‖ₑ) + ⨆ (J : ℕ) (N : ℕ → ℕ) (_ : Monotone N),
ENNReal.ofReal ‖(WithLp.toLp r (fun (i : Fin J) ↦ a (N (i + 1)) - a (N i)))‖
Used by 1
DefinitionBilinear polynomial ergodic averages#✓fully proved
Let \(X\) be a measurable space and let \(T : X \to X\) be a measurable bijection with measurable inverse. For a real number \(N \ge 0\), polynomials \(P_1, P_2 \in \mathbb{Z}[t]\), functions \(f, g : X \to \mathbb{C}\) and a point \(x \in X\), the bilinear average is the complex number
where \(T^k\) for \(k \in \mathbb{Z}\) is the \(k\)-th power of \(T\) in the group of bijections of \(X\) (so negative powers are iterates of \(T^{-1}\)), and \(A_N^{P_1, P_2}(f, g)(x) = 0\) when \(\lfloor N \rfloor = 0\).
TheoremMean ergodic theorem for bilinear polynomial averages#●ready to prove
Let \((X, \mu)\) be a \(\sigma\)-finite measure space and let \(T : X \to X\) be a measurable bijection with measurable inverse that preserves \(\mu\). Let \(P \in \mathbb{Z}[t]\) have degree at least \(2\), and let \(p_1, p_2 \in (1, \infty)\) and \(p \in [0, \infty]\) satisfy \(p_1^{-1} + p_2^{-1} = p^{-1}\) and \(p^{-1} \le 1\). For a real number \(N \ge 0\), functions \(f, g : X \to \mathbb{C}\) and \(x \in X\) let
with \(A_N(f, g)(x) = 0\) when \(\lfloor N \rfloor = 0\), where \(T^k\) for \(k \in \mathbb{Z}\) is the \(k\)-th power of \(T\) in the group of bijections of \(X\). Then for all \(f \in L^{p_1}(\mu)\) and \(g \in L^{p_2}(\mu)\) with values in \(\mathbb{C}\) there is a function \(h : X \to \mathbb{C}\) in \(L^p(\mu)\) such that \(\|A_N(f, g) - h\|_{L^p(\mu)} \to 0\) as the real number \(N\) tends to \(\infty\).
This is Theorem 1.17(i) of Krause, Mirek and Tao.
public theorem_wanted theorem_1_17_i {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) :
∃ h : 𝓧 → ℂ, MemLp h p μ ∧
Tendsto (fun N ↦ eLpNorm (A T N (X : ℤ[X]) P f g - h) p μ) atTop (𝓝 0)
noncomputable def A (T : 𝓧 ≃ᵐ 𝓧) (N : ℝ≥0) (P₁ : ℤ[X]) (P₂ : ℤ[X]) (f g : 𝓧 → ℂ) (x : 𝓧) : ℂ :=
(Nat.floor N : ℝ)⁻¹ * ∑ n ∈ Icc 1 (Nat.floor N),
f ((T ^ (P₁.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x) * g ((T ^ (P₂.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x)
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:83
Sources
- B. Krause, M. Mirek, and T. Tao,
Pointwise ergodic theorems for non-conventional bilinear polynomial averages, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge. Problemannals_pointwise_ergodic_theoremsof the lean-eval benchmark.
Uses 1
TheoremPointwise ergodic theorem for bilinear polynomial averages#●ready to prove
Let \((X, \mu)\) be a \(\sigma\)-finite measure space and let \(T : X \to X\) be a measurable bijection with measurable inverse that preserves \(\mu\). Let \(P \in \mathbb{Z}[t]\) have degree at least \(2\), and let \(p_1, p_2 \in (1, \infty)\) and \(p \in [0, \infty]\) satisfy \(p_1^{-1} + p_2^{-1} = p^{-1}\) and \(p^{-1} \le 1\). For a real number \(N \ge 0\), functions \(f, g : X \to \mathbb{C}\) and \(x \in X\) let
with \(A_N(f, g)(x) = 0\) when \(\lfloor N \rfloor = 0\), where \(T^k\) for \(k \in \mathbb{Z}\) is the \(k\)-th power of \(T\) in the group of bijections of \(X\). Then for all \(f \in L^{p_1}(\mu)\) and \(g \in L^{p_2}(\mu)\) with values in \(\mathbb{C}\) there is a function \(h : X \to \mathbb{C}\) in \(L^p(\mu)\) such that for \(\mu\)-almost every \(x \in X\), \(A_N(f, g)(x) \to h(x)\) as the real number \(N\) tends to \(\infty\).
This is Theorem 1.17(ii) of Krause, Mirek and Tao.
public theorem_wanted theorem_1_17_ii {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) :
∃ h : 𝓧 → ℂ, MemLp h p μ ∧
∀ᵐ x ∂μ, Tendsto (fun N ↦ A T N (X : ℤ[X]) P f g x) atTop (𝓝 (h x))
noncomputable def A (T : 𝓧 ≃ᵐ 𝓧) (N : ℝ≥0) (P₁ : ℤ[X]) (P₂ : ℤ[X]) (f g : 𝓧 → ℂ) (x : 𝓧) : ℂ :=
(Nat.floor N : ℝ)⁻¹ * ∑ n ∈ Icc 1 (Nat.floor N),
f ((T ^ (P₁.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x) * g ((T ^ (P₂.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x)
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:83
Sources
- B. Krause, M. Mirek, and T. Tao,
Pointwise ergodic theorems for non-conventional bilinear polynomial averages, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge. Problemannals_pointwise_ergodic_theoremsof the lean-eval benchmark.
Uses 1
TheoremMaximal inequality for bilinear polynomial averages#●ready to prove
Let \((X, \mu)\) be a \(\sigma\)-finite measure space and let \(T : X \to X\) be a measurable bijection with measurable inverse that preserves \(\mu\). Let \(P \in \mathbb{Z}[t]\) have degree at least \(2\), and let \(p_1, p_2 \in (1, \infty)\) and \(p \in [0, \infty]\) satisfy \(p_1^{-1} + p_2^{-1} = p^{-1}\) and \(p^{-1} \le 1\). For a real number \(N \ge 0\), functions \(f, g : X \to \mathbb{C}\) and \(x \in X\) let
with \(A_N(f, g)(x) = 0\) when \(\lfloor N \rfloor = 0\), where \(T^k\) for \(k \in \mathbb{Z}\) is the \(k\)-th power of \(T\) in the group of bijections of \(X\). Then there is a constant \(C \ge 0\), which may depend on \((X, \mu, T)\), \(P\), \(p_1\), \(p_2\) and \(p\), such that for all \(f \in L^{p_1}(\mu)\) and \(g \in L^{p_2}(\mu)\) with values in \(\mathbb{C}\),
where the supremum is taken pointwise in \([0, \infty]\).
This is Theorem 1.17(iii) of Krause, Mirek and Tao.
public theorem_wanted theorem_1_17_iii : ∃ C : ℝ≥0, ∀ {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ),
eLpNorm (fun x ↦ ⨆ (N : ℕ+), ‖A T N (X : ℤ[X]) P f g x‖ₑ) p μ ≤
C * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ
noncomputable def A (T : 𝓧 ≃ᵐ 𝓧) (N : ℝ≥0) (P₁ : ℤ[X]) (P₂ : ℤ[X]) (f g : 𝓧 → ℂ) (x : 𝓧) : ℂ :=
(Nat.floor N : ℝ)⁻¹ * ∑ n ∈ Icc 1 (Nat.floor N),
f ((T ^ (P₁.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x) * g ((T ^ (P₂.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x)
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:83
Sources
- B. Krause, M. Mirek, and T. Tao,
Pointwise ergodic theorems for non-conventional bilinear polynomial averages, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge. Problemannals_pointwise_ergodic_theoremsof the lean-eval benchmark.
Uses 1
TheoremLong variational inequality for bilinear polynomial averages#●ready to prove
Let \((X, \mu)\) be a \(\sigma\)-finite measure space and let \(T : X \to X\) be a measurable bijection with measurable inverse that preserves \(\mu\). Let \(P \in \mathbb{Z}[t]\) have degree at least \(2\), and let \(p_1, p_2 \in (1, \infty)\) and \(p \in [0, \infty]\) satisfy \(p_1^{-1} + p_2^{-1} = p^{-1}\) and \(p^{-1} \le 1\). For a real number \(N \ge 0\), functions \(f, g : X \to \mathbb{C}\) and \(x \in X\) let
with \(A_N(f, g)(x) = 0\) when \(\lfloor N \rfloor = 0\), where \(T^k\) for \(k \in \mathbb{Z}\) is the \(k\)-th power of \(T\) in the group of bijections of \(X\). Then for all real numbers \(r > 2\) and \(\Lambda > 1\) there is a constant \(C \ge 0\), which may depend on \(r\), \(\Lambda\) and all of the data above, such that for all \(f \in L^{p_1}(\mu)\) and \(g \in L^{p_2}(\mu)\) with values in \(\mathbb{C}\) and every \(\Lambda\)-lacunary sequence \((a_n)_{n \in \mathbb{N}}\) of nonnegative reals (that is, \(a_{n+1} / a_n > \Lambda\) for all \(n\)) with \(a_n \ge 1\) for all \(n\),
where \(\| \cdot \|_{\mathbb{V}^r}\) is the \(r\)-variational norm of a sequence of complex numbers.
This is Theorem 1.17(iv) of Krause, Mirek and Tao.
public theorem_wanted theorem_1_17_iv (r Λ : ℝ≥0) (hr : r > 2) (hΛ : Λ > 1) :
∃ C : ℝ≥0, ∀ {f g : 𝓧 → ℂ} (hf : MemLp f p₁ μ) (hg : MemLp g p₂ μ) (a : ℕ → ℝ≥0),
Lacunary Λ a → (∀ n, 1 ≤ a n) →
eLpNorm (fun x ↦ variationalNorm r fun n ↦ A T (a n) X P f g x) p μ ≤
C * ‖hf.toLp‖ₑ * ‖hg.toLp‖ₑ
def Lacunary (Λ : ℝ≥0) (a : ℕ → ℝ≥0) : Prop := ∀ n, a (n + 1) / a n > Λ
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:62
noncomputable def variationalNorm (r : ℝ≥0) (a : ℕ → ℂ) : ℝ≥0∞ :=
(⨆ n, ‖a n‖ₑ) + ⨆ (J : ℕ) (N : ℕ → ℕ) (_ : Monotone N),
ENNReal.ofReal ‖(WithLp.toLp r (fun (i : Fin J) ↦ a (N (i + 1)) - a (N i)))‖
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:68
noncomputable def A (T : 𝓧 ≃ᵐ 𝓧) (N : ℝ≥0) (P₁ : ℤ[X]) (P₂ : ℤ[X]) (f g : 𝓧 → ℂ) (x : 𝓧) : ℂ :=
(Nat.floor N : ℝ)⁻¹ * ∑ n ∈ Icc 1 (Nat.floor N),
f ((T ^ (P₁.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x) * g ((T ^ (P₂.eval (n : ℤ)) : 𝓧 ≃ 𝓧) x)
WantedExt/Dynamics/PointwiseErgodicTheoremsWanted.lean:83
Sources
- B. Krause, M. Mirek, and T. Tao,
Pointwise ergodic theorems for non-conventional bilinear polynomial averages, Annals of Math, 195 (3) 2022. Statement taken from https://github.com/ImperialCollegeLondon/AnnalsChallenge. Problemannals_pointwise_ergodic_theoremsof the lean-eval benchmark.
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.