Selected-floor prefix certificate for prepared pair 29, left list, part 0

Proved

D1Bound5.PairLightAdaptivePrepared29.left_prefix_000_part00_checked

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

diophantine-tuplesnumber-theory

For prepared pair 29, left list, part 0, the selected-floor certificate succeeds for at most 24 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 ν = 1, and the sieve is PairLightPrepared29.sieve. Original heads 0 through 23, 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_SmallPairLightAdaptiveData29_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData29Left_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared29
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared29.left_prefix_000_part00_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared29.sieve 24
      (leftCached000.drop 0) (leftRows000.drop 0) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared29
end

Source

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

View graph