Abstract
Ostrogradsky theorem states that Hamiltonian is unbounded when Euler-Lagrange equations are higher than second-order differential equations under the nondegeneracy assumption. Since higher-order nondegenerate Lagrangian can be always recast into an equivalent system with at most first-order derivatives by introducing auxiliary variables and constraints, it is conceivable that the link between ghost and higher derivatives may be reinterpreted as a link between ghost and constraints and/or auxiliary variables. We find that the latter point of view actually provides more general perspective than the former, by exploring the un/boundedness of the Hamiltonian for general theories containing auxiliary variables, for which Euler-Lagrange equations can be essentially second order or lower than that. For Lagrangians including auxiliary variables nonlinearly, we derive the degeneracy condition to evade the Ostrogradsky ghost that can apply even if auxiliary variables can be solved only locally. For theories with constraints with Lagrange multipliers, we establish criteria for inclusion of nonholonomic (velocity-dependent) constraints leading to the absence of local minimum of Hamiltonian. Our criteria include the Ostrogradsky theorem as a special case, and can detect not only ghost associated with higher-order derivatives, but also ghost coming from lower-order derivatives in system with constraints. We discuss how to evade such a ghost. We also provide various specific examples to highlight application and limitation of our general arguments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.