Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 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 UCB-invariant mean yields a topological invariant mean

Statement

Assume AC. Let G be a locally compact Hausdorff group with fixed left Haar measure μ, and let m be a left-invariant mean on the actual-function space UCB(G) of Left-uniformly continuous bounded functions (UCB). Thus m is a positive complex-linear functional with m(1G)=1 and m(Lgψ)=m(ψ) for every g∈G and ψ∈UCB(G). Fix f0∈P for P of Reiter's condition (P1), and define m~(φ):=m(f0∗φ)(φ∈L∞(G)), where ∗ is the pointwise L1-to-L∞ smoothing of L1 convolution smooths bounded functions into UCB. Then m~ is a mean on L∞(G) and is topologically invariant: m~(f∗φ)=m~(φ)(f∈P, φ∈L∞(G)).

Facts & Assumptions

Given: AC, an LCH group G with fixed left Haar measure μ, a left-invariant mean m on UCB(G), and the probability densities P.

[A1]

AC is assumed in the choice-function form of the axiom (The Axiom of Choice).

[F1]

UCB(G) consists of actual bounded continuous functions; its left-translation orbit is sup-norm continuous, translations preserve UCB, and its sup norm agrees with the embedded L∞ norm (Left-uniformly continuous bounded functions (UCB)).

[F2]

The smoothing formula f∗φ(x)=∫f(y)φ(y−1x) dμ(y) is an actual bounded UCB function independent of representatives, with sup bound, left-equivariance and associativity (f∗b)∗φ=f∗(b∗φ) for f,b∈L1, φ∈L∞ (L1 convolution smooths bounded functions into UCB).

[F3]

Cc(G) is dense in L1(G) under AC. The extended convolution is a continuous bilinear operation agreeing with the Cc formula and satisfying ∥u∗v∥1≤∥u∥1∥v∥1; the Cc convolution kernel is continuous and compactly supported (Completeness of the complex Haar L1 and L2 spaces and density of Cc, Convolution on L1 of a locally compact group, Submultiplicativity of convolution in the L1 norm, Compactly supported convolution on a group, Convolution preserves compact support and is associative).

[F4]

For Cc kernels, Fubini interchanges the compactly supported Radon integrals under AC; left Haar invariance gives ∫v(y−1x) dμ(x)=∫v dμ (Compactly supported kernels admit commuting radon integrals, Left Haar integral and left Haar measure).

[F5]

The positive probability approximate-identity net (eU) lies in Cc(G)∩P and satisfies ∥f∗eU−f∥1→0 for every f∈L1(G) under AC (L1 group algebras have a contractively bounded approximate identity, Reiter's condition (P1)).

[F6]

The integral is linear, satisfies ∣∫u∣≤∫∣u∣, and is monotone and positively homogeneous on nonnegative measurable functions; a nonnegative function with zero integral vanishes almost everywhere (Integrable real and complex functions, and their integrals, The Lebesgue integral is linear on L1(μ), The modulus of an integral is bounded by the integral of the modulus, Monotonicity and nonnegative homogeneity of the nonnegative integral, A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

Proof

technique · direct
1.1A1F3F7algebra

First, m has norm one. For a real-valued ψ∈UCB(G), ∥ψ∥sup⁡1G±ψ≥0, so positivity and m(1G)=1 imply m(ψ)∈R and ∣m(ψ)∣≤∥ψ∥sup⁡. For complex ψ, choose α with ∣α∣=1 and αm(ψ)=∣m(ψ)∣; conjugation preserves UCB, so Re⁡(αψ)∈UCB(G) and ∣m(ψ)∣=m(Re⁡(αψ))≤∥ψ∥sup⁡ by positivity. Testing at 1G gives ∥m∥=1. Now fix f,b∈P. By [F3] choose Cc approximants un,vn to f,b in L1, and replace them by ∣un∣,∣vn∣; since f,b≥0 and ∣∣un∣−f∣≤∣un−f∣, these remain convergent nonnegative Cc approximants.

2.1A1F1F2F3F7constructstep 1.1

Fix f∈P and ψ∈UCB(G). Given ε>0, choose u∈Cc(G) with ∥f−u∥1<ε and put K=supp⁡u; then ∫G∖Kf dμ<ε. Since y↦Lyψ is sup-norm continuous and K is compact, a finite open cover of K gives a finite Borel partition E1,…,EN of K and sample points yj∈K with ∥Lyψ−Lyjψ∥sup⁡<ε for y∈Ej. Set S=∑j(∫Ejf dμ)Lyjψ. The pointwise smoothing formula in [F2] gives ∥f∗ψ−S∥sup⁡≤ε+ε∥ψ∥sup⁡, from the partition error on K and the tail outside K. Invariance and linearity of m give m(S)=m(ψ)∫Kf dμ, hence ∣m(S)−m(ψ)∣≤ε∥ψ∥sup⁡. By step 1.1, ∣m(f∗ψ)−m(ψ)∣≤ε(1+2∥ψ∥sup⁡); letting ε↓0 proves m(f∗ψ)=m(ψ). This uses finite Borel partitions and pointwise scalar integrals, with no Bochner measurability or separability assumption.

2.2F2F6step 1.1

Define m~(φ)=m(f0∗φ). By [F2], m~ is complex-linear and ∣m~(φ)∣≤∥f0∗φ∥sup⁡≤∥φ∥∞ by step 1.1. If φ≥0, the pointwise smoothing formula gives f0∗φ≥0, hence m~(φ)≥0. Also f0∗1G=1G because ∫f0=1, so m~(1G)=1. Therefore m~ is a mean on L∞(G).

2.3F3F4F6step 1.1

For nonnegative u,v∈Cc(G), the compactly supported convolution formula gives u∗v≥0. Its integral is ∫x∫yu(y)v(y−1x) dμ(y) dμ(x)=∫yu(y)∫zv(z) dμ(z) dμ(y)=(∫u)(∫v) by [F4] and the substitution x=yz. Applying this to the approximants fixed in step 1.1 gives convolution masses tending to (∫f)(∫b)=1.

3.1F2F5step 1.1step 2.1

Let (eU) be the net of [F5]. For any f∈P and φ∈L∞(G), eU∗φ∈UCB(G) by [F2], so step 2.1 and associativity in [F2] give m((f∗eU)∗φ)=m(f∗(eU∗φ))=m(eU∗φ). Also [F2] gives ∥(f∗eU)∗φ−f∗φ∥sup⁡≤∥f∗eU−f∥1∥φ∥∞→0 by [F5]. Since m is bounded by step 1.1, m(f∗φ)=lim⁡Um(eU∗φ), independent of f∈P. Hence m(f∗φ)=m(f0∗φ) for all f,f0∈P.

3.2F3F6step 1.1step 2.3

The extension bound in [F3] gives un∗vn→f∗b in L1 for the nonnegative Cc approximants from step 1.1: the difference is bounded by ∥un−f∥1∥vn∥1+∥f∥1∥vn−b∥1. Since each un∗vn is nonnegative, ∥Im⁡(f∗b)∥1 and ∥(Re⁡(f∗b))−∥1 are bounded by ∥un∗vn−f∗b∥1 and tend to zero; [F6] implies f∗b≥0 almost everywhere. Continuity of integration on L1, also in [F6], gives ∫f∗b=lim⁡n(∫un)(∫vn)=1 by step 2.3. Thus f∗b∈P.

4.1F2step 3.1step 3.2step 2.2∎

For f∈P and φ∈L∞(G), associativity in [F2] gives m~(f∗φ)=m(f0∗(f∗φ))=m((f0∗f)∗φ). Step 3.2 gives f0∗f∈P, so the kernel independence proved in step 3.1 makes this value m(f0∗φ)=m~(φ). Every argument of m here is a smoothed UCB function by [F2]; no value of m on an arbitrary unsmoothed L∞ input is used. Together with step 2.2 this proves that m~ is a topological invariant mean.

Remark

Step 3.2 also proves that the extended L1 convolution preserves probability densities: for all f,b∈P, one has f∗b∈P. The local proof uses nonnegative compactly supported approximants, compact-support Radon integration, and convergence in the L1 convolution norm.

Sources

BHV, Kazhdan's Property (T), Appendix G, §G.3, proof of Theorem G.3.1, (i) to (ii), printed pp. 453–454, proves the identity m(f∗φ)=m(φ) for UCB inputs, compares probability kernels using a positive approximate identity, and defines m~(φ)=m(f0∗φ). Thomas, Lecture 20, slides 11–14, gives the same construction. The local proof justifies the compact-partition approximation and uses the right-L1 estimate ∥f∗eU−f∥1 with the smoothing bound; it makes no sup-norm approximate- identity claim for arbitrary L-infinity inputs.

Depends on

Used by

Dependency tree · two levels

89 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