Pair Residue Mask Nat Bool eq
ProvedD1Bound5.pairResidueMaskNatBool_eqdiophantine-tuplesnumber-theory
Exact equality with the accepted cached mask predicate for every input. No signature validity, residue bound, mask validity, or discriminant premise is needed. In particular, modulus one is included.
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.Finset.Prod import Mathlib.Data.Int.GCD import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt 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_PairCachedResidues_Definitions import Definitions.Def_D1Bound5_PairResidueMaskNat_Definitions
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.pairResidueMaskNatBool_eq (tau nu : ℤ) (k mask : ℕ) (u v : ℕ × ℕ) :
pairResidueMaskNatBool tau nu k mask u v = pairResidueMaskBool tau nu k mask u v := by sorry
end D1Bound5
end
Source
D1Bound5/PairResidueMaskNat.lean, lines 17-36, SHA-256 f838a6119a4b84b5889032242bf1d0b6ceb9a78264fea0197c14bf45d2cae39f. Project: https://github.com/tomislav-math/d1-bound5-lean