Multilinear Wiener-Wintner type ergodic averages and its application
نویسندگان
چکیده
This paper extends the generalized Wiener–Wintner Theorem built by Host and Kra to multilinear case under hypothesis of pointwise convergence ergodic averages. In particular, we have following result:Let $ (X, {\mathcal B}, \mu, T) be a measure preserving system. Let b two distinct non-zero integers. Then for any f_{1}, f_{2}\in L^{\infty}(\mu) $, there exists full subset X(f_{1}, f_{2}) X such that x\in nilsequence {\textbf b} = \{b_n\}_{n\in {\mathbb Z}} $,$ \lim\limits_{N\rightarrow \infty}\frac{1}{N}\sum\limits_{n 0}^{N-1}b_{n}f_{1}(T^{an}x)f_{2}(T^{bn}x) $exists.
منابع مشابه
Wiener-wintner for Hilbert Transform
We prove the following extension of the Wiener–Wintner Theorem and the Carleson Theorem on pointwise convergence of Fourier series: For all measure preserving flows (X,μ, Tt) and f ∈ L(X,μ), there is a set Xf ⊂ X of probability one, so that for all x ∈ Xf we have lim s↓0 ∫ s<|t|<1/s e f(Tt x) dt t exists for all θ. The proof is by way of establishing an appropriate oscillation inequality which ...
متن کاملUniformity in the Polynomial Wiener-wintner Theorem
exists for every α ∈ R, where e(t) = e. What makes this a nontrivial strengthening of the Birkhoff ergodic theorem is that the set of full measure for which we have convergence does not depend on the choice of α ∈ R. Two different proofs of this theorem are based on the following results which are of interest on their own: (i) For ergodic systems, if f ∈ L(μ) and f ∈ E1(T ) , then for a.e. x ∈ ...
متن کاملConvergence of Diagonal Ergodic Averages
The case l = 1 is the mean ergodic theorem, and the result can be viewed as a generalization of that theorem. The l = 2 case was proven by Conze and Lesigne [Conze and Lesigne, 1984], and various special cases for higher l have been shown by Zhang [Zhang, 1996], Frantzikinakis and Kra [Frantzikinakis and Kra, 2005], Lesigne [Lesigne, 1993], and Host and Kra [Host and Kra, 2005]. Tao’s argument ...
متن کاملLocal Stability of Ergodic Averages
We consider the extent to which one can compute bounds on the rate of convergence of a sequence of ergodic averages. It is not difficult to construct an example of a computable Lebesgue-measure preserving transformation of [0, 1] and a characteristic function f = χA such that the ergodic averages Anf do not converge to a computable element of L ([0, 1]). In particular, there is no computable bo...
متن کاملErgodic averages with deterministic weights
i.e., there exists a constant C such that SN(θ, u) ≤ CN . We define δ(θ, u) to be the infimum of the δ satisfying H1 for θ and u. About H1, in the case where θ takes its values in U (the set of complex numbers of modulus 1), it is clear that for all sequences θ and u, δ(θ, u) is smaller than or equal to 1 and it is well-known (see [Ka] for example) that it is greater than or equal to 1/2. Few e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems
سال: 2023
ISSN: ['1553-5231', '1078-0947']
DOI: https://doi.org/10.3934/dcds.2023109