A Local Resolution of the Problem of Time. VII. Constraint Closure
Abstract
We now set up Constraint Closure in a manner consistent with Temporal and Configurational Relationalism. This requires modifying the Dirac Algorithm - which addresses the Constraint Closure Problem facet of the Problem of Time piecemeal - to the TRi-Dirac Algorithm. This is a member of the wider class of Dirac-type algorithms that enjoys the property of being Temporal Relationalism implementing (TRi). Constraint algebraic structures ensue. We include examples of types of constraint, outcomes of the Dirac Algorithm and different kinds of Constraint Closure Problems. Enough new Principles of Dynamics is required to support this venture that an Appendix on it is provided: differential Hamiltonians, anti-Routhians, and the brackets, state spaces and morphisms corresponding to these.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.