AFTD Auto-Formalizing Theoretical Domains

ppt_qutrit_rational_binary_effect_valid

theoremverified

Each rational qutrit effect and its complement is positive semidefinite.

Statement

theorem ppt_qutrit_rational_binary_effect_valid : ∀ j, (ppt_qutrit_rational_binary_effect j).PosSemidef ∧ (1 - ppt_qutrit_rational_binary_effect j).PosSemidef
Source
Helper for OP-693 and the explicit candidate; rational LDL certificates are in experiment 22884.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

The proof, explained

To establish that each of the three rational qutrit binary effects E_j and its complement I - E_j is positive semidefinite, the proof provides explicit Cholesky-like L D Lᴴ factorizations for all six rational 3 × 3 matrices, where L is unit lower triangular and D is diagonal with strictly positive rational entries. The positive semidefiniteness of each diagonal matrix is verified entrywise, which implies positive semidefiniteness of L D Lᴴ by matrix congruence, and direct arithmetic computation confirms that L D Lᴴ matches the target matrix. Finally, the main validity theorem splits into the three cases for j ∈ {0, 1, 2}, pairing each effect with its complement via the established factorizations and entrywise complement identities.

  1. The matrix in767_effect0 is positive semidefinite.

    We certify positive semidefiniteness by exhibiting an explicit L D Lᴴ decomposition A * diagonal(d) * Aᴴ = in767_effect0, where A is a unit lower triangular matrix and d consists of three strictly positive rational numbers. The diagonal matrix diagonal(d) is positive semidefinite by Matrix.PosSemidef.diagonal, since its entries are non-negative reals by Complex.nonneg_iff. Matrix congruence ensures A * diagonal(d) * Aᴴ is positive semidefinite, and direct entrywise rational arithmetic verifies it equals in767_effect0.

    lines 9–19

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (-2086398000 / 1215916159), 1, 0; (3784160970 / 13375077749), (10180863183220951350 / 565705940444378591), 1]
      let d : Fin 3 → ℂ := ![(1215916159000 / 21192203043001), (51427812767670781000 / 25767942124793887753159), (56438373852318592032729620 / 517688283364522254480637141)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_effect0 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect0, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  2. The complement matrix in767_complement0 is positive semidefinite.

    Similarly, we certify that in767_complement0 is positive semidefinite via an L D Lᴴ decomposition with explicit unit lower triangular A and positive rational diagonal d. Matrix.PosSemidef.diagonal and Complex.nonneg_iff establish that diagonal(d) is positive semidefinite, congruence shows A * diagonal(d) * Aᴴ is positive semidefinite, and entrywise computation confirms equality with in767_complement0.

    lines 24–34

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (695466000000 / 6658762294667), 1, 0; (-1261386990000 / 73246385241337), (-3294979200237486925850000 / 423655460931576873495549779), 1]
      let d : Fin 3 → ℂ := ![(19976286884001 / 21192203043001), (115542398435884601862422667 / 141113842563662318833975667), (92911606330607461544304200260855949 / 387695183358672204406794566481739729)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_complement0 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement0, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  3. The matrix in767_effect1 is positive semidefinite.

    We prove in767_effect1 is positive semidefinite using its explicit L D Lᴴ decomposition. The diagonal matrix with entries d has strictly positive rational entries, so it is positive semidefinite by Matrix.PosSemidef.diagonal and Complex.nonneg_iff. By congruence, A * diagonal(d) * Aᴴ is positive semidefinite, and entrywise evaluation confirms it equals in767_effect1.

    lines 39–49

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; 0, 1, 0; 0, (-538284205680 / 13330922627), 1]
      let d : Fin 3 → ℂ := ![(316737473028500 / 1360728454130809), (605951028500 / 1360728454130809), (22999600761798881760 / 783309086562689695393)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_effect1 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect1, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  4. The complement matrix in767_complement1 is positive semidefinite.

    We certify that in767_complement1 is positive semidefinite via its L D Lᴴ decomposition. Positivity of the diagonal entries in d implies diagonal(d) is positive semidefinite by Matrix.PosSemidef.diagonal and Complex.nonneg_iff, congruence yields positive semidefiniteness of A * diagonal(d) * Aᴴ, and entrywise rational arithmetic confirms equality with in767_complement1.

    lines 54–64

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; 0, 1, 0; 0, (269142102840000 / 14961347534125399), 1]
      let d : Fin 3 → ℂ := ![(1043990981102309 / 1360728454130809), (1360122503102309 / 1360728454130809), (214732015594466991886032221 / 879110906169894176726673341)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_complement1 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement1, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  5. The matrix in767_effect2 is positive semidefinite.

    We prove in767_effect2 is positive semidefinite through its L D Lᴴ decomposition. The diagonal matrix diagonal(d) has positive rational entries, making it positive semidefinite by Matrix.PosSemidef.diagonal and Complex.nonneg_iff. Congruence implies A * diagonal(d) * Aᴴ is positive semidefinite, and entrywise verification matches in767_effect2.

    lines 69–79

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (2086398000 / 1215916159), 1, 0; (-3784160970 / 13375077749), (10180863183220951350 / 565705940444378591), 1]
      let d : Fin 3 → ℂ := ![(1215916159000 / 21192203043001), (51427812767670781000 / 25767942124793887753159), (56438373852318592032729620 / 517688283364522254480637141)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_effect2 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect2, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  6. The complement matrix in767_complement2 is positive semidefinite.

    We certify that in767_complement2 is positive semidefinite via an L D Lᴴ decomposition. The diagonal matrix diagonal(d) is positive semidefinite by Matrix.PosSemidef.diagonal and Complex.nonneg_iff, congruence ensures A * diagonal(d) * Aᴴ is positive semidefinite, and entrywise arithmetic confirms equality with in767_complement2.

    lines 84–94

    uses Matrix.PosSemidef.diagonal, Complex.nonneg_iff, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ

      let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (-695466000000 / 6658762294667), 1, 0; (1261386990000 / 73246385241337), (-3294979200237486925850000 / 423655460931576873495549779), 1]
      let d : Fin 3 → ℂ := ![(19976286884001 / 21192203043001), (115542398435884601862422667 / 141113842563662318833975667), (92911606330607461544304200260855949 / 387695183358672204406794566481739729)]
      have hd : (diagonal d).PosSemidef := by
        apply Matrix.PosSemidef.diagonal
        intro i
        fin_cases i <;> norm_num [d, Complex.nonneg_iff]
      have h := hd.mul_mul_conjTranspose_same A
      have hEq : A * diagonal d * Aᴴ = in767_complement2 := by
        ext i j
        fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement2, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]
      exact hEq ▸ h
  7. Subtracting in767_effect0 from the identity matrix yields in767_complement0.

    By extensionality across all pairs of indices and direct rational arithmetic using Matrix.one_apply, we verify entrywise that 1 - in767_effect0 = in767_complement0.

    lines 101–102

    uses Matrix.one_apply

      ext i j
      fin_cases i <;> fin_cases j <;> norm_num [in767_effect0, in767_complement0, Matrix.one_apply]
  8. Subtracting in767_effect1 from the identity matrix yields in767_complement1.

    By extensionality across all index pairs and direct rational arithmetic using Matrix.one_apply, we verify entrywise that 1 - in767_effect1 = in767_complement1.

    lines 105–106

    uses Matrix.one_apply

      ext i j
      fin_cases i <;> fin_cases j <;> norm_num [in767_effect1, in767_complement1, Matrix.one_apply]
  9. Subtracting in767_effect2 from the identity matrix yields in767_complement2.

    By extensionality across all index pairs and direct rational arithmetic using Matrix.one_apply, we verify entrywise that 1 - in767_effect2 = in767_complement2.

    lines 109–110

    uses Matrix.one_apply

      ext i j
      fin_cases i <;> fin_cases j <;> norm_num [in767_effect2, in767_complement2, Matrix.one_apply]
  10. For each index j ∈ {0, 1, 2}, both in767_rational_effect j and its complement 1 - in767_rational_effect j are positive semidefinite.

    We introduce j and split into cases j = 0, j = 1, and j = 2. In each case, we rewrite the effect and its complement using in767_rational_effect and the respective complement lemma (in767_comp0_eq, in767_comp1_eq, or in767_comp2_eq), and combine the positive semidefiniteness of the effect and its complement using And.intro on the corresponding precomputed theorems (such as in767_effect0_psd and in767_complement0_psd).

    lines 113–117

    uses in767_comp0_eq, in767_comp1_eq, in767_comp2_eq, in767_effect0_psd, in767_complement0_psd, in767_effect1_psd, in767_complement1_psd, in767_effect2_psd, in767_complement2_psd, And.intro

      intro j
      fin_cases j
      · simpa [in767_rational_effect, in767_comp0_eq] using And.intro in767_effect0_psd in767_complement0_psd
      · simpa [in767_rational_effect, in767_comp1_eq] using And.intro in767_effect1_psd in767_complement1_psd
      · simpa [in767_rational_effect, in767_comp2_eq] using And.intro in767_effect2_psd in767_complement2_psd
  11. For each j ∈ {0, 1, 2}, ppt_qutrit_rational_binary_effect j and its complement 1 - ppt_qutrit_rational_binary_effect j are positive semidefinite.

    The theorem follows immediately by exact in767_rational_effect_valid, as ppt_qutrit_rational_binary_effect is definitionally identical to in767_rational_effect.

    line 120

    uses in767_rational_effect_valid

      exact in767_rational_effect_valid
And.intro
Constructs a proof of the conjunction a ∧ b from a proof of a and a proof of b.
Complex.nonneg_iff
A complex number is non-negative in the complex order if and only if its imaginary part is zero and its real part is non-negative.
Fin.sum_univ_succ
A sum over Fin (n + 1) splits into the term at index 0 plus the sum over the remaining successor indices.
in767_comp0_eq
The difference between the 3 × 3 identity matrix and in767_effect0 equals in767_complement0.
in767_comp1_eq
The difference between the 3 × 3 identity matrix and in767_effect1 equals in767_complement1.
in767_comp2_eq
The difference between the 3 × 3 identity matrix and in767_effect2 equals in767_complement2.
in767_complement0_psd
The complement matrix in767_complement0 of the first effect is positive semidefinite.
in767_complement1_psd
The complement matrix in767_complement1 of the second effect is positive semidefinite.
in767_complement2_psd
The complement matrix in767_complement2 of the third effect is positive semidefinite.
in767_effect0_psd
The first rational effect matrix in767_effect0 is positive semidefinite.
in767_effect1_psd
The second rational effect matrix in767_effect1 is positive semidefinite.
in767_effect2_psd
The third rational effect matrix in767_effect2 is positive semidefinite.
in767_rational_effect_valid
For every index j ∈ {0, 1, 2}, both in767_rational_effect j and its complement 1 - in767_rational_effect j are positive semidefinite.
map_div₀
A group-with-zero homomorphism preserves division: f(a / b) = f(a) / f(b).
map_ofNat
A ring homomorphism preserves natural number literals.
Matrix.diagonal_apply
The (i, j)-th entry of diagonal(d) is d(i) if i = j and 0 otherwise.
Matrix.mul_apply
The (i, k)-th entry of a matrix product M * N is the sum of products of corresponding row and column entries.
Matrix.one_apply
The (i, j)-th entry of the identity matrix is 1 if i = j and 0 otherwise.
Matrix.PosSemidef.diagonal
A diagonal matrix whose diagonal entries are all non-negative is positive semidefinite.
Matrix.vecMul_diagonal
Multiplying a row vector v by a diagonal matrix with entries w scales each entry: (v * diagonal(w))(x) = v(x) * w(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 4000000private noncomputable def in767_effect0 : Matrix (Fin 3) (Fin 3) ℂ := !![(1215916159000 / 21192203043001), (-2086398000000 / 21192203043001), (1071090000 / 65981951167); (-2086398000000 / 21192203043001), (3622358659000 / 21192203043001), (532050000 / 65981951167); (1071090000 / 65981951167), (532050000 / 65981951167), (7650594020 / 10066309561)]private theorem in767_effect0_psd : in767_effect0.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (-2086398000 / 1215916159), 1, 0; (3784160970 / 13375077749), (10180863183220951350 / 565705940444378591), 1]  let d : Fin 3 → ℂ := ![(1215916159000 / 21192203043001), (51427812767670781000 / 25767942124793887753159), (56438373852318592032729620 / 517688283364522254480637141)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_effect0 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect0, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_complement0 : Matrix (Fin 3) (Fin 3) ℂ := !![(19976286884001 / 21192203043001), (2086398000000 / 21192203043001), (-1071090000 / 65981951167); (2086398000000 / 21192203043001), (17569844384001 / 21192203043001), (-532050000 / 65981951167); (-1071090000 / 65981951167), (-532050000 / 65981951167), (2415715541 / 10066309561)]private theorem in767_complement0_psd : in767_complement0.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (695466000000 / 6658762294667), 1, 0; (-1261386990000 / 73246385241337), (-3294979200237486925850000 / 423655460931576873495549779), 1]  let d : Fin 3 → ℂ := ![(19976286884001 / 21192203043001), (115542398435884601862422667 / 141113842563662318833975667), (92911606330607461544304200260855949 / 387695183358672204406794566481739729)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_complement0 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement0, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_effect1 : Matrix (Fin 3) (Fin 3) ℂ := !![(316737473028500 / 1360728454130809), 0, 0; 0, (605951028500 / 1360728454130809), (-76179480000 / 4236629775103); 0, (-76179480000 / 4236629775103), (488260819680 / 646346857849)]private theorem in767_effect1_psd : in767_effect1.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; 0, 1, 0; 0, (-538284205680 / 13330922627), 1]  let d : Fin 3 → ℂ := ![(316737473028500 / 1360728454130809), (605951028500 / 1360728454130809), (22999600761798881760 / 783309086562689695393)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_effect1 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect1, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_complement1 : Matrix (Fin 3) (Fin 3) ℂ := !![(1043990981102309 / 1360728454130809), 0, 0; 0, (1360122503102309 / 1360728454130809), (76179480000 / 4236629775103); 0, (76179480000 / 4236629775103), (158086038169 / 646346857849)]private theorem in767_complement1_psd : in767_complement1.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; 0, 1, 0; 0, (269142102840000 / 14961347534125399), 1]  let d : Fin 3 → ℂ := ![(1043990981102309 / 1360728454130809), (1360122503102309 / 1360728454130809), (214732015594466991886032221 / 879110906169894176726673341)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_complement1 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement1, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_effect2 : Matrix (Fin 3) (Fin 3) ℂ := !![(1215916159000 / 21192203043001), (2086398000000 / 21192203043001), (-1071090000 / 65981951167); (2086398000000 / 21192203043001), (3622358659000 / 21192203043001), (532050000 / 65981951167); (-1071090000 / 65981951167), (532050000 / 65981951167), (7650594020 / 10066309561)]private theorem in767_effect2_psd : in767_effect2.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (2086398000 / 1215916159), 1, 0; (-3784160970 / 13375077749), (10180863183220951350 / 565705940444378591), 1]  let d : Fin 3 → ℂ := ![(1215916159000 / 21192203043001), (51427812767670781000 / 25767942124793887753159), (56438373852318592032729620 / 517688283364522254480637141)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_effect2 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_effect2, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_complement2 : Matrix (Fin 3) (Fin 3) ℂ := !![(19976286884001 / 21192203043001), (-2086398000000 / 21192203043001), (1071090000 / 65981951167); (-2086398000000 / 21192203043001), (17569844384001 / 21192203043001), (-532050000 / 65981951167); (1071090000 / 65981951167), (-532050000 / 65981951167), (2415715541 / 10066309561)]private theorem in767_complement2_psd : in767_complement2.PosSemidef := by  let A : Matrix (Fin 3) (Fin 3) ℂ := !![1, 0, 0; (-695466000000 / 6658762294667), 1, 0; (1261386990000 / 73246385241337), (-3294979200237486925850000 / 423655460931576873495549779), 1]  let d : Fin 3 → ℂ := ![(19976286884001 / 21192203043001), (115542398435884601862422667 / 141113842563662318833975667), (92911606330607461544304200260855949 / 387695183358672204406794566481739729)]  have hd : (diagonal d).PosSemidef := by    apply Matrix.PosSemidef.diagonal    intro i    fin_cases i <;> norm_num [d, Complex.nonneg_iff]  have h := hd.mul_mul_conjTranspose_same A  have hEq : A * diagonal d * Aᴴ = in767_complement2 := by    ext i j    fin_cases i <;> fin_cases j <;> norm_num [A, d, in767_complement2, Matrix.mul_apply, Matrix.diagonal_apply, Matrix.vecMul_diagonal, map_div₀, map_ofNat, Fin.sum_univ_succ]  exact hEq ▸ hprivate noncomputable def in767_rational_effect (j : Fin 3) : Matrix (Fin 3) (Fin 3) ℂ :=  if j = 0 then in767_effect0 else if j = 1 then in767_effect1 else in767_effect2private lemma in767_comp0_eq : (1 : Matrix (Fin 3) (Fin 3) ℂ) - in767_effect0 = in767_complement0 := by  ext i j  fin_cases i <;> fin_cases j <;> norm_num [in767_effect0, in767_complement0, Matrix.one_apply]private lemma in767_comp1_eq : (1 : Matrix (Fin 3) (Fin 3) ℂ) - in767_effect1 = in767_complement1 := by  ext i j  fin_cases i <;> fin_cases j <;> norm_num [in767_effect1, in767_complement1, Matrix.one_apply]private lemma in767_comp2_eq : (1 : Matrix (Fin 3) (Fin 3) ℂ) - in767_effect2 = in767_complement2 := by  ext i j  fin_cases i <;> fin_cases j <;> norm_num [in767_effect2, in767_complement2, Matrix.one_apply]private theorem in767_rational_effect_valid : ∀ j, (in767_rational_effect j).PosSemidef ∧ (1 - in767_rational_effect j).PosSemidef := by  intro j  fin_cases j  · simpa [in767_rational_effect, in767_comp0_eq] using And.intro in767_effect0_psd in767_complement0_psd  · simpa [in767_rational_effect, in767_comp1_eq] using And.intro in767_effect1_psd in767_complement1_psd  · simpa [in767_rational_effect, in767_comp2_eq] using And.intro in767_effect2_psd in767_complement2_psdtheorem ppt_qutrit_rational_binary_effect_valid : ∀ j, (ppt_qutrit_rational_binary_effect j).PosSemidef ∧ (1 - ppt_qutrit_rational_binary_effect j).PosSemidef := by  exact in767_rational_effect_valid
See it in the graphDiscuss this resultChallenge it