Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Nested one-dimensional quadrature levels and differences

Definition

Let Q:{g:[0,1]→R}→R be a finite quadrature functional of the form Q(g)=∑i=1mwig(xi), where m≥1, the nodes xi∈[0,1] are distinct, and wi∈R. A one-dimensional nested level hierarchy is a sequence (Qℓ)ℓ∈N0 of such functionals, with node sets Xℓ={xℓ,i:1≤i≤mℓ} satisfying Xℓ−1⊆Xℓ for every ℓ≥1. Set Q−1:=0, the zero functional, and define the detail functional Δ0:=Q0,Δℓ:=Qℓ−Qℓ−1(ℓ≥1). Finite sums are as in Finite sums and finite products, by recursion. For each d≥1, the integration functional used below is Id(f):=∫[0,1]df, with the multiple Riemann integral convention of The lower and upper Darboux integrals over a nondegenerate rectangle in Rm.

The convergence and rate results in this pair use the dyadic composite- Simpson hierarchy Qℓ(g):=QS(g;0,1,2ℓ+1),Xℓ={k/2ℓ+1:0≤k≤2ℓ+1}, where QS is the even-panel rule of Composite Simpson rule on an even uniform grid. The number of panels is even and at least two. The sets are nested because k/2ℓ=2k/2ℓ+1, and their weights are nonnegative with total weight one: each two-panel block has nonnegative weights H(1,4,1)/6 summing to its length H, and the blocks partition an interval of length one. Level zero has nodes 0,1/2,1 and weights 1/6,4/6,1/6.

For a multi-index ℓ=(ℓ1,…,ℓd)∈N0d, any tensor product Rℓ1(1)⊗⋯⊗Rℓd(d) of these finite functionals means the finite weighted functional obtained by multiplying the coordinate weights and evaluating on the corresponding node tuples. In particular, Δℓ:=Δℓ1(1)⊗⋯⊗Δℓd(d). No exactness or error property is implied by the notation alone.

Depends on

Used by

Dependency tree · two levels

22 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