Alphabeta Math
TheoremStatement: 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.

Absolute detail reconstruction and omitted-tail error bound

Statement

Let d≥1, let f:[0,1]d→R be continuous, and use a level hierarchy as in Nested one-dimensional quadrature levels and differences. Suppose its tensor rules satisfy QL⊗d(f)→Id(f) and its detail family is absolutely summable in the sense of Absolute summability of a multi-index detail family. For every finite downward-closed Λ⊆N0d containing 0, ∣Id(f)−QΛ(f)∣≤∑ℓ∈N0d∖Λ∣δℓ(f)∣. In particular, the dyadic composite-Simpson hierarchy satisfies the convergence hypothesis for continuous f by Convergence of dyadic tensor composite-Simpson rules, and for the mixed-derivative class of Mixed-derivative bounds for dyadic Simpson details the same hierarchy also satisfies absolute summability.

Facts & Assumptions

Given: A dimension d≥1, continuous f:[0,1]d→R, a level hierarchy whose tensor rules converge on f to Id(f), absolute summability of its detail family, and a finite downward-closed Λ containing 0.

[F1]

Smolyak cubature on a finite downward-closed index set: QΛ(f) is the finite sum of the tensor details indexed by Λ.

[F2]

Absolute summability of a multi-index detail family: a nonnegative multi-index sum is the supremum of its finite subsums when these are bounded; the omitted tail uses the same definition on the complement of Λ.

[F3]

Rectangular telescoping of tensor details: the sum of details over RL={ℓ:0≤ℓj≤L} is QL⊗d.

[F4]

Convergence of dyadic tensor composite-Simpson rules: QL⊗d(f)→Id(f).

[F5]

Triangle inequality for finite sums: the absolute value of each finite detail sum is at most the sum of its absolute terms.

[F6]

Laws of finite sums and finite products: finite sums split over disjoint finite index sets.

[F7]

Limits and Cauchy sequences of reals: convergence of a real sequence is tested using every positive rational tolerance.

[F8]

The triangle inequality: ∣x+y∣≤∣x∣+∣y∣ for real x,y.

[F9]

Mixed-derivative bounds for dyadic Simpson details: under its continuous mixed fourth-derivative hypotheses, every finite absolute-detail subsum has the common finite bound ∑S⊆[d]MS(17/43200)∣S∣.

[F10]

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

Proof

1.1givenF1F3F6choose

Choose L large enough that Λ⊆RL. By [F1], [F3], and [F6], QL⊗d(f)−QΛ(f)=∑ℓ∈RL∖Λδℓ(f). The index set on the right is finite and is contained in N0d∖Λ.

2.1givenF2F5F7F8F10step 1.1algebra

By [F5] and [F2], the absolute value of the right side in step 1.1 is at most the omitted-detail tail TΛ:=∑ℓ∉Λ∣δℓ(f)∣ for every sufficiently large L. Put xL:=QL⊗d(f)−QΛ(f) and z:=Id(f)−QΛ(f); the convergence hypothesis in Given says ∣xL−z∣=∣QL⊗d(f)−Id(f)∣ is eventually below every positive rational tolerance. If ∣z∣>TΛ, [F10] supplies a positive rational ε with 2ε<∣z∣−TΛ. For sufficiently large L, both Λ⊆RL and ∣xL−z∣<ε hold by finiteness of Λ and [F7]. The triangle inequality [F8] then gives ∣xL∣≥∣z∣−∣xL−z∣>∣z∣−ε>TΛ, contradicting the preceding tail bound. Hence the displayed omitted-tail inequality holds.

3.1givenF2F4F9step 2.1algebra∎

For the dyadic composite-Simpson hierarchy, [F4] supplies the convergence hypothesis in Given. If the mixed-derivative hypotheses of [F9] hold, its common bound makes the finite subsums of ∑ℓ∈N0d∣δℓ(f)∣ bounded above. By the definition [F2], the full absolute-detail sum is therefore defined and finite, so step 2.1 applies and proves the stated particular error case.

Depends on

Used by

Dependency tree · two levels

52 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