Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pretentious Measure-Preserving Multiplicative Actions

Updated 4 July 2026
  • Pretentious measure-preserving multiplicative actions are probability-preserving dynamical systems indexed by multiplicative semigroups, where prime-step operators serve as local coordinates.
  • The spectral framework uses pretentious distances from analytic number theory to decompose functions into components modeled by Dirichlet characters and Archimedean eigenfunctions.
  • Recent advances demonstrate mean ergodic theorems, joint ergodicity, and recurrence along rational polynomial iterates, deepening our understanding of multiplicative dynamics.

Pretentious measure-preserving multiplicative actions are probability-preserving dynamical systems indexed by the multiplicative semigroup of positive integers, or its extension to Q+\mathbb Q_+, in which the relevant structure is governed not by ordinary invariant or eigenfunctions alone, but by a multiplicative analogue of pretentiousness from analytic number theory. In this setting, prime-step operators play the role of local coordinates, and the central question is whether an L2L^2-function behaves, on most primes in a logarithmic sense, like an invariant function, a Dirichlet-character model, or a more general completely multiplicative eigenmodel. Recent work develops this viewpoint into an ergodic theory of multiplicative actions, proving mean ergodic theorems, decomposition results, joint ergodicity criteria, recurrence theorems for rational polynomial iterates, and structural descriptions of associated Furstenberg systems (Charamaras, 2024, Frantzikinakis, 19 Mar 2025, Frantzikinakis et al., 2023, Frantzikinakis et al., 13 Aug 2025).

1. Formal definition and ambient framework

A multiplicative system is a probability measure-preserving system (X,μ,S)(X,\mu,S), where S=(Sn)n∈NS=(S_n)_{n\in\mathbb N} is a family of commuting invertible measure-preserving transformations such that

Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.

If this identity only holds for coprime n,mn,m, the system is called weakly multiplicative (Charamaras, 2024). A multiplicative measure-preserving action is similarly described as a quadruple

(X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),

with

T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,

and it is extended to Q+\mathbb Q_+ by

Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N

(Frantzikinakis, 19 Mar 2025, Frantzikinakis et al., 13 Aug 2025).

The associated Koopman operators act on L2L^20 by

L2L^21

or equivalently L2L^22 in the second notation (Charamaras, 2024). A system is finitely generated if the set of prime-step transformations is finite:

L2L^23

depending on notation (Charamaras, 2024, Frantzikinakis, 19 Mar 2025, Frantzikinakis et al., 13 Aug 2025). This hypothesis is central in the strongest convergence, decomposition, and inverse-theorem statements.

The spectral formulation is built from completely multiplicative L2L^24-valued functions. For L2L^25 and a multiplicative action L2L^26, the map

L2L^27

is positive definite, so by Bochner–Herglotz there exists a finite Borel measure L2L^28 on the compact group L2L^29 of completely multiplicative (X,μ,S)(X,\mu,S)0-valued functions such that

(X,μ,S)(X,\mu,S)1

(Frantzikinakis et al., 13 Aug 2025). This identity is the basic bridge between multiplicative dynamics and multiplicative number theory.

2. Pretentiousness as multiplicative spectral structure

The organizing notion comes from the pretentious distance. For multiplicative functions (X,μ,S)(X,\mu,S)2 or (X,μ,S)(X,\mu,S)3, the basic distance is

(X,μ,S)(X,\mu,S)4

and one writes (X,μ,S)(X,\mu,S)5 if (X,μ,S)(X,\mu,S)6 (Frantzikinakis et al., 2023). In the generalized interval form used for recurrence problems,

(X,μ,S)(X,\mu,S)7

with (X,μ,S)(X,\mu,S)8 (Frantzikinakis et al., 13 Aug 2025).

A completely multiplicative function is pretentious if there exist a Dirichlet character (X,μ,S)(X,\mu,S)9 and a real S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}0 such that

S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}1

The pretentious class is denoted S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}2 in the recurrence paper (Frantzikinakis et al., 13 Aug 2025). In the Furstenberg-system analysis, the special pretentious models are Dirichlet characters and Archimedean characters S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}3, S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}4 (Frantzikinakis et al., 2023).

For unitary multiplicative actions S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}5 on S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}6 and nonzero S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}7, the dynamical pretentious distance is

S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}8

If S=(Sn)n∈NS=(S_n)_{n\in\mathbb N}9 comes from a completely multiplicative function Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.0 via Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.1, then Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.2 denotes Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.3 (Charamaras, 2024). This measures whether Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.4 behaves like Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.5 for most primes.

A function Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.6 is called pretending to be invariant if

Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.7

and the corresponding collection is Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.8 (Charamaras, 2024). More generally, Snm=Sn∘Sm∀ n,m∈N.S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.9 is a pretentious eigenfunction with pretentious eigenvalue n,mn,m0 if

n,mn,m1

and the collection is denoted n,mn,m2 (Charamaras, 2024). For finitely generated systems, these are exactly the functions satisfying

n,mn,m3

(Charamaras, 2024).

The global system-level notion appears explicitly in the generalized Pythagorean recurrence paper: a multiplicative action is pretentious if the spectral measure of every n,mn,m4 is supported on the set of pretentious multiplicative functions,

n,mn,m5

(Frantzikinakis et al., 13 Aug 2025). This makes pretentiousness a spectral support condition rather than merely a property of selected observables.

3. Mean ergodic theory and decomposition theorems

The mean ergodic theorem for finitely generated multiplicative systems is the main theorem of "Mean value theorems in multiplicative systems and joint ergodicity of additive and multiplicative actions" (Charamaras, 2024). For a finitely generated multiplicative system n,mn,m6 and any n,mn,m7, the additive averages

n,mn,m8

always converge in n,mn,m9 (Charamaras, 2024). The limit is governed by the pretentiously invariant factor (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),0 rather than the ordinary invariant factor. The paper identifies pretentious ergodicity by the condition that these averages always converge to the space average,

(X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),1

for every (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),2 (Charamaras, 2024).

Two orthogonal decomposition theorems form the structural core of the theory.

First, the rational/aperiodic decomposition:

(X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),3

where (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),4 is the closed span of functions (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),5 for which there exists a Dirichlet character (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),6 with (X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),7, and

(X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),8

(Charamaras, 2024).

Second, the pretentious eigen/pretentious weak-mixing decomposition:

(X,X,μ,(Tn)n∈N),(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),9

where T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,0 is the closed span of functions with T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,1 for some finitely generated completely multiplicative T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,2, and

T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,3

(Charamaras, 2024). The paper presents this as the multiplicative analogue of the Jacobs–de Leeuw–Glicksberg decomposition.

Further structural statements sharpen the spectral picture. The pretentiously invariant functions coincide with the T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,4-closure of the pretentiously invariant T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,5-algebra, T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,6 is an algebra, if T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,7 then T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,8, and if T1=id,Tmn=Tm∘Tnfor all m,n∈N,T_1=\mathrm{id},\qquad T_{mn}=T_m\circ T_n\quad \text{for all }m,n\in\mathbb N,9 then Q+\mathbb Q_+0 (Charamaras, 2024). These properties show that the multiplicative spectral decomposition clusters into equivalence classes under finite pretentious distance.

A weighted form of the mean ergodic theorem extends the analogy with Halász’s theorem. For Q+\mathbb Q_+1 and Q+\mathbb Q_+2, the weighted averages

Q+\mathbb Q_+3

converge in Q+\mathbb Q_+4, and the limit is controlled by the projection Q+\mathbb Q_+5 onto Q+\mathbb Q_+6 (Charamaras, 2024). The proof uses the spectral theorem for unitary multiplicative actions, the identity

Q+\mathbb Q_+7

a decomposition Q+\mathbb Q_+8, and a convolution/Euler-product argument modeled on Delange’s treatment of multiplicative functions (Charamaras, 2024).

4. Aperiodicity, pretentious weak mixing, and joint ergodicity

The multiplicative setting refines the usual ergodic hierarchy. A multiplicative system is called aperiodic if averages along every arithmetic progression converge to the space average:

Q+\mathbb Q_+9

(Charamaras, 2024). It is pretentiously weak-mixing if Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N0 is pretentiously ergodic (Charamaras, 2024).

These notions admit spectral characterizations. The system is aperiodic if and only if Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N1 consists of constants and Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N2 for every non-principal Dirichlet character Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N3; equivalently, it is pretentiously ergodic and has no nontrivial pretentiously rational spectrum (Charamaras, 2024). Likewise, it is pretentiously weak-mixing if and only if Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N4 consists of constants and Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N5 for every Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N6 with Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N7, equivalently if it has no non-constant pretentious eigenfunctions (Charamaras, 2024).

The paper emphasizes strict implication chains:

Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N8

while the converses fail in general (Charamaras, 2024). The examples mentioned there include a multiplicative rotation that is ergodic but not pretentiously ergodic, and another that is totally ergodic but not aperiodic because of a pretentious rational eigenvalue (Charamaras, 2024). A common misconception is therefore that the multiplicative theory merely renames standard additive ergodic notions; the cited counterexamples show that pretentiousness detects genuinely finer prime-indexed structure.

The same paper studies joint ergodicity of an additive and a finitely generated multiplicative action acting on the same probability space. Theorem B states that such actions are jointly ergodic whenever no local obstructions arise, and it gives a concrete description of these local obstructions (Charamaras, 2024). The data block does not reproduce the obstruction formula, but it explicitly identifies the theorem as a natural expression of the independence principle between additive and multiplicative structures of the integers. This suggests that joint ergodicity here functions as a precise dynamical formalization of additive–multiplicative independence.

5. Pretentious–aperiodic splitting, mixed seminorms, and rational iterates

"Decomposition results for multiplicative actions and applications" develops a structural theory adapted to multiple recurrence and convergence problems for multiplicative actions with rational iterates (Frantzikinakis, 19 Mar 2025). For every multiplicative action and every Tm/n:=Tm∘Tn−1,m,n∈NT_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N9, there exist orthogonal components

L2L^200

where L2L^201 is the subspace of functions whose spectral measure is supported on pretentious multiplicative functions and L2L^202 is the corresponding aperiodic subspace (Frantzikinakis, 19 Mar 2025). In fact,

L2L^203

For finitely generated actions, this decomposition has stronger consequences: L2L^204 is the pretentious projection, L2L^205 is annihilated by the mixed seminorms introduced in the paper, and L2L^206 has vanishing averages along the rational polynomial iterates considered there (Frantzikinakis, 19 Mar 2025).

The major technical novelty is a family of mixed seminorms combining additive shifts with multiplicative iterates. For L2L^207, the seminorms are defined by

L2L^208

These are tailored to patterns such as

L2L^209

and more generally to rational combinations of linear forms (Frantzikinakis, 19 Mar 2025).

For finitely generated multiplicative actions, the inverse theorem identifies the vanishing factor of these seminorms exactly:

L2L^210

More precisely, the following are equivalent: L2L^211; L2L^212 in L2L^213 for every L2L^214, L2L^215; L2L^216; and L2L^217 for every L2L^218 (Frantzikinakis, 19 Mar 2025). This yields an exact description of the aperiodic factor as the orthogonal complement of the pretentious factor.

The same paper proves convergence and recurrence theorems for rational polynomials factoring into products of pairwise independent linear forms. For finitely generated multiplicative actions and pairwise independent linear forms L2L^219 with non-negative coefficients, the averages

L2L^220

converge in L2L^221 for all L2L^222 and every L2L^223-dimensional grid L2L^224 (Frantzikinakis, 19 Mar 2025). If all actions are aperiodic and L2L^225, the limit is the product of the integrals (Frantzikinakis, 19 Mar 2025). A second theorem treats two rational polynomials L2L^226 factoring linearly, with explicit restrictions on L2L^227 and an excluded power form for L2L^228, and again proves L2L^229 convergence (Frantzikinakis, 19 Mar 2025).

The proofs combine four ingredients stated explicitly in the paper: the decomposition L2L^230, seminorm control that discards the aperiodic part, concentration estimates for the pretentious part, an averaging-over-congruence-classes "L2L^231-trick," and mean ergodic theorems for multiplicative actions (Frantzikinakis, 19 Mar 2025). The resulting framework is then applied to density regularity of homogeneous quadratic equations such as

L2L^232

and more generally

L2L^233

(Frantzikinakis, 19 Mar 2025).

6. Furstenberg systems, recurrence along quadratic equations, and current scope

The Furstenberg-system perspective studies dynamical systems naturally attached to bounded multiplicative functions rather than arbitrary multiplicative actions. For a bounded sequence L2L^234, weak-* limits of empirical orbit measures under the shift on L2L^235 define Furstenberg systems using Cesàro or logarithmic averages (Frantzikinakis et al., 2023). For pretentious multiplicative functions, every Furstenberg system has rational discrete spectrum, hence zero entropy (Frantzikinakis et al., 2023). The same paper proves that the only pretentious multiplicative functions whose Furstenberg systems have trivial rational spectrum are the Archimedean characters L2L^236, and that a pretentious multiplicative function has ergodic Furstenberg systems if and only if it pretends to be a Dirichlet character (Frantzikinakis et al., 2023). It also shows that for a fixed pretentious multiplicative function, all Furstenberg systems are isomorphic (Frantzikinakis et al., 2023).

These Furstenberg-system results are not formulated as theorems about arbitrary pretentious multiplicative actions, but they clarify the model objects that pretentious spectral components emulate. In particular, they show that pretentiousness is dynamically rigid, yet not uniformly ergodic: the Archimedean factor L2L^237 contributes an identity component and forces non-ergodicity when L2L^238 (Frantzikinakis et al., 2023). They also expose a distinction between logarithmic and Cesàro averaging. For logarithmic averages of bounded multiplicative functions,

L2L^239

where strong stationarity means

L2L^240

for all L2L^241 and all shifts L2L^242, but this equivalence fails for Cesàro averages (Frantzikinakis et al., 2023). This is an objective source of subtlety in the subject: averaging mode affects the limiting dynamical structure.

A later development establishes multiple recurrence for pretentious multiplicative actions along generalized Pythagorean triples. For a Rado triple L2L^243, meaning

L2L^244

the main theorem states that for every pretentious multiplicative action L2L^245, every measurable L2L^246 with L2L^247, and every L2L^248, there exist distinct L2L^249 such that

L2L^250

and

L2L^251

(Frantzikinakis et al., 13 Aug 2025). The proof uses explicit parametrizations of the quadratic equation, structured factors built from Archimedean and finitely supported pretentious components, concentration estimates for pretentious functions, multiplicative averaging sets L2L^252, L2L^253, L2L^254, and Chu’s inequality

L2L^255

for nonnegative L2L^256 (Frantzikinakis et al., 13 Aug 2025).

The combinatorial consequence is that if L2L^257 are pretentious completely multiplicative functions, then for every open arc L2L^258 containing L2L^259, there exist distinct L2L^260 such that

L2L^261

and

L2L^262

(Frantzikinakis et al., 13 Aug 2025). This confirms the generalized Pythagorean partition-regularity phenomenon in the pretentious setting.

Across these works, several boundaries of the theory are explicit. The finitely generated hypothesis remains crucial for the strongest mean ergodic, inverse-theorem, and decomposition results (Charamaras, 2024, Frantzikinakis, 19 Mar 2025). For general multiplicative actions, some conclusions weaken and averages may need to be restricted to special sets close to L2L^263 multiplicatively (Frantzikinakis, 19 Mar 2025). Open problems explicitly mentioned include extensions to Pythagorean triples L2L^264, higher-degree patterns, and extension of the mixed-seminorm inverse theorem to arbitrary multiplicative actions (Frantzikinakis, 19 Mar 2025). A plausible implication is that the long-term structure of the theory will continue to be organized by the same dichotomy already visible in current results: pretentious components contribute concentration and structured recurrence, while aperiodic components contribute vanishing and cancellation.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Pretentious Measure-Preserving Multiplicative Actions.