Pair Light Prepared33 — sieve eq
ProvedD1Bound5.PairLightPrepared33.sieve_eqdiophantine-tuplesnumber-theory
Auxiliary result PairLightPrepared33.sieve_eq in the proof of the bound five for Diophantine D(1) sets in imaginary quadratic integer rings. The formal statement specifies its hypotheses and conclusion; a mathematical prose description remains to be supplied.
Preamble
import Init import Mathlib.Algebra.Order.Ring.Abs 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.Finset.Prod import Mathlib.Data.Int.GCD import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt import Mathlib.Data.List.Basic import Mathlib.Data.ZMod.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 import Definitions.Def_D1Bound5_SmallPairLightData33_Definitions_001 import Definitions.Def_D1Bound5_SmallPairSieve_1_2_Definitions
Formal statement
section namespace D1Bound5.PairLightPrepared33 set_option maxRecDepth 100000 set_option maxHeartbeats 0 theorem _root_.D1Bound5.PairLightPrepared33.sieve_eq : sieve = smallPairSieve_1_2 := by sorry end D1Bound5.PairLightPrepared33 end
Source
D1Bound5/SmallPairLightAssembly33.lean, lines 10-11, SHA-256 76857347ae551ebdc2c4e07e310b5ef7962ded7d07647a433ded34f81dcb9fb8. Project: https://github.com/tomislav-math/d1-bound5-lean