Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Distributed-delay midpoint quadrature separates two history errors

Example

Take a scalar delay window of length τ, constant kernel K(θ)=1, and continuous path y(t)=t2 on [−τ,T], so its history is ϕ(s)=s2. At query time t=0, let h=τ/m and refine the composite midpoint rule with r=qm cells, where m,q≥1 are integers and Δ=τ/r=h/q. The exact integral is τ3/3. The exact-history midpoint remainder is τΔ2/12, while using the piecewise-linear stored history adds a distinct node-history term. The stored-history rule returns an error of τh2/6 in this example; the two terms are separated in Distributed-delay midpoint error separates history and quadrature errors.

Facts & Assumptions

Given: A scalar history ϕ(s)=s2 on [−τ,0], the constant kernel on [0,τ], an aligned state mesh h=τ/m, and midpoint refinement Δ=h/q.

[F1]

The distributed-delay integral is IK[y](t)=∫0τK(θ)y(t−θ) dθ (Distributed delays through a finite-window history integral).

[F2]

The composite midpoint rule samples the stored piecewise-linear history at θj=(j+1/2)Δ (Composite midpoint quadrature for a distributed delay history).

[F3]

Under its uniform stored-path error bound on [−τ,T], the error bound splits into a stored-history node term and an exact-history quadrature remainder (Distributed-delay midpoint error separates history and quadrature errors).

Proof

1.1F1givenalgebra

At t=0, [F1] gives I=∫0τθ2dθ=τ3/3. Put Qex=Δ∑j=0r−1θj2, the midpoint sum using the exact history. On a cell centered at cj, write θ=cj+u with −Δ/2≤u≤Δ/2. Then ∫−Δ/2Δ/2(cj+u)2du=cj2Δ+Δ3/12. Summing the cells gives I−Qex=rΔ3/12=τΔ2/12.

1.2F2givenalgebra

On the history cell [ℓh,(ℓ+1)h] in the variable θ=−s, the stored chord of ϕ satisfies ϕ^h(−θ)−θ2=(θ−ℓh)((ℓ+1)h−θ). Its maximum is h2/4, so the uniform interpolation error on [−τ,0] is h2/4. Since Δ=h/q, every midpoint subcell is contained in one such chord cell.

2.1step 1.1step 1.2algebra

The stored chord is affine on each width-h cell, and the midpoint rule is exact for an affine function on each of its q equal subcells: the centered linear term integrates to zero. Therefore the stored-history midpoint sum Qst equals the integral of the chord. The area between the chord and θ2 on one width-h cell is ∫0hv(h−v)dv=h3/6. Summing m cells gives Qst−I=mh3/6=τh2/6. Combining with step 1.1 yields Qst−Qex=τh2/6+τΔ2/12.

3.1F2F3givenstep 1.1step 1.2step 2.1algebra∎

At t=0 every sampled time −θj lies in [−τ,0], so [F2] and step 1.2 give ∣Qst−Qex∣≤Δ∑j=0r−1∣ϕ^h(−θj)−θj2∣≤τh2/4. Combining this with step 1.1 directly gives ∣I−Qst∣≤τh2/4+τΔ2/12, the same history/quadrature split as [F3]; this calculation needs no error bound for positive-time stored values. The exact node-history term from step 2.1 is τh2/6+τΔ2/12≤τh2/4 because Δ≤h. Its positive sign cancels the midpoint underestimate Qex−I=−τΔ2/12, leaving ∣Qst−I∣=τh2/6.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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