Unit pair symmetric factorization
ProvedD1Bound5.unit_pair_symmetric_factorizationdiophantine-tuplesnumber-theory
The factorization in the symmetric-five obstruction for the pair {-1,1}. No root is assumed nonzero.
Preamble
import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Complex.Norm import Mathlib.Data.Finset.Card import Mathlib.Data.Int.GCD import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.unit_pair_symmetric_factorization
{R : Type*} [CommRing R] (a b x y v w : R)
(hx : x ^ 2 = 1 - b) (hy : y ^ 2 = 1 + b)
(hv : v ^ 2 = 1 - a * b) (hw : w ^ 2 = 1 + a * b) :
((2 * a ^ 2 * b ^ 2 - a ^ 2 - 1) - 2 * a * x * y * v * w) *
((2 * a ^ 2 * b ^ 2 - a ^ 2 - 1) + 2 * a * x * y * v * w) =
(a ^ 2 - 1) ^ 2 := by sorry
end D1Bound5
end
Source
D1Bound5/UnitPairSymmetric.lean, lines 9-21, SHA-256 695ec9ac631f60966fa825624a829a3fc795041a1c15a2f07c5f310997593968. Project: https://github.com/tomislav-math/d1-bound5-lean