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.

Finite-budget dimer rotation and saddle translation

Definition

Let U,V be as in Regular minimum-energy paths on a declared collision-free tube. Inputs: x0∈U, a unit vector v0, finite-difference distance ϵ>0, force-evaluation error bound η≥0, rotation step α>0, rotation tolerance τrot≥0, force tolerance τF≥0, rotation cap J∈N0, translation step σ>0, and translation cap K∈N0. Return the last point, direction, reported residuals, a termination status from force-tolerance, rotation-cap, translation-cap, geometry-failure, rotation-failure, or nonfinite-evaluation, and mode_status=mode-unverified.

Initialize the translation-update counter k=0, the current point x=x0, and the current unit direction v=v0. At each translation iteration, start with the current v, set the rotation-update counter j=0, and repeat the following residual test and possible update:

  1. If x±ϵv∉U, return geometry-failure. Evaluate approximate gradients g^± at x±ϵv with the declared error bound, and form Dϵ=(g^+−g^−)/(2ϵ). Nonfinite data return nonfinite-evaluation.
  2. Set rrot=∥(I−vvT)Dϵ∥2. If rrot≤τrot, end this rotation loop. If the test fails and j=J, return rotation-cap with the last direction. Otherwise set w=v−α(I−vvT)Dϵ. If w=0, return rotation-failure; else replace v by w/∥w∥2, set j←j+1, and repeat the rotation test.

Thus J counts direction updates, and the current direction is tested before the cap is returned, including when J=0. A small rotational residual by itself does not certify that the direction is the lowest eigenmode. This procedure does not take or validate a spectral-gap or mode-tracking certificate, so it always returns mode_status=mode-unverified.

After a rotation residual passes, evaluate g^(x) with error at most η. If it is nonfinite, return nonfinite-evaluation. If ∥g^(x)∥2≤τF, return force-tolerance together with the mode status. If k=K, return translation-cap together with the mode status; perform an update only when k<K.

x+=x+σ[−g^(x)+2(g^(x)Tv)v].

If x+∉U, return geometry-failure; otherwise set x←x+, set k←k+1, and begin the next translation iteration. Thus K counts translation updates; the force-tolerance test is made before the cap test, including when K=0. mode_status=mode-unverified is metadata about the direction, not a termination status. This finite procedure makes no arbitrary-start, termination, saddle-convergence, or global-transition claim.

Depends on

Used by

Dependency tree · two levels

10 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