Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Convergence of dyadic tensor composite-Simpson rules

Statement

Let d≥1 and let f:[0,1]d→R be continuous. For the dyadic composite-Simpson hierarchy of Nested one-dimensional quadrature levels and differences, the tensor product QL⊗d converges to the multiple Riemann integral: lim⁡L→∞QL⊗d(f)=Id(f).

Facts & Assumptions

Given: d≥1 and a continuous f:[0,1]d→R.

[F1]

Nested one-dimensional quadrature levels and differences: QL is composite Simpson with 2L+1 equal panels. Regrouping into 2L two-panel blocks gives each block length H=2−L and weights H(1,4,1)/6 at its left endpoint, midpoint, and right endpoint.

[F3]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous map from a compact metric space to a metric space is uniformly continuous.

[F5]

Grid partitions of a rectangle in Rm, their cells, refinements and mesh: the uniform partition into side-H boxes covers the cube, has disjoint interiors, and its cell volumes sum to one.

[F6]

Lower and upper Darboux sums over a grid partition in Rm and The lower and upper Darboux integrals over a nondegenerate rectangle in Rm: for each cell C, the lower and upper contributions are (inf⁡Cf)vol⁡(C) and (sup⁡Cf)vol⁡(C).

[F7]

Composite Simpson rule on an even uniform grid: every two-panel Simpson block has coefficients proportional to 1,4,1, which are nonnegative and sum to 6.

[F8]

Laws of finite sums and finite products: finite sums distribute and may be regrouped.

[F9]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous function on a nonempty compact metric space has finite maximum and minimum, so its Darboux cell extrema are finite.

[F10]

For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞ and Limits and Cauchy sequences of reals: for every positive rational ρ, all sufficiently large L satisfy (1/2)L<ρ; Laws of integer exponents gives (1/2)L=2−L.

[F11]

The rationals embed densely in the reals: below every positive real lies a positive rational.

Proof

1.1givenF2F3F10F11F12choose

Fix ε>0. By [F2] and [F3], f is uniformly continuous on [0,1]d. Choose δ>0 such that ∥x−y∥2<δ implies ∣f(x)−f(y)∣<ε. By [F12], δ/d>0; use [F11] to choose a positive rational ρ<δ/d, then [F10] to choose L with H=2−L<ρ. Thus d H<δ, and every cell of the uniform d-dimensional grid has diameter d H.

2.1givenF1F5F6F7F8F9step 1.1algebra

For the L chosen in step 1.1, the tensor Simpson rule is the sum over grid cells of their tensor two-panel block rules: each cell contributes Hd times a weighted average of its 3d endpoint/midpoint tensor nodes, with coefficients ∏j=1d(1,4,1)ij/6d. These coefficients are nonnegative and sum to one by [F7]. Each closed cell is compact and nonempty, so [F9] gives finite infimum and supremum of f there. Every node lies in its cell and its value lies between those extrema. Regrouping finite sums by [F8] gives L(f,PL)≤QL⊗d(f)≤U(f,PL), with the factors Hd equal to cell volumes.

3.1givenF4F5F6step 1.1step 2.1algebra∎

By step 1.1, the oscillation of f on each cell is at most ε. Thus [F5]–[F6] give U(f,PL)−L(f,PL)≤ε∑Cvol⁡(C)=ε. By [F4], Id(f) lies between these Darboux sums; step 2.1 places the tensor-Simpson value between them as well. Therefore ∣QL⊗d(f)−Id(f)∣≤ε. This holds for sufficiently large L for each ε>0, proving convergence.

Depends on

Used by

Dependency tree · two levels

97 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