Selected-floor prefix certificate for prepared pair 13, left list

Proved

D1Bound5.PairLightAdaptivePrepared13.left_prefix_000_checked

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

diophantine-tuplesnumber-theory

For prepared pair 13, left list, the selected-floor certificate succeeds for at most 248 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 ν = 2, and the sieve is PairLightPrepared13.sieve. Heads 0 through 247; every head retains its entire tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData13_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData13_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared13
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared13.left_prefix_000_checked :
    pairLightSelectedFloorPrefixBool 0 2 PairLightPrepared13.sieve 248
      leftCached000 leftRows000 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared13
end

Source

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

View graph