Selected-floor prefix certificate for prepared pair 40, right list, part 1

Proved

D1Bound5.PairLightAdaptivePrepared40.right_prefix_000_part01_checked

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

For prepared pair 40, right list, part 1, the selected-floor certificate succeeds for at most 32 head rows of the supplied cached vertex list. Each selected head is checked against its complete remaining tail, including vertices beyond the end of this chunk. The quadratic coordinate parameters are τ = 1 and ν = 2, and the sieve is PairLightPrepared40.sieve. Original heads 29 through 60; each retains its entire original tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData40_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData40_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared40
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared40.right_prefix_000_part01_checked :
    pairLightSelectedFloorPrefixBool 1 2 PairLightPrepared40.sieve 32
      (rightCached000.drop 29) (rightRows000.drop 29) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared40
end

Source

D1Bound5/SmallPairLightAdaptiveRight40_000Part01.lean, lines 7-11, SHA-256 078ce1da4870c7d90686c7a710ffd2b559a0b31f6500d34fbebe6513d66e32de. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph