Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Convolution preserves compact support and is associative

Statement

Assume AC. For an LCH group G with fixed left Haar measure, Cc(G) is closed under the convolution of Compactly supported convolution on a group, and (f∗g)∗h=f∗(g∗h)(f,g,h∈Cc(G)).

Facts & Assumptions

Given: An LCH group G, a left Haar measure μ, and f,g,h∈Cc(G) complex-valued of compact support.

[F1]

(f∗g)(x)=∫Gf(y)g(y−1x) dμ(y), and for fixed x the integrand is continuous in y and supported in supp⁡f (Compactly supported convolution on a group).

[F2]

Assume AC. For LCH spaces X,Y with positive functionals and real F∈Cc(X×Y), the partial integrals are continuous and compactly supported and the iterated integrals commute; complex kernels obey the same identity (Compactly supported kernels admit commuting radon integrals).

[F3]

A left Haar measure is nonzero, left invariant and finite on compact sets (Left Haar integral and left Haar measure).

[A1]

AC is assumed in the choice-function form of the cited definition (The Axiom of Choice).

Proof

technique · direct
1.1

For fixed f,g∈Cc(G) the kernel F(x,y):=f(y)g(y−1x) is continuous on G×G, and F(x,y)≠0 forces y∈supp⁡f and y−1x∈supp⁡g, that is x∈supp⁡f⋅supp⁡g; by [F4] the set (supp⁡f⋅supp⁡g)×supp⁡f is compact by [F5] and closed, so supp⁡F⊆(supp⁡f⋅supp⁡g)×supp⁡f and F∈Cc(G×G;C).

F4F5
1.2

The inner integral of the first expression equals the inner integral of the second: substituting z=yw and using left invariance of μ from [F3] gives ∫Gg(y−1z)h(z−1x) dμ(z)=∫Gg(w)h(w−1y−1x) dμ(w), since (yw)−1=w−1y−1 and ∫GH(z)dμ(z)=∫GH(yw)dμ(w) for the compactly supported continuous H occurring here.

F3F4
2.1

Applying [F2] to F (with [A1] supplying its choice hypothesis) shows that the partial integral x↦∫GF(x,y) dμ(y)=(f∗g)(x) is continuous with compact support; hence f∗g∈Cc(G) and Cc(G) is closed under convolution.

A1F1F2step 1.1
3.1

For f,g,h∈Cc(G) and x∈G, expanding the definitions gives ((f∗g)∗h)(x)=∫G∫Gf(y)g(y−1z)h(z−1x) dμ(y) dμ(z) and (f∗(g∗h))(x)=∫G∫Gf(y)g(w)h(w−1y−1x) dμ(w) dμ(y): in both expressions the iterated integrals exist by two applications of [F2] to the continuous compactly supported kernels obtained as in step 1.1.

F1F2step 2.1
4.1

Combining steps 3.1 and 1.2 gives ((f∗g)∗h)(x)=(f∗(g∗h))(x) for every x∈G, hence (f∗g)∗h=f∗(g∗h), which is the asserted associativity. ∎

step 3.1step 1.2

Remarks

  • Support bound. The same computation gives supp⁡(f∗g)⊆supp⁡f⋅supp⁡g, a compact set.
  • Where the choice hypothesis sits. The only use of [A1] is the inherited hypothesis of the compact-kernel interchange lemma [F2]; the substitution and associativity computation itself is choice-free.

Depends on

Used by

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources