Infinitesimal Canonical Transformations
Write down the canonical transformation to action-angle variables for a pendulum and you get elliptic functions sprawling across half a page. Write down the transformation that advances the solar system by a million years and you cannot — no closed form exists. Finite canonical transformations are, in general, monstrously complicated objects. And yet the theory tames every one of them with a single move: stop trying to write the finished map and write its derivative at the identity instead. A transformation that moves each phase point only infinitesimally — , — turns out to be completely controlled by one ordinary scalar function on phase space. Not a matrix, not a pair of functions: one scalar, from which both displacement fields follow by differentiation. That compression is the pivot on which the whole canonical formalism turns. Feed the machinery and it slides the system through space; feed it and it rotates positions and momenta together; feed it and — this is the astonishing one — it advances the system through time, with Hamilton's equations falling out as the displacement formulas. Symmetries, conservation laws, Liouville's theorem, and eventually the unitary operators of quantum mechanics are all downstream of the small step you build here. This page owns the -machinery itself: where the displacement formulas come from (a Type-2 generating function one whisker away from the identity), why the map is canonical to first order (a symmetric Hessian meeting an antisymmetric ), and what a single truncated step can and cannot do. The finite flows those steps compose into are the business of Generators of Continuous Transformations.
- An infinitesimal canonical transformation (ICT) is a canonical map one small step from the identity: , , controlled entirely by one scalar generator .
- It descends from the Type-2 generating function — the identity plus an -sized correction — so canonicity is inherited, not imposed.
- Compactly, : the step is the gradient of rotated a quarter-turn by the symplectic matrix, so the flow slides along level curves of , never across them.
- Any observable responds by — the Poisson bracket is the infinitesimal action of the transformation.
- The Jacobian is ; because the Hessian is symmetric, and ): canonical to first order, exactly canonical only after integrating the flow.
- Quick dictionary (deep dives elsewhere): translates, rotates, advances time.
- Key idea: every canonical transformation near the identity is , — equivalently — one scalar generator per infinitesimal map.
Every canonical transformation near the identity is generated by a single scalar : , , equivalently — and the map is canonical to first order because a symmetric Hessian cannot survive contact with the antisymmetric .
Where this lives today
Every serious long-time simulation of a Hamiltonian system now runs on machinery this page built. Symplectic integrators — the workhorses of solar-system ephemerides, particle-accelerator tracking, and molecular dynamics — are nothing but cleverly composed generated steps: each substep is an exactly canonical map produced by a generating function (kick from the potential, drift from the kinetic term), so the composed step has determinant exactly 1 and inherits the bounded-energy behavior of worked example 2 over billions of steps. JPL's long-horizon planetary integrations and LHC beam-tracking codes both live or die on that distinction between and . The newest arrivals speak the same dialect: Hamiltonian neural networks and learned symplectic maps parametrize an unknown dynamics not by fitting the flow directly but by fitting a scalar — a learned generator — and pushing states with steps or exact generating-function layers, so that the learned model conserves phase-space volume by architecture rather than by training luck. One scalar controlling a canonical flow turned out to be a compression scheme good enough for machine learning to rediscover it.
The physical picture
Picture as a landscape over phase space — a surface of hills and valleys plotted above the plane. A naive guess for "the transformation generates" would push points uphill, along the gradient . The canonical prescription does something stranger and better: it rotates the gradient by ninety degrees before using it. The step is , and the quarter-turn sends "across the contours" into "along the contours." Every phase point drifts sideways along a level curve of , like weather systems circulating along isobars instead of blowing straight into the low.
The sideways drift explains, in one picture, why the generator is conserved by its own flow ( never changes along its own contours — the geometric face of ), and why the flow squeezes nothing (a divergence-free velocity field carries phase-space area rigidly — Liouville's theorem in embryo, developed fully in Liouville's Theorem and Phase-Space Volume). The second thing to internalize is where canonicity comes from. An ICT is not a small map that happens to pass a test; it is manufactured canonical. Take the Type-2 generating function of the identity transformation, — the "do nothing" map of Type-2 Generating Function F2(q,P,t) — and add the smallest possible perturbation, . Because any produces a canonical transformation, the near-identity map inherits canonicity from its birth certificate. The only work left is bookkeeping: expanding the implicit Type-2 relations to first order in (Derivation A).
Finally, hold on to what an ICT is not: it is not a finite transformation, and truncating at first order costs something real. One step of size is canonical only up to debris; the worked examples below measure that debris on real numbers. Chaining infinitely many shrinking steps into an exactly canonical finite flow is precisely the exponentiation story of Generators of Continuous Transformations.
The displacement formulas
Everything follows from asking: what is the most general canonical map one whisker from the identity? Write the answer with a small parameter carrying the smallness, and a function carrying the shape:
where: — the generator, an ordinary scalar function on phase space; — the infinitesimal parameter (an angle, a length, a time... whatever the family is parametrized by); , — evaluated at the old point. Read the structure: coordinates move according to how leans on the momenta, momenta move (with a minus sign) according to how leans on the coordinates. That criss-cross with one sign flip is the symplectic twist — the same pattern as Hamilton's equations, and not by coincidence. Stacking into the phase-space column and using the symplectic matrix compresses both formulas into one:
where: — the -gradient of ; — the quarter-turn of Symplectic Condition fame, , . This is the hero-diagram statement: gradient in, quarter-turned step out. Special case worth one glance: a point transformation deforming only coordinates needs linear in ; anything with -curvature shears momenta too. The single most useful consequence: any observable — energy, angular momentum, a correlation you invented yesterday — responds to the step through one bracket,
where: — the Poisson bracket in the convention of Poisson Brackets: Definition (). Equation (3) is the active reading: the state moves, and 's value at the moved state differs by . It says the Poisson bracket is not merely a clever pairing — it is the infinitesimal action of one observable on all the others. Set or and (3) collapses back to (1) via the fundamental brackets of Fundamental Poisson Brackets. The birth certificate of (1) is the near-identity Type-2 generating function
where: — the identity transformation's generating function; — the perturbation, written in the mixed arguments that Type-2 functions use. To first order the mixed arguments are a distinction without a difference — that bookkeeping is Step 4 of Derivation A, and skipping it carelessly is a classic exam wound.
We are deriving equation (1) — the claim that one scalar generates the most general infinitesimal canonical transformation — from the Type-2 machinery, which guarantees canonicity from the start. The strategy: write as identity-plus- as in (4), apply the standard Type-2 relations and , and expand to first order. The one subtlety to watch is the argument of : the Type-2 relations naturally produce , and converting inside a term already multiplied by must be justified, not waved at.
Step 1. The momentum relation. Differentiating (4) with respect to :
Solving for the new momentum: , so with 's derivative still evaluated at .
Step 2. The coordinate relation. Differentiating (4) with respect to :
so . The identity block contributed and ; every displacement is the block's doing.
Step 3. The sign asymmetry is already locked in. The plus on and minus on came from which variable each Type-2 relation is solved for — no choice was made; the symplectic structure of the formalism dictated it.
Step 4. Clean up the arguments. In Steps 1–2 the derivatives of are taken at , but , so by Taylor's theorem
and the correction enters the displacement at — below the order we keep. Both displacements may therefore be evaluated with as a function of the old variables, giving (1) exactly as stated. Why this argument-swap is safe here and dangerous later: the substitution costs per step. For a single infinitesimal step that is negligible by definition; but if you chain steps to build a finite map, the accumulated cost is only because in the limit — the finite flow is exact, any finite truncation is not. *Quick check: setting gives , — a rigid translation, as it must.*
Canonical to first order: the Hessian meets J
How canonical is the truncated map (1), taken at face value as a small-but-finite step? Compute its Jacobian. Differentiating (1) with respect to the old variables packs neatly into
where: — the Hessian of , symmetric by equality of mixed partials; — the identity. Everything now rides on one algebraic collision: a symmetric sandwiched with the antisymmetric .
Go deeper · Derivation B · 1 minFirst-order symplecticity from the symmetry of the Hessian
We are verifying that the map (1) satisfies the symplectic condition to first order — — and locating exactly which property of makes it work. The strategy is direct: insert into the symplectic sandwich and watch the first-order terms. The punchline is that they cancel because the Hessian is symmetric — smoothness of is the entire mechanism; no condition on is needed.
Step 1. Expand the sandwich, keeping first order:
Step 2. Use the two structural facts: (mixed partials commute) and . The second term becomes , and
Why symmetric-times-antisymmetric is the crux: had any antisymmetric part, that part would survive the cancellation and break canonicity at first order. But Hessians of smooth scalars have no antisymmetric part — which is why an arbitrary smooth generates a canonical step, and why a general small map with not of the form does not.
Step 3. Volume, as a corollary. , and for the same reason (the trace of an antisymmetric-times-symmetric product vanishes: ). Phase-space volume is preserved to first order — the ICT seed of Liouville's theorem, grown to full strength in Liouville's Theorem and Phase-Space Volume.
Step 4. Read the honestly. The quadratic term does not cancel in general: a single step of finite size is genuinely non-canonical at second order. Worked example 2 puts a number on this — the truncated map's determinant is , visibly bigger than 1. Quick check: , and the trace identity can be confirmed directly from the antisymmetry argument above.
The same first-order statement in bracket language — often the fastest route in practice — is the direct check that the new variables keep the fundamental brackets: , with the terms cancelling between and its mirror. That computation, and its promotion to a full test for finite maps, is the machinery of Poisson Brackets as a Test for Canonicity.
Go deeper · Derivation C · 1 minThe response of an arbitrary observable
We are deriving equation (3), — the statement that promotes the ICT from a rule about coordinates to a rule about everything. The strategy is a first-order Taylor expansion of under the displacements (1), which reassembles itself into a Poisson bracket. The payoff is the active/passive dictionary at the end: one formula, two legitimate readings.
Step 1. Taylor-expand at the displaced point:
Step 2. Insert the displacement formulas (1):
Step 3. Recognize the Poisson bracket:
Why the slot order matters: with the standard convention, the flow of acts on as — generator in the second slot. Writing flips the sign and runs the transformation backwards. When importing formulas from another text, check its against its before trusting a single sign.
Step 4. The two readings. Active: the point moves, 's recipe stays; is the change in reading at the displaced state — this is (3). Passive: relabel coordinates and re-express in the new chart; the numerical change of the functional form is , opposite in sign. The formulas are consistent — a point pushed forward looks, from the new chart, like a chart pulled backward — but mixing the two mid-calculation manufactures sign errors that are miserable to trace. Quick check: setting gives — the generator is invariant under its own flow, matching the level-curve picture.
Limiting cases
| Case | Result | Meaning |
|---|---|---|
| , all else 0 | rigid spatial translation; deep dive in Momentum and Angular Momentum as Generators | |
| , , momenta likewise | infinitesimal rotation of positions and momenta about | |
| , | , | one tick of time evolution — Hamilton's equations as an ICT; the full story is Hamiltonian as Generator of Time Evolution |
| the identity; generators matter only up to additive constants | ||
| linear in | independent of | point transformations (coordinate changes) sit inside the ICT family |
| with fixed | exactly canonical finite map | the exponentiation limit — handed off to Generators of Continuous Transformations |
Worked examples
1 · Rotating a phase point by a centimeter of angle (confidence builder)
Apply the ICT generated by with rad to the phase point (SI units). Compare with the exact rotation and measure the first-order error.
Step 1. Displacements from (1), using the brackets , , , (each verified by explicit partials of ): , , , .
Step 2. ICT image: . Note momenta rotate too — the ICT turns the whole phase-space vector, not just the configuration.
Step 3. Exact rotation by rad: , , so , , , .
Step 4. Errors: , — both of size , i.e. exactly as advertised, about 50 parts per million of the coordinates for a 0.57° turn.
Step 5. Invariants. before: ; after the ICT: — drift , second order (the exact rotation preserves identically; the truncated step does so only to first order). Likewise : , again a pure artifact. The lesson in numbers: first-order canonical means first-order faithful — and measurably no better.
2 · One time-step of an oscillator: truncated step versus generated step (exam level)
A harmonic oscillator has kg, , so (joules with in m, in kg m/s). Starting at , take one step s using (a) the truncated ICT with , (b) the exact flow, (c) the untruncated -generated map. Compare canonicity and energy.
Step 1. Truncated ICT (this is the explicit-Euler map): m, kg m/s.
Step 2. Exact flow for comparison: m, kg m/s. Errors: (first order in ), . First-order accurate, as an ICT must be.
Step 3. Canonicity of the truncated step. Its Jacobian is with , i.e. rows and : . Four percent volume inflation per step — second-order small, but fatally compounding: energy after the step is J against J, a drift matching exactly (for this quadratic the inflation lands squarely on the energy).
Step 4. The untruncated generated map. Keep without the argument swap: the Type-2 relations give first (implicit relation solved), then m. This is the symplectic-Euler integrator. Its Jacobian has rows and : , exactly, at any step size.
Step 5. Read the comparison. Both maps are first-order accurate ( after the symplectic step is J — also off by ~4% instantaneously). The difference is structural: the truncated map dilates phase area by per step and its energy error grows without bound, while the generated map is exactly area-preserving and its energy error stays bounded forever, oscillating about the truth (it exactly conserves a nearby "shadow" Hamiltonian — the theme picked up on the discussion board of Poisson-Bracket Formulation of Dynamics). Same order of accuracy, opposite fates — canonicity, not accuracy, is what the construction buys.
Origins · 1 minSophus Lie and how this was discovered
Lie came to infinitesimal transformations from a geometer's frustration: Galois had classified algebraic equations by their discrete symmetry groups, and Lie wanted the same weapon for differential equations, whose symmetries are continuous. His insight — developed in an astonishing burst between 1869 and 1873, partly in Paris conversations with Felix Klein, partly while briefly jailed in Fontainebleau as a suspected spy carrying "coded" mathematical notes — was that a continuous group is completely controlled by its behavior infinitesimally close to the identity, where it linearizes into what we now call a Lie algebra. The composition law of the group collapses into brackets of generators; the intractable global object becomes tractable local algebra. Hamiltonian mechanics turned out to be the perfect host: Lie himself showed that canonical transformations form exactly such a continuous group, with phase-space functions as generators and the Poisson bracket as the algebra — the "function groups" of his 1888–1893 Theorie der Transformationsgruppen. He did not live to see the payoff: the quantum mechanics built in 1925–26 speaks Lie's language in every line, from to the classification of particles by group representations. The near-identity step of this page is Lie theory in its natural habitat.
Going further
References. Goldstein, Poole & Safko, Classical Mechanics, 3rd ed., §9.4–9.6 · Landau & Lifshitz, Mechanics, 3rd ed., §40–45 · Morin, Introduction to Classical Mechanics, Ch. 15 (Hamiltonian methods) · Taylor, Classical Mechanics, Ch. 13 · Arnold, Mathematical Methods of Classical Mechanics, §40 (Hamiltonian phase flow) Key identities worth confirming directly: re-expanding yields , ; the bracket relations and follow; the fundamental brackets and hold; and underpins Liouville's theorem to first order. No empirical constants appear. The numeric examples use the rotation of by rad and the oscillator step comparison at , , .
Builds on: Definition of Canonical Transformations · Type-2 Generating Function F2(q,P,t) · Poisson Brackets: Definition · Symplectic Condition Leads to: Poisson-Bracket Formulation of Dynamics · Symplectic Group and Phase-Space Geometry · Algebra of Poisson Brackets · Poisson Brackets as a Test for Canonicity
Is epsilon a time? What exactly is it a small amount of?
Epsilon is a small amount of whatever parametrizes the family of transformations — it has no fixed identity of its own. For it is an angle in radians; for a length in meters; for a time in seconds. Dimensional bookkeeping enforces this: must carry the dimensions of a generating function (action), so always carries action divided by — which is automatically the natural parameter of the flow generates. The habit worth building: when you meet a new generator, first work out what its measures; the physics of the transformation is usually legible from that alone.
Why does the momentum displacement get the minus sign and not the coordinate one?
Because of which variable each Type-2 relation is solved for — there is genuinely no convention left to choose once the formalism is fixed. The relation produces , which must be solved for the new , flipping the sign; the relation hands over directly, keeping the plus. Geometrically the asymmetry is the antisymmetry of : the quarter-turn maps , one component sign-flipped. If both signs were positive the step would be a gradient flow, would change along it, and nothing would be conserved — the minus sign is where all the conservation physics hides.
In Derivation A, why are we allowed to swap the new P for the old p inside the derivative of G?
Because the swap happens inside a term already multiplied by . Taylor-expanding about gives plus a remainder proportional to ; multiplied by the overall , the remainder lands at , below first order. What students trip on is applying the same logic to finite maps: there the swap is not free, and the difference between and is exactly what separates the exactly-canonical symplectic-Euler map from the merely first-order-canonical explicit-Euler map in worked example 2. The swap is a first-order license, not a general permission.
What is the difference between the generator G and the generating function F2?
They live on different argument spaces and different scales. is a function of mixed old-new variables that defines a finite canonical transformation implicitly through its partial derivatives; is an ordinary phase-space function that defines an infinitesimal transformation explicitly through brackets. The relation is : the generator is the first-order coefficient of the generating function's deviation from the identity. In the finite-flow limit the two reconnect — Hamilton's principal function is the whose "infinitesimal part" is — which is the road to Hamiltonian as Generator of Time Evolution and, further along, Hamilton–Jacobi theory.
Does the active versus passive distinction actually change any computed number?
It changes signs, which is worse than changing numbers — the error survives dimensional analysis. Active: the state moves, observables' recipes stay; . Passive: states stay, the chart moves; the functional form of in the new chart shifts by . Both are correct, self-consistent descriptions of the same geometry. The classic failure mode is computing a rotation actively for coordinates and passively for momenta, which quietly rotates the two halves of phase space in opposite directions and destroys canonicity on paper while every individual line looks fine. Pick the active convention (this page's) and translate other sources' formulas before use.
Can the generator depend explicitly on time, and what changes if it does?
Yes — nothing in the construction of the displacement formulas requires ; the derivation goes through at each frozen instant, with a spectator inside . What changes is the conservation story: an explicitly time-dependent generator can be conserved only through cancellation between and — the Galilean boost is the canonical example, conserved for a free particle even though neither term vanishes alone. The boost's flow (at frozen ) is a perfectly good ICT: it shifts by and by . The full clocked-invariant story lives in Constants of Motion via Poisson Brackets.
If one epsilon step is only first-order canonical, how can the composition of many be exactly canonical?
Because the defect per step shrinks faster than the number of steps grows. Each step of size carries an canonicity defect; composing of them accumulates at most , which vanishes as . The limit — the integrated flow — is therefore exactly canonical even though every finite truncation is not. This is the same mechanism as compound interest, and it is why the exponential map of Generators of Continuous Transformations produces exact symplectomorphisms out of approximate ingredients.
Is every canonical transformation close to the identity an ICT of the form given here — could some small map need a different structure?
To first order, yes, the form is exhaustive — that is what makes the result powerful. Any smooth one-parameter family of canonical maps starting at the identity has, at first order, a displacement field ; the symplectic condition forces to have a symmetric Jacobian, which (on any simply-connected region, by the Poincaré lemma) makes a gradient: for some scalar . So "one scalar generates it" is a theorem, not a convenient ansatz. The fine print: on topologically nontrivial phase spaces may exist only locally — the displacement field is always locally generated but occasionally refuses to be one global function.