Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Finite separated transverse events give an event-aligned hybrid trajectory error bound

Statement

Consider exact and reported hybrid trajectories with the same initial data and a common finite sequence of transitions at exact event times τ1<⋯<τN and reported times τ^1<⋯<τ^N. Assume the events are separated by δ>0, are transverse with margins νj>0, and the reported event times are upper endpoints of certified root boxes, so τj≤τ^j. After each event, both trajectories are compared at the reported event time, when both are in the outgoing mode. Let Ej bound their state discrepancy at this aligned mode-segment start, with E0=0.

For mode segment j, let Uj be the accumulated piecewise dense reconstruction from the reported start, with a certified local error bound ηjloc relative to the exact mode solution from that same start. Let Lj be a state-Lipschitz bound, Hj the segment duration, and Lg,j,εj the guard state-Lipschitz and reported guard-residual bounds. Let Dj be a certified total error bound between Uj and the exact reference incoming-mode continuation on the prefix. It may be supplied directly; a sufficient ledger calculation is Dj:=ηjloc+eLjHjEj, when the two exact mode solutions share the aligned start time, their initial discrepancy is at most Ej, and both remain in a common convex tube on which the field is Lj-Lipschitz. Then Dj bounds the reference error on the incoming-mode prefix and Δj+1:=Lg,jDj+εjνj+1 bounds τ^j+1−τj+1. Assume Δj+1<δ/3 for each event; the event separation then ensures no later exact event occurs before the reported reset time. At each event assume the reset has state and time Lipschitz constants LR,j+1,LR,t,j+1 on a domain containing both compared reset inputs and the coordinate segments joining them, the incoming field is bounded by Mj− over the event-time bracket, and both outgoing solutions remain through their alignment time in a common tube where the outgoing field is bounded by Mj+1+ and is Lj+1+-Lipschitz in state. If the reported reset value is approximate, let εR,j+1≥0 be a certified bound on its evaluation error, with εR,j+1=0 for exact evaluation. Then Ej+1:=LR,j+1Dj+(LR,j+1Mj−+LR,t,j+1+Mj+1+)Δj+1+εR,j+1 bounds the state discrepancy at the next aligned mode-segment start. The terminal segment has its supplied total bound DN; when the sufficient common-tube ledger calculation applies, one may take DN=ηNloc+eLNHNEN. These finite recurrences bound state errors on matched smooth-mode segments and reset states at aligned times; they make no same-clock state claim between an exact jump and its later reported jump.

Facts & Assumptions

Given: The common finite event sequence separated by δ, aligned initial state, valid local and total error bounds, Lipschitz and field bounds on the required tubes, reported upper event-box endpoints with lag bounds Δj<δ/3, event residual/transversality data, and certified reported reset-evaluation error bounds.

[F1]

Smooth hybrid ODE modes, guards, resets, and deterministic event priority: each trajectory follows its current smooth mode until an enabled guard event, applies the reset, and changes mode.

[F2]

A validated rational residual-tube certificate encloses an exact ODE solution: in the finite-rational provider branch, a certified local residual-tube certificate gives an exact mode solution whose distance from the stored dense reconstruction is bounded by its panel radius; a provider's stated finite uniform upper bound on those radii supplies ηjloc. Other providers may supply the same justified local error bound directly under Certified dense-output and reference-guard enclosure data for hybrid events.

[F3]

Certified dense-output and reference-guard enclosure data for hybrid events: an admissible provider supplies valid local and total reference error bounds, exact-guard and derivative enclosures, and the mode, guard, and reset data; the total bound may be computed from the local bound and aligned-start error by the displayed flow estimate or supplied directly.

[F4]

A Lipschitz ODE mode flow is stable to its initial state on a tube: same-mode solutions starting at a common time with state error e differ over duration H by at most eLHe.

[F5]

A transverse hybrid event time is stable under dense-output and root error: dense state error Dj and guard residual εj give event-time error at most (Lg,jDj+εj)/νj+1.

[F6]

A first-order initial value problem is equivalent to its Volterra integral equation: on a nondegenerate interval, a mode solution increment is the integral of its vector field.

Proof

1.1givenF2F3F4algebra

At the aligned start of segment j, the two exact mode solutions have state discrepancy at most Ej and the same initial time. When the total bound is formed by the sufficient ledger calculation, apply [F4] through duration Hj to bound their discrepancy by eLjHjEj, then add the local reconstruction error ηjloc from [F2] by the triangle inequality. If the provider supplies Dj directly, [F3] states that this is already a valid total bound. In either case Dj bounds the incoming reference error used below.

2.1givenF3F5step 1.1

On the certified event bracket, use [F5] with dense-state error Dj, guard residual εj, and transverse margin νj+1. This gives τ^j+1−τj+1≤Δj+1; the left side is nonnegative because the reported time is the root-box upper endpoint.

3.1givenF1F3F6F7step 1.1step 2.1algebra

Put τ=τj+1, τ^=τ^j+1, and ℓ=τ^−τ. By step 2.1, 0≤ℓ≤Δj+1<δ/3, so no next exact event occurs before τ^. For ℓ>0, [F6] and [F7] give ∥y−(τ^)−y−(τ)∥2≤Mj−ℓ and ∥y+(τ^)−R(τ,y−(τ))∥2≤Mj+1+ℓ by integrating along the incoming continuation and the exact outgoing solution; for ℓ=0 both displacements vanish. The total reference error from step 1.1 gives ∥Uj(τ^)−y−(τ)∥2≤Dj+Mj−ℓ. Apply the reset's state and time Lipschitz bounds along the assumed coordinate segments to get ∥R(τ^,Uj(τ^))−R(τ,y−(τ))∥2≤LR,j+1Dj+(LR,j+1Mj−+LR,t,j+1)ℓ. Add the exact outgoing displacement and the reported reset-evaluation error εR,j+1 by the triangle inequality, then use ℓ≤Δj+1 to obtain the stated Ej+1. Only field bounds along the integrated paths are needed for alignment.

4.1givenstep 1.1step 2.1step 3.1algebrainduction∎

Since N is finite, steps 1.1–3.1 give finite nonnegative bounds successively through all event segments. The terminal application of step 1.1 gives DN. Write ℓj:=τ^j−τj, so 0≤ℓj≤Δj by step 2.1. The given bound Δj<δ/3 places each reported event before the next exact event. Also τ^j+1−τ^j=(τj+1−τj)+ℓj+1−ℓj≥δ−Δj>2δ/3, so the reported event order is unchanged.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

54 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