Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 multipliers of approximate identities

Statement

Assume countable choice. For any complex L1 approximate identity (Kε), K^ε(ξ)1 at each frequency. For fL1, fKε^=f^K^εf^ uniformly. Also fKεf in every finite Lp norm for which fLp.

Facts & Assumptions

Given: n1, The Axiom of Countable Choice (ACω), and the unit-mass, bounded-norm and absolute-tail conditions of An L1 approximate identity on Rn.

[F1]

Complex approximate identities converge in finite Lp norms (Complex translation, convolution, approximate identities, and mollification).

[F2]

The convolution transform equals the product of transforms (Fourier transform turns L1 convolution into multiplication).

[F3]

The supremum norm of a transform is bounded by the input L1 norm (The L1 transform is bounded and uniformly continuous).

Proof

1.1

Put M=supεKε1. Unit mass gives K^ε(ξ)1=Kε(y)(e2πiyξ1)dy. For fixed ξ, its modulus is bounded by Msupy<δe2πiyξ1+2yδKε(y)dy. The latter tail tends to zero (bound it by the defining tail outside δ/2), and the first term tends to zero with δ. This proves the pointwise multiplier limit.

given
2.1

F1 applies to every stated finite p and gives norm convergence, including p=1. By F2 and F3, f^K^εf^=F(fKεf)fKεf10. Thus uniform transform convergence follows from norm approximation, not merely the pointwise multiplier limit. Countable choice is inherited from F1 and F2.

F1F2F3step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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