Alphabeta Math
PropositionStatement: 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.

The L1 group algebra has a unit exactly when the group is discrete

Statement

Assume AC. Let G be an LCH group with a fixed left Haar measure μ. Then L1(G)=L1(G,μ;C) has a two-sided identity for the convolution of Convolution on L1 of a locally compact group if and only if G is discrete. For a discrete G with μ=c⋅counting, c>0, the identity is c−11{e}.

Facts & Assumptions

Given: An LCH group G with a fixed left Haar measure μ, the algebra L1(G) with ∥⋅∥1, and AC.

[F1]

A left Haar measure is nonzero, positive on every nonempty open set, finite on compact sets, outer regular on Borel sets and inner regular on open sets; in particular a nonempty open set has strictly positive measure (Haar measure is positive on nonempty open sets and finite on compact sets, Left Haar integral and left Haar measure, Radon measure on an LCH space).

[F2]

On an LCH group with the discrete topology, counting measure is a left Haar measure and a right Haar measure, and every left Haar measure μ equals c⋅counting with c=μ({e})>0; for every μ-integrable H one has ∫GH dμ=c∑y∈GH(y) (Counting measure on a discrete group is Haar, Haar measures there are its multiples, and integrals against them are sums).

[F3]

For f,g∈Cc(G) one has (f∗g)(x)=∫Gf(y)g(y−1x) dμ(y) and f∗g∈Cc(G) under AC (Compactly supported convolution on a group, Convolution preserves compact support and is associative).

[F4]

Convolution on L1(G) is the unique bilinear extension of the Cc convolution with ∥f∗g∥1≤∥f∥1∥g∥1, hence jointly continuous (Convolution on L1 of a locally compact group, Submultiplicativity of convolution in the L1 norm).

[F5]

Cc(G) is dense in L1(G), and Cc(G)=Cc(G;C) (Completeness of the complex Haar L1 and L2 spaces and density of Cc, Compact support, Cc(X), and C0(X)).

[F7]
[F8]

Under Dependent Choice, for K⊆U with K compact and U open there is f∈Cc(G) with 1K≤f≤1U; AC implies Dependent Choice (LCH Urysohn cutoff, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A1]

AC is assumed, in the choice-function form of the cited definition; it is used in step 5.1 through [F8] (The Axiom of Choice).

Proof

technique · direct
1.1

Discrete case. Let G be discrete. By [F2] there is c>0 with μ=c⋅counting, so ∫GH dμ=c∑y∈GH(y) and the class u:=c−11{e} lies in L1(G) with ∥u∥1=1. For f∈Cc(G) and x∈G, [F3] gives (u∗f)(x)=c∑y∈Gc−11{e}(y)f(y−1x)=f(x) and (f∗u)(x)=c∑y∈Gf(y)c−11{e}(y−1x)=f(x), since the only nonzero term has y=e, respectively y=x. Thus u∗f=f∗u=f for all f∈Cc(G), and the identities extend to every f∈L1(G) by [F5] and the joint continuity of [F4]: ∥u∗f−f∥1≤2∥f−fn∥1→0 for Cc functions fn→f. So u is a two-sided identity.

F2F3F4F5
1.2

The functions u∗f are continuous for u∈L1(G) and f∈Cc(G), with ∥u∗f∥∞≤∥u∥1∥f∥∞. Choose un∈Cc(G) with ∥un−u∥1→0 by [F5]. Each un∗f lies in Cc(G) by [F3] and satisfies ∣(un∗f)(x)∣≤∫G∣un(y)∣ ∣f(y−1x)∣ dμ(y)≤∥un∥1∥f∥∞≤M for a constant M independent of n and x, and also ∣(un∗f)(x)−(um∗f)(x)∣≤∥un−um∥1∥f∥∞ for every x. Hence (un∗f) is uniformly Cauchy and converges uniformly to a continuous function h. By [F4] it also converges in L1 to u∗f; Fatou's lemma (Fatou's lemma) applied to ∣un∗f−k∣, where k is a measurable representative of the L1 limit u∗f, gives ∫∣h−k∣ dμ≤lim inf⁡n∥un∗f−k∥1=0, so h=k=u∗f almost everywhere, so h is a continuous representative of u∗f and inherits the bound ∥u∗f∥∞≤∥u∥1∥f∥∞ by passing to the limit.

F3F4F5
1.3

In a non-discrete G the point e has measure zero. If some identity neighbourhood U of G were finite, then every subset of the subspace U would be closed there — each singleton is closed in G by [F6] and a finite union of closed sets is closed — hence every subset of U would be open in U, and in particular {e}=U∩W for some open W⊆G. Since U is open in G, that makes {e} open in G, so G would be discrete. Thus, if G is not discrete, every identity neighbourhood is infinite. Choose a compact neighbourhood K of e by [F7]. For each n≥1, choose distinct points x1,…,xn in the interior of K, which is an identity neighbourhood and hence infinite as just shown, and pairwise disjoint open neighbourhoods Vi⊆K of xi, which exist by the Hausdorff property [F6] applied to the finitely many points. Then n μ({e})=∑iμ({xi})≤∑iμ(Vi)=μ(⋃iVi)≤μ(K)<∞ by finite additivity and left invariance of μ and [F1], for every n; hence μ({e})=0.

F1F6F7
2.1

If a continuous complex function h on G vanishes μ-a.e., then h=0 everywhere: the set {x:h(x)≠0} is open by continuity and has measure zero, so it is empty by the positivity of μ on nonempty open sets [F1].

F1step 1.2
3.1

Let u∈L1(G) satisfy u∗f=f for every f∈L1(G), and let f∈Cc(G). The class u∗f equals the class of f, while the continuous function u∗f of step 1.2 represents its own class and f is continuous; so u∗f−f, continuous by step 1.2, vanishes μ-a.e. and therefore vanishes everywhere by step 2.1. Consequently (u∗f)(e)=f(e) for every f∈Cc(G).

step 1.2step 2.1
4.1

Evaluate at e: f(e)=∫Gu(y)f(y−1) dμ(y) for every f∈Cc(G). Choose un∈Cc(G) with un→u in L1(G), by [F5]. By [F3], (un∗f)(e)=∫Gun(y)f(y−1) dμ(y), and ∣∫G(un−u)(y)f(y−1) dμ(y)∣≤∥un−u∥1∥f∥∞→0, so the right-hand integrals converge to ∫Gu(y)f(y−1) dμ(y); the left-hand values converge to (u∗f)(e)=f(e) by the uniform bound of step 1.2. Hence f(e)=∫Gu(y)f(y−1) dμ(y).

F3F5step 1.2step 3.1
5.1

No unit exists when G is not discrete. Suppose G is not discrete and u∈L1(G) is such that u∗f=f for every f∈L1(G). Then μ({e})=0 by step 1.3. Choose v∈Cc(G) with ∥u−v∥1<1/2, possible by [F5]. Since μ is outer regular and μ({e})=0, there is an open identity neighbourhood V with μ(V)≤1/(2max⁡(1,∥v∥∞)); then ∫V∣u∣ dμ≤∫V∣u−v∣ dμ+∫V∣v∣ dμ≤∥u−v∥1+∥v∥∞μ(V)<1/2+1/2=1. By [F8] under the Dependent Choice derived from [A1] there is f∈Cc(G) with 0≤f≤1, f(e)=1 and supp⁡f⊆V−1. Since f(y−1)≠0 forces y−1∈V−1, hence y∈V, step 4.1 gives 1=f(e)=∫Gu(y)f(y−1) dμ(y), so 1≤∫V∣u(y)∣ dμ(y)<1, a contradiction. Therefore no u with u∗f=f for all f exists, and a fortiori no two-sided identity exists.

A1F1F5F8step 1.3step 4.1
6.1

Combining step 1.1 and step 5.1: L1(G) has a two-sided convolution identity exactly when G is discrete, in which case μ=c⋅counting and the identity is c−11{e}. ∎

step 1.1step 5.1

Remarks

  • Uniform bound, not pointwise convergence. Step 1.2 is what upgrades the class identity u∗f=f to a pointwise identity: without continuity of u∗f the value at e would be undefined.
  • Choice cost. [A1] enters only through the cutoff function of step 5.1; steps 1.1–4.1 are choice-free apart from the inherited density statement [F5].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

68 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