Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

First-impact step for a one-dimensional unilateral contact

Definition

Input a gap q≥0, velocity v∈R, constant acceleration a∈R, step horizon h>0, mass m>0, restitution e∈[0,1], and a candidate-root budget B∈N. Use exact real arithmetic and comparisons. Define g(s)=q+sv+12as2 and w(s)=v+as on [0,h]. Return impact, free-flight, or unresolved by these instructions.

  • If q=0 and v<0, return impact at s=0 with contact gap 0, v−=v, J=−m(1+e)v−, and v+=−ev−.
  • Otherwise form the complete candidate set R of real roots of g. If q=v=a=0, set R=∅. If a=0 and v≠0, set R={−q/v}. If a=0, v=0, and q>0, set R=∅. If a≠0, put D=v2−2aq: for D<0 set R=∅; for D=0 set R={−v/a}; and for D>0 set R={(−v−D)/a,(−v+D)/a}, with duplicate values removed. If ∣R∣>B, return unresolved. From R, retain exactly the values s satisfying 0<s≤h and w(s)<0, and order them increasingly.
  • If the retained list is nonempty, take its least value s, set v−=w(s), J=−m(1+e)v−, and v+=−ev−, and return impact with time s, contact gap 0, impulse J, and post-impact velocity v+.
  • If the retained list is empty, compute the minimum of g on [0,h] by evaluating its two endpoints and, when a>0 and −v/a∈(0,h), its vertex −v/a. If this minimum is negative, return unresolved; otherwise return free-flight with endpoint (g(h),w(h)) and impulse 0.

The candidate set contains every root of the nonzero polynomial g, so the retained list is complete. The vertex check certifies nonpenetration over the whole step, including a grazing zero. The procedure stops after this first event and returns at the event time; it does not integrate the post-impact mode, sustained contact, or repeated impacts. A numerical implementation that cannot certify an exact comparison returns unresolved.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources