Documentation

CsdLean4.CV.PriceAttainment

P5-attainment: the linear price is attained — "costs at most" becomes "costs exactly" #

Category: CV (continuous variables — the attainment half of P5; eft-pillars-plan.md P5).

Glossary: https://glossary.constraintsurfacedynamics.com/interaction-price/ Plain-language, CSD-role and formal statements of the interaction price, with this module as the Lean anchor. Kept symmetric by scripts/check-glossary.sh.

CV-9 priced locality violation from above: switching on a coupling λ moves an S-supported observable at most 2·|τ|·|λ|·C·‖A‖ from the S-supported subalgebra (heisenberg_interactingU_near_supported). Whether that linear price is attained was CV-9's declared boundary. This module closes it with a matching linear lower bound on a witness. Scoped first in specs/price-attainment-plan.md.

⚠️ Honest scope: attainment is an existence claim, and a witness is exactly what it needs — one drive, one coupling shape, K = N = 2. No claim that every drive saturates the bound, and the constants are not matched (on this witness the distance is 2|sin(τλ/2)|-shaped; the exact-distance identification is not claimed here).

References #

specs/price-attainment-plan.md (scoping); specs/eft-pillars-plan.md (P5); specs/future-work.md; CV/InteractionPrice.lean (CV-9, the upper bound); CV/DynamicalLocality.lean (heisenberg_phaseDiagU_apply); CV/ModeLocality.lean (modeOp, commute_of_disjointSupport); CV/PowerCounting.lean (l2_opNorm_modeOp_le); Mathlib/Analysis/Matrix/L2OpNormEntry.lean (norm_entry_le_l2_opNorm).

The commutator functional: distance from below #

theorem CSD.CV.norm_commutator_le_of_commute {K N : } [NeZero N] {X B P : Matrix (FieldConfig K N) (FieldConfig K N) } (hBP : B * P = P * B) :
X * P - P * X 2 * X - B * P

The commutator functional: if B commutes with the probe P, the commutator of X with P is controlled by the distance from X to B. In use, B ranges over an S-supported subalgebra and P is a disjointly supported probe, so this bounds the distance to the WHOLE subalgebra from below by a single computable commutator.

Norm bricks #

The unit basis matrix has operator norm at most one.

‖1 − e^{iθ}‖ = 2·|sin(θ/2)| — the exact chord length.

The conjugate of a diagonal phase is the inverse phase.

The witness #

noncomputable def CSD.CV.priceV :

The witness pair coupling: v(c) = 1 exactly when both modes sit at level 1. Bounded by 1.

Equations
Instances For
    noncomputable def CSD.CV.priceObs :

    The witness observable: the unit single-mode matrix at mode 0.

    Equations
    Instances For
      noncomputable def CSD.CV.priceProbe :

      The probe: the unit single-mode matrix at mode 1.

      Equations
      Instances For

        Entry evaluations: where each factor lives #

        The witness observable out of config (0,0): only into config (1,0).

        The witness observable into config (1,1): only out of config (0,1).

        The probe into config (1,1): only out of config (1,0).

        The probe out of config (0,0): only into config (0,1).

        The phase bookkeeping #

        noncomputable def CSD.CV.priceF (τ lam : ) :

        The diagonal phase function of the witness drive.

        Equations
        Instances For
          theorem CSD.CV.priceF_cross (τ lam : ) :
          priceF τ lam ![0, 1] - priceF τ lam ![1, 1] - (priceF τ lam ![0, 0] - priceF τ lam ![1, 0]) = -(τ * lam)

          The cross-difference of the phases is exactly the coupling phase: the free (energy) parts cancel because energy is mode-additive, and the coupling survives because it reads both modes.

          The commutator entry, exactly #

          theorem CSD.CV.XP_entry (τ lam : ) :

          The (config 00, config 11) entry of X·P collapses to the single path through config (1,0).

          theorem CSD.CV.PX_entry (τ lam : ) :

          The (config 00, config 11) entry of P·X collapses to the single path through config (0,1).

          The commutator entry has modulus 2·|sin(τλ/2)|, exactly. The free phases cancel between the two paths; the coupling phase does not.

          The attainment theorems #

          theorem CSD.CV.price_lower_bound (τ lam : ) {B : Matrix (FieldConfig 2 2) (FieldConfig 2 2) } (hB : SupportedOn {0} B) :

          ★★ The linear price is attained from below: EVERY {0}-supported operator is at least |sin(τλ/2)| away from the interacting Heisenberg observable. CV-9's declared attainment boundary closes on this witness.

          theorem CSD.CV.price_linear_attained (τ lam : ) (h0 : 0 τ * lam) ( : τ * lam Real.pi) :
          (∀ (B : Matrix (FieldConfig 2 2) (FieldConfig 2 2) ), SupportedOn {0} Bτ * lam / Real.pi heisenberg (interactingU 2 2 τ lam priceV) priceObs - B) ∃ (B : Matrix (FieldConfig 2 2) (FieldConfig 2 2) ), SupportedOn {0} B heisenberg (interactingU 2 2 τ lam priceV) priceObs - B 2 * (τ * lam)

          ★★ The sandwich — the price is linear on both sides. For 0 ≤ τλ ≤ π: every {0}-supported operator is at least τλ/π away (Jordan's inequality on the exact sine), and some {0}-supported operator is within 2τλ (CV-9's upper bound at C = 1, ‖A‖ ≤ 1). "Costs at most" is now "costs exactly", up to the constant gap [1/π, 2].