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