Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

A sequential approximate identity concentrated near the identity

Statement

Assume the Axiom of Choice. Let G be a second-countable locally compact Hausdorff group with a fixed left Haar measure μ. There is a sequence (un)n∈N⊆Cc(G) such that un≥0, ∫Gun dμ=1, and for every identity neighbourhood U there is n0 with supp⁡un⊆U for every n≥n0. It is a two-sided approximate identity in L1(G): ∥f∗un−f∥1⟶0and∥un∗f−f∥1⟶0(f∈L1(G)). If q:L1(G)→C∗(G) is the canonical dense-image map and ρ is any nondegenerate star-representation of C∗(G) on a Hilbert space H, then ρ(q(un))⟶IHin the strong operator topology. We write ρ(un) for ρ(q(un)) when the canonical map is understood. The sequential construction and the representation limit are proved locally; the cited literature passages supply only the stated C*-algebraic context.

Facts & Assumptions

Given: AC; a second-countable LCH group G with fixed left Haar measure μ; the space L1(G) and its convolution; the full group C*-algebra C∗(G) and its canonical map q; and a nondegenerate star-representation ρ:C∗(G)→B(H).

[F1]

The image of Cc(G) in L1(G) contains a countable dense subset, so Cc(G) is dense in L1(G) (L1 of a second-countable locally compact group is separable).

[F2]

The canonical map q:L1(G)→C∗(G) is a star-homomorphism with dense image (The full (maximal) group C star algebra).

[F3]

For the directed set of identity neighbourhoods there is a net (eU)U⊆Cc(G) with eU≥0, supp⁡eU⊆U, ∥eU∥1=1, and, for every f∈L1(G), ∥eU∗f−f∥1→0 and ∥f∗eU−f∥1→0 (L1 group algebras have a contractively bounded approximate identity).

[F4]

Every member of Cc(G) determines a class in L1(G), where ∥f∥1=∫G∣f∣ dμ (Complex Haar L^p spaces and compactly supported functions).

[F5]

Cc(G) is closed under group convolution (Convolution preserves compact support and is associative).

[F6]

A second-countable space has an at most countable global basis; the nonempty subfamily of basis members containing e has a surjection from N, so it can be listed with repetitions if finite (Second countability: an at most countable basis for the topology, A nonempty set is at most countable iff it is a surjective image of N).

[F7]

AC is a stated hypothesis of the L1 separability, full group C∗-algebra, and normalized approximate-identity suppliers. In the last supplier it supplies the cutoff construction and selection of one normalized cutoff for each identity neighbourhood (The Axiom of Choice).

[F8]

The representation ρ is a bounded linear map, and its nondegeneracy means the closed linear span of {ρ(a)ξ:a∈C∗(G), ξ∈H} is all of H (Nondegenerate star-representations of a Banach star-algebra, A bounded linear operator between normed spaces, The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F9]

The full-group seminorm satisfies ∥f∥C∗≤∥f∥1 (Well-definedness of the full group C star norm and its zero ideal).

Proof

technique · direct
1.1F3F4F6F7

By [F6], list the basis members containing e as (Bk)k∈N, repeating members if there are only finitely many, and put Vn=⋂k=0nBk. Each Vn is an identity neighbourhood, Vn+1⊆Vn, and for every identity neighbourhood U there is N such that Vn⊆U for all n≥N: choose a basis member Bj with e∈Bj⊆U and take N=j. Define un=eVn using the net in [F3]. By [F4], each such compactly supported function defines an L1(G) class, and its nonnegativity gives ∫Gun dμ=∥un∥1. Thus un∈Cc(G), un≥0, supp⁡un⊆Vn, and ∫Gun dμ=∥un∥1=1. The countability lemma supplies the enumeration without choice; AC is inherited from the net supplier [F3].

2.1F3step 1.1

Fix f∈L1(G) and ϵ>0. By [F3], there is an identity neighbourhood W such that both ∥eU∗f−f∥1<ϵ and ∥f∗eU−f∥1<ϵ whenever U⊆W. By step 1.1 choose N with VN⊆W. For every n≥N, Vn⊆VN⊆W, so un=eVn satisfies both inequalities. This proves the two stated L1 limits.

3.1F1F2F5F7F8F9step 2.1∎

Let Cρ be a bound for ρ from [F8]. The set q(Cc(G)) is dense in C∗(G): approximate first by q(f) with f∈L1(G) using [F2], then approximate f in L1 by a member of Cc(G) using [F1] and apply ∥q(g)∥C∗≤∥g∥1 from [F9]. For a∈C∗(G) and η∈H, boundedness of ρ carries approximations q(c)→a to ρ(q(c))η→ρ(a)η; thus nondegeneracy [F8] makes the linear span of ρ(q(c))η dense in H. For each c∈Cc(G) and η∈H, [F5] gives un∗c∈Cc(G), and the star-homomorphism identity for q gives ρ(q(un))ρ(q(c))η−ρ(q(c))η=ρ(q(un∗c−c))η. Its norm is at most Cρ∥q(un∗c−c)∥C∗∥η∥≤Cρ∥un∗c−c∥1∥η∥, which tends to zero by step 2.1. Linearity gives convergence on finite linear combinations of these vectors. Moreover, ∥ρ(q(un))∥≤Cρ∥q(un)∥C∗≤Cρ∥un∥1=Cρ, uniformly in n. For any ξ∈H and any ξ0 in that dense span, ∥ρ(q(un))ξ−ξ∥≤(Cρ+1)∥ξ−ξ0∥+∥ρ(q(un))ξ0−ξ0∥; density and convergence on the span therefore give convergence for every ξ. If H={0} the strong limit statement is immediate.

Remarks

  • The sequence is cofinal at the identity because (Vn) is a decreasing local basis. The two-sided L1 convergence follows from the supplied net theorem and this cofinality, with no separate translation estimate.
  • The general C*-approximate-unit passages in Blackadar and the group C*-algebra correspondence in Bekka–de la Harpe are context only; neither passage is used as a substitute for the support-concentrated construction or its strong-convergence proof above.

Depends on

Used by

Dependency tree · two levels

90 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