Documentation

CsdLean4.LF2.PreparationBarycenter

The barycentre: the density operator of a preparation is ∫ |ψ⟩⟨ψ| d(π_* μprep) #

Category: 3-Local (W3 of specs/qit-chain-scoping.md; the ontic identification of the density operator W2 obtained as a Gleason witness).

W2 (LF2/PreparationQdensity.lean) gave every preparation on Σ a density operator preparationDensity, characterised uniquely by its trace form — effect_gleason_representation on fromPreparation. That characterisation says what the operator does, not what it is. This module says what it is: the barycentre of the rank-one projectors |rep ψ⟩⟨rep ψ| along the projective law π_* μprep, an entrywise Bochner integral. So the density operator of a preparation is the ontic average of pure-state projectors over the preparation's projective distribution — the object Papers C and TN2 write as ∫ |ψ⟩⟨ψ| ρ_ep(ψ) dμ_FS(ψ).

Honest scope #

The ρ_ep form takes absolute continuity as a hypothesis here, in the abstract SectorData interface. For region preparations of the SigmaLayer interface it is a theorem (projectivePreparationLaw_absolutelyContinuous), and SigmaLayer/PreparationDensityBridge.lean composes the two: preparationDensity_apply_rhoEp is this formula with Q28's Radon–Nikodym density and no hypothesis, and kahler_preparationDensity_apply is its instance on the Kähler arena with c = 1. The barycentre identification itself (preparationDensity_eq_barycenter) needs no such hypothesis.

⚠️ Same posits as W2. The sector is posited (specs/POSITS.md Posit 2); what is proved is that, given it, the density operator of a preparation is the barycentre.

References: specs/qit-chain-scoping.md (W3); LF2/PreparationQdensity.lean (W2); LF2/EffectGleason.lean (effect_gleason_representation, trace_mul_outerProduct); LF2/Preparation.lean (fromPreparation, effectProjFn_integrable).

The barycentre of rank-one projectors, over any finite index #

noncomputable def CSD.LF2.entryFn {ι : Type u_1} {Q : Type u_2} (rep : Q → EuclideanSpace ℂ ι) (j k : ι) (p : Q) :

The entry function p ↦ (rep p)ⱼ · conj (rep p)ₖ of the rank-one projector |rep p⟩⟨rep p|.

Equations
Instances For
    noncomputable def CSD.LF2.barycenterMatrix {ι : Type u_1} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (μ : MeasureTheory.Measure Q) :
    Matrix ι ι ℂ

    The entrywise barycentre of the rank-one projectors |rep p⟩⟨rep p| against μ.

    Equations
    Instances For
      theorem CSD.LF2.norm_coord_le_one {ι : Type u_1} [Fintype ι] (v : EuclideanSpace ℂ ι) (hv : ‖v‖ = 1) (j : ι) :

      Each coordinate of a unit vector has modulus at most 1.

      theorem CSD.LF2.measurable_coord {ι : Type u_1} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_meas : Measurable rep) (j : ι) :
      Measurable fun (p : Q) => (rep p).ofLp j

      The coordinate map p ↦ (rep p) j is measurable.

      theorem CSD.LF2.measurable_entryFn {ι : Type u_1} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_meas : Measurable rep) (j k : ι) :
      theorem CSD.LF2.entryFn_integrable {ι : Type u_1} [Fintype ι] {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsFiniteMeasure μ] (j k : ι) :

      The entry functions are integrable: measurable and bounded by 1.

      The barycentre is a density operator #

      The barycentre is Hermitian: conjugating an entry integral conjugates the integrand, and conj ((rep p)ₖ conj (rep p)ⱼ) = (rep p)ⱼ conj (rep p)ₖ.

      theorem CSD.LF2.sum_entryFn_diag {ι : Type u_1} [Fintype ι] {Q : Type u_2} (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (p : Q) :
      ∑ j : ι, entryFn rep j j p = 1

      The diagonal entries of |v⟩⟨v| sum to ‖v‖² = 1.

      theorem CSD.LF2.barycenterMatrix_trace {ι : Type u_1} [Fintype ι] {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsProbabilityMeasure μ] :

      The barycentre against a probability measure has trace one.

      theorem CSD.LF2.normSq_dotProduct_eq_sum {ι : Type u_1} [Fintype ι] {Q : Type u_2} (rep : Q → EuclideanSpace ℂ ι) (u : ι → ℂ) (p : Q) :
      ↑(Complex.normSq (star u ⬝ᵥ (rep p).ofLp)) = ∑ j : ι, ∑ k : ι, star (u j) * (entryFn rep j k p * u k)

      Pointwise: the quadratic form of |rep p⟩⟨rep p| at u is |⟨u, rep p⟩|², expanded.

      theorem CSD.LF2.dotProduct_barycenterMatrix_mulVec {ι : Type u_1} [Fintype ι] {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsFiniteMeasure μ] (u : ι → ℂ) :
      star u ⬝ᵥ (barycenterMatrix rep μ).mulVec u = ∫ (p : Q), ↑(Complex.normSq (star u ⬝ᵥ (rep p).ofLp)) ∂μ

      The quadratic form of the barycentre at u is the integral of |⟨u, rep p⟩|².

      theorem CSD.LF2.barycenterMatrix_posSemidef {ι : Type u_1} [Fintype ι] {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsFiniteMeasure μ] :

      The barycentre is positive semidefinite: its quadratic form is an integral of |⟨u, ψ⟩|².

      noncomputable def CSD.LF2.barycenterDensityIx {ι : Type u_1} [Fintype ι] {Q : Type u_2} [MeasurableSpace Q] [DecidableEq ι] (rep : Q → EuclideanSpace ℂ ι) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsProbabilityMeasure μ] :

      The barycentre density operator, index-parametric: ∫ |rep p⟩⟨rep p| dμ(p) as a DensityOperatorIx ι (the structure partial traces live on).

      Equations
      Instances For

        The Fin N case: trace form against effects, and the DensityOperator N packaging #

        theorem CSD.LF2.effectProjFn_eq_sum {N : ℕ} {Q : Type u_2} (rep : Q → EuclideanSpace ℂ (Fin N)) (E : Effect N) (p : Q) :
        ↑(effectProjFn rep E p) = ∑ j : Fin N, ∑ k : Fin N, entryFn rep j k p * E.M k j

        The effect function is the real part of tr(|rep p⟩⟨rep p| · E), and that trace is real (both factors Hermitian), so as a complex number it IS the trace — expanded entrywise: ∑ⱼₖ (rep p)ⱼ conj (rep p)ₖ E ₖⱼ.

        theorem CSD.LF2.trace_barycenterMatrix_mul {N : ℕ} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsFiniteMeasure μ] (E : Effect N) :
        (barycenterMatrix rep μ * E.M).trace = ∫ (p : Q), ↑(effectProjFn rep E p) ∂μ

        The trace form of the barycentre against an effect is the integral of the effect function.

        noncomputable def CSD.LF2.barycenterDensity {N : ℕ} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsProbabilityMeasure μ] :

        The barycentre density operator ∫ |rep p⟩⟨rep p| dμ(p) of a unit-norm measurable representative against a probability measure.

        Equations
        Instances For
          theorem CSD.LF2.barycenterDensity_traceForm {N : ℕ} {Q : Type u_2} [MeasurableSpace Q] (rep : Q → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : Q), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (μ : MeasureTheory.Measure Q) [MeasureTheory.IsProbabilityMeasure μ] (E : Effect N) :
          traceForm (barycenterDensity rep hrep_unit hrep_meas μ) E = ∫ (p : Q), effectProjFn rep E p ∂μ

          The trace form of the barycentre density operator is the integral of the effect function.

          The identification: the density operator of a preparation IS its barycentre #

          theorem CSD.LF2.isProbabilityMeasure_projectiveLaw {SigmaSpace : Type u_3} {P : Type u_4} {G : Type u_5} [MeasurableSpace SigmaSpace] [Nonempty SigmaSpace] [MeasurableSpace P] [Group G] [MulAction G SigmaSpace] [MulAction G P] [MulAction.IsPretransitive G P] (D : SectorData SigmaSpace P G) (μprep : MeasureTheory.Measure SigmaSpace) [MeasureTheory.IsProbabilityMeasure μprep] :

          The projective law π_* μprep of a preparation is a probability measure.

          noncomputable def CSD.LF2.preparationBarycenter {N : ℕ} {SigmaSpace : Type u_3} {P : Type u_4} {G : Type u_5} [MeasurableSpace SigmaSpace] [Nonempty SigmaSpace] [MeasurableSpace P] [Group G] [MulAction G SigmaSpace] [MulAction G P] [MulAction.IsPretransitive G P] (D : SectorData SigmaSpace P G) (μprep : MeasureTheory.Measure SigmaSpace) [MeasureTheory.IsProbabilityMeasure μprep] (rep : P → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : P), ‖rep p‖ = 1) (hrep_meas : Measurable rep) :

          The barycentre of a preparation: ∫ |rep ψ⟩⟨rep ψ| d(π_* μprep)(ψ), packaged as a density operator.

          Equations
          Instances For
            theorem CSD.LF2.preparationDensity_eq_barycenter {N : ℕ} {SigmaSpace : Type u_3} {P : Type u_4} {G : Type u_5} [MeasurableSpace SigmaSpace] [Nonempty SigmaSpace] [MeasurableSpace P] [Group G] [MulAction G SigmaSpace] [MulAction G P] [MulAction.IsPretransitive G P] (D : SectorData SigmaSpace P G) (μFS : MeasureTheory.Measure P) [MeasureTheory.IsProbabilityMeasure μFS] (bridge : MeasureBridgeData D μFS) (μprep : MeasureTheory.Measure SigmaSpace) [MeasureTheory.IsProbabilityMeasure μprep] (rep : P → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : P), ‖rep p‖ = 1) (hrep_meas : Measurable rep) :
            preparationDensity D μFS bridge μprep rep hrep_unit hrep_meas = preparationBarycenter D μprep rep hrep_unit hrep_meas

            ★★ The density operator of a preparation IS its barycentre. The Gleason witness of fromPreparation (W2) and the Bochner integral of the rank-one projectors along the projective law have the same trace form, so by effect_gleason_representation's uniqueness they are equal.

            theorem CSD.LF2.preparationDensity_apply {N : ℕ} {SigmaSpace : Type u_3} {P : Type u_4} {G : Type u_5} [MeasurableSpace SigmaSpace] [Nonempty SigmaSpace] [MeasurableSpace P] [Group G] [MulAction G SigmaSpace] [MulAction G P] [MulAction.IsPretransitive G P] (D : SectorData SigmaSpace P G) (μFS : MeasureTheory.Measure P) [MeasureTheory.IsProbabilityMeasure μFS] (bridge : MeasureBridgeData D μFS) (μprep : MeasureTheory.Measure SigmaSpace) [MeasureTheory.IsProbabilityMeasure μprep] (rep : P → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : P), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (j k : Fin N) :
            (preparationDensity D μFS bridge μprep rep hrep_unit hrep_meas).M j k = ∫ (p : P), (rep p).ofLp j * star ((rep p).ofLp k) ∂MeasureTheory.Measure.map D.π μprep

            ★★ Entrywise: ρ_{jk} = ∫ ψⱼ conj ψₖ d(π_* μprep)(ψ).

            theorem CSD.LF2.preparationDensity_apply_rnDeriv {N : ℕ} {SigmaSpace : Type u_3} {P : Type u_4} {G : Type u_5} [MeasurableSpace SigmaSpace] [Nonempty SigmaSpace] [MeasurableSpace P] [Group G] [MulAction G SigmaSpace] [MulAction G P] [MulAction.IsPretransitive G P] (D : SectorData SigmaSpace P G) (μFS : MeasureTheory.Measure P) [MeasureTheory.IsProbabilityMeasure μFS] (bridge : MeasureBridgeData D μFS) (μprep : MeasureTheory.Measure SigmaSpace) [MeasureTheory.IsProbabilityMeasure μprep] (rep : P → EuclideanSpace ℂ (Fin N)) (hrep_unit : ∀ (p : P), ‖rep p‖ = 1) (hrep_meas : Measurable rep) (habs : (MeasureTheory.Measure.map D.π μprep).AbsolutelyContinuous μFS) (j k : Fin N) :
            (preparationDensity D μFS bridge μprep rep hrep_unit hrep_meas).M j k = ∫ (p : P), ((MeasureTheory.Measure.map D.π μprep).rnDeriv μFS p).toReal • ((rep p).ofLp j * star ((rep p).ofLp k)) ∂μFS

            ★ The ρ_ep form. When the projective law is absolutely continuous with respect to the reference measure μFS — ρ_ep := d(π_* μprep)/dμFS its Radon–Nikodym derivative — the density operator is ∫ |ψ⟩⟨ψ| ρ_ep(ψ) dμFS(ψ) entrywise.