Alphabeta Math
DefinitionDefinition: 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.

Regular minimum-energy paths on a declared collision-free tube

Definition

Let d≥2, let Cbad⊆Rd be the model's prescribed set of forbidden configurations, and let U⊆Rd∖Cbad be open. Call U a declared collision-free tube when it is the supplied open domain on which the potential is defined; no physical interpretation of the choice of U is implied. Let V∈C4(U,R), using the Ck convention of Ck maps and multi-index derivative notation in Euclidean space, and let a,b∈U. A regular path with fixed endpoints is R∈C1([0,1],U;Rd) such that R(0)=a, R(1)=b, and R′(s)≠0 for every s∈[0,1] (with one-sided derivatives at the endpoints). Its unit tangent and normal projector are

t(s):=R′(s)∥R′(s)∥2,Pt(s)⊥:=I−t(s)t(s)T.

The path is a regular minimum-energy path (MEP) when

Pt(s)⊥∇V(R(s))=0(0≤s≤1),

where ∇V is the gradient in The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. Thus the gradient is tangent to the path; at points where it vanishes the equation still holds. The endpoints are fixed data and need not be local minima unless that is added as a hypothesis. This is a conditional mathematical definition and makes no claim about reaction rates, physical mechanisms, or uniqueness.

Depends on

Used by

Dependency tree · two levels

9 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