Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Translation continuity and normalised local approximate identities on an LCA group

Statement

Assume Dependent Choice. Let G be a locally compact Hausdorff abelian group with Haar measure mG and let 1≤p<∞. Translation Txf(t):=f(t−x) is a linear isometry of Lp(G,mG) and x↦Txf is norm-continuous for every f. Moreover for every identity neighbourhood U there is a symmetric uU∈Cc(G), uU≥0, uU(−x)=uU(x), ∫GuU dmG=1, supp⁡uU⊆U, and for every f∈Lp ∥uU∗f−f∥p→0,∥f∗uU−f∥p→0 as the support neighbourhood shrinks, uniformly over all such kernels, with ∥uU∗f∥p≤∥f∥p and ∥f∗uU∥p≤∥f∥p. More precisely, index by all admissible pairs (U,u), ordered by reverse inclusion of U, and assign the kernel u to that pair. This directed net is a contractive two-sided approximate identity of A=L1(G,mG); its convergence requires no simultaneous choice of one kernel for every neighbourhood, no metrisation, and no sequential compactness.

Facts & Assumptions

Given: Dependent Choice, a locally compact Hausdorff abelian group G written additively with Haar measure mG, an exponent 1≤p<∞, a function f∈Lp(G,mG), and the convolution calculus of A=L1(G,mG) (The space Lp(μ) as the quotient by null functions, L^1 of an LCA group is a commutative Banach star algebra under convolution).

[F2]

Real Cc(G) is dense in real Lp(G,mG). For complex f, approximate Re⁡f and Im⁡f separately by real a,b∈Cc(G); then a+ib∈Cc(G;C) and ∥f−(a+ib)∥p≤∥Re⁡f−a∥p+∥Im⁡f−b∥p. Thus complex compactly supported continuous functions are dense in complex Lp as well. Translations preserve either scalar version of Cc (C_c(X) is dense in L^p(mu) for a Radon measure, Translations preserve compactly supported continuous functions, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F3]

Minkowski's integral inequality: for σ-finite measure spaces (X,μ), (Y,ν), a measurable F with ∫Y∥F(⋅,y)∥Lp(X) dν(y)<∞ satisfies ∥∫Y∣F(⋅,y)∣ dν(y)∥Lp(X)≤∫Y∥F(⋅,y)∥Lp(X) dν(y). Hölder's inequality also applies to the finite weighted measure ∣u∣ dmG (Minkowski's integral inequality, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Holder's inequality for integrals, including the endpoint cases).

[F4]

Under Dependent Choice every compact K inside an open U admits a cutoff v∈Cc(G) with 0≤v≤1, v=1 on K, v=0 outside U (so supp⁡v⊆U‾) (LCH Urysohn cutoff, Compact support, Cc(X), and C0(X)).

Proof

technique · direct
1.1F1F2

(Reduction to a σ-compact essential support.) For n≥1 the Borel set En:={∣f∣>1/n} has mG(En)≤np∥f∥pp<+∞; by [F1] choose an open Un⊇En with mG(Un)<+∞ and compact Kn,j⊆Un with mG(Kn,j)→mG(Un). Then S:=⋃n,jKn,j is σ-compact of σ-finite measure, mG({∣f∣>0}∖S)=0, and replacing f by f⋅1S changes it at most on a null set, hence changes neither the class in Lp nor any norm. For the product calculations below we additionally use an a.e. pointwise limit of real or complex Cc approximants supplied by [F2] as representative, zero where the sequence fails to converge. The convolution-algebra supplier's product-measurability argument applies verbatim to Lp approximants and to their compact-support unions. Thus we may assume f=0 outside a σ-compact set S and the kernels f(x−y) below are product measurable.

1.2F1

(Translation is an isometry.) For f∈Lp and x∈G, the substitution t↦t+x preserves mG and therefore ∥Txf∥p=∥f∥p; the map is linear and respects a.e. equality, so it acts on the quotient Lp.

2.1F1F3step 1.1

(Convolution with a compactly supported kernel.) Let u∈Cc(G;C) (including real kernels) and assume f vanishes outside the σ-compact set S. The function (y,x)↦∣u(y)∣ ∣f(x−y)∣p is supported in supp⁡u×(S+supp⁡u), a σ-finite product by [F1], so Tonelli's theorem gives ∫G∫G∣u(y)∣ ∣f(x−y)∣p dmG(y) dmG(x)=∥u∥1∥f∥pp<+∞ after the substitution x↦x+y; by Hölder's inequality with the finite measure ∣u∣ dmG this makes ∫G∣u(y)∣ ∣f(x−y)∣ dmG(y) finite for mG-a.e. x. For those x the two defining integrals agree, (u∗f)(x)=∫Gu(y)f(x−y) dmG(y)=∫Gf(z)u(x−z) dmG(z)=(f∗u)(x), by inversion followed by translation in the substitution z=x−y. Applying Minkowski's integral inequality [F3] to F(x,y):=u(y)f(x−y) on the σ-finite product yields ∥u∗f∥p=∥∫Gu(y)f(⋅−y) dmG(y)∥p≤∫G∣u(y)∣ ∥Tyf∥p dmG(y)=∥u∥1∥f∥p.

2.2F1F2step 1.2

(Norm continuity of translation.) Fix f∈Lp and ε>0. By [F2] choose f0∈Cc(G;F) for the scalar field F∈{R,C}, with ∥f−f0∥p<ε/3. If f0=0, the isometry gives ∥Tzf−f∥p<2ε/3 for every z. Otherwise put K0:=supp⁡f0; its compact thickening below has positive finite measure. Choose a compact symmetric identity neighbourhood W and a compact symmetric neighbourhood E⊆W so small that ∣f0(t−z)−f0(t)∣<ε/(3 mG(K0+W)1/p) for all t∈G and z∈E; this is possible by the uniform-continuity argument on the compact set K0+W: cover K0+W by finitely many translates yj+Vj on which f0 varies by less than the bound, and intersect the corresponding symmetric neighbourhoods of 0. Then ∥Tzf0−f0∥p<ε/3 for z∈E, and step 1.2 gives, for every z∈E, ∥Tzf−f∥p≤∥Tz(f−f0)∥p+∥Tzf0−f0∥p+∥f0−f∥p<2ε/3+ε/3=ε. Hence x↦Txf is norm-continuous at 0, and at every x0 by Tx+x0=TxTx0 and step 1.2.

3.1F1F3step 2.1

(The weighted-average estimate.) Let u∈Cc(G) satisfy u≥0 and ∫Gu dmG=1. Since ∫Gu(y) dmG(y)=1, for a.e. x (u∗f)(x)−f(x)=∫Gu(y)(f(x−y)−f(x)) dmG(y), and Minkowski's inequality [F3] applied to G(x,y):=u(y)(f(x−y)−f(x)) on supp⁡u×(S∪(S+supp⁡u)), a σ-finite product containing both terms, gives ∥u∗f−f∥p≤∫Gu(y) ∥Tyf−f∥p dmG(y)≤sup⁡y∈supp⁡u∥Tyf−f∥p.

4.1F1F4step 2.1step 3.1step 2.2

(Normalised local approximate identities.) Let U be an identity neighbourhood. By continuity of addition at 0 choose a symmetric open V with V+V⊆U, Then V‾⊆V+V⊆U: for x∈V‾, the open set x+V meets V, so x∈V−V=V+V. By [F4] choose v∈Cc(G) with 0≤v≤1, v(0)=1, and v=0 outside V; hence supp⁡v⊆V‾⊆U. Then w(x):=v(x)v(−x) is symmetric, nonnegative, compactly supported in V‾⊆U, and w(0)=1, so c:=∫Gw dmG>0 by [F1]; set uU:=c−1w. Then uU≥0 is symmetric with ∫GuU dmG=1 and supp⁡uU⊆V‾⊆U. Given f∈Lp and ε>0, step 2.2 provides a symmetric identity neighbourhood E with ∥Tyf−f∥p<ε for every y∈E. For every identity neighbourhood U⊆E and every admissible kernel uU, one has supp⁡uU⊆U⊆E, so step 3.1 yields ∥uU∗f−f∥p<ε, and by step 2.1 also ∥uU∗f∥p≤∥f∥p and ∥f∗uU∥p=∥uU∗f∥p≤∥f∥p; this bound is uniform over admissible kernels. The set of all pairs (U,u) is directed by shrinking U: two pairs have a common later pair by constructing a kernel inside their intersected neighbourhood. Thus both limits hold for this net without choosing kernels simultaneously. For p=1 it is a contractive two-sided approximate identity of A=L1(G,mG).

5.1step 1.2step 2.2step 4.1∎

Steps 1.2, 2.2 and 4.1 prove the isometry, the norm continuity, the existence of the symmetric normalised cutoffs and both approximate-identity limits with their contractive bounds.

Depends on

Used by

Dependency tree · two levels

86 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