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.

Rectangular telescoping of tensor details

Statement

Let d≥1 and m=(m1,…,md)∈N0d. For Rm:={ℓ∈N0d:0≤ℓj≤mj for every j} and the details of Nested one-dimensional quadrature levels and differences, ∑ℓ∈RmΔℓ=Qm1(1)⊗⋯⊗Qmd(d).

Facts & Assumptions

Given: A dimension d≥1, terminal levels mj∈N0, and the nested one-dimensional level hierarchies.

[F1]

Nested one-dimensional quadrature levels and differences: Δ0=Q0 and Δr=Qr−Qr−1 for r≥1, with Q−1=0; tensor rules multiply coordinate weights.

[F2]

Smolyak cubature on a finite downward-closed index set: a cubature on a finite index set is the finite sum of the corresponding tensor details.

[F3]

Laws of finite sums and finite products: scalar finite sums satisfy additivity, scaling, and telescoping.

Proof

1.1givenF1F3algebra

Fix any one-dimensional input g and coordinate j, and put cr:=Qr(g). By [F3], ∑r=1mj(cr−cr−1)=cmj−c0; for mj=0 this is the empty-sum identity. Adding Q0(g) and using [F1] yields ∑r=0mjΔr(g)=Qmj(g). Since g was arbitrary, this is equality of functionals.

2.1givenF1F2F3F4step 1.1algebra∎

For each coordinate j, represent every Δr(j), 0≤r≤mj, on the common finite node set Xmj(j), inserting zero weights at absent nodes; this is possible by nestedness. Write its weight at x as aj,r(x), so ∑r=0mjΔr(j) has weight ∑r=0mjaj,r(x) by scalar additivity. By [F1], the tensor of these coordinate sums has weight ∏j=1d(∑r=0mjaj,r(xj)) at each node tuple. Repeated scalar scaling and additivity [F3], applied to the recursively formed product [F4], expand this weight as ∑ℓ∈Rm∏j=1daj,ℓj(xj). Multiplying by any input value f(x1,…,xd) and summing over the finite node tuples gives ∑ℓ∈RmΔℓ(f), since scalar additivity permits interchanging the finite sums. This is QRm(f) by [F2]. Step 1.1 identifies each coordinate sum with Qmj(j), proving the claimed equality of functionals for every f.

Depends on

Used by

Dependency tree · two levels

25 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