Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

L1 approximate identities converge uniformly on compacta for bounded continuous functions

Statement

Let (Kε)ε>0 be an L1 approximate identity on Rn, and let f:Rn→C be bounded and continuous. Then for every compact set K⊆Rn,

sup⁡x∈K∣(f∗Kε)(x)−f(x)∣⟶0(ε→0+).

Facts & Assumptions

Given: An L1 approximate identity, a bounded continuous function f, and a compact set K.

[L1]

Approximate identities are defined in An L1 approximate identity on Rn.

[L2]

Proof

technique · direct
1.1L2L3givenchoose

Let η>0. Choose δ>0 so that [L2, L3, given, choose] ∣f(x−y)−f(x)∣<η whenever x∈K and ∣y∣<δ; this is possible by [L2] on a compact neighborhood of K.

2.1L1step 1.1algebra

For x∈K, [L1, step 1.1, algebra] ∣(f∗Kε)(x)−f(x)∣≤∫∣Kε(y)∣ ∣f(x−y)−f(x)∣ dy. Split the integral into ∣y∣<δ and ∣y∣≥δ. The near part is at most η∥Kε∥1, while the far part is bounded by 2∥f∥∞∫∣y∣≥δ∣Kε(y)∣ dy.

3.1L1step 2.1∎

The L1 norms are uniformly bounded and the tail term tends to 0 by [L1]. [L1, step 2.1] Hence first choose η small enough and then ε small enough to make the right-hand side uniformly small for all x∈K. This is exactly the claimed uniform convergence on K.

Depends on

Used by

Dependency tree · two levels

31 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