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

Proved

D1Bound5.PairLightAdaptivePrepared1.right_prefix_000_part02_checked

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

diophantine-tuplesnumber-theory

For prepared pair 1, right list, part 2, the selected-floor certificate succeeds for at most 22 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. Original heads 36 through 57, each compared with its entire remaining tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_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_000_part02_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared1.sieve 22
      (rightCached000.drop 36) (rightRows000.drop 36) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared1
end

Source

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

View graph