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

Proved

D1Bound5.PairLightAdaptivePrepared1.right_prefix_001_checked

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

diophantine-tuplesnumber-theory

For prepared pair 1, right list, the selected-floor certificate succeeds for at most 220 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 τ = 0 and ν = 1, and the sieve is PairLightPrepared1.sieve. Heads 138 through 357; every head retains its entire tail.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData1_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData1Left_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared1
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared1.right_prefix_001_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared1.sieve 220
      rightCached001 rightRows001 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared1
end

Source

D1Bound5/SmallPairLightAdaptiveRight1_001.lean, lines 12-36, SHA-256 cace90b0234d7ef056c660e56b5e0fa75fb976b35a6b88d2ebb7610168eb857f. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph