Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Simultaneous L1 and L2 smooth approximation

Statement

Assume countable choice and let n≥1. For f∈L1(Rn;C)∩L2(Rn;C) there is one sequence fj∈Cc∞ converging to f in both norms.

Facts & Assumptions

[F1]

Dominated convergence holds (Dominated convergence).

[F2]

Under countable choice in dimension n≥1, the complex interface gives convergence of mollifications in each finite-exponent norm, and smooth compact support for a compactly supported input (Complex translation, convolution, approximate identities, and mollification).

[F3]

There is an explicit nonnegative smooth cutoff equal to one on the unit ball and supported in the radius-two ball (Explicit compactly supported smooth cutoffs).

Proof

technique · direct
1.1F1F3given

Fix a finite measurable representative of f and set gj=f1{∣x∣≤j, ∣f(x)∣≤j}, j≥1. Then gj is bounded and compactly supported, and ∣gj−f∣p≤∣f∣p tends pointwise to zero for p=1,2. [F1] therefore gives ∥gj−f∥p→0 in both norms. Let χ be [F3]'s cutoff and put ρ=χ/∫χ. Its integral is finite since it is bounded and supported in a finite-volume ball, and positive since it equals one on a ball containing a positive-volume box. Thus ρ is a specified real smooth compactly supported kernel of mass one.

2.1step 1.1F2given∎

For fixed j, [F2] gives ρ1/k∗gj→gj as k→∞ in both norms. Let kj be the least positive integer for which both errors are below 1/j, and define fj=ρ1/kj∗gj. The qualifying set is nonempty since both convergences hold, and the least-integer rule needs no further choice. [F2] makes fj smooth with compact support (contained in the radius j+2/kj ball). Finally ∥fj−f∥p≤1/j+∥gj−f∥p→0 for both p=1,2. The same sequence works, with countable choice inherited only from the Euclidean mollification interface.

Depends on

Dependency tree · 2 levels

Sources