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.

Complex L∞ space of a locally compact group

Definition

Let G be a locally compact Hausdorff group with fixed left Haar measure μ (Left Haar integral and left Haar measure). Use the complex-valued measurability convention and modulus from Complex Haar L^p spaces and compactly supported functions. For a Borel measurable f:G→C, set ∥f∥∞,μ:=inf⁡{t>0:μ({x∈G:∣f(x)∣>t})=0}, with infimum +∞ when the set of such t is empty. Let L∞(G,μ;C) be the complex measurable functions with finite ∥f∥∞,μ, identify f∼g when f=g μ-almost everywhere, and write L∞(G,μ;C):={[f]:f∈L∞(G,μ;C)}. Addition and complex scalar multiplication are [f]+[g]=[f+g] and α[f]=[αf], and the norm is ∥[f]∥∞:=∥f∥∞,μ. This is the complex L∞ space used on the amenability page; its functions are equivalence classes, not chosen representatives.

Facts & Assumptions

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

[F1]

A complex measurable function is measurable exactly when its real and imaginary parts are measurable, and its modulus is measurable (Complex Haar L^p spaces and compactly supported functions).

[F2]

The essential supremum is the infimum of the almost-everywhere upper bounds and does not change when a function is changed on a null set (The essential supremum of a measurable function with respect to a measure).

[F3]

Equality almost everywhere means equality outside a measurable null set; countable unions of null sets are null by countable subadditivity (Measure-null sets and almost-everywhere statements relative to a measure, Measure spaces).

[F4]

The complex modulus satisfies ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F5]

Sums and real scalar multiples of real measurable functions are measurable (Closure properties of measurable functions used by the integral).

Proof

technique · direct
1.1F1F3F5

If f∼f′ and g∼g′, then outside the union of their two null exceptional sets, f+g=f′+g′ and αf=αf′ for every α∈C. The real and imaginary parts of these sums and scalar multiples are real linear combinations of measurable functions, so [F5] shows that they remain complex measurable; therefore the displayed operations are well-defined on classes.

2.1F1F2F3F4step 1.1algebra

The essential-supremum norm is independent of the representative by [F2] and ∣f∣=∣g∣ wherever f=g. Because the set of almost-everywhere bounds is upward closed, each threshold ∥f∥∞,μ+ε and ∥g∥∞,μ+ε exceeds its infimum and is itself an almost-everywhere bound. Outside the union of their null exceptional sets, [F4] gives ∣f+g∣≤∥f∥∞,μ+∥g∥∞,μ+2ε. Also ∥αf∥∞,μ=∣α∣∥f∥∞,μ by [F4] and scaling the threshold set (and directly when α=0). Letting ε↓0 gives the triangle inequality and homogeneity, so these operations preserve the finite-essential-supremum classes.

3.1F2F3step 2.1∎

If ∥[f]∥∞=0, the upward-closed set of almost-everywhere bounds contains every 1/n>0. Thus each measurable set En={x:∣f(x)∣>1/n} is null. Their countable union is null by [F3], and outside it ∣f(x)∣≤1/n for every n, hence f=0 almost everywhere and [f]=0. The essential-supremum norm is therefore definite, so L∞(G,μ;C) is a complex normed vector space.

Depends on

Used by

Dependency tree · two levels

25 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