Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Kernel Riemann sums converge uniformly on compact continuous-input sets

Statement

Let d,d′∈N with d,d′≥1, let D⊂Rd be nonempty, bounded, and Jordan measurable, let D′⊂Rd′ be nonempty and bounded, let κ∈C(Dˉ′×Dˉ) be scalar-valued, and let K⊂C(Dˉ) be nonempty and compact in the supremum norm. Give products of metric spaces the max metric. Let Qn:C(Dˉ)→R be bounded linear quadrature functionals with sup⁡n∥Qn∥<∞ and Qnf→∫Df(y) dy for every f∈C(Dˉ). Then sup⁡a∈Ksup⁡x∈Dˉ′∣Qn(κ(x,⋅)a(⋅))−∫Dκ(x,y)a(y) dy∣⟶0. This conclusion is in the supremum norm on the output variable. It does not by itself establish convergence in an arbitrary Banach output norm U.

Facts & Assumptions

Given: The compact set K, the continuous kernel κ, and the quadrature functionals in the Statement.

[F2]

The hypotheses give pointwise convergence Qnf→∫Df on C(Dˉ) and a uniform bound on the operator norms of Qn.

Proof

Proof strategy: direct finite-net argument.

1.1givenF3F4algebra

Define Φ(x,a)=κ(x,⋅)a(⋅) on Dˉ′×K. For (x,a),(x′,a′) in this product, ∥Φ(x′,a′)−Φ(x,a)∥∞≤∥κ∥∞∥a′−a∥∞+∥a∥∞sup⁡y∈Dˉ∣κ(x′,y)−κ(x,y)∣. The constants are finite by [F3]. Given η>0, uniform continuity of κ on Dˉ′×Dˉ gives a positive δ1 making the second term less than η/2 when ∣x′−x∣<δ1; choosing δ2>0 with ∥κ∥∞δ2<η/2 bounds the first term whenever ∥a′−a∥∞<δ2 (if ∥κ∥∞=0, that term is zero). Thus Φ is continuous for the max product metric. The domain is compact by [F3], so [F4] makes its image S compact.

1.2givenF2algebra

Put M=1+sup⁡n∥Qn∥+∣D∣>0. For any f,g∈C(Dˉ), ∣Qn(f)−∫Df−Qn(g)+∫Dg∣≤M∥f−g∥∞, since ∣∫D(f−g)∣≤∣D∣∥f−g∥∞.

2.1step 1.1F1F2choose

Fix ε>0. Put M=1+sup⁡n∥Qn∥+∣D∣>0. By [F1] and step 1.1, choose a finite ε/(3M)-net f1,…,fJ for S. For each j, [F2] gives an index nj such that ∣Qn(fj)−∫Dfj∣<ε/3 whenever n≥nj.

3.1step 1.2step 2.1algebra∎

Let n≥max⁡jnj and f∈S. Choose j with ∥f−fj∥∞<ε/(3M). By [step 1.2] and the bound from [step 2.1], ∣Qn(f)−∫Df∣≤M∥f−fj∥∞+∣Qn(fj)−∫Dfj∣+M∥fj−f∥∞<ε. Every f∈S has this bound, so taking the supremum over a∈K and x∈Dˉ′ proves the assertion.

Depends on

Used by

Dependency tree · two levels

90 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