Alphabeta Math
LemmaStatement: 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.

A transverse hybrid event time is stable under dense-output and root error

Statement

Let J=[a,b] with a<b, let y be an exact incoming mode trajectory on J, and let U be a dense reconstruction with sup⁡t∈J∥y(t)−U(t)∥2≤η. Let g(t,x) be Lg-Lipschitz in x on the certified tube, with declared crossing orientation σ∈{−1,+1}. Suppose h(t)=g(t,y(t)) has a root τ∈J and, throughout J, σh′(t)≥ν for some ν>0. If a reported time τ^∈J satisfies ∣g(τ^,U(τ^))∣≤ε, then ∣τ^−τ∣≤Lgη+εν≤C(η+ε)ν,C:=max⁡{Lg,1}. The same-sign derivative condition makes τ the unique guard root in J. The conclusion concerns a root matched to this transverse bracket; it gives no bound at grazing or across a change of event ordering.

Facts & Assumptions

Given: The incoming mode, a certified dense-output tube on J, a guard g, a true guard root τ, uniform transversality on J, and the residual tolerance at τ^.

[F1]

Smooth hybrid ODE modes, guards, resets, and deterministic event priority: the incoming trajectory solves a smooth mode ODE, and an event guard has a declared orientation σ.

[F2]

Certified dense-output and reference-guard enclosure data for hybrid events: an admissible provider supplies the valid uniform bound ∥y(t)−U(t)∥2≤η on the matched bracket and the guard state-Lipschitz constant Lg on a tube containing both curves; these data need not come from a rational residual-tube checker.

[F3]

The derivative of a guard along an ODE mode is its Lie derivative: h′(t)=∂tg(t,y(t))+Dyg(t,y(t))fm(t,y(t)).

[F4]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): a continuous scalar function on a closed interval and differentiable in its interior has an interior point whose derivative is its endpoint difference divided by interval length.

Proof

1.1givenF1F2algebra

By [F2] and the state-Lipschitz bound, ∣h(τ^)−g(τ^,U(τ^))∣≤Lgη. The residual hypothesis therefore gives ∣h(τ^)∣≤Lgη+ε, since h(τ)=0.

2.1givenF1F3F4step 1.1algebra

If τ^=τ the desired bound is immediate. Otherwise apply [F4] to h on the interval with endpoints τ and τ^. Since σh′≥ν throughout, the derivative has one fixed sign and magnitude at least ν, so ∣h(τ^)−h(τ)∣≥ν∣τ^−τ∣. Using h(τ)=0 and step 1.1 proves ∣τ^−τ∣≤(Lgη+ε)/ν.

3.1givenF4step 2.1algebra∎

Since Lgη+ε≤max⁡{Lg,1}(η+ε), the second inequality follows with the stated C. For any s<t in J, [F4] gives h(t)−h(s)=h′(c)(t−s) for some interior c; the fixed sign of h′ makes this increment nonzero, so h is strictly monotone and its root in J is unique.

Depends on

Used by

Dependency tree · two levels

18 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