Pair Light Selected Floor Independent Bool eq prefix drop
ProvedD1Bound5.pairLightSelectedFloorIndependentBool_eq_prefix_dropdiophantine-tuplesnumber-theory
Exact factorization for all inputs, including malformed witness lists. The first factor checks each early head against its full tail.
Preamble
import Init import Mathlib.Data.List.Basic import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.pairLightSelectedFloorIndependentBool_eq_prefix_drop
(tau nu : Int) (sieve : List (Nat × Nat)) (n : Nat)
(cached : List PairLightCachedVertex) (rows : List (Nat × List Nat)) :
pairLightSelectedFloorIndependentBool tau nu sieve cached rows =
(pairLightSelectedFloorPrefixBool tau nu sieve n cached rows &&
pairLightSelectedFloorIndependentBool tau nu sieve (cached.drop n) (rows.drop n)) := by sorry
end D1Bound5
end
Source
D1Bound5/PairLightArithmeticChunkProofs.lean, lines 6-31, SHA-256 658b9d78aa5789e1a26cdcfc58f5960c552bb3ae7fdeda34961f362a081828a4. Project: https://github.com/tomislav-math/d1-bound5-lean