Let GG be a with a fixed left μ\mu. For functions f,g:G→Cf,g:G\to\mathbb C for which the exists, their convolution is

(f∗g)(x)=∫Gf(y)g(y−1x) dμ(y).(f*g)(x) = \int_G f(y)g(y^{-1}x)\,d\mu(y).

In particular, this formula defines f∗gf*g for compactly supported continuous functions and, up to , for f,g∈L1(G)f,g\in L^1(G). The order of the factors matters: unless GG is abelian, f∗gf*g need not equal g∗fg*f. Fixing left rather than right Haar measure also fixes the displayed convention.

Algebraic and analytic properties

Convolution is bilinear and associative whenever the relevant integrals are defined. On L1(G)L^1(G), it satisfies

∥f∗g∥1≤∥f∥1∥g∥1.\lVert f*g\rVert_1\leq \lVert f\rVert_1\lVert g\rVert_1.

Consequently L1(G)L^1(G) becomes a under convolution. Compactly supported continuous functions are also closed under convolution. The proofs combine left invariance of Haar measure with Tonelli’s theorem and a change of variables.

Translation interpretation

Writing Lyg(x)=g(y−1x)L_y g(x)=g(y^{-1}x), the value (f∗g)(x)(f*g)(x) averages the left translates LygL_y g, weighted by f(y)f(y). This viewpoint explains why convolution converts into operators: a representation can integrate the operators assigned to group elements against ff.

Involution and modular correction

For non-unimodular groups, inversion does not preserve a left Haar measure. The natural star operation on the convolution algebra must therefore include the . The precise correction is recorded in the ; omitting it generally breaks the identity (f∗g)∗=g∗∗f∗(f*g)^*=g^{*}*f^{*}.

References
  1. Gerald B. Folland, A Course in Abstract Harmonic Analysis, 2nd ed., CRC Press, 2016. Routledge publisher record. Relevant: Chapter 2, “Convolutions.”
  2. Edwin Hewitt and Kenneth A. Ross, Abstract Harmonic Analysis, Volume I, Springer, 1963. Springer DOI record. Relevant: “Convolutions and Group Representations.”
Euclidean and one-sided conventions

On the additive group Rn\mathbb R^n, Lebesgue measure gives

(f∗g)(x)=∫Rnf(y)g(x−y) dy.(f*g)(x)=\int_{\mathbb R^n}f(y)g(x-y)\,dy.

For functions on the positive time axis extended by zero to negative times, the same formula becomes (f∗g)(t)=∫0tf(s)g(t−s) ds(f*g)(t)=\int_0^t f(s)g(t-s)\,ds for t>0t>0. The choice of zero extension is part of this one-sided convention.