Coherent two vanishing regular equation
ProvedD1Bound5.coherent_two_vanishing_regular_equationdiophantine-tuplesnumber-theory
Vanishing of the two-anchor coherent form forces the precise regular-quadruple equation used in the proof of the strong two-anchor lemma. The argument does not divide by any square root, so zero roots are allowed.
Preamble
import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Insert import Mathlib.Data.Int.GCD import Mathlib.Data.Sym.Basic import Mathlib.Data.Sym.Card import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.LinearAlgebra.Lagrange import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.RingTheory.Binomial import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.coherent_two_vanishing_regular_equation
{F : Type*} [Field F] (a b p q Ra Rb z : F) (hab : a ≠ b)
(hRa : Ra ^ 2 = (a * p + 1) * (a * q + 1))
(hRb : Rb ^ 2 = (b * p + 1) * (b * q + 1))
(hz : z ^ 2 = p * q + 1)
(hL : Ra - Rb - (a - b) * z = 0) :
(a + b - p - q) ^ 2 = 4 * (a * b + 1) * (p * q + 1) := by sorry
end D1Bound5
end
Source
D1Bound5/CoherentTwoVanishing.lean, lines 5-23, SHA-256 3b9611037cfb35deff1d19449ec5b783d2b2588efa17cbfa510be1c3878acd11. Project: https://github.com/tomislav-math/d1-bound5-lean