No regular large tail core
ProvedD1Bound5.no_regular_large_tail_corediophantine-tuplesnumber-theory
The analytic regular-tail contradiction. The only arithmetic input is that each nonzero ring element has complex modulus at least one.
Preamble
import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Data.Finset.Card import Mathlib.Data.Int.GCD import Mathlib.Data.Real.Basic import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.Ring
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.no_regular_large_tail_core {R : Type*} [CommRing R] [Nontrivial R]
(f : R →+* ℂ) (hn : ∀ s : R, s ≠ 0 → 1 ≤ ‖f s‖)
(a b c d r u0 v0 w0 : R)
(hr : r^2 = b*c+1) (hu0 : u0^2 = a*b+1)
(hv0 : v0^2 = a*c+1) (hw0 : w0^2 = a*d+1)
(hd : d = b+c+2*r)
(hA : 1 ≤ ‖f a‖) (hB : 3 ≤ ‖f b‖) (hC : 4 ≤ ‖f c‖)
(hAB : ‖f a‖ ≤ ‖f b‖) (hCD : ‖f c‖ ≤ ‖f d‖) : False := by sorry
end D1Bound5
end
Source
D1Bound5/TailAnalyticMain.lean, lines 9-149, SHA-256 ecaba9e1e964c7e6c51088002aaaf592031aa2393ee6eb52d94273cfda86b389. Project: https://github.com/tomislav-math/d1-bound5-lean