Five reindex rank One plus error
ProvedD1Bound5.five_reindex_rankOne_plus_errordiophantine-tuplesnumber-theory
The exact five-by-five block structure of a symmetric normalized root matrix. No invertibility or nonzero tuple hypotheses are needed.
Preamble
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_ProductFiveBlockDet_Definitions import Definitions.Def_D1Bound5_ProductFiveMatrixBridge_Definitions
Formal statement
section
open Matrix
namespace D1Bound5
theorem _root_.D1Bound5.five_reindex_rankOne_plus_error
(t : Fin 5 → ℂ) (E : Matrix (Fin 5) (Fin 5) ℂ)
(hdiag : E (Fin.natAdd 4 (0 : Fin 1)) (Fin.natAdd 4 (0 : Fin 1)) = 0)
(hsym : Eᵀ = E) :
Matrix.reindex (finSumFinEquiv : Fin 4 ⊕ Fin 1 ≃ Fin 5).symm
(finSumFinEquiv : Fin 4 ⊕ Fin 1 ≃ Fin 5).symm
(fun i j => t i * t j + E i j) =
productFiveIntegratedBlock
(fivePrefixError E) (fiveLastError E)
(fivePrefixValues t) (fiveLastValue t) := by sorry
end D1Bound5
end
Source
D1Bound5/ProductFiveMatrixBridge.lean, lines 25-72, SHA-256 8ea3704fb4c1308113f0fd79cdba0ca29b02390fb0ce0be51946ee093a9ecedc. Project: https://github.com/tomislav-math/d1-bound5-lean