Symmetric zero four adjugate norm lt
ProvedD1Bound5.symmetric_zero_four_adjugate_norm_ltdiophantine-tuplesnumber-theory
The cofactor estimate holds for any symmetric zero-diagonal complex matrix, expressed without choosing or labelling its six entries.
Preamble
import Lean.Util.CollectAxioms import Mathlib.Analysis.CStarAlgebra.Matrix import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Analysis.InnerProductSpace.PiL2 import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.LinearAlgebra.Matrix.NonsingularInverse import Mathlib.LinearAlgebra.Matrix.Permutation import Mathlib.LinearAlgebra.Matrix.SchurComplement import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.FinCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_ProductFourNumericalClosure_Definitions
Formal statement
section
open scoped Matrix.Norms.L2Operator
open Matrix
namespace D1Bound5
theorem _root_.D1Bound5.symmetric_zero_four_adjugate_norm_lt
(F : Matrix (Fin 4) (Fin 4) ℂ)
(hzero : ∀ i, F i i = 0)
(hsym : ∀ i j, F i j = F j i)
(hnear : ∀ i j, i ≠ j →
‖F i j - (1/2 : ℂ)‖ < (128/8649 : ℝ)) :
‖F.adjugate‖ < productFourH * productFourS^2 := by sorry
end D1Bound5
end
Source
D1Bound5/AdjugateCoverage.lean, lines 80-100, SHA-256 f2847afb95c8defcb8c59c5324b1cbe3904cb7236a7d79d7d2486bba6b9076b4. Project: https://github.com/tomislav-math/d1-bound5-lean