---
title: Pretentious Measure-Preserving Multiplicative Actions
url: https://www.emergentmind.com/topics/pretentious-measure-preserving-multiplicative-actions
type: topic
---

# Pretentious Measure-Preserving Multiplicative Actions

Pretentious measure-preserving multiplicative actions are probability-preserving dynamical systems indexed by the multiplicative semigroup of positive integers, or its extension to $\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 $L^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 [2403.13744], [2503.15175], [2304.03121], [2508.09778].

## 1. Formal definition and ambient framework

A multiplicative system is a probability measure-preserving system $(X,\mu,S)$, where $S=(S_n)_{n\in\mathbb N}$ is a family of commuting invertible measure-preserving transformations such that
$$
S_{nm}=S_n\circ S_m \qquad \forall\, n,m\in\mathbb N.
$$
If this identity only holds for coprime $n,m$, the system is called weakly multiplicative [2403.13744]. A multiplicative measure-preserving action is similarly described as a quadruple
$$
(X,\mathcal X,\mu,(T_n)_{n\in\mathbb N}),
$$
with
$$
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 $\mathbb Q_+$ by
$$
T_{m/n}:=T_m\circ T_n^{-1},\qquad m,n\in\mathbb N
$$
[2503.15175], [2508.09778].

The associated Koopman operators act on $L^2(X)$ by
$$
S_nF = F\circ S_n,
$$
or equivalently $T_nF=F\circ T_n$ in the second notation [2403.13744]. A system is finitely generated if the set of prime-step transformations is finite:
$$
\{S_p:p\in\mathbb P\}\ \text{is finite}
\quad\text{or}\quad
\{T_p:p\in\mathbb P\}\ \text{is finite}
$$
depending on notation [2403.13744], [2503.15175], [2508.09778]. This hypothesis is central in the strongest convergence, decomposition, and inverse-theorem statements.

The spectral formulation is built from completely multiplicative $\mathbb S^1$-valued functions. For $F\in L^2(\mu)$ and a multiplicative action $(T_n)$, the map
$$
(\mathbb Q_{>0},\times)\to \mathbb C,\qquad r/s\mapsto \int_X T_rF\cdot T_s\overline F\,d\mu
$$
is positive definite, so by Bochner–Herglotz there exists a finite Borel measure $\sigma_F$ on the compact group $\mathcal M$ of completely multiplicative $\mathbb S^1$-valued functions such that
$$
\int_X T_rF\cdot T_s\overline F\,d\mu
=
\int_{\mathcal M} f(r)\overline{f(s)}\,d\sigma_F(f)
$$
[2508.09778]. 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 $f,g:\mathbb N\to\mathbb U$ or $\mathbb S^1$, the basic distance is
$$
D^2(f,g)=\sum_{p\in\mathbb P}\frac{1-\Re(f(p)\overline{g(p)})}{p},
$$
and one writes $f\sim g$ if $D(f,g)<\infty$ [2304.03121]. In the generalized interval form used for recurrence problems,
$$
(f,g;A,B) := \Bigg(\sum_{A<p\le B}\frac1p\Big(1-\Re\big(f(p)\overline{g(p)}\big)\Big)\Bigg)^{1/2},
$$
with $(f,g):=\lim_{X\to\infty}(f,g;1,X)$ [2508.09778].

A completely multiplicative function is pretentious if there exist a Dirichlet character $\chi$ and a real $t$ such that
$$
f\sim \chi\, n^{it}.
$$
The pretentious class is denoted $\mathcal M_p$ in the recurrence paper [2508.09778]. In the Furstenberg-system analysis, the special pretentious models are Dirichlet characters and Archimedean characters $n^{it}$, $t\neq 0$ [2304.03121].

For unitary multiplicative actions $S,R$ on $L^2(X)$ and nonzero $F\in L^2(X)$, the dynamical pretentious distance is
$$
D_F(S,R)^2 := \sum_{p\in\mathbb P}\frac{\|F\|_2^2-\langle S_pF,R_pF\rangle}{p}
= \frac12\sum_{p\in\mathbb P}\frac{\|S_pF-R_pF\|_2^2}{p}.
$$
If $R$ comes from a completely multiplicative function $f$ via $R_nG=f(n)G$, then $D_F(S,f)$ denotes $D_F(S,R)$ [2403.13744]. This measures whether $S_pF$ behaves like $f(p)F$ for most primes.

A function $F$ is called pretending to be invariant if
$$
D_F(S,1)<\infty,
$$
and the corresponding collection is $H_1$ [2403.13744]. More generally, $F$ is a pretentious eigenfunction with pretentious eigenvalue $f\in M^c$ if
$$
D_F(S,f)<\infty,
$$
and the collection is denoted $H_f$ [2403.13744]. For finitely generated systems, these are exactly the functions satisfying
$$
S_pF=f(p)F \quad \text{for almost every prime }p
$$
[2403.13744].

The global system-level notion appears explicitly in the generalized Pythagorean recurrence paper: a multiplicative action is pretentious if the spectral measure of every $F\in L^2(\mu)$ is supported on the set of pretentious multiplicative functions,
$$
\operatorname{supp}(\sigma_F)\subseteq \mathcal M_p \qquad\text{for every }F\in L^2(\mu)
$$
[2508.09778]. 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" [2403.13744]. For a finitely generated multiplicative system $(X,\mu,S)$ and any $F\in L^2(X)$, the additive averages
$$
\frac1N\sum_{n=1}^N S_nF
$$
always converge in $L^2(X)$ [2403.13744]. The limit is governed by the pretentiously invariant factor $\sigma(pr)$ rather than the ordinary invariant factor. The paper identifies pretentious ergodicity by the condition that these averages always converge to the space average,
$$
\lim_{N\to\infty}\frac1N\sum_{n=1}^N S_nF = \int_X F\,d\mu
\qquad \text{in }L^2(X),
$$
for every $F\in L^2(X)$ [2403.13744].

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

First, the rational/aperiodic decomposition:
$$
L^2(X)= H_{\mathrm{pr.rat}}\oplus H_{\mathrm{aper}},
$$
where $H_{\mathrm{pr.rat}}$ is the closed span of functions $F$ for which there exists a Dirichlet character $\chi$ with $D_F(S,\chi)<\infty$, and
$$
H_{\mathrm{aper}}
=
\left\{F\in L^2(X): \lim_{N\to\infty}\Big\|\frac1N\sum_{n=1}^N S_{qn+r}F\Big\|_2=0 \ \forall r,q\in\mathbb N\right\}
$$
[2403.13744].

Second, the pretentious eigen/pretentious weak-mixing decomposition:
$$
L^2(X)=H_{\mathrm{pr.eig}}\oplus H_{\mathrm{pr.wm}},
$$
where $H_{\mathrm{pr.eig}}$ is the closed span of functions with $D_F(S,f)<\infty$ for some finitely generated completely multiplicative $f$, and
$$
H_{\mathrm{pr.wm}}
=
\left\{F\in L^2(X): \lim_{N\to\infty}\frac1N\sum_{n=1}^N\left|\int_X S_nF\cdot \overline F\,d\mu\right|=0\right\}
$$
[2403.13744]. 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 $L^2$-closure of the pretentiously invariant $\sigma$-algebra, $pr$ is an algebra, if $D(f,g)=\infty$ then $H_f\perp H_g$, and if $D(f,g)<\infty$ then $H_f=H_g$ [2403.13744]. 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 $f\in M^c_{\mathrm{fg}}$ and $F\in L^2(X)$, the weighted averages
$$
\frac1N\sum_{n=1}^N \overline{f(n)}\,S_nF
$$
converge in $L^2(X)$, and the limit is controlled by the projection $P_fF$ onto $\overline{H_f}$ [2403.13744]. The proof uses the spectral theorem for unitary multiplicative actions, the identity
$$
D_F(S,f)^2=\int D(g,f)^2\,d\mu_F(g),
$$
a decomposition $L^2(X)=\overline{H_f}\oplus V_f$, and a convolution/Euler-product argument modeled on Delange’s treatment of multiplicative functions [2403.13744].

## 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:
$$
\lim_{N\to\infty}\frac1N\sum_{n=1}^N S_{qn+r}F = \int_X F\,d\mu \quad \forall r,q
$$
[2403.13744]. It is pretentiously weak-mixing if $S\times S$ is pretentiously ergodic [2403.13744].

These notions admit spectral characterizations. The system is aperiodic if and only if $H_1$ consists of constants and $H_\chi=\{0\}$ for every non-principal Dirichlet character $\chi$; equivalently, it is pretentiously ergodic and has no nontrivial pretentiously rational spectrum [2403.13744]. Likewise, it is pretentiously weak-mixing if and only if $H_1$ consists of constants and $H_f=\{0\}$ for every $f$ with $D(f,1)=\infty$, equivalently if it has no non-constant pretentious eigenfunctions [2403.13744].

The paper emphasizes strict implication chains:
$$
\text{pretentiously ergodic} \Rightarrow \text{ergodic},\qquad
\text{aperiodic} \Rightarrow \text{totally ergodic},\qquad
\text{pretentiously weak-mixing} \Rightarrow \text{weak-mixing},
$$
while the converses fail in general [2403.13744]. 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 [2403.13744]. 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 [2403.13744]. 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 [2503.15175]. For every multiplicative action and every $F\in L^2(\mu)$, there exist orthogonal components
$$
F=F_p+F_a,\qquad F_p\in X_p,\quad F_a\in X_a,\quad F_p\perp F_a,
$$
where $X_p$ is the subspace of functions whose spectral measure is supported on pretentious multiplicative functions and $X_a$ is the corresponding aperiodic subspace [2503.15175]. In fact,
$$
F_p = \mathbb E(F\mid X_p).
$$
For finitely generated actions, this decomposition has stronger consequences: $F_p$ is the pretentious projection, $F_a$ is annihilated by the mixed seminorms introduced in the paper, and $F_a$ has vanishing averages along the rational polynomial iterates considered there [2503.15175].

The major technical novelty is a family of mixed seminorms combining additive shifts with multiplicative iterates. For $F\in L^\infty(\mu)$, the seminorms are defined by
$$
\|F\|_{U^s} := \limsup_{N\to\infty} \int \| \big(F(T_n x)\big)_{n\in[N]} \|_{U^s(\mathbb Z_N)}\,d\mu(x). \tag{6.3}
$$
These are tailored to patterns such as
$$
T_m,\quad T_n,\quad T_{m+n},\quad T_{m+2n},
$$
and more generally to rational combinations of linear forms [2503.15175].

For finitely generated multiplicative actions, the inverse theorem identifies the vanishing factor of these seminorms exactly:
$$
\|F\|_{U^s}=0\ \text{for some }s\ge 2
\quad\Longleftrightarrow\quad
F\in X_a
\quad\Longleftrightarrow\quad
\mathbb E\big(F\mid X_p\big)=0.
$$
More precisely, the following are equivalent: $F\in X_a$; $\lim_{N\to\infty}\mathbb E_{n\le N} T_{an+b}F =0$ in $L^2(\mu)$ for every $a\in\mathbb N$, $b\in\mathbb Z_+$; $\|F\|_{U^2}=0$; and $\|F\|_{U^s}=0$ for every $s\ge 2$ [2503.15175]. 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 $L_1,\dots,L_e$ with non-negative coefficients, the averages
$$
\mathbb E_{m,n\in[N]} \mathbf 1_A(m,n)\, T_{1,L_1(m,n)}F_1\cdots T_{e,L_e(m,n)}F_e
$$
converge in $L^2(\mu)$ for all $F_1,\dots,F_e\in L^\infty(\mu)$ and every $2$-dimensional grid $A$ [2503.15175]. If all actions are aperiodic and $A=\mathbb Z^2$, the limit is the product of the integrals [2503.15175]. A second theorem treats two rational polynomials $R_1,R_2$ factoring linearly, with explicit restrictions on $R_2$ and an excluded power form for $R_1$, and again proves $L^2$ convergence [2503.15175].

The proofs combine four ingredients stated explicitly in the paper: the decomposition $F=F_p+F_a$, seminorm control that discards the aperiodic part, concentration estimates for the pretentious part, an averaging-over-congruence-classes "$Q$-trick," and mean ergodic theorems for multiplicative actions [2503.15175]. The resulting framework is then applied to density regularity of homogeneous quadratic equations such as
$$
x^2-y^2=yz,\qquad x^2+y^2=2z^2,\qquad x^2-y^2=xz
$$
and more generally
$$
ax^2+by^2=dxy+exz+fyz \quad\text{with }a+b=d
$$
[2503.15175].

## 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 $a:\mathbb Z\to\mathbb U$, weak-* limits of empirical orbit measures under the shift on $\mathbb U^\mathbb Z$ define Furstenberg systems using Cesàro or logarithmic averages [2304.03121]. For pretentious multiplicative functions, every Furstenberg system has rational discrete spectrum, hence zero entropy [2304.03121]. The same paper proves that the only pretentious multiplicative functions whose Furstenberg systems have trivial rational spectrum are the Archimedean characters $n^{it}$, and that a pretentious multiplicative function has ergodic Furstenberg systems if and only if it pretends to be a Dirichlet character [2304.03121]. It also shows that for a fixed pretentious multiplicative function, all Furstenberg systems are isomorphic [2304.03121].

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 $n^{it}$ contributes an identity component and forces non-ergodicity when $t\neq 0$ [2304.03121]. They also expose a distinction between logarithmic and Cesàro averaging. For logarithmic averages of bounded multiplicative functions,
$$
\text{trivial rational spectrum} \iff \text{strong stationarity},
$$
where strong stationarity means
$$
\int \prod_{j=1}^\ell T^{n_j}F_j\,d\mu
=
\int \prod_{j=1}^\ell T^{rn_j}F_j\,d\mu
$$
for all $r\in\mathbb N$ and all shifts $n_j$, but this equivalence fails for Cesàro averages [2304.03121]. 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 $(a,b,c)$, meaning
$$
a=c,\quad b=c,\quad \text{or}\quad a+b=c,
$$
the main theorem states that for every pretentious multiplicative action $(X,\mathcal X,\mu,T_n)$, every measurable $A$ with $\mu(A)>0$, and every $\varepsilon>0$, there exist distinct $x,y,z\in\mathbb N$ such that
$$
\mu\bigl(A\cap T_x^{-1}A\cap T_y^{-1}A\cap T_z^{-1}A\bigr)
\ge (\mu(A))^4-\varepsilon
$$
and
$$
ax^2+by^2=cz^2
$$
[2508.09778]. 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 $\Phi_r$, $\Phi_{r,K}$, $\Phi_{r,K,P}$, and Chu’s inequality
$$
\int_X F\cdot (F|\mathcal Y_1)\cdots(F|\mathcal Y_\ell)\,d\mu \ge \Big(\int_X F\,d\mu\Big)^{\ell+1}
$$
for nonnegative $F$ [2508.09778].

The combinatorial consequence is that if $f_1,\dots,f_s:\mathbb N\to\mathbb S^1$ are pretentious completely multiplicative functions, then for every open arc $I\subset \mathbb S^1$ containing $1$, there exist distinct $x,y,z\in\mathbb N$ such that
$$
ax^2+by^2=cz^2
$$
and
$$
f_j(x),f_j(y),f_j(z)\in I\qquad (j=1,\dots,s)
$$
[2508.09778]. 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 [2403.13744], [2503.15175]. For general multiplicative actions, some conclusions weaken and averages may need to be restricted to special sets close to $1$ multiplicatively [2503.15175]. Open problems explicitly mentioned include extensions to Pythagorean triples $x^2+y^2=z^2$, higher-degree patterns, and extension of the mixed-seminorm inverse theorem to arbitrary multiplicative actions [2503.15175]. 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.

Source: https://www.emergentmind.com/topics/pretentious-measure-preserving-multiplicative-actions