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

Proved

D1Bound5.PairLightAdaptivePrepared2.left_prefix_000_checked

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

diophantine-tuplesnumber-theory

For prepared pair 2, left list, the selected-floor certificate succeeds for at most 207 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 PairLightPrepared2.sieve. Heads 0 through 206; every head retains its entire tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData2_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData2_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared2
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared2.left_prefix_000_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared2.sieve 207
      leftCached000 leftRows000 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared2
end

Source

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

View graph