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.

Parseval pairing on the integrable core

Statement

Assume the Axiom of Choice and Dependent Choice. Let G be a locally compact Hausdorff abelian group with the compatible dual Haar normalisation. If f,g∈L1(G,mG)∩L2(G,mG) and f^,g^∈L1(G^,mG^), then ∫Gf(x)g(x)‾ dmG(x)=∫G^f^(γ)g^(γ)‾ dmG^(γ). In particular ∥f^∥2=∥f∥2 for such f.

Facts & Assumptions

Given: The Axiom of Choice and Dependent Choice, a locally compact Hausdorff abelian group G with Haar measure mG and compatible dual Haar measure mG^ on G^, and f,g∈L1(G,mG)∩L2(G,mG) with f^,g^∈L1(G^,mG^).

[F1]

A=L1(G,mG) is a commutative Banach ∗-algebra under convolution and u∗(x)=u(−x)‾; for u,v∈A the class u∗v is given mG-a.e. by an absolutely convergent integral and ∥u∗v∥1≤∥u∥1∥v∥1, and ∥u∗∥1=∥u∥1, u∗∗=u (L^1 of an LCA group is a commutative Banach star algebra under convolution); for g∈L2 also g∗∈L2 with ∥g∗∥2=∥g∥2 because inversion preserves Haar measure and conjugation preserves moduli (Haar measure on an abelian group is invariant under inversion, The space Lp(μ) as the quotient by null functions).

[F2]

The transform satisfies u∗v^=u^ v^ and u∗^=u^‾ (Fourier transform intertwines translation, modulation and convolution); in particular f∗g∗^=f^ g^‾, and since f^ is bounded and g^‾∈L1(G^,mG^), this product lies in L1(G^,mG^) with ∥f^ g^‾∥1≤∥f^∥∞∥g^∥1 (The Fourier transform on an LCA group).

[F3]

For f,g∈L2(G,mG) the integral H(x):=∫Gf(y)g(y−x)‾ dmG(y) converges absolutely for every x with ∣H(x)∣≤∥f∥2∥g∥2 by Cauchy-Schwarz (Cauchy-Schwarz inequality for L2), and H is continuous: ∣H(x)−H(x0)∣≤∥f∥2∥Txg−Tx0g∥2→0 by norm continuity of translations in L2 (Translation continuity and normalised local approximate identities on an LCA group, The space Lp(μ) as the quotient by null functions).

[F4]

The convolution h:=f∗g∗ lies in L1(G,mG) with ∥h∥1≤∥f∥1∥g∥1, its representative H of [F3] satisfies H=h mG-a.e., and its transform h^=f^ g^‾ lies in L1(G^,mG^) (L^1 of an LCA group is a commutative Banach star algebra under convolution, Fourier transform intertwines translation, modulation and convolution, Integrable real and complex functions, and their integrals).

[F5]

Fourier inversion for integrable transforms: if h∈L1(G,mG) has h^∈L1(G^,mG^), then h∨(x)=∫G^h^(γ)γ(x) dmG^(γ) is a bounded uniformly continuous function with h∨=h mG-a.e., and h∨ is the unique continuous representative of the class of h (Fourier inversion for integrable transforms on LCA groups, Compatible dual Haar normalisation).

Proof

technique · direct
1.1F1F3F4

(The convolution is continuous and its value at 0.) With h:=f∗g∗∈L1(G,mG) as in [F4], the function H(x)=∫Gf(y)g(y−x)‾ dmG(y) of [F3] is defined everywhere, bounded by ∥f∥2∥g∥2 and continuous, and it agrees with h mG-a.e. In particular H(0)=∫Gf(y)g(y)‾ dmG(y).

1.2F2F4

(Integrability of the transform.) By [F2] and [F4], h^=f^ g^‾∈L1(G^,mG^) with ∥h^∥1≤∥f^∥∞∥g^∥1≤∥f∥1∥g^∥1.

2.1F4F5step 1.1step 1.2

(Inversion evaluated at the identity.) By step 1.2 the inversion theorem [F5] applies to h: its inverse transform h∨ is continuous with h∨=h a.e. Since H is continuous and H=h a.e. by step 1.1, uniqueness of the continuous representative in [F5] gives H=h∨. Evaluating at x=0 and using h^=f^ g^‾ from [F4] yields ∫Gf(y)g(y)‾ dmG(y)=H(0)=h∨(0)=∫G^h^(γ) dmG^(γ)=∫G^f^(γ)g^(γ)‾ dmG^(γ).

3.1step 2.1

(The norm identity.) Taking g=f in step 2.1 gives ∫G∣f∣2 dmG=∫G^∣f^∣2 dmG^; the left side is finite, so f^∈L2(G^,mG^) and ∥f^∥2=∥f∥2.

4.1step 2.1step 3.1∎

Step 2.1 is the stated Parseval pairing identity and step 3.1 is its norm specialisation.

Depends on

Used by

Dependency tree · two levels

75 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