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.

A posteriori ODE error bound from the continuous residual

Statement

Assume the Axioms of Countable Choice and Dependent Choice. Let d≥1 and a<b, let D⊆R×Rd be open, let f:D→Rd be continuous, and let y:[a,b]→Rd be an exact solution of y′=f(t,y) whose graph lies in D. Let U:[a,b]→Rd be componentwise absolutely continuous with graph in D. Suppose ℓ,ρ∈L1[a,b], ρ≥0 almost everywhere, and, for almost every t, the points U(t),y(t) satisfy

⟨U(t)−y(t),f(t,U(t))−f(t,y(t))⟩≤ℓ(t)∥U(t)−y(t)∥22.

Define r(t):=U′(t)−f(t,U(t)) wherever U′ exists, and assume ∥r(t)∥2≤ρ(t) almost everywhere. Then, for every t∈[a,b],

∥U(t)−y(t)∥2≤exp⁡ ⁣(∫atℓ(v) dv)∥U(a)−y(a)∥2+∫atexp⁡ ⁣(∫stℓ(v) dv)ρ(s) ds.

The bound is a posteriori: it uses the residual of the actual reconstruction. An embedded Runge–Kutta difference alone does not supply the hypothesis ∥r(t)∥2≤ρ(t).

Facts & Assumptions

Given: The domain, exact solution, reconstruction, integrable coefficient and residual bound in the Statement, and Countable Choice plus Dependent Choice.

[A1]

The Axiom of Countable Choice (ACω) and The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain: the proof assumes both axioms only when applying the library's fundamental theorem for absolutely continuous functions.

[A2]

For almost every t, ⟨U(t)−y(t),f(t,U(t))−f(t,y(t))⟩≤ℓ(t)∥U(t)−y(t)∥22.

[A3]

r(t)=U′(t)−f(t,U(t)) satisfies ∥r(t)∥2≤ρ(t) almost everywhere, with ℓ,ρ∈L1[a,b] and ρ≥0 almost everywhere.

[L1]

The class L1(μ) of integrable functions and Integrable real and complex functions, and their integrals: g∈L1[a,b] means that g is measurable and ∫ab∣g∣<∞; the measure is Lebesgue measure restricted to [a,b].

[F1]

Absolute continuity on a compact interval: absolute continuity on [a,b] is the finite disjoint-interval increment condition.

[F2]

First-order systems, initial value problems, and solutions on intervals: a solution remains in the open time-state domain and satisfies y′=f(t,y).

[F3]

Fundamental theorem of calculus for absolutely continuous functions: under Countable Choice and Dependent Choice, an absolutely continuous real function has integrable derivative almost everywhere and equals its initial value plus the integral of that derivative.

[F4]
[F5]

The indefinite integral of an L1 function is absolutely continuous and The indefinite integral of an L1 function is differentiable almost everywhere: if g∈L1, then its indefinite integral is absolutely continuous and has derivative g almost everywhere.

[F10]

The modulus of an integral is bounded by the integral of the modulus: for g∈L1, ∣∫g∣≤∫∣g∣.

[F11]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative Lebesgue integral is monotone and homogeneous for nonnegative finite scalars.

[F12]

Arithmetic and lattice operations preserve measurability whenever they are defined: sums, scalar multiples, products and absolute values of measurable real-valued functions are measurable.

[F13]
[F14]

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

Proof

1.1givenF1F4F14algebra

Put e:=U−y and q(t):=∥e(t)∥2. Each component ei is absolutely continuous by [F1]. Given ϵ>0, choose for each of the finitely many components a positive interval-length threshold that makes the sum of its increments less than ϵ/d; the minimum of these finitely many thresholds works for all components at once. For any finite disjoint interval family with total length below that minimum, [F4] gives ∣q(v)−q(u)∣≤∥e(v)−e(u)∥2≤∑i∣ei(v)−ei(u)∣, so the total increments of q are below ϵ. Thus q is absolutely continuous by [F1].

2.1givenA1A2A3F2F3F4F14step 1.1algebra

By [F3], q and each component of e are differentiable almost everywhere; the finite intersection of these full-measure sets is still full measure. At such a point with q>0, differentiating q2=⟨e,e⟩ using [F14] gives 2qq′=2⟨e,e′⟩, hence q′=⟨e,e′⟩/q. Since e′=r+f(t,U)−f(t,y), [A2], [A3], and [F4] imply q′≤ℓq+ρ. At a differentiability point where q=0, the nonnegative function q has a local minimum, so q′=0 and the same inequality holds.

3.1givenA1L1F5F6F7F8F9F10F11step 2.1algebra

Define Λ(t):=∫atℓ(v) dv and w(t):=exp⁡(−Λ(t)). By [F5], Λ is absolutely continuous and Λ′=ℓ almost everywhere. [F10] and [F11] give ∣Λ(t)∣≤∫ab∣ℓ(v)∣ dv=:M, and ∣ddxexp⁡(−x)∣=exp⁡(−x)≤exp⁡(M) on [−M,M], so [F8] and [F9] make x↦exp⁡(−x) Lipschitz there. By [F6], w and wq are absolutely continuous. At almost every point, [F7]–[F8] give (wq)′=w(q′−ℓq)≤wρ.

4.1A1L1F3F11F12F13step 3.1algebra

The product wρ is measurable by [F12], and ∣wρ∣≤exp⁡(M)ρ almost everywhere. Since ρ≥0 almost everywhere and ∫abρ<∞, [F11] implies ∫ab∣wρ∣<∞; [L1] gives wρ∈L1. By [F3], (wq)′∈L1, so h:=wρ−(wq)′ is in L1 by [F13]. Step 3.1 says h≥0 almost everywhere. Since 0≤h+≤∣h∣ almost everywhere, [F11] and h∈L1 give ∫abh+<∞; measurability follows from [F12], so [L1] gives h+∈L1. Thus h=h+ almost everywhere; [F13] gives ∫ath=∫ath+, and [F11] gives ∫ath+≥0. Hence ∫at(wq)′≤∫atwρ.

5.1A1F3F8step 4.1algebra∎

Apply [F3] to wq on [a,t], and use w(a)=1 and w(t)>0 from [F8]. Step 4.1 gives q(t)≤exp⁡(Λ(t))q(a)+∫atexp⁡(Λ(t)−Λ(s))ρ(s) ds. Substituting the definition of Λ gives the asserted bound.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

95 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