Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Fourier transform intertwines translation, modulation and convolution

Statement

Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let G be a locally compact Hausdorff abelian group with Haar measure mG. For f,g∈L1(G,mG), x∈G and a character γ0∈G^, the following identities hold pointwise on G^: Txf^(γ)=γ(x)‾ f^(γ),γ0f^(γ)=f^(γ0−1γ),f∗g^(γ)=f^(γ)g^(γ),f∗^(γ)=f^(γ)‾, where Txf=f(⋅−x), (γ0f)(x)=γ0(x)f(x) and f∗(x)=f(−x)‾. All four identities are identities of bounded complex-valued functions on G^; the first three are used only after the transform codomain has been identified.

Facts & Assumptions

Given: Dependent Choice, a locally compact Hausdorff abelian group G with Haar measure mG, functions f,g∈L1(G,mG) (The space Lp(μ) as the quotient by null functions, Integrable real and complex functions, and their integrals), a point x∈G and a character γ0∈G^.

[F1]

Each γ∈G^ is a continuous homomorphism into the unit circle, so γ(y−x)=γ(y)γ(x)‾, γ0−1γ is again a character, γ(−y)=γ(y)‾ and ∣γ∣=1 (The Pontryagin dual with the compact-open topology, The multiplicative unit circle is a compact metrizable topological abelian group, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F2]

mG is translation invariant and inversion invariant (The Fourier transform on an LCA group, Haar measure on an abelian group is invariant under inversion); the transform is defined by h^(γ)=∫Gh(y)γ(y)‾ dmG(y) and ∣h^∣≤∥h∥1 (The Fourier transform on an LCA group).

[F3]

The convolution f∗g of two L1 functions is a well-defined class in L1; its defining integral may be computed after restricting to σ-compact essential supports, where Tonelli's theorem and Fubini's theorem for L1 functions apply to the σ-finite product (L^1 of an LCA group is a commutative Banach star algebra under convolution, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

technique · direct
1.1F1F2

(Translation and modulation.) For every γ, [F2] gives Txf^(γ)=∫Gf(y−x)γ(y)‾ dmG(y)=∫Gf(z)γ(z+x)‾ dmG(z)=γ(x)‾∫Gf(z)γ(z)‾ dmG(z)=γ(x)‾f^(γ), substituting z=y−x (a translation) and using γ(z+x)=γ(z)γ(x) from [F1]. Likewise γ0f^(γ)=∫Gγ0(y)f(y)γ(y)‾ dmG(y)=∫Gf(y)(γ0−1γ)(y)‾ dmG(y)=f^(γ0−1γ), since γ0(y)γ(y)‾=γ0(y)−1γ(y)‾ and γ0−1γ is a character by [F1].

1.2F1F3

(Convolution.) By [F3] choose σ-compact essential supports S,T of f,g; the function (y,z)↦f(y)g(z)γ(y+z)‾ is integrable over the σ-finite product S×T and Tonelli and Fubini give f∗g^(γ)=∫G(∫Gf(y)g(x−y) dmG(y))γ(x)‾ dmG(x)=∫S∫Tf(y)g(z)γ(y+z)‾ dmG(z) dmG(y)=f^(γ)g^(γ), the middle step substituting x=y+z (a translation) and the last step using γ(y+z)=γ(y)γ(z) and factoring.

1.3F1F2

(Conjugation.) Using inversion invariance [F2] in the substitution y↦−y and then γ(−y)=γ(y)‾ from [F1], f∗^(γ)=∫Gf(−y)‾ γ(y)‾ dmG(y)=∫Gf(y)‾ γ(−y)‾ dmG(y)=∫Gf(y)γ(y)‾‾ dmG(y)=f^(γ)‾.

2.1F2step 1.1step 1.2step 1.3∎

(Conclusion.) Steps 1.1, 1.2 and 1.3 establish the four displayed identities at every γ∈G^; both sides are bounded because ∣h^∣≤∥h∥1 by [F2], so the identities are identities of bounded functions on G^.

Depends on

Used by

Dependency tree · two levels

91 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