Exists good symmetric root matrix with roots
ProvedD1Bound5.exists_good_symmetric_root_matrix_with_rootsdiophantine-tuplesnumber-theory
Simultaneously choose complex square roots of the four diagonal entries and integral signs of all six off-diagonal roots. The normalization is uniform without selecting an analytic square-root branch.
Preamble
import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_RootMatrixSigns_Definitions
Formal statement
section
namespace D1Bound5
end D1Bound5
namespace D1Bound5
end D1Bound5
namespace D1Bound5
theorem _root_.D1Bound5.exists_good_symmetric_root_matrix_with_roots
{R : Type*} [CommRing R] (f : R →+* ℂ)
(a : Fin 4 → R) (M : Matrix (Fin 4) (Fin 4) R)
(hdiag : ∀ i, M i i = a i)
(hsymm : ∀ i j, M i j = M j i)
(hroot : ∀ i j, i ≠ j → (M i j)^2 = a i * a j + 1)
(hlarge : ∀ i j, i ≠ j → 9 ≤ ‖f (a i) * f (a j)‖) :
∃ (u : Fin 4 → ℂ) (S : Matrix (Fin 4) (Fin 4) R),
(∀ i, (u i)^2 = f (a i)) ∧
(∀ i, S i i = a i) ∧
(∀ i j, S i j = S j i) ∧
(∀ i j, i ≠ j → S i j = M i j ∨ S i j = -M i j) ∧
(∀ i j, i ≠ j → (S i j)^2 = a i * a j + 1) ∧
(∀ i j, i ≠ j →
SignedEntryGood f (a i) (a j) (u i) (u j) (S i j)) := by sorry
end D1Bound5
end
Source
D1Bound5/RootMatrixSigns.lean, lines 121-146, SHA-256 ebdfe7f3d298bcbeeffe34affc4b69cd64eed73b495d78d2fa97d30c70560fcd. Project: https://github.com/tomislav-math/d1-bound5-lean