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

Left-uniformly continuous bounded functions (UCB)

Definition

Let Bb(G;C) be the actual bounded complex-valued functions on a locally compact Hausdorff group G, with ∥φ∥sup⁡:=sup⁡y∈G∣φ(y)∣. For x∈G set (Lxφ)(y):=φ(x−1y). Define UCB(G):={φ∈Bb(G;C):∥Lxφ−φ∥sup⁡⟶0 as x⟶e}. These are actual functions, not chosen representatives of equivalence classes. They are continuous and form a closed translation-invariant subspace of Bb(G;C). The left translation action G×UCB(G)→UCB(G) is jointly continuous in the sup-norm topology. For any fixed left Haar measure μ, the class map φ↦[φ] embeds UCB(G) isometrically into the complex L∞(G,μ) space. In particular, a UCB function that vanishes μ-almost everywhere vanishes everywhere.

Facts & Assumptions

Given: A locally compact Hausdorff group G with a fixed left Haar measure μ.

[A1]

The group operations are continuous, each left translation is a bijection, and μ is a Borel left-invariant measure (Left Haar integral and left Haar measure).

[A2]

Every nonempty open subset of G has positive μ-measure (Haar measure is positive on nonempty open sets and finite on compact sets).

[F1]

L∞(G,μ;C) consists of Borel measurable complex functions modulo almost-everywhere equality, with the essential-supremum norm (Complex L∞ space of a locally compact group).

[F2]

A continuous complex-valued function on G is Borel measurable (A continuous map has Borel preimages of Borel sets).

Proof

technique · direct
1.1A1givenalgebra

If φ∈UCB(G), then it is continuous at every t∈G. Indeed, for y→t put x=yt−1→e; then φ(y)=φ(xt)=(Lx−1φ)(t), so ∣φ(y)−φ(t)∣≤∥Lx−1φ−φ∥sup⁡→0. Here x−1→e by continuity of inversion.

1.2givenalgebra

The zero function belongs to UCB(G). For φ,ψ∈UCB(G) and a∈C, the estimates ∥Lx(φ+ψ)−(φ+ψ)∥sup⁡≤∥Lxφ−φ∥sup⁡+∥Lxψ−ψ∥sup⁡ and ∥Lx(aφ)−aφ∥sup⁡=∣a∣∥Lxφ−φ∥sup⁡ show closure under addition and scalar multiplication. Thus it is a linear subspace of the bounded functions.

1.3A1givenalgebra

Let φ lie in the norm closure of UCB(G). For x∈G, choose ψ∈UCB(G) with 2∥φ−ψ∥sup⁡<ε/2. Then ∥Lxφ−φ∥sup⁡≤2∥φ−ψ∥sup⁡+∥Lxψ−ψ∥sup⁡, since left translation is an isometry for the sup norm. By the defining condition for ψ, a neighborhood of e makes the last term <ε/2. Hence ∥Lxφ−φ∥sup⁡<ε there, so φ∈UCB(G) and the subspace is closed.

1.4A1givenalgebra

For g∈G, the group law gives LxLg=LgLg−1xg. Therefore ∥Lx(Lgφ)−Lgφ∥sup⁡=∥Lg−1xgφ−φ∥sup⁡→0 as x→e, because g−1xg→e. So Lgφ∈UCB(G) and the subspace is translation-invariant.

2.1A1step 1.3algebra

Fix (x0,φ0)∈G×UCB(G). For all x∈G and φ∈UCB(G), ∥Lxφ−Lx0φ0∥sup⁡≤∥φ−φ0∥sup⁡+∥Lx0−1xφ0−φ0∥sup⁡. The first term tends to zero as φ→φ0 and the second as x→x0 by the defining condition for φ0. This proves joint continuity of the left action.

3.1A2F1F2step 1.1constructalgebra∎

By [F2], each φ∈UCB(G) is Borel measurable and so defines a class [φ] in [F1]. Put M=∥φ∥sup⁡. If 0≤t<M, then some point has ∣φ∣>t, and continuity makes {y:∣φ(y)∣>t} a nonempty open set. It has positive measure by [A2], so ∥[φ]∥∞≥t. Also ∥[φ]∥∞≤M because ∣φ∣≤M everywhere. Letting t↑M when M>0, and noting both norms are zero when M=0, gives ∥[φ]∥∞=∥φ∥sup⁡. The class map is therefore isometric and injective; in particular, an almost-everywhere zero UCB function is identically zero.

Depends on

Used by

Dependency tree · two levels

20 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