Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 pairing for a finite measure and Schwartz data

Statement

Assume Countable Choice. Let μ be a finite complex Borel measure on Rn and let F,G∈S(Rn). (i) ∫Rn(Gμ)∨(x)F(x)‾ dx=∫RnG(ω)F^(ω)‾ dμ(ω), where (Gμ)∨(x)=∫e2πix⋅ωG(ω) dμ(ω). (ii) Writing μˇ(x):=μ^(−x)=∫e2πix⋅ω dμ(ω), one has (F^ μ)∨=F∗μˇ as everywhere-defined bounded continuous functions. (iii) ∣μˇ(x)∣≤∣μ∣(Rn) for every x, and μˇ is uniformly continuous.

Facts & Assumptions

Given: Countable Choice, a finite complex Borel measure μ on Rn with M:=∣μ∣(Rn)<∞, and Schwartz functions F,G∈S(Rn).

[F1]

Every complex measure has finite total variation: ∣ν∣(X)<∞; in particular M<∞. (Every complex measure has finite total variation)

[F2]

For a complex Borel measure ν of finite total variation, ν^(ξ)=∫e−2πix⋅ξ dν(x) is bounded and uniformly continuous with sup⁡∣ν^∣≤∣ν∣(Rn). (Fourier transform of a finite complex Borel measure)

[F3]

Fubini and Tonelli hold on sigma-finite products: Tonelli's identity for nonnegative product-measurable integrands, and the threefold equality ∫f d(μ×ν)=∫∫f dν dμ=∫∫f dμ dν for f∈L1(μ×ν). (Fubini's theorem for L^1 functions on a sigma-finite product, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F4]

Schwartz functions and their transforms are bounded and integrable: F:S→S is continuous, and xα∂βh∈Lp for all p with norm bounded by finitely many Schwartz seminorms; in particular F,F^,G∈L1∩L∞. (Fourier transform acts continuously on Schwartz space, Schwartz derivatives are integrable)

[F5]

Fourier transform laws for f∈L1(Rn;C): with τaf(x)=f(x−a), τaf^(ξ)=e−2πia⋅ξf^(ξ), f(−⋅)^(ξ)=f^(−ξ), and f‾^(ξ)=f^(−ξ)‾, all at every frequency. (Translation, modulation, linear dilation and reflection laws)

[F6]

Convolution: (f∗g)(x)=∫f(x−y)g(y) dy whenever y↦f(x−y)g(y) is measurable and integrable. (Convolution of two functions on Rn)

[F7]

Measurability toolkit: B(R2n)=B(Rn)⊗B(Rn); composition of a Borel function with a Borel function is Borel; sums, products and scalar multiples of Borel functions are Borel; sin⁡ and cos⁡ are 1-Lipschitz, and e2πix⋅ω=cos⁡(2πx⋅ω)+isin⁡(2πx⋅ω) in the Cartesian form of the exponential. (The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}, Composition with a Borel measurable outer map preserves measurability, Arithmetic and lattice operations preserve measurability whenever they are defined, Sine and cosine are 1-Lipschitz on R, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0)

[F8]

Integration against a signed or complex measure is the published L1(ν)=L1(∣ν∣) integral and obeys ∣∫f dν∣≤∫∣f∣ d∣ν∣. (Integration against a signed or complex measure, and the class L^1(nu) = L^1(|nu|), Integrals against signed or complex measures are bounded by total variation, A complex measure is a finite-valued countably additive set function)

Proof

technique · direct; the pairing identity is Fubini applied to the product $\mathbb R^n\times\mathbb R^n$ against $\lambda_n\times\mu$, the conjugation identity is the published transform law, and the convolution identity substitutes the translation law into the defining integral
1.1F1F3F4F7F8

Joint measurability and absolute integrability. The characters e2πix⋅ω are Borel on R2n by the Cartesian form, the 1-Lipschitz sine and cosine, and the closure rules of [F7]; the projections (x,ω)↦x, (x,ω)↦ω are Borel, so G(ω), F(x)‾ and F^(ω) pull back to Borel functions, and p(x,ω):=e2πix⋅ωG(ω)F(x)‾, q(z,ω):=e2πiz⋅ωF(x−z) for fixed x are Borel by [F7]. For p, using ∣e2πix⋅ω∣=1 and ∣G∣≤∥G∥∞, ∣F∣≤∥F∥∞, with ∥F∥1<∞ from [F4], ∫Rn ⁣ ⁣∫Rn∣p∣ d∣μ∣ dx=∥F∥1 ⁣∫∣G∣ d∣μ∣≤∥F∥1∥G∥∞M<∞, and for q, translation invariance gives ∫∫∣q∣ d∣μ∣ dz=∥F∥1M<∞. Thus both kernels are integrable against λn×∣μ∣. Fubini against the complex measure follows first for simple functions by linearity and then by approximation in this absolute-integral norm, using [F8]; this licenses the interchange below.

1.2F2

The clause (iii). By definition μˇ(x)=μ^(−x), so ∣μˇ(x)∣=∣μ^(−x)∣≤M for every x by [F2], and ∣μˇ(x)−μˇ(y)∣=∣μ^(−x)−μ^(−y)∣ tends to 0 uniformly as ∣x−y∣→0 because μ^ is uniformly continuous [F2].

2.1F3F5step 1.1

The identity (i). By definition of (Gμ)∨ and step 1.1, ∫(Gμ)∨(x)F(x)‾ dx=∫∫p(x,ω) dμ(ω) dx, and Fubini [F3] rewrites this iterated integral as ∫[∫p(x,ω) dx]dμ(ω)=∫G(ω)[∫e2πix⋅ωF(x)‾ dx]dμ(ω), because G(ω) does not depend on x. By the conjugation law of [F5] with ξ=−ω, ∫e2πix⋅ωF(x)‾ dx=F‾^(−ω)=F^(ω)‾, so the last expression is ∫G(ω)F^(ω)‾ dμ(ω). This proves (i).

2.2F3F5F6step 1.1

The convolution identity (ii). Fix x∈Rn and put Fx:=F(−⋅), so that τxFx(z)=Fx(z−x)=F(x−z). By the translation and reflection laws of [F5], for every ω, ∫F(x−z)e2πiz⋅ω dz=τxFx^(−ω)=e−2πix⋅(−ω)Fx^(−ω)=e2πix⋅ωF^(ω). Substituting this into the definition of (F^μ)∨ and applying Fubini [F3], which is licensed by step 1.1, gives (F^μ)∨(x)=∫e2πix⋅ωF^(ω) dμ(ω)=∫∫q(z,ω) dz dμ(ω)=∫F(x−z)[∫e2πiz⋅ω dμ(ω)]dz. The inner integral is μˇ(z) by its defining formula, so the last expression is ∫F(x−z)μˇ(z) dz=(F∗μˇ)(x) by [F6]; this holds for every x.

3.1F2F4F8step 2.2

Bounded continuity. By [F2], ∣μˇ(z)∣≤M for every z, so ∣F∗μˇ(x)∣≤∥F∥1M<∞; for the other side, ∣(F^μ)∨(x)∣=∣∫e2πix⋅ωF^(ω) dμ(ω)∣≤∫∣F^∣ d∣μ∣≤∥F^∥∞M≤∥F∥1M<∞ by the modulus bound of [F8] and [F4], and the equality of step 2.2 therefore holds between two bounded functions. For continuity of F∗μˇ, let ωμˇ be the modulus of uniform continuity of [F2]: for all x,x′, ∣F∗μˇ(x)−F∗μˇ(x′)∣≤∫∣F(z)∣ ∣μˇ(x−z)−μˇ(x′−z)∣ dz≤∥F∥1 ωμˇ(∣x−x′∣)⟶0 as x′→x; hence F∗μˇ is continuous, and by step 2.2 so is (F^μ)∨. Thus the identity of (ii) holds as everywhere-defined bounded continuous functions.

4.1step 2.1step 2.2step 3.1step 1.2∎

Conclusion. Step 2.1 proves (i); steps 2.2 and 3.1 prove (ii) as an identity of everywhere-defined bounded continuous functions; step 1.2 proves (iii). Countable Choice is spent only through the sigma-finite Fubini/Tonelli interfaces and the transform law of the cited suppliers, whose own hypotheses carry it.

Depends on

Used by

Dependency tree · two levels

79 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