AFTD Auto-Formalizing Theoretical Domains

ppt_qutrit_steered_effect_incompatible

theoremverified

The three normalized steered binary effects from the explicit PPT Bell example are not jointly measurable.

Statement

theorem ppt_qutrit_steered_effect_incompatible : ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ, (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧ ∀ j : Fin 3, (∑ s, if s j then G s else 0) = ppt_qutrit_steered_effect j
Source
Helper for OP-693; Bell inequality and explicit violation in arXiv:1405.4502 equations (4)–(8); steering-to-compatibility relation in arXiv:2010.04048 Appendix A.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
Used by 1

The proof, explained

The proof establishes the incompatibility of the three steered binary effects using semidefinite programming (SDP) duality. An explicit dual certificate is constructed from four rank-1 positive semidefinite matrices P₀, P₁, P₂, P₃ such that the matrix combinations Z(s) are positive semidefinite for all eight binary strings s ∈ {0, 1}³. Any hypothetical joint POVM would therefore yield a non-negative dual trace sum ∑_s Re(tr(Z(s) G_s)) ≥ 0. However, expanding this sum in terms of the marginal constraints and evaluating it for the explicit PPT Bell state steered effects yields a strictly negative value (strictly less than -3.5 × 10⁻⁵), producing a contradiction.

  1. For any two positive semidefinite complex matrices P and ρ, the trace of their product has a non-negative real part: 0 ≤ Re(tr(P ρ)).

    By the continuous functional calculus for self-adjoint elements with non-negative spectrum, P has a self-adjoint square root X such that P = X². By trace cyclicity and associativity, tr(P ρ) = tr(X² ρ) = tr(X ρ X). Because ρ is positive semidefinite and X is self-adjoint (X = X*), the matrix X ρ X = X ρ X* is also positive semidefinite. The trace of any positive semidefinite matrix is non-negative, and taking its real part gives 0 ≤ Re(tr(P ρ)).

    lines 7–14

    uses CFC.exists_sqrt_of_isSelfAdjoint_of_quasispectrumRestricts, QuasispectrumRestricts.nnreal_of_nonneg, Matrix.mul_assoc, Matrix.trace_mul_comm, Matrix.star_eq_conjTranspose

    private lemma in767_originalproof_trace_psd {n : Type} [Fintype n] [DecidableEq n] {P ρ : Matrix n n ℂ}
        (hP : P.PosSemidef) (hρ : ρ.PosSemidef) : 0 ≤ (P * ρ).trace.re := by
      obtain ⟨X, hX, -, rfl⟩ := CFC.exists_sqrt_of_isSelfAdjoint_of_quasispectrumRestricts hP.isHermitian
        (QuasispectrumRestricts.nnreal_of_nonneg hP.nonneg)
      rw [Matrix.mul_assoc, Matrix.trace_mul_comm, Matrix.mul_assoc, ← Matrix.mul_assoc]
      have h := hρ.mul_mul_conjTranspose_same X
      rw [← Matrix.star_eq_conjTranspose, hX.star_eq] at h
      exact (Complex.nonneg_iff.1 h.trace_nonneg).1
  2. The four vectors defining the dual certificate take explicit rational component values in ℂ³. automation

    The dual certificate vectors v₀, v₁, v₂, v₃ in ℂ³ are defined by branching on the index i ∈ {0, 1, 2, 3}. For each specific index, the conditional reduces to the explicit numerical 3-vector by evaluating the index inequalities.

    lines 16–25

    private noncomputable def in767_originalproof_dual_vec (i : Fin 4) : Fin 3 → ℂ :=
      if i = 0 then ![10599/1557500, 1791231/3115000, 1991/89000]
      else if i = 1 then ![-773727/1557500, -448691/1557500, 3993/178000]
      else if i = 2 then ![1565119/3115000, -455757/1557500, 1947/89000]
      else ![0, 0, 77/2000]
    
    private lemma in767_originalproof_dual_vec0 : in767_originalproof_dual_vec 0 = ![10599/1557500, 1791231/3115000, 1991/89000] := by norm_num [in767_originalproof_dual_vec]
    private lemma in767_originalproof_dual_vec1 : in767_originalproof_dual_vec 1 = ![-773727/1557500, -448691/1557500, 3993/178000] := by norm_num [in767_originalproof_dual_vec]
    private lemma in767_originalproof_dual_vec2 : in767_originalproof_dual_vec 2 = ![1565119/3115000, -455757/1557500, 1947/89000] := by simp only [in767_originalproof_dual_vec, show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, if_false, if_true]
    private lemma in767_originalproof_dual_vec3 : in767_originalproof_dual_vec 3 = ![0, 0, 77/2000] := by simp only [in767_originalproof_dual_vec, show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide, if_false]
  3. For every binary assignment s ∈ {0, 1}³, the dual combination matrix Z(s) is positive semidefinite.

    Each matrix Pᵢ = vᵢ vᵢ* is positive semidefinite as the outer product of a vector with its conjugate transpose. A case analysis over all eight binary strings s ∈ {false, true}³ shows that Z(s) is positive semidefinite in every case: for seven assignments, Z(s) simplifies to the sum of two positive semidefinite matrices from {P₀, P₁, P₂, P₃}; for s = (true, true, true), Z(s) = P₀ + P₁ + P₂ - P₃, which evaluates coordinate-by-coordinate to v v* + w w* for the orthogonal vectors v = (3533/5000, 0, 0) and w = (0, 3533/5000, 0), and is therefore also positive semidefinite.

    lines 27–65

    uses Matrix.posSemidef_vecMulVec_self_star, two_smul

    private noncomputable def in767_originalproof_dual_p (i : Fin 4) : Matrix (Fin 3) (Fin 3) ℂ :=
      Matrix.vecMulVec (in767_originalproof_dual_vec i) (star (in767_originalproof_dual_vec i))
    
    private noncomputable def in767_originalproof_dual_z (s : Fin 3 → Bool) : Matrix (Fin 3) (Fin 3) ℂ :=
      (2 : ℝ) • in767_originalproof_dual_p 3 + (if s 0 then in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3 else 0) +
      (if s 1 then in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3 else 0) +
      (if s 2 then in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3 else 0)
    
    private lemma in767_originalproof_dual_p_psd (i : Fin 4) : (in767_originalproof_dual_p i).PosSemidef :=
      Matrix.posSemidef_vecMulVec_self_star _
    
    private lemma in767_originalproof_dual_all_psd (s : Fin 3 → Bool) : (in767_originalproof_dual_z s).PosSemidef := by
      cases h0 : s 0 <;> cases h1 : s 1 <;> cases h2 : s 2
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 3 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 3).add (in767_originalproof_dual_p_psd 3)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 2 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 2).add (in767_originalproof_dual_p_psd 3)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 3)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 2 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 2)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 1 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 1).add (in767_originalproof_dual_p_psd 3)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 1 + in767_originalproof_dual_p 2 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 1).add (in767_originalproof_dual_p_psd 2)
      · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 1 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel
        rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 1)
      · let v : Fin 3 → ℂ := ![3533/5000, 0, 0]
        let w : Fin 3 → ℂ := ![0, 3533/5000, 0]
        have he : in767_originalproof_dual_z s = Matrix.vecMulVec v (star v) + Matrix.vecMulVec w (star w) := by
          simp only [in767_originalproof_dual_z, h0, h1, h2, if_true, in767_originalproof_dual_p,
            in767_originalproof_dual_vec0, in767_originalproof_dual_vec1, in767_originalproof_dual_vec2, in767_originalproof_dual_vec3, two_smul]
          ext i j
          fin_cases i <;> fin_cases j <;>
            simp only [Matrix.add_apply, Matrix.sub_apply, Matrix.vecMulVec_apply, Pi.star_apply] <;>
            norm_num [v, w, map_div₀, map_ofNat]
        rw [he]
        exact (Matrix.posSemidef_vecMulVec_self_star v).add (Matrix.posSemidef_vecMulVec_self_star w)
    
  4. The real part of the matrix trace distributes linearly over finite sums: Re(tr(A ∑ s, G(s))) = ∑ s, Re(tr(A G(s))).

    Matrix multiplication distributes over the sum of matrices, the trace is additive over finite sums, and the real part operation is additive over complex sums.

    lines 66–70

    uses Matrix.mul_sum, Matrix.trace_sum, Complex.re_sum

    private lemma in767_originalproof_trace_matrix_sum (A : Matrix (Fin 3) (Fin 3) ℂ)
        (G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ) :
        (A * ∑ s, G s).trace.re = ∑ s, (A * G s).trace.re := by
      simp only [Matrix.mul_sum, Matrix.trace_sum, Complex.re_sum]
    
  5. If any three effects M₀, M₁, M₂ satisfy the dual certificate inequality, then no joint POVM exists having them as marginals.

    Suppose, for contradiction, that there exists a joint POVM {G_s} with G_s ≥ 0, ∑ s, G_s = I, and marginals ∑_{s : s(j) = true} G_s = M_j for each j ∈ {0, 1, 2}. Because each Z(s) and each G_s is positive semidefinite, the trace product Re(tr(Z(s) G_s)) is non-negative for each s, so the total sum ∑ s, Re(tr(Z(s) G_s)) ≥ 0. Expanding Z(s) into its definition, exchanging sums, and applying the marginal constraints and the normalization ∑ s, G_s = I reveals that this sum equals 2 Re(tr(P₃)) + Re(tr((P₁ - P₃) M₀)) + Re(tr((P₀ - P₃) M₁)) + Re(tr((P₂ - P₃) M₂)). By the certificate hypothesis, this value is strictly negative, giving 0 ≤ sum < 0, a contradiction.

    lines 71–115

    uses Finset.sum_nonneg, in767_originalproof_trace_psd, in767_originalproof_dual_all_psd, in767_originalproof_trace_matrix_sum, Matrix.mul_one

    private theorem in767_originalproof_any_not_joint (M : Fin 3 → Matrix (Fin 3) (Fin 3) ℂ)
        (hcert : 2 * (in767_originalproof_dual_p 3).trace.re +
          ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * M 0).trace.re +
          ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * M 1).trace.re +
          ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * M 2).trace.re < 0) :
        ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ,
          (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧
          ∀ j : Fin 3, (∑ s, if s j then G s else 0) = M j := by
      classical
      rintro ⟨G, hG, hsum, hmarg⟩
      have hmargin (A : Matrix (Fin 3) (Fin 3) ℂ) (j : Fin 3) :
          (∑ s, if s j then (A * G s).trace.re else 0) = (A * M j).trace.re := by
        rw [← hmarg j, in767_originalproof_trace_matrix_sum]
        apply Finset.sum_congr rfl
        intro s _
        split_ifs <;> simp_all
      have hsplit (s : Fin 3 → Bool) :
          (in767_originalproof_dual_z s * G s).trace.re =
            2 * (in767_originalproof_dual_p 3 * G s).trace.re +
            (if s 0 then ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +
            (if s 1 then ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +
            (if s 2 then ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * G s).trace.re else 0) := by
        cases h0 : s 0 <;> cases h1 : s 1 <;> cases h2 : s 2 <;>
          simp [in767_originalproof_dual_z, h0, h1, h2, two_smul, Matrix.add_mul, Matrix.sub_mul, Matrix.trace_add, Matrix.trace_sub] <;> ring
      have heq : (∑ s, (in767_originalproof_dual_z s * G s).trace.re) =
          2 * (in767_originalproof_dual_p 3).trace.re +
            ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * M 0).trace.re +
            ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * M 1).trace.re +
            ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * M 2).trace.re := by
        calc
          _ = ∑ s, (2 * (in767_originalproof_dual_p 3 * G s).trace.re +
              (if s 0 then ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +
              (if s 1 then ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +
              (if s 2 then ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * G s).trace.re else 0)) := by
            exact Finset.sum_congr rfl fun s _ => hsplit s
          _ = _ := by
            simp only [Finset.sum_add_distrib, ← Finset.mul_sum]
            rw [← in767_originalproof_trace_matrix_sum, hsum, Matrix.mul_one]
            rw [hmargin _ 0, hmargin _ 1, hmargin _ 2]
      have hnonneg : 0 ≤ ∑ s, (in767_originalproof_dual_z s * G s).trace.re :=
        Finset.sum_nonneg fun s _ => in767_originalproof_trace_psd (in767_originalproof_dual_all_psd s) (hG s)
      rw [heq] at hnonneg
      have := hcert
      linarith
    
  6. The first steered effect M₀ satisfies Re(tr((P₁ - P₃) M₀)) < -1/1000. automation

    The steered effect M₀ is defined from the bipartite PPT Bell state under Alice's measurement setting j = 0 followed by normalization. Unfolding the definitions and evaluating the matrix trace numerically confirms that the real part of tr((P₁ - P₃) M₀) is strictly less than -1/1000.

    lines 117–159

    private lemma in767_originalproof_original_dual_term0 : ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 0).trace.re < -(1/1000 : ℝ) := by
      simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec1, in767_originalproof_dual_vec3,
        Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,
        Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]
      simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,
        Matrix.mul_diagonal, Matrix.diagonal_mul]
      norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,
        ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,
        Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,
        map_div₀, map_ofNat]
      simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals num_ineq
    
  7. The second steered effect M₁ satisfies Re(tr((P₀ - P₃) M₁)) < -1/1000. automation

    Unfolding the definition of the steered effect M₁ under setting j = 1 and evaluating the trace product numerically establishes that Re(tr((P₀ - P₃) M₁)) < -1/1000.

    lines 160–202

    private lemma in767_originalproof_original_dual_term1 : ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 1).trace.re < -(1/1000 : ℝ) := by
      simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec0, in767_originalproof_dual_vec3,
        Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,
        Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]
      simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,
        Matrix.mul_diagonal, Matrix.diagonal_mul]
      norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,
        ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,
        Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,
        map_div₀, map_ofNat]
      simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals num_ineq
    
  8. The third steered effect M₂ satisfies Re(tr((P₂ - P₃) M₂)) < -1/1000. automation

    Unfolding the definition of the steered effect M₂ under setting j = 2 and computing the trace product numerically confirms that Re(tr((P₂ - P₃) M₂)) < -1/1000.

    lines 203–245

    private lemma in767_originalproof_original_dual_term2 : ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 2).trace.re < -(1/1000 : ℝ) := by
      simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec2, in767_originalproof_dual_vec3,
        Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,
        Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]
      simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,
        Matrix.mul_diagonal, Matrix.diagonal_mul]
      norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,
        ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,
        Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,
        map_div₀, map_ofNat]
      simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,
        show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,
        show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,
        show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,
        show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,
        show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,
        show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,
        if_false, if_true] at *
      all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,
        Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]
      all_goals num_ineq
    
  9. The overall dual certificate inequality holds strictly for the three PPT steered effects.

    The scalar constant 2 Re(tr(P₃)) is computed directly from v₃ = (0, 0, 77/2000) to be 2 * (77/2000)² = 5929/2000000 ≈ 0.0029645. Combining this with the three steered effect bounds, each strictly bounded above by -0.001, gives a total sum strictly less than 0.0029645 - 0.003 < 0, which is verified by linear arithmetic.

    lines 247–256

    uses in767_originalproof_original_dual_term0, in767_originalproof_original_dual_term1, in767_originalproof_original_dual_term2

    private theorem in767_originalproof_original_dual_negative :
        2 * (in767_originalproof_dual_p 3).trace.re +
          ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 0).trace.re +
          ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 1).trace.re +
          ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 2).trace.re < 0 := by
      have hconst : 2 * (in767_originalproof_dual_p 3).trace.re = (5929/2000000 : ℝ) := by
        simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec3, Matrix.trace, Matrix.diag_apply,
          Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]
        norm_num [Matrix.cons_val_two, Matrix.vecHead, Matrix.vecTail, map_div₀, map_ofNat]
      linarith [in767_originalproof_original_dual_term0, in767_originalproof_original_dual_term1, in767_originalproof_original_dual_term2]
  10. The three normalized steered binary effects from the explicit PPT Bell example are not jointly measurable.

    Applying the general incompatibility criterion in767_originalproof_any_not_joint to the three steered effects M₀, M₁, M₂ with the strict certificate negativity completes the proof that no joint POVM exists.

    lines 258–265

    uses in767_originalproof_any_not_joint, in767_originalproof_original_dual_negative, in767_originalproof_original_not_joint

    private theorem in767_originalproof_original_not_joint :
        ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ,
          (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧
          ∀ j : Fin 3, (∑ s, if s j then G s else 0) = ppt_qutrit_steered_effect j :=
      in767_originalproof_any_not_joint ppt_qutrit_steered_effect in767_originalproof_original_dual_negative
    
    theorem ppt_qutrit_steered_effect_incompatible : ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ, (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧ ∀ j : Fin 3, (∑ s, if s j then G s else 0) = ppt_qutrit_steered_effect j := by
      exact in767_originalproof_original_not_joint
CFC.exists_sqrt_of_isSelfAdjoint_of_quasispectrumRestricts
A self-adjoint element whose quasispectrum is restricted to the non-negative real numbers has a self-adjoint square root with non-negative quasispectrum.
Complex.re_sum
The real part distributes over finite sums of complex numbers: Re(∑ i, f(i)) = ∑ i, Re(f(i)).
Finset.sum_nonneg
A finite sum of non-negative elements is non-negative.
Matrix.mul_one
Multiplying a matrix by the identity matrix leaves it unchanged: M * 1 = M.
Matrix.mul_assoc
Matrix multiplication is associative: (L * M) * N = L * (M * N).
Matrix.mul_sum
Matrix multiplication distributes over finite sums: M * (∑ a, f(a)) = ∑ a, M * f(a).
Matrix.posSemidef_vecMulVec_self_star
For any vector v, the rank-1 outer product matrix v v* is positive semidefinite.
Matrix.star_eq_conjTranspose
For complex matrices, the star involution equals the conjugate transpose: star M = Mᴴ.
Matrix.trace_sum
The matrix trace distributes linearly over finite sums: tr(∑ i, f(i)) = ∑ i, tr(f(i)).
Matrix.trace_mul_comm
The matrix trace is cyclic: tr(A * B) = tr(B * A).
QuasispectrumRestricts.nnreal_of_nonneg
If an element in an ordered continuous functional calculus algebra is non-negative, its quasispectrum is contained in [0, ∞).
in767_originalproof_any_not_joint
Any three effects satisfying the strict negativity condition for the dual certificate cannot be jointly measurable.
in767_originalproof_dual_all_psd
For every binary vector s ∈ {0, 1}³, the dual matrix Z(s) is positive semidefinite.
in767_originalproof_original_dual_negative
The dual certificate expression evaluated on the explicit PPT steered effects is strictly negative.
in767_originalproof_original_not_joint
No joint POVM exists whose marginals match the three normalized steered effects of the PPT Bell example.
in767_originalproof_original_dual_term0
The trace term for the first steered effect satisfies Re(tr((P₁ - P₃) M₀)) < -1/1000.
in767_originalproof_original_dual_term1
The trace term for the second steered effect satisfies Re(tr((P₀ - P₃) M₁)) < -1/1000.
in767_originalproof_original_dual_term2
The trace term for the third steered effect satisfies Re(tr((P₂ - P₃) M₂)) < -1/1000.
in767_originalproof_trace_matrix_sum
The real part of the trace distributes over finite sums of matrices: Re(tr(A ∑ s, G(s))) = ∑ s, Re(tr(A G(s))).
in767_originalproof_trace_psd
The trace of the product of two positive semidefinite matrices has a non-negative real part: 0 ≤ Re(tr(P ρ)).
two_smul
Scalar multiplication by 2 equals addition with itself: 2 • x = x + x.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open Matrixopen scoped ComplexOrder Matrix BigOperatorsset_option maxRecDepth 8192set_option maxHeartbeats 4000000set_option linter.unusedSimpArgs falseopen scoped MatrixOrderprivate lemma in767_originalproof_trace_psd {n : Type} [Fintype n] [DecidableEq n] {P ρ : Matrix n n ℂ}    (hP : P.PosSemidef) (hρ : ρ.PosSemidef) : 0 ≤ (P * ρ).trace.re := by  obtain ⟨X, hX, -, rfl⟩ := CFC.exists_sqrt_of_isSelfAdjoint_of_quasispectrumRestricts hP.isHermitian    (QuasispectrumRestricts.nnreal_of_nonneg hP.nonneg)  rw [Matrix.mul_assoc, Matrix.trace_mul_comm, Matrix.mul_assoc, ← Matrix.mul_assoc]  have h := hρ.mul_mul_conjTranspose_same X  rw [← Matrix.star_eq_conjTranspose, hX.star_eq] at h  exact (Complex.nonneg_iff.1 h.trace_nonneg).1private noncomputable def in767_originalproof_dual_vec (i : Fin 4) : Fin 3 → ℂ :=  if i = 0 then ![10599/1557500, 1791231/3115000, 1991/89000]  else if i = 1 then ![-773727/1557500, -448691/1557500, 3993/178000]  else if i = 2 then ![1565119/3115000, -455757/1557500, 1947/89000]  else ![0, 0, 77/2000]private lemma in767_originalproof_dual_vec0 : in767_originalproof_dual_vec 0 = ![10599/1557500, 1791231/3115000, 1991/89000] := by norm_num [in767_originalproof_dual_vec]private lemma in767_originalproof_dual_vec1 : in767_originalproof_dual_vec 1 = ![-773727/1557500, -448691/1557500, 3993/178000] := by norm_num [in767_originalproof_dual_vec]private lemma in767_originalproof_dual_vec2 : in767_originalproof_dual_vec 2 = ![1565119/3115000, -455757/1557500, 1947/89000] := by simp only [in767_originalproof_dual_vec, show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, if_false, if_true]private lemma in767_originalproof_dual_vec3 : in767_originalproof_dual_vec 3 = ![0, 0, 77/2000] := by simp only [in767_originalproof_dual_vec, show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide, if_false]private noncomputable def in767_originalproof_dual_p (i : Fin 4) : Matrix (Fin 3) (Fin 3) ℂ :=  Matrix.vecMulVec (in767_originalproof_dual_vec i) (star (in767_originalproof_dual_vec i))private noncomputable def in767_originalproof_dual_z (s : Fin 3 → Bool) : Matrix (Fin 3) (Fin 3) ℂ :=  (2 : ℝ) • in767_originalproof_dual_p 3 + (if s 0 then in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3 else 0) +  (if s 1 then in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3 else 0) +  (if s 2 then in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3 else 0)private lemma in767_originalproof_dual_p_psd (i : Fin 4) : (in767_originalproof_dual_p i).PosSemidef :=  Matrix.posSemidef_vecMulVec_self_star _private lemma in767_originalproof_dual_all_psd (s : Fin 3 → Bool) : (in767_originalproof_dual_z s).PosSemidef := by  cases h0 : s 0 <;> cases h1 : s 1 <;> cases h2 : s 2  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 3 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 3).add (in767_originalproof_dual_p_psd 3)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 2 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 2).add (in767_originalproof_dual_p_psd 3)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 3)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 2 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 2)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 1 + in767_originalproof_dual_p 3 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 1).add (in767_originalproof_dual_p_psd 3)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 1 + in767_originalproof_dual_p 2 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 1).add (in767_originalproof_dual_p_psd 2)  · have he : in767_originalproof_dual_z s = in767_originalproof_dual_p 0 + in767_originalproof_dual_p 1 := by simp [in767_originalproof_dual_z, h0, h1, h2, two_smul] <;> abel    rw [he]; exact (in767_originalproof_dual_p_psd 0).add (in767_originalproof_dual_p_psd 1)  · let v : Fin 3 → ℂ := ![3533/5000, 0, 0]    let w : Fin 3 → ℂ := ![0, 3533/5000, 0]    have he : in767_originalproof_dual_z s = Matrix.vecMulVec v (star v) + Matrix.vecMulVec w (star w) := by      simp only [in767_originalproof_dual_z, h0, h1, h2, if_true, in767_originalproof_dual_p,        in767_originalproof_dual_vec0, in767_originalproof_dual_vec1, in767_originalproof_dual_vec2, in767_originalproof_dual_vec3, two_smul]      ext i j      fin_cases i <;> fin_cases j <;>        simp only [Matrix.add_apply, Matrix.sub_apply, Matrix.vecMulVec_apply, Pi.star_apply] <;>        norm_num [v, w, map_div₀, map_ofNat]    rw [he]    exact (Matrix.posSemidef_vecMulVec_self_star v).add (Matrix.posSemidef_vecMulVec_self_star w)private lemma in767_originalproof_trace_matrix_sum (A : Matrix (Fin 3) (Fin 3) ℂ)    (G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ) :    (A * ∑ s, G s).trace.re = ∑ s, (A * G s).trace.re := by  simp only [Matrix.mul_sum, Matrix.trace_sum, Complex.re_sum]private theorem in767_originalproof_any_not_joint (M : Fin 3 → Matrix (Fin 3) (Fin 3) ℂ)    (hcert : 2 * (in767_originalproof_dual_p 3).trace.re +      ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * M 0).trace.re +      ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * M 1).trace.re +      ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * M 2).trace.re < 0) :    ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ,      (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧      ∀ j : Fin 3, (∑ s, if s j then G s else 0) = M j := by  classical  rintro ⟨G, hG, hsum, hmarg⟩  have hmargin (A : Matrix (Fin 3) (Fin 3) ℂ) (j : Fin 3) :      (∑ s, if s j then (A * G s).trace.re else 0) = (A * M j).trace.re := by    rw [← hmarg j, in767_originalproof_trace_matrix_sum]    apply Finset.sum_congr rfl    intro s _    split_ifs <;> simp_all  have hsplit (s : Fin 3 → Bool) :      (in767_originalproof_dual_z s * G s).trace.re =        2 * (in767_originalproof_dual_p 3 * G s).trace.re +        (if s 0 then ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +        (if s 1 then ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +        (if s 2 then ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * G s).trace.re else 0) := by    cases h0 : s 0 <;> cases h1 : s 1 <;> cases h2 : s 2 <;>      simp [in767_originalproof_dual_z, h0, h1, h2, two_smul, Matrix.add_mul, Matrix.sub_mul, Matrix.trace_add, Matrix.trace_sub] <;> ring  have heq : (∑ s, (in767_originalproof_dual_z s * G s).trace.re) =      2 * (in767_originalproof_dual_p 3).trace.re +        ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * M 0).trace.re +        ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * M 1).trace.re +        ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * M 2).trace.re := by    calc      _ = ∑ s, (2 * (in767_originalproof_dual_p 3 * G s).trace.re +          (if s 0 then ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +          (if s 1 then ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * G s).trace.re else 0) +          (if s 2 then ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * G s).trace.re else 0)) := by        exact Finset.sum_congr rfl fun s _ => hsplit s      _ = _ := by        simp only [Finset.sum_add_distrib, ← Finset.mul_sum]        rw [← in767_originalproof_trace_matrix_sum, hsum, Matrix.mul_one]        rw [hmargin _ 0, hmargin _ 1, hmargin _ 2]  have hnonneg : 0 ≤ ∑ s, (in767_originalproof_dual_z s * G s).trace.re :=    Finset.sum_nonneg fun s _ => in767_originalproof_trace_psd (in767_originalproof_dual_all_psd s) (hG s)  rw [heq] at hnonneg  have := hcert  linarithprivate lemma in767_originalproof_original_dual_term0 : ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 0).trace.re < -(1/1000 : ℝ) := by  simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec1, in767_originalproof_dual_vec3,    Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,    Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]  simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,    Matrix.mul_diagonal, Matrix.diagonal_mul]  norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,    ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,    Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,    map_div₀, map_ofNat]  simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals num_ineqprivate lemma in767_originalproof_original_dual_term1 : ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 1).trace.re < -(1/1000 : ℝ) := by  simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec0, in767_originalproof_dual_vec3,    Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,    Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]  simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,    Matrix.mul_diagonal, Matrix.diagonal_mul]  norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,    ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,    Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,    map_div₀, map_ofNat]  simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals num_ineqprivate lemma in767_originalproof_original_dual_term2 : ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 2).trace.re < -(1/1000 : ℝ) := by  simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec2, in767_originalproof_dual_vec3,    Matrix.trace, Matrix.diag_apply, Matrix.mul_apply, Matrix.sub_apply,    Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]  simp only [ppt_qutrit_steered_effect, ppt_qutrit_steered_normalizer,    Matrix.mul_diagonal, Matrix.diagonal_mul]  norm_num [ppt_qutrit_steered_unnormalized_effect, ppt_qutrit_bell_state,    ppt_qutrit_bell_setting, ppt_qutrit_bell_vector,    Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, Fin.sum_univ_three, Fin.sum_univ_four,    map_div₀, map_ofNat]  simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals try simp only [show (0 : Fin 3) ≠ 1 from by decide, show (0 : Fin 3) ≠ 2 from by decide,    show (1 : Fin 3) ≠ 0 from by decide, show (1 : Fin 3) ≠ 2 from by decide,    show (2 : Fin 3) ≠ 0 from by decide, show (2 : Fin 3) ≠ 1 from by decide,    show (0 : Fin 4) ≠ 1 from by decide, show (0 : Fin 4) ≠ 2 from by decide, show (0 : Fin 4) ≠ 3 from by decide,    show (1 : Fin 4) ≠ 0 from by decide, show (1 : Fin 4) ≠ 2 from by decide, show (1 : Fin 4) ≠ 3 from by decide,    show (2 : Fin 4) ≠ 0 from by decide, show (2 : Fin 4) ≠ 1 from by decide, show (2 : Fin 4) ≠ 3 from by decide,    show (3 : Fin 4) ≠ 0 from by decide, show (3 : Fin 4) ≠ 1 from by decide, show (3 : Fin 4) ≠ 2 from by decide,    if_false, if_true] at *  all_goals norm_num [ppt_qutrit_bell_vector, Matrix.vecMulVec_apply, Matrix.cons_val_two, Matrix.cons_val_three,    Matrix.vecHead, Matrix.vecTail, Pi.star_apply, map_div₀, map_ofNat]  all_goals num_ineqprivate theorem in767_originalproof_original_dual_negative :    2 * (in767_originalproof_dual_p 3).trace.re +      ((in767_originalproof_dual_p 1 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 0).trace.re +      ((in767_originalproof_dual_p 0 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 1).trace.re +      ((in767_originalproof_dual_p 2 - in767_originalproof_dual_p 3) * ppt_qutrit_steered_effect 2).trace.re < 0 := by  have hconst : 2 * (in767_originalproof_dual_p 3).trace.re = (5929/2000000 : ℝ) := by    simp only [in767_originalproof_dual_p, in767_originalproof_dual_vec3, Matrix.trace, Matrix.diag_apply,      Matrix.vecMulVec_apply, Pi.star_apply, Fin.sum_univ_three]    norm_num [Matrix.cons_val_two, Matrix.vecHead, Matrix.vecTail, map_div₀, map_ofNat]  linarith [in767_originalproof_original_dual_term0, in767_originalproof_original_dual_term1, in767_originalproof_original_dual_term2]private theorem in767_originalproof_original_not_joint :    ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ,      (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧      ∀ j : Fin 3, (∑ s, if s j then G s else 0) = ppt_qutrit_steered_effect j :=  in767_originalproof_any_not_joint ppt_qutrit_steered_effect in767_originalproof_original_dual_negativetheorem ppt_qutrit_steered_effect_incompatible : ¬ ∃ G : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ, (∀ s, (G s).PosSemidef) ∧ (∑ s, G s = 1) ∧ ∀ j : Fin 3, (∑ s, if s j then G s else 0) = ppt_qutrit_steered_effect j := by  exact in767_originalproof_original_not_joint
See it in the graphDiscuss this resultChallenge it