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.
Event location and hybrid trajectory error — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Adaptive ODE solvers and error estimation
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Event location and hybrid trajectory error
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Interval newton krawczyk and polynomial root isolation
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Outward rounded interval and ball arithmetic
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Runge–Kutta Methods and Order
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples calculate a transverse bouncing-ball impact and its reset error, exhibit square-root guard-root location sensitivity at a grazing contact, and compare the continuations produced by two explicit priority orders for simultaneous guards. An inelastic ball has infinitely many impacts in finite time, so the finite-event hypothesis cannot be dropped. Finally, a guard with two roots between equal-sign step endpoints shows why endpoint sign screening cannot certify that no enabled event occurred.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Inelastic bouncing-ball impacts can accumulate in finite time
Statement refuted
Every hybrid ODE trajectory whose individual impacts are transverse has only finitely many events on every bounded time interval contained in its time domain.
Facts & Assumptions
Given: A rigid ball moves vertically under constant downward acceleration , with height and velocity ; the impact guard is with downward crossing orientation, and the reset is for a fixed restitution coefficient .
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a guard crossing applies its reset and restarts the outgoing smooth mode.
Counterexample
Start immediately after a bounce with upward velocity . Under , , the next impact occurs after , and the incoming impact velocity is . Its guard derivative is , so it has the declared downward orientation; the reset produces upward velocity and does not immediately re-trigger that oriented guard.
Repeating the calculation, the time between the th and st impacts is for . Every such interval is positive, so the impacts are distinct; at each one the incoming guard derivative is , so each crossing is transverse and has the declared orientation.
The impact times are for , and converge to . Concatenating the exact mode solutions and resets defines a hybrid execution on the bounded half-open interval : every lies before only finitely many impacts, while the event times accumulate at the excluded endpoint. It therefore has infinitely many transverse impacts in a bounded interval contained in its time domain, refuting the statement. The event separations tend to zero, so the finite separated-event theorem does not apply.
Simultaneous guards need a deterministic priority rule
Example
Consider a one-dimensional transition specification with initial mode , field , initial condition , and two outgoing guards and , both with positive crossing orientation. Transition resets to terminal mode with ; transition resets to terminal mode with . Both reset maps set to . This data is incomplete under Smooth hybrid ODE modes, guards, resets, and deterministic event priority until a fixed total priority order on the outgoing transitions from is supplied.
Facts & Assumptions
Given: The oriented-guard and fixed total event-priority conventions of Smooth hybrid ODE modes, guards, resets, and deterministic event priority.
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: an event occurs at a zero of an active guard, the reset is applied at that time, and a fixed priority selects among guards vanishing simultaneously.
Verification
In mode , the exact solution is , so both guards first vanish at and have derivative there. Thus both transitions are enabled simultaneously.
Completing the specification with priority selects transition and the continuation in mode is for . Completing it instead with priority selects transition and the continuation in mode is for . Each completed system has a fixed priority and determines one continuation, but the incomplete specification alone does not determine which completion was intended.
A grazing guard contact has square-root rather than linear root-location sensitivity
Statement refuted
There is a constant such that every smooth guard root, including a grazing contact with zero derivative, has root-location error at most whenever the dense state error is and the approximate guard residual is .
Facts & Assumptions
Given: One scalar state with constant mode field , exact state , and guard .
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a hybrid event requires a guard zero that crosses in its declared orientation; a zero with vanishing derivative is only a guard contact under this definition.
A transverse hybrid event time is stable under dense-output and root error: the linear event-time bound assumes a uniform positive lower bound on the signed guard derivative over the matched bracket.
Counterexample
The exact trajectory is , so the exact guard is . It has an interior root at and . The guard does not cross either declared orientation, so this is a grazing guard contact, not an enabled hybrid event under [F1].
For any , take the dense reconstruction . Its uniform state error is , while its guard has zero residual at . Thus and .
If a fixed gave the refuted root-location bound, it would require for every , equivalently . The left side is unbounded as , so no such constant exists. Here , so the positive derivative margin required by [F2] is absent; the calculation concerns sensitivity of a guard contact, not the time of an enabled event.
A bouncing-ball impact has a transverse event-time and reset-error bound
Example
Let be height and velocity, with mode field , before and after impacts, initial state , downward guard of orientation , and time-independent reset . On the event bracket , use the approximate incoming reconstruction It has uniform state error from the exact incoming solution . The reported guard root is , and the exact impact time is . This example isolates the event-time and reset estimates; it does not claim that is a residual-certified reconstruction from the exact initial state.
Facts & Assumptions
Given: A smooth hybrid mode and reset, the transverse event-time estimate, and the mistimed-reset estimate.
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a mode follows its ODE until an oriented guard crossing, then applies its reset and changes mode.
A transverse hybrid event time is stable under dense-output and root error: if the exact guard has signed derivative at least , the dense state error is at most , and the reported guard residual is at most , then .
Reset and smooth-mode flow propagate a transverse event-time error: with incoming error , event-time error , reset constants , and incoming/outgoing field bounds , the aligned post-reset error is at most .
Verification
The exact incoming solution is , so its guard has the unique root on the bracket. For , , so the downward crossing is transverse with margin .
The dense guard is , whose root in the bracket is and whose residual there is . For , both sides are nonnegative and , so . Taking gives .
On the bracket, . Since , , so ; the reported guard residual is zero. Apply [F2] with to obtain , agreeing with the explicit bound in step 2.1.
The reset is defined on all of , is -Lipschitz in state, and has . On the incoming bracket, and . Step 3.1 gives . The outgoing field is globally -Lipschitz in state. The exact outgoing path through and the reported reset state lie in , where the field norm is less than ; by local existence and continuity both outgoing solutions remain in the bounded convex rectangle for a short common forward interval. Thus the reset and outgoing tube hypotheses of [F3] hold with and . By [F3], the aligned post-reset error is at most .
Directly, the exact outgoing state at is and the reported reset state is . Their difference has components bounded by and , so its Euclidean norm is at most . This verifies the reset estimate for this instance.
Two guard crossings between endpoints defeat sign-only screening
Example
On , let an initial mode have and one outgoing transition with time-dependent guard , positive crossing orientation, and reset into a terminal mode with . The initial state is . The exact guard along the mode is .
Facts & Assumptions
Given: The smooth-mode oriented-event convention and the safeguarded locator's complete root-isolation and direction-classification rule.
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: an event occurs at an oriented guard crossing; its crossing direction is the sign of the guard derivative along the mode.
Safeguarded certified event location and mode restart: the locator isolates all roots on the trial interval, classifies each certified root by derivative sign, and reports no event only after complete isolation with no enabled root.
Verification
The incoming-mode continuation is , but the guard is independent of , so . Its endpoint values are . A rule that checks only endpoint signs therefore reports no crossing. The roots and are not dyadic, so neither lies on a midpoint boundary of the isolator's dyadic bisection of .
The two roots are and , and . Thus is a downward crossing while is an upward crossing. Under the declared positive orientation, the first root is nontriggering and the second is enabled.
With exact polynomial range and derivative enclosures and a finite box budget sufficient for a complete result, the interval isolator in [F2] finds both roots and classifies their derivative signs. It cannot certify no event, because the root at is enabled and is the earliest enabled event. Thus equal endpoint signs do not justify an event-absence conclusion; a certified absence report requires complete root isolation and orientation classification with no enabled root.
Sources
- Nathan J. Kong, J. Joe Payne, James Zhu, and Aaron M. Johnson, Saltation Matrices: The Essential Tool for Linearizing Hybrid Dynamical Systems
- Joel M. Esposito, Vijay Kumar, and George J. Pappas, Accurate Event Detection for Simulating Hybrid Systems, HSCC 2001, pp. 204–217
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, §2.4