Selected-floor prefix certificate for prepared pair 33, right list, part 0

Proved

D1Bound5.PairLightAdaptivePrepared33.right_prefix_001_part00_checked

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

diophantine-tuplesnumber-theory

For prepared pair 33, right list, part 0, the selected-floor certificate succeeds for at most 51 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 PairLightPrepared33.sieve. Original heads 138 through 188; 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_SmallPairLightAdaptiveData33_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData33_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared33
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared33.right_prefix_001_part00_checked :
    pairLightSelectedFloorPrefixBool 1 2 PairLightPrepared33.sieve 51
      (rightCached001.drop 0) (rightRows001.drop 0) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared33
end

Source

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

View graph