Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Choice-free residual error bound for piecewise-C1 ODE reconstructions

Statement

Let d≥1 and a<T, let D⊆R×Rd be open, let f:D→Rd be continuous, and let y be an exact solution of y′=f(t,y) on [a,T]. Let U:[a,T]→Rd be continuous and C1 on each member of a finite partition (continuously differentiable on each closed panel, with one-sided endpoint derivatives), with graph in D. Let ℓ,ρ:[a,T]→[0,∞) be continuous on each partition interval, with one-sided endpoint values, and suppose on every open panel ⟨U−y,f(t,U)−f(t,y)⟩≤ℓ(t)∥U−y∥22,∥U′(t)−f(t,U(t))∥2≤ρ(t). Then for every t∈[a,T], ∥U(t)−y(t)∥2≤e∫atℓ(v) dv∥U(a)−y(a)∥2+∫ate∫stℓ(v) dvρ(s) ds. The proof uses only finite-piece ordinary calculus and no choice axiom. The general absolutely continuous case is treated separately.

Facts & Assumptions

Given: The exact solution, reconstruction, finite partition, nonnegative piecewise-continuous coefficient and residual envelope in the Statement.

[F1]

First-order systems, initial value problems, and solutions on intervals: the exact solution is differentiable and satisfies y′=f(t,y).

[F7]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the Euclidean inner product is symmetric and bilinear, and ∥e∥22=⟨e,e⟩.

Proof

1.1givenF1F2F3F6F7algebra

On one open partition panel put e=U−y, qε=(∥e∥22+ε2)1/2 for ε>0, and r=U′−f(t,U). The functions are C1 there, so [F3], [F6], and [F7] give qε′=⟨e,e′⟩/qε. Since e′=r+f(t,U)−f(t,y), the hypotheses and [F2] yield qε′≤ℓ∥e∥22qε+ρ∥e∥2qε≤ℓqε+ρ, using ℓ≥0, ∥e∥2≤qε, and ∥e∥22≤qε2.

2.1F3F4F5step 1.1algebra

Let Λ(t)=∫atℓ(v) dv and multiply the differential inequality by e−Λ(t). On each panel, [F3]–[F5] give (e−Λqε)′≤e−Λρ. Integrate on each full or partial panel and add the finitely many inequalities; continuity at the partition nodes cancels the intermediate endpoint terms. This gives qε(t)≤eΛ(t)qε(a)+∫ateΛ(t)−Λ(s)ρ(s) ds.

3.1step 2.1algebra∎

Let ε↓0. Since qε(t)→∥U(t)−y(t)∥2 and qε(a)→∥U(a)−y(a)∥2, while the integral term is independent of ε, the inequality in step 2.1 passes to the limit. Replacing Λ(t)−Λ(s) by ∫stℓ(v) dv gives the claimed estimate.

Depends on

Used by

Dependency tree · two levels

70 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