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

Proved

D1Bound5.PairLightAdaptivePrepared12.left_prefix_000_part02_checked

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

diophantine-tuplesnumber-theory

For prepared pair 12, left list, part 2, the selected-floor certificate succeeds for at most 35 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 PairLightPrepared12.sieve. Original heads 60 through 94; every head retains its complete original tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData12_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData12_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared12
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared12.left_prefix_000_part02_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared12.sieve 35
      (leftCached000.drop 60) (leftRows000.drop 60) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared12
end

Source

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

View graph