Alphabeta Math
Pipeline-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.

✓ 5 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Event location and hybrid trajectory error — Examples

1 · Prerequisites

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

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

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 g>0, with height q and velocity v; the impact guard is q=0 with downward crossing orientation, and the reset is (q,v)+=(0,−ev−) for a fixed restitution coefficient 0<e<1.

[F1]

Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a guard crossing applies its reset and restarts the outgoing smooth mode.

Counterexample

1.1givenF1algebra

Start immediately after a bounce with upward velocity v0>0. Under q′=v, v′=−g, the next impact occurs after 2v0/g, and the incoming impact velocity is −v0. Its guard derivative is q′=v−=−v0<0, so it has the declared downward orientation; the reset produces upward velocity ev0 and does not immediately re-trigger that oriented guard.

2.1givenstep 1.1inductionalgebra

Repeating the calculation, the time between the kth and (k+1)st impacts is 2ekv0/g for k=0,1,2,…. Every such interval is positive, so the impacts are distinct; at each one the incoming guard derivative is q′=v−=−ekv0≠0, so each crossing is transverse and has the declared orientation.

3.1step 2.1algebraconstruct∎

The impact times are τn=∑k=0n−12ekv0/g for n≥1, and converge to TZ=2v0/(g(1−e))<∞. Concatenating the exact mode solutions and resets defines a hybrid execution on the bounded half-open interval [0,TZ): every t<TZ lies before only finitely many impacts, while the event times τn 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Simultaneous guards need a deterministic priority rule

Example

Consider a one-dimensional transition specification with initial mode I, field x′=1, initial condition x(0)=−1, and two outgoing guards g1(x)=x and g2(x)=x, both with positive crossing orientation. Transition g1 resets to terminal mode A with x′=0; transition g2 resets to terminal mode B with x′=1. Both reset maps set x to 0. 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 I 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.

[F1]

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

1.1givenF1algebra

In mode I, the exact solution is x(t)=−1+t, so both guards first vanish at t=1 and have derivative 1>0 there. Thus both transitions are enabled simultaneously.

2.1givenF1step 1.1algebra∎

Completing the specification with priority g1≺g2 selects transition g1 and the continuation in mode A is x(t)=0 for t≥1. Completing it instead with priority g2≺g1 selects transition g2 and the continuation in mode B is x(t)=t−1 for t≥1. Each completed system has a fixed priority and determines one continuation, but the incomplete specification alone does not determine which completion was intended.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A grazing guard contact has square-root rather than linear root-location sensitivity

Statement refuted

There is a constant C such that every smooth guard root, including a grazing contact with zero derivative, has root-location error at most C(η+ε) whenever the dense state error is η and the approximate guard residual is ε.

Facts & Assumptions

Given: One scalar state with constant mode field x′=0, exact state x(t)=0, and guard g(t,x)=(t−1)2+x.

[F1]

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.

[F2]

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

1.1givenF1algebra

The exact trajectory is x(t)=0, so the exact guard is h(t)=(t−1)2. It has an interior root at τ=1 and h′(1)=0. The guard does not cross either declared orientation, so this is a grazing guard contact, not an enabled hybrid event under [F1].

2.1givenstep 1.1algebra

For any η>0, take the dense reconstruction Uη(t)=−η. Its uniform state error is η, while its guard g(t,Uη(t))=(t−1)2−η has zero residual at τ^=1+η. Thus ε=0 and ∣τ^−τ∣=η.

3.1F1F2step 1.1step 2.1algebra∎

If a fixed C gave the refuted root-location bound, it would require η≤Cη for every η>0, equivalently 1/η≤C. The left side is unbounded as η↓0, so no such constant exists. Here h′(1)=0, 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A bouncing-ball impact has a transverse event-time and reset-error bound

Example

Let q be height and v velocity, with mode field q′=v, v′=−2 before and after impacts, initial state (q(0),v(0))=(1,0), downward guard g(q,v)=q of orientation σ=−1, and time-independent reset R(q,v)=(0,−v/2). On the event bracket [1,51/50], use the approximate incoming reconstruction U(t)=(1−t2+1/25,−2t). It has uniform state error η=1/25 from the exact incoming solution y(t)=(1−t2,−2t). The reported guard root is τ^=26/25, and the exact impact time is τ=1. This example isolates the event-time and reset estimates; it does not claim that U 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.

[F1]

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.

[F2]

A transverse hybrid event time is stable under dense-output and root error: if the exact guard has signed derivative at least ν>0, the dense state error is at most η, and the reported guard residual is at most ε, then ∣τ^−τ∣≤(Lgη+ε)/ν.

[F3]

Reset and smooth-mode flow propagate a transverse event-time error: with incoming error η, event-time error Δ, reset constants LR,LR,t, and incoming/outgoing field bounds M−,M+, the aligned post-reset error is at most LRη+(LRM−+LR,t+M+)Δ.

Verification

1.1givenF1algebra

The exact incoming solution is y(t)=(1−t2,−2t), so its guard h(t)=1−t2 has the unique root τ=1 on the bracket. For t∈[1,51/50], −h′(t)=2t≥2, so the downward crossing is transverse with margin ν=2.

2.1givenstep 1.1algebra

The dense guard is 1−t2+1/25, whose root in the bracket is τ^=26/25 and whose residual there is ε=0. For x≥0, both sides are nonnegative and (1+x/2)2−(1+x)=x2/4≥0, so 1+x≤1+x/2. Taking x=1/25 gives 0≤τ^−τ≤1/50.

3.1givenF2step 1.1step 2.1algebra

On the bracket, ∥U(t)−y(t)∥2=1/25. Since g(q,v)=q, ∣g(q1,v1)−g(q2,v2)∣=∣q1−q2∣≤∥(q1,v1)−(q2,v2)∥2, so Lg=1; the reported guard residual is zero. Apply [F2] with ν=2 to obtain ∣τ^−τ∣≤(1/25)/2=1/50, agreeing with the explicit bound in step 2.1.

4.1givenF3step 1.1step 3.1algebra

The reset is defined on all of R2, is LR=1/2-Lipschitz in state, and has LR,t=0. On the incoming bracket, ∥U(t)−y(t)∥2=1/25 and ∥f−(t,y(t))∥2=4t2+4<3. Step 3.1 gives ∣τ^−τ∣≤1/50. The outgoing field (q,v)↦(v,−2) is globally 1-Lipschitz in state. The exact outgoing path through τ^ and the reported reset state lie in [−1/10,1/10]×[4/5,6/5], where the field norm is less than 3; by local existence and continuity both outgoing solutions remain in the bounded convex rectangle [−1/5,1/5]×[3/4,5/4] for a short common forward interval. Thus the reset and outgoing tube hypotheses of [F3] hold with M−=M+=3 and L+=1. By [F3], the aligned post-reset error is at most 12⋅125+(12⋅3+3)150=11/100.

5.1givenstep 2.1step 4.1algebra∎

Directly, the exact outgoing state at τ^=1+Δ is (Δ−Δ2,1−2Δ) and the reported reset state is (0,1+Δ). Their difference has components bounded by 1/50 and 3/50, so its Euclidean norm is at most (1/50)2+(3/50)2<11/100. This verifies the reset estimate for this instance.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Two guard crossings between endpoints defeat sign-only screening

Example

On [0,1], let an initial mode have x′=1 and one outgoing transition with time-dependent guard g(t,x)=(t−1/3)(t−2/3), positive crossing orientation, and reset R(t,x)=0 into a terminal mode with x′=0. The initial state is x(0)=0. The exact guard along the mode is h(t)=g(t,x(t)).

Facts & Assumptions

Given: The smooth-mode oriented-event convention and the safeguarded locator's complete root-isolation and direction-classification rule.

[F1]

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.

[F2]

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

1.1givenF1algebra

The incoming-mode continuation is x(t)=t, but the guard is independent of x, so h(t)=(t−1/3)(t−2/3). Its endpoint values are h(0)=h(1)=2/9>0. A rule that checks only endpoint signs therefore reports no crossing. The roots 1/3 and 2/3 are not dyadic, so neither lies on a midpoint boundary of the isolator's dyadic bisection of [0,1].

2.1givenF1step 1.1algebra

The two roots are 1/3 and 2/3, and h′(t)=2t−1. Thus h′(1/3)=−1/3 is a downward crossing while h′(2/3)=1/3 is an upward crossing. Under the declared positive orientation, the first root is nontriggering and the second is enabled.

3.1givenF1F2step 2.1∎

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 2/3 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