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

L1 group algebras have a contractively bounded approximate identity

Statement

Assume AC. Let G be an LCH group with a fixed left Haar measure μ, and let U be the directed set of identity neighbourhoods of G ordered by reverse inclusion. Then there is a net (eU)U∈U⊆Cc(G) with eU≥0,supp⁡eU⊆U,∥eU∥1=1, such that ∥eU∗f−f∥1→0 and ∥f∗eU−f∥1→0 for every f∈L1(G): for each ϵ>0 there is U0∈U with ∥eU∗f−f∥1<ϵ and ∥f∗eU−f∥1<ϵ for every U⊆U0 in U. Such a net is a contractively bounded approximate identity: bounded by 1 in norm, with two-sided convergence, and no assumption that G be discrete or first countable.

Facts & Assumptions

Given: An LCH group G with a fixed left Haar measure μ, the algebra L1(G) with convolution ∗ and involution ∗, the directed set U of identity neighbourhoods, and AC.

[F1]

If K⊆U with K compact, U open and G LCH, then under Dependent Choice there is f∈Cc(G) with 1K≤f≤1U; the construction in the cited proof gives supp⁡f⊆U (LCH Urysohn cutoff).

[F2]

AC implies Dependent Choice: a choice function on the family {R[x]:x∈X} of a serial relation, composed with recursion (The recursion theorem), produces the required sequence (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The Axiom of Choice).

[F3]

A left Haar measure is nonzero, positive on every nonempty open set, and finite on compact sets (Haar measure is positive on nonempty open sets and finite on compact sets, Left Haar integral and left Haar measure).

[F4]

e↦e is the identity of G; inversion inv⁡(x)=x−1 is a homeomorphism, so U−1 is an identity neighbourhood whenever U is, and U↦U−1 is a bijection of U preserving inclusions (Left and right translations and inversion in a topological group are homeomorphisms).

[F5]

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

[F6]

For a continuous compactly supported kernel on a product of LCH spaces the iterated integrals commute, in the real and in the complex case (Compactly supported kernels admit commuting radon integrals).

[F7]

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).

[F8]

The involution satisfies (f∗g)∗=g∗∗f∗, (f∗)∗=f and ∥f∗∥1=∥f∥1; for real nonnegative g∈Cc(G) one has g∗(x)=ΔG(x−1)g(x−1)≥0 with supp⁡g∗=(supp⁡g)−1 (The L1 involution is isometric, involutive and reverses convolution, Involution on L1 of a locally compact group, Translations preserve compactly supported continuous functions).

[F10]

For f∈Cc(G) and ϵ>0 there is an identity neighbourhood V with ∥Lgf−f∥1<ϵ for every g∈V, where Lgf(x)=f(g−1x) (Strong continuity of left and modular right translations on L1 and L2).

[A1]

AC is assumed, in the choice-function form of the cited definition; it supplies both the cutoffs of [F1] through [F2] and the single selection of one cutoff for each identity neighbourhood in step 1.1 (The Axiom of Choice).

Proof

technique · direct
1.1

Construction of the net. Let U∈U be an identity neighbourhood and choose an open identity neighbourhood W⊆U. Applying [F1] with K={e}⊆W under the Dependent Choice of [F2] produces fU∈Cc(G) with 1{e}≤fU≤1W and, by the cited construction, supp⁡fU⊆W⊆U; in particular fU≥0 and fU(e)=1. Since fU is continuous with fU(e)=1, it exceeds 1/2 on a neighbourhood of e, so ∫GfU dμ>0 by [F3]; put eU:=fU/∫GfU dμ. Then eU∈Cc(G), eU≥0, supp⁡eU⊆U and ∥eU∥1=1. Choosing one such eU for each U∈U is a single application of [A1] to the family of nonempty sets of admissible normalised cutoffs, and the resulting family is indexed by the directed set U; this is the net whose properties are claimed.

A1F1F2F3
1.2

Left convergence for compactly supported f. Let f∈Cc(G) and let U∈U. Since ∥eU∥1=1 and eU≥0, the Cc formula [F5] gives (eU∗f)(x)−f(x)=∫GeU(y)(f(y−1x)−f(x)) dμ(y)=∫GeU(y)(Lyf−f)(x) dμ(y) for the translate Lyf of [F10]. The kernel (y,x)↦eU(y)∣(Lyf−f)(x)∣ is continuous with compact support: y ranges in supp⁡eU⊆U and Lyf−f is supported in a compact set depending on supp⁡eU and supp⁡f, as in [F5]. So [F6] applies to the complex kernel and, with ∫GeU dμ=1, ∥eU∗f−f∥1≤∫G ⁣ ⁣∫GeU(y)∣(Lyf−f)(x)∣ dμ(x) dμ(y)≤sup⁡y∈U∥Lyf−f∥1. By [F10], given ϵ>0 there is U0∈U with sup⁡y∈U∥Lyf−f∥1<ϵ whenever U⊆U0; hence ∥eU∗f−f∥1→0 along U.

F5F6F10step 1.1
2.1

Left convergence for all of L1(G). Let f∈L1(G) and ϵ>0. By [F9] choose h∈Cc(G) with ∥f−h∥1<ϵ/3, and by step 1.2 choose U0 with ∥eU∗h−h∥1<ϵ/3 for all U⊆U0. For such U, bilinearity and the norm bound of [F7] give ∥eU∗f−f∥1≤∥eU∗(f−h)∥1+∥eU∗h−h∥1+∥h−f∥1≤2∥f−h∥1+ϵ/3<ϵ, since ∥eU∥1=1.

F7F9step 1.1step 1.2
3.1

Right convergence. Let f∈L1(G) and ϵ>0. For every identity neighbourhood U, [F8] gives (f∗eU)∗=eU∗∗f∗, with eU∗∈Cc(G), eU∗≥0, ∥eU∗∥1=∥eU∥1=1 and supp⁡eU∗=(supp⁡eU)−1⊆U−1. The calculation in step 1.2 applies to any nonnegative unit-mass Cc kernel supported in a neighbourhood: for h∈Cc(G) it gives ∥eU∗∗h−h∥1≤sup⁡y∈U−1∥Lyh−h∥1. By [F10] choose an identity neighbourhood V on which ∥Lyh−h∥1<ϵ/3, and put U0:=V−1; then this bound is below ϵ/3 for all U⊆U0. Given f∗∈L1(G), first choose h∈Cc(G) with ∥f∗−h∥1<ϵ/3 by [F9]. The estimate of step 2.1, now using eU∗ and [F7], yields ∥eU∗∗f∗−f∗∥1<ϵ for all U⊆U0. Since the involution is isometric and involutive by [F8], ∥f∗eU−f∥1=∥(f∗eU)∗−f∗∥1<ϵ.

F4F7F8F9F10step 1.2step 2.1
4.1

The net (eU)U∈U of step 1.1 satisfies eU≥0, supp⁡eU⊆U and ∥eU∥1=1 for every U, and steps 2.1 and 3.1 show ∥eU∗f−f∥1→0 and ∥f∗eU−f∥1→0 for every f∈L1(G) along the directed set of identity neighbourhoods ordered by reverse inclusion. ∎

step 1.1step 2.1step 3.1

Remarks

  • Two-sidedness without discreteness. The net converges to the identity operator in the strong operator sense. If G is discrete, {e} is an identity neighbourhood and all terms beyond it equal μ({e})−11{e}, the convolution unit. A unit need not exist in general, as characterised by The L1 group algebra has a unit exactly when the group is discrete.
  • Why the involution is needed. Step 3.1 is the only place where the modular factor enters, through the nonnegativity of eU∗ and the identity (f∗eU)∗=eU∗∗f∗; the left and right assertions of the statement are therefore not proved independently.
  • Choice cost. [A1] is used twice: through [F1] (Dependent Choice, via [F2]) to obtain the cutoffs, and once to select a normalised cutoff for each identity neighbourhood. The convergence estimates themselves are choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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