Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 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 on L1 of a locally compact group

Definition

Assume AC. Let G be an LCH group with a fixed left Haar measure μ, write Cc(G):=Cc(G;C) for the continuous complex-valued functions of compact support and L1(G):=L1(G,μ;C) for the complex Haar space with its norm ∥⋅∥1 (Complex Haar L^p spaces and compactly supported functions), and let the symbol ∗ denote the convolution of Cc(G) (Compactly supported convolution on a group).

The extension. There is exactly one map L1(G)×L1(G)→L1(G), again written (f,g)↦f∗g and called convolution on L1(G), with all three of the following properties.

  1. It is C-bilinear: (αf+βf′)∗g=α(f∗g)+β(f′∗g) and f∗(αg+βg′)=α(f∗g)+β(f∗g′) for all α,β∈C and f,f′,g,g′∈L1(G).
  2. It is bounded, hence jointly continuous, with ∥f∗g∥1≤∥f∥1 ∥g∥1(f,g∈L1(G)); consequently the map (f,g)↦f∗g is continuous for the product of the norm topologies.
  3. It agrees with the Cc convolution of Compactly supported convolution on a group whenever both arguments lie in Cc(G).

Representatives are not part of the data. For a general f∈L1(G) the symbol f(x) has no meaning: f is an equivalence class, and no pointwise formula is asserted for the extended product. What is asserted is that for f∈L1(G) and g∈Cc(G) the class f∗g is the limit in L1(G) of un∗g for any sequence un∈Cc(G) with un→f, and dually in the second variable; the μ-a.e. integral formula g↦∫Gf(y)g(y−1x) dμ(y) for the representative of f∗g is not claimed here and is not used on this page except through the class-level identity f∗g for Cc arguments.

Well-definedness. Existence. Fix g∈Cc(G). If un∈Cc(G) converge to f in L1(G), then un∗g is a Cauchy sequence in L1(G), because ∥un∗g−um∗g∥1=∥(un−um)∗g∥1≤∥un−um∥1∥g∥1 by the Cc norm inequality (Submultiplicativity of convolution in the L1 norm), and L1(G) is complete (Completeness of the complex Haar L1 and L2 spaces and density of Cc); such a sequence un exists because Cc(G) is dense in L1(G) (same item). The limit is independent of the choice of (un), because the interleaving of two such sequences is again a sequence in Cc(G) converging to f, so both limits equal its limit. Passing to the limit in the inequality for the approximants gives ∥f∗g∥1≤∥f∥1∥g∥1, and the assignment f↦f∗g is linear on Cc(G) and bounded, so it extends to a linear map on L1(G) with the same bound. Repeating the construction in the second variable produces the two-variable map, and the two constructions agree on Cc(G)×Cc(G): for f,g∈Cc(G) every approximant may be taken equal to f or to g, and the two-order computation gives the same limit because ∥un∗g−f∗vm∥1≤∥un−f∥1∥g∥1+∥f∥1∥g−vm∥1→0.

Bilinearity is inherited from the approximants: for f,f′∈L1(G), scalars α,β and g∈Cc(G), approximating f and f′ by un,un′∈Cc(G) gives approximants αun+βun′ of αf+βf′, and (αun+βun′)∗g=α(un∗g)+β(un′∗g) by bilinearity on Cc(G); uniqueness of limits in L1(G) gives (αf+βf′)∗g=α(f∗g)+β(f′∗g), and a second approximation in the variable g gives the same identity for general g∈L1(G).

Uniqueness. The subset Cc(G)×Cc(G) is dense in L1(G)×L1(G): given f,g and ϵ>0, density of Cc(G) provides u,v∈Cc(G) with ∥u−f∥1<ϵ and ∥v−g∥1<ϵ, so (u,v) is within ϵ of (f,g) for the product metric. Any two maps L1(G)×L1(G)→L1(G) satisfying properties 1–3 are continuous by 2 and agree on that dense subset, hence they agree everywhere: a norm-continuous map on a metric space is determined by its values on a dense subset.

Depends on

Used by

Dependency tree · two levels

20 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