Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Equivalence of Euler–Lagrange and Hamilton equations for hyperregular Lagrangians

Statement

Assume ACω. Let L:TQR be hyperregular and H=EL(FL)1. The Legendre map bijects Euler–Lagrange trajectories (q,q˙) with Hamiltonian trajectories (q,p) of H.

Facts & Assumptions

Given: A hyperregular L and its associated H.

[F1]

Euler–Lagrange equations are ddtLvi=Lqi. Euler–Lagrange equations.

[F2]

With p=Lv and inverse v(q,p), H(q,p)=piviL(q,v). Energy and Hamiltonian of a hyperregular Lagrangian.

[F3]

Hamilton's equations are q˙i=Hpi and p˙i=Hqi. Hamilton equations in canonical cotangent coordinates.

Proof

technique · direct
1.1

Differentiate the formula in [F2]. Since pi=Lvi(q,v), the pidvi and Lvidvi terms cancel, giving dH=vidpiLqidqi. Hence Hpi=vi and Hqi=Lqi.

F2algebra
2.1

If q(t) satisfies [F1] and p(t)=Lv(q(t),q˙(t)), then step 1.1 gives q˙i=vi=Hpi and p˙i=ddtLvi=Lqi=Hqi. Thus (q,p) satisfies [F3].

F1F3step 1.1
3.1

Conversely, a Hamiltonian trajectory satisfies q˙=v(q,p) by [F3] and step 1.1, so inverse Legendre gives p=Lv(q,q˙). Its second Hamilton equation then reads ddtLvi=Lqi, which is [F1]. Hyperregularity makes both assignments global inverses.

F1F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

14 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