Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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 a discrete group

Example

Assume the Axiom of Choice. Let G be a discrete group and let μ=c⋅counting be a fixed left Haar measure on it, c>0. Then G is unimodular, the involution on L1(G) is f∗(x)=f(x−1)‾, convolution is the (absolutely convergent) series (f∗g)(x)=c∑y∈Gf(y) g(y−1x)(f,g∈L1(G)), and u:=c−11{e} is the two-sided convolution identity, with ∥u∥1=1. The formula is available even for an uncountable discrete group, because an ℓ1 function vanishes off a countable set.

Facts & Assumptions

Given: The Axiom of Choice, a discrete group G, a left Haar measure μ=c⋅counting with c>0, and L1(G)=L1(G,μ;C).

[F1]

On an LCH group with the discrete topology, counting measure #G is a left Haar measure and a right Haar measure, and the fixed left Haar measure equals c #G with c=μ({e})>0; moreover ∫GH dμ=c∑y∈GH(y) for every nonnegative finite-valued H and every μ-integrable complex H, so μ is also right invariant (Counting measure on a discrete group is Haar, Haar measures there are its multiples, and integrals against them are sums).

[F2]

A discrete group is unimodular, so ΔG≡1 and the involution is f∗(x)=ΔG(x−1)f(x−1)‾=f(x−1)‾ (Compact, discrete and abelian groups are unimodular, Unimodular locally compact group, Involution on L1 of a locally compact group).

[F3]

For f,g∈Cc(G) the convolution is (f∗g)(x)=∫Gf(y)g(y−1x) dμ(y), and convolution on L1(G) is the unique C-bilinear extension of it satisfying ∥f∗g∥1≤∥f∥1∥g∥1, hence jointly continuous (Compactly supported convolution on a group, Convolution on L1 of a locally compact group, Submultiplicativity of convolution in the L1 norm).

[F5]

Cauchy–Schwarz for L2: if f,g∈L2(ν) for a measure ν, then ∫∣fg∣ dν≤∥f∥2∥g∥2; sums over G are the finite-subset sums of Square-summable families on an arbitrary index set and the space ℓ2(I) (Cauchy-Schwarz inequality for L2).

[F4]

Cc(G) is dense in L1(G); L1(G) consists of the a.e. classes of integrable complex functions with ∥f∥1=∫G∣f∣ dμ, and on a discrete group Cc(G) is exactly the space of finitely supported complex functions (Completeness of the complex Haar L1 and L2 spaces and density of Cc, Complex Haar L^p spaces and compactly supported functions, Compact support, Cc(X), and C0(X), Left Haar integral and left Haar measure).

[A1]

AC is assumed in the choice-function form of the cited definition; it is inherited here from the density and completeness supplier [F4] and is first used in step 1.3, where that supplier is applied (The Axiom of Choice).

Verification

technique · direct
1.1

The measure and the involution. By [F1], μ=c⋅counting and μ is right invariant, so G is unimodular; by [F2] the involution of L1(G) is f∗(x)=f(x−1)‾.

F1F2
1.2

The formula on finitely supported functions. For f,g∈Cc(G) and x∈G, only finitely many y have f(y)≠0, and by [F3] and [F1] (f∗g)(x)=∫Gf(y)g(y−1x) dμ(y)=c∑y∈Gf(y)g(y−1x).

F1F3
1.3

The series map is bilinear and bounded. For f,g∈L1(G) define h(x):=c∑y∈Gf(y)g(y−1x); on this discrete group each L1 class has a unique pointwise representative because every singleton has measure c>0. For each x, Cauchy--Schwarz gives ∑y∈G∣f(y)∣ ∣g(y−1x)∣≤∥f∥ℓ2∥g∥ℓ2≤∥f∥ℓ1∥g∥ℓ1<∞, where y↦y−1x is a bijection and ∥f∥ℓ2≤∥f∥ℓ1 for every summable family; this proves pointwise absolute convergence by [F1, F5]. For the L1 bound, rearrange the nonnegative double sum using the finite-subsum definition of sums in [F5]: ∑x∈G∣h(x)∣≤c∑x∈G∑y∈G∣f(y)∣ ∣g(y−1x)∣=c∑y∈G∣f(y)∣∑x∈G∣g(y−1x)∣=c∥f∥ℓ1∥g∥ℓ1. The last equality again uses the bijection x↦y−1x. Thus h∈L1(G) and ∥h∥1=c∑x∣h(x)∣≤c2∥f∥ℓ1∥g∥ℓ1=∥f∥1∥g∥1. Absolute convergence also gives bilinearity, so (f,g)↦h is a bounded, hence continuous, bilinear map into L1(G).

A1F1F4F5
2.1

The series computes the convolution. On Cc(G)×Cc(G) the map (f,g)↦h of step 1.3 agrees with the Cc convolution by step 1.2, and both (f,g)↦h and the L1 convolution are continuous bilinear maps on L1(G)×L1(G) by steps 1.3 and [F3]. Since Cc(G) is dense in L1(G) by [F4], they agree as L1 classes for all f,g∈L1(G). Every singleton has positive measure c, so equality of classes on this discrete group is pointwise equality; hence (f∗g)(x)=c∑y∈Gf(y)g(y−1x) for all x∈G.

A1F3F4step 1.2step 1.3
3.1

The convolution unit. Let u:=c−11{e}; then ∫G∣u∣ dμ=c⋅c−1=1, so u∈L1(G) and ∥u∥1=1. By step 2.1, (u∗g)(x)=c∑y∈Gu(y)g(y−1x)=c⋅c−1g(x)=g(x) and (g∗u)(x)=c∑y∈Gg(y)u(y−1x)=c⋅c−1g(x)=g(x) for every g∈L1(G) and every x, the only contributing index being y=e, respectively y=x. So u is a two-sided identity.

F1step 2.1
4.1

Collecting: on a discrete group with μ=c⋅counting the group is unimodular with f∗(x)=f(x−1)‾, convolution is the absolutely convergent series of step 2.1, and c−11{e} is the norm-one convolution identity. ∎

step 1.1step 2.1step 3.1

Verification notes

  • Uncountable discrete groups. In steps 1.3 and 2.1 the sums are taken over the countable set where f and g are nonzero, so no sum over an uncountable set is asserted; counting measure on an uncountable discrete group is not σ-finite.
  • Choice cost. The only choice used is inherited from the density and completeness supplier [F4] and is recorded as [A1], where its exact use in steps 1.3 and 2.1 is declared; the series computation itself is choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 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