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

Proved

D1Bound5.PairLightAdaptivePrepared25.left_prefix_001_part00_checked

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

diophantine-tuplesnumber-theory

For prepared pair 25, left list, part 0, the selected-floor certificate succeeds for at most 38 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 PairLightPrepared25.sieve. Original heads 126 through 163, 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_SmallPairLightAdaptiveData25_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData25Left_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared25
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared25.left_prefix_001_part00_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared25.sieve 38
      (leftCached001.drop 0) (leftRows001.drop 0) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared25
end

Source

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

View graph