Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Probability-density approximation of continuous tests and topological means

Statement

Assume AC (The Axiom of Choice). Let G be an arbitrary LCH group with fixed left Haar measure μ, let P={f∈L1(G):f≥0, ∥f∥1=1} and let M be the means on the global-null L∞(G) of Left-invariant means on L∞ of a locally compact group. Then:

  1. Every m∈M, finite list of bounded continuous functions ψ1,…,ψk and ε>0 admit f∈P∩Cc(G) with ∣∫fψj dμ−m([ψj])∣<ε for all j.
  2. If m is topologically invariant, meaning m(p∗φ)=m(φ) for every p∈P and φ∈L∞(G) using the smoothing of L1 convolution smooths bounded functions into UCB, then m is in the weak-star closure of P: every finite list of global L∞ classes can be approximated simultaneously by their probability-density integrals.

Here P embeds into L∞(G)∗ by integration. Full weak-star density in ALL means is false under the existing Haar/global-null conventions; the original counterexample remains in Remarks. No countability or semifiniteness of G is imposed.

Facts & Assumptions

Given: AC; an LCH group G with fixed left Haar measure; a mean m on global L∞(G); and finite test families.

[F1]

A mean is positive, complex-linear, unital and bounded by the L∞ norm (Left-invariant means on L∞ of a locally compact group).

[F2]

Probability averages of a real bounded continuous function have supremum equal to its pointwise supremum (Probability-density averages and locally detectable upper essential values).

[F3]

Under AC, separation separates disjoint convex sets when one is open (Separation of disjoint convex sets when one is open).

[F5]

Smoothing f∗φ is an actual bounded continuous UCB function with sup norm at most ∥f∥1∥φ∥∞; extended convolution agrees with Cc convolution and is bounded in L1 (L1 convolution smooths bounded functions into UCB, Convolution on L1 of a locally compact group).

[F6]

Left invariance, inversion and right translation give ∫F(x−1) dμ(x)=∫F(x)ΔG(x−1) dμ(x) and ∫F(xz) dμ(x)=ΔG(z−1)∫F dμ; ΔG is a continuous positive homomorphism (Left Haar integral and left Haar measure, Haar change of variables under inversion, Right translation scales left Haar measure, The modular function is a continuous homomorphism).

[F7]

Continuous compactly supported kernels on LCH products admit commuting Radon integrals under AC (Compactly supported kernels admit commuting radon integrals).

[F8]

Convolution preserves probability densities, as proved with nonnegative Cc approximants (A UCB-invariant mean yields a topological invariant mean, Remark). The integral is linear and satisfies the triangle inequality (The Lebesgue integral is linear on L1(μ), The modulus of an integral is bounded by the integral of the modulus).

[F9]

Weak-star neighborhoods test finitely many evaluations, and nets may use witness-indexed directed preorders (The weak-star topology from finite evaluations, Directed preorders and nets).

Proof

technique · approximate continuous tests by probability witnesses, then smooth those witnesses to approximate a topological mean on all global-L-infinity inputs
1.1F1F2F3F4constructalgebra

For bounded continuous ψ1,…,ψk, let D⊆Ck consist of their integral vectors over P, and let v=(m(ψj))j. The set D is convex. If v∉D‾, choose r>0 so that the open ball B(v,r) is disjoint from the nonempty closed convex set D‾. By [F3], after reversing its sign, a nonzero real-linear functional ℓ satisfies ℓ(c)<ℓ(u) for every c∈D‾ and u∈B(v,r). Choose a unit vector w with ℓ(w)>0. Testing at u=v−rw/2 gives sup⁡d∈Dℓ(d)≤ℓ(v)−rℓ(w)/2<ℓ(v). Write h(x)=ℓ((ψj(x))j), a real bounded continuous function. Complex linearity and positivity make m(Re⁡ψ)=Re⁡m(ψ) and similarly for imaginary parts, so ℓ(v)=m(h)≤sup⁡Gh by [F1]. But [F2] gives sup⁡d∈Dℓ(d)=sup⁡f∈P∫fh=sup⁡Gh, a contradiction. Thus v∈D‾, proving simultaneous continuous-test approximation by a density. The empty test family has a witness given by a normalized indicator of a relatively compact nonempty open set by [F4].

1.2F4F5F6F7F8algebra

If a=0 or b=0, the adjoint identity below has both sides zero; assume otherwise, so both supports are nonempty. For a,b∈Cc(G) define a♯(u)=ΔG(u−1)a(u−1). For bounded continuous φ, the compact-kernel formula and [F7] interchange the integrals of a(y)b(z)φ(yz); left invariance and inversion [F6] then give ∫(a∗b)φ=∫b(a♯∗φ). This also holds for any bounded Borel φ. Indeed put K=supp⁡a, L=supp⁡b, C=KL, and choose ψ∈Cc(G) with ∥ψ−φ1C∥1<η by [F4]. The left integral changes by at most ∥a∗b∥sup⁡η. For z∈L, inversion and right translation give ∫K−1∣φ−ψ∣(u−1z) dμ(u)≤MKMLη, where MK=sup⁡KΔG(t−1) and ML=sup⁡LΔG(z−1) are finite by [F6]; here tz∈KL=C for t∈K. The right integral changes by at most ∥b∥1∥a♯∥sup⁡MKMLη. Letting η↓0 proves the adjoint identity for bounded Borel tests without invoking product measurability of arbitrary Borel functions.

2.1F4F8F9step 1.1constructalgebra

These witnesses can be chosen in P∩Cc(G). For a witness b∈P, choose un∈Cc(G) with un→b in L1 by [F4]. Then ∣un∣→b in L1 and ∫∣un∣→1; for large n, bn=∣un∣/∫∣un∣ lies in P∩Cc(G) and tends to b in L1. The finite bounded tests preserve the desired inequalities with any initial smaller error margin. Index all such witnesses by triples (F,η,b), with finite continuous test set F, tolerance η>0 and b∈P∩Cc(G) meeting it, ordered by increasing F and decreasing η. Step 1.1 makes this a nonempty directed preorder. Its third-coordinate net bi satisfies ∫biψ→m(ψ) for every bounded continuous ψ, without a global witness choice. Fix also p∈P∩Cc(G).

3.1F1F5F6F8F9step 2.1step 1.2constructalgebra∎

Now suppose m is topologically invariant. Set gi=p♯∗bi for the Cc probability witnesses of step 2.1. By [F6], p♯≥0, ∥p♯∥1=1 and (p♯)♯=p, so gi∈P by [F8]. For a global L∞ class φ, choose a bounded Borel representative by modifying a global null set. Step 1.2 gives ∫giφ=∫bi(p∗φ)→m(p∗φ)=m(φ), because [F5] makes p∗φ bounded continuous and m is topological. Thus the probability integrals converge weak-star on every class; in particular any finite family is approximated simultaneously. No locally-null identification was used. Together with steps 1.1 and 2.1 this proves both claims.

Remarks

Full weak-star density in all means was the false original scaffold claim. Under AC take G=T×Rdiscrete and A={1}×Rdiscrete. The finite-detectability example shows that globally null Borel subsets of A are countable, while A is locally null and globally infinite. Extend the co-countable filter on the discrete factor to an ultrafilter U. For a global L∞ class choose a bounded Borel representative and set m(φ)=lim⁡d→Uφ(1,d). Global a.e. changes affect these values on a countable set only, so this is well-defined; compactness of bounded complex disks gives the limit, continuity of complex operations gives linearity, and the essential bound/positivity outside global null sets give positivity and norm one. It is a mean with m(1A)=1. Every probability pairing annihilates 1A by finite detectability, so the weak-star neighborhood ∣ν(1A)−1∣<1/2 misses all of P. This mean is not asserted to be topologically invariant: smoothing annihilates 1A pointwise because its pullbacks are locally null and L1 pairings annihilate locally null sets. The corrected full-density conclusion is for topological means; continuous-test density remains valid for every mean.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

230 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