Frontier scalar reduction
ProvedD1Bound5.frontier_scalar_reductiondiophantine-tuplesnumber-theory
Division-free form of the manuscript normalization: after setting τ=T/(ABS), the determinant bound becomes τ≤2Kτ²+LPτ+J.
Preamble
import Mathlib.Data.Real.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.GCongr import Mathlib.Tactic.Linarith import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.frontier_scalar_reduction (A B C T alpha beta K L Q : ℝ)
(ha : 0 < alpha) (hb : 0 < beta)
(hA : alpha ≤ A) (hB : beta ≤ B) (hC : beta ≤ C) (hT : 0 ≤ T)
(hK : 0 ≤ K) (hL : 0 ≤ L) (hQ : 0 ≤ Q)
(hupper : A*B*C*T ≤
2*K*(A^2+B^2+C^2+T^2)+L*(A*B+A*C+A*T+B*C+B*T+C*T)+Q) :
let tau := T/(A*B*C)
tau ≤ 2*K*tau^2+L*(2/(alpha*beta)+1/beta^2)*tau+
(2*K*(2/(alpha^2*beta^2)+1/beta^4)+
L*(1/(alpha^2*beta^2)+2/(alpha*beta^3))+Q/(alpha^2*beta^4)) := by sorry
end D1Bound5
end
Source
D1Bound5/FrontierScalarReduction.lean, lines 21-94, SHA-256 33d96b980c678c7382e88430524a158d0567c03ec5b878d5a113f1495c5b0528. Project: https://github.com/tomislav-math/d1-bound5-lean