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.

Positive convolution squares form a dense inversion core

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 g∈Cc(G;C) put g~(x):=g(−x)‾. Then g∗g~∈Cc(G;C) (it is continuous with compact support), it is positive definite, and (g∗g~)(0)=∫G∣g(x)∣2 dmG(x) ≥ 0. The complex span E of {g∗g~:g∈Cc(G;C)} is dense in L1(G,mG) and dense in L2(G,mG). This is the inversion core of the page. The claim that the dual integral becomes absolutely controlled for this core after a compatible scaling of the dual Haar measure is not made here; it belongs to the compatible dual Haar normalisation theorem, and no proof that precedes that normalisation may use it.

Facts & Assumptions

Given: Dependent Choice, a locally compact Hausdorff abelian group G written additively with Haar measure mG, the convolution product and involution of A=L1(G,mG) (L^1 of an LCA group is a commutative Banach star algebra under convolution), and the approximate identity of Translation continuity and normalised local approximate identities on an LCA group.

[F1]

For u,v∈Cc(G;C) the convolution (u∗v)(x)=∫Gu(y)v(x−y) dmG(y) is continuous with supp⁡(u∗v)⊆supp⁡u+supp⁡v, a compact set; the same holds after replacing v by its conjugate reflection (Compact support, Cc(X), and C0(X), Translations preserve compactly supported continuous functions, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, A product of finitely many compact spaces is compact in the product topology).

[F2]

Positive definiteness of a function ϕ on G means ∑j,kcjck‾ϕ(xj−xk)≥0 for all finite families and coefficients; the integral is translation invariant (Positive definite functions on an abelian group, Left Haar integral and left Haar measure).

[F3]

Real Cc(G) is dense in real Lp under Dependent Choice. Approximating real and imaginary parts separately gives a,b∈Cc(G) with ∥f−(a+ib)∥p≤∥Re⁡f−a∥p+∥Im⁡f−b∥p arbitrarily small; thus Cc(G;C) is dense in Lp(G,mG) for 1≤p<∞ and translations are norm-continuous in Lp, with ∥u∗f−f∥p→0 along all admissible pairs (U,u) for every f∈Lp (C_c(X) is dense in L^p(mu) for a Radon measure, Translation continuity and normalised local approximate identities on an LCA group, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The space Lp(μ) as the quotient by null functions, Integrable real and complex functions, and their integrals).

Proof

technique · direct
1.1F1F3

(g∗g~ is a compactly supported continuous function.) For g∈Cc(G;C) the conjugate reflection g~ is continuous with compact support −supp⁡g. For u,v∈Cc(G;C), the defining integral converges everywhere and ∣(u∗v)(x+z)−(u∗v)(x)∣≤∥u∥∞∥Tzv−v∥1→0 by translation continuity [F3]. Thus the convolution g∗g~ is continuous, and its support lies in the compact set supp⁡g−supp⁡g, so g∗g~∈Cc(G;C).

1.2F2

(Positive definiteness and the value at 0.) Since g~(z−y)=g(y−z)‾, the convolution can be written (g∗g~)(z)=∫Gg(y)g(y−z)‾ dmG(y); at z=0 this is ∫G∣g(y)∣2 dmG(y)≥0. For a finite family x1,…,xn and coefficients c1,…,cn, translation invariance of mG ([F2]) and the finite sum rule give ∑j,kcjck‾(g∗g~)(xj−xk)=∫G∑j,kcjck‾ g(y)g(y−xj+xk)‾ dmG(y)=∫G∣∑j=1ncjg(y+xj)∣2dmG(y)≥0, the second equality by substituting y↦y+xj term by term (a translation) and expanding the square. Hence g∗g~ is positive definite by [F2].

1.3F1

(The span contains every f∗h~.) Let f,h∈Cc(G;C). Writing Q(v)=v∗v~, direct expansion gives f∗h~=14(Q(f+h)−Q(f−h)+iQ(f+ih)−iQ(f−ih)). Each square lies in E and E is a complex vector space, so f∗h~∈E. Hence E contains the complex span E′ of {f∗h~:f,h∈Cc(G;C)}.

2.1F3step 1.3

(Density.) Let p∈{1,2}, let f∈Lp(G,mG) and let ε>0. By [F3] choose h∈Cc(G;C) with ∥f−h∥p<ε/3, and then, applying the approximate identity of [F3] to h, choose u∈Cc(G;C) with ∥u∗h−h∥p<ε/3. By step 1.3 the function u∗h=u∗(h~~) lies in E, and ∥u∗h−f∥p≤∥u∗h−h∥p+∥h−f∥p<2ε/3<ε. Therefore E is dense in Lp(G,mG) for p=1 and p=2.

3.1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2 and 2.1 establish that every g∗g~ with g∈Cc(G;C) is a compactly supported continuous positive definite function with (g∗g~)(0)=∫G∣g∣2 dmG≥0, and that the complex span of these squares is dense in L1(G,mG) and in L2(G,mG).

Depends on

Used by

Dependency tree · two levels

73 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