AFTD Auto-Formalizing Theoretical Domains

qutrit_fixed_phase_schur_four_product_decomposition

theoremverified

A qutrit block with a real orthogonal complex spectral basis and a fixed-phase Schur vector has a four-term product decomposition.

Statement

theorem qutrit_fixed_phase_schur_four_product_decomposition :
  ∀ (B : Matrix (Fin 3) (Fin 3) ℂ) (u : Fin 3 → ℂ)
    (O : Matrix (Fin 3) (Fin 3) ℝ) (lam : Fin 3 → ℂ)
    (v0 : Fin 3 → ℝ) (gamma : ℂ),
    O.transpose * O = 1 → O * O.transpose = 1 →
    (∀ i j, B i j = ∑ k, (O i k : ℂ) * lam k * (O j k : ℂ)) →
    (∀ i, u i = gamma * (v0 i : ℂ)) →
    ∃ (v : Fin 4 → Fin 3 → ℂ) (a b : Fin 4 → ℂ),
      (∀ t i, star (v t i) = v t i) ∧
      (1 : Matrix (Fin 3) (Fin 3) ℂ) =
        ∑ t, (a t * star (a t)) • vecMulVec (v t) (star (v t)) ∧
      B = ∑ t, (a t * star (b t)) • vecMulVec (v t) (star (v t)) ∧
      Bᴴ * B + vecMulVec u (star u) =
        ∑ t, (b t * star (b t)) • vecMulVec (v t) (star (v t))
Source
Degenerate-branch helper for the rank-four source in OP-693.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 3

The proof, explained

The proof decomposes a 3 × 3 matrix B and a fixed-phase Schur vector u = γ v₀ into a four-term sum of real rank-one outer products ∑_{t=0}^3 c_t v_t v_tᵀ. The first three vectors v₀, v₁, v₂ are chosen as the orthonormal column vectors of the real orthogonal spectral basis O, while the fourth vector v₃ is set to the real Schur direction v₀. Choosing the coefficients a to be 1 on the first three indices and 0 on the fourth reproduces the identity matrix from the columns of O and selects the spectral decomposition for B when setting b_t = star(λ_t). Finally, setting b₃ = γ ensures that the first three terms sum to the Gram matrix Bᴴ B while the fourth term contributes |γ|² v₀ v₀ᵀ = u uᴴ.

  1. For any complex matrix Q satisfying Qᴴ = Qᵀ and Qᵀ * Q = 1, the matrix B = Q * diagonal lam * Qᵀ satisfies Bᴴ * B = Q * diagonal (fun k => star (lam k) * lam k) * Qᵀ.

    We simplify the definition of B and expand the conjugate transpose Bᴴ = (Q * diagonal lam * Qᵀ)ᴴ = (Qᵀ)ᴴ * (diagonal lam)ᴴ * Qᴴ. Using Qᴴ = Qᵀ and involution of conjugate transpose, (Qᵀ)ᴴ becomes Q, and the diagonal factor becomes diagonal (star lam). Multiplying on the right by B, the inner factor Qᵀ * Q simplifies to the identity matrix by the orthogonality hypothesis, and the two diagonal matrices combine entrywise into diagonal (fun k => star (lam k) * lam k).

    lines 10–18

    uses Matrix.conjTranspose_conjTranspose, Matrix.conjTranspose_mul, Matrix.diagonal_conjTranspose, Matrix.mul_assoc, Matrix.one_mul, Matrix.diagonal_mul_diagonal

      dsimp only
      have hreal' : Q.transposeᴴ = Q := by
        rw [← hreal, Matrix.conjTranspose_conjTranspose]
      rw [Matrix.conjTranspose_mul, Matrix.conjTranspose_mul, Matrix.diagonal_conjTranspose,
        hreal', hreal]
      simp only [Matrix.mul_assoc, ← Matrix.mul_assoc Q.transpose Q, horth, Matrix.one_mul]
      rw [← Matrix.mul_assoc (Matrix.diagonal (star lam)) (Matrix.diagonal lam) Q.transpose,
        Matrix.diagonal_mul_diagonal]
      rfl
  2. The complex embedding Q of the real orthogonal matrix O satisfies Qᴴ = Qᵀ and Qᵀ * Q = 1.

    We define Q by embedding the real entries of O into ℂ. Because every entry is real, complex conjugation acts as the identity, so Qᴴ = Qᵀ. Entrywise equality of Qᵀ * Q with the identity matrix follows from Oᵀ * O = 1: taking the (i, j) entry via congrArg and splitting into cases i = j (where the sum of squares is 1) and i ≠ j (where the sum of products is 0), casting from ℝ to ℂ yields Qᵀ * Q = 1.

    lines 34–46

    uses Matrix.conjTranspose_apply, Matrix.transpose_apply, congrArg, Matrix.mul_apply, Matrix.one_apply

      let Q : Matrix (Fin 3) (Fin 3) ℂ := fun i j => O i j
      have hQreal : Qᴴ = Q.transpose := by ext i j; simp [Q, Matrix.conjTranspose_apply, Matrix.transpose_apply]
      have hQorth : Q.transpose * Q = 1 := by
        ext i j
        have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) horth
        simp only [Matrix.mul_apply, Matrix.transpose_apply] at hh
        change (∑ k : Fin 3, (O k i : ℂ) * (O k j : ℂ)) = (1 : Matrix (Fin 3) (Fin 3) ℂ) i j
        by_cases hij : i=j
        · subst j
          have hh' : (∑ k : Fin 3, O k i * O k i) = (1 : ℝ) := by simpa [Matrix.one_apply] using hh
          simpa [Matrix.one_apply] using (show (∑ k : Fin 3, (O k i : ℂ) * (O k i : ℂ)) = 1 by exact_mod_cast hh')
        · have hh' : (∑ k : Fin 3, O k i * O k j) = (0 : ℝ) := by simpa [Matrix.one_apply,hij] using hh
          simpa [Matrix.one_apply,hij] using (show (∑ k : Fin 3, (O k i : ℂ) * (O k j : ℂ)) = 0 by exact_mod_cast hh')
  3. The matrix B equals Q * diagonal lam * Qᵀ, and its Gram matrix satisfies Bᴴ * B = Q * diagonal (fun k => star (lam k) * lam k) * Qᵀ.

    We write the entrywise spectral representation B i j = ∑ k, O i k * lam k * O j k in matrix form as B = Q * diagonal lam * Qᵀ by evaluating the matrix and diagonal product entrywise. Applying the helper lemma in767_fixedproof_fixed_spectral_square with the symmetry Qᴴ = Qᵀ and orthogonality Qᵀ * Q = 1 then immediately yields the formula for Bᴴ * B.

    lines 47–53

    uses Matrix.mul_apply, Matrix.mul_diagonal, Matrix.transpose_apply, in767_fixedproof_fixed_spectral_square

      have hBmat : B = Q*Matrix.diagonal lam*Q.transpose := by
        ext i j
        rw [Matrix.mul_apply]
        simpa only [Matrix.mul_diagonal, Matrix.transpose_apply, Q] using hB i j
      have hBsq : Bᴴ*B = Q * Matrix.diagonal (fun k => star (lam k) * lam k) * Q.transpose := by
        rw [hBmat]
        exact in767_fixedproof_fixed_spectral_square Q lam hQreal hQorth
  4. We define the four vectors v and coefficient vectors a and b, reducing the goal to four explicit conditions.

    We construct the four vectors v(t) for t ∈ {0, 1, 2, 3} by taking the first three to be the columns of O (v(t) i = O i t for t < 3) and the fourth to be the Schur direction v0 (v(3) i = v0 i). We set the weights a(t) to 1 for t < 3 and 0 for t = 3, and b(t) to star (lam t) for t < 3 and gamma for t = 3. Supplying these witnesses reduces the existential statement to four verification subgoals: reality of v, resolution of the identity, decomposition of B, and decomposition of Bᴴ * B + u uᴴ.

    lines 54–59

      let v : Fin 4 → Fin 3 → ℂ := fun t i =>
        if t=0 then O i 0 else if t=1 then O i 1 else if t=2 then O i 2 else v0 i
      let a : Fin 4 → ℂ := fun t => if t=3 then 0 else 1
      let b : Fin 4 → ℂ := fun t => if t=0 then star (lam 0) else if t=1 then star (lam 1)
        else if t=2 then star (lam 2) else gamma
      refine ⟨v,a,b,?_,?_,?_,?_⟩
  5. Every vector v(t) is real: star (v t i) = v t i for all t and i.

    We perform a finite case analysis on t ∈ {0, 1, 2, 3}. In each case, v(t) i is defined by embedding a real number—either an entry of the real matrix O or an entry of the real vector v0—into ℂ. Since complex conjugation fixes all real numbers, simplification verifies the identity in every case.

    lines 60–61

      · intro t i
        fin_cases t <;> simp [v]
  6. The identity matrix decomposes as ∑ t, (a t * star (a t)) • vecMulVec (v t) (star (v t)) = 1.

    We check entrywise equality at (i, j). From the co-orthogonality hypothesis O * Oᵀ = 1, the row sum ∑ k, O i k * O j k equals 1 when i = j and 0 when i ≠ j. In the sum over t ∈ Fin 4, the fourth term vanishes because a 3 = 0, and the first three terms have a t * star (a t) = 1, reducing the sum to the row inner product ∑ k, O i k * O j k = 1 i j.

    lines 62–73

    uses congrArg, Matrix.mul_apply, Matrix.transpose_apply, Fin.sum_univ_three, Matrix.one_apply, pow_two, Matrix.sum_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, Fin.sum_univ_four, Complex.real_smul, mul_comm, mul_left_comm, mul_assoc

      · ext i j
        have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) hcoorth
        simp only [Matrix.mul_apply, Matrix.transpose_apply, Fin.sum_univ_three] at hh
        have hh' : (∑ k : Fin 3, (O i k : ℂ)*(O j k : ℂ)) = (1 : Matrix (Fin 3) (Fin 3) ℂ) i j := by
          by_cases hij : i=j
          · subst j
            have hh' : (O i 0)^2+(O i 1)^2+(O i 2)^2 = (1:ℝ) := by simpa [Matrix.one_apply,pow_two] using hh
            simpa [Matrix.one_apply,Fin.sum_univ_three,pow_two] using (show (O i 0 : ℂ)^2+(O i 1 : ℂ)^2+(O i 2 : ℂ)^2=1 by exact_mod_cast hh')
          · have hh' : O i 0*O j 0+O i 1*O j 1+O i 2*O j 2=(0:ℝ) := by simpa [Matrix.one_apply,hij] using hh
            simpa [Matrix.one_apply,hij,Fin.sum_univ_three] using (show (O i 0 : ℂ)*(O j 0 : ℂ)+(O i 1 : ℂ)*(O j 1 : ℂ)+(O i 2 : ℂ)*(O j 2 : ℂ)=0 by exact_mod_cast hh')
        simpa [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,
          Fin.sum_univ_four,Fin.sum_univ_three,Complex.real_smul,mul_comm,mul_left_comm,mul_assoc] using hh'.symm
  7. The matrix B decomposes as ∑ t, (a t * star (b t)) • vecMulVec (v t) (star (v t)) = B.

    We check entrywise equality at (i, j). In the sum over t ∈ Fin 4, the t = 3 term vanishes because a 3 = 0. For t ∈ {0, 1, 2}, a t = 1 and b t = star (lam t), so a t * star (b t) = 1 * star (star (lam t)) = lam t. The sum therefore simplifies to ∑ k, O i k * lam k * O j k, which matches B i j by the spectral assumption hB.

    lines 74–76

    uses Matrix.sum_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, Fin.sum_univ_four, Fin.sum_univ_three, Complex.real_smul, mul_comm, mul_left_comm, mul_assoc

      · ext i j
        simpa [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,
          Fin.sum_univ_four,Fin.sum_univ_three,Complex.real_smul,mul_comm,mul_left_comm,mul_assoc] using hB i j
  8. The perturbed Gram matrix decomposes as ∑ t, (b t * star (b t)) • vecMulVec (v t) (star (v t)) = Bᴴ * B + vecMulVec u (star u).

    We verify entrywise equality at (i, j). From the spectral formula for Bᴴ * B, the (i, j) entry of Bᴴ * B is ∑ k, O i k * (star (lam k) * lam k) * O j k. In the sum over t ∈ Fin 4, the first three terms t ∈ {0, 1, 2} have b t * star (b t) = star (lam t) * lam t and v(t) = O(·, t), reproducing (Bᴴ * B) i j. The fourth term t = 3 has b 3 * star (b 3) = gamma * star gamma and v(3) = v0, producing (gamma * v0 i) * star (gamma * v0 j) = u i * star (u j) = (vecMulVec u (star u)) i j, which matches the second summand.

    lines 77–87

    uses congrArg, Matrix.mul_apply, Matrix.mul_diagonal, Matrix.transpose_apply, Fin.sum_univ_three, Matrix.sum_apply, Matrix.smul_apply, Matrix.vecMulVec_apply, Fin.sum_univ_four, Complex.real_smul, Matrix.add_apply, mul_comm, mul_left_comm, mul_assoc

      · ext i j
        have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℂ => M i j) hBsq
        have hm : (Q * Matrix.diagonal (fun k => star (lam k)*lam k) * Q.transpose) i j =
            ∑ k : Fin 3, (O i k : ℂ) * (star (lam k)*lam k) * (O j k : ℂ) := by
          rw [Matrix.mul_apply]
          simp only [Matrix.mul_diagonal, Matrix.transpose_apply, Q]
        rw [hm] at hh
        simp only [Fin.sum_univ_three] at hh
        simp [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,
          Fin.sum_univ_four,Complex.real_smul,hu,Matrix.add_apply, hh,
          mul_comm,mul_left_comm,mul_assoc]
  9. The theorem qutrit_fixed_phase_schur_four_product_decomposition holds for any block B, Schur vector u = gamma * v0, and real orthogonal basis O.

    We introduce the parameters B, u, O, lam, v0, gamma along with the hypotheses that O is orthogonal and co-orthogonal, B has spectral basis O with eigenvalues lam, and u has fixed phase along v0. We then conclude immediately by invoking the expansion lemma in767_fixedproof_fixed_phase_product_expansion.

    lines 103–104

    uses in767_fixedproof_fixed_phase_product_expansion

      intro B u O lam v0 gamma horth hcoorth hB hu
      exact in767_fixedproof_fixed_phase_product_expansion B u O lam v0 gamma horth hcoorth hB hu
Fin.sum_univ_four
A summation over Fin 4 expands to the sum of the four terms at indices 0, 1, 2, and 3.
Fin.sum_univ_three
A summation over Fin 3 expands to the sum of the three terms at indices 0, 1, and 2.
Matrix.conjTranspose_conjTranspose
The conjugate transpose of the conjugate transpose of a matrix is the original matrix: (Mᴴ)ᴴ = M.
Matrix.conjTranspose_mul
The conjugate transpose of a matrix product is the product of conjugate transposes in reverse order: (M * N)ᴴ = Nᴴ * Mᴴ.
Matrix.diagonal_conjTranspose
The conjugate transpose of a diagonal matrix is the diagonal matrix of the entrywise complex conjugates.
Matrix.diagonal_mul_diagonal
The product of two diagonal matrices is the diagonal matrix of the entrywise product of their diagonal elements.
Matrix.mul_assoc
Matrix multiplication is associative: (L * M) * N = L * (M * N).
Matrix.one_mul
Multiplying a matrix on the left by the identity matrix leaves it unchanged: 1 * M = M.
Matrix.conjTranspose_apply
The (j, i) entry of the conjugate transpose of M is the complex conjugate of M i j.
Matrix.transpose_apply
The (i, j) entry of the transpose of M is M j i.
congrArg
Applying a function to equal arguments yields equal values: if a = b then f a = f b.
Matrix.mul_apply
The (i, k) entry of the matrix product M * N is the sum ∑ j, M i j * N j k.
Matrix.one_apply
The (i, j) entry of the identity matrix is 1 if i = j and 0 otherwise.
Matrix.mul_diagonal
The (i, j) entry of a matrix multiplied on the right by a diagonal matrix d is M i j * d j.
pow_two
The square of an element equals the element multiplied by itself: a ^ 2 = a * a.
Matrix.sum_apply
The (i, j) entry of a finite sum of matrices is the sum of their (i, j) entries.
Matrix.smul_apply
The (i, j) entry of a scalar multiple r • A is r • (A i j).
Matrix.vecMulVec_apply
The (i, j) entry of the outer product vector matrix vecMulVec w v is w i * v j.
Complex.real_smul
Real scalar multiplication on a complex number coincides with multiplication by the real scalar cast to ℂ: x • z = ↑x * z.
mul_comm
Multiplication is commutative: a * b = b * a.
mul_left_comm
Multiplication satisfies the left-commutativity identity: a * (b * c) = b * (a * c).
mul_assoc
Multiplication is associative: a * b * c = a * (b * c).
Matrix.add_apply
The (i, j) entry of the sum of two matrices is the sum of their (i, j) entries: (A + B) i j = A i j + B i j.
in767_fixedproof_fixed_spectral_square
For a matrix Q satisfying Qᴴ = Qᵀ and Qᵀ * Q = 1, the Gram matrix of B = Q * diagonal lam * Qᵀ is Bᴴ * B = Q * diagonal (|lam|²) * Qᵀ.
in767_fixedproof_fixed_phase_product_expansion
A 3 × 3 matrix B with real orthogonal complex spectral basis and a fixed-phase Schur vector u admits a four-term product decomposition.

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 BigOperators Matrix ComplexOrderset_option backward.isDefEq.respectTransparency falseset_option linter.unusedSimpArgs falseprivate lemma in767_fixedproof_fixed_spectral_square    (Q : Matrix (Fin 3) (Fin 3) ℂ) (lam : Fin 3 → ℂ)    (hreal : Qᴴ = Q.transpose) (horth : Q.transpose * Q = 1) :    let B := Q * Matrix.diagonal lam * Q.transpose    Bᴴ * B = Q * Matrix.diagonal (fun k => star (lam k) * lam k) * Q.transpose := by  dsimp only  have hreal' : Q.transposeᴴ = Q := by    rw [← hreal, Matrix.conjTranspose_conjTranspose]  rw [Matrix.conjTranspose_mul, Matrix.conjTranspose_mul, Matrix.diagonal_conjTranspose,    hreal', hreal]  simp only [Matrix.mul_assoc, ← Matrix.mul_assoc Q.transpose Q, horth, Matrix.one_mul]  rw [← Matrix.mul_assoc (Matrix.diagonal (star lam)) (Matrix.diagonal lam) Q.transpose,    Matrix.diagonal_mul_diagonal]  rflprivate lemma in767_fixedproof_fixed_phase_product_expansion    (B : Matrix (Fin 3) (Fin 3) ℂ) (u : Fin 3 → ℂ)    (O : Matrix (Fin 3) (Fin 3) ℝ) (lam : Fin 3 → ℂ)    (v0 : Fin 3 → ℝ) (gamma : ℂ)    (horth : O.transpose * O = 1) (hcoorth : O * O.transpose = 1)    (hB : ∀ i j, B i j = ∑ k, (O i k : ℂ) * lam k * (O j k : ℂ))    (hu : ∀ i, u i = gamma * (v0 i : ℂ)) :    ∃ (v : Fin 4 → Fin 3 → ℂ) (a b : Fin 4 → ℂ),      (∀ t i, star (v t i) = v t i) ∧      (1 : Matrix (Fin 3) (Fin 3) ℂ) =        ∑ t, (a t * star (a t)) • vecMulVec (v t) (star (v t)) ∧      B = ∑ t, (a t * star (b t)) • vecMulVec (v t) (star (v t)) ∧      Bᴴ * B + vecMulVec u (star u) =        ∑ t, (b t * star (b t)) • vecMulVec (v t) (star (v t)) := by  let Q : Matrix (Fin 3) (Fin 3) ℂ := fun i j => O i j  have hQreal : Qᴴ = Q.transpose := by ext i j; simp [Q, Matrix.conjTranspose_apply, Matrix.transpose_apply]  have hQorth : Q.transpose * Q = 1 := by    ext i j    have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) horth    simp only [Matrix.mul_apply, Matrix.transpose_apply] at hh    change (∑ k : Fin 3, (O k i : ℂ) * (O k j : ℂ)) = (1 : Matrix (Fin 3) (Fin 3) ℂ) i j    by_cases hij : i=j    · subst j      have hh' : (∑ k : Fin 3, O k i * O k i) = (1 : ℝ) := by simpa [Matrix.one_apply] using hh      simpa [Matrix.one_apply] using (show (∑ k : Fin 3, (O k i : ℂ) * (O k i : ℂ)) = 1 by exact_mod_cast hh')    · have hh' : (∑ k : Fin 3, O k i * O k j) = (0 : ℝ) := by simpa [Matrix.one_apply,hij] using hh      simpa [Matrix.one_apply,hij] using (show (∑ k : Fin 3, (O k i : ℂ) * (O k j : ℂ)) = 0 by exact_mod_cast hh')  have hBmat : B = Q*Matrix.diagonal lam*Q.transpose := by    ext i j    rw [Matrix.mul_apply]    simpa only [Matrix.mul_diagonal, Matrix.transpose_apply, Q] using hB i j  have hBsq : Bᴴ*B = Q * Matrix.diagonal (fun k => star (lam k) * lam k) * Q.transpose := by    rw [hBmat]    exact in767_fixedproof_fixed_spectral_square Q lam hQreal hQorth  let v : Fin 4 → Fin 3 → ℂ := fun t i =>    if t=0 then O i 0 else if t=1 then O i 1 else if t=2 then O i 2 else v0 i  let a : Fin 4 → ℂ := fun t => if t=3 then 0 else 1  let b : Fin 4 → ℂ := fun t => if t=0 then star (lam 0) else if t=1 then star (lam 1)    else if t=2 then star (lam 2) else gamma  refine ⟨v,a,b,?_,?_,?_,?_⟩  · intro t i    fin_cases t <;> simp [v]  · ext i j    have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) hcoorth    simp only [Matrix.mul_apply, Matrix.transpose_apply, Fin.sum_univ_three] at hh    have hh' : (∑ k : Fin 3, (O i k : ℂ)*(O j k : ℂ)) = (1 : Matrix (Fin 3) (Fin 3) ℂ) i j := by      by_cases hij : i=j      · subst j        have hh' : (O i 0)^2+(O i 1)^2+(O i 2)^2 = (1:ℝ) := by simpa [Matrix.one_apply,pow_two] using hh        simpa [Matrix.one_apply,Fin.sum_univ_three,pow_two] using (show (O i 0 : ℂ)^2+(O i 1 : ℂ)^2+(O i 2 : ℂ)^2=1 by exact_mod_cast hh')      · have hh' : O i 0*O j 0+O i 1*O j 1+O i 2*O j 2=(0:ℝ) := by simpa [Matrix.one_apply,hij] using hh        simpa [Matrix.one_apply,hij,Fin.sum_univ_three] using (show (O i 0 : ℂ)*(O j 0 : ℂ)+(O i 1 : ℂ)*(O j 1 : ℂ)+(O i 2 : ℂ)*(O j 2 : ℂ)=0 by exact_mod_cast hh')    simpa [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,      Fin.sum_univ_four,Fin.sum_univ_three,Complex.real_smul,mul_comm,mul_left_comm,mul_assoc] using hh'.symm  · ext i j    simpa [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,      Fin.sum_univ_four,Fin.sum_univ_three,Complex.real_smul,mul_comm,mul_left_comm,mul_assoc] using hB i j  · ext i j    have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℂ => M i j) hBsq    have hm : (Q * Matrix.diagonal (fun k => star (lam k)*lam k) * Q.transpose) i j =        ∑ k : Fin 3, (O i k : ℂ) * (star (lam k)*lam k) * (O j k : ℂ) := by      rw [Matrix.mul_apply]      simp only [Matrix.mul_diagonal, Matrix.transpose_apply, Q]    rw [hm] at hh    simp only [Fin.sum_univ_three] at hh    simp [v,a,b,Matrix.sum_apply,Matrix.smul_apply,Matrix.vecMulVec_apply,      Fin.sum_univ_four,Complex.real_smul,hu,Matrix.add_apply, hh,      mul_comm,mul_left_comm,mul_assoc]theorem qutrit_fixed_phase_schur_four_product_decomposition :  ∀ (B : Matrix (Fin 3) (Fin 3) ℂ) (u : Fin 3 → ℂ)    (O : Matrix (Fin 3) (Fin 3) ℝ) (lam : Fin 3 → ℂ)    (v0 : Fin 3 → ℝ) (gamma : ℂ),    O.transpose * O = 1 → O * O.transpose = 1 →    (∀ i j, B i j = ∑ k, (O i k : ℂ) * lam k * (O j k : ℂ)) →    (∀ i, u i = gamma * (v0 i : ℂ)) →    ∃ (v : Fin 4 → Fin 3 → ℂ) (a b : Fin 4 → ℂ),      (∀ t i, star (v t i) = v t i) ∧      (1 : Matrix (Fin 3) (Fin 3) ℂ) =        ∑ t, (a t * star (a t)) • vecMulVec (v t) (star (v t)) ∧      B = ∑ t, (a t * star (b t)) • vecMulVec (v t) (star (v t)) ∧      Bᴴ * B + vecMulVec u (star u) =        ∑ t, (b t * star (b t)) • vecMulVec (v t) (star (v t)) := by  intro B u O lam v0 gamma horth hcoorth hB hu  exact in767_fixedproof_fixed_phase_product_expansion B u O lam v0 gamma horth hcoorth hB hu
See it in the graphDiscuss this resultChallenge it