ppt_qutrit_bell_alice_binary_effects_valid
The three first-qutrit projectors used to steer the explicit source are valid binary effects.
Statement
theorem ppt_qutrit_bell_alice_binary_effects_valid : ∀ j : Fin 3, let A : Matrix (Fin 3) (Fin 3) ℂ := vecMulVec (ppt_qutrit_bell_setting j) (star (ppt_qutrit_bell_setting j)) A.PosSemidef ∧ (1-A).PosSemidef
- Source
- Source-specific helper for OP-693; see https://arxiv.org/abs/1405.4502.
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- ppt_qutrit_bell_settingThe three unit vectors defining the binary projective settings in the Bell example.
- Used by 2
- ppt_qutrit_steered_effect_all_proper_subspaces_compatibleEvery proper subspace compression of the three normalized steered effects has a joint parent.
- open_problem_693_three_dim_fewer_than_nineThere exists a natural number k strictly less than 9 such that has_subspace_compatible_incompatible_family 3 k holds, meaning there is a…
The proof, explained
Each measurement operator is an orthogonal projector constructed as the outer product of a unit vector with itself. Hence each operator is positive semidefinite and idempotent, which also forces its complement to be an orthogonal projector and therefore positive semidefinite.
Setting vectors are unit vectors.
Direct computation.
have h3 : (Real.sqrt 3 : ℂ)^2 = 3 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ) ≤ 3 by norm_num) have h21 : (Real.sqrt 21 : ℂ)^2 = 21 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ) ≤ 21 by norm_num) fin_cases j <;> simp [ppt_qutrit_bell_setting, dotProduct, Fin.sum_univ_three] <;> ring_nf <;> simp [h3,h21, map_ofNat] <;> norm_num
Each setting is valid.
Projection is positive semidefinite.
let v := ppt_qutrit_bell_setting j let A : Matrix (Fin 3) (Fin 3) ℂ := vecMulVec v (star v) have hA : A.PosSemidef := Matrix.posSemidef_vecMulVec_self_star v have hAsq : A*A=A := by dsimp [A] rw [Matrix.vecMulVec_mul_vecMulVec, in767_aliceproof_alice_setting_unit j, one_smul] have hQherm : (1-A).IsHermitian := Matrix.isHermitian_one.sub hA.isHermitian have hQsq : (1-A)*(1-A)=1-A := by calc (1-A)*(1-A) = 1-A-A+A*A := by noncomm_ring _ = 1-A := by rw [hAsq]; abel have hQ := Matrix.posSemidef_conjTranspose_mul_self (1-A) rw [hQherm.eq, hQsq] at hQ exact ⟨hA,hQ⟩
Conclusion for all settings.
Apply previous lemma.
intro j exact in767_aliceproof_alice_settings_valid j
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Matrixopen scoped BigOperators Matrix ComplexOrderset_option backward.isDefEq.respectTransparency falseset_option maxRecDepth 8192set_option maxHeartbeats 4000000set_option linter.unusedSimpArgs falseprivate lemma in767_aliceproof_alice_setting_unit (j : Fin 3) : star (ppt_qutrit_bell_setting j) ⬝ᵥ ppt_qutrit_bell_setting j = 1 := by have h3 : (Real.sqrt 3 : ℂ)^2 = 3 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ) ≤ 3 by norm_num) have h21 : (Real.sqrt 21 : ℂ)^2 = 21 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ) ≤ 21 by norm_num) fin_cases j <;> simp [ppt_qutrit_bell_setting, dotProduct, Fin.sum_univ_three] <;> ring_nf <;> simp [h3,h21, map_ofNat] <;> norm_numprivate lemma in767_aliceproof_alice_settings_valid (j : Fin 3) : let A : Matrix (Fin 3) (Fin 3) ℂ := vecMulVec (ppt_qutrit_bell_setting j) (star (ppt_qutrit_bell_setting j)) A.PosSemidef ∧ (1-A).PosSemidef := by let v := ppt_qutrit_bell_setting j let A : Matrix (Fin 3) (Fin 3) ℂ := vecMulVec v (star v) have hA : A.PosSemidef := Matrix.posSemidef_vecMulVec_self_star v have hAsq : A*A=A := by dsimp [A] rw [Matrix.vecMulVec_mul_vecMulVec, in767_aliceproof_alice_setting_unit j, one_smul] have hQherm : (1-A).IsHermitian := Matrix.isHermitian_one.sub hA.isHermitian have hQsq : (1-A)*(1-A)=1-A := by calc (1-A)*(1-A) = 1-A-A+A*A := by noncomm_ring _ = 1-A := by rw [hAsq]; abel have hQ := Matrix.posSemidef_conjTranspose_mul_self (1-A) rw [hQherm.eq, hQsq] at hQ exact ⟨hA,hQ⟩theorem ppt_qutrit_bell_alice_binary_effects_valid : ∀ j : Fin 3, let A : Matrix (Fin 3) (Fin 3) ℂ := vecMulVec (ppt_qutrit_bell_setting j) (star (ppt_qutrit_bell_setting j)) A.PosSemidef ∧ (1-A).PosSemidef := by intro j exact in767_aliceproof_alice_settings_valid j