Interaction price

Switching on an interaction between field modes makes local quantities spread at a rate proportional to the coupling, and the corpus proves the rate is exact, at most twice the coupling times the elapsed time, and at least a fixed fraction of it.

proved in corpus · proved here, no imported axiomsLean price_linear_attained

In plain terms

A field can be thought of as a collection of modes, independent patterns of vibration, like the separate notes a string can sound, and a quantity is local if it concerns only a particular set of modes. When the modes don't interact, the dynamics keeps every local quantity confined to its own modes for ever, and interactions spread them, so a quantity that started out concerning one mode comes to depend on others as time passes.

That qualitative statement is folklore, and the quantitative question is the interesting one, which is at what rate an interaction buys this spreading, and whether the rate you can prove as an upper limit is also the rate that actually occurs.

The corpus answers with a sandwich. On one side there's an upper bound, as after one period of the interacting drive every local quantity stays within twice coupling- times-time of some exactly local quantity, where the distance between two quantities means the largest difference they could show on any state, so spreading is priced linearly in the coupling strength and the elapsed time. On the other side there's a lower bound on an explicit two-mode example, as a computable commutator, a quantity measuring how far two operations are from being interchangeable, forces every exactly local quantity to sit at least a comparable linear distance away.

Between the two bounds, "costs at most" becomes "costs exactly", up to a constant factor lying between one over pi and two.

In CSD

CSD's field track, the part of the programme that treats fields, uses the interaction price as its quantitative locality backbone. It feeds the interacting corrections to the propagator, the description of how disturbances travel through the field. It feeds the renormalised couplings, effective interaction strengths that don't depend on the cutoff, the artificial limit on resolution used to keep calculations finite. And it feeds the coarse-graining budget at the level of channels, where the whole error of a renormalisation step, a step that deliberately discards fine detail, is the interaction's price, because the free part of the dynamics is carried across exactly.

The lower bound matters because an upper bound on its own leaves open whether the price is ever actually paid. The explicit witness shows that it is, so the sharpness of the bound is a theorem rather than a hope.

Mathematically

The theorem price_linear_attained states that on the two-mode witness pair, and for tau lambda in the window from zero to pi (both bounds are hypotheses of the theorem and not decoration, since the sine is only monotone there), the distance from the interacting Heisenberg observable to the subalgebra supported on the free modes satisfies tau lambda / pi <= dist <= 2 tau lambda.

The lower bound runs through the commutator functional, as any operator supported on the free modes commutes with a disjoint probe, so one computed commutator bounds the distance to the whole subalgebra. The commutator entry has modulus 2 sin(tau lambda / 2) exactly, and the Jordan inequality converts the sine to the linear form. Historically the upper bound stood alone with its sharpness explicitly unclaimed, and the witness construction retired that caveat.

Related entries

Module
CsdLean4/CV/PriceAttainment.lean
On the site
The fourth primer page explains why gaining information costs isolation
New to this?
explainquantum is a beginners' course in quantum mechanics, which starts from scratch and needs no maths

Source links are pinned to a commit, so they do not drift. The anchors above are checked mechanically against the Lean tree on every build. The mathematics is not, and cannot be: that is a human responsibility and it rests with the author.

Part of Constraint-Surface Dynamics · Formalised in csd-lean4.

Privacy policy