ppt_qutrit_steered_normalizer_marginal_identity
The explicit inverse-square-root filter normalizes the reduced source state to the identity.
Statement
theorem ppt_qutrit_steered_normalizer_marginal_identity : let marginal : Matrix (Fin 3) (Fin 3) ℂ := fun x y => ∑ a : Fin 3, ppt_qutrit_bell_state (a,x) (a,y) ppt_qutrit_steered_normalizer * marginal * ppt_qutrit_steered_normalizer = 1
- Source
- Source-normalization helper for OP-693; see https://arxiv.org/abs/1405.4502.
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- ppt_qutrit_bell_stateThe explicit two-qutrit positive-partial-transpose state in the Bell-violation example.
- ppt_qutrit_steered_normalizerThe diagonal inverse square root of the second-qutrit reduced state.
- ppt_qutrit_bell_vectorFour explicit real vectors in two-qutrit space used in the PPT Bell-violation 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
The theorem establishes that conjugating the reduced state of the PPT entangled qutrit Bell state by its explicit inverse-square-root filter yields the 3 × 3 identity matrix. The proof first explicitly computes the reduced state (the partial trace over the first qutrit) by evaluating the sum across all nine matrix positions, showing it is diagonal with entries 3437/6884, 3437/6884, and 5/3442. It then constructs the normalizer matrix as the diagonal matrix whose entries are the reciprocal square roots of these diagonal values. Finally, it verifies entry-by-entry that the product of the normalizer, the reduced state, and the normalizer equals the identity matrix, reducing each diagonal entry to an algebraic identity on square roots.
The squares of √2, √3, and √131 in ℂ are 2, 3, and 131, and √2 ≠ 0 and √3 ≠ 0 in ℂ.
These preliminary identities evaluate the squares of the complex square roots √2, √3, and √131 using Real.sq_sqrt after verifying non-negativity of the radicands with norm_num. The non-zeroness of √2 and √3 follows from strict positivity of real square roots via ne_of_gt.
uses
Real.sq_sqrt,ne_of_gthave h2 : (Real.sqrt 2 : ℂ)^2=2 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤2 by norm_num) have h3 : (Real.sqrt 3 : ℂ)^2=3 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3 by norm_num) have h131 : (Real.sqrt (131 : ℝ) : ℂ)^2=131 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤131 by norm_num) have hn2 : (Real.sqrt 2 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<2))) have hn3 : (Real.sqrt 3 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<3)))
The reduced state (partial trace over the first qutrit) is the diagonal matrix diag(3437/6884, 3437/6884, 5/3442).
Matrix extensionality (ext x y) and exhaustive case analysis on index pairs (fin_cases) reduce the matrix equality to checking each of the 9 entries. Expanding the Bell state and vector definitions reveals that all off-diagonal entries sum to 0. For each of the three diagonal entries, field_simp clears denominators using the non-zeroness of √2 and √3, ring_nf expands the polynomial expressions, simp substitutes the squared radicals, and norm_num completes the arithmetic simplification to the stated rational entries.
uses
Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,Fin.sum_univ_three,Fin.sum_univ_four,Matrix.diagonal_apply,Complex.real_smul,map_ofNatext x y fin_cases x <;> fin_cases y <;> simp [ppt_qutrit_bell_state, ppt_qutrit_bell_vector, Matrix.sum_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, Fin.sum_univ_three, Fin.sum_univ_four, Matrix.diagonal_apply, Complex.real_smul, map_ofNat] <;> field_simp [hn2,hn3] <;> ring_nf <;> simp [h2,h3,h131] <;> norm_num
The normalization goal reduces to showing S * diag(3437/6884, 3437/6884, 5/3442) * S = 1, where S is the steered normalizer matrix.
Simplifying definitions with dsimp only and rewriting with the previously established marginal lemma in767_marginalproof_source_second_marginal replaces the marginal matrix M with its explicit diagonal form.
uses
in767_marginalproof_source_second_marginaldsimp only rw [in767_marginalproof_source_second_marginal]
The squares of √6884, √3437, √3442, and √5 in ℂ are their respective integers, and √3437 ≠ 0 and √5 ≠ 0 in ℂ.
Analogously to the earlier radical identities, Real.sq_sqrt computes the squares of the radicals appearing in the normalizer matrix entries, and ne_of_gt establishes that the denominators are non-zero.
uses
Real.sq_sqrt,ne_of_gthave h6884 : (Real.sqrt 6884 : ℂ)^2=6884 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤6884 by norm_num) have h3437 : (Real.sqrt 3437 : ℂ)^2=3437 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3437 by norm_num) have h3442 : (Real.sqrt 3442 : ℂ)^2=3442 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3442 by norm_num) have h5 : (Real.sqrt 5 : ℂ)^2=5 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤5 by norm_num) have hn3437 : (Real.sqrt 3437 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<3437))) have hn5 : (Real.sqrt 5 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<5)))
The scalar identities (√6884 / √3437) * (3437/6884) * (√6884 / √3437) = 1 and (√3442 / √5) * (5/3442) * (√3442 / √5) = 1 hold in ℂ.
For each diagonal entry factor, field_simp clears the denominators using the non-zeroness hypotheses, reducing the equation to an equality of squared radicals. linear_combination then proves the equality from the known values of their squares.
have hs0 : (Real.sqrt 6884 : ℂ) / (Real.sqrt 3437 : ℂ) * (3437/6884) * ((Real.sqrt 6884 : ℂ) / (Real.sqrt 3437 : ℂ)) = 1 := by field_simp [hn3437] linear_combination 3437*h6884-6884*h3437 have hs2 : (Real.sqrt 3442 : ℂ) / (Real.sqrt 5 : ℂ) * (5/3442) * ((Real.sqrt 3442 : ℂ) / (Real.sqrt 5 : ℂ)) = 1 := by field_simp [hn5] linear_combination 5*h3442-3442*h5
The matrix product S * diag(3437/6884, 3437/6884, 5/3442) * S equals the identity matrix.
By extensionality (ext i j) and exhaustive case analysis over Fin 3 × Fin 3 (fin_cases), each entry of the product is evaluated using definitions of matrix multiplication, diagonal matrices, and vector entries. Off-diagonal elements simplify directly to 0 via norm_num, while diagonal elements match the scalar normalization identities hs0 and hs2, rearranged via commutativity and associativity of multiplication (mul_comm, mul_left_comm, mul_assoc).
uses
Matrix.mul_apply,Fin.sum_univ_three,Matrix.diagonal_apply,Matrix.cons_val_zero,Matrix.cons_val_one,Matrix.cons_val_two,mul_comm,mul_left_comm,mul_assocext i j fin_cases i <;> fin_cases j <;> simp only [ppt_qutrit_steered_normalizer, Matrix.mul_apply, Fin.sum_univ_three, Matrix.diagonal_apply, Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two] <;> norm_num <;> first | exact hs0 | simpa [mul_comm,mul_left_comm,mul_assoc] using hs0 | exact hs2
The main theorem follows directly from the normalization lemma in767_marginalproof_source_normalizer_marginal.
The theorem statement is identical to the private lemma in767_marginalproof_source_normalizer_marginal, with the local variable M renamed to marginal. Invoking this lemma concludes the proof.
uses
in767_marginalproof_source_normalizer_marginalexact in767_marginalproof_source_normalizer_marginal
Real.sq_sqrt- For any non-negative real number x, the square of its square root is x.
ne_of_gt- If b < a in a preorder, then a ≠ b.
Matrix.sum_apply- The (i, j)-th entry of a sum of matrices is the sum of their (i, j)-th entries.
Matrix.smul_apply- The (i, j)-th entry of a scalar multiple of a matrix is the scalar multiple of that entry.
Matrix.vecMulVec_apply- The (i, j)-th entry of the outer product of two vectors w and v is w(i) * v(j).
Fin.sum_univ_three- A sum over Fin 3 equals the sum of the terms at indices 0, 1, and 2.
Fin.sum_univ_four- A sum over Fin 4 equals the sum of the terms at indices 0, 1, 2, and 3.
Matrix.diagonal_apply- The (i, j)-th entry of a diagonal matrix is d(i) when i = j and 0 otherwise.
Complex.real_smul- Real scalar multiplication on a complex number equals multiplication by the real number cast to ℂ.
map_ofNat- A ring homomorphism preserves natural number literals.
in767_marginalproof_source_second_marginal- The reduced state (second marginal) of the PPT qutrit Bell state is the diagonal matrix with entries 3437/6884, 3437/6884, and 5/3442.
Matrix.mul_apply- The (i, k)-th entry of a matrix product M * N is the sum ∑ j, M(i, j) * N(j, k).
Matrix.cons_val_zero- The 0th entry of a vector prepended with x is x.
Matrix.cons_val_one- The 1st entry of a vector prepended with x is the 0th entry of the tail.
Matrix.cons_val_two- The 2nd entry of a vector prepended with x is the head of the tail of the tail.
mul_comm- Multiplication in a commutative magma is commutative: a * b = b * a.
mul_left_comm- Multiplication in a commutative semigroup satisfies left-commutativity: a * (b * c) = b * (a * c).
mul_assoc- Multiplication in a semigroup is associative: (a * b) * c = a * (b * c).
in767_marginalproof_source_normalizer_marginal- Conjugating the reduced source state by the steered normalizer yields the identity matrix.
- The matrix extensionality and case analyses over all 9 entries of the 3 × 3 matrices are handled by chained automated tactics (fin_cases, simp, field_simp, ring_nf, norm_num), which evaluate the explicit arithmetic on all entries in bulk.
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_marginalproof_source_second_marginal : (fun x y : Fin 3 => ∑ i : Fin 3, ppt_qutrit_bell_state (i,x) (i,y)) = Matrix.diagonal ![(3437/6884 : ℂ), 3437/6884, 5/3442] := by have h2 : (Real.sqrt 2 : ℂ)^2=2 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤2 by norm_num) have h3 : (Real.sqrt 3 : ℂ)^2=3 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3 by norm_num) have h131 : (Real.sqrt (131 : ℝ) : ℂ)^2=131 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤131 by norm_num) have hn2 : (Real.sqrt 2 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<2))) have hn3 : (Real.sqrt 3 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<3))) ext x y fin_cases x <;> fin_cases y <;> simp [ppt_qutrit_bell_state, ppt_qutrit_bell_vector, Matrix.sum_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, Fin.sum_univ_three, Fin.sum_univ_four, Matrix.diagonal_apply, Complex.real_smul, map_ofNat] <;> field_simp [hn2,hn3] <;> ring_nf <;> simp [h2,h3,h131] <;> norm_numprivate lemma in767_marginalproof_source_normalizer_marginal : let M : Matrix (Fin 3) (Fin 3) ℂ := fun x y => ∑ i : Fin 3, ppt_qutrit_bell_state (i,x) (i,y) ppt_qutrit_steered_normalizer * M * ppt_qutrit_steered_normalizer = 1 := by dsimp only rw [in767_marginalproof_source_second_marginal] have h6884 : (Real.sqrt 6884 : ℂ)^2=6884 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤6884 by norm_num) have h3437 : (Real.sqrt 3437 : ℂ)^2=3437 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3437 by norm_num) have h3442 : (Real.sqrt 3442 : ℂ)^2=3442 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤3442 by norm_num) have h5 : (Real.sqrt 5 : ℂ)^2=5 := by exact_mod_cast Real.sq_sqrt (show (0:ℝ)≤5 by norm_num) have hn3437 : (Real.sqrt 3437 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<3437))) have hn5 : (Real.sqrt 5 : ℂ) ≠ 0 := by exact_mod_cast (ne_of_gt (Real.sqrt_pos.2 (by norm_num : (0:ℝ)<5))) have hs0 : (Real.sqrt 6884 : ℂ) / (Real.sqrt 3437 : ℂ) * (3437/6884) * ((Real.sqrt 6884 : ℂ) / (Real.sqrt 3437 : ℂ)) = 1 := by field_simp [hn3437] linear_combination 3437*h6884-6884*h3437 have hs2 : (Real.sqrt 3442 : ℂ) / (Real.sqrt 5 : ℂ) * (5/3442) * ((Real.sqrt 3442 : ℂ) / (Real.sqrt 5 : ℂ)) = 1 := by field_simp [hn5] linear_combination 5*h3442-3442*h5 ext i j fin_cases i <;> fin_cases j <;> simp only [ppt_qutrit_steered_normalizer, Matrix.mul_apply, Fin.sum_univ_three, Matrix.diagonal_apply, Matrix.cons_val_zero, Matrix.cons_val_one, Matrix.cons_val_two] <;> norm_num <;> first | exact hs0 | simpa [mul_comm,mul_left_comm,mul_assoc] using hs0 | exact hs2theorem ppt_qutrit_steered_normalizer_marginal_identity : let marginal : Matrix (Fin 3) (Fin 3) ℂ := fun x y => ∑ a : Fin 3, ppt_qutrit_bell_state (a,x) (a,y) ppt_qutrit_steered_normalizer * marginal * ppt_qutrit_steered_normalizer = 1 := by exact in767_marginalproof_source_normalizer_marginal