the geometric exegesis of the dirac algorithm
play

The geometric exegesis of the Dirac algorithm J. Fernando Barbero G. - PowerPoint PPT Presentation

The geometric exegesis of the Dirac algorithm J. Fernando Barbero G. Instituto de Estructura de la Materia, CSIC. Grupo de Teor as de Campos y F sica Estad stica Unidad Asociada CSIC-UC3M Jurekfest, Warszawa, September 17, 2019


  1. The geometric exegesis of the Dirac algorithm J. Fernando Barbero G. Instituto de Estructura de la Materia, CSIC. Grupo de Teor´ ıas de Campos y F´ ısica Estad´ ıstica Unidad Asociada CSIC-UC3M Jurekfest, Warszawa, September 17, 2019 J. Fernando Barbero G. (IEM-CSIC) 1 / 33 geometric exegesis Dirac Jurekfest 2019

  2. Motivation back Extend the use of Hamiltonian methods to field theories in bounded regions . No obstructions in principle but problematic in practice. The computation of Poisson brackets when boundaries are present is not trivial. At some point functional-analytic issues become relevant. Can we somehow avoid these problems? Yes, but to this end the standard approach must be suitably (subtly?) modified. A geometric reinterpretation of the usual method helps exegesis: critical interpretation of a text, particularly a sacred text J. Fernando Barbero G. (IEM-CSIC) 2 / 33 geometric exegesis Dirac Jurekfest 2019

  3. The Book of constrained Hamiltonian systems back J. Fernando Barbero G. (IEM-CSIC) 3 / 33 geometric exegesis Dirac Jurekfest 2019

  4. Singular Hamiltonian systems: the Dirac “algorithm” back The Dirac algorithm in words Write the canonical momenta p in terms of q and ˙ q . Find the primary constraints , i.e. relations φ m ( q , p ) = 0 between q and p originating in the “impossibility to solve for all the velocities” in terms of positions and momenta. Find a Hamiltonian H and build the total Hamiltonian H T = H + � u m φ m in which the primary constraints are introduced together with some multipliers u m ( t ). The u m must be fixed by enforcing the consistency of the time evo- lution of the system. This consistency requires, for instance, that the primary constraints be preserved in time : { φ m , H } + u n { φ m , φ n } ≈ 0 The weak equality symbol ≈ means that the previous identity must hold when the primary constraints are enforced. J. Fernando Barbero G. (IEM-CSIC) 4 / 33 geometric exegesis Dirac Jurekfest 2019

  5. Singular Hamiltonian systems: the Dirac algorithm back The Dirac algorithm in words (continued) Several possibilities: The consistency conditions may be impossible to fulfill . This means 1 that our starting point (the Lagrangian) makes no sense. The consistency conditions may be trivial, i.e. identically satisfied once 2 the primary constraints are enforced. The u m may not appear in the consistency conditions. In this case we 3 have secondary constraints . The consistency conditions can be solved for the u m . 4 If we find secondary constraints their “ stability under time evolution” must be enforced , exactly as we did for the primary constraints. Ho- wever we do not have to modify the total Hamiltonian (i.e. we do not have to include them in a new, “more total” Hamiltonian). J. Fernando Barbero G. (IEM-CSIC) 5 / 33 geometric exegesis Dirac Jurekfest 2019

  6. Singular Hamiltonian systems: the Dirac algorithm back The Dirac algorithm in words (continued) Let us look with some care at the equations { φ j , H } + u n { φ j , φ n } ≈ 0 These are linear , inhomogeneous equations for the unknowns u n . As such, the inhomogeneous term will be subject, generically, to conditions necessary to guarantee solvability. These are the secondary constraints . Their number is determined by the rank of the matrix { φ j , φ n } (beware of bifurcation !). Once solvability is guaranteed we can find the u n (as functions of the generalized coordinates and momenta) and, maybe, arbitrary parameters. u m = U m ( q , p ) + v a ( t ) V am ( q , p ) , where V an { φ j , φ n } = 0 and the v a ( t ) are arbitrary functions of time. J. Fernando Barbero G. (IEM-CSIC) 6 / 33 geometric exegesis Dirac Jurekfest 2019

  7. Singular Hamiltonian systems: the Dirac algorithm back The Hamiltonian ˆ H = H + ( U m ( q , p ) + v a ( t ) V am ( q , p )) φ m defines con- sistent dynamics equivalent to the one given by the singular Lagrangian used to define our system for initial data for ( q , p ) satisfying all the constraints (primary and secondary). Comments on the Dirac algorithm Its logic is difficult to follow at times. For instance, sentences such as The Poisson bracket [ g , u m ] is not defined, but it is multiplied by something that vanishes, φ m . So the first term of (1-18) vanishes. (P.A.M. Dirac, LQM) sound strange. It is not so straightforward to extended it to field theories. This notwithstanding, the algorithm works well if followed to the letter! (and if the results are correctly interpreted). J. Fernando Barbero G. (IEM-CSIC) 7 / 33 geometric exegesis Dirac Jurekfest 2019

  8. Scalar field with Dirichlet boundary conditions back � 1 � t 2 � 1 � ϕ 2 − ϕ ′ 2 ) − ψ 0 � � � � S [ ϕ, ψ 0 , ψ 1 ] = d t d x ( ˙ ϕ (0) − ϕ 0 + ψ 1 ϕ (1) − ϕ 1 2 t 1 0 The configuration variables are ϕ ( x ), ψ 0 and ψ 1 . ψ 0 and ψ 1 are Lagrange multipliers introduced to enforce the boundary conditions ϕ (0) = ϕ 0 and ϕ (1) = ϕ 1 . ϕ 0 , ϕ 1 ∈ R , (boundary values of ϕ ). ϕ ∈ C 2 (0 , 1) ∩ C 1 [0 , 1] (smooth enough). Do we get the right field equations? We should better check... J. Fernando Barbero G. (IEM-CSIC) 8 / 33 geometric exegesis Dirac Jurekfest 2019

  9. Scalar field with Dirichlet boundary conditions back Field equations: variations of the action � t 2 �� 1 � � � 1 ϕ ( x ) + ϕ ′′ ( x )) δϕ ( x ) − ϕ ′ ( x ) δϕ ( x ) δ S = d t d x ( − ¨ 0 t 1 0 � t 2 � t 2 − d t ( ϕ (0) − ϕ 0 ) δψ 0 + d t ( ϕ (1) − ϕ 1 ) δψ 1 t 1 t 1 � t 2 � t 2 − d t ψ 0 δϕ (0) + d t ψ 1 δϕ (1) t 1 t 1 ϕ ( x ) − ϕ ′′ ( x ) = 0 , ¨ x ∈ (0 , 1) ϕ (0) = ϕ 0 � ϕ (1) = ϕ 1 ψ 1 − ϕ ′ (1) = 0 ψ 0 − ϕ ′ (0) = 0 J. Fernando Barbero G. (IEM-CSIC) 9 / 33 geometric exegesis Dirac Jurekfest 2019

  10. Scalar field with Dirichlet boundary conditions back Canonical momenta : δ L ϕ ( x ) , p 0 := ∂ L = 0 , p 1 := ∂ L π ( x ) := ϕ ( x ) = ˙ = 0 ∂ ˙ ∂ ˙ δ ˙ ψ 0 ψ 1 Primary constraints p 0 = 0 and p 1 = 0. Non-zero Poisson brackets { ϕ ( x ) , π ( y ) } = δ ( x , y ) , { ψ 0 , p 0 } = 1 , { ψ 1 , p 1 } = 1 Total hamiltonian � 1 + u 0 p 0 + u 1 p 1 + 1 � � � � � π 2 + ϕ ′ 2 � H T = ψ 0 ϕ (0) − ϕ 0 − ψ 1 ϕ (1) − ϕ 1 d x . 2 0 Here u 0 and u 1 are the Lagrange multipliers that enforce the primary constraints in the Dirac algorithm. Before going further just a short question... J. Fernando Barbero G. (IEM-CSIC) 10 / 33 geometric exegesis Dirac Jurekfest 2019

  11. Scalar field with Dirichlet boundary conditions back What is the value of { ϕ (0) , π (0) } ?, Is it 1 ?, Is it δ (0 , 0) ? This is not an academic question Secondary constraints (at x = 0, analogously at x = 1) { H T , p 0 } = ϕ (0) − ϕ 0 = 0 ( OK ) � 1 { H T , ϕ (0) − ϕ 0 } = d x π ( x ) { π ( x ) , ϕ (0) } = − π (0) = 0 ( uhm ... ) � �� � 0 − δ ( x , 0) � 1 d x ϕ ′ ( x ) { ϕ ′ ( x ) , π (0) } { H T , π (0) } = { ϕ (0) , π (0) } ψ 0 + 0 � � 1 { ϕ (0) , π (0) } ψ 0 + ϕ ′ ( x ) { ϕ ( x ) , π (0) } = 0 � 1 d x ϕ ′′ ( x ) { ϕ ( x ) , π (0) } − (???) 0 The algorithm crashes . One has to be careful... J. Fernando Barbero G. (IEM-CSIC) 11 / 33 geometric exegesis Dirac Jurekfest 2019

  12. Geometric interpretation of the Dirac algorithm back J. Fernando Barbero G. (IEM-CSIC) 12 / 33 geometric exegesis Dirac Jurekfest 2019

  13. Singular Hamiltonian systems: the Dirac algorithm back The geometric exegesis of the Dirac algorithm, preliminaries. The goal is to find a Hamiltonian H defined on the whole phase space such that the integral curves of the Hamiltonian vector field X H describe the dynamics of the system for allowed initial data . This is important to implement the quantization programme ` a la Dirac . The dynamics must take place on the primary constraint submanifold of the phase space given by FL ( TQ ) (the image of the fiber derivative defining the momenta). The Hamiltonian vector field, when restricted to the submanifold where the dynamics takes place, must be tangent to it (otherwise the integral curves would fail to remain there!) The gist of Dirac’s algorithm is this tangency condition J. Fernando Barbero G. (IEM-CSIC) 13 / 33 geometric exegesis Dirac Jurekfest 2019

  14. Singular Hamiltonian systems: the Dirac algorithm back The geometric exegesis of the Dirac algorithm (continued). The starting point is the identification of the primary constraints φ n . These are found by computing the fiber derivative (definition of mo- menta) FL : TQ → T ∗ Q From the energy E we get the Hamiltonian from H ◦ FL = E (a real fun- ction in T ∗ Q which is uniquely defined only on the primary constraint submanifold M 0 := FL ( TQ ), given by constraints φ n = 0). Find the vector fields X satisfying ı X Ω − d H − u n d φ n = 0 and require also φ n ( q , p ) = 0 . J. Fernando Barbero G. (IEM-CSIC) 14 / 33 geometric exegesis Dirac Jurekfest 2019

Recommend


More recommend