qutrit_ppt_full_rank_gram_normalization
A PPT-invariant 3-by-2 four-column Gram factor with a full-row-rank upper block has a normalized PPT-invariant factor and a map recovering the original, conditional on real positive-block normalization.
Statement
theorem qutrit_ppt_full_rank_gram_normalization (G : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, (G*Gᴴ) (i,p) (j,q) = (G*Gᴴ) (j,p) (i,q)) (hrank : (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t; U.rank = 3)) (hnorm : ∀ R : Matrix (Fin 3) (Fin 3) ℝ, R.PosDef → ∃ H : Matrix (Fin 3) (Fin 3) ℝ, H.transpose = H ∧ IsUnit H ∧ H*R*H = 1) : ∃ (F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (T : Matrix (Fin 3) (Fin 3) ℂ), (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => F (i,0) t; U*Uᴴ = 1) ∧ (∀ i j : Fin 3, ∀ p q : Fin 2, (F*Fᴴ) (i,p) (j,q) = (F*Fᴴ) (j,p) (i,q)) ∧ (∀ i : Fin 3, ∀ p : Fin 2, ∀ t : Fin 4, G (i,p) t = ∑ a : Fin 3, T i a * F (a,p) t)
- Source
- Source-normalization helper for OP-693.
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- FThe prime field $\mathrm{GF}(p)$, realized as $\mathbb{Z}/p\mathbb{Z}$ via
ZMod.
- FThe prime field $\mathrm{GF}(p)$, realized as $\mathbb{Z}/p\mathbb{Z}$ via
The proof, explained
test summary of the proof sketch which is not a placeholder
step 1
step 1 explanation
intro a c p q apply Finset.sum_congr rfl intro x hx apply Finset.sum_congr rfl intro y hy rw [hpt a c x y]
step 2
step 2 explanation
intro a c p q rw [Finset.sum_comm] apply Finset.sum_congr rfl intro i hi apply Finset.sum_congr rfl intro j hj rw [hpt i j p q] ring
step 3
step 3 explanation
constructor · ext i j exact hpt j i 0 1 · intro i j p calc star (X (i,p) (j,p)) = X (j,p) (i,p) := hX.apply (j,p) (i,p) _ = X (i,p) (j,p) := hpt j i p p
step 4
step 4 explanation
simp [Matrix.mulVec, dotProduct, Fin.sum_univ_three, Fin.sum_univ_four, star_mul, star_sum] ring
step 5
step 5 explanation
simp [Matrix.mul_apply, Matrix.conjTranspose_apply, Fin.sum_univ_three, Fin.sum_univ_four, star_mul] ring
step 6
step 6 explanation
let U0 : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t let C : Matrix (Fin 3) (Fin 3) ℂ := U0*U0ᴴ let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => (C i j).re have hX : (G*Gᴴ).IsHermitian := Matrix.isHermitian_mul_conjTranspose_self G obtain ⟨_, hreal⟩ := in767_ranknormalize_pt_hermitian_blocks (G*Gᴴ) hX hpt have hCreal : ∀ i j, star (C i j) = C i j := by intro i j simpa [C, U0, Matrix.mul_apply, Matrix.conjTranspose_apply] using hreal i j 0 have hR : R.map (algebraMap ℝ ℂ) = C := by ext i j have hh := hCreal i j apply Complex.ext <;> simp [R, Complex.ext_iff] at hh ⊢ <;> linarith obtain ⟨H, hHsym, hHunit, hH⟩ := hnorm R hpos obtain ⟨Hu, hHu⟩ := hHunit let J : Matrix (Fin 3) (Fin 3) ℝ := ↑(Hu⁻¹) have hJH : J * H = 1 := by rw [← hHu] exact Units.inv_mul Hu let E : Matrix (Fin 3) (Fin 3) ℂ := H.map (algebraMap ℝ ℂ) let D : Matrix (Fin 3) (Fin 3) ℂ := J.map (algebraMap ℝ ℂ) have hDE : D * E = 1 := by have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M.map (algebraMap ℝ ℂ)) hJH simp only [Matrix.map_mul, Matrix.map_one, map_zero, map_one] at hh exact hh have hEreal : ∀ i j, star (E i j) = E i j := by intro i j; simp [E] have hEherm : Eᴴ = E := by ext i j have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) hHsym simpa [E, Matrix.conjTranspose_apply, Matrix.transpose_apply] using congrArg (algebraMap ℝ ℂ) hh have hEC : E*C*E = 1 := by have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M.map (algebraMap ℝ ℂ)) hH simp only [Matrix.map_mul, Matrix.map_one, map_zero, map_one] at hh change E * (R.map (algebraMap ℝ ℂ)) * E = 1 at hh rw [hR] at hh exact hh let F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ := fun ip t => ∑ i : Fin 3, E ip.1 i * G (i,ip.2) t let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => F (i,0) t have hUF : U = E*U0 := by ext i t; simp [U, F, U0, Matrix.mul_apply] refine ⟨F, D, ?_, ?_, ?_⟩ · change U * Uᴴ = 1 rw [hUF, Matrix.conjTranspose_mul, hEherm] simpa [C, Matrix.mul_assoc] using hEC · intro i j p q have hcongr (i j : Fin 3) (p q : Fin 2) : (F*Fᴴ) (i,p) (j,q) = ∑ a : Fin 3, ∑ b : Fin 3, E i a * (G*Gᴴ) (a,p) (b,q) * E j b := by change (∑ t : Fin 4, (∑ a : Fin 3, E i a * G (a,p) t) * star (∑ b : Fin 3, E j b * G (b,q) t)) = _ rw [in767_ranknormalize_four_column_gram_congruence] simp only [hEreal] rw [hcongr, hcongr] exact in767_ranknormalize_ppt_under_real_first_filter (G*Gᴴ) E hpt i j p q · intro i p t let Y : Matrix (Fin 3) (Fin 4) ℂ := fun j t => G (j,p) t change Y i t = (D * (E * Y)) i t rw [← Matrix.mul_assoc, hDE, Matrix.one_mul]
step 7
step 7 explanation
let C : Matrix (Fin 3) (Fin 3) ℂ := U*Uᴴ let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => (C i j).re have hC : C.PosDef := Matrix.PosDef.mul_conjTranspose_self U hinj have hRherm : R.IsHermitian := by apply Matrix.IsHermitian.ext intro i j have hh := congrArg Complex.re (hC.isHermitian.apply i j) simpa [R, C] using hh apply Matrix.PosDef.of_dotProduct_mulVec_pos hRherm intro x hx let xc : Fin 3 → ℂ := fun i => x i have hxc : xc ≠ 0 := by intro h apply hx ext i have hh := congrFun h i change (x i : ℂ) = 0 at hh exact_mod_cast hh have hp := (Complex.pos_iff.mp (hC.dotProduct_mulVec_pos hxc)).1 have heq : star x ⬝ᵥ (R *ᵥ x) = (star xc ⬝ᵥ (C *ᵥ xc)).re := by simp [dotProduct, Matrix.mulVec, Fin.sum_univ_three, Complex.mul_re, R, xc] rw [heq] exact hp
step 8
step 8 explanation
let f := U.transpose.mulVecLin have hdim : Module.finrank ℂ (Fin 3 → ℂ) = 3 := by simp [Module.finrank_pi] have hrange : Module.finrank ℂ (LinearMap.range f) = 3 := by change U.transpose.rank = 3 rw [Matrix.rank_transpose] exact hrank have hk := LinearMap.finrank_range_add_finrank_ker f rw [hrange, hdim] at hk have hker : LinearMap.ker f = ⊥ := Submodule.finrank_eq_zero.mp (by omega) have hf : Function.Injective f := LinearMap.ker_eq_bot.mp hker intro x y h apply hf simpa [f, Matrix.mulVec_transpose] using h
step 9
step 9 explanation
let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t have hinj : Function.Injective U.vecMul := in767_ranknormalize_full_row_rank_vecmul_injective U hrank have hpos := in767_ranknormalize_real_gram_positive U hinj exact in767_ranknormalize_normalize_pt_gram_factor G hpt hpos hnorm
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 linter.unusedSimpArgs falseset_option linter.unnecessarySeqFocus falseprivate lemma in767_ranknormalize_ppt_under_second_factor {n m : ℕ} (ρ : Matrix (Fin 3 × Fin n) (Fin 3 × Fin n) ℂ) (W : Matrix (Fin n) (Fin m) ℂ) (hpt : ∀ a c : Fin 3, ∀ x y : Fin n, ρ (a,x) (c,y) = ρ (c,x) (a,y)) : ∀ a c : Fin 3, ∀ p q : Fin m, (∑ x : Fin n, ∑ y : Fin n, star (W x p) * ρ (a,x) (c,y) * W y q) = ∑ x : Fin n, ∑ y : Fin n, star (W x p) * ρ (c,x) (a,y) * W y q := by intro a c p q apply Finset.sum_congr rfl intro x hx apply Finset.sum_congr rfl intro y hy rw [hpt a c x y]private lemma in767_ranknormalize_ppt_under_real_first_filter {m : ℕ} (ρ : Matrix (Fin 3 × Fin m) (Fin 3 × Fin m) ℂ) (H : Matrix (Fin 3) (Fin 3) ℂ) (hpt : ∀ i j : Fin 3, ∀ p q : Fin m, ρ (i,p) (j,q) = ρ (j,p) (i,q)) : ∀ a c : Fin 3, ∀ p q : Fin m, (∑ i : Fin 3, ∑ j : Fin 3, H a i * ρ (i,p) (j,q) * H c j) = ∑ i : Fin 3, ∑ j : Fin 3, H c i * ρ (i,p) (j,q) * H a j := by intro a c p q rw [Finset.sum_comm] apply Finset.sum_congr rfl intro i hi apply Finset.sum_congr rfl intro j hj rw [hpt i j p q] ringprivate lemma in767_ranknormalize_pt_hermitian_blocks (X : Matrix (Fin 3 × Fin 2) (Fin 3 × Fin 2) ℂ) (hX : X.IsHermitian) (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, X (i,p) (j,q) = X (j,p) (i,q)) : (let B : Matrix (Fin 3) (Fin 3) ℂ := fun i j => X (i,0) (j,1); B.transpose = B) ∧ (∀ i j : Fin 3, ∀ p : Fin 2, star (X (i,p) (j,p)) = X (i,p) (j,p)) := by constructor · ext i j exact hpt j i 0 1 · intro i j p calc star (X (i,p) (j,p)) = X (j,p) (i,p) := hX.apply (j,p) (i,p) _ = X (i,p) (j,p) := hpt j i p pprivate lemma in767_ranknormalize_bipartite_product_congruence (T : Matrix (Fin 3) (Fin 3) ℂ) (v : Fin 4 → Fin 3 → ℂ) (z : Fin 4 → Fin 2 → ℂ) (i j : Fin 3) (p q : Fin 2) : (∑ a : Fin 3, ∑ b : Fin 3, T i a * (∑ t : Fin 4, (v t a * z t p) * star (v t b * z t q)) * star (T j b)) = ∑ t : Fin 4, ((T *ᵥ v t) i * z t p) * star ((T *ᵥ v t) j * z t q) := by simp [Matrix.mulVec, dotProduct, Fin.sum_univ_three, Fin.sum_univ_four, star_mul, star_sum] ringprivate lemma in767_ranknormalize_four_column_gram_congruence (T : Matrix (Fin 3) (Fin 3) ℂ) (F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (i j : Fin 3) (p q : Fin 2) : (∑ t : Fin 4, (∑ a : Fin 3, T i a * F (a,p) t) * star (∑ b : Fin 3, T j b * F (b,q) t)) = ∑ a : Fin 3, ∑ b : Fin 3, T i a * (F*Fᴴ) (a,p) (b,q) * star (T j b) := by simp [Matrix.mul_apply, Matrix.conjTranspose_apply, Fin.sum_univ_three, Fin.sum_univ_four, star_mul] ringprivate lemma in767_ranknormalize_normalize_pt_gram_factor (G : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, (G*Gᴴ) (i,p) (j,q) = (G*Gᴴ) (j,p) (i,q)) (hpos : (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => ((U*Uᴴ) i j).re R.PosDef)) (hnorm : ∀ R : Matrix (Fin 3) (Fin 3) ℝ, R.PosDef → ∃ H : Matrix (Fin 3) (Fin 3) ℝ, H.transpose = H ∧ IsUnit H ∧ H*R*H = 1) : ∃ (F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (T : Matrix (Fin 3) (Fin 3) ℂ), (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => F (i,0) t; U*Uᴴ = 1) ∧ (∀ i j : Fin 3, ∀ p q : Fin 2, (F*Fᴴ) (i,p) (j,q) = (F*Fᴴ) (j,p) (i,q)) ∧ (∀ i : Fin 3, ∀ p : Fin 2, ∀ t : Fin 4, G (i,p) t = ∑ a : Fin 3, T i a * F (a,p) t) := by let U0 : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t let C : Matrix (Fin 3) (Fin 3) ℂ := U0*U0ᴴ let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => (C i j).re have hX : (G*Gᴴ).IsHermitian := Matrix.isHermitian_mul_conjTranspose_self G obtain ⟨_, hreal⟩ := in767_ranknormalize_pt_hermitian_blocks (G*Gᴴ) hX hpt have hCreal : ∀ i j, star (C i j) = C i j := by intro i j simpa [C, U0, Matrix.mul_apply, Matrix.conjTranspose_apply] using hreal i j 0 have hR : R.map (algebraMap ℝ ℂ) = C := by ext i j have hh := hCreal i j apply Complex.ext <;> simp [R, Complex.ext_iff] at hh ⊢ <;> linarith obtain ⟨H, hHsym, hHunit, hH⟩ := hnorm R hpos obtain ⟨Hu, hHu⟩ := hHunit let J : Matrix (Fin 3) (Fin 3) ℝ := ↑(Hu⁻¹) have hJH : J * H = 1 := by rw [← hHu] exact Units.inv_mul Hu let E : Matrix (Fin 3) (Fin 3) ℂ := H.map (algebraMap ℝ ℂ) let D : Matrix (Fin 3) (Fin 3) ℂ := J.map (algebraMap ℝ ℂ) have hDE : D * E = 1 := by have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M.map (algebraMap ℝ ℂ)) hJH simp only [Matrix.map_mul, Matrix.map_one, map_zero, map_one] at hh exact hh have hEreal : ∀ i j, star (E i j) = E i j := by intro i j; simp [E] have hEherm : Eᴴ = E := by ext i j have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M i j) hHsym simpa [E, Matrix.conjTranspose_apply, Matrix.transpose_apply] using congrArg (algebraMap ℝ ℂ) hh have hEC : E*C*E = 1 := by have hh := congrArg (fun M : Matrix (Fin 3) (Fin 3) ℝ => M.map (algebraMap ℝ ℂ)) hH simp only [Matrix.map_mul, Matrix.map_one, map_zero, map_one] at hh change E * (R.map (algebraMap ℝ ℂ)) * E = 1 at hh rw [hR] at hh exact hh let F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ := fun ip t => ∑ i : Fin 3, E ip.1 i * G (i,ip.2) t let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => F (i,0) t have hUF : U = E*U0 := by ext i t; simp [U, F, U0, Matrix.mul_apply] refine ⟨F, D, ?_, ?_, ?_⟩ · change U * Uᴴ = 1 rw [hUF, Matrix.conjTranspose_mul, hEherm] simpa [C, Matrix.mul_assoc] using hEC · intro i j p q have hcongr (i j : Fin 3) (p q : Fin 2) : (F*Fᴴ) (i,p) (j,q) = ∑ a : Fin 3, ∑ b : Fin 3, E i a * (G*Gᴴ) (a,p) (b,q) * E j b := by change (∑ t : Fin 4, (∑ a : Fin 3, E i a * G (a,p) t) * star (∑ b : Fin 3, E j b * G (b,q) t)) = _ rw [in767_ranknormalize_four_column_gram_congruence] simp only [hEreal] rw [hcongr, hcongr] exact in767_ranknormalize_ppt_under_real_first_filter (G*Gᴴ) E hpt i j p q · intro i p t let Y : Matrix (Fin 3) (Fin 4) ℂ := fun j t => G (j,p) t change Y i t = (D * (E * Y)) i t rw [← Matrix.mul_assoc, hDE, Matrix.one_mul]private lemma in767_ranknormalize_real_gram_positive (U : Matrix (Fin 3) (Fin 4) ℂ) (hinj : Function.Injective U.vecMul) : (let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => ((U*Uᴴ) i j).re; R.PosDef) := by let C : Matrix (Fin 3) (Fin 3) ℂ := U*Uᴴ let R : Matrix (Fin 3) (Fin 3) ℝ := fun i j => (C i j).re have hC : C.PosDef := Matrix.PosDef.mul_conjTranspose_self U hinj have hRherm : R.IsHermitian := by apply Matrix.IsHermitian.ext intro i j have hh := congrArg Complex.re (hC.isHermitian.apply i j) simpa [R, C] using hh apply Matrix.PosDef.of_dotProduct_mulVec_pos hRherm intro x hx let xc : Fin 3 → ℂ := fun i => x i have hxc : xc ≠ 0 := by intro h apply hx ext i have hh := congrFun h i change (x i : ℂ) = 0 at hh exact_mod_cast hh have hp := (Complex.pos_iff.mp (hC.dotProduct_mulVec_pos hxc)).1 have heq : star x ⬝ᵥ (R *ᵥ x) = (star xc ⬝ᵥ (C *ᵥ xc)).re := by simp [dotProduct, Matrix.mulVec, Fin.sum_univ_three, Complex.mul_re, R, xc] rw [heq] exact hpprivate lemma in767_ranknormalize_full_row_rank_vecmul_injective (U : Matrix (Fin 3) (Fin 4) ℂ) (hrank : U.rank = 3) : Function.Injective U.vecMul := by let f := U.transpose.mulVecLin have hdim : Module.finrank ℂ (Fin 3 → ℂ) = 3 := by simp [Module.finrank_pi] have hrange : Module.finrank ℂ (LinearMap.range f) = 3 := by change U.transpose.rank = 3 rw [Matrix.rank_transpose] exact hrank have hk := LinearMap.finrank_range_add_finrank_ker f rw [hrange, hdim] at hk have hker : LinearMap.ker f = ⊥ := Submodule.finrank_eq_zero.mp (by omega) have hf : Function.Injective f := LinearMap.ker_eq_bot.mp hker intro x y h apply hf simpa [f, Matrix.mulVec_transpose] using htheorem qutrit_ppt_full_rank_gram_normalization (G : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, (G*Gᴴ) (i,p) (j,q) = (G*Gᴴ) (j,p) (i,q)) (hrank : (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t; U.rank = 3)) (hnorm : ∀ R : Matrix (Fin 3) (Fin 3) ℝ, R.PosDef → ∃ H : Matrix (Fin 3) (Fin 3) ℝ, H.transpose = H ∧ IsUnit H ∧ H*R*H = 1) : ∃ (F : Matrix (Fin 3 × Fin 2) (Fin 4) ℂ) (T : Matrix (Fin 3) (Fin 3) ℂ), (let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => F (i,0) t; U*Uᴴ = 1) ∧ (∀ i j : Fin 3, ∀ p q : Fin 2, (F*Fᴴ) (i,p) (j,q) = (F*Fᴴ) (j,p) (i,q)) ∧ (∀ i : Fin 3, ∀ p : Fin 2, ∀ t : Fin 4, G (i,p) t = ∑ a : Fin 3, T i a * F (a,p) t) := by let U : Matrix (Fin 3) (Fin 4) ℂ := fun i t => G (i,0) t have hinj : Function.Injective U.vecMul := in767_ranknormalize_full_row_rank_vecmul_injective U hrank have hpos := in767_ranknormalize_real_gram_positive U hinj exact in767_ranknormalize_normalize_pt_gram_factor G hpt hpos hnorm