Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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.

Certified dense-output and reference-guard enclosure data for hybrid events

Definition

Fix one mode m and a positive-length closed trial interval J=[a,b] with a<b, contained in a finite accumulated prefix that starts at the last reported reset. Certified hybrid event-enclosure data consist of the following.

  1. A continuous piecewise-C1 dense reconstruction U on the accumulated prefix, the exact mode solution yloc launched from the last reported reset on that prefix, and a finite bound ηloc≥0 justified to satisfy ∥yloc(t)−U(t)∥2≤ηloc throughout the prefix. The provider also supplies a finite bound ηref≥0 justified to satisfy ∥yref(t)−U(t)∥2≤ηref there, where yref is the exact incoming-mode continuation of the reference hybrid trajectory. On an open interval containing each queried trial interval, this reference continuation exists and is C1, so each exact reference guard is C1 there. Its finite error ledger records the aligned mode-segment start and an upper bound E≥∥xreported−xref∥2 on the discrepancy between reported and reference states there. One sufficient ledger calculation, when both exact mode solutions remain in a common convex tube and the field is L-Lipschitz in state there for duration H, is ηref=ηloc+eLHE by A Lipschitz ODE mode flow is stable to its initial state on a tube. A provider may instead supply a separately justified total bound ηref directly. The rational route in Finite rational residual-tube certificate for an ODE trajectory, Finite checker for rational residual-tube certificates, and A validated rational residual-tube certificate encloses an exact ODE solution is one sufficient provider for ηloc: its panel-radius functions must be accompanied by a finite uniform upper bound on the whole prefix. It is restricted to the rational-expression fields and polynomial reconstructions stated there; it is not required. One concrete dense-output formula is Quadratic continuous extension for Heun's method, which by itself is not an error certificate.
  2. For each active transition (m,n), a state-Lipschitz constant Lg for its guard on a tube containing the exact and reconstructed states, interval enclosures GmnU(I) of gmn(t,U(t)), and finite interval evaluators Emn(I),Dmn(I) for every queried closed subinterval I⊆J. For every t∈I, Emn(I) must contain gmn(t,yref(t)), Dmn(I) must contain ∂tgmn(t,yref(t))+Dygmn(t,yref(t))fm(t,yref(t)), and GmnU(I) must contain gmn(t,U(t)). By The derivative of a guard along an ODE mode is its Lie derivative, the second enclosure is the derivative of the exact reference guard. For orientation σmn, an interval has certified transverse margin ν>0 when σmnDmn(I)⊆[ν,∞). Reset data include state and time Lipschitz constants LR,LR,t certified on a domain containing both reset inputs and the coordinate segments joining (τ,yref(τ)) to (τ^,U(τ^)). The incoming field bound M− holds along yref on the event-time bracket; M+ bounds the outgoing field along the outgoing solution that starts earlier, from its reset time through the first common post-reset time.
  3. A finite error-ledger update rule and a certified separation bound δ>0 between consecutive selected exact hybrid event times on the horizon. The provider must supply a finite sound justification or validation for every successor local or total error bound it returns. When a no-event trial is accepted, append its dense panel to U, retain the aligned-start discrepancy E, and certify valid local and total reference-error bounds over the enlarged prefix. When a prefix ends at a selected transverse event, let τ be the unique selected exact event time in the certified physical-time bracket and let τ^ be the bracket's upper endpoint. Suppose the whole bracket has certified signed derivative margin ν>0, the dense guard residual at τ^ is bounded by ε, the total reference error on the bracket is bounded by ηref, the reset has state and time Lipschitz constants LR,LR,t, and the incoming and outgoing fields have norm bounds M−,M+ on the intervals required for comparison. A sufficient conditional provider rule is to justify 0≤τ^−τ≤Δnext with Δnext=(Lgηref+ε)/ν, require Δnext<δ/3, and set Enext=LRηref+(LRM−+LR,t+M+)Δnext for the exact reset evaluated at the reported state. If the reported reset is computed as R^ with a separately certified error ∥R^−R∥2≤εR, add εR to this Enext bound; exact reset evaluation has εR=0. The provider must validate the hypotheses and inequalities and certify the next prefix's total reference-error bound with this aligned-start discrepancy included (or provide another sound proof of that total bound). Since τ^−τ≤Δnext<δ/3<δ, the next selected exact event cannot precede τ^. These formulas are a sufficient provider-supplied rule, not inequalities proved by this definition itself. If any proof obligation, required bound, separation certificate, or strict lag test is missing or invalid, no restart ledger update is certified. A local error bound alone does not establish the total reference bound; prior reset-state errors must be included in ηref.

The provider may be any finite, sound method that supplies the stated bounds and interval inclusions; it returns certified with the data or inconclusive without them. Its checks may be provider-specific: a rational residual-tube checker is a sufficient concrete branch, not a universal evaluator for arbitrary C1 fields or reset states. The bounds and enclosures are admissible only when their claimed inequalities and inclusions are justified. A dense-output point evaluation alone establishes none of them. If a required evaluator, ledger entry, bound, or inclusion is unavailable or nonfinite, the event data are uncertified and no event-absence conclusion is permitted.

Depends on

Used by

Dependency tree · two levels

29 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