`BookProof.ChapterReconstruct.offDiag_eq_zero_iff` (U : Fin n → Fin n → ℂ) (a : Fin n) : (∀ Ψ : Fin n → ℂ, offDiag U a Ψ = 0) ↔ IsDeterministicCol U a
ProvedBookProof.ChapterReconstruct.offDiag_eq_zero_ifftheoremstimepiece
Prove the following Lean 4 theorem from ChapterReconstruct.
BookProof.ChapterReconstruct.offDiag_eq_zero_iff (U : Fin n → Fin n → ℂ) (a : Fin n) : (∀ Ψ : Fin n → ℂ, offDiag U a Ψ = 0) ↔ IsDeterministicCol U a
Formalization note: Lean 4 identifier BookProof.ChapterReconstruct.offDiag_eq_zero_iff.
Preamble
-- Generated from ChapterReconstruct.lean — theorem BookProof.ChapterReconstruct.offDiag_eq_zero_iff
import Mathlib
import Definitions.Def_ChapterReconstruct
open BookProof.ChapterReconstruct
open scoped BigOperators
open Finset
variable {n : ℕ}Formal statement
theorem BookProof.ChapterReconstruct.offDiag_eq_zero_iff (U : Fin n → Fin n → ℂ) (a : Fin n) :
(∀ Ψ : Fin n → ℂ, offDiag U a Ψ = 0) ↔ IsDeterministicCol U a := by sorry